ppxscal/embedding_network huggingface dataset:
Towards automating traceability: an incremental and scalable approach
Authors: Susanne A. Sherba
Venue:  (2005)

Software engineers face significant challenges when creating and maintaining traceability information. Many software tools lack the ability to automatically create semantic relationships between a software project's heterogeneous artifacts. Thus, traceability typically involves laborious, manual procedures and, as such, these important techniques face serious adoption hurdles by developers. In this work, we describe a new approach to traceability that automates the creation and maintenance of traceability information among heterogeneous software artifacts. Furthermore, our approach allows these relationships to be viewed in the tool that originally created the artifact rather than forcing the user to switch to a separate tool to view these relationships. Our conceptual framework, TraceM, incorporates techniques from open hypermedia and information integration to provide scheduling, query, relationship mapping, evolution, and export services. We have developed a prototype implementation of TraceM to evaluate our approach. Our evaluation includes a small study of its usability and utility as well as a separate scalability test using artifacts obtained from industry.
The Kth-Best Approach for Linear Bilevel Multi-follower Programming
Authors: Chenggen Shi, Guangquan Zhang, Jie Lu
Venue: Journal of Global Optimization (2005)

The majority of research on bilevel programming has centered on the linear version of the problem in which only one leader and one follower are involved. This paper addresses linear bilevel multi-follower programming (BLMFP) problems in which there is no sharing information among followers. It explores the theoretical properties of linear BLMFP, extends the Kth-best approach for solving linear BLMFP problems and gives a computational test for this approach.
Scalable interest management for multidimensional routing space
Authors: Elvis S. Liu, Milo K. Yip, Gino Yu
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Interest management is essential for scalable collaborative virtual environments (CVEs) which sought to reduce bandwidth consumption on the network. Most of the interest management systems such as Data Distribution Management (DDM) service of the High Level Architecture (HLA) concentrate on providing precise message filtering mechanisms. However, in doing so a second problem is introduced: the CPU cycle overheads of filtering process. If the cost in terms of computational resources of interest management itself is too high, it would be unsuitable for real time applications such as multiplayer online games (MOGs) for which runtime performance is important. In this paper we present a scalable interest management algorithm which is suitable for HLA DDM. Our approach employs the collision detection method of I-COLLIDE for fast interest matching. Furthermore, the algorithm has been implemented in our commercialized MOG middleware - Lucid Platform. Experimental evidence demonstrates that it works well in practice.
Are Requirements Engineering best practices the same for all industries?
Authors: Gauthier Fanmuy, Frederique Populus, Jean Rene, Jeremy Dick, Sjaak Brinkkemper, Matthias Weber, Philippe Baron
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Requirements Engineering has become inescapable for industrial projects. But in every day life, project actors (acquirers, systems engineers, software engineers, information system analysts, domain experts, etc") are facing multiple constraints: to meet project or company goals (quality, delays, costs), to define and balance requirements from various stakeholders, to use dedicated tools, to create traceability" And one of the key remaining questions is still: how to implement Requirements Engineering in the most efficient way ? Various methods, techniques and tools have been tried out, adopted and optimized, good and bad experiences have been analyzed, know how has been gathered: industry has now developed a number of best Requirements Enginnering practices. But does everyone have the same best practices? Do we need the same approach to elicit requirements, document, negotiate, validate, formalize or trace requirements when you integrate an ERP, when you develop a car, an air traffic control system, an aircraft or a satellite, or when you study the ergonomics of a mobile phone? This panel gathers experienced requirements engineers from various industries, to try learn a few new lessons on the adequacy of various best practices to various industrial sectors.
Universal programming interfaces for robotic devices
Authors: Jean-Christophe Baillie
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Robotic devices, whether service robots designed to help people or entertainment robots, are more and more widespread, and their number is increasing. All these robots currently have a different programming interface, more or less complex and more or less powerful. The situation is reminding of the 80's and the personal computer revolution: many vendors, models and as many programming languages and interfaces. We have developed URBI, a Universal Robotic Body Interface in an attempt to address this issue and provide a standard and simple way to control robots, while still providing powerful high-level capabilities expected from a modern programming language. To achieve this, URBI is based on a client/server architecture where the server is running on the robot and accessed by the client, typically via TCP/IP. The client can be any system, thus giving a great deal of flexibility. The URBI language is a high level scripted interface language used by the client and capable of controlling the joints of the robot or accessing its sensors, camera, speakers or any accessible part of the machine, We present in this article a short introduction to URBI and show application examples with Aibo. We finally explore how URBI could impact the development of everyday robotics and facilitate the interaction between robots, computers and smart objects in general.
Online feature selection for pixel classification
Authors: Karen Glocer, Damian Eads, James Theiler
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a significant amount of memory to store. Image processing operators, and especially combinations of image processing operators, provide a rich space of potential features for use in machine learning for image processing tasks but they are expensive to generate and store. In this paper we apply OFS to the problem of edge detection in grayscale imagery. We use a standard data set and compare our results to those obtained with traditional edge detectors, as well as with results obtained more recently using "statistical edge detection." We compare several different OFS approaches, including hill climbing, best first search, and grafting.
Exploring the performance of split data cache schemes on superscalar processors and symmetric multiprocessors
Authors: J. Sahuquillo, S. Petit, A. Pont, V. Milutinović
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

Current technology continues providing smaller and faster transistors, so processor architects can offer more complex and functional ILP processors, because manufacturers can fit more transistors on the same chip area. As a consequence, the fraction of chip area reachable in a single clock cycle is dropping, and at the same time the number of transistors on the chip is increasing. However, problems related with power consumption and heat dissipation are worrying. This scenario is forcing processor designers to look for new processor organizations that can provide the same or more performance but using smaller sizes. This fact especially affects the on-chip cache memory design; therefore, studies proposing new smaller cache organizations while maintaining, or even increasing, the hit ratio are welcome. In this sense, the cache schemes that propose a better exploitation of data locality (bypassing schemes, prefetching techniques, victim caches, etc.) are a good example.This paper presents a data cache scheme called filter cache that splits the first level data cache into two independent organizations, and its performance is compared with two other proposals appearing in the open literature, as well as larger classical caches. To check the performance two different scenarios are considered: a superscalar processor and a symmetric multiprocessor.The obtained results show that (i) in the superscalar processor the split data caches perform similarly or better than larger conventional caches, (ii) some splitting schemes work well in multiprocessors while others work less well because of data localities, (iii) the reuse information that some split schemes incorporate for managing is also useful for designing new competitive protocols to boost performance in multiprocessors, (iv) the filter data cache achieves the best performance in both scenarios.
Communication Networks from the Enron Email Corpus "It's Always About the People. Enron is no Different"
Authors: Jana Diesner, Terrill L. Frantz, Kathleen M. Carley
Venue: Computational Mathematical Organization Theory (2005)

The Enron email corpus is appealing to researchers because it represents a rich temporal record of internal communication within a large, real-world organization facing a severe and survival-threatening crisis. We describe how we enhanced the original corpus database and present findings from our investigation undertaken with a social network analytic perspective. We explore the dynamics of the structure and properties of the organizational communication network, as well as the characteristics and patterns of communicative behavior of the employees from different organizational levels. We found that during the crisis period, communication among employees became more diverse with respect to established contacts and formal roles. Also during the crisis period, previously disconnected employees began to engage in mutual communication, so that interpersonal communication was intensified and spread through the network, bypassing formal chains of communication. The findings of this study provide valuable insight into a real-world organizational crisis, which may be further used for validating or developing theories and dynamic models of organizational crises; thereby leading to a better understanding of the underlying causes of, and response to, organization failure.
Efficient Host-Independent Coprocessor Architecture for Speech Coding Algorithms
Authors: Hamid Safizadeh, Hamid Noori, Mehdi Sedighi, Ali Jahanian, Neda Zolfaghari
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

The recent growth of cellular phone systems, voice over IP devices, and other multimedia applications has created a considerable need for efficient voice coding algorithms. These algorithms usually require intensive amount of signal processing capabilities and demand significant signal processing power. The current market trend of integrating multiple voice channels into a single die has further intensified the need for more powerful hardware platforms. Some new design ideas such as vocoderspecialized DSP architectures, combined RISC/DSP platforms, and adding hardware accelerators or coprocessors to the general-purpose processors have been proposed. In this paper, a new hardware accelerator design has been proposed which executes Macro Instructions (MIs). The proposed coprocessor can be added to each processor type that can support at least one coprocessor without modifying the compiler and redesigning the processor. It can handle computationally intensive loops in speech coding algorithms parallel with the main processor. The coprocessor along with software optimization reduces clock cycles required for G.723.1 by 80% and G.729 by 64% while MIPS R3000 RISC is used as the host.
An Interface Agent Approach to Personalize Users' Interaction with Databases
Authors: Silvia Schiaffino, Analía Amandi
Venue: Journal of Intelligent Information Systems (2005)

Making queries to a database system through a computer application can become a repetitive and time-consuming task for those users who generally make similar queries to get the information they need to work with. We believe that interface agents could help these users by personalizing the query-making and information retrieval tasks. Interface agents are characterized by their ability to learn users' interests in a given domain and to help them by making suggestions or by executing tasks on their behalf. Having this purpose in mind we have developed an agent, named QueryGuesser, to assist users of computer applications in which retrieving information from a database is a key task. This agent observes a user's behavior while he is working with the database and builds the user's profile. Then, QueryGuesser uses this profile to suggest the execution of queries according to the user's habits and interests, and to provide the user information relevant to him by making time-demanding queries in advance or by monitoring the events and operations occurring in the database system. In this way, the interaction between database users and databases becomes personalized while it is enhanced.
Over the Shoulder Learning: Supporting Brief Informal Learning
Authors: Michael B. Twidale
Venue: Computer Supported Cooperative Work (2005)

The paper reviews work on informal technical help giving between colleagues. It concentrates on the process of how colleagues help each other to use a computer application to achieve a specific work task, contrasting this with the focus of much prior work on surrounding issues like the choice of whom to ask, information re-use and the larger work context of encouragement or otherwise of such learning. By an analysis of the literature and a study of office activity, some strengths and weaknesses of the method are identified. The difficulties of talking about the process of performing graphical user interface actions are explored. Various design implications for functionalities to improve the efficiency of informal help giving are explored. A consideration of informal learning can help in designing more effective, learnable, robust and acceptable CSCW systems. It also provides a different perspective on interface design as an exploration of features to support human---human interaction, using the computer screen as a shared resource to support this. In this way CSCW research may contribute to HCI research, since during such help giving, all computer systems are at least temporarily collaborative applications.
ASTOR: An Autostereoscopic Optical See-through Augmented Reality System
Authors: Alex Olwal, Christoffer Lindfors, Jonny Gustafsson, Torsten Kjellberg, Lars Mattsson
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

We present a novel autostereoscopic optical see-through system for Augmented Reality (AR). It uses a transparent holographic optical element (HOE) to separate the views produced by two, or more, digital projectors. It is a minimally intrusive AR system that does not require the user to wear special glasses or any other equipment, since the user will see different images depending on the point of view. The HOE itself is a thin glass plate or plastic film that can easily be incorporated into other surfaces, such as a window. The technology offers great flexibility, allowing the projectors to be placed where they are the least intrusive. ASTOR's capability of sporadic AR visualization is currently ideal for smaller physical workspaces, such as our prototype setup in an industrial environment.
Accurate Prediction of Protein Disordered Regions by Mining Protein Structure Data
Authors: Jianlin Cheng, Michael J. Sweredoski, Pierre Baldi
Venue: Data Mining and Knowledge Discovery (2005)

Intrinsically disordered regions in proteins are relatively frequent and important for our understanding of molecular recognition and assembly, and protein structure and function. From an algorithmic standpoint, flagging large disordered regions is also important for ab initio protein structure prediction methods. Here we first extract a curated, non-redundant, data set of protein disordered regions from the Protein Data Bank and compute relevant statistics on the length and location of these regions. We then develop an ab initio predictor of disordered regions called DISpro which uses evolutionary information in the form of profiles, predicted secondary structure and relative solvent accessibility, and ensembles of 1D-recursive neural networks. DISpro is trained and cross validated using the curated data set. The experimental results show that DISpro achieves an accuracy of 92.8% with a false positive rate of 5%. DISpro is a member of the SCRATCH suite of protein data mining tools available through http://www.igb.uci.edu/servers/psss.html.
In the beginning...
Authors: Andrew R. Farber
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

This is, hopefully, the first article of a series that will explore different techniques of documentation. Rather than discussing the multitude of textbook methods, I intend to stay with the practical ways that I have either used myself, or seen work firsthand. Aas usual, any response from you will be more than welcome--my immediate experience is by no means all-encompassing.
Content Management for Inter-Organizational Projects Using E-Mail Metaphor
Authors: Kosuke Nakatsuka, Toru Ishida
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Inter-organizational projects involve the creation, modificationand management of content. Unless carefully handled, these overheads can cause the loss of mutual understanding. In this paper, we propose a content management approach for inter-organizational projects that uses the e-mail metaphor; the functions of creating, modifying, and managing content are represented as e-mail messages that are sent to project members automatically. The e-mail metaphor allows us to communicate the creation, modificationand management of content explicitly across organizations. It promotes mutual understanding in inter-organizational projects. We have developed a content management system that uses the e-mail metaphor. When one project member adds content to the project, the system informs this event to the other project members. When the project manager manages the content by grouping, commenting or semantic annotation, the system informs to project members of the operation by e-mail metaphor such as creating a mailbox for a new group.
TARP: Ticket-based Address Resolution Protocol
Authors: Wesam Lootah, William Enck, Patrick McDaniel
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

IP networks fundamentally rely on the Address Resolution Protocol (ARP) for proper operation. Unfortunately, vulnerabilities in the ARP protocol enable a raft of IP-based impersonation, man-in-the-middle, or DoS attacks. Proposed countermeasures to these vulnerabilities have yet to simultaneously address backward compatibility and cost requirements. This paper introduces the Ticket-based Address Resolution Protocol (TARP). TARP implements security by distributing centrally issued secure MAC/IP address mapping attestations through existing ARP messages. We detail the TARP protocol and its implementation within the Linux operating system. Our experimental analysis shows that TARP improves the costs of implementing ARP security by as much as two orders of magnitude over existing protocols. We conclude by exploring a range of operational issues associated with deploying and administering ARP security.
An Overview of DNA Microarray Image Requirements for Automated Processing
Authors: Peter Bajcsy
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

We present an overview of DNA microarray image requirements for automated processing and information extraction from spotted glass slides. Motivation of our review comes from the need to automate high-throughput microarray data processing due to exponentially growing amounts of microarray data. In order to automate microarray image processing and draw biologically meaningful conclusions from experiments, one has to understand the processing flow, modeling assumptions, uncertainties involved, and the computational tradeoffs of multiple approaches. We present a model of an ideal microarray image and microarray deviations from the model in real experiments. In the summary, we discuss several open problems and the current challenges of high-throughput microarray image processing.
Cooperative and non-cooperative models for slotted-aloha type MAC protocols
Authors: Richard T. B. Ma, Vishal Misra, Dan Rubenstein
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Aloha [1] and its slotted variation [3] have been widely deployed as a medium access control (MAC) protocol for different communication networks. Slotted-Aloha type MAC protocols don't perform carrier sensing and synchronize the transmissions into time-slots. These protocols are suitable for controlling, multiple accesses when nodes cannot sense each other. Recent development of wireless and sensor networks urges us to re-investigate slotted-Aloha type MAC, and to design its variations for these new trends.
What is text processing?
Authors: Russ Abbott
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

In this article, I begin to set out what I find appealing about text processing. In the process, I hope to define the field of text processing more precisely.
Rate optimal estimation with the integration method in the presence of many covariates
Authors: Nicolas W. Hengartner, Stefan Sperlich
Venue: Journal of Multivariate Analysis (2005)

For multivariate regressors, integrating the Nadaraya-Watson regression smoother produces estimators of the lower-dimensional marginal components that are asymptotically normally distributed, at the optimal rate of convergence. Some heuristics, based on consistency of the pilot estimator, suggested that the estimator would not converge at the optimal rate of convergence in the presence of more than four covariates. This paper shows first that marginal integration with its internally normalized counterpart leads to rate-optimal estimators of the marginal components. We introduce the necessary modifications and give central limit theorems. Then, it is shown that the method apply also to more general models, in particular we discuss feasible estimation of partial linear models. The proofs reveal that the pilot estimator shall over-smooth the variables to be integrated, and, that the resulting estimator is itself a lower-dimensional regression smoother. Hence, finite sample properties of the estimator are comparable to those of low-dimensional nonparametric regression. Further advantages when starting with the internally normalized pilot estimator are its computational attractiveness and better performance (compared to its classical counterpart) when the covatiates are correlated and nonuniformly distributed. Simulation studies underline the excellent performance in comparison with so far known methods.
Convergence of the Mimetic Finite Difference Method for Diffusion Problems on Polyhedral Meshes
Authors: Franco Brezzi, Konstantin Lipnikov, Mikhail Shashkov
Venue: SIAM Journal on Numerical Analysis (2005)

The stability and convergence properties of the mimetic finite difference method for diffusion-type problems on polyhedral meshes are analyzed. The optimal convergence rates for the scalar and vector variables in the mixed formulation of the problem are proved.