We consider the effect of multiple fibers on wavelength division multiplexing networks without wavelength conversion. We study networks with dynamic wavelength routing and develop accurate analytical models to compare various possible options using single- and multiple-fiber networks. We use results of an analytical model and simulation-based studies to evaluate the blocking performance and cost of multifiber networks. The number of fibers required providing high performance in multifiber networks and their costs are compared. A case is made for using multiple fibers in each link with fewer wavelengths instead of using a single fiber with many wavelengths. In particular, we show that a network with four fibers per link and with four wavelengths on each fiber without any wavelength conversion on any node yields similar same performance as the networks with one fiber per link and 16 wavelengths per fiber on each link and with full wavelength conversion capability on all nodes. In addition, the multifiber network may also offer the cost advantage depending on the relative cost of components. We develop a parametric cost model to show that multiple fibers in each link are an attractive option. Finally, such multifiber networks also has fault tolerance, with respect to a single fiber failure, already built into the system. 相似文献
This study aimed to better understand the impact of business trips on the traveler, the family, and the organization; to learn about maximizing the positive aspects of business travel; and to suggest measures to prevent and manage travel stress. Thirty-five business travelers (American, Israeli, and Swedish) were interviewed about the costs and benefits of their traveling, with a focus on gaining insight into coping strategies. Content analysis of the interviews showed that trips consist of 4 phases--(a) pretrip, (b) journey, (c) stay, and (d) posttrip--and that each phase is characterized by different coping strategies. Business travelers reported using proactive individual and organizational coping strategies in the pretrip phase and a combination of proactive and reactive coping strategies in the other phases. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
This paper proposes a method of exploring the local shape of an unknown object using the force and torque information obtained from active touch. In the first, we present a method to estimate an unknown curvature, using rolling and sliding motion with a force/torque sensor attached to the fingertip of the hand. Then, the normal curvature equation from 2D curvatures is obtained. Finally we present a reconstruction algorithm of local geometry by using a normal curvature equation, which is composed of principal curvatures and principal directions. The method is tested by using a hand-arm system consisting of an industrial robot arm and an anthropomorphic robot hand with 6-axis force/torque sensor. The feasibility of the proposed method is experimentally validated for objects with simple geometries such as cylinder, spheres etc. 相似文献
The metaheuristic optimization algorithms are relatively new optimization algorithms introduced to solve optimization problems in recent years. For example, the firefly algorithm (FA) is one of the metaheuristic algorithms inspired by the fireflies' flashing behavior. However, its weakness in terms of exploration and early convergence has been pointed out. In this paper, two approaches were proposed to improve the FA. In the first proposed approach, a new improved opposition-based learning FA (IOFA) method was presented to accelerate the convergence and improve the FA's exploration capability. In the second proposed approach, a symbiotic organisms search (SOS) algorithm improved the exploration and exploitation of the first approach; two new parameters set these two goals, and the second approach was named IOFASOS. The purpose of the second method is that in the process of the SOS algorithm, the whole population is effective in the IOFA method to find solutions in the early stages of implementation, and with each iteration, fewer solutions are affected in the population. The experiments on 24 standard benchmark functions were conducted, and the first proposed approach showed a better performance in the small and medium dimensions and exhibited a relatively moderate performance in the higher dimensions. In contrast, the second proposed approach was better in increasing dimensions. In general, the empirical results showed that the two new approaches outperform other algorithms in most mathematical benchmarking functions. Thus, The IOFASOS model has more efficient solutions.
The multiple view geometry of static scenes is now well understood. Recently attention was turned to dynamic scenes where scene points may move while the cameras move. The triangulation of linear trajectories is now well handled. The case of quadratic trajectories also received some attention. We present a complete generalization and address the problem of general trajectory triangulation of moving points from non-synchronized cameras. Two cases are considered: (i) the motion is captured in the images by tracking the moving point itself, (ii) the tangents of the motion only are extracted from the images. The first case is based on a new representation (to computer vision) of curves (trajectories) where a curve is represented by a family of hypersurfaces in the projective space ?5. The second case is handled by considering the dual curve of the curve generated by the trajectory. In both cases these representations of curves allow: (i) the triangulation of the trajectory of a moving point from non-synchronized sequences, (ii) the recovery of more standard representation of the whole trajectory, (iii) the computations of the set of positions of the moving point at each time instant an image was made. Furthermore, theoretical considerations lead to a general theorem stipulating how many independent constraints a camera provides on the motion of the point. This number of constraint is a function of the camera motion. On the computation front, in both cases the triangulation leads to equations where the unknowns appear linearly. Therefore the problem reduces to estimate a high-dimensional parameter in presence of heteroscedastic noise. Several method are tested. 相似文献