15793976
A New Sub-path Protection Algorithm Based on Auxiliary Virtual Topology in WDM Optical Networks
This paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (SPAVT) to tolerate the single-link failure in WDM optical networks. According to the protection-switching time constraint, SPAVT constructs the virtual topology. Then, it only needs to run one time of routing algorithm to find the feasible virtual route in virtual topology. Simulation results show that SPAVT has smaller blocking probability and lower time complexity than conventional algorithms.
7343144
A New Recovery Escalation Algorithm with Load Balancing and Backup Resources Sharing in Path Protected WDM Optical Networks
This paper proposes a new survivable algorithm, enhanced shared-path protection (ESPP), to tolerate multi-link failures in WDM optical networks. In ESPP, we consider the load balancing to reduce the blocking probability, use resources sharing to save backup resources, and perform recovery escalation to carry the affected traffic. Compared with the conventional algorithm, ESPP has better resource utilization ratio, lower blocking probability and higher protection ability. Simulation results are shown to be promising.
9609952
A survivable routing algorithm with differentiated domain protection based on a virtual topology graph in multi-domain optical networks
In this paper, we propose a novel differentiated domain protection (DDP) scheme to address survivability in multi-domain optical networks. Survivable routing in multi-domain networks is a challenging algorithmic problem because it requires choosing links that provide adequate protection both between domains and within domains that may offer different protection services. To satisfy the survivability requirements of different domains, DDP considers differentiated protection schemes, i.e., dedicated protection, shared protection, or no protection in different domains. In order to respect the principle of transparent management in multiple domains, DDP abstracts a multi-domain optical network to a virtual topology graph (VTG) for solving routing between domains. Simulation results show that DDP, unlike traditional schemes, can provide trade-off between protection methods and also allows better resource utilization.
16657537
Differentiated Domain Protection Algorithm Based on Virtual Topology Graph in Multi-Domain Optical Networks
This paper proposes a novel Differentiated Domain Protection (DDP) algorithm to address survivability in multi-domain optical networks. In order to ensure the principle of transparent management in multi-optical domains, DDP abstracts the multi-domain optical networks to Virtual Topology Graph (VTG) to solve the inter-domain routing. In order to satisfy the survivable requirements of different domains, DDP considers the differentiated protection in different domains. Compared with traditional algorithms, DDP not only has the performance trade-off ability but also has the better resource utilization ratio. Simulation results are shown to be promising.
12263549
Tree-guided Bayesian inference of population structures
MOTIVATION
Inferring population structures using genetic data sampled from a group of individuals is a challenging task. Many methods either consider a fixed population number or ignore the correlation between populations. As a result, they can lose sensitivity and specificity in detecting subtle stratifications. In addition, when a large number of genetic markers are used, many existing algorithms perform rather inefficiently.


RESULT
We propose a new Bayesian method to infer population structures using multiple unlinked single nucleotide polymorphisms (SNPs). Our approach explicitly considers the population correlation through a tree hierarchy, and treat the population number as a random variable. Using both simulated and real datasets of worldwide samples, we demonstrate that an incorporated tree can consistently improve the power in detecting subtle population stratifications. A tree-based model often involves a large number of unknown parameters, and the corresponding estimation procedure can be highly inefficient. We further implement a partition method to analytically integrate out all nuisance parameters in the tree. As a result, our method can analyze large SNP datasets with significantly improved convergence rate.


AVAILABILITY
http://www.stat.psu.edu/~yuzhang/tips.tar.
44325838
Simulating Wrinkles in Facial Expressions on an Anatomy-Based Face
This paper presents a muscle-driven wrinkle model for simulating dynamic wrinkles that appear during facial expressions, which is geometric in nature. Wrinkles are generated on an anatomy-based face model that incorporates a structure of skin, muscles and skull for physically-based animation. Corresponding to two types of facial muscles, a geometric model is developed to govern how the wrinkle amplitude evolves locally upon skin deformation, taking into account the properties of real wrinkles. During facial animation, wrinkles are generated in the local regions influenced by muscle contraction, simulating resistance to compression of tissues. Using our method, realistic wrinkles can be dynamically rendered on the adaptively refined face mesh at interactive rates.
18823520
A Pursuit-Evasion Algorithm Based on Hierarchical Reinforcement Learning
This paper proposed a pursuit-evasion algorithm based on the Option method from hierarchical reinforcement learning and applied it into multi-robot pursuit-evasion game in 2D-Dynamic environment. The algorithm efficiency is studied by comparing it with Q-learning. We decompose the complex task with option method, and divide the learning process into two parts: High-level learning and Low-level learning, then design a new mechanism in order to make the learning process perform parallel. The simulation result shows the Option algorithm can efficiently reduce the complexity of pursuit-evasion task, avoid traditional reinforcement learning curse of dimensionality, and improve the learning result.
21616351
Palmprint Recognition Using a Novel Sparse Coding Technique
This paper proposes a novel recognition method for palmprints using a new sparse coding (SC) algorithm proposed by us. This algorithm exploited the maximum Kurtosis as the sparse measure criterion, at one time, a fixed variance term of sparse coefficients is used to yield a fixed information capacity. Experimental results show that the feature basis vectors of palmprint images can be successfully extracted by using our SC algorithm. Using the radial basis probabilistic neural network (RBPNN), the classification task can be implemented easily. Finally, compared with methods of principal component analysis (PCA) and the classical SC, simulation results show that our algorithm is indeed efficient and effective in performing palmprint recognition task.
27052355
HFSM: Hierarchical Facial Shape Modeling Algorithm for Realistic Facial Expression Animation
We propose a hierarchical 3D facial modeling technique for realistic facial expression animation from the anatomical specification. We analyze the real human face to construct the facial model with a hierarchical biomechanical structure, incorporating a physically-based approximation to facial skin tissue, a set of anatomically-motivated facial muscle actuators and underlying skull structure. The deformable skin model has multi-layer structure to approximate different types of soft tissue. It takes into account the nonlinear stress-strain relationship of the skin and the fact that soft tissue is almost incompressible. Different kinds of muscle models have been developed to simulate the distribution of the muscle force exerted to the skin due to muscle contraction. The 3D face model incorporates a skull structure which extends the scope of facial motion and facilitates facial muscle construction. The facial muscle construction is achieved by a muscle mapping approach which efficiently locates facial muscles at the anatomically correct positions between the skin and skull layers. To generate facial expressions, the resulting hierarchical facial model is animated by solving the governing dynamic equation. For computational efficiency, we use a localized, semi-implicit integration method in the numerical simulation. The dynamic facial animation algorithm runs at an interactive rate and synthesizes various realistic facial expressions.