ppxscal/embedding_network huggingface dataset:
Towards a catalog of aspect-oriented refactorings
Authors: Miguel P. Monteiro, João M. Fernandes
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

In this paper, we present a collection of aspect-oriented refactorings covering both the extraction of aspects from object-oriented legacy code and the subsequent tidying up of the resulting aspects. In some cases, this tidying up entails the replacement of the original implementation with a different, centralized design, made possible by modularization. The collection of refactorings includes the extraction of common code in various aspects into abstract superaspects. We review the traditional object-oriented code smells in the light of aspect-orientation and propose some new smells for the detection of crosscutting concerns. In addition, we propose a new code smell that is specific to aspects.
A new class of multistep methods for systems of first order differential equations with exponential adaptation
Authors: Karl Strehmel
Venue: ACM SIGNUM Newsletter (1976)

Consider an initial value problem for a system of n simultaneous differential equations in vector notation
ReArchJBs: A Tool for Automated Software Architecture Recovery of JavaBeans-Based Applications
Authors: Chang-ai Sun, Jun Zhou
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Currently, more and more software systems are developed based on the component technologies, such as JavaBeans. It is significant to recover software architecture from the implementation for the purpose of software maintenance and evolution. In this paper, a general framework for architecture recovery of component-based applications is proposed, identifying the principle and requirements for architecture recovery. Based on this framework, we developed a tool, ReArchJBs, to support automated architecture recovery of JavaBeans-based applications. It recovers architecture model in a graphical way from the perspective of structure and behavior, including the component view, the assembly view and the interaction view. The paper discusses in details key issues involved in the implementation of ReArchJBs, and illustrates this tool by the result of a case study.
Modifications of the Helbing-Molnár-Farkas-Vicsek Social Force Model for Pedestrian Evolution
Authors: Taras I. Lakoba, D. J. Kaup, Neal M. Finkelstein
Venue: Simulation (2005)

A model of crowd motion that considers each pedestrian as a Newtonian particle subject to both physical and social forces was reported by Helbing, Farkas, and Vicsek in 2000. Subsequent numerical simulations of this model, performed by its authors, showed that it exhibits realistic crowd behavior. In this article, the authors point out that numerical values of certain parameters in that model may produce counterintuitive results when applied to the motion of an isolated pedestrian or a small number of pedestrians. They have considered modifications of the original model, which allow them to use parameter values that, in the aforementioned sense, are more realistic. However, this is achieved by introducing more features and parameters into the original model. These features are described, and some results of the numerical simulations of the modified model are presented. Two major results of their study need to be mentioned. First, they developed an algorithm, based on an explicit numerical integration scheme, which prevents simulated pedestrians from overlapping with one another in physical space. Second, they demonstrated how the form of the social repulsive force between two pedestrians may be deduced from certain measured characteristics of pedestrian flows.
Geometric and combinatorial tiles in 0-1 data
Authors: Aristides Gionis, Heikki Mannila, Jouni K. Seppänen
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this paper we introduce a simple probabilistic model, hierarchical tiles, for 0-1 data. A basic tile (X,Y,p) specifies a subset X of the rows and a subset Y of the columns of the data, i.e., a rectangle, and gives a probability p for the occurrence of 1s in the cells of X × Y. A hierarchical tile has additionally a set of exception tiles that specify the probabilities for subrectangles of the original rectangle. If the rows and columns are ordered and X and Y consist of consecutive elements in those orderings, then the tile is geometric; otherwise it is combinatorial. We give a simple randomized algorithm for finding good geometric tiles. Our main result shows that using spectral ordering techniques one can find good orderings that turn combinatorial tiles into geometric tiles. We give empirical results on the performance of the methods.
Querying XML streams
Authors: Vanja Josifovski, Marcus Fontoura, Attila Barta
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

Efficient querying of XML streams will be one of the fundamental features of next-generation information systems. In this paper we propose the TurboXPath path processor, which accepts a language equivalent to a subset of the for-let-where constructs of XQuery over a single document. TurboXPath can be extended to provide full XQuery support or used to augment federated database engines for efficient handling of queries over XML data streams produced by external sources. Internally, TurboXPath uses a tree-shaped path expression with multiple outputs to drive the execution. The result of a query execution is a sequence of tuples of XML fragments matching the output nodes. Based on a streamed execution model, TurboXPath scales up to large documents and has limited memory consumption for increased concurrency. Experimental evaluation of a prototype demonstrates performance gains compared to other state-of-the-art path processors.
Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs
Authors: R. Lempel, S. Moran
Venue: Information Retrieval (2005)

Web search algorithms that rank Web pages by examining the link structure of the Web are attractive from both theoretical and practical aspects. Today's prevailing link-based ranking algorithms rank Web pages by using the dominant eigenvector of certain matrices--like the co-citation matrix or variations thereof. Recent analyses of ranking algorithms have focused attention on the case where the corresponding matrices are irreducible, thus avoiding singularities of reducible matrices. Consequently, rank analysis has been concentrated on authority connected graphs, which are graphs whose co-citation matrix is irreducible (after deleting zero rows and columns). Such graphs conceptually correspond to thematically related collections, in which most pages pertain to a single, dominant topic of interest.A link-based search algorithm A is rank-stable if minor changes in the link structure of the input graph, which is usually a subgraph of the Web, do not affect the ranking it produces; algorithms A,B are rank-similar if they produce similar rankings. These concepts were introduced and studied recently for various existing search algorithms.This paper studies the rank-stability and rank-similarity of three link-based ranking algorithms--PageRank, HITS and SALSA--in authority connected graphs. For this class of graphs, we show that neither HITS nor PageRank is rank stable. We then show that HITS and PageRank are not rank similar on this class, nor is any of them rank similar to SALSA.
SCANMail: audio navigation in the voicemail domain
Authors: Michiel Bacchiani, Julia Hirschberg, Aaron Rosenberg, Steve Whittaker, Donald Hindle, Phil Isenhour, Mark Jones, Litza Stark, Gary Zamchick
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes SCANMail, a system that allows users to browse and search their voicemail messages by content through a GUI. Content based navigation is realized by use of automatic speech recognition, information retrieval, information extraction and human computer interaction technology. In addition to the browsing and querying functionalities, acoustics-based caller ID technology is used to proposes caller names from existing caller acoustic models trained from user feedback. The GUI browser also provides a note-taking capability. Comparing SCANMail to a regular voicemail interface in a user study, SCANMail performed better both in terms of objective (time to and quality of solutions) as well as subjective objectives.
The effect of content customization on learnability and perceived workload
Authors: Diego Rivera
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

One of the key e-commerce challenges is to maintain an increasing amount of information up-to-date. This is a challenging task because frequently there is a substantial amount of data being created under tight deadlines. It is important that data management tools used for these tasks are efficient and easy to use. The present study describes the effect of UI content customization on learnability and perceived workload. Participants were asked to create 20 different products using four different web prototypes that varied in content density and customization capability. Mean time on task over 20 trials was fit using a power function and perceived workload was collected using NASA Task Load Index. The results obtained indicate that content customization allows users to reach peak performance faster and reduce task learning. Also, content customization reduces perceived mental demand and frustration as content density increases. Finally, participants performed faster and with higher satisfaction under the customization conditions.
VLSI Photonic Ring Multicomputer Interconnect: Architecture and Signal Processing Performance
Authors: Roger Chamberlain, Mark Franklin, Praveen Krishnamurthy, Abhijit Mahajan
Venue: Journal of VLSI Signal Processing Systems (2005)

This paper presents the architectural design of a multicomputer interconnection network based on the use of optical technology. The performance of the system is evaluated on a set of signal processing applications. The interconnect uses Vertical Cavity Surface Emitting Lasers (VCSELs) and flexible fiber image guides to implement a physical ring topology that is logically configured as a multiring. Processors in the multicomputer are nodes on the ring and extremely high communication bandwidth is possible. Using the Laser Channel Allocation (LCA) algorithm and the Deficit Round Robin (DRR) media access protocol, the bandwidth available in the optical interconnect can be reconfigured to make efficient use of the interconnect resources. A discrete-event simulation model of the interconnect is used to examine performance issues such as throughput, latency, fairness, and the impact of reconfigurability.
Interaction at Lincoln laboratory in the 1960's: looking forward -- looking back
Authors: William Buxton, Ron Baecker, Wesley Clark, Fontaine Richardson, Ivan Sutherland, W.R. "Bert" Sutherland, Austin Henderson
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The activity centered around the TX-2 computer at Lincoln Laboratory in the 1960's laid the foundation for much of HCI. Through the use of archival film footage, and live presentations by some of the key protagonists, this panel is intended to contribute to a more general awareness of this work, its historical importance to HCI, and its relevance to research today.
A diffusion stick method for speckle suppression in ultrasonic images
Authors: Chang-Yan Xiao, Zhang Su, Ya-zhu Chen
Venue: Pattern Recognition Letters (2004)

This paper presents a diffusion stick method for speckle suppression in ultrasonic images. An asymmetric stick filter kernel is firstly defined by decomposing the rectangle neighborhood into line segments of variable orientations. Then, the weighted sum of averages along each stick is used to produce the filtered images. Implemented in an iteration scheme, our method works as a pseudo-diffusion process, where the diffusivity is controlled by a normalized variance function. Experiments of synthetic and real images show that the diffusion stick technique performs effectively in suppressing speckle noise, preserving resolvable structures and enhancing linear features.
New computational tools for Brassica genome research: Conference Reviews
Authors: Christopher G. Love, Jacqueline Batley, Geraldine Lim, Andrew J. Robinson, David Savage, Daniel Singh, German C. Spangenberg, David Edwards
Venue: Comparative and Functional Genomics (2004)

With the increasing quantities of Brassica genomic data being entered into the public domain and in preparation for the complete Brassica genome sequencing effort, there is a growing requirement for the structuring and detailed bioinformatic analysis of Brassica genomic information within a user-friendly database. At the Plant Biotechnology Centre, Melbourne, Australia, we have developed a series of tools and computational pipelines to assist in the processing and structuring of genomic data, to aid its application to agricultural biotechnology research. These tools include a sequence database, ASTRA, a sequence processing pipeline incorporating annotation against GenBank, SwissProt and Arabidopsis Gene Ontology (GO) data and tools for molecular marker discovery and comparative genome analysis. All sequences are mined for simple sequence repeat (SSR) molecular markers using &lsquo;SSR primer&rsquo; and mapped onto the complete Arabidopsis thaliana genome by sequence comparison. The database may be queried using a text-based search of sequence annotation or GO terms, BLAST comparison against resident sequences, or by the position of candidate orthologues within the Arabidopsis genome. Tools have also been developed and applied to the discovery of single nucleotide polymorphism (SNP) molecular markers and the in silico mapping of Brassica BAC end sequences onto the Arabidopsis genome. Planned extensions to this resource include the integration of gene expression data and the development of an EnsEMBL-based genome viewer. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Downlink Dimensioning for the HSDPA Standard
Authors: D. Avidor, S. Mukherjee
Venue: Wireless Personal Communications: An International Journal (2005)

We present an analytic derivation of downlink dimensioning for a wireless network employing the "High Speed Downlink Packet Access" (HSDPA) standard [Moulsley, Conference Publication No. 477, IEE 2001], currently being developed by the 3rd Generation Partnership Project (3GPP) [http://www.3gpp.org] as part of the next stage in the evolution of the WCDMA standard. We determine the maximum possible cell radius such that the probability of outage, Pout, at the cell's "worst" location does not exceed a preset value under full load condition. The results of the paper are presented in the form of curves obtained by numerical integration of integral expressions. The results can be used, for instance, to find the increase in cell radius achievable by a certain reduction in the threshold value of the Signal to Interference plus Noise Ratio (SINR) defining outage.
Error Diagnosis of Sequential Circuits Using Region-Based Model
Authors: Anand L. D'Souza, Michael S. Hsiao
Venue: Journal of Electronic Testing: Theory and Applications (2005)

Algorithms to locate multiple design errors using region-based model are studied for both combinational and sequential circuits. The model takes locality aspect of errors and is based on a 3-value, non-enumerative analysis technique. Studies show the effectiveness of the region based model for single and multiple stuck faults and gate connection errors. For sequential circuits, we try to locate the time frame at which the error was first excited, by re-simulating as few vectors as possible preceding the erroneous vector in a fully initialized circuit to carry out the diagnosis. Experimental results on benchmark circuits are used to demonstrate rapid and accurate locating of multiple errors.
MINE and MILE: improving connectivity in mobile ad-hoc networks
Authors: Horst Hellbrück, Stefan Fischer
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2004)

Ad-Hoc networks are useful where infrastructure networks cannot be deployed or are not cost effective, like temporary deployment in a conference or in case of emergency. However, the nature of ad-hoc networks and especially the mobility of nodes make it difficult to achieve a certain minimum connectivity, which is an indispensable property for many applications. The question we are interested in is: How can connectivity in ad-hoc networks be improved? In this paper, we suggest to introduce dedicated mobile nodes whose only purpose is to maintain the network. These "Mobile Infrastructure NodEs" (MINEs) move to positions where they are useful to (re-)create links between normal nodes. We introduce into the MINE concept and then present and analyze several information exploitation and movement strategies these infrastructure nodes could follow in order to efficiently complete their job. These strategies are based on a location exchange protocol which we call Mobile Infrastructure Location Exchange (MILE). Simulations compare the different strategies and show the usefulness of the approach, and they argue for the efficiency of the MILE protocol.
Introduction to education and training track
Authors: Paola Inverardi, Mehdi Jazayeri
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The attendees of ICSE comprise some of the top researchers in software engineering and also many educators of software engineering. Traditionally, however, these two groups do not talk to each other about educational issues. Then there are the practitioners who attend ICSE who have their own opinions about the relevance, strengths, and shortcomings of current software engineering education offered in universities. The goal of this year's track on Software Engineering Education and Training at ICSE is to bring these three communities together to discuss some urgent questions that have profound effect on how we structure our educational programs. Considering the tremendous changes taking place in the software engineering industry, and in the industrial world in general, it seems appropriate to confront the needs of the software engineering educators.Consider just the following increasingly common developments:Outsourcing of software projectsPervasiveness of software in all areas of commerce, industry, and societyIncreasingly distributed platformsOpen-source developmentGlobalization, leading to international (multi-cultural) distributed software teamsHow should these developments change the way we teach software engineering? Should textbooks be updated? Should software engineering play a different role in the computer science curriculum, that is, be more pervasive? How are professors in universities handling these issues?These are some of the questions we address in this track. In particular, we consider current challenges, current solutions, and future challenges. We are pleased to have six distinguished researchers to present their views and fifteen presenters from universities around the world presenting their innovative approaches in their classrooms. We expect lively and active discussion between the speakers and the audience.
Comments on the IFIP working group 2.5 proposal on "parameterization of the environment for transportable numerical software"
Authors: S. I. Feldman
Venue: ACM SIGNUM Newsletter (1979)

IFIP Working Group 2.5 has proposed a set of parameters for describing the computing environment. This proposal appeared in the SIGNUM Newsletter [1], and simultaneously in several other journals. It is unfortunate that this paper is presented as a consensus view, when no reference is made to earlier published work on similar parametrizations (see especially [2] and [3]). There certainly is a clear need for a way to parametrize details of the computing environment. At present, each large numerical project uses its own set of parameters. A generally used and available set of such quantities is certainly long overdue. The numerical community should certainly propose and even adopt a set of its own, and it is laudable that the IFIP Working Group 2.5 has taken this task upon itself. However, I disagree with many of the details of the proposal.
Electromechanical Design of a Miniature Tactile Shape Display for Minimally Invasive Surgery
Authors: Maria V. Ottermo, Oyvind Stavdahl, Tor A. Johansen
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A design of a new tactile shape display to be used in Minimally Invasive Surgery (MIS) is presented. It consists of 32 micro brushless motors in a 4-by-8 configuration, and the total size is 27 mm * 20 mm * 18 mm. The main restrictive design parameter is the size of the display because it should be attached to a laparoscopic grasper. Another important design parameter is modularity, as it is desirable to do experiments with several actuator pins. Each actuator has 3 mm indentation and can provide 1.7 N at a frequency of 2 Hz at full excursion. The pin spacing is 2.7 mm with a pin diameter of up to 2.65 mm.
Blurred character recognition by complementing features of blurred regions
Authors: Osamu Shiku, Akira Nakamura, Sueharu Miyahara, Terumitsu Ohyama
Venue: Systems and Computers in Japan (2005)

This paper presents a method for recognizing printed characters with accuracy and speed. It is difficult to recognize blurred characters because a feature extracted from a blurred region is very different from that from a clean image. In particular, contour features which show the character line direction are highly effective in character recognition, but in blurred characters the contour is lost, and the performance of blurred character recognition by contour features becomes worse. The basic idea of our method is to complement the lost contour by using prepared contour images for each character category. In addition, by applying our blurred character recognition method, we construct a recognition system which is effective for characters of various quality. Experiments were conducted using photocopied 6-point characters with numerous blurs. We confirmed that our method recognized blurred characters with much higher accuracy than the existing method of contour features, and that our system could be applied to characters of various quality. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 59&ndash;68, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20253
Book review: Search in Artificial Intelligence Ed. by Laveen Kanal and Vipin Kumar (Springer-Verlag, New York, 1988)
Venue: ACM SIGART Bulletin (1991)

The most recent addition to the well-known series "Symbolic Computation" which started in 1982 with the seminal volume by N.J.Nilsson "Principles of Artificial Intelligence" brings the reader a well-selected set of thirteen articles presenting the most important developments in the area of heuristic search and related research issues. Most of the articles in this volume were originally published in various journals during the last decade and were revised and edited for this publication. This volume will prove especially noteworthy for any researcher or student whose interests include traditional search techniques, optimization problems or constraint satisfaction. Some of the chapters (identified below) will also serve as an excellent tutorial introduction to various aspects of search, as seen from the artificial intelligence perspective, although it must be noted that almost all chapters require some degree of mathematical sophistication.