ppxscal/embedding_network huggingface dataset:
Simultaneous Wire Permutation, Inversion, and Spacing with Genetic Algorithm for Energy-Efficient Bus Design
Authors: Shanq-Jang Ruan, Edwin Naroska, Uwe Schwiegelshohn
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12 (2005)

With decreasing feature size on silicon, the coupling capacitances of buses grow rapidly causing a significant impact on the power consumption of the whole chip. Thus, buses should be designed and optimized to dissipate less power without sacrificing performance. In this paper, we address this problem by simultaneously optimizing wire permutation, inversion and spacing (space between consecutive wires) using a combination of optimal as well as genetic algorithms. Unlike previous studies, our approach is applicable to not only address buses (behave more regularly), but also instruction buses of microprocessors. For the spacing problem, an algorithm is presented which determines the optimal solution instead of applying time consuming heuristic algorithms as presented in [Wire Placement for Crosstalk Energy Minimization in Address Bus]. For our experiments, we used instruction bus traces obtained from 12 SPEC2000 benchmark programs. We simulate different combinations among permutation, spacing, and inversion. Integrated all optimization techniques together, our approach can save energy up to 68% for the best case and 58% on average while only increasing the total wire space by about 50% (compared to a bus with minimal spacing between adjacent wires for a particular technology).
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Authors: Rainer Schuler
Venue: Journal of Algorithms (2005)

We consider the satisfiability problem on Boolean formulas in conjunctive normal form. We show that a satisfying assignment of a formula can be found in polynomial time with a success probability of 2-n(1-1/(1+logm)), where n and m are the number of variables and the number of clauses of the formula, respectively. If the number of clauses of the formulas is bounded by nc for some constant c, this gives an expected run time of O(p(n).2n(1-1/(1+clogn))) for a polynomial p.
Multispectral panoramic mosaicing
Authors: Udhav Bhosle, Sumantra Dutta Roy, Subhasis Chaudhuri
Venue: Pattern Recognition Letters (2005)

Image mosaicing overcomes the limitations of a camera's limited field of view by aligning and pasting suitably transformed frames in a sequence of overlapping images. This paper deals with multispectral mosaicing for enhancement of spectral information-information from the thermal infra-red (IR, hereafter) band and visible band images is directly fused at the pixel level. All subsequent operations can be carried out using the fused mosaic instead of the individually sensed images. We develop a geometric relationship between a visible band panoramic mosaic and an IR one. Our system uses a fast algorithm for automatic panoramic mosaicing. We show results of inter-band mosaic superposition in support of the proposed strategies.
An Architecture for Congestion Management in Ethernet Clusters
Authors: Gary McAlpine, Manoj Wadekar, Tanmay Gupta, Alan Crouch, Don Newell
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

Interconnects for clusters and bladed systems must deliver efficient throughput, low latency, low delay variations and minimal frame drops. The primary technical issues hindering Ethernet adoption for cluster and blade system interconnects are the current methods Ethernet switches use for dealing with congestion, which can happen frequently under cluster and blade system workloads. The common response to congestion is to drop frames and the common method of avoiding the need to drop frames is to utilize very large switch buffers. In this paper, we propose a three-level approach to dealing with congestion that provides efficient throughput, low latency, low delay variations, and can eliminate frame drops, even with very modest sized switch buffers. The approach employs three levels of congestion management: 1) improved link level transient congestion control; 2) oversubscription control at layer 2 subnet ingresses, and 3) end-to-end oversubscription control by the higher layer protocols. We present compelling simulation results showing the incremental benefits provided by each level.
atMOS: self expression movie generating system for 3G mobile communication
Authors: Satoru Tokuhisa, Taku Kotabe, Masa Inakage
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

This research focuses on movies as a new communication tool, and proposes a self expression movie generating system "atMOS". The purpose of this research is to encourage mobile movie communication. Therefore, this system adopts the concept of exchangeability, expressivity and reproducibility for mobile movie contents.In "atMOS", based on the sub-concept of "self packaging movie", users can make an original promotion movie of themselves which can be viewed on 3G cellular phones. Users can enjoy the original movie not only by themselves but also with other people by exchanging these movies as a communication tool, using the cellular phone.
Preemptive Behavior Analysis and Improvement of Priority Scheduling Algorithms
Authors: Xiaoying Wang, Hai Zhao, Wenbo Zhang, Zhenyu Yin
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

Most of embedded real-time systems only deploy necessary resources so that the extra preemption overheads among tasks debase the system performance terribly. Through scheduling process analysis of periodic task, this paper presents the waiting limit formula of each task in ready queue while guarantees its deadline. In addition, some properties such as final preempt time is deduced and the necessary condition of preemptive behavior of periodic tasks is quantitatively described. Based on them, a micro scheduling preempt model for periodic tasks in ready queue is put forward, which decreases preempt amount and optimizes system performance through change preempt relationship. The model cannot only decreases preempt amount effectively but enhances processor utilization for static priority scheduling algorithm such as rate monotonic scheduling, which is demonstrated by case study and simulation.
FraNtiC: A Fractal Geometric Framework for Mesh-Based Wireless Access Networks
Authors: Samik Ghosh, Kalyan Basu, Sajal K. Das
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The design of the access networks of next generation broadband wireless systems requires special attention in the light of changing network characteristics. In this paper, we present a mesh-based distributed radio access network (RAN) framework for future wireless systems. Using short, high bandwidth optical wireless links to interconnect the various network elements, we identify a generic fractal or self-similar structure in the network. A mathematical model for the framework is presented and the benefits of its scale-invariant properties on robustness, reliability and flexibility analyzed. We focus on three design parameters - carrier-class network reliability, network exposure due to failure conditions and system cost. The dynamics of these parameters on our proposed architecture are studied and compared against existing access network topologies like tree/ring and square-grid. The generality and recursive nature of our framework lends itself to be applied in interconnecting various heterogeneous broadband wireless access networks of the future.
Approaching problem solving type behavior via the psychological process of instrumental conditioning
Authors: Alan E. Filsinger
Venue: Issue 77 (July 1981) (1981)

One approach to the study of AI is to observe how animals and man solve problems requiring some degree of thought and use of intelligence. The psychological models that are then derived, can next be expressed in computer models. In short, this is the "psychological approach to AI."
On-chip power distribution grids with multiple supply voltages for high performance integrated circuits
Authors: Mikhail Popovich, Eby G. Friedman, Michael Sotman, Avinoam Kolodny
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Multiple supply voltages are often utilized to decrease power dissipation in high performance integrated circuits. On-chip power distribution grids with multiple supply voltages are discussed in this paper. A power distribution grid with multiple supply voltages and multiple grounds is presented. The proposed power delivery scheme reduces power supply voltage drops as compared to conventional power distribution systems with dual supplies and a single ground by 17% on average (20% maximum). For an example power grid with decoupling capacitors placed between the power supply and ground, the proposed grid with multiple supply and multiple ground exhibits, respectively, 13% and 18% average performance improvement. The proposed power distribution grid can be an alternative to a single supply voltage and single ground power distribution system.
Speckle-Constrained Filtering of Ultrasound Images
Authors: Karl Krissian, Ron Kikinis, Carl-Fredrik Westin, Kirby Vosburgh
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Ultrasound images provide the clinician with non-invasive, low cost, and real-time images that can help them in diagnosis, plannnig and therapy. However, although the human eye is able to derive the meaningful information from these images, automatic processing is very difficult because of the noise and artefacts present in the image. In this work, we propose to extend the current anisotropic diffusion technique to deal with the speckle noise present in the Ultra-sound images. To this end, we use a previously derived model of the noise, and we write the restoration scheme as a energy minization constrained by the noise model and parameters. This approach leads to a new data attachment term whose optimal weight can be automatically estimated.
Academic Computing in Asia
Authors: Ian Gordon
Venue: Social Science Computer Review (2005)

Academic computing in Asia is marked by a process of uneven development with the National University of Singapore clearly on the leading edge. This article provides a short overview of the use of information technology in Asian academic institutions and then a case study of its use at the National University of Singapore with a particular emphasis given to computer-mediated discussions.
30 years Department of Computing at the University of Rousse.: 5 years Academic Society of Computer Systems and Information Technology
Authors: Stoyanka Smrikarova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

As you know, this fifth international CompSysTech conference is dedicated to the 30th anniversary of the Department of Computer Systems and Technologies of Rousse University and to the 5th anniversary of the ACADEMIC SOCIETY OF COMPUTER SYSTEMS AND TECHNOLOGIES. On such occasions it is common practice to read lengthy and boring academic addresses which slowly but surely send the audience to sleep. We shall try to somehow depart from this tradition.
A capacity management service for resource pools
Authors: Jerry Rolia, Ludmila Cherkasova, Martin Arlitt, Artur Andrzejak
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Resource pools are computing environments that offer virtualized access to shared resources. When used effectively they can align the use of capacity with business needs (flexibility), lower infrastructure costs (via resource sharing), and lower operating costs (via automation). This paper describes the Quartermaster capacity manager service for managing such pools. It implements a trace-based technique that models workload (e.g., application) resource demands, their corresponding resource allocations, and resource access quality of service. The primary advantages of the technique are its accuracy, generality, support for resource access qualities of service, and optimizing search method. We pose general capacity management questions for resource pools and explain how the capacity manager helps to address them in an automated manner. A case study demonstrates and validates the method on empirical data from an enterprise application. We show that the technique exploits much of the resource savings to be achieved from resource sharing and is significantly more accurate at estimating per-server required capacity than a benchmark method used in practice to manage a resource pool. Finally, we explain how the problems relate to other practices regarding enterprise capacity management and software performance engineering.
Book review: Prolog for Programmers by Feliks Kluzniak and Stanislaw Szpakowicz (Academic Press)
Venue: Issue 103 (Jan., 1988) (1988)

Prolog for Programmers (PP) delivers what it promises by introducing Prolog to programmers from other languages; I know of no better introduction for this audience. (The dialect used is a slight variant of DEC-10 Prolog.) Yet even the experienced Prolog programmer can gain from PP's first-rate treatment of data structures, control, programming techniques, and implementation. The style is clear and concise, and a dry wit makes it fun to read. PP could be used as language text in an introductory Al course; for example, we have used it along with Genesereth and Nilsson's Logical Foundations of Artificial Intelligence. PP also addresses broader issues such as language extensibility with a chapter on definite-clause grammars; database with a case study of relational databases in Prolog; planning with an analysis of a STRIPS problem in WARPLAN; and implementation and optimization with a discussion of the authors' own Prolog interpreter. PP furnishes source for the interpreter and case studies in listings as well as on a floppy diskette. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Pacman game in Java
Authors: Aimee Wolons
Venue: Journal of Computing Sciences in Colleges (2005)

This game developed out of a final project in CS1 (First programming course in Java) for which I built a simple Pacman implementation with the maze, a Pac man and dots for the Pac man to eat. For this, I created a total of eight Pacman images, one of which is displayed depending on direction with alternating open/closed mouth. The Pacman moves around legal positions randomly and eats the dots. My professor (Dennis Higgins, SUNY Oneonta) was interested in this project and I continued working on it in a Modeling course. I next added a blue ghost and when he was successfully navigating the maze with random moves, I added several more ghosts of different colors. With checking to see if the game has ended (ghost catches Pacman or Pacman eats all of the dots) this second increment was completed. The final version supports "smart" ghosts, which use shortest path length checking to try to catch the Pacman. We also hope to add a joystick for interactivity. Although the most noticeable feature of the game is the graphics representation, the implementation involves multi-threading using synchronized methods and algorithms from CS2 (Data Structures).
A case study on the automated verification of groupware protocols
Authors: Maurice H. ter Beek, Mieke Massink, Diego Latella, Stefania Gnesi, Alessandro Forghieri, Maurizio Sebastianis
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We report on a fruitful combination of applying academic experience with formal modelling and verification techniques to an industrial case study. The goal of the case study was to investigate a priori, i.e. before implementation, the effects of adding a lightweight and easy-to-use publish/subscribe (event) notification service to thinkteam--an asynchronous and dispersed groupware system which was developed by think3. Researchers from the Formal Methods and Tools (FM&T) group of ISTI-CNR--with a longstanding experience in research on the development and application of formal methods, notations, and software tools for the specification, design, and verification of complex computer systems--therefore teamed up with think3--a global provider of integrated product development solutions that provides mechanical design and Product Data Management (PDM) software catering the product management needs of design processes in the manufacturing industry. The technical details of this joint research effort have been documented elsewhere, here we report on the lessons learned from this experience.
Design of an unmanned ground vehicle, bearcat III, theory and practice
Authors: Masoud Ghaffari, Souma M. Alhaj Ali, Vidyasagar Murthy, Xiaoqun Liao, Justin Gaylor, Ernest L. Hall
Venue: Journal of Robotic Systems (2004)

The purpose of this paper is to describe the design and implementation of an unmanned ground vehicle, called the Bearcat III, named after the University of Cincinnati mascot. The Bearcat III is an electric powered, three-wheeled vehicle that was designed for the Intelligent Ground Vehicle Competition and has been tested in the contest for 5 years. The dynamic model, control system, and design of the sensory systems are described. For the autonomous challenge line following, obstacle detection and pothole avoidance are required. Line following is accomplished with a dual camera system and video tracker. Obstacle detection is accomplished with either a rotating ultrasound or laser scanner. Pothole detection is implemented with a video frame grabber. For the navigation challenge waypoint following and obstacle detection are required. The waypoint navigation is implemented with a global positioning system. The Bearcat III has provided an educational test bed for not only the contest requirements but also other studies in developing artificial intelligence algorithms such as adaptive learning, creative control, automatic calibration, and internet-based control. The significance of this effort is in helping engineering and technology students understand the transition from theory to practice. &copy; 2004 Wiley Periodicals, Inc.
A knowledge-centric framework for process redesign
Authors: Kelly J. Fadel, Mohan Tanniru
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Research in the area of business process redesign has traditionally focused on performance metrics for measuring process change. However, from the perspective of an employee performing the business process, such measurements are inadequate because they fail to account for the knowledge change required for the employee to perform the new process. This paper explores process redesign from a knowledge perspective. We introduce the concept of a knowledge gap when a process is redesigned and, using theories of learning transfer, identify several process knowledge elements. A framework incorporating these knowledge elements can be used to assess knowledge change during process redesign. We illustrate the use of this framework in a case study, the process redesign at Campus Health department of a large public university.
Automatic Synthesis of System on Chip Multiprocessor Architectures for Process Networks
Authors: Basant Kumar Dwivedi, Anshul Kumar, M. Balakrishnan
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

In this paper, we present an approach for automatic synthesis of System on Chip (SoC) multiprocessor architectures for applications expressed as process networks. Our approach is targeted towards design space exploration (DSE) and thus the speed of synthesis is of critical interest. The focus here is on the problem of resource allocation and binding with a view to optimize cost under performance constraints. Our approach exploits adjacency relation of processes and uses a dynamic programming based algorithm to synthesize the architecture including interconnection network. We have done a number of experiments on real as well as randomly generated process networks. The results have been compared with an optimal MILP formulation. They conclusively show that this approach is fast as well as effective and can be employed for DSE.
Active Contours Using a Constraint-Based Implicit Representation
Authors: Bryan S. Morse, Weiming Liu, Terry S. Yoo, Kalpathi Subramanian
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a new constraint-based implicit active contour, which shares desirable properties of both parametric and implicit active contours. Like parametric approaches, their representation is compact and can be manipulated interactively. Like other implicit approaches, they can naturally adapt to non-simple topologies. Unlike implicit approaches using level-set methods, representation of the contour does not require a dense mesh. Instead, it is based on specified on-curve and off-curve constraints, which are interpolated using radial basis functions. These constraints are evolved according to specified forces drawn from the relevant literature of both parametric and implicit approaches. This new type of active contour is demonstrated through synthetic images, photographs, and medical images with both simple and non-simple topologies. For complex input, this approach produces results comparable to those of level set or parameterized finite-element active models, but with a compact analytic representation. As with other active contours they can also be used for tracking, especially for multiple objects that split or merge.
Pre-Scheduling
Authors: Weirong Wang, Aloysius K. Mok, Gerhard Fohler
Venue: Real-Time Systems (2005)

Static scheduling has been well accepted for its predictability and online simplicity. Traditional static schedule generation techniques are usually based on the assumption of constant rate of resource supply known at design time. Under resource composition schemes, however, this assumption may not be valid for a workload to be statically scheduled. A pre-schedule is a static schedule without assuming constant and completely predictable rate of resource supply. In this paper, concepts of supply function and supply contract are introduced to define the actual online resource supply rate and the constraints to this rate known off-line. Based on these concepts, this paper defines the pre-scheduling problem, and presents a sound, complete, and PTIME pre-scheduler.