ppxscal/embedding_network huggingface dataset:
Towards a Schema Representation through Design Matrices
Authors: Santiago Gomez, Hoang Duong
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Entity-relationship diagrams and their extensions play a fundamental role for relational databases, and they are widely accepted by the database design community as standard tools for the first stages of development. However, there are a number of issues closely connected with design, including the need for more complete semantics for data domains and sophisticated constraints; the demand for easier ways to expand and evolve an existing database; and the usability of database models for both management and query planning. Being a listing of relation names and attribute names, a database schema suggests the adoption of a two-dimensional structure as a basis for modelling a new or existing database. This work introduces a representation of this type called the design matrix, with at least the same expressive power as that of an enhanced entity-relationship (EER) diagram, and capable of addressing some of the shortcomings pointed out by recent literature.
A Mathematical Investigation on Retrieval Performance Evaluation Measures of Information Retrieval Algorithm
Authors: Song Jun-feng, Zhang Wei-ming, Xiao Wei-dong
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Retrieval performance evaluation measures of information retrieval algorithm are the foundation of evaluating and improving information retrieval algorithm. In this paper precision and recall are analyzed mathematically, and a theorem is proved: a good IR algorithm will make precision and recall to be maximal at the same time in an ideal vector space, then a new general evaluation measure based on this theorem is proposed to evaluate information retrieval algorithm.
Automated identification of malicious code variants
Authors: Chris Ries
Venue: Journal of Computing Sciences in Colleges (2005)

The goal of this research is to develop a system that identifies new variants of malicious code by analyzing the system and API calls that the code makes at run-time. This system will aid industry experts in analyzing newly discovered viruses and worms, and could also potentially be used with an emulator as a malicious code detection tool.
Product platform design and customization: Status and promise
Authors: Timothy W. Simpson
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

In an effort to improve customization for today's highly competitive global marketplace, many companies are utilizing product families and platform-based product development to increase variety, shorten lead times, and reduce costs. The key to a successful product family is the product platform from which it is derived either by adding, removing, or substituting one or more modules to the platform or by scaling the platform in one or more dimensions to target specific market niches. This nascent field of engineering design has matured rapidly in the past decade, and this paper provides a comprehensive review of the flurry of research activity that has occurred during that time to facilitate product family design and platform-based product development for mass customization. Techniques for identifying platform leveraging strategies within a product family are reviewed along with metrics for assessing the effectiveness of product platforms and product families. Special emphasis is placed on optimization approaches and artificial intelligence techniques to assist in the process of product family design and platform-based product development. Web-based systems for product platform customization are also discussed. Examples from both industry and academia are presented throughout the paper to highlight the benefits of product families and product platforms. The paper concludes with a discussion of potential areas of research to help bridge the gap between planning and managing families of products and designing and manufacturing them.
RETINA: REal-TIme Network Analyzer
Authors: HaiFeng Zhu, Jeffery P. Hansen, John P. Lehoczky, Rangunathan Rajkumar
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

In this paper, we present an analytical tool called RETINA for analyzing real-time constraints in complex networks with stochastic traffic.RETINA is based on a statistical method called Real-Time Queueing Theory and can predict the fraction of late tasks in networks of queues given traffic conditions and queue protocol specifications.Upon submitting a profile of the network structure and data flow descriptions, the user is able to query certain performance metrics.Currently RETINA supports two types of real-time scheduling algorithms (EDF adn FIFO) and three types of performance queries: the deadline miss rate of a designated flow, the minimum feasible deadline for a particular flow, and whether all QoS requirements of all flows will be met when a new flow is added.Simulation results show excellent agreement with the results predicted by our tool.RETINA has made it possible to analyze larger and more realistic networks and can be used to address network design tradeoffs.This use of RETINA to identify and quantify network bottlenecks is presented in the paper.
Curriculum Development in Educating Undergraduate Software Engineers " Are Students Being Prepared for the Profession?
Authors: Jean-Guy Schneider, Lorraine Johnston, Phil Joyce
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

The growing importance of software and its role in society places greater emphasis on developing suitably skilled software engineering graduates. In developing suitable curricula, it is vital that we understand standard models of software education, the educational processes and outcomes for the students. This is important not only for students completing a software engineering degree, but also once they have graduated and used their skills as practitioners. Here, we report on a survey of past students who have completed an undergraduate degree in software engineering and compare their perceptions with current efforts to standardise undergraduate software engineering curricula.
On the education of future software engineers
Authors: Paolo Ciancarini
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The education of software engineers more and more addresses organizational and management issues, like for instance modeling the business structure and environment which will receive a new software system. The teaching to software engineering students of modeling technologies based on standards like UML and the Rational Unified Process, stressing the focus on designing business-oriented management of software services, raises novel questions than need to be addressed.
Career orientation and organizational commitment of IT personnel
Authors: Mary Sumner, Susan Yager, Denise Franke
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

The management of information technology (IT) personnel poses unique challenges, but managers may be able to provide IT professionals with appropriate opportunities and career paths by matching individual expectations with job characteristics. This study is designed to identify the career anchors possessed by current IT personnel and to identify which career anchors are the strongest determinants of organizational commitment. Results from a pilot study identified four career anchors or orientations prevalent in IT personnel: Creativity, Autonomy, Identity, and Variety. Responses from sixty-six IT professionals were analyzed; and a weighted variation of Time in Job, Variety, Autonomy, and Identity explained 38% of the variation in Organizational Commitment.
Large the price of routing unsplittable flow
Authors: Baruch Awerbuch, Yossi Azar, Amir Epstein
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

The essence of the routing problem in real networks is that the traffic demand from a source to destination must be satisfied by choosing a single path between source and destination. The splittable version of this problem is when demand can be satisfied by many paths, namely a flow from source to destination. The unsplittable, or discrete version of the problem is more realistic yet is more complex from the algorithmic point of view; in some settings optimizing such unsplittable traffic flow is computationally intractable.In this paper, we assume this more realistic unsplittable model, and investigate the "price of anarchy", or deterioration of network performance measured in total traffic latency under the selfish user behavior. We show that for linear edge latency functions the price of anarchy is exactly $2.618 for weighted demand and exactly $2.5 for unweighted demand. These results are easily extended to (weighted or unweighted) atomic "congestion games", where paths are replaced by general subsets. We also show that for polynomials of degree d edge latency functions the price of anarchy is dδ(d). Our results hold also for mixed strategies.Previous results of Roughgarden and Tardos showed that for linear edge latency functions the price of anarchy is exactly 4/3 under the assumption that each user controls only a negligible fraction of the overall traffic (this result also holds for the splittable case). Note that under the assumption of negligible traffic pure and mixed strategies are equivalent and also splittable and unsplittable models are equivalent.
Mitre-Bedford: description of the Alembic system as used for MUC-5
Authors: John Aberdeen, John Burger, Dennis Connolly, Susan Roberts, Marc Vilain
Venue: Proceedings of the 5th conference on Message understanding (1993)

The Alembic text understanding system fielded at MUC-5 by MITRE is an extensive rewrite of the system we presented at MUC-4. Alembic is a research prototype that is still young, and is thus in the process of ongoing development. Our work is part of an internally-funded research initiative aimed at processing open source texts, i.e., free natural language texts drawn from broadcast transcripts, news wires, etc. This initiative explores several major research areas:&bull; Error recovery, primarily involving issues of semi-parsing and recovery of plausible attachments.&bull; Robustness, primarily involving issues of uncertain reasoning and tractable inference.&bull; Self-extensibility, focusing primarily on machine learning of natural language and user-configurable semantics.&bull; System integration, through SGML (the Standard Generalized Markup Language), both at the level of meaning analysis and at the overall application level.
A Method for MPI Broadcast in Computational Grids
Authors: Gabriel Mateescu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

For large scale computational grids, where the resources are distributed over areas spanning thousands of miles, achieving efficiency of collective communication operations such as broadcast becomes of paramount importance. We propose a broadcast algorithm constructed in terms of point-to-point communication operations that occur according to a topology determined using a generalization of the single source shortest path algorithm such that the point-to-point operations are ordered according to a heuristic. We show that the proposed approach is competitive with, and in some cases exceeds, the performance of the broadcast operation implemented in MPICH-G2, the most used grid-enabled implementation of MPI.
Parallel program debugging by specification: Research Articles
Authors: Simon Huband, Chris McDonald
Venue: Concurrency and Computation: Practice Experience (2004)

Most message passing parallel programs employ logical process topologies with regular characteristics to support their computation. Since process topologies define the relationship between processes, they present an excellent opportunity for debugging. The primary benefit is that process behaviours can be correlated, allowing expected behaviour to be abstracted and identified, and undesirable behaviour reported. However, topology support is inadequate in most message passing parallel programming environments, including the popular Message Passing Interface (MPI) and the Parallel Virtual Machine (PVM). Programmers are forced to implement topology support themselves, increasing the possibility of introducing errors.This paper proposes a trace- and topology-based approach to parallel program debugging, driven by four distinct types of specifications. Trace specifications allow trace data from a variety of sources and message passing libraries to be interpreted in an abstract manner, and topology specifications address the lack of explicit topology knowledge, whilst also facilitating the construction of user-consistent views of the debugging activity. Loop specifications express topology-consistent patterns of expected trace events, allowing conformance testing of associated trace data, and error specifications specify undesirable event interactions, including mismatched message sizes and mismatched communication pairs. Both loop and error specifications are simplified by having knowledge of the actual topologies being debugged.The proposed debugging framework enables a wealth of potential debugging views and techniques. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Numerical simulations of the quantized vortices on a thin superconducting hollow sphere
Authors: Qiang Du, Lili Ju
Venue: Journal of Computational Physics (2004)

In this paper, we investigate the vortex nucleation on a thin superconducting hollow sphere. The problem is studied using a simplified system of Ginzburg-Landau equations. We present numerical algorithms which preserve the discrete gauge invariance for both time dependent and time independent simulations. The spatial discretization is based on a spherical centroidal Voronoi tessellation which offers a very effective high resolution mesh on the sphere for the order parameter as well as other physically interesting variables such as the super-current and the induced magnetic field. Various vortex configurations and energy diagrams are computed. Dynamic responses of the vortices to the applied current are also simulated.
Mechanisms for Haptic Torque Feedback
Authors: Javier Martin, Joan Savall
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper presents a state of the art in torque and force/torque feedback mechanisms, from 1-dof rotary knobs to redundant 10-dof mechanisms. This preliminary study, together with our recent attainments in haptics and virtual reality, draws future lines of work for our research.
Improving orchestral conducting systems in public spaces: examining the temporal characteristics and conceptual models of conducting gestures
Authors: Eric Lee, Marius Wolf, Jan Borchers
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Designing interactive conducting exhibits for public spaces poses unique challenges, primarily because the conceptual model of conducting music varies amongst users. In a user study, we compared how conductors and non-conductors place their beats when conducting to a fixed orchestral recording of Radetzky March, and found significant differences between these two groups. Conductors lead the actual music beat with their gestures by an average of 150 ms, compared to 50 ms for non-conductors; non-conductors also vary their placement of the beat 50% more than conductors. Furthermore, we found differences in how users conceptually mapped their gestures to the music, such as conducting to the musical rhythm rather than to the beat. We are incorporating these results into an upcoming conducting system for public spaces to increase its usability; we believe they also apply to a more general class of musical gestures such as dance.
University of Massachusetts: description of the CIRCUS system as used for MUC-3
Authors: Wendy Lehnert, Claire Cardie, David Fisher, Ellen Riloff, Robert Williams
Venue: Proceedings of the 3rd conference on Message understanding (1991)

In 1988 Professor Wendy Lehnert completed the initial implementation of a semantically-oriented sentence analyzer named CIRCUS [1]. The original design for CIRCUS was motivated by two basic research interests: (1) we wanted to increase the level of syntactic sophistication associated with semantically-oriented parsers, and (2) we wanted to integrate traditional symbolic techniques in natural language processing with connectionist techniques in an effort to exploit the complementary strengths of these two computational paradigms.
Improving storage system availability with D-GRAID
Authors: Muthian Sivathanu, Vijayan Prabhakaran, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Venue: ACM Transactions on Storage (TOS) (2005)

We present the design, implementation, and evaluation of D-GRAID, a gracefully degrading and quickly recovering RAID storage array. D-GRAID ensures that most files within the file system remain available even when an unexpectedly high number of faults occur. D-GRAID achieves high availability through aggressive replication of semantically critical data, and fault-isolated placement of logically related data. D-GRAID also recovers from failures quickly, restoring only live file system data to a hot spare. Both graceful degradation and live-block recovery are implemented in a prototype SCSI-based storage system underneath unmodified file systems, demonstrating that powerful &ldquo;file-system like&rdquo; functionality can be implemented within a &ldquo;semantically smart&rdquo; disk system behind a narrow block-based interface.
Enterprise JavaBeans caching in clustered environments: Research Articles
Authors: Avraham Leff, James T. Rayfield
Venue: Concurrency and Computation: Practice Experience (2005)

We present the design of an Enterprise JavaBeans (EJBs) caching architecture, and show that EJB caching can greatly improve application throughput in clustered environments. Throughput is improved because data serving is offloaded from the database server to the cache-enabled application server. EJB caching is successful because it exploits the low-latency connections between the database server and application servers that exist in a clustered environment. An important feature of our architecture is that the caching function is transparent to applications that use it. The cache-enabled application server uses the same (EJB) programming model, and the same transactional semantics, as provided by non-caching architectures. Copyright &copy; 2005 John Wiley & Sons, Ltd.
On Symmetric Eigenproblems Induced by the Bidiagonal SVD
Authors: Benedikt Grosser, Bruno Lang
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

The relatively robust representations (RRR) algorithm is the method of choice to compute highly accurate eigenvector approximations for symmetric tridiagonal matrices. The task of computing singular vector pairs for a bidiagonal matrix $B = U \Sigma V ^T$ is closely connected to the RRR algorithm regarding BTB, BBT, or the Golub--Kahan matrix TGK. Nevertheless, separate application of the RRR algorithm to these matrices leads to poor results regarding either numerical orthogonality or the residual $\| {B}{V} - {U}{\Sigma} \|$. It turns out that the coupling strategy proposed in [B. Grosser and B. Lang, Linear Algebra Appl., 358 (2003), pp. 45--70] resolves this problem. This article provides the corresponding perturbation theory: We compare the eigenvalues of the separate and coupled decompositions and explain why singular vector pairs approximated via couplings are of superior quality.
Proceedings of the 27th international conference on Software engineering
Venue: International Conference on Software Engineering (2005)

The organizational effort required to make such a conference happen is extraordinary. The Conference Organizing Committee alone includes forty-one talented, active, and busy individuals who were willing to assume one more responsibility for the better part of the three years needed to plan the conference. The level of dedication and professionalism with which they discharged their duties deserves our personal acknowledgement and gratitude. More importantly, it should earn them the admiration of generations to follow in the coming years.A fortuitous early decision was that of inviting Bill Griswold and Bashar Nuseibeh to serve as Conference Program Chairs. In this capacity, which I treated as distinct from that of Research Track Chairs, they exercised an extraordinary influence on the planning of the conference. Their intellectual involvement in shaping the conference program has been invaluable and their willingness to engage constructively and critically in many of the decision processes has helped me a great deal.As always, the technical papers represent the core of the conference program. The responsibility for attracting strong submissions and selecting the best for inclusion into the program was divided among three independent teams: Research Track Chairs (Bill Griswold and Bashar Nuseibeh), Experience Track Chairs (Connie Heitmeyer and Klaus Pohl), and Education Track Chairs (Paola Inverardi and Mehdi Jazayeri). They enjoyed a great deal of independence in the manner they carried out their respective tasks, but they all shared a common set of expectations. Their drive for excellence is evident throughout these proceeding.As expected, the chairs for tracks that entailed submissions and reviews faced predictable but complex challenges, which they discharged with a great deal of skill and diligence. They were aided in this effort by still more dedicated individuals who volunteered time and labor to make up the committees that reviewed submissions and decided on various aspects of the overall program. I want to thank every member of the many conference committees for their contributions to putting together a high quality conference program.
High Level Architecture Data Distribution Management migration from DoD 1.3 to IEEE 1516: Research Articles
Authors: Katherine L. Morse, Mikel D. Petty
Venue: Concurrency and Computation: Practice Experience (2004)

The High Level Architecture (HLA) is an infrastructure for assembling federations of distributed simulations, or federates, that interoperate by exchanging simulation data at run time. HLA's Data Distribution Management (DDM) services control the amount of simulation data delivered to an HLA federate by establishing dynamic data communications connections based on the federates' run-time declarations of data production and requirements. In September 2000 the Institute for Electrical and Electronic Engineers (IEEE) approved a new standard for HLA, the IEEE 1516 standard. Most parts of the IEEE 1516 standard are generally similar to the U.S. Department of Defense HLA standard upon which it was based, the DoD 1.3 standard. However, the DDM services were significantly changed in the IEEE 1516 standard. The changes to DDM included the removal of routing spaces and the introduction of default dimension ranges. These changes simplified the implementation of some approaches to using DDM, but they did not affect the fundamental functionality of DDM. With some care, HLA users can develop DDM usage approaches that can be migrated smoothly from DoD 1.3 to IEEE 1516. Copyright &copy; 2004 John Wiley & Sons, Ltd.