ppxscal/embedding_network huggingface dataset:
What Shall We Teach Our Pants?
Authors: Kristof Van Laerhoven, Ozan Cakmakci
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

If a wearable device can register what the wearer is currently doing, it can anticipate and adjust its behavior to avoid redundant interaction with the user. However, the relevance and properties of the activities that should be recognized depend on both the application and the user. This requires an adaptive recognition of the activities where the user, instead of the designer, can teach the device what he/she is doing. As a case study, we connected a pair of pants with accelerometers to a laptop to interpret the raw sensor data. Using a combination of machine learning techniques such as Kohonen maps and probabilistic models, we build a system that is able to learn activities while requiring minimal user attention.
The Sparse Null Space Basis Problem
Authors: Thomas F. Coleman, Alex Pothen
Venue:  (1984)

The sparse null space basis problem is the following: $A t \times n$ matrix $A (t > n)$ is given. Find a matrix $N$, with the fewest nonzero entries in it, whose columns span the null space of $A$. This problem arises in the design of practical algorithms for large-scale numerical optimization problems. Surprisingly, this problem can be formulated as a combinatorial optimization problem under a non-degeneracy assumption on $A$. THe theory of matchings in bipartite graphs marriage theorems can then be used to obtain the nonzero positions in $N$. Numerically stable matrix factorizations are used in the next phase to compute $N$. We use conformal decompositions to characterize the columns of a sparsest null basis. Matroid theory is used to prove that a greedy algorithm constructs a sparsest null basis. We prove that finding a sparsest null basis is NP-hard by showing that associated matroidal and graph-theoretic problems are NP-complete. We propose two approximation algorithms to construct sparse null bases. Both of them make use of the Dulmage-Mendelsohn decomposition of rectangular matrices. One algorithm is a sparsity exploiting variant of the variable-reduction technique. The second is a locally greedy algorithm that constructs a null basis with an upper triangular submatrix. These results are extended to computing sparse orthogonal null bases. We discuss how this ``two-phase'''' approach can construct sparser null bases than a purely numerical approach; it is also potentially faster than the latter. Finally, we classify all known methods for constructing null bases, and show some unexpected equivalences between some of them.
Source to Source Optimizations of CLP($\Re_{Lin}$)
Authors: Viswanath Ramachandran, Pascal Van Hentenryck
Venue:  (1995)

This paper describes the design and implementation of an optimizing compiler for CLP($\Re_{Lin}$), a constraint logic programming language over linear real constraints. The compiler performs a number of source to source optimizations which aim at replacing constraint solving, the basic operation of the language, by assignments (when, at runtime, all but one variables have a fixed value) and tests (when, at runtime, all variables have a fixed value) These optimizations follow the 3R''s methodology which consists of refining, reordering, and removing constraints. The compiler uses abstract interpretation to decide when and how to perform the optimizations. The resulting system (40,000 lines of C, 10,000 of which concern the optimizations) has been evaluated experimentally. Our preliminary results indicate that substantial (often asymptotic) speedups can be obtained. Most of these speedups can be made arbitrary large, since they depend on the input size. This is, to our knowledge, the first operational compiler for CLP($\Re_{Lin}$) with these functionalities and the first implementation of reordering and constraint removal. It is also a convincing demonstration that abstract interpretation can be used to produce dramatic speedups for CLP($\Re_{Lin}$) programs.
Neural Data Mining for Credit Card Fraud Detection
Authors: R. Brause, T. Langsdorf, M. Hepp
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

The prevention of credit card fraud is an important application for prediction techniques. One major obstacle for using neural network training techniques is the high necessary diagnostic quality: Since only one financial transaction of a thousand is invalid no prediction success less than 99.9% is acceptable. Due to these credit card transaction proportions complete new concepts had to be developed and tested on real credit card data. This paper shows how advanced data mining techniques and neural network algorithm can be combined successfully to obtain a high fraud coverage combined with a low false alarm rate.
Double parity sparing for performance improvement in disk arrays
Authors: Min-Young Lee, Myong-Soon Park
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

RAID level 5 disk arrays provide highly reliable, cost effective secondary storage with high performance for reads and large writes. Small writes, however, cause the degradation of their performance, since small writes need additional disk accesses to update parity data. There have been many studies to overcome this problem. In this paper, we propose a new technique, double parity sparing, which is a variation of disk array with a spare. To improve the parity update process, the proposed scheme uses a spare block and a parity block as two available parity blocks. We present results from simulations to show that the proposed scheme offers better performance while there is no failure in disk arrays.
Reliable Synchronization Primitives for Java
Authors: Paolo A. G. Sivilotti, K. M Chandy
Venue:  (1996)

Java is an architecture-independent, object-oriented language designed to facilitate code-sharing across the Internet in general, via the Web in particular. Java is multithreaded, providing thread creation and synchronization constructs based on generalized monitors. Although these primitives are appropriate for many windowing applications, they are not necessarily well-suited for the larger class of multithreaded programs that occur as part of distributed systems. We demonstrate how the Java primitives, in conjunction with the object-oriented aspects of the language, can be used to implement a collection of other traditional synchronization paradigms. These paradigms are formally specified, their implementations are rigorously verified, and their use is illustrated with several examples.
Truth-as-simulation: towards a coalgebraic perspective on logic and games
Authors: Alexandru Baltag
Venue:  (1999)

Building on the work of L. Moss on coalgebraic logic, I study in a general setting a class of infinitary modal logics for F-coalgebras, designed to capture simulation and bisimulation. For a notion of coalgebraic simulation, I use the work of A. Thijs on modelling simulation in terms of relators (extensions of SET-functors along some family of preoders): simulation is the analogue for relators of the notion of bisimulation for functors. I prove the logics introduced here can indeed capture coalgebraic simulation and bisimulation. Moreover, one can characterize any given coalgebra up to simulation (and, in certain conditions, up to bisimulation) by a single sentence. An interesting feature of this logics is that their notion of truth or satisfaction can be understood as a simulation relation itself, but with respect to a (relator associated to a) richer functor; moreover, truth is the largest simulation, i.e. the similarity relation between states of the coalgebra and elements of the language. This sheds a new perspective on the classical preservation and characterizability results, and also on logic games. The two kinds of games normally used in logic (``truth games'''' to define the semantics dynamically, and ``similarity games'''' between two structures) are seen to be the same kind of game at the level of coalgebras: simulation games. 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
End-to-End Scheduling in Real-Time Packet-Switched Networks
Authors: Ian R. Philp, Jane W. S. Liu
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

This paper presents the budgeted-weighted-round-robin (BWRR) algorithm for scheduling the transmission of hard-real-time messages in a packet-switched network. The BWRR algorithm provides a bound on the worst case delay of a message through the network. In addition, with the BWRR algorithm, the necessary buffer space at each switch is predictable and can be fixed at system configuration time. The per switch delay and required buffer space provided by the BWRR algorithm are significantly less than those provided by previous methods. The BWRR algorithm has a simple hardware implementation and admission test, and it does not require a global clock or any explicit flow control messages. It can achieve high utilization of the network under most practical scenarios and reacts predictably under transient overloads.
Visualisation of Construction Costs and Techniques of Employment-Intensive Road Construction in Developing Areas
Authors: Filip L. M. Taylor Parkins
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Employment generation in the construction of economically efficient infrastructure can contribute to the alleviation of poverty. Practical Choice of Technique Analysis (COTA-P) is a tool that enables decision-makers to estimate the financial and socio-economic costs involved in a construction. COTA-P looks at the construction from an employment-intensive perspective, with the underlying idea to substitute as much labour for machines as is feasible, and to promote the use of local labour in underdeveloped and poor areas. COTA-P consists of a technical screening phase, a financial and socio-economical screening phase, and thirdly the monitoring and evaluation phase. Each phase analyses the possibility of the enhanced use of labour. COTA-P is programmed in a Windows 32-bit environment, and gives the user maximum user-friendliness, while allowing for extensive manipulation of the core variables and parameters, thus enabling the user to analyse various scenarios in a short time. 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
Modelling vertical response of railway freight wagons due to track irregularities
Authors: D. W. O'Dwyer, D. P. Hegarty, B. Basu
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper is concerned with the calculation of peak wheel-rail contact loads associated with flatbed rail two-axle freight wagons. The research described in the paper is part of ongoing research being undertaken in the Departments of Civil Engineering at Trinity College Dublin and N.U.I. Galway in conjunction with Iarnród Éireann. The contact forces between rail and wheel is a very important factor in the design of railway track and rolling stock suspension systems. From the track viewpoint, the peak loading determines the rail section required and places limits on the levels of track irregularity that are acceptable. From a rolling stock viewpoint, the suspension characteristics are a major influence on the peak loadings.The paper details the dynamic analysis of flatbed rail freight wagons in both the time and frequency domain. A simple two-degree of freedom model is developed and closed form solutions are presented for the analysis of this model in the frequency domain. The systems calculated response, transfer functions, are calculated and combined with the power spectral density function describing vertical rail alignment to calculate the peak rail-wheel contact forces.
Autonomous Information Provision to Achieve Reliability for Users and Providers
Authors: H. Farooq Ahmad, Guanghe Sun, Kinji Mori
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The rapid growth of information technology and the Internet give rise to an increasing demand for information services. A large number of service providers offer information services to diversified users on the Internet. Users' requirements are heterogeneous and change very quickly. Popular servers are overloaded and cannot dynamically adapt to meet users' heterogeneous requirements. It is necessary to design an information service system that can meet users' heterogeneous requirements for services, and adaptability of services to cope with ever-changing situations to provide assurance. Faded information field architecture and Push/Pull mobile agent technologies have been proposed as basic components of an autonomous information service system to achieve these goals. The system has been proposed from users' and providers' points of view, and therefore techniques, for balancing users' and providers' costs are required for realization of the system. The system leads toward dynamic and autonomous information allocation, in which each node on the network may determine information amount based on push/pull cost of mobile agents. In this paper, we propose initial construction of faded information field based on providers' and users' heterogeneous reliability requirements. Through rate is used to reconstruct faded information field, dynamically and autonomously. We prove the effectiveness of the proposed technology through simulation.
Texture-Based Image Retrieval without Segmentation
Authors: Yossi Rubner, Carlo Tomasi
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Image segmentation is not only hard and unnecessary for texture-based image retrieval, but can even be harmful. Images of either individual or multiple textures are best described by distributions of spatial frequency descriptors, rather than single descriptor vectors over pre-segmented regions.A retrieval method based on the Earth Movers Distance with an appropriate ground distance is shown to handle both complete and partial multi-textured queries. As an illustration, different images of the same type of animal are easily retrieved together. At the same time, animals with subtly different coats, like cheetahs and leopards, are properly distinguished.
An Assessment of the Relative Efficiency of a Facilitator-Driven Requirements Collection Process with Respect to the Conventional Interview Method
Authors: Rick Hubbard, Charles N. Schroeder, Nancy R. Mead
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

A case is made for the use of ¿Facilitator-Driven¿ Requirements collection processes-within suitable parameters-as opposed to the ¿Conventional Interview Method.¿ Based on the principal author's professional experience, this experience-based report presents a comparative and normalized analysis of eight Facilitator-Led requirements collection sessions with respect to four Conventional Interview Method requirements collection processes. The relative efficiency of the two methods is compared statistically, and conclusions are drawn regarding the improvements in the requirements collection process attributable to the use of the Facilitator-Driven approach.
Abstractions for Fault Tolerance in Distributed Systems
Authors: Fred B. Schneider
Venue:  (1986)

Abstractions useful in fault-tolerant and distributed systems are described. The abstractions are specified as properties of protocols, hence they have a different flavor from abstractions prevalent in sequential and concurrent programming. Among the abstractions discussed are agreement, order, failure detection, and stable storage.
Population dynamics in a radically epistatic genetic system
Authors: J. R. Gattiker, D. S. Wilson
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

A genetic system that uses a radically epistatic mapping from genotype to phenotype is defined. This system is proposed in order to study the population dynamics rather than create a new system for function optimization. Two behaviors not found in traditional genetic systems are explored: first, although the genetic system uses only simple generational recombination and fitness scaling, it is capable of distributing a population of solutions on a number of non-adjacent phenotype peaks. This capability is analyzed and empirically explored. Second, the genetic system is shown to have the capability of tracking an environment where the adaptive peaks are changed in a recurrent manner.
Resolved: Software Maintenance is Nothing More than Another Form of Development
Authors: Norman Schneidewind, Barbara Kitchenham, Frank Niessink, Janice Singer, Anneliese von Mayrhauser, Hongji Yang
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

The motivation for this panel and debate grew out of discussions held in Session # 2 at the Third Annual Workshop on Empirical Studies of Software Maintenance, WESS '98, Session # 1 Bethesda, Maryland, November 16, 1998 that dealt with the topic: "What are the differences between maintenance tools tools/methods/skills and those of development". This session had the following participants: A. von Mayrhauser (chair), B. A. Kitchenham, F. Niessink, N. Schneidewind, J. Singer, G. H. Travassos, S. Takada, R. Vehvilainen, and H.Yang.Subsequent to WESS, Barbara Kitchenham and Anneliese von Mayrhauser discussed the possibility of our group producing a paper on the Ontology of Maintenance. Then a technical report was published on the subject [1]. This paper is based largely on the ideas expressed in that report.
Towards Characterizing Network Representable Polymatroids
Authors: W W Bein, Peter Brucker, F M M Stallmann.
Venue:  (1988)

Meggido [1974] showed that the maximum flow through sets of sources in a multiple sink flow network is a polymatroidal function. Recently, Federgruen and Groenevelt [1985], [1986] have considered polymatroids that can be represented by a multiple source flow network and have improved the running time of an important scheduling application. We give a characterization of network representability and link representable polymatroids to the theory of gammoids.
Web-Based Analysis for Competitive Intelligence
Authors: Conor Vibert
Venue:  (2003)

:Responding to the needs of market researchers, business analysts, CI professionals, and others who understand and use the online information resources of the Internet, Vibert provides a structured set of frameworks to help solve business problems fast, successfully, and in real time. He explains how to use the content of specific Web sites to undertake specific tasks, and he provides academics and trainers with a powerful tool to help them develop the online analytical skills of their students, clients, and colleagues. The result is an important resource for executives seeking to protect their own knowledge while gaining insight about their competitors and for academics teaching in such fields as marketing, sales, and product development.
A performance study of selective cell discarding using the end-of-packet indicator in AAL type 5
Authors: A. E. Kamal
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The ATM adaptation layer type 5 (AAL5) is a new adaptation layer protocol for the ATM layer of broadband integrated services digital networks. Among several features, it is unique in the sense that it includes an end-of-packet (EOP) indicator in the header of the ATM cell (the ATM-layer-user-to-ATM-layer-user (AUU) parameter in the payload type (PT) field). It was previously suggested that the use of this indicator may be used to provide a means by which buffer occupancy can be reduced by dropping cells from already incomplete packets (Armitage, 1993). The objective of this paper is to study the performance of this layer and the effectiveness of the EOP indicator. The performance measures of interest are the probability of packet loss and the mean packet delay. An approximate analytical model is constructed in which the blocking of a tagged source is kept track of in an exact manner. The rest of the sources are modeled approximately. The accuracy of the model is enhanced through an iterative approach. A simulation model is also constructed to assess the accuracy of the approximate model.
Tight Upper Bounds for Cell Loss Probabilities in ATM Multiplexers and Required Bandwidth Estimation
Authors: Xiaoming Liu, Danny H. K. Tsang, Liming Liu, Brahim Bensaou
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traffic control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-off sources with exponentially distributed on and off periods. Based on this approximation, a simple and accurate method is proposed to estimate the aggregate required bandwidth by a given mix of traffic to guarantee a given cell loss probability.
Quantum Computation and Information: AMS Special Session Quantum Computation and Information, Washington, D.C., January 19-21, 2000
Authors: Samuel J. Lomonaco, Howard E. Brandt
Venue:  (2002)

:"The papers in this volume give readers a broad introduction to the many mathematical research challenges posed by the new and emerging field of quantum computation and quantum information. Of particular interest is a long paper by Lomonaco and Kauffman discussing mathematical and computational aspects of the so-called hidden subgroup algorithm." This book is the companion volume to Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, Volume 58 in the Proceedings of Symposia in Applied Mathematics series.
Geometric Ambiguities in Boundary Representations
Authors: Christoph M. Hoffmann, John E. Hopcroft
Venue:  (1986)

Boundary representations are usually separated into two components, a topological component and a geometric component. The conditions necessary to insure that the topological component is unambiguous are well understood. However, in algebriac modeling systems (as opposed to polyhedral modeling systems), an unambiguous topological structure can have noncongruent geometric interpretations with identical vertex coordinates, face equations and edge descriptions using the usual representation of edges as the intersection of faces along with tangent vectors at vertices. This means that the conversion of a CSG tree that unambiguously describes a solid can lead to an ambiguous boundary representations unless additional information is retained in the boundary representation. This paper examines the source of these ambiguities and presents one method for their elimination.