ppxscal/embedding_network huggingface dataset:
Automating regression testing for evolving GUI software
Authors: Atif Memon, Adithya Nagarajan, Qing Xie
Venue: Journal of Software Maintenance: Research and Practice (2005)

With the widespread deployment of broadband connections worldwide, software development and maintenance are increasingly being performed by multiple engineers, often working around-the-clock to maximize code churn rates. To ensure rapid quality assurance of such software, techniques such as 'nightly/daily building and smoke testing' have become widespread since they often reveal bugs early in the software development process. During these builds, a development version of the software is checked out from the source code repository tree, compiled, linked, and (re)tested with the goal of (re)validating its basic functionality. Although successful for conventional software, smoke tests are difficult to develop and automatically re-run for software that has a graphical user interface (GUI). In this paper, we describe a framework called DART (Daily Automated Regression Tester) that addresses the needs of frequent and automated re-testing of GUI software. The key to our success is automation: DART automates everything from structural GUI analysis, smoke-test-case generation, test-oracle creation, to code instrumentation, test execution, coverage evaluation, regeneration of test cases, and their re-execution. Together with the operating system's task scheduler, DART can execute frequently with little input from the developer/tester to re-test the GUI software. We provide results of experiments showing the time taken and memory required for GUI analysis, test case and test oracle generation, and test execution. We empirically compare the relative costs of employing different levels of detail in the GUI test oracle. We also show the events and statements covered by the smoke test cases.
Concurrency control and recovery for balanced B-link trees
Authors: Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so that a logarithmic time bound for a search or an update operation is guaranteed under arbitrary sequences of record insertions and deletions. A database transaction can contain any number of operations of the form &#x201c;fetch the first (or next) matching record&#x201d;, &#x201c;insert a record&#x201d;, or &#x201c;delete a record&#x201d;, where database records are identified by their primary keys. Repeatable-read-level isolation for transactions is guaranteed by key-range locking. The algorithms apply the write-ahead logging (WAL) protocol and the steal and no-force buffering policies for index and data pages. Record inserts and deletes on leaf pages of a B-link tree are logged using physiological redo-undo log records. Each structure modification such as a page split or merge is made an atomic action by keeping the pages involved in the modification latched for the (short) duration of the modification and the logging of that modification; at most two B-link-tree pages are kept X-latched at a time. Each structure modification brings the B-link tree into a structurally consistent and balanced state whenever the tree was structurally consistent and balanced initially. Each structure modification is logged using a single physiological redo-only log record. Thus, a structure modification will never be undone even if the transaction that gave rise to it eventually aborts. In restart recovery, the redo pass of our ARIES-based recovery protocol will always produce a structurally consistent and balanced B-link tree, on which the database updates by backward-rolling transactions can always be undone logically, when a physical (page-oriented) undo is no longer possible.
Integrated resource management for cluster-based internet services
Authors: Kai Shen, Hong Tang, Tao Yang, Lingkun Chu
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Client request rates for Internet services tend to be bursty and thus it is important to maintain efficient resource utilization under a wide range of load conditions. Network service clients typically seek services interactively and maintaining reasonable response time is often imperative for such services. In addition, providing differentiated service qualities and resource allocation to multiple service classes can also be desirable at times. This paper presents an integrated resource management framework (part of Neptune system) that provides flexible service quality specification, efficient resource utilization, and service differentiation for cluster-based services. This framework introduces the metric of quality-aware service yield to combine the overall system efficiency and individual service response time in one flexible model. Resources are managed through a two-level request distribution and scheduling scheme. At the cluster level, a fully decentralized request distribution architecture is employed to achieve high scalability and availability. Inside each service node, an adaptive scheduling policy maintains efficient resource utilization under a wide range of load conditions. Our trace-driven evaluations demonstrate the performance, scalability, and service differentiation achieved by the proposed techniques.
Optimizing ETL Processes in Data Warehouses
Authors: Alkis Simitsis, Panos Vassiliadis, Timos Sellis
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Extraction-Transformation-Loading (ETL) tools are pieces of software responsible for the extraction of data from several sources, their cleansing, customization and insertion into a data warehouse. Usually, these processes must be completed in a certain time window; thus, it is necessary to optimize their execution time. In this paper, we delve into the logical optimization of ETL processes, modeling it as a state-space search problem. We consider each ETL workflow as a state and fabricate the state space through a set of correct state transitions. Moreover, we provide algorithms towards the minimization of the execution cost of an ETL workflow.
Beyond NP: the work and legacy of Larry Stockmeyer
Authors: Lance Fortnow
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Shortly after Steve Cook and Richard Karp showed the ex-istence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP problem and the difficulty of settling it. One graduate student at the Massachusetts Institute of Technology started to look beyond NP, asking what problems have a higher complexity and how do we classify them. Larry Stockmeyer discovered an amazing structure of complexity classes that continues to direct the research in complexity to this day. Stockmeyer passed away on July 31, 2004 at the age of 55 and in this paper we review some of his research and the legacy he has left on the community.
Compressing Bitmap Indices by Data Reorganization
Authors: Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient storage and retrieval of scientific data. Unlike conventional databases, scientific data is mostly read-only and its volume can reach to the order of petabytes, making a compact index structure vital. Bitmap indexing has been successfully applied to scientific databases by exploiting the fact that scientific data are enumerated or numerical. Bitmap indices can be compressed with variants of run length encoding for a compact index structure. However even this may not be enough for the enormous data generated in some applications such as high energy physics. In this paper, we study how to reorganize bitmap tables for improved compression rates. Our algorithms are used just as a preprocessing step, thus there is no need to revise the current indexing techniques and the query processing algorithms. We introduce the tuple reordering problem, which aims to reorganize database tuples for optimal compression rates. We propose Gray code ordering algorithm for this NP-Complete problem, which is an inplace algorithm, and runs in linear time in the order of the size of the database. We also discuss how the tuple reordering problem can be reduced to the traveling salesperson problem. Our experimental results on real data sets show that the compression ratio can be improved by a factor of 2 to 10.
A New Aspect for the Optimization of Fuzzy If-Then Rules
Authors: Claudio Moraga, Rodrigo Salas
Venue: Proceedings of the 35th International Symposium on Multiple-Valued Logic (2005)

Evolutionary optimization of fuzzy if-then rules for approximation is an area of research that has received much attention in the last years. The present paper adds a new possibility by proposing a method for datadriven reshaping or designing the uncertainty transitions of piecewise linear fuzzy sets representing the linguistic terms of the fuzzy rules.
A Category Overlay Infrastructure for Peer-to-Peer Content Search
Authors: Xin Liu, Jun Wang, Son T. Vuong
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

For a Peer-to-Peer (P2P) system which contains huge amount of data, an efficient content search technique is definitely necessary. In this paper, we present a novel category overlay search infrastructure which can sit on top of existing unstructured P2P systems, such as Gnutella. The intuition behind our work is that by clustering the whole peer group into clusters and mapping the predefined category domain to clusters, multiple category overlays can be constructed and a search can be restricted within only some specific overlays, thus the search efficiency can be improved dramatically. Our preliminary simulation shows that this infrastructure can provide efficient search service, even in a highly dynamic network environment.
Spoken dialogue processing method using inductive learning with genetic algorithm
Authors: Yasutomo Kimura, Kenji Araki, Yoshio Momouchi, Koji Tochinai
Venue: Systems and Computers in Japan (2004)

This paper describes a spoken dialogue processing, which includes the learning using spoken dialogue examples. Most of the spoken dialogue systems up to the present are task-oriented, where the processing is based on the prespecified generation rules and database. It is then difficult to handle various topics, such as miscellaneous talks in daily dialogue. In the proposed method, the dialogue between the system and the user is processed as the spoken dialogue example, and the rule is acquired based on the pair of system response and user utterance, through inductive learning using the genetic algorithm. In other words, it is not necessary to prepare the training data beforehand, but the response is composed using the rules acquired from the actual dialogue examples. With this approach, the learning can be executed based on the dynamic data, and the deviation depending on the data is reduced. It is intended in this paper to examine the usefulness of the proposed method. Miscellaneous talks are considered. ELIZA-type system, which is extended to the spoken dialogue, and the proposed method are compared through a comparison experiment and an experiment with multiple examinees. As a result, it is verified that the total ratio of the correct and almost correct responses is improved from 66.3&percnt; to 76.1&percnt;, and the effective responses can be constructed using the rules acquired from actual dialogue examples. This improvement of 9.8 points indicates that the proposed method is effective in handling miscellaneous talks. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 67&ndash;82, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10204
A pulse neural network reinforcement learning algorithm for partially observable Markov decision processes
Authors: Koichiro Takita, Masafumi Hagiwara
Venue: Systems and Computers in Japan (2005)

This paper considers learning by a pulse neural network and proposes a new reinforcement learning algorithm focusing on the ability of pulse neuron elements to process time series. The conventional integrator neuron element is modeled in terms of the average firing rate of the biological neuron. But the pulse neuron is a modeling of the input&ndash;output relation of the time-series pulse (spike) and the decay of the internal state (internal potential). The application of such neural networks has been considered in recent engineering studies. It is known in particular that a pulse neuron with a high decay rate acts as a coincidence detector. The proposed model combines pulse neuron elements with different decay rates, which facilitates the processing of the time-series input information and the discrimination of fuzzy states in a partially observable Markov decision process. The proposed network is a four-layered feedforward network in which the pulse neuron elements forming the two hidden layers provide a pseudo-representation of the state in the environment. The elements generate a secondary reinforcement signal which results in learning similar to the conventional reinforcement scheme based on the state evaluation function. A computer experiment verifies that the proposed model works effectively in an environment which is strongly partially observable. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(3): 42&ndash;52, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10645
Comparative and Functional Genomics: Special Section Front Page - A Special Section of selected reviews from the Plant & Animal Genome XII Conference - Plant and Animal Genome XII Conference - San Diego, California
Authors: Staff
Venue: Comparative and Functional Genomics (2004)

For free access to the articles, visit: &mdash; the CFG website (HTML and PDF formats) &mdash; the PAG website (PDF format).Plant Genome I was held 12 years ago in November 1992. In January 1997, the conference expanded its remit (to include livestock), becoming Plant and Animal Genome V. The conference has included plant and animal genome sessions every year since then. Each year the attendee numbers grow and at least one research group breaks the news of a significant achievement at the conference, indicating its importance to each of the communities holding workshops there. Abstracts from all of the past meetings are available for searching from the PAG website: . Copyright &copy; 2004 John Wiley & Sons, Ltd. 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
QoSMig: Adaptive Rate-Controlled Migration of Bulk Data in Storage Systems
Authors: Koustuv Dasgupta, Sugata Ghosal, Rohit Jain, Upendra Sharma, Akshat Verma
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Logical reorganization of data and requirements of differentiated QoS in information systems necessitate bulk data migration by the underlying storage layer. Such data migration needs to ensure that regular client I/Os are not impacted significantly while migration is in progress. We formalize the data migration problem in a unified admission control framework that captures both the performance requirements of client I/Os and the constraints associated with migration. We propose an adaptive rate-control based data migration methodology, QoSMig, that achieves the optimal client performance in a differentiated QoS setting, while ensuring that the specified migration constraints are met. QoSMig uses both long term averages and short term forecasts of client traffic to compute a migration schedule. We present an architecture based on Service Level Enforcement Discipline for Storage (SLEDS) that supports QoSMig. Our trace-driven experimental study demonstrates that QoSMig provides significantly better I/O performance as compared to existing migration methodologies.
Artifacts and collaborative work in healthcare: methodological, theoretical, and technological implications of the tangible
Authors: Yan Xiao
Venue: Journal of Biomedical Informatics (2005)

Although modeled as knowledge work with emphasis on data flow and decision making, healthcare is delivered in the context of a highly structured physical environment, with much effort and emphasis placed on physical and spatial arrangement and re-arrangement of workers, patients, and materials. The tangible aspects of highly collaborative healthcare work have profound implications for research and development of information and communication technology (ICT) despite the tendency to model work as flow of abstract data items. This article reviews field studies in healthcare and other domains on the role of artifacts in collaborative work and draws implications in three areas: methodological, theoretical, and technological. In regard to methodologies, assessment of new ICT and development of user requirements should take into account how artifacts are used and exploited to facilitate collaborative work. In regard to theories, the framework of distributed cognition provides a starting point for modeling the contribution and exploitation of physical artifacts in supporting collaborative work. In regard to technology, design and deployment of new technology should support the functions provided by physical artifacts replaced or disrupted by new technology, and profitable ways for new technology to support collaborative work by embedding ICT into existing infrastructure of physical artifacts.
Mobility Work: The Spatial Dimension of Collaboration at a Hospital
Authors: Jakob E. Bardram, Claus Bossen
Venue: Computer Supported Cooperative Work (2005)

We posit the concept of Mobility Work to describe efforts of moving about people and things as part of accomplishing tasks. Mobility work can be seen as a spatial parallel to the concept of articulation work proposed by the sociologist Anselm Strauss. Articulation work describes efforts of coordination necessary in cooperative work, but focuses, we argue, mainly on the temporal aspects of cooperative work. As a supplement, the concept of mobility work focuses on the spatial aspects of cooperative work. Whereas actors seek to diminish the amount of articulation work needed in collaboration by constructing Standard Operation Procedures (SOPs), actors minimise mobility work by constructing Standard Operation Configurations (SOCs). We apply the concept of mobility work to the ethnography of hospital work, and argue that mobility arises because of the need to get access to people, places, knowledge and/or resources. To accomplish their work, actors have to make the right configuration of these four aspects emerge.
Classpects: unifying aspect- and object-oriented language design
Authors: Hridesh Rajan, Kevin J. Sullivan
Venue: Proceedings of the 27th international conference on Software engineering (2005)

The contribution of this work is the design, implementation, and early evaluation of a programming language that unifies classes and aspects. We call our new module construct the classpect. We make three basic claims. First, we can realize a unified design without significantly compromising the expressiveness of current aspect languages. Second, such a design improves the conceptual integrity of the programming model. Third, it significantly improves the compositionality of aspect modules, expanding the program design space from the two-layered model of AspectJ-like languages to include hierarchical structures. To support these claims, we present the design and implementation of Eos-U, an AspectJ-like language based on C# that supports classpects as the basic unit of modularity. We show that Eos-U supports layered designs in which classpects separate integration concerns flexibly at multiple levels of composition. The underpinnings of our design include support for aspect instantiation under program control, instance-level advising, advising as a general alternative to object-oriented method invocation and overriding, and the provision of a separate join-point-method binding construct.
Air transportation planning using neural networks as an example of the transportation squadron in the Japan Air Self-Defense Force
Authors: Takakazu Kurokawa, Ken Takeshita
Venue: Systems and Computers in Japan (2004)

The task of a squadron at the Japan Air Self-Defense Force (JASDF) is to transport personnel and materials, and the efficient operation of the squadron is a crucial issue in an emergency. However, transportation is planned manually at present, and it is difficult to quickly formulate an efficient plan. In this context, air transportation planning is considered a transport problem, and an air transportation planning method using a mutually coupled neural network composed of binary neurons, while considering the hardware implementation, is proposed. In the proposed neural network, air transportation planning is partitioned into three subproblems, which are successively solved by three neuron blocks. By this provision, the scale of the problem is reduced and the solution is derived efficiently. Several practical problems with various numbers of aircraft and transportation demands are considered, and simulations are performed using the neural network with various parameters. An examination of the results reveals that the proposed neural network is able to determine whether the air transportation planning can be performed with high speed and high accuracy. In other words, the proposed method is an efficient solution method with many advantages. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 46&ndash;56, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10419
An Efficient Image-Based Virtual Tour System
Authors: Qiushuang Zhang, Kan Zhao, Zhiqing Cao, Jiaoying Shi
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Tour Into the Picture (TIP) is a technique that makes animation of a scene from single image. The size of TIP box model, as well as the positions of foreground objects in the model can be calculated by Relative Depth Calculation. To simulate an incline in the image, an algorithm is proposed by us to calculate the slope and the length of an incline model. After that, we present an algorithm that successfully makes integration of TIP and panorama to perform joint multi-scene rendering in our Virtual Tour System. Our Virtual Tour System shows that these techniques have achieved very satisfactory results.
Writing a computer program to play Mastermind that appears to be intelligent
Authors: Joel Gyllenskog
Venue: Issue 84 (April 1983) (1983)

Writing computer programs to play games is a pleasant avocation. To capitalize on this opportunity it makes sense to use the computer's abilities for computation and storage that human competitors lack. Algorithms that are usable by people in a reasonable amount of time are often poor choices for computerization. I believe that Roa's algorithm to play the game of mastermind as published in the October 1982 SIGART Newsletter serves as an example. The algorithm exhibits several fatal flaws:&squ;It is predictable.&squ;It is reproducible.&squ;it performs at the novice level.