An optimization model for storage yard management in transshipment hubs

This paper studies a yard storage allocation problem in a transshipment hub where there is a great number of loading and unloading activities. The primary challenge is to efficiently shift containers between the vessels and the storage area so that reshuffling and traffic congestion is minimized. In particular, to reduce reshuffling, a consignment strategy is used. This strategy groups unloaded containers according to their destination vessel. To reduce traffic congestion, a new workload balancing protocol is proposed. A mixed integer-programming model is then formulated to determine the minimum number of yard cranes to deploy and the location where unloaded containers should be stored. The model is solved using CPLEX. Due to the size and complexity of this model two heuristics are also developed. The first is a sequential method while the second is a column generation method. A bound is developed that allows the quality of the solution to be judged. Lastly, a numerical investigation is provided and demonstrates that the algorithms perform adequately on most cases considered.     

An all-optical 2R regenerator using a compact self-seeded Fabry-Pe/spl acute/rot laser diode incorporated in a bidirectional EDFA

An all-optical 2R regenerator, based on a compact self-seeded Fabry-Pe/spl acute/rot laser diode with a 10-mm-long embedded fiber Bragg grating cavity, and a bidirectional erbium-doped fiber amplifier, is proposed and experimentally demonstrated to execute all-optical 2R regeneration at 10 Gb/s. Compared with the conventional 1R regeneration, the proposed scheme has achieved significant 6.4-dB improvement of power penalty at bit-error ratio =10/sup -9/ in the transmission experiment over 100-km standard single-mode fiber.     

A unified approach to multistage frequency-response masking filter design using the WLS technique

This paper presents a unified approach to the optimal design of sharp linear-phase finite-impulse-response (FIR) digital filters synthesized using the multistage frequency-response masking (FRM) technique. In this approach, the design of a k-stage FRM filter is achieved in a recursive manner. The minimax design problem arising at each step of the synthesis process is converted into a corresponding weighted least-squares (WLS) problem. The WLS problem is highly nonlinear with respect to the coefficients of the filter. Consequently, it is decomposed into several linear least-squares (LS) problems, each of which can be solved analytically. It is then solved iteratively by using an alternating variable approach. Numerical design examples are included to demonstrate the effectiveness of the method.     

1.55μm SiGe 2×3光开关

利用多模干涉效应和自由载流子等离子体色散效应设计和模拟了基于1.55μm波长的2×3 SiGe光开关.该光开关由两个单模输入端口、一个多模干涉区和三个单模输出端口构成.在多模干涉区,设有两个折射率调制区,可以利用来把从两个输入端口输入的光信号分别从三个输出端口输出.束传播法分析结果表明,该光开关的传输损耗小于1.43dB,串扰在-18～-32.8dB之间.     

Key Constraints Analysis with Integrated Production Scheduler

Project delays due to late availabilities of resource and information (RI) prerequisites are one of the major threats to construction management. It is desirable to avoid such delays through better means of constraint management. With most contemporary planning methodologies and tools, it is generally difficult to represent many hidden flow constraints in a construction work plan. However, evaluating the impact of flow constraints is crucial in determining their criticalities, based on which the flow constraints may be prioritized and consequently resolved to minimize project delays. Due to the fact that limited resources are often shared among various trades, it may not be practical to resolve all the constraints simultaneously so that a tradeoff is inevitable, which suggests that management should focus on the most important ones termed as key constraints (i.e., those directly contributing to project delays). This paper presents a methodology that augments the traditional critical path method with RI availability constraints to analyze the causes of delays and locate the key constraints binding on project completion without ambiguity based on the principles of the theory of constraints. The methodology of key constraint analysis has been implemented with the integrated production scheduler, a constraint-based scheduling tool which facilitates the modeling, analysis, and management of constraints at the production planning level. An illustrative example is depicted to demonstrate how the proposed methodology works.     

Automatic detection and tracking of moving image target with CNN‐UM via target probability fusion of multiple features

A high speed target detection and tracking algorithm for a CNN‐UM chip is presented in this paper. The target confidence value is computed based on the fusion of target existence probabilities of features using products of weighted sums. The target decision is done with such a confidence value and target initiation is done through the temporal accumulation of the confidence. The probability of the target existence for each feature is created in the region of influence depending on the reliability and the strength of the feature. By virtue of the analogic parallel processing structure of the CNN‐UM (Roska T, Chua LO. The CNN universal machine: an analogic array computer. IEEE Trans. Circuits Systems II 1993; CAS‐40 : 163–173), real time tracking can be achieved with presently available technologies with the speed of several kilo‐frames per second. Due to the utilization of multiple features of target, robust target detection is possible via the proposed algorithm. On‐chip experiments of the proposed target‐tracking algorithm have been done and properties of the proposed approach are disclosed through the various experiments. Copyright © 2003 John Wiley & Sons, Ltd.     

Fast image retrieval using color-spatial information

In this paper, we present an image retrieval system that employs both the color and spatial information of images to facilitate the retrieval process. The basic unit used in our technique is a single-colored cluster, which bounds a homogeneous region of that color in an image. Two clusters from two images are similar if they are of the same color and overlap in the image space. The number of clusters that can be extracted from an image can be very large, and it affects the accuracy of retrieval. We study the effect of the number of clusters on retrieval effectiveness to determine an appropriate value for “optimal' performance. To facilitate efficient retrieval, we also propose a multi-tier indexing mechanism called the Sequenced Multi-Attribute Tree (SMAT). We implemented a two-tier SMAT, where the first layer is used to prune away clusters that are of different colors, while the second layer discriminates clusters of different spatial locality. We conducted an experimental study on an image database consisting of 12,000 images. Our results show the effectiveness of the proposed color-spatial approach, and the efficiency of the proposed indexing mechanism. Received August 1, 1997 / Accepted December 9, 1997     

Capturing Attention When Attention "Blinks".

Four experiments addressed the question of whether attention may be captured when the visual system is in the midst of an attentional blink (AB). Participants identified 2 target letters embedded among distractor letters in a rapid serial visual presentation sequence. In some trials, a square frame was inserted between the targets; as the only geometric object in the sequence, it constituted a singleton. Capture effects obtained when the AB was most severe and when it was over were compared. There were 3 main results. First, capture occurred even when the AB was crippling, suggesting that a singleton exogenously engaged attention even when processing of a previous target was continuing apace. Second, when the singleton contained the key target feature, capture effects were clearly manifest. Third, even when the singleton did not possess the key target feature, it still succeeded in capturing attention, although the effects were both feeble and fleeting. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

PDM++: Planning Framework from a Construction Requirements Perspective

Construction requirements represent the key preconditions for construction. These include topological precedence, key resources, space requirements, etc. Consequently, identifying them is necessary for feasible construction planning to be achieved. Despite this, little attention has been given to the impact of construction requirements on a project schedule, possibly because of the lack of a good tool for representing these requirements. This paper distinguishes construction requirements into static and dynamic types, according to changes in the need of the requirement during its life cycle. A modeling framework, PDM++, is then proposed. The framework deals with schedule constraints arising from both static and dynamic construction requirements, provides greater semantic expression to capture schedule constraints unambiguously, and facilitates the representation of interdependent conditional relationships. The concept of meta-intervals is also devised to represent complex requirements involving several activities and schedule constraints, and it facilitates modeling at higher levels of plan abstractions. Finally, an illustrative case study is presented to show the applicability of PDM++ in representing schedule constraints and alternative scheduling from a construction requirements perspective.