ppxscal/embedding_network huggingface dataset:
A Semantic Recognizer Infrastructure for Computing Loop Behavior
Authors: Ali Mili, Tim Daly, Mark Pleszkoch, Stacy Prowell
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Next-generation software engineering is envisioned as a computational discipline that complements human capability through automated computation of software behavior and properties to the maximum extent possible. To help realize this vision, we are exploring the technology of function extraction. Behavior computation for sequences and alternations is relatively straightforward, but no general theory for loop computation can exist, and engineering solutions must be sought. This paper proposes an infrastructure for loop computation based on hierarchies of semantic recognizers operating within a refinement calculus, and outlines an extraction algorithm for computing loop behavior based on application of the recognizers.
Integrating Data and Quality Space Interactions in Exploratory Visualizations
Authors: Zaixian Xie, Matthew O. Ward, Elke A. Rundensteiner, Shiping Huang
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

Data quality is an important topic for many fields because real-world data is rarely perfect. Analysis conducted on data of variable quality can lead to inaccurate or incorrect results. To avoid this problem, researchers have introduced visual elements and attributes into traditional visualization displays to represent data quality information in conjunction with the original data. However, little work thus far has focused on creating an interactive interface to enable users to explicitly explore that data quality information. In this paper, we propose a framework for the linkage between data space and quality space for multivariate visualizations. Moreover, we introduce two novel techniques, quality brushing and quality-series animation, to help users with the exploration of this linkage. A visualization technique specifically designed for the quality space, called the quality map, is proposed as a means to help users create and manipulate quality brushes. We present some interesting case studies to show the effectiveness of our approaches.
A Graphical Language for Specifying and Analyzing Real-Time Systems
Authors: Hanêne Ben-Abdallah, Insup Lee
Venue: Integrated Computer-Aided Engineering (1998)

We present Graphical Communicating Shared Resources (GCSR), a formal language for the specification and analysis of real-time systems, including their functional, temporal and resource requirements. GCSR supports the explicit representation of system resources and priorities to arbitrate resource contentions. These features allow a designer to examine resource inherent constraints and to experiment with various resource allocations and scheduling disciplines in order to produce a more dependable specification. In addition, GCSR differs from other graphical languages through its well-defined notions of modularity and hierarchy: dependencies between system components, expressed as communication events, can have a limited scope of visibility, and control ow between components is clearly represented as either an interrupt or exception, i.e., voluntary release of control. Furthermore, GCSR has a precise operational semantics and notions of equivalence that allow the execution and formal analysis of a specification. We present the GCSR language, its toolset, and how properties, e.g., safety can be analyzed within GCSR.
Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Authors: Jie Yin, Junwei Cao, Yuexuan Wang, Lianchen Liu, Cheng Wu
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

While a grid represents a computing infrastructure for cross domain sharing of computational resources, the cyberinfrastructure, proposed by the US NSF Blue - Ribbon advisory panel, is expected to revolutionizing science and engineering by including more computer integrated resources, e.g. telescopes and observatories. As a part of the China national cyberinfrastructure for education and research, resource sharing of expensive scientific instruments is discussed in this work. A layered model of instrument pools is introduced and the process from submitting a job to instrument pools to obtaining results is analyzed. Fuzzy random scheduling algorithms are proposed in instrument pools when a job is submitted to one of instruments within a pool. The randomness lies in the probability which instrument could be chosen for an experiment and the fuzziness origins from vagueness of users' feedback opinions on experimental results. Users' feedback information is utilized to improve overall quality of service (QoS) of an instrument cyberinfrastructure. Several algorithms are provided to increase utilization of instruments providing higher QoS and decrease utilization of those with poor QoS. This is demonstrated in details using quantitative simulation results included in this paper.
Emergence in Problem Solving, Classification and Machine Learning
Authors: Joel Quinqueton
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

Emergence is usually the way in which a collective organisation behaves differently than the sum of its elements. We propose here an overview of different ways this paradgm is used in several fields of Artificial Intelligence and we propose some theoretical tracks relying on some works in thye field of Machine Learning.
Selecting and presenting writing assignments in engineering classes: tips for new professors
Authors: J. E. Sharp
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

This paper suggests possible writing assignments in engineering classes and some effective ways to present them. Types discussed are various reports, writing to learn, and other creative assignments. Ideas are drawn from experienced engineering professors and some technical writing professors through an informal survey of frequently assigned writing at Vanderbilt University Engineering School, published sources, and a personal collection of professors' writing assignments. 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
Impact of protocol overheads on network throughput over high-speed interconnects: measurement, analysis, and improvement
Authors: Hyun-Wook Jin, Chuck Yoo
Venue: The Journal of Supercomputing (2007)

Although extremely high-speed interconnects are available today, the traditional protocol stacks such as TCP/IP and UDP/IP are not able to utilize the maximum network bandwidth due to inherent overheads in the protocol stacks. Such overheads are a big obstacle for high-performance computing applications to exploit high-speed interconnects in cluster environments. To address this issue, many researchers have been presenting analyses of protocol overheads and suggesting a number of optimization approaches to harness the TCP/IP suite over high-speed interconnects. However, to the best of our knowledge, there is no study that analyzes and optimizes the protocol overheads thoroughly in an integrated manner. In this paper, we exploit a set of protocol optimization mechanisms in an integrated manner while dealing with the full spectrum of the protocol layers from the transport layer to the physical layer. To evaluate the impact of each protocol overhead, we apply the optimization mechanisms one by one and perform detailed analyses at each step. The thorough overhead measurements and analyses reveal the dependencies between protocol overheads. With our comprehensive optimizations, we show that UDP/IP can utilize more than 95% of the maximum network throughput a Myrinet-based experimental system can provide.
Synthetic designs: a new form of true experimental design for use in information systems development
Authors: Eric S. Lee, Thom Whalen
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Computer scientists and software engineers seldom rely on using experimental methods despite frequent calls to do so. The problem may lie with the shortcomings of traditional experimental methods. We introduce a new form of experimental designs, synthetic designs, which address these shortcomings. Compared with classical experimental designs (between-subjects, within-subjects, and matched-subjects), synthetic designs can offer substantial reductions in sample sizes, cost, time and effort expended, increased statistical power, and fewer threats to validity (internal, external, and statistical conclusion). This new design is a variation of within-subjects design in which each system user serves in only a single treatment condition. System performance scores for all other treatment conditions are derived synthetically without repeated testing of each subject. This design, though not applicable in all situations, can be used in the development and testing of some computer systems provided that user behavior is unaffected by the version of computer system being used. We justify synthetic designs on three grounds: this design has been used successfully in the development of computerized mug shot systems, showing marked advantages over traditional designs; a detailed comparison with traditional designs showing their advantages on 17 of the 18 criteria considered; and an assessment showing these designs satisfy all the requirements of true experiments (albeit in a novel way).
A scalable and explicit event delivery mechanism for UNIX
Authors: Gaurav Banga, Jeffrey C. Mogul, Peter Druschel
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

UNIX applications not wishing to block when doing I/O often use the select() system call, to wait for events on multiple file descriptors. The select() mechanism works well for small-scale applications, but scales poorly as the number of file descriptors increases. Many modern applications, such as Internet servers, use hundreds or thousands of file descriptors, and suffer greatly from the poor scalability of select(). Previous work has shown that while the traditional implementation of select() can be improved, the poor scalability is inherent in the design. We present a new event-delivery mechanism, which allows the application to register interest in one or more sources of events, and to efficiently dequeue new events. We show that this mechanism, which requires only minor changes to applications, performs independently of the number of file descriptors.
Experiments in topic indexing of broadcast news using neural networks
Authors: C. Neukirchen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The paper deals with the problem of extracting topic information from news show stories by statistical methods. It is shown that the traditional topic-dependent n-gram language modeling approach can be decomposed in order to apply neural networks for topic indexing. Two specific problems in training of these networks are addressed: a very sparse data distribution in the stories and the superposition of different topics in a story. The first problem is tackled by an integrated smoothing approach in the backpropagation method; an expansion of the neural network structure can be used to cope with topic mixtures in stories. Due to the efficient parameter sharing the application of neural networks results in a small improvement in topic indexing performance on a small corpus of broadcast news compared to the traditional topic-dependent n-gram method.
Initialization of hidden Markov models for unconstrained on-line handwriting recognition
Authors: K. Nathan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

In a hidden Markov model system, the initialization of the model parameters is critical to the performance of the model after retraining. This paper proposes a number of new approaches to the problem of initialization, and demonstrates that a method of smooth alignment results in the best performance.
A Hand-held Display Presenting Visual and Force Information
Authors: Hidenori Kuribayashi, Shoko Nakamura, Yuichiro Kume
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

A hand-held display presenting visual and force information is proposed. The display is constructed with an LCD panel and a moving weight. The forces applied to user's both hands holding the display are changed with the movement of the weight set on the backside of the display. The weight is moved by a PCcontrolled servo-motor. With the prototyped display, the force perception affected by the weight movement was psychophysically measured as a fundamental property. The users feel the force changes to the hands, sufficiently.
Cancellation of siren noise from two way voice communications inside emergency vehicles
Authors: R. S. Sherratt
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Sirens' used by police, fire and paramedic vehicles have been designed so that they can be heard over large distances, but unfortunately the siren noise enters the vehicle and corrupts intelligibility of voice communications from the emergency vehicle to the control room. Often the siren needs to be turned off to enable the control room to hear what is being said. This paper discusses a siren noise filter system that is capable of removing the siren noise picked up by the two-way radio microphone inside the vehicle. The removal of the siren noise improves the response time for emergency vehicles and thus save lives. To date, the system has been trialed within a fire tender in a non-emergency situation, with good results.
Heraclitus: A Framework for Semantic Web Adaptation
Authors: Alexander Mikroyannidis, Babis Theodoulidis
Venue: IEEE Internet Computing (2007)

The World Wide Web's constant growth and transformation offers great opportunities--and poses many challenges for exploitation. The Semantic Web has recently emerged as a possible answer to these challenges by proposing an approach in organizing and sharing the Web, but it doesn't explicitly consider user needs and requirements. Heraclitus is a framework for Semantic Web adaptation in which user needs and requirements are the driving force behind Web adaptation, using text and Web usage mining to support Web site ontology and topology evolution. The result is improved user interaction with the Semantic Web.
Design and implementation of a Linux SCSI target for storage area networks
Authors: Ashish Palekar, Narendran Ganapathy, Anshul Chadda, Robert D. Russell
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

This paper describes the architecture of a set of kernel components for developing and testing storage area network transport protocols under Linux. This software is intended for several uses: as a general prototype for network transport protocol development; as a reference implementation of the iSCSI protocol currently under development for standardization by IETF; as a basis for conformance testing for iSCSI; and as a testbed for development of interoperability test suites for iSCSI.
Automatic inversion generates divide-and-conquer parallel programs
Authors: Kazutaka Morita, Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
Venue: ACM SIGPLAN Notices (2007)

Divide-and-conquer algorithms are suitable for modern parallel machines, tending to have large amounts of inherent parallelism and working well with caches and deep memory hierarchies. Among others, list homomorphisms are a class of recursive functions on lists, which match very well with the divide-and-conquer paradigm. However, direct programming with list homomorphisms is a challenge for many programmers. In this paper, we propose and implement a novel systemthat can automatically derive cost-optimal list homomorphisms from a pair of sequential programs, based on the third homomorphism theorem. Our idea is to reduce extraction of list homomorphisms to derivation of weak right inverses. We show that a weak right inverse always exists and can be automatically generated from a wide class of sequential programs. We demonstrate our system with several nontrivial examples, including the maximum prefix sum problem, the prefix sum computation, the maximum segment sum problem, and the line-of-sight problem. The experimental results show practical efficiency of our automatic parallelization algorithm and good speedups of the generated parallel programs.
Finite Difference Runoff Modelling Using "Voronoi Buckets"
Authors: Maciej Dakowicz, Christopher Gold
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Finite difference flow modelling of runoff on a terrain surface has usually been done using a regular grid. This has various disadvantages, as the regular pattern does not conform well to observed features such as watersheds, the runoff pattern is biased to the grid axes, and original data points are lost. We propose a flow modelling method using TIN models. A random Voronoi pattern is added to the original data. This avoids the issues of grid based methods, as there is no axis bias, points may be added anywhere and original data points may be retained. Our flow model simply requires a set of "buckets" to hold the water (the Voronoi cells) and slope information to provide the local runoff rate (the Delaunay edges).
Customization of Register File Banking Architecture for Low Power
Authors: Rakesh Nalluri, Rohan Garg, Preeti Ranjan Panda
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Register file banking is an effective alternative to monolithic register files in embedded processor based systems. In this work, we propose techniques for performing application specific customization of register file banking structure. First, we propose two techniques based on (i) profiling and (ii) static application analysis to arrive at a customized energy-efficient bank configuration for a given application on a dual bank register file. We also propose a technique to extend the exploration to a multi-bank register file architecture and an associated register allocation algorithm for further power reduction. This reduces register file power consumption by allocating variables in frequently accessed basic blocks to separate appropriately sized register file bank of active registers. Experimental results indicate that our customized dual bank configuration inferred by both techniques gives energy savings of 40% over a monolithic register file, and the multi-bank register file customization gives a further 15-20% energy savings.
Efficient implementations of java remote method invocation (RMI)
Authors: Vijaykumar Krishnaswamy, Dan Walther, Sumeer Bhola, Ethendranath Bommaiah, George Riley, Brad Topol, Mustaque Ahamad
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

Java and the Remote Method Invocation (RMI) mechanism supported by it make it easy to build distributed applications and services in a heterogeneous environment. When the applications are interactive and require low response time, efficient implementations of RMI are needed. We explore both transport level protocols as well as object caching in the RMI framework to meet the performance requirements of interactive applications. We have developed a prototype system that offers new transport protocols and allows objects to be cached at client nodes. We describe the design issues and the implementation choices made in the prototype along with some preliminary performance results.
Belief-augmented OWL (BOWL) Engineering the SemanticWeb with Beliefs
Authors: Yuzhang Feng, Yuan Fang Li, Colin Keng-Yan Tan, Bimlesh Wadhwa, Hai Wang
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

As the Semantic Web is an open, complex and constantly evolving medium, it is the norm, but not exception that information at different sites is incomplete/inconsistent. This poses challenges for the engineering and development of agent systems on the Semantic Web since autonomous software agents need to understand, process and aggregate this information. Ontology language OWL provides core language constructs to semantically markup resources on the Semantic Web. However, as OWL was designed on top of (a subset of) classic predicate logic, it lacks the ability to reason about inconsistent/incomplete information. Belief Augmented Frames (BAF) is a frame-based logic system that associates with each frame/slot a supporting and a refuting belief value. In this paper, we propose a new ontology language BOWL (Belief-augmented OWL) by integrating OWL DL and BAF to incorporate the notion of confidence. The BOWL is paraconsistent, hence it can perform useful reasoning services in the presence of inconsistencies/incompleteness. We define the abstract syntax and semantics of BOWL by extending those of OWL. One example in the sensor fusion domain is presented to demonstrate the application of BOWL.
Understanding target users of a digital reference library
Authors: Daniela K. Rosner, John Mark Josling, Andrea Moed, Elisa Oreglia
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Through an investigation of the needs and practices of researchers in the humanities and social sciences, we identify key issues in the use of an online digital reference library, the Electronic Cultural Atlas Initiatives' "Support for the Learner: What, When, Where and Who". In this poster we present an examination of results from survey data and user tasks, and discuss implications for future design and implementation based on our findings.
Independent, synchronous and asynchronous an analysis of approaches to online concept formation
Authors: Matt Bower
Venue: ACM SIGCSE Bulletin (2007)

This paper compares and contrasts three different approaches to pre-class concept formation in an online computing course. In the initial third of the semester students made individual responses to sets of weekly pre-class tutorial style questions. In the following four weeks a virtual classroom was used to facilitate the synchronous construction of group responses to the same type of activities. In the final third of semester a wiki was used to provide an asynchronous means of composing group responses to the pre-class tutorial questions. The different patterns of student contribution and interaction that resulted from each mode are described. Implications for concept formation specifically and learning generally are discussed.