37409414
Algorithms for flow control and call set-up in multi-hop broadband ISDN
An algorithm for the decentralized control of traffic flow in multihop broadband ISDN and a concomitant algorithm for call setup are proposed. The approach in flow control is to strategically detain packets at points along their routes in anticipation of probable congestion ahead of them. The goal is to avoid buffer overflowing caused by concentrated packet accumulation at a single node on the network. A typical traffic control decision involves just two primitive operations: a READ and a logical AND. Hence, a submicrosecond execution time is expected. This quickness enables the traffic control to be implementable on the packet (or cell) level for broadband communications with a moderate packet size. This algorithm also strives for high utilization of broadband facilities and preserves the order among sequential packets. The concomitant algorithm for call setup is solely executed at the traffic originating node(s) and thus requires no internode communications. This leads to a simple process of calls setup that ensures the continuous flow of ongoing calls and, at the same time, avoids buffer overflowing.<<ETX>>
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.
45808479
Recursive Construction of Distributors by Merging
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.
36253673
A fuzzy goal programming approach to multi-objective optimization problem with priorities
Abstract In goal programming problem, the general equilibrium and optimization are often two conflicting factors. This paper proposes a generalized varying-domain optimization method for fuzzy goal programming (FGP) incorporating multiple priorities. According to the three possible styles of the objective function, the varying-domain optimization method and its generalization are proposed. This method can generate the results consistent with the decision-maker (DM)’s expectation, that the goal with higher priority may have higher level of satisfaction. Using this new method, it is a simple process to balance between the equilibrium and optimization, and the result is the consequence of a synthetic decision between them. In contrast to the previous method, the proposed method can make that the higher priority achieving the higher satisfactory degree. To get the global solution of the nonlinear nonconvex programming problem resulting from the original problem and the varying-domain optimization method, the co-evolutionary genetic algorithms (GAs), called GENOCOPIII, is used instead of the SQP method. In this way the DM can get the optimum of the optimization problem. We demonstrate the power of this proposed method by illustrative examples.
1042525
Unifying cognitive aging: From neuromodulation to representation to cognition
An integrative theory relating cognitive aging de"cits observed at the behavioral level with age-related de"ciency in neuromodulation causing less distinctive cortical representations is tested in a series of neural network simulations. Age-related attenuation of catecholaminergic function is simulated by lowering the mean gain of the processing unit, which subsequently reduces responsivity and raises intra-network activation variability. Age di!erences in learning rate, asymptotic performance, interference susceptibility, complexity cost, intra- and interindividual variability, and ability dedi!erentiation can all be modeled. Together, the simulations illustrate catecholamine’s role in regulating the "delity of neural information processing and subsequent e!ects leading to cognitive aging de"cits. ( 2000 Elsevier Science B.V. All rights reserved.
14078750
A Novel Hierarchical Approach to Image Retrieval Using Color and Spatial Information
A novel hierarchical approach to image retrieval is proposed. First, a color label histogram is used to effectively filter out the images that are not similar to the query image in color. The proposed color label histogram built by categorizing the pixel colors is computationally much more efficient compared to other approaches. Next, the class parameters of those images passing the first filter are used to identify the images similar to the query image in spatial layout. These class parameters are obtained automatically from the proposed unsupervised segmentation algorithm. Moreover, the wavelet decomposition coefficients are used to generate the initial partition for the segmentation algorithm. It doubles the segmentation performance. At the last stage, all images passing two filters are ranked based on the total normalized distance in color and spatial layout. The experiments show the effectiveness and efficiency of our approach.
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.