ppxscal/embedding_network huggingface dataset:
User satisfaction with CBA computer LABS
Authors: Bo Markovic, Jim Wood
Venue: Journal of Computing Sciences in Colleges (2004)

This paper addresses the issue of user satisfaction with a computer lab in a university. Both formal and informal data gathering techniques were used to provide comprehensive data for this research. Data was gathered from both users and managers in order to provide a complete picture of the current situation. This data led to a research study of user satisfation among students and support staff. The research revealed that satisfaction with hours and software and hardware performance had the greatest impact on user satisfaction followed closely by quality of support staff.
An elementary fragment of second-order lambda calculus
Authors: Klaus Aehlig, Jan Johannsen
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

A fragment of second-order lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be noninterleaved and stratified, that is, the types are assigned levels, and a quantified variable can only be instantiated by a type of smaller level, with a slightly liberalized treatment of the level zero.
A Low-Power Reconfigurable Datapath for Advanced Speech Coding Algorithms
Authors: Konstantinos Katsoulakis, Tughrul Arslan, Tony Kirkham, Sami Khawam
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

The Algebraic Codebook Search (ACS) is a computationally intensive and time consuming process used in modern speech coding techniques such as the 3G mobile network. This paper presents a new low-power generic reconfigurable platform for the Algebraic Codebook Search (ACS) function. The proposed architecture performs the ACS in about 75x times less clock cycles when compared to previous generic and application specific DSP architectures. Furthermore it gives a significant reduction in power dissipation by a factor of 9.7x compared to a DSP while there is an area overhead by a factor of 3.5x.
Parallelization of IBD computation for determining genetic disease maps: Research Articles
Authors: Nouhad J. Rizk
Venue: Concurrency and Computation: Practice Experience (2004)

A number of software packages are available for the construction of comprehensive human genetic maps. In this paper we parallelize the widely used package Genehunter. We restrict our attention to only one function of the package, namely the computations of Identity By Descent (IBD) genes of a family. We use a master&ndash;slave model with the Message Passing Interface parallel environment. Our tests are done on two different architectures: a network of workstations and a shared memory multiprocessor. A new and efficient strategy to classify the parallelization of genetic linkage analysis programs results from our experiments. The classification is based on values of parameters which affect the complexity of the computation. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Handling Delay Sensitive Contents Using Adaptive Traffic-Based Control Method for Minimizing Energy Consumption in Wireless Devices
Authors: Constandinos X. Mavromoustakis, Helen D. Karatza
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

Transmission power control in mobile ad-hoc networks is a major issue for reliable end to end communication. Many researches have shown that the minimum transmission power that is required to keep the wireless network connected achieves the optimal throughput performance in wireless devices. By prolonging the network lifetime the overall performance substantially increases. Particularly when delay sensitive packets/multimedia streams are sent from a wireless device to another, the end to end communication must offer sufficient reliability and integrity. This paper describes a quantitative approach based on incoming traffic flow which bounds an asynchronous operation where each node evaluates dissimilar sleep-wake schedules. This scheme is entirely based on each node's incoming sleep-history traffic. Different sleep-wake schedules are continuously influenced for each node by packets and multimedia streams which are uniformly injected into the network. Simulation study is carried out for the energy conservation evaluation of the proposed model taking into account a number of metrics and estimation of the effects of incrementing the sleep time duration to conserve energy. Results show that the proposed method could be applied to infrastructureless networks to provide reliability for multimedia and delay sensitive packets without a significant increase in the power consumption.
Effective Computation of Biased Quantiles over Data Streams
Authors: Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Skew is prevalent in many data sources such as IP traffic streams. To continually summarize the distribution of such data, a high-biased set of quantiles (e.g., 50th, 90th and 99th percentiles) with finer error guarantees at higher ranks (e.g., errors of 5, 1 and 0.1 percent, respectively) is more useful than uniformly distributed quantiles (e.g., 25th, 50th and 75th percentiles) with uniform error guarantees. In this paper, we address the following two problems. First, can we compute quantiles with finer error guarantees for the higher ranks of the data distribution effectively, using less space and computation time than computing all quantiles uniformly at the finest error? Second, if specific quantiles and their error bounds are requested a priori, can the necessary space usage and computation time be reduced? We answer both questions in the affirmative by formalizing them as the "high-biased" and the "targeted" quantiles problems, respectively, and presenting algorithms with provable guarantees, that perform significantly better than previously known solutions for these problems. We implemented our algorithms in the Gigascope data stream management system, and evaluated alternate approaches for maintaining the relevant summary structures. Our experimental results on real and synthetic IP data streams complement our theoretical analyses, and highlight the importance of lightweight, non-blocking implementations when maintaining summary structures over high-speed data streams.
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes
Authors: V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We present provably efficient parallel algorithms for sweep scheduling on unstructured meshes. Sweep scheduling is a commonly used technique in Radiation Transport problems, and involves inverting an operator by iteratively sweeping across a mesh. Each sweep involves solving the operator locally at each cell. However, each direction induces a partial order in which this computation can proceed. On a distributed computing system, the goal is to schedule the computation, so that the length of the schedule is minimized. Several heuristics have been proposed for this problem; see and the references therein; but none of the heuristics have worst case performance guarantees. Here we present a simple, almost linear time randomized algorithm which (provably) gives aschedule of length at most O(log^2 n) times the optimal schedule for instances with n cells, when the communication cost is not considered, and a slight variant, which coupled with a much more careful analysis, gives a schedule of (expected) length O(logmlog log logm) times the optimal schedule for m processors. These are the first such provable guarantees for this problem. We also design a priority based list schedule using these ideas, with the same theoretical guarantee, but much better performance in practice. We complement our theoretical results with extensive empirical analysis. The results show that (i) our algorithm performs very well and has significantly better performance guarantee in practice and (ii) the algorithm compares favorably with other natural and efficient parallel algorithms proposed in the literature.
Modeling Operation and Microarchitecture Concurrency for Communication Architectures with Application to Retargetable Simulation
Authors: Xinping Zhu, Wei Qin, Sharad Malik
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

In multiprocessor based SoCs, optimizing the communication architecture is often as important as, if not more than, optimizing the computation architecture. While there are mature platforms and techniques for the modeling and evaluation of computation architectures, the same is not true for the communication architectures. A major challenge in modeling the communication architecture is managing the concurrency at multiple levels: at the operation level, multiple communication operations may be active at any time; at the microarchitecture level, several microarchitectural components may be operating in parallel. Further, it is important to be able to clearly specify how the operation level concurrency maps to the microarchitectural level concurrency. This paper presents a modeling methodology and a retargetable simulation framework which fill this gap. This framework seeks to facilitate the design space exploration of the communication sub-system through a rigorous modeling approach based on a formal concurrency model, the Operation State Machine (OSM). We first introduce the basic notions and concepts of OSM and show by example how this model can be used to represent the inherent concurrency in the architecture and microarchitecture of processors. Then we demonstrate the applicability of OSM in modeling on-chip communication architectures (OCAs) by walking though a router based packet switching network example and a bus example. Due to the fact that the OSM model is naturally suited to handle the operation and microarchitecture level concurrencies of OCAs as well, our OSM-based modeling methodology enables the entire system including both the computation and communication architectures to be modeled in a single OSM framework. This allows us to develop a tool set that can synthesize cycle-accurate system simulators for multi-PE SoC prototypes. To demonstrate the flexibility of this methodology, we choose two distinct system configurations with different types of OCA: a 4x4 mesh network of 16 PEs, and a cluster of 4 PEs connected by a bus. We show that by simulation, critical system information such as timing and communication patterns can be obtained and evaluated. Consequently, system-level design choices regarding the communication architecture can be made with high confidence in early stages of design. In addition to improving design quality, this methodology also results in significantly shortened design-time.
A New Parallel Kernel-Independent Fast Multipole Method
Authors: Lexing Ying, George Biros, Denis Zorin, Harper Langston
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions does not rely on any analytic expansions, but only utilizes kernel evaluations. The new method provides the enabling technology for many important problems in computational science and engineering. Examples include viscous flows, fracture mechanics and screened Coulombic interactions. Our MPI-based parallel implementation logically separates the computation and communication phases to avoid synchronization in the upward and downward computation passes, and thus allows us to fully exploit computation and communication overlapping. We measure isogranular and fixed-size scalability for a variety of kernels on the Pittsburgh Supercomputing Center's TCS-1 Alphaserver on up to 3000 processors. We have solved viscous flow problems with up to 2.1 billion unknowns and we have achieved 1.6 Tflops/s peak performance and 1.13 Tflops/s sustained performance.
On a numerical strategy to compute gravity currents of non-Newtonian fluids
Authors: D. Vola, F. Babik, J.-C. Latché
Venue: Journal of Computational Physics (2004)

This paper is devoted to the presentation of a numerical scheme for the simulation of gravity currents of non-Newtonian fluids. The two dimensional computational grid is fixed and the free-surface is described as a polygonal interface independent from the grid and advanced in time by a Lagrangian technique. Navier-Stokes equations are semi-discretized in time by the Characteristic-Galerkin method, which finally leads to solve a generalized Stokes problem posed on a physical domain limited by the free surface to only a part of the computational grid. To this purpose, we implement a Galerkin technique with a particular approximation space, defined as the restriction to the fluid domain of functions of a finite element space. The decomposition-coordination method allows to deal without any regularization with a variety of non-linear and possibly non-differentiable constitutive laws. Beside more analytical tests, we revisit with this numerical method some simulations of gravity currents of the literature, up to now investigated within the simplified thin-flow approximation framework.
Fusion of Vision and Inertial Data for Motion and Structure Estimation
Authors: S. G. Chroust, M. Vincze
Venue: Journal of Robotic Systems (2004)

This paper presents a method to fuse measurements from a rigid sensor rig with a stereo vision system and a set of 6 DOF inertial sensors for egomotion estimation and external structure estimation. No assumptions about the sampling rate of the two sensors are made. The basic idea is a common state vector and a common dynamic description which is stored together with the time instant of the estimation. Every time one of the sensor sends new data, the corresponding filter equation is updated and a new estimation is generated. In this paper the filter equations for an extended Kalman filter are derived together with considerations of the tuning. Simulations with real sensor data show the successful implementation of this concept. &copy; 2004 Wiley Periodicals, Inc.
Comparing the Performance of High-Level Middleware Systems in Shared and Distributed Memory Parallel Environments
Authors: Jik-Soo Kim, Henrique Andrade, Alan Sussman
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The utilization of toolkits for writing parallel and/or distributed applications has been shown to greatly enhance developer's productivity. Such an approach hides many of the complexities associated with writing these applications, rather than relying solely on programming language aids and parallel library support, such as MPI or PVM. In this work, we evaluate three different middleware systems that have been used to implement a computation and I/O-intensive data analysis application from the domain of computer vision. This study shows the benefits and overheads associated with each of the middleware systems, in different homogeneous computational environments and with different workloads. Our results lead the way toward being able to make better decisions for tuning the application environment, for selecting the appropriate middleware, and also for designing more powerful middleware systems to efficiently build and run highly complex applications in both parallel and distributed computing environments.
WHAT DO PROGRAMMERS REALLY LOOK AT IN A PROGRAM: A PILOT STUDY
Authors: Jean Scholtz, Julie Csoppenszky
Venue: ACM SIGCHI Bulletin (1991)

Program comprehension requires the programmers to discern program functionality from program code and comments. Different models of program comprehension have appeared in the literature. Regardless of which methodology is used, information must be extracted from the code.
SRA SOLOMON: MUC-4 test results and analysis
Authors: Chinatsu Aone, Doug McKee, Sandy Shinn, Hatte Blejer
Venue: Proceedings of the 4th conference on Message understanding (1992)

In this paper, we report SRA's results on the MUC-4 task and describe how we trained our natural language processing system for MUC-4. We also report on what worked, what didn't work, and lessons learned. Our MUC-4 system embeds the SOLOMON knowledge-based NLP shell which is designed for both domain-independence and language-independence. We are currently using SOLOMON for a Spanish and Japanese text understanding project in a different domain. Although this was our first year participating in MUC, we have built and are currently building other data extraction systems.
Using certified policies to regulate E-commerce transactions
Authors: Victoria Ungureanu
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

E-commerce regulations are usually embedded in mutually agreed upon contracts. Generally, these contracts enumerate agents authorized to participate in transactions, and spell out such things like rights and obligations of each partner, and terms and conditions of the trade. An enterprise may be concurrently bound by a set of different contracts that regulate the trading relations with its various clients and suppliers. This set is dynamic because new contracts are constantly being established, and previously established contracts end, are annulled, or revised.We argue that existent access control mechanisms cannot adequately support the large number of regulations embedded in disparate, evolving contracts. To deal with this problem we propose to use certified policies. A certified policy (CP) is obtained by expressing contract terms regarding access and control regulations in a formal, interpretable language, and by having them digitally signed by a proper authority. In this framework, an agent making a request to a server presents to the server such a CP, together with other relevant credentials. A valid certified policy can then be used as the authorization policy for the request in question.It is the thesis of this article that this approach would make several aspects of contract enforcement more manageable and more efficient: (a) deployment---certified policies may be stored on certificate repositories from where they can be retrieved as needed, (b) annulment---if a contract is annulled, the corresponding CP should be invalidated; the latter can be conveniently supported by certificate revocation, and (c) revision---revision of contract terms can be done by publishing a new certified policy and by revoking the old one. The proposed approach is practical in that it does not require any modification of the current certificate infrastructure and only minor modifications to servers.In this article, we propose a language for stating contract terms and present several formal examples of certified policies. We describe the implementation of the enforcement mechanism and present experimental performance results.
WSDL interface of services for distributed search in databases
Authors: Elena Ivanova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Service oriented architecture and two layers model of a service are described. WSDL technology is applied to implement a network interface of a service for distributed search in databases. Two Web Service architectures are proposed. An application with such a functionality is described.
GIS in hazard mitigation
Authors: Seth Dunn
Venue: Journal of Computing Sciences in Colleges (2004)

In order to meet the requirements of the Disaster Mitigation Act of 2000, the Waldo County Emergency Management Agency (EMA) has initiated the completion of a Waldo County Hazard Mitigation Plan. This plan will involve the hazard risk assessment for the 26 municipalities of Waldo County. A major share of this plan will entail the development of a Geographical Information System to illustrate the hazard vulnerabilities the municipalities possess. In January, 2003 this project expanded to map creation for three counties in Maine - Waldo, Hancock, and Knox (62 municipalities). A scope of services was created jointly by Dale Rowley, P. E. of the Waldo County EMA and Dr. Sari Hou. 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
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Venue: Symposium on Interactive 3D Graphics (2005)

You hold in your hands the proceedings of the 2005 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, held April 3-6, 2005 in Washington, DC. Established at a 1986 workshop held at the University of North Carolina, I3D has grown into a healthy long-running conference and a premiere forum for techniques that combine 3D computer graphics with human interaction. The papers in these proceedings reflect and continue that tradition. Of 95 submissions, 26 papers were accepted after long and careful deliberation by the international program committee. The number of submissions is on par with recent years and testifies to the continuing interest in, and importance of, interactive 3D research.I3D 2005 ushers in a number of changes designed to build on the strengths of the conference. We have extended the name to explicitly reflect the growing importance of games and the relevance of the conference to game developers, and added a game community liaison as an official conference committee position. Of course, the conference continues to focus on the hottest research in real-time rendering, interactive visualization and visual depiction, interactive modeling, user-assisted techniques, and applications of interactive 3D graphics. Many of the enclosed papers are directly relevant to game developers; these papers have been highlighted in your program. Over time we hope the conference will evolve to comprise even more game-relevant content and attract more high-quality papers on games research, while continuing to keep the high technical and scholarly standards for which I3D has become known.This year we also re-organized the program committee to enlarge its scope, increase international participation, and reduce the load on individual committee members. There was no physical meeting of the committee; instead, members were responsible for reviewing a small number of papers, reading the other reviewer's comments, and participating in an online discussion to choose the final papers.We have added tutorials to the I3D program in order to broaden the scope of the conference and attract additional attendees. We have also added a posters session for work in progress, small but interesting contributions, and research results of interest to the I3D community but not yet large enough or mature enough for a full paper.Most importantly, beginning in 2005 I3D will be held annually instead of bi-annually. The expanded scope and the consistently high number and quality of submitted papers argue that the time has come for the conference to go annual; at the same time, moving to a yearly schedule will make it easier for researchers to consistently include I3D in their publication plans. This year we meet in Washington, DC; in 2006 we will meet again in the San Francisco area at the Redwood City campus of Electronic Arts&mdash;an example of the generous corporate support that I3D needs to continue to garner if the conference is to stay healthy.