Results 1  10
of
1,282,697
Input ↓ Output → Agriculture Industry Services Total outputs
, 2003
"... This is a basic introduction to the inputoutput analysis, which was founded by Vassilii Leontiev in the 1930es. This explanation is based upon O’Connor and Henry (1975). 2 The inputoutput table The general structure of an inputoutput table is shown in figure 1. An inputoutput table is divided in ..."
Abstract
 Add to MetaCart
This is a basic introduction to the inputoutput analysis, which was founded by Vassilii Leontiev in the 1930es. This explanation is based upon O’Connor and Henry (1975). 2 The inputoutput table The general structure of an inputoutput table is shown in figure 1. An inputoutput table is divided
Increase the Total Output when Disturbances are Reduced in a Manufacturing System
"... Although reduction of disturbances may result in productivity increase, some of the presumed gain may be diverted to other disturbances. There is a need to develop methods that provide a better understanding of the causes and actions of disturbances in manufacturing systems. Discreteevent simulatio ..."
Abstract
 Add to MetaCart
of disturbances be thoroughly investigated before efforts are taken to eliminate disturbances and increase total output.
with SelfBoosted Switch Drivers and 1.2A Total Output Current
"... Minimizing power consumption in multiprocessor systems requires the use of multiple supplies with a wide range of regulated voltages and currents. Since one inductor per DCDC converter is expensive, there is an increasing interest in singleinductormultipleoutput (SIMO) DCDC converters. Recen ..."
Abstract
 Add to MetaCart
. Recent research results report a SIMO boost converter [1] and various boost or buck converters with two outputs [2, 3]. This 0.5µm CMOS system is a fouroutput, singleinductor buck converter with independent regulation of each output in the range 0 to (VDD – 0.500)V. The minimum and maximum total
The capacity region of the Gaussian multipleinput multipleoutput broadcast channel
 IEEE TRANS. INF. THEORY
, 2006
"... The Gaussian multipleinput multipleoutput (MIMO) broadcast channel (BC) is considered. The dirtypaper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequa ..."
Abstract

Cited by 331 (7 self)
 Add to MetaCart
The Gaussian multipleinput multipleoutput (MIMO) broadcast channel (BC) is considered. The dirtypaper coding (DPC) rate region is shown to coincide with the capacity region. To that end, a new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 395 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Specification Implementation States / Primary State Product Terms Literals Cycle Transitions In Out Vars Output Total Output Total Latency Time
, 1973
"... assignment (see table 1), and generates essential covers, offset covers and privileged pair sets for outputs and state variables. The logic minimization is performed by the exact logic minimizer described in the previous section. In the future research, we plan to extend the burst mode specificatio ..."
Abstract
 Add to MetaCart
assignment (see table 1), and generates essential covers, offset covers and privileged pair sets for outputs and state variables. The logic minimization is performed by the exact logic minimizer described in the previous section. In the future research, we plan to extend the burst mode
An Experimental Evaluation Of The Assumption Of Independence In MultiVersion Programming
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1986
"... Nversion programming has been proposed as a method of incorporating fault tolerance into software. Multiple versions of a program (i.e. "N") are prepared and executed in parallel. Their outputs are collected and examined by a voter,and, if they are not identical, it is assumed that the ma ..."
Abstract

Cited by 307 (12 self)
 Add to MetaCart
Nversion programming has been proposed as a method of incorporating fault tolerance into software. Multiple versions of a program (i.e. "N") are prepared and executed in parallel. Their outputs are collected and examined by a voter,and, if they are not identical, it is assumed
Requirements for Internet Hosts  Application and Support
 STD 3, RFC 1123, IETF
, 1989
"... This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. Distribution of this document is unlimited. Summary This RFC is one of a pair that defines and discusses the r ..."
Abstract

Cited by 319 (1 self)
 Add to MetaCart
This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. Distribution of this document is unlimited. Summary This RFC is one of a pair that defines and discusses the requirements for Internet host software. This RFC covers the application and support protocols; its companion RFC1122 covers the communication protocol layers: link layer, IP layer, and transport layer.
FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in LookupTable Based FPGA Designs
 IEEE TRANS. CAD
, 1994
"... The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Bo ..."
Abstract

Cited by 317 (41 self)
 Add to MetaCart
The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Boolean networks and little is known about how far their solutions are away from the optimal ones. This paper presents a theoretical breakthrough which shows that the LUTbased FPGA technology mapping problem for depth minimization can be solved optimally in polynomial time. A key step in our algorithm is to compute a minimum height Kfeasible cut in a network, which is solved optimally in polynomial time based on network flow computation. Our algorithm also effectively minimizes the number of LUTs by maximizing the volume of each cut and by several postprocessing operations. Based on these results, we have implemented an LUTbased FPGA mapping package called FlowMap. We have tested FlowMap on a large set of benchmark examples and compared it with other LUTbased FPGA mapping algorithms for delay optimization, including Chortled, MISpgadelay, and DAGMap. FlowMap reduces the LUT network depth by up to 7% and reduces the number of LUTs by up to 50% compared to the three previous methods.
Results 1  10
of
1,282,697