39573562
Binary Trees and Uniform Distribution of Traffic Cutback
Abstract This article introduces the notion of the External Left Length (ELL) of binary trees, which is analogous to the notion of the External Path Length (EPL), and derives theorems about the ELL which correspond to well-known facts about the EPL. Results are applied to the analysis of the optimization of an algorithm for the smooth traffic cutback in data communication.
45808479
Recursive Construction of Distributors by Merging
2426410
Network information flow
We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number of information sources are to be multicast to certain sets of destinations. We assume that the information sources are mutually independent. The problem is to characterize the admissible coding rate region. This model subsumes all previously studied models along the same line. We study the problem with one information source, and we have obtained a simple characterization of the admissible coding rate region. Our result can be regarded as the max-flow min-cut theorem for network information flow. Contrary to one's intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated. Rather, by employing coding at the nodes, which we refer to as network coding, bandwidth can in general be saved. This finding may have significant impact on future design of switching systems.
16159507
A scenario-based stochastic programming approach for technology and capacity planning
In response to market pressures resulting in increased competition, product proliferation and greater customization, firms in many industries have adopted modern technologies to provide operational flexibility on several dimensions. In this paper, we consider the role of product mix flexibility, defined as the ability to produce a variety of products, in an environment characterized by multiple products, uncertainty in product life cycles and dynamic demands. Using a scenario-based approach for capturing the evolution of demand, we develop a stochastic programming model for determining technology choices and capacity plans. Since the resulting model is likely to be large and may not be easy to solve with standard software packages, we develop a solution procedure based on augmented Lagrangian method and restricted simplicial decomposition. The scope of our approach for deriving context specific managerial insights is illustrated by the results of limited computations. Finally, we demonstrate the versatility of our approach by deriving a special case of the general model to address some tactical issues related to new product introduction.
15518182
Human-style interaction with a robot for cooperative learning of scene objects
In research on human-robot interaction the interest is currently shifting from uni-modal dialog systems to multi-modal interaction schemes. We present a system for human-style interaction with a robot that is integrated on our mobile robot BIRON. To model the dialog we adopt an extended grounding concept with a mechanism to handle multi-modal in- and output where object references are resolved by the interaction with an object attention system (OAS). The OAS integrates multiple input from, e.g., the object and gesture recognition systems and provides the information for a common representation. This representation can be accessed by both modules and combines symbolic verbal attributes with sensor-based features. We argue that such a representation is necessary to achieve a robust and efficient information processing.
20338082
Guaranteed Cost Control of Networked Control Systems: An LMI Approach
In this paper, networked control systems (NCS) is modeled as a discrete-time linear state-delayed system with norm-bounded uncertainty. Inspired by the so-called descriptor model transformation, a delay-dependent sufficient condition for the existence of a guaranteed cost controller for NCS is presented by a set of linear matrix inequalities (LMIs). The resulting controller can not only asymptotically stabilize the system but also guarantee an adequate level of performance. Theoretical analysis and illustrative results show that the control strategy presented in this paper is effective and feasible.
16791890
JComp: A Reuse-Driven Componentization Framework for Java Applications
Program componentization has been proved to be an effective way to increase the speed and cost-effectiveness of reusing, maintaining, and understanding existing software systems. JComp is a componentization framework that supports semi-automatically extracting reusable components from an existing Java system and automatically transforming the existing system into a component-based system. Based on the automated class dominance analysis and domain knowledge, JComp introduces a novel technique to incrementally identify reusable components in a low cost but high precision way. Also, JComp provides a methodology to automate the transformation of existing object-oriented systems into component-based systems
31495802
A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem
Among the modern heuristic methods, simulated annealing (SA) and genetic algorithms (GA) represent powerful combinatorial optimization methods with complementary strengths and weaknesses. Borrowing from the respective advantages of the two paradigms, an effective combination of GA and SA, called Genetic Simulated Algorithm (GASA), is developed to solve the job shop scheduling problem (JSP). This new algorithm incorporates metropolis acceptance criterion into crossover operator, which could maintain the good characteristics of the previous generation and reduce the disruptive effects of genetic operators. Furthermore, we present two novel features for this algorithm to solve JSP. Firstly, a new full active schedule (FAS) based on the operation-based representation is presented to construct schedule, which can further reduce the search space. Secondly, we propose a new crossover operator, named Precedence Operation Crossover (POX), for the operation-based representation. The approach is tested on a set of standard instances and compared with other approaches. The Simulation results validate the effectiveness of the proposed algorithm.