Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    CODING AND DISTANCE CALCULATING OF SEPARATELY RANDOM FRACTALS AND APPLICATION TO GENERATING RIVER NETWORKS

    Fractals01 Mar 2005

    This work develops a preliminary method for coding random self-similar patterns as a series of numbers and investigates the corresponding algorithm to calculate the topological distance between starting point and the link in the generated fractal pattern from the code series. With reference to the wide range of stochastic property in natural patterns, a process for generating fractal patterns with various generating probabilities of the pattern links denoted as separately random self-similar generation or separately random fractal is proposed. To assess the adaptability of the process, the coding method is applied to the generation of a random self-similar river network and the corresponding algorithm for calculating topological distance of the links is used to determine the width function of the pattern. The width function-based geomorphologic instantaneous unit hydrograph (WF-GIUH) model is then applied to estimate the runoff of the Po-bridge watershed in northern Taiwan. The results show that the separately random self-similar generating algorithm can be implemented successfully to calculate hydrologic responses.

  • articleNo Access

    A SIMPLE AND SECURE QUANTUM SECRET SHARING SCHEME BASED ON PRODUCT STATES

    Based on an orthogonal set of product states of two three-state particles, a new quantum secret sharing scheme is proposed, which uses a novel distribution strategy so that continuous and independent measurements, rather than particle-wise coordinated ones, are performed. As a result, it is convenient and efficient to implement. The scheme is also secure against several common attacks and gets rid of partial-information leakage due to the revised coding method. Moreover, the quantitative analysis shows that the security can be further improved by using more product states from appropriate multiple sets.