Let the input to a computation problem be split between two processors connected by a communication link; and let an interactive protocol /spl pi/ be known, by which on any input, the processors can solve the problem ...
详细信息
Let the input to a computation problem be split between two processors connected by a communication link; and let an interactive protocol /spl pi/ be known, by which on any input, the processors can solve the problem using no more than T transmissions of bits between them, provided the channel is noiseless. We study the following question: if in fact there is some noise on the channel, what is the effect upon the number of transmissions needed in order to solve the communication problem reliably?.
We report on two types of results. The first is a study of the rate of decay of information carried by a signal which is being propagated over a noisy channel. The second is a series of lower bounds on the depth, size...
详细信息
We report on two types of results. The first is a study of the rate of decay of information carried by a signal which is being propagated over a noisy channel. The second is a series of lower bounds on the depth, size, and component reliability of noisy logic circuits which are required to compute some function reliably. The arguments used for the circuit results are information-theoretic, and in particular, the signal decay result is essential to the depth lower bound. Our first result can be viewed as a quantified version of the data processing lemma, for the case of Boolean random variables.
We show that any distributed protocol which runs on a noiseless network in time T, can be simulated on an identical noisy network with a slow-down factor proportional to log(d+1), where d is the maximum degree in the ...
详细信息
We show that any distributed protocol which runs on a noiseless network in time T, can be simulated on an identical noisy network with a slow-down factor proportional to log(d+1), where d is the maximum degree in the network, and with exponentially small probability of error. On every channel of our network we implement communications using tree codes.
An analytic model for an end-to-end acknowledgement and retransmission-based transport protocol with window flow control over a cell-based switch has been developed; acknowledgements are based on packets of multiple c...
详细信息
An analytic model for an end-to-end acknowledgement and retransmission-based transport protocol with window flow control over a cell-based switch has been developed; acknowledgements are based on packets of multiple cells. Using this model the effect of packet size, window size, and buffer size on the effective throughput or goodput of on overloaded system, where N such end-to-end sources are multiplexed onto a cell-switch, is investigated. It is shown that, for fixed window size either very small or very large packets will have better goodput. For large window and large packets, increasing the buffer size at the cell-switch will actually decrease the goodput in the overloaded case.
Hypersonic boundary-layer flow over a cold wall is considered with particular emphasis on the effect of the wall cooling on separation and stability of the hypersonic flow over a compression ramp. Numerical solutions ...
详细信息
Considers an on-line lot sizing problem with overtime. The authors develop a two-stage decision procedure for this problem. In the first stage an MLP classifies the decision situation. It is in this stage that uncerta...
详细信息
Considers an on-line lot sizing problem with overtime. The authors develop a two-stage decision procedure for this problem. In the first stage an MLP classifies the decision situation. It is in this stage that uncertainties are taken into account. The outcome of the first stage is used as input for the second stage, in which a detailed production plan is calculated. The proposed approach combines the classification and pattern recognition abilities of MLPs with traditional deterministic analysis. The authors give a brief introduction in MLPs and supervised learning and the on-line lot sizing problem is formulated. Based on results for the deterministic finite horizon problem the authors derive a two-stage strategy for the on-line lot sizing problem. Finally in they discuss some results.
We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed b...
详细信息
We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2/sup k/ configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/spl Sigma/ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits.
The purpose of this paper is to examine the problem of controlling a linear discrete-time system subject to input saturation in order to have its output track (or reject) a family of reference (or disturbance) signals...
详细信息
The purpose of this paper is to examine the problem of controlling a linear discrete-time system subject to input saturation in order to have its output track (or reject) a family of reference (or disturbance) signals produced by some external generator. It is shown that a semi-global framework, rather than a global framework, for this problem is a natural one. Within this framework, a set of solvability conditions are given and feedback laws which solve the problem are constructed. The theory developed in this paper parallels the one we developed earlier (1996) for the continuous-time system.
We consider a system of one-space-dimension equations describing the combustion of a splay of droplets for a laminar counterflow. The mathematical model is derived and the existence and uniqueness of a solution is pro...
详细信息
We consider a system of one-space-dimension equations describing the combustion of a splay of droplets for a laminar counterflow. The mathematical model is derived and the existence and uniqueness of a solution is proved by using a classical fixed point method. An asymptotic behaviour in time (representing the extinction of the flame) is obtained under restrictive conditions on the involved physical parameters. The influence of the size of the mean radius of the droplets is also investigated.
暂无评论