ppxscal/embedding_network huggingface dataset:
Interactive methods for effective particle visualization
Authors: Steven Parker
Venue:  (2006)

Particle-based simulation methods are used to model complex phenomena in many computational science and engineering applications. Effective visualization of the resulting state communicates subtle changes in the three-dimensional structure, spatial organization, and qualitative trends within the data as a simulation evolves, as well as enabling easier navigation and exploration of the data through interactivity. As particle-based simulations continue to grow in size and complexity, effective visualization becomes increasingly problematic. The sheer size of these datasets make interactive visualization a difficult task, while the intricacies of complex data are difficult to convey sensibly. This dissertation combines and extends knowledge in computer graphics, scientific visualization, and visual perception to enhance the ability to efficiently and effectively visualize particle-based simulation data. We first introduce two interactive visualization algorithms that render large, time-varying particle datasets at highly interactive rates on current and upcoming desktop computing platforms. Then, to motivate the use of effects from global illumination in particle visualization, we describe a psychophysical user study that examines the impact of two advanced shading models on the ability to detect subtle differences between particle configurations. Finally, we introduce two algorithms that make the use of effects from global illumination practical for an interactive particle visualization process. The results of this research demonstrate the feasibility of rendering large, time-varying particle datasets at highly interactive rates on desktop computer systems. The interactive visualization algorithms improve performance and make interactive systems more accessible. This dissertation also demonstrates both the importance and feasibility of using advanced shading models in an interactive particle visualization process. The user study shows that effects from global illumination can be perceptually beneficial, while the practical global illumination algorithms demonstrate that advanced shading models can be used in an interactive setting. The results show that the proposed algorithms enhance an investigator's ability to perform data analysis and feature detection tasks while maintaining the ability to interrogate large, time-varying datasets at interactive rates.
An Integrated Framework for At-Speed and ATE-Driven Delay Test of Contract-Manufactured ASICs
Authors: Vikram Iyengar, Kenneth Pichamuthu, Andy Ferko, Frank Woytowich, Dave Lackey, Gary Grise, Mark Taylor, Mike Degregorio, Steve Oakland
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

In contractmanufacturing, the circuit netlist is owned by the ASIC customer. The manufacturer is required to work strictly within the design structure established by the customer. To manufacture high-quality components in this environment, it is critical to meet the customer's mandated quality and performance criteria, while minimizing hardware overhead and introducing litle or no design change. In this paper, we present a test framework for contract-manufactured ASICs using low-cost testers. Key aspects of the framework are low hardware overhead, significant savings in test data volume and test cost, and tight integration of the at-speed and ATE-driven test components to the design and manufacturing process.
A fast tracking adaptive array system for mobile communications
Authors: H. Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In slowly time-varying fading channels, adaptive diversity combining can reduce multipath fading of desired signal and suppress interfering signals. However, for fast time-varying fading channels, there are no effective techniques to achieve the same results. The continued use of decision directed adaptive array algorithms on the fast fading channels will cause error propagation. This paper presents a novel adaptive diversity combining technique with proposed M-D decoder and QRD-RLS based parallel weights tracking. This system reduces error propagation in the decision directed array systems while maintaining the same tracking speed. Computer simulation has been performed to show the effectiveness and much better performance than that of the existing techniques.
The Texas Space Grant Multi-University Multi-Disciplinary Design Project
Authors: W. Fowler
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This project's primary objective is the improvement of engineering design education through the sharing of resources among universities within Texas. Student teams at nine universities have cooperated on the design of a small unmanned lunar lander that produces oxygen from lunar soil. The project is called the Lunar Oxygen Verification Experiment (LOVE project). Students at participating universities have designed different subsystems for the spacecraft. The strategy is to improve engineering design education at the smaller engineering schools by sharing resources, by facilitating regular student-to-student communications, and by providing student mentors for the design teams at the schools that do not have space design experience. A secondary goal is to use the project output as a starting point for an academia-industry cooperative proposal for a real mission. Results are encouraging, but there have been a number of problems that required attention. To combat these problems, the project has established its own Web site, where progress reports are filed, questions are answered, design reference material is archived, etc. There are several megabytes of student-written reference information on spacecraft design available to students on the site. Project procedures and results are discussed and the effectiveness of sharing resources is assessed from the vantage points of the different universities. The effectiveness of graduate and undergraduate students as team mentors is discussed, and the effect on students of knowing that there will be an end-of-semester presentation is assessed.
Global robust stability of neural networks with time varying delays
Authors: Wenwu Yu, Lingling Yao
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we study the global robust stability of neural networks with time varying delays using the Lyapunov functional method and matrix inequality technique. Several sufficient conditions are presented to show the existence of equilibrium and global robust stability of neural networks, which is easy to apply. Then we give a simulation to justify the obtained results.
Dependability in Software Component Deployment
Authors: Meriem Belguidoum, Fabien Dagnat
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The deployment of distributed systems is extremely complex. Indeed, software deployment faces significant problems of success and safety. These problems are due to the lack of a unified model, a global architecture for deployment and an explicit dependency representation among the target system and application components. Therefore, we advocate moving from an ad hoc approach to a structured, systematic and safe approach. In this paper, we propose a generic model and an architecture for a dependable deployment.
Interactive television and PC multimedia distance learning applications in corporate training
Authors: S. Prough
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Multi-national corporations are facing several challenges when deploying policies, methodologies and tools to their global workforce. Instructor travel is increasing the cost and time experts are away from their primary functions. Technology driven change to policies, methodologies and tools used by the global workforce is occurring at an increasingly rapid pace. An emerging solution to these problems is the utilization of existing telephone, video conferencing and computer networking equipment to implement training on policies, methodologies and tools. The authors present a literature survey of the current distance learning practices employed by major global corporations. Two cases are presented. One case highlights training delivered using multi-point video conferencing. The other case highlights training delivered using PC-based interactive conferencing. The cases demonstrate how a multi-national corporation used existing teleconferencing facilities to support interactive training delivery across the globe.
Federated search of text search engines in uncooperative environments
Authors: Luo Si
Venue: ACM SIGIR Forum (2007)

Conventional search engines like Google provide access to Web information that can be acquired easily by crawling hyperlinks. However, a large amount of information cannot be copied arbitrarily by conventional search engines. This type of hidden information, which is very valuable, can only be accessed via an alternative search model other than the centralized retrieval model used by conventional search engines.
Certifying program execution with secure processors
Authors: Benjie Chen, Robert Morris
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Cerium is a trusted computing architecture that protects a program's execution from being tampered while the program is running. Cerium uses a physically tamper-resistant CPU and a µ-kernel to protect programs from each other and from hardware attacks. The µ-kernel partitions programs into separate address spaces, and the CPU applies memory protection to ensure that programs can only use their own data; the CPU traps to the µ-kernel when loading or evicting a cache line, and the µ-kernel cryptographically authenticates and copy-protects each program's instructions and data when they are stored in the untrusted off-chip DRAM. The Cerium CPU signs certificates that securely identify the CPU and its manufacturer, the BIOS and boot loader, the µ-kernel, the running program, and any data the program wants signed. These certificates tell a user what program executed and what hardware and software environment surrounded the program, which are key facts in deciding whether to trust a program's output.
A root-MUSIC algorithm for non circular sources
Authors: P. Charge
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We present in this paper a new direction finding algorithm for non circular sources that is based on polynomial rooting. Due to the non circularity characteristics of the impinging sources, the proposed method is able to handle more sources than sensors. By using a polynomial rooting instead of a searching technique the method is limited to linear uniformly spaced arrays. However, polynomial rooting reduces significantly computation cost and enhances resolution power. Computer simulations are used to show the performance of the algorithm.
Design and implementation of QoS network controller for simple management of IP network to support multimedia services
Authors: Pao-Chi Chang
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

The support of QoS in the IP network is important to provide real-time applications like voice and video. But, the method in which the network uses to distinguish a real-time application and managing those service is one of the problem in supporting QoS in the IP network. The DiffServ is an efficient method of providing QoS capability without putting much burden to the network. The DiffServ architecture defines services in form of service level agreement (SLA), which is an agreement from the customer and service provider requesting differentiated service for the traffic to/from certain nodes. This paper presents a simple and practical method to provide flow based QoS service dynamically in the IP networks. The QoS controller manages the IP network to provide information for the real-time applications. Thus, the network can use that information to provide the needed QoS treatment for the pertaining flow.
The Strategic Impact of Service Oriented Architectures
Authors: Philipp Liegl
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

It has not been since the advent of the client/server architecture break through that an architectural concept has changed the face of enterprise systems so significantly as it has been done by service oriented architectures (SOA). The service oriented approach provides plenty of vantages for companies in regard to flexible system integration and adoption of new business cases. However, the adoption of SOA in an actual enterprise system brings along a couple of problems as well. Especially the integration into the existing infrastructure, applications and the innovation, sourcing and investment policies is challenging. A solution can be provided by establishing a SOA roadmap unveiling possible traps and pointing out the foibles and flaws still existing in the SOA approach. In this paper the SOA approach will be reviewed critically and the different sections affected within an enterprise will be examined. Possible problems during the transition and use of SOA will be identified. Where already possible, solutions will be provided. This paper is based on current research conducted during my PhD studies.
Games for training
Authors: Ralph E. Chatham
Venue: Communications of the ACM (2007)

DARPA simulations teach habits of thought so soldiers respond on the first day of combat as if they had been there a week. More often than not, it's don't shoot, talk instead.
Distributed Framework for Adaptive Explanatory Visualization
Authors: Tomasz D. Loboda, Atanas Frengov, Amruth N. Kumar, Peter Brusilovsky
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Educational tools designed to help students understand programming paradigms and learn programming languages are an important component of many academic curricula. This paper presents the architecture of a distributed event-based visualization system. We describe specialized content provision and visualization services and present two communication protocols in an attempt to explore the possibility of a standardized language.
Tackling an abstraction gap: co-simulating SystemC DE with bluespec ESL
Authors: Hiren D. Patel, Sandeep K. Shukla
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The growing SystemC community for system level design exploration is a result of SystemC's capability of modeling at RTL and above RTL abstraction levels. However, managing shared state concurrency using multi-threading in large SystemC models is error prone. A recent extension of SystemC called Bluespec-SystemC (BS-ESL) counters this difficulty with its model of computation employing atomic rule-based specifications. However, for simulating a model that is partly designed in SystemC and partly using BS-ESL, an interoperability semantics and implementation of such a semantics is required. This paper views the interoperability problem as an abstraction gap closure problem. To illustrate the problem, we formalize the simulation semantics of BS-ESL and discrete-event simulation of RTL SystemC and provide a solution based on this formalization.
Improving Wireless Access of Video Over the Internet
Authors: Jesse Steinberg, Joseph Pasquale
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Network flow buffering is the use of a simple remote flowregulating buffer that is dynamically deployed between a Web client and server to improve the performance of HTTP-based access and playback of video. We show that HTTP enhanced with network flow buffering performs well, especially under high packet loss and highly variable bandwidth conditions, when compared with using either straight HTTP or streaming. The benefits of network flow buffering are numerous, and include reducing interruptions to playback, maintaining high video-image quality, and decreasing client buffering requirements. Network flow buffering can be easily implemented using existing Web mechanisms.
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors
Authors: Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our technique solves relaxed versions of the problem and iteratively learns constraints to prune the solution space. Typical formulations suffer prohibitive run times even on medium-sized problems with less than 30 tasks. Our decomposition strategy enhances constraint optimization to robustly handle instances with over 100 tasks. Moreover, the extensibility of constraint formulations permits realistic application and resource constraints, which is a limitation of common heuristic methods for scheduling. The inherent extensibility, coupled with improved run times from a decomposition strategy, posit constraint optimization as a powerful tool for resource constrained scheduling and multiprocessor design space exploration.
Eigenmode analysis and degree of freedom in chaotic semi-stadium sound fields
Authors: Y. I. Fujisaka
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper describes eigenfrequency spacing statistics, including modal patterns and degrees of freedom, in a semi-stadium type 2D field. The authors investigated numerically the sound fields surrounded by 2D semi-stadium type of boundaries as examples of boundaries where chaotic properties are hidden. One limit of the semi-stadium boundaries is a rectangle which gives a regular field, while another limit is a stadium boundary where the chaotic property emerges. The numerical results show that eigenfrequency spacing in all the cases can be expressed as a family of /spl Gamma/ distributions extended to a non-integer degree of freedom. This fractal degree of freedom might be interpreted as the degree of freedom of the sound field. For the regular limit case, that is, a rectangular case, the distribution is the exponential distribution with a degree of freedom of unity, while in the chaotic case, that is, the stadium case, it is the Wigner distribution with a degree of freedom of two. Moreover, modal patterns clearly show breaks of the regular pattern of nodal lines seen in a rectangular case as the boundary is deformed from the rectangular to the stadium condition.
Dynamic measurement of polymorphism
Authors: Kelvin H. T. Choi, Ewan Tempero
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

Measuring "reuse" and "reusability" is difficult because there are so many different facets to these concepts. Before we can effectively measure reuse and reusability, we must first be able to effectively measure these different facets. One such facet is the programming language constructs that are available. For example whether or not a language supports polymorphism is believed to affect how reusable a developer can make a code artifact. Effectively measuring polymorphism is a challenge because its behaviour is only observable at run-time. In this paper, we present a metric for polymorphism based on the dynamic behaviour of the code. We evaluate the usefulness of the metric through two case studies.
Communication vs. Computation
Authors: Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, S. Venkatesh
Venue: Computational Complexity (2007)

We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is the following: Is there a computational task that exhibits a strong tradeoff behavior between the amount of communication and the amount of time needed for local computation?Under various standard assumptions, we exhibit Boolean functions that show strong tradeoffs between communication and time complexity in the following scenarios:Finally, we study a time-degree tradeoff problem that arises in arithmetization of Boolean functions, and relate it to time-communication tradeoff questions in multi-party communication complexity and cryptography.
Reorder buffer-occupancy density and its application for measurement and evaluation of packet reordering
Authors: Nischal M. Piratla, Anura P. Jayasumana, Abhijit A. Bare, Tarun Banka
Venue: Computer Communications (2007)

Increasing internal parallelism within nodes due to increase in links speeds, and external parallelism among the links due to QoS, ad hoc routing in wireless, etc., point to a significant increase in packet reordering. Application performance also degrades considerably due to out-of-order arrivals. The concept of ''Reorder Buffer-occupancy Density'' (RBD) is defined, which provides the statistics of occupancy of a buffer used to recover from reordering. RBD also captures and measures reordering effectively, helps relate causes of reordering to observations, and allows the development of models for packet reordering. A formal representation and analysis of reordering is presented along with the derivation of RBD models for basic reordering patterns, such as independent, overlapping and embedded reordering. Measurements associate most of the packet reordering occurrences in the Internet to such patterns. The RBD models for these patterns are used to build a buffer-occupancy model with a scenario associated with traffic splitting or bandwidth aggregation as an example. Such models can aid in determining the resource requirements for mitigating effects due to reordering, as well as performance characteristics of underlying network. Developed models are verified using measurements on emulated networks.
Identifying Changed Source Code Lines from Version Repositories
Authors: Gerardo Canfora, Luigi Cerulo, Massimiliano Di Penta
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Observing the evolution of software systems at different levels of granularity has been a key issue for a number of studies, aiming at predicting defects or at studying certain phenomena, such as the presence of clones or of crosscutting concerns. Versioning systems such as CVS and SVN, however, only provide information about lines added or deleted by a contributor: any change is shown as a sequence of additions and deletions. This provides an erroneous estimate of the amount of code changed. This paper shows how the evolution of changes at source code line level can be inferred from CVS repositories, by combining information retrieval techniques and the Levenshtein edit distance. The application of the proposed approach to the ArgoUML case study indicates a high precision and recall.