ppxscal/embedding_network huggingface dataset:
Google: or how I learned to love terabytes
Authors: Urs Hoelzle
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Search is one of the most important applications used on the internet, but it also poses some of the most interesting challenges in computer science. Providing high-quality search requires understanding across a wide range of computer science disciplines, from lower-level systems issues like computer architecture and distributed systems to applied areas like information retrieval, machine learning, data mining, and user interface design.In this talk I'll share some interesting observations and measurements obtained at Google, and will illustrate the behind-the-scenes pieces of infrastructure (both hardware and software) that we've built in order to extract this information from many terabytes of data.
Microarray gene expression data association rules mining based on BSC-tree and FIS-tree
Authors: Xiang-Rong Jiang, Le Gruenwald
Venue: Data Knowledge Engineering (2005)

In this paper we propose to use association rules to mine the association relationships among different genes under the same experimental conditions. These kinds of relations may also exist across many different experiments with various experimental conditions. In this paper, a new approach, called FIS-tree mining, is proposed for mining the microarray data. Our approach uses two new data structures, BSC-tree and FIS-tree, and a data partition format for gene expression level data. Based on these two new data structures it is possible to mine the association rules efficiently and quickly from the gene expression database. Our algorithm was tested using the two real-life gene expression databases available at Stanford University and Harvard Medical School and was shown to perform better than the two existing algorithms, Apriori and FP-Growth.
Robust Control: A Note on the Response of the Control to Changes in the "Free" Parameter Conditional on the Character of Nature
Authors: Fidel Gonzalez, Arnulfo Rodriguez
Venue: Computational Economics (2004)

In this paper an analytical framework similar to a robust control problem was developed for the one-state, one-control variable model to examine the response of the control to changes in the "free" parameter. However, in contrast to Gonzalez and Rodriguez (2003), the sign multiplying the "free" parameter in the criterion function of the min--max problem is positive. We find that this set up corresponds to the case where nature is benevolent while the problem posed by Gonzalez and Rodriguez (2003) corresponds to a malevolent nature. We show that for the benevolent case, the solution is a minimum giving way to an ordinary control problem. In addition, the left side of the discontinuity in Gonzalez and Rodriguez (2003) corresponds to the benevolent case.
Stuck-Open Fault Diagnosis with Stuck-At Model
Authors: Xinyue Fan, Will Moore, Camelia Hora, Guido Gronthoud
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

While most of the fault diagnosis tools are based on gate level fault models, many faults are actually at the transistor level. The stuck-open fault is one of them. In this paper we introduce a stuck-open fault diagnosis method based on the stuck-at fault model. First we investigate how stuck-open faults show in the stuck-at diagnosis. Based on the stuck-at diagnosis result, a transformation method is used to represent stuck-open faults. This method transforms the transistor level circuit description to a gate level description so that the stuck-open faults can be diagnosed directly by any of the stuck-at fault diagnosis tools. After the transformation, all the stuck-open faults are fully diagnosed by FALOC, a gate level fault diagnosis tool from Philips.
A model of data integrity
Authors: W. Douglas Varney, Elizabeth A. Unger
Venue: ACM SIGSMALL/PC Notes (1990)

The Clark and Wilson model for expressing data integrity constraints is based upon the principles of segregation of duty and assures the manipulation of data only by well formed transactions. In this paper we propose a model using the Clark and Wilson principes and incorporating an attribute grammar to test if the data has integrity from a user's perspective. The definition that data either has integrity or it fails to have integrity is maintained but a set of qualities of data, e.g., age of the data are allowed to be specified by the data administrator or user. These qualities are used to ascertain whether a datum has met the specified quality.
WHAT MAKES A GOOD DESIGN QUESTION?
Authors: Victoria Bellotti, Allan MacLean, Thomas Moran
Venue: ACM SIGCHI Bulletin (1991)

Designers ask questions throughout the design process. The resulting arguments about how best to answer them are critical in justifying solutions, but are rarely recorded. We are developing a representation of design rationale called QOC (Questions, Options and Criteria) which captures just such information (MacLean et al, 1991). It encourages evaluation of a broader range, or design space, of solutions than designers might otherwise consider.
The Impact of Agile Methods on Software Project Management
Authors: Michael Coram, Shawn Bohner
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

As more and more software projects engage Agile Methods, there are emerging patterns of success and failure. With growing adoption of Agile Methods, project managers increasingly need to understand the applicability to their projects and factors that drive key project performance characteristics. While some organizations affirm that Agile Methods solve all their problems, few have shown consistent success over a range of typical software projects. Agile Methods have advantages, especially in accommodating change due to volatile requirements. However, they also present concomitant risks with managing the many dependent pieces of work distributed across a large project. Use of Agile Methods therefore presents a set of tradeoffs. This paper examines the impact of Agile Methods on the people involved in a project, the process under which a project is developed, and on the project itself in an attempt to allow project managers to evaluate the applicability using an agile method.
Disk Paxos
Authors: Eli Gafni, Leslie Lamport
Venue: Distributed Computing (2003)

We present an algorithm, called Disk Paxos, for implementing a reliable distributed system with a network of processors and disks. Like the original Paxos algorithm, Disk Paxos maintains consistency in the presence of arbitrary non-Byzantine faults. Progress can be guaranteed as long as a majority of the disks are available, even if all processors but one have failed.
Building Responsive TMR-Based Servers in Presence of Timing Constraints
Authors: Paul Ezhilchelvan, Jean-Michel Helary, Michel Raynal
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

This paper is on the construction of a fault-tolerant and responsive server subsystem in an application context where the subsystem is accessed through an asynchronous network by a large number of clients.The server is made fault-tolerant by the Triple Modular Redundancy (TMR) technique: at least two server processes behave correctly, while the third one can behave arbitrarily.An essential requirement for process replication is that the client inputs be delivered to server replicas for processing in an identical order.Moreover, in order to cope with process' memory requirement, a time bound constraint is imposed: no client input can stay in the local memory of a server process more than ¿ units of time.Based on known technologies, two assumptions are made: (1) the network delivers a given client input to any two server processes within a known bounded time (D), and (2), there is an Ordered Timed Atomic Broadcast protocol built on top of the TMR system with timeliness ¿.The paper presents two results.The first is a protocol that delivers an ordered stream of client inputs, such that every client input is delivered exactly once to each correct server, thus eliminating redundant verification.It works under the assumption ¿ > D + ¿.The second is an impossibility result, namely there can be no ordering protocol where ¿ > D + ¿, where ¿ is the minimum timeliness of any reliable broadcast protocol that can be implemented on top of the TMR server (¿ ¿ ¿).
In memoriam: Hirondo Kuki: Apr. 25, 1925 - Dec. 28, 1971
Authors: W. Kahan
Venue: ACM SIGNUM Newsletter (1972)

Computer professionals everywhere will have occasion to share with Hirondo's family and friends that sense of grievous loss evoked by his premature death. Almost all of us who do scientific calculations on IBM equipment benefit unknowingly from his craftsmanship, unknowingly because Hirondo was too self-effacing to secure the public recognition his work deserves. Let us mark his passing by acknowledging how much we owe him.
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
Authors: Vishal Suthar, Shantanu Dutt
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability, even in presence of clustered faults, a fault pattern for which previous BIST methods proved ineffective. Unlike previous BIST methods which unrealistically assume that the test circuitry used for testing PLBs is fault-free, our method, via an iterative bootstrapping process, first finds this fault-free test circuitry and then starts testing the PLBs. Also, unlike previous methods, our fault detection process does not require any unrealistic assumptions of fault-free status of some components or the existence of only some fault patterns (and the exclusion of others) in the FPGA. Our adaptive fault diagnosis process is more time efficient than its previous counterparts as it does not require testing of all the PLBs of a faulty BIST area, and its design is simpler in the sense that it does not require multiple modifications of the testing area for its implementation. We also analyze the probability of correct diagnosis in the presence of multiple faults. Our BIST technique gives excellent fault coverage and fault latency results, and supports the theoretical analysis.
AVP: A Highly Efficient Transport Protocol for Low Bit Rate Multimedia Communications
Authors: Jianyu Dong, Chao He, Yuan F. Zheng, Robert L. Ewing
Venue: Multimedia Tools and Applications (2005)

Utilization of Internet communications in distance learning, distributed simulation, and distributed work groups involves multimedia transmission of animation, voice and video clips. Highly compressed audio-video data protocols are required for efficient Internet multimedia communications. Addressing this requirement, a new transport protocol called Audio-Video Protocol (AVP) for highly efficient multimedia communications on the Internet is presented. While providing similar real-time delivery functions as Real-Time Transport Protocol (RTP) and Real-Time Control Protocol (RTCP), AVP adopts a novel audio-based synchronization scheme. This synchronization scheme has two advantages. One is the overhead reduction through eliminating the timestamp in each transmitted data packet. The other is the packet rate reduction by putting multiple audio frames or mixed audio-video frames in a single AVP packet. As a result, the end-to-end media unit delay is reduced while achieving implicit synchronization. Furthermore, AVP provides adaptive quality of service (QoS) by the prioritized packetization scheme. Simulation results are presented to verify the advantages of the AVP protocol.
Design and Performance of 155 Mbps Clock/Data Recovery Circuits on Heavy Loaded PLDs
Authors: Rui L. Aguiar, Mónica Figueiredo
Venue: Analog Integrated Circuits and Signal Processing (2005)

This paper discusses the design and performance of all-digital clock and data recovery mechanisms integrated in low-cost PLDs. Two designs have been explored and analyzed, using data sampling systems with phase detection and decision logic to select either the most appropriate sample as the recovered data or the most appropriate phase as the recovered clock. These mechanisms have been implemented in low cost PLDs from two major manufacturers. These PLDs have been further heavily loaded with typical communications functions, and the performance of the clock/data recovery circuits has been analyzed. The results show that different architectures behave differently, and that internal noise can significantly impair the performance of the circuit for high operating frequencies. This poses large difficulties to the re-usage of these blocks as generic virtual components. Nevertheless their overall performance typically exceeds regular telecommunications requirements.
Top-Down Analysis of Path Compression
Authors: Raimund Seidel, Micha Sharir
Venue: SIAM Journal on Computing (2005)

We present a new analysis of the worst-case cost of path compression, which is an operation that is used in various well-known "union-find" algorithms. In contrast to previous analyses which are essentially based on bottom-up approaches, our method proceeds top-down, yielding recurrence relations from which the various bounds arise naturally. In particular the famous quasi-linear bound involving the inverse Ackermann function can be derived without having to introduce the Ackermann function itself.
P2PDisCo - Java Distributed Computing for Workstations Using Chedar Peer-to-Peer Middleware
Authors: Kotilainen N., M. Vapa, M. Weber, J. Toyryla, J. Vuori
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

This paper introduces Peer-to-Peer Distributed Computing (P2PDisCo) software, which provides an interface for distributing the computation of Java programs to multiple workstations. P2PDisCo can be used to distribute any Java program that uses files for storing input and output parameters without significant code modifications to the Java program itself. P2PDisCo has been built over Chedar peer-to-peer middleware and is currently being used for speeding up the training of neural networks with evolutionary algorithm.
Dynamic Control of a Large Scale of Pneumatic Multichain Systems
Authors: M. Guihard, P. Gorce
Venue: Journal of Robotic Systems (2004)

The aim of this paper is to propose a general principle able to manage the supervision, coordination, and control problems of a large scale of multichain structures in dynamic and interacting tasks. The main originality lays in its modular feature. The number of chains and of joint per chain are indeed not restricted. The only assumption is that all the chains are linked to a principal element from which the dynamic stability will be computed. This is for example the case for multi-finger and multi-legged structures for which respectively the palm and the trunk represent the principal element. The principle consists in controlling the stability of this element and distributing the effort on the other chains to maintain the stability of the whole. To increase the compliant feature, we consider that each joint is pneumatically actuated. Each joint is then dynamically controlled to ensure the asymptotic stability of the local chain it belongs to. A global architecture is presented where each part is detailed. An example is then displayed showing the performances of a two-legged robot in the standing posture under external perturbation effects. &copy; 2004 Wiley Periodicals, Inc.
Production Scheduling by Reachability Analysis - A Case Study
Authors: Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Angelika Mader
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness of timed automata allows - unlike many classical approaches - the modelling of scheduling problems of very different kinds. Furthermore, the models are robust against changes in the parameter setting and against changes in the problem specification. This paper presents a case study that was provided by Axxom, an industrial partner of the AMETIST project. It consists of a scheduling problem for lacquer production, and is treated with the timedautomata approach. A number of problems have to be addressed for the modelling task: the information transfer from the industrial partner, the derivation of timed automaton model for the case study, and the heuristics that have to be added in order to reduce the search space. We try to isolate the generic problems of modelling for model checking, and suggest solutions that are also applicable for other scheduling cases. Model checking experimentsand solutions are discussed.
Industry Watch
Authors: Robert Dale
Venue: Natural Language Engineering (2005)

One way to keep in touch with what is happening in the commercial speech and language technology world is to pay occasional visits to the websites of HLT Central (at www.hltcentral.org) and LT World (at www.lt-world.org). Both sites provide links to news stories and press releases from companies and other organizations active in the area. The people who run these sites trawl the web for news stories of relevance, saving you the trouble of doing that yourself.
A Framework of 2D Fisher Discriminant Analysis: Application to Face Recognition with Small Number of Training Samples
Authors: Hui Kong, Lei Wang, Eam Khwang Teoh, Jian-Gang Wang, Ronda Venkateswarlu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

A novel framework called 2D Fisher Discriminant Analysis (2D-FDA) is proposed to deal with the Small Sample Size (SSS) problem in conventional One-Dimensional Linear Discriminant Analysis (1D-LDA). Different from the 1D-LDA based approaches, 2D-FDA is based on 2D image matrices rather than column vectors so the image matrix does not need to be transformed into a long vector before feature extraction. The advantage arising in this way is that the SSS problem does not exist anymore because the between-class and within-class scatter matrices constructed in 2D-FDA are both of full-rank. This framework contains unilateral and bilateral 2D-FDA. It is applied to face recognition where only few training images exist for each subject. Both the unilateral and bilateral 2D-FDA achieve excellent performance on two public databases: ORL database and Yale face database B.
Effect of Mobility on the Critical Transmitting Range for Connectivity in Wireless Ad Hoc Networks
Authors: Guanghui Zhang, Jiandong Li, Yanhui Chen, Jing Liu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The effect of mobility on the critical transmitting range in wireless ad hoc networks is discussed in this paper. A new parameter, pause probability ppause , which is the function of the minimum velocity Vmin , the maximum velocity Vmax and the pause time tpause of random waypoint (RWP) mobility model, is defined. Simulation results show that the effect of RWP parameter on the critical transmitting range is determined by ppause , that is, if ppause is smaller than 0.5, the critical transmitting range of mobile network is about 10 percent larger than that of stationary one, else it equal that of stationary network approximately. If the values of tpause , Vmin and Vmax are given, their effect on the critical transmitting range is determined since ppause is the function of them.
SCIMA-SMP: on-chip memory processor architecture for SMP
Authors: Chikafumi Takahashi, Masaaki Kondo, Taisuke Boku, Daisuke Takahashi, Hiroshi Nakamura, Mitsuhisa Sato
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

In this paper, we propose a processor architecture with programmable on-chip memory for a high-performance SMP (symmetric multi-processor) node named SCIMA-SMP (Software Controlled Integrated Memory Architecture for SMP) with the intent of solving the performance gap problem between a processor and off-chip memory. With special instructions which enable the explicit data transfer between on-chip memory and off-chip memory, this architecture is able to control the data transfer timing and its granularity by the application program, and the SMP bus is utilized efficiently compared with traditional cache-only architecture. Through the performance evaluation based on clock-level simulation for various HPC applications, we confirmed that this architecture largely reduces the bus access cycle by avoiding redundant data transfer and controlling the granularity of the data movement between on-chip and off-chip memory.
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows
Authors: Olli Bräysy, Wout Dullaert, Michel Gendreau
Venue: Journal of Heuristics (2004)

This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval. All routes start and end at the depot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle. The main types of evolutionary algorithms for the VRPTW are genetic algorithms and evolution strategies. In addition to describing the basic features of each method, experimental results for the benchmark test problems of Solomon (1987) and Gehring and Homberger (1999) are presented and analyzed.
Radiation changes in atmospheric waves dynamics and spectra
Authors: V. M. Somsikov, K. E. Dungenbaeva, B. Ganguly
Venue: Mathematics and Computers in Simulation (2004)

Spectral characteristics of acoustic-gravitational waves disturbance in a two-component medium consisting of gas and radiation are studied in this work. The dispersion equation of atmospheric waves is obtained and the fact that the effect of radiation to the atmospheric free oscillation is considerable at some atmospheric heights is shown. Some features of spectral characteristics of wave disturbance in the atmosphere, which are due to the interaction of solar radiation field and atmospheric gas are analyzed.
Model-Driven Trust Negotiation for Web Services
Authors: Halvard Skogsrud, Boualem Benatallah, Fabio Casati
Venue: IEEE Internet Computing (2003)

The Trust-Serv trust negotiation framework supports policy lifecycle management for Web services.