This paper presents a redundant multicast routing problem in multilayer networks that arises from large-scale distribution of realtime multicast data (e.g., Internet TV, videocasting, online games, stock quotes). Since these multicast services commonly operate in multilayer networks, the communications paths need to be robust against a single router or link failure as well as multiple such failures due to shared risk link groups (SRLGs). The main challenge of this multicast is to ensure the service availability and reliability using a path protection scheme, which is to find a redundant path that is SRLG-disjoint (diverse) from each working path. The objective of this problem is, therefore, to find two redundant multicast trees, each from one of the two redundant sources to every destination, at a minimum total communication cost whereas two paths from the two sources to every destination are guaranteed to be SRLG-diverse (i.e., links in the same risk group are disjoint). In this paper, we present two new mathematical programming models, edge-based and path-based, for the redundant multicast routing problem with SRLG-diverse constraints. Because the number of paths in path-based model grows exponentially with the network size, it is impossible to enumerate all possible paths in real life networks. We develop three approaches (probabilistic, non-dominated and nearly non-dominated) to generate potentially good paths that may be included in the path-based model. This study is motivated by emerging applications of internet-protocol TV service, and we evaluate the proposed approaches using real life network topologies. Our empirical results suggest that both models perform very well, and the nearly non-dominated path approach outperforms all other path generation approaches. 相似文献
In this paper, we propose a new pattern recognition method using feature feedback and present its application to face recognition.
Conventional pattern recognition methods extract the features employed for classification using PCA, LDA and so on. On the
other hand, in the proposed method, the extracted features are analyzed in the original space using feature feedback. Using
reverse mapping from the extracted features to the original space, we can identify the important part of the original data
that affects the classification. In this way, we can modify the data to obtain a higher classification rate, make it more
compact or abbreviate the required sensors. To verify the applicability of the proposed method, we apply it to face recognition
using the Yale Face Database. Each face image is divided into two parts, the important part and unimportant part, using feature
feedback, and the classification performed using the feature mask obtained from feature feedback. Also, we combine face recognition
with image compression. The experimental results show that the proposed method works well. 相似文献
This paper presents a study on improving the traversability of a quadruped walking robot in 3D rough terrains. The key idea is to exploit body movement of the robot. The position and orientation of the robot are systematically adjusted and the possibility of finding a valid foothold for the next swing is maximized, which makes the robot have more chances to overcome the rough terrains. In addition, a foothold search algorithm that provides the valid foothold while maintaining a high traversability of the robot, is investigated and a gait selection algorithm is developed to help the robot avoid deadlock situations. To explain the algorithms, new concepts such as reachable area, stable area, potential search direction, and complementary kinematic margin are introduced, and the effectiveness of the algorithms is validated via simulations and experiments. 相似文献
The optimal design of supply chain (SC) is a difficult task, if it is composed of the complicated multistage structures with component plants, assembly plants, distribution centers, retail stores and so on. It is mainly because that the multistage-based SC with complicated routes may not be solved using conventional optimization methods. In this study, we propose a genetic algorithm (GA) approach with adaptive local search scheme to effectively solve the multistage-based SC problems.The proposed algorithm has an adaptive local search scheme which automatically determines whether local search technique is used in GA loop or not. In numerical example, two multistage-based SC problems are suggested and tested using the proposed algorithm and other competing algorithms. The results obtained show that the proposed algorithm outperforms the other competing algorithms. 相似文献
We propose a precise position error compensation and low-cost relative localization method in structured environments using
magnetic landmarks and hall sensors. The proposed methodology can solve the problem of fine localization as well as global
localization by tacking landmarks or by utilizing various patterns of magnetic landmark arrangement. In this paper, we consider
two patterns of implanted permanent magnets on the surface, namely, at each vertex of regular triangles or rectangles on a
flat surface. We show that the rectangular configuration of the permanent magnetic bars is better for a robust localization
under sensor noise. For the experiments, permanent magnet sets in rectangular configuration are placed on the floor as landmarks
at regular intervals, and magnetic hall sensors are installed at the bottom of a mobile robot. In our implementation, the
accuracy after the error compensation is less than 1 mm in the position and less than 1° in the orientation. Due to the low
cost and accuracy of the proposed methodology, it would be one of the practical solutions to the pose error correction of
a mobile robot in structured environments. 相似文献
Surface texture is one of the important properties for the human to identify objects by touch. Effective reconstructions of
textures are necessary for realistic interactions between the human and environment via human–computer interfaces. This paper
presents a systematic approach for sensing and reconstructing periodic surface textures. Three significant issues are discussed:
a pen-type texture sensor that measures the spatial information based on the measurements of contact forces; an algorithm
for the reconstruction of periodic textures based on the obtained spatial information; and the method of incremental scanning
to identify the polar spectrum of a surface by limited number of scans. The concept of polar spectrum is introduced to describe
the spatial properties of the surface, that is, the relation between spatial frequencies and the direction of measurement.
The pattern of polar spectrum is used to facilitate surface reconstructions. Experimental results based on the spatial information
obtained with a laser displacement sensor and the pen-type texture sensor demonstrate the effectiveness of the proposed methods
for the measurement and reconstruction of periodic textures. 相似文献
Here we present a method for selectively and efficiently immobilizing antibodies to enhance the detection performance of surface plasmon resonance immune-sensors (SPRIs) for diagnostic applications. To improve the performance of antibody arrays, protein G was used as antibody-selective linkage layer with aldehyde functionalized poly-(para-xylylene) film. To estimate the efficiency of antibody immobilization, immunoglobulin G (IgG) was measured using the anti-IgG immobilized SPRIs. To demonstrate the proof-of-concept validation, the signal detected from the IgG using parylene-H film was compared with that of a combination of parylene-H and protein G in SPRIs. The results showed that the detection of IgG on the immobilized anti-IgG layer using the combination of parylene-H and protein G has a larger change of signal than that of using parylene-H layer. These results also imply that the anti-IgG was densely and efficiently immobilized on the modified surface with the linkage layer in a combination with parylene-H and protein G. Therefore, we believe that this combinatorial approach could selectively immobilize the antibodies, and also be applied for detection and diagnosis of immune diseases in the field of many SPRIs applications. 相似文献
In this technical note, we revisit the risk-sensitive optimal control problem for Markov jump linear systems (MJLSs). We first demonstrate the inherent difficulty in solving the risk-sensitive optimal control problem even if the system is linear and the cost function is quadratic. This is due to the nonlinear nature of the coupled set of Hamilton-Jacobi-Bellman (HJB) equations, stemming from the presence of the jump process. It thus follows that the standard quadratic form of the value function with a set of coupled Riccati differential equations cannot be a candidate solution to the coupled HJB equations. We subsequently show that there is no equivalence relationship between the problems of risk-sensitive control and H∞ control of MJLSs, which are shown to be equivalent in the absence of any jumps. Finally, we show that there does not exist a large deviation limit as well as a risk-neutral limit of the risk-sensitive optimal control problem due to the presence of a nonlinear coupling term in the HJB equations.