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.
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>>
45808479
Recursive Construction of Distributors by Merging
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.
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.
1883250
Accelerated, high-quality refraction computations for volume graphics
We present an efficient framework for the high-quality rendering of discretely sampled surface-based objects with refractive effects. This requires an accurate estimation of the refraction coefficients, paired with efficient and accurate surface detection, space traversal, and backdrop image sampling. Our framework achieves these goals, by employing a high-quality spline-based filter in conjunction with a novel filtered octree space decomposition with pre-classified cells that is carefully matched to the filter and voxel neighborhood characteristics. Here, we benefit greatly from the non-negativity of the B-spline kernel. Finally, we describe an innovative scheme that achieves the high quality of pixel super-sampling on a flat backdrop plane without the overhead of tracing the actual rays across the refractive object.
1290713
NMPP: a user-customized NimbleGen microarray data processing pipeline
UNLABELLED
NMPP package is a bundle of user-customized tools based on established algorithms and methods to process self-designed NimbleGen microarray data. It features a command-line-based integrative processing procedure that comprises five major functional components, namely the raw microarray data parsing and integrating module, the array spatial effect smoothing and visualization module, the probe-level multi-array normalization module, the gene expression intensity summarization module and the gene expression status inference module.


AVAILABILITY
http://plantgenomics.biology.yale.edu/nmpp
2501834
On the security of the Yen-Guo's domino signal encryption algorithm (DSEA)
Recently, a new domino signal encryption algorithm (DSEA) was proposed for digital signal transmission, especially for digital images and videos. This paper analyzes the security of DSEA, and points out the following weaknesses: (1) its security against the brute-force attack was overestimated; (2) it is not sufficiently secure against ciphertext-only attacks, and only one ciphertext is enough to get some information about the plaintext and to break the value of a sub-key; (3) it is insecure against known/chosen-plaintext attacks, in the sense that the secret key can be recovered from a number of continuous bytes of only one known/chosen plaintext and the corresponding ciphertext. Experimental results are given to show the performance of the proposed attacks, and some countermeasures are discussed to improve DSEA.
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.