Results 271 to 280 of about 2,574,025 (316)
Some of the next articles are maybe not open access.
Flow functions, control flow functions, and the reach control problem
Automatica, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohamed K. Helwa, Mireille E. Broucke
openaire +1 more source
IEEE Transactions on Communications, 1981
The problem of optimally choosing message rates for users of a store-and-forward network is analyzed. Multiple users sharing the links of the network each attempt to adjust their message rates to achieve an ideal network operating point or an "ideal tradeoff point between high throughput and low delay." Each user has a fixed path or virtual circuit. In
openaire +1 more source
The problem of optimally choosing message rates for users of a store-and-forward network is analyzed. Multiple users sharing the links of the network each attempt to adjust their message rates to achieve an ideal network operating point or an "ideal tradeoff point between high throughput and low delay." Each user has a fixed path or virtual circuit. In
openaire +1 more source
The Control of Traffic Flow to Increase the Flow
Operations Research, 1960An operational study of tunnel-traffic flow is presented. A bottleneck within the tunnel is shown to cause shock waves which travel backward in the stream and continue to the entrance of the tunnel. Flow and density data at the bottleneck is fitted to a fluid model description of the flow.
Greenberg, Harold, Daou, Arthur
openaire +2 more sources
Controlling your control flow graph
2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST), 2016Code Reuse Attacks (CRAs) are software exploits in which an attacker directs program control flow through existing code without injecting malicious code to achieve his objective. In this paper, we propose Dynamic Sequence Checker (DSC), a framework to verify the validity of control flow between basic blocks in the program.
Arun K. Kanuparthi +2 more
openaire +1 more source
2014
We present a parameterized widening operator that determines the control-flow sensitivity of an analysis, i.e., its flow-sensitivity, context-sensitivity, and path-sensitivity. By instantiating the operator's parameter in different ways, the analysis can be tuned to arbitrary sensitivities without changing the abstract semantics of the analysis itself.
Ben Hardekopf +3 more
openaire +1 more source
We present a parameterized widening operator that determines the control-flow sensitivity of an analysis, i.e., its flow-sensitivity, context-sensitivity, and path-sensitivity. By instantiating the operator's parameter in different ways, the analysis can be tuned to arbitrary sensitivities without changing the abstract semantics of the analysis itself.
Ben Hardekopf +3 more
openaire +1 more source
Flow Control for Multiflow in HSPA+
2013 IEEE 77th Vehicular Technology Conference (VTC Spring), 2013Multiflow is a major enhancement envisioned as part of evolved HSPA. As 3GPP Release 11 is nearing its conclusion, Multiflow forms an integral element of the new set of standards. 3GPP compliant simulation studies from various stakeholders have shown a cell- edge throughput gain in the order of 40%.
Ali Yaver +3 more
openaire +2 more sources
Reconstructing control flow graph for control flow checking
2010 IEEE International Conference on Progress in Informatics and Computing, 2010In the space radiation environment, a large number of cosmic rays often lead to transient faults on the on-board computer. These transient faults result in data flow errors or control flow errors during program running. The present software implemented hardware fault tolerant technology mainly uses the signature analysis method to realize the control ...
null Jianli Li +2 more
openaire +1 more source
Power flow control and solutions with Dynamic Flow Controller
2008 IEEE Canada Electric Power Conference, 2008This paper presents two new methods for power flow calculation of power systems in presence of dynamic flow controller (DFC), which is a new member of FACTS controllers. In first method A new steady state model of DFC is introduced for the implementation of the device in the conventional Newton-Raphson power flow algorithm.
Roya Ahmadi +3 more
openaire +1 more source
Flow Control with (Min,+) Algebra
2010According to the theory of Network Calculus based on the (min,+) algebra, analysis and measure of worst-case performance in communication networks can be made easily. In this context, this paper deals with traffic regulation and performance guarantee of a network i.e. with flow control. At first, assuming that a minimum service provided by a network is
Le Corronc, Euriell +2 more
openaire +2 more sources
Flow Control Power is Nondecentralizable
IEEE Transactions on Communications, 1981Flow control in store-and-forward computer networks is appropriate for decentralized execution. A formal description of a class of "decentralized flow control algorithms" is given. The feasibility of maximizing power with such algorithms is investigated.
openaire +2 more sources