نتایج جستجو برای: flow paths

تعداد نتایج: 530756  

2006
Jan Gustafsson Andreas Ermedahl Björn Lisper

Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths. Such flow information can be provided as either as annotations by the user, can be autom...

Journal: :International Journal of Computer Applications 2014

Journal: :International Communications in Heat and Mass Transfer 2016

2015
Lucila M. S. Bento Davidson R. Boccardo Raphael Machado Vinícius G. P. de Sá Jayme Luiz Szwarcfiter

Control flow graphs represent the possible execution paths of a program and can be obtained by static analysis of software binaries. We give a formal characterization of the subclass of control flow graphs that correspond to structured code.

2007
Vassil Vassilev Mariana Nikolova Mariyana Vassileva

The Pareto Optimal set for the multicriteria network flow problem is described by the theorem for ParetoOptimal flow augmenting paths. An approach for determining of the unsupported integer PO solutions of the investigated problem is proposed.

Journal: :Vision Research 2005
Kathleen A. Turano Dylan Yu Lei Hao John C. Hicks

The impact of a central or peripheral visual field loss on the vision strategy used to guide walking was determined by measuring walking paths of visually impaired participants. An immersive virtual environment was used to dissociate the expected paths of the optic-flow and egocentric-direction strategies by offsetting the walker's point of view from the actual direction of walking. Environment...

1996
Robert B. Norwood Edward J. McCluskey

Orthogonal scan paths, which follow the path of the data flow, can be used in data path designs to reduce the test overhead — area, delay and test application time — by sharing functional and test logic. Orthogonal scan paths are orthogonal to traditional scan paths. Judicious ordering of the registers in the orthogonal scan path can allow the scan path to be implemented entirely with existing ...

2007
Shangming Zhu Zhili Zhang Xinhua Zhuang

Widest Disjoint Paths (WDP) algorithm is a promising multipath routing algorithm aimed at selecting good paths for routing a flow between a source-destination pair, where their bottleneck links are mutually disjoint. Nevertheless, the complexity of WDP algorithm is relatively high due to the fact that the good path selection process considers all available paths. To reduce its complexity, This ...

دمیری, ذبیح اله, شریفی, جواد, یاراحمدی, رسول,

Introduction: Nowadays, many modern industries require an environment with no contamination by particles and bacteria. An enclosed clean room environment is a place where parameters such as airborne particles, temperature, humidity, air pressure and air flow pattern is controlled. The aim of this study was to evaluate functional parameters of a clean room  in a selected pharmaceutical industry....

2017
Margaret A. Zimmer Brian L. McGlynn

Most field-based approaches that address runoff generation questions have been conducted in steep landscapes with shallow soils. Runoff generation processes in low relief landscapes with deep soils remain less understood. We addressed this by characterizing dominant runoff generating flow paths by monitoring the timing and magnitude of precipitation, runoff, shallow soil moisture, and shallow a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید