Multiple constraints-based QoS multicast routing: model and algorithms

Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.

Ant Colony Algorithm for Solving QoS Routing Problem

Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least\|cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss\|constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.

Addition Sequence Method of Scalar Multiplication of Elliptic Curve over OEF

A new elliptic curve scalar multiplication algorithm is proposed. Thealgorithm uses the Frobenius map on optimal extension field (OEF) and addition sequence We introducea new algorithm on generating addition sequence efficiently and also give some analysis about it.Based on this algorithm, a new method of computing scalar multiplication of elliptic curve over anOEF is presented. The new method is more efficient than the traditional scalar multiplicationalgorithms of elliptic curve over OEF. Thecomparisons of traditional method and the new method arealso given.

A Role-Based PMI Security Model for E-Government

We introduce the general AC( atlribure certificate), the role specificationAC and the rolt assignment AC We discuss the rolt-based PMI(Privilege Management Infrastructure)architecture. The role-based PMT(Public-Kty In-frastructure) secure model forE-govcrnment isresearehed by combining the role-bastd PMI with PKI architeclure (Public Key Infrastructure). Themodel has advantages of flexibility, convenience, less storage space and less network consumptionetc. We are going to ust iht secure modelin the E-govern-ment system.

Angular distribution of sputtered atoms induced by low-energy heavy ion bombardment

The sputtering yield angular distributions have been calculated based on the ion energy dependence of to- tal sputtering yields for Ni and Mo targets bombarded by low-energy Hg+ ion. The calculated curves show excellent agreement with the corresponding Wehner’s experimental results of sputtering yield angular distribution. The fact clearly demonstrated the intrinsic relation between the ion energy dependence of total sputtering yields and the sput- tering yield angular distribution. This intrinsic relation had been ignored in Yamamura’s papers (1981,1982) due to some obvious mistakes.

ELASTIC WAVEFIELD CALCULATION FOR HETEROGENEOUS ANISOTROPIC POROUS MEDIA USING THE 3-D IRREGULAR-GRID FINITE-DIFFERENCE

Basedonthe first-order Biot-equation with simplified coefficients,astaggered irregu- lar-grid finite difference method(FDM)is developed to simulate elastic wave propagation in 3-D heterogeneous anisotropic porous media.The ‘slow’P wave in porous media wave simulation is highly dispersive.Finer grids are needed to get a precise wavefield calculation for models with curved interface and complex geometric structure.Fine grids in a global model greatly increase computation costs of regular grids scheme.Irregular fine or coarse grids in local fields not only cost less computing time than the conventional velocity-stress FDM,but also give a more accu- rate wavefield description.A dispersion analysis of the irregular-grid finite difference operator has confirmed the stability and high efficiency.The absorbing boundary condition is used to elimi- nate artificial reflections.Numerical examples show that this new irregular-grid finite difference method is of higher performance than conventional methods using regular rectangular grids in simulating elastic wave propagation in heterogeneous anisotropic porous media.

Modified evolutionary algorithm for global optimization

A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase I. Adjustment strategy of steplength and intensive searches in Phase II are employed. The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.

A Dynamic Object Behavior Model and Implementation Based on Computational Reflection

A dynamic object behavior model based on computational reflection is proposed. This model consists of function level and meta level, the meta objects in meta level manage the base objects and behaviors in function level, including dynamic binding and unbinding of base object and behavior. We implement this model with RoleJava Language,which is our self linguistic extension of the Java Language.Meta Objects are generated automatically at compile\|time,this makes the reflecton mechanism transparent to programmers.Finally an example applying this model to a banking system is presented.

Methods for behavior descriptions of structure-complex Petri nets

Petri net language is a powerful tool for describing dynamic behaviors of physical systems. However, it is not easy to obtain the language expression for a given Petri net especially a structure-complex net. In this paper, we first analyze the behaviors of S-nets, which are structure-simple. With the decomposition method based on a given index function on the place set, a given structure-complex Petri net can be decomposed into a set of structure-simple S-nets. With the language relationships between the original system and the decomposed subnets, an algorithm to obtain the language expression of a given structure-complex net system is presented, which benefits the analysis of physical systems based on the Petri net language.

Semi-Fragile Watermarking for Copyright Protection and Image Authentication

In this paper, we propose a semi-fragile wattr-marking technology forcopyright protection and image authentication We transform the image into wavelet domain and groupthe four adjacent wavelet coefficients Utilizing the characteristics of the humanvisual system, weembed a digital signal into the average of the four adjacent wavelet coefficients since the mean hasbetter stability than single wavelet coefficient. This method neednt original image when extractsthe watermark. Experimental results show the effectiveness of this method which is robust to commonimage process and fragile to malicious attack.

A Grafted Genetic Algorithm for the Job-Shop Scheduling Problem

The standard genetic algorithm has limitations of a low convergence rate and premature convergence in solving the job-shop scheduling problem.To overcome these limitations,this paper presents a new improved hybrid genetic algorithm on the basis of the idea of graft in botany.Through the introduction of a grafted population and crossover probability matrix,this algorithm accelerates the convergence rate greatly and also increases the ability to fight premature convergence.Finally,the approach is tested on a set of standard instances taken from the literature and compared with other approaches.The computation results validate the effectiveness of the proposed algorithm.

Circle quorum system-based non-stop network service model

Rapid developments in network systems of business service have resulted in more reliance on distributed computing, typified by “subscriber/push” architectures. Unfortunately, frequent and unexpectable network failures were routine, and downtime was not in hours, but in days. High availability has become the most important factor decreasing business risk and improving Quality of Service. Cluster technology has solved the non-stop problem on Local Area Network. However, most technologies including cluster today fail to ensure the non-stop Internet service based on Routers. With good performance on high availability and fault tolerance, quorum systems are very suitable for application to distributed business service networks. In this work, we modeled and developed a non-stop Internet service system based on a new quorum system, circle quorum system, for Boston Mutual Fund Broker, US. With five protocols, it provided highly available data services for clients on Internet.

A Difference Hamiltonian Operator and a Hierarchy of Generalized Toda Lattice Equations

A difference Ha-miltonian operator with three arbitrary constants is presented. When the arbitrary constants -in the Hamiltonian operator are suitably chosen, a pair of Hamiltonian operators are given. The resulting Hamiltonian pair yields a difference hereditary operator. Using Magri scheme of bi-Hamiltonian formulation, a hierarchy of the generalized Toda lattice equations is constructed. Finally, the discrete zero curvature representation is given for the resulting hierarchy.

An improved form of the ELMS algorithm

ELMS algorithm is the first two-channel adaptive filtering algorithm that takes into account the cross-correlation between the two input signals. The algorithm does not preprocess input signals, so it does not degrade the quality of the speech. However, a lot of computer simulation results show that ELMS algorithm has a bad performance. The ELMS algorithm is analyzed firstly, then a new algorithm is presented by modifying the block matrix used in ELMS algorithm to approximate input signals self-correlation matrix. The computer simulation results indicate that the improved algorithm has a better behavior than the ELMS algorithm.

Robustness Proof on A United Watermarking Based on CRT Theorem

A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technology. On the base of describing the watermarkingembedding proceeding and analyzing the watermarking detection proceeding, a series of experiments isdone. The experiments emphasize on the method's robust proving and security analysis. And theexperiments show that the method can resistthe attacks of JPEG compress, geometry, noise and grayadjusting. The results of the experiments show that the method has a nice recognition of copyrightfor joint ownership.

A Geometrical Transformations Resistant Digital Watermarking Based on Quantization

A geometrical transformations resistant digital image watermarking based on quantization is described. Taking advantage of the rotation, scale and translation invariants of discrete Fourier transform (DFT), each watermark bit is embedded into each homocentric circles around the zero frequency term in DFT domain by quantizing the magnitude vector of Fourier spectrum. The embedded sequence can be extracted by “majority principles” without restoring to the original unmarked image. The experimental results show that the watermark is invisible and robust to any combination of geometrical transformations or common image processing techniques.

Tree Automaton Based Algorithms for Sub-Typing and inDOM Relations in XQuery

Proposed by W3C (World Wide Web Consortium), XQuery is a descriptive query language for XML structured data or documents. The specification of XQuery gives functional description of XQuery’s typing system, but doestn’t provide methods to judge the Sub-typing and inDOM relations in language compiling. In this paper, both of the two important relations: Sub-typing and inDOM, are described and analyzed. After some definitions of Tree Automaton, the judgment algorithms of these two relations are proposed. Key words XQuery - typing system - tree automata CLC number TP 301. 6 Biography: XIE Rong-chuan (1946-), male, Associate professor, research direction: database, internet information system.

WSAP： provide loss rate differentiation with active queue management

How to provide service differentiation in the Internet is a hot research topic. One proposal is to provide loss rate differentiation by assigning levels of dropprecedence to IP packets. This paper proposes a new Active Queue Management (AQM) mechanism, Weighted SAP (WSAP) to achieve this goal. WSAP is based on a new AQM algorithm called Simple Adaptive Proportional (SAP). WSAP can approximate proportional loss rate differentiation, while keeping high link utilization and short queuing delay. Compared with Weighted RED(WRED) and RED In and Out (RIO), WSAP is easier to configure and can provide better performance. Furthermore, an architecture for differentiated service is proposed. In the design of this architecture, more attention is paid to the characte of network traffic in the Internet and an attempt is made to preserve the Internet's oringinal design principles.

Incremental frequent tree-structured pattern mining from semi-structured data

The paper studies the problem of incremental pattern mining from semi-structrued data. When a new dataset is added into the original dataset, it is difficult for existing pattern mining algorithms to incrementally update the mined results. To solve the problem, an incremental pattern mining algorithm based on the rightmost expansion technique is proposed here to improve the mining performance by utilizing the original mining results and information obtained in the previous mining process. To improve the efficiency, the algorithm adopts a pruning technique by using the frequent pattern expansion forest obtained in mining processes. Comparative experiments with different volume of initial datasets, incremental datasets and different minimum support thresholds demonstrate that the algorithm has a great improvement in the efficiency compared with that of non-incremental pattern mining algorithm.