Results 251 to 260 of about 14,345,300 (303)
Some of the next articles are maybe not open access.
ACM SIGCOMM Computer Communication Review, 1982
The clear advantages inherent in dynamic sharing of resources has accelerated the development of distributed processing. The number of networks which provide resource sharing have increased steadily from the early years of ARPA network. As the number of users sharing the resources increases, there is a potential danger for degradation of services, if ...
openaire +2 more sources
The clear advantages inherent in dynamic sharing of resources has accelerated the development of distributed processing. The number of networks which provide resource sharing have increased steadily from the early years of ARPA network. As the number of users sharing the resources increases, there is a potential danger for degradation of services, if ...
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Flow Control Fallacies: A Review of Commonpitfalls in Flow Control Research
Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering, 2010The practice of flow control is seen as offering hope in reviving the importance of aerodynamics in aerospace engineering. However, as yet, this promising area of technology has arguably had little success in delivering science into practice. This article attempts to understand something of the nature of research in flow control and whether there is ...
Crowther, W. J.; id_orcid 0000-0002-0613-9375 +2 more
openaire +3 more sources
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
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 +2 more sources
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 +3 more sources