Estimation of intersection turning movements is one of the key inputs required for a variety of transportation analysis, including intersection geometric design, signal timing design, traffic impact assessment, and transportation planning. Conventional approaches that use manual techniques for estimation of turning movements are insensitive to congestion. The drawbacks of the manual techniques ...

This paper presents a short description of the high level and logic synthesis stages in the digital design automation system DIADES. High level design, namely data path synthesis and control unit synthesis start han a peralkl program-graph, the form of descriplon that includes both the control-flow and the data-flow graph. While the data path is allocated and scheduled, the control unit is desi...

The utilisation of certain blends based on supercritical CO2 (sCO2), namely CO2/TiCl4, CO2/C6 F6 and CO2/SO2, have been found to be promising for enhancing the performance power cycles Concentrated Solar Power (CSP) applications; allowing up a 6% enhancement in cycle efficiency with respect simple recuperated cycle, depending upon nature used blend configuration choice. This paper presents an i...

Michalis D. Galanis, Gregory Dimitroulakos, Costas E. Goutis VLSI Design Laboratory, ECE Dept., University of Patras, Greece e-mail: [email protected] Abstract. The speedups and the energy reductions achieved in a generic single-chip microprocessor system by employing a high-performance data-path are presented. The data-path acts as a coprocessor that accelerates computational intensive k...

A method and tool for logic design with data-flow and state-transition diagrams is presented. The method is based on object-oriented characterization and encapsulation of the control and timing requirements of combinational and sequential data-path units. The method makes it possible to use CASE (computer-aided software engineering) methods based on system-level semantics in conjunction with cu...

the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...

We design completely local, stateless, and self-stabilizing flow control mechanism to be executed by “greedy” agents associated with individual flow paths. Our mechanism is very natural and can be described in a single line: If a path has many “congested” edges, decrease the flow on the path by a small multiplicative factor, otherwise increase its flow by a small multiplicative factor. The mech...