15838609
Linear network coding
Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data before passing it on, the question involves optimization of the multicast mechanisms at the nodes. Among the simplest coding schemes is linear coding, which regards a block of data as a vector over a certain base field and allows a node to apply a linear transformation to a vector before passing it on. We formulate this multicast problem and prove that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
206817675
Independence numbers of graphs and generators of ideals
This article investigates the generators of certain homogeneous ideals which are associated with graphs with bounded independence numbers. These ideals first appeared in the theory oft-designs. The main theorem suggests a new approach to the Clique Problem which isNP-complete. This theorem has a more general form in commutative algebra dealing with ideals associated with unions of linear varieties. This general theorem is stated in the article; a corollary to it generalizes Turán’s theorem on the maximum graphs with a prescribed clique number.
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.
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
13110963
Dynamic Programming by Exchangeability
This article introduces the concept of exchangeable stopping time and a technique of dynamic programming based upon this concept for fast computation of the expected Value of a payoff function upon stopping. One instance of an exchangeable stopping time is when a stopping time is defined by a threshold on the sequential sum of the process. Another instance is when a stopping time is defined by the occurrence of given patterns in observed values of the process. This new computation technique has applications in bin packing, casino blackjack, and random drawing for patterns.
6751934
LUCY2: an interactive DNA sequence quality trimming and vector removal tool
UNLABELLED
Lucy2 is a raw DNA sequence trimming and visualization tool based on the popular command-line Lucy1. Users can change parameters, trim multiple sequences and visualize the results within an integrated, easy-to-use graphical user interface. Lucy2 is designed specifically for non-programmers to use, and is currently available on Windows, Linux and MacOS X. Source code is also available for porting to the other platforms.


AVAILABILITY
Lucy2 is distributed under the GNU General Public License and can be downloaded from www.complex.iastate.edu
8736073
Using Feature-Oriented Analysis to Recover Legacy Software Design for Software Evolution
Most design recovery approaches start from analysing source code. Nonetheless, it is very difficult to get adequate design information only depending on source code. Additional available information is required and Feature Oriented Analysis (FOA) is a way to reach this aim. FOA addresses the understanding of features in software systems and defines mechanisms for carrying a feature from the problem domain into the solution domain. Using feature as the first-class entity for software evolution can improve program comprehension and design recovery. In this paper, an approach is proposed to recover software design based on the feature model, which is a kind of legacy system knowledge. The features will first be located and mapped to the implementation module so that feature-oriented components can be identified and retrieved, and then, through the analysis of the feature relations, the design model of legacy system can be recovered and used for the future evolution.
10218510
Neural Network Based Feedback Scheduler for Networked Control System with Flexible Workload
Most control applications closed over a shared network are suffering from the time-varying characteristics of flexible network workload. This gives rise to non-deterministic availability of communication resources and may significantly impact the control performance. In the context of integrating control and scheduling, a novel feedback scheduler based on neural networks is suggested. With a modular architecture, the proposed feedback scheduler mainly consists of a monitor, a predictor, a regulator and an actuator. An online learning Elman neural network is employed to predict the network conditions, and then the control period is dynamically adjusted in response to estimated available network utilization. A fast algorithm for period regulation is employed. Preliminary simulation results show that the proposed feedback scheduler is effective in managing workload variations and can provide runtime flexibility to networked control applications.
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.
40576003
GloStra - a hybrid system for developing global strategy and associated Internet strategy
An intelligent hybrid system, called GloStra (developed by the author), for developing global marketing strategy and associated Internet marketing strategy is reported in this paper. The hybrid system is built to integrate the strengths of expert systems, fuzzy logic, artificial neural networks and decision support technology; and to link the development of global marketing strategy with the formulation of associated Internet marketing strategy. In the paper, the system architecture, the functional modules of the hybrid system and other associated technical issues are addressed. The directions for further research in this field are also highlighted.