ppxscal/embedding_network huggingface dataset:
Learning and Detecting Activities from Movement Trajectories Using the Hierarchical Hidden Markov Models
Authors: Nam T. Nguyen, Dinh Q. Phung, Svetha Venkatesh, Hung Bui
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Directly modeling the inherent hierarchy and shared structures of human behaviors, we present an application of the hierarchical hidden Markov model (HHMM) for the problem of activity recognition. We argue that to robustly model and recognize complex human activities, it is crucial to exploit both the natural hierarchical decomposition and shared semantics embedded in the movement trajectories. To this end, we propose the use of the HHMM, a rich stochastic model that has been recently extended to handle shared structures, for representing and recognizing a set of complex indoor activities. Furthermore, in the need of real-time recognition, we propose a Rao-Blackwellised particle filter (RBPF) thatefficiently computes the filtering distribution at a constant time complexity for each new observation arrival. The main contributions of this paper lie in the application of the shared-structure HHMM, the estimation of the modelýs parameters at all levels simultaneously, and a construction of an RBPF approximate inference scheme. The experimental results in a real-world environment have confirmed our belief that directly modeling shared structures not only reduces computational cost, but also improves recognition accuracy when compared with the tree HHMM and the flat HMM.
Robust morphing of point-sampled geometry: Research Articles
Authors: Chunxia Xiao, Wenting Zheng, Qunsheng Peng, A. R. Forrest
Venue: Computer Animation and Virtual Worlds (2004)

We propose a novel morphing algorithm for objects represented by point-sampled geometry. The fundamental problem of point-sampled geometry morphing is how to set the correspondence between points of the two objects which are usually of different size. The two objects are first parameterized by projecting the sample points onto a common parametric domain. As both objects are densely sampled, we present a novel accelerated parameterization algorithm employing the technique of LOD. The common parameter domain is then split recursively into clusters. The correspondence between sample points of the two objects is established by performing a local mapping in each cluster. As for complex geometries, the establishment of correspondence is facilitated by decomposing the geometry into patches using geodesic decomposition curves.To preserve the features during morphing, a process of features assignment is incorporated. By re-sampling the in-between object dynamically and adaptively, the cracks that would occasionally occur during morphing are successfully eliminated. Experiment results show that our algorithms are fast, stable and easy to implement. High-quality morphing is produced. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Accelerated warmup for sampled microarchitecture simulation
Authors: John W. Haskins,  Jr., Kevin Skadron
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2005)

To reduce the cost of cycle-accurate software simulation of microarchitectures, many researchers use statistical sampling: by simulating only a small, representative subset of the end-to-end dynamic instruction stream in cycle-accurate detail, simulation results complete in much less time than simulating the cycle-by-cycle progress of an entire benchmark. In order for sampled simulation results to accurately reflect the nature the full dynamic instruction stream, however, state in the simulated cache and branch predictor must match or closely approximate state as it would have appeared had cycle-accurate simulation been used for the entire simulation. Researchers typically address this issue by prefixing a period of warmup---in which cache and branch predictor state are modeled in addition to programmer-visible architected state---to each cluster of contiguous instructions in the sample.One conservative, but slow approach is to always simulate cache and branch predictor state, whether among the cycle-accurate clusters, or among the instructions preceding each cluster. To save time, warmup heuristics have been proposed, but there is no one-size-fits-all heuristic for any benchmark. More rigorous, analytical warmup approaches are necessary in order to balance the requirements of high accuracy and rapidity from sampled simulations. This paper explores this issue and in particular demonstrates the merits of memory reference reuse latency (MRRL).Relative to the IPC measured by modeling all precluster cache and branch predictor activity, MRRL generated an average error in IPC of less than 1&percnt; and simultaneously reduced simulation running times by an average of approximately 50&percnt; (or 95&percnt; of the maximum potential speedup).
Object-level ranking: bringing order to Web objects
Authors: Zaiqing Nie, Yuanzhi Zhang, Ji-Rong Wen, Wei-Ying Ma
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level. We collect Web information for objects relevant for a specific application domain and rank these objects in terms of their relevance and popularity to answer user queries. Traditional PageRank model is no longer valid for object popularity calculation because of the existence of heterogeneous relationships between objects. This paper introduces PopRank, a domain-independent object-level link analysis model to rank the objects within a specific domain. Specifically we assign a popularity propagation factor to each type of object relationship, study how different popularity propagation factors for these heterogeneous relationships could affect the popularity ranking, and propose efficient approaches to automatically decide these factors. Our experiments are done using 1 million CS papers, and the experimental results show that PopRank can achieve significantly better ranking results than naively applying PageRank on the object graph.
Parallel implementation of a transportation network model
Authors: Eoin A. O'Cearbhaill, Margaret O'Mahony
Venue: Journal of Parallel and Distributed Computing (2005)

This paper describes the parallel implementation of a transport network model. A 'Single-Program, Multiple Data' (SPMD) paradigm is employed using a simple data decomposition approach where each processor runs the same program but acts on a different subset of the data. The objective is to reduce the execution time of the model. The computationally intensive part of the model is within the assignment and simulation section and therefore this section is parallelised and executed using 1, 2, 4, 8 and 16 processors. The convergence, accuracy and performance of the parallel model are then assessed and compared to the linear implementation. The results indicate a performance increase of over 8 for the parallelised module and a speedup of 5 for the total model when the model is run using 16 processors. The efficiency, average parallelism and efficiency-execution time profile are also discussed. In the context of time savings with 16 processors compared with 1, the time saving on the IBM SP2 are of the order of 80%, and, compared to a linear implementation on a dual processor Intel machine are of the order of 86%.
Creating Converged Trace Schedules Using String Matching
Authors: Satish Narayanasamy, Yuanfang Hu, Suleyman Sair, Brad Calder
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

This paper focuses on generating efficient software pipelined schedules for in-order machines, which we call Converged Trace Schedules. For a candidate loop, we form a string of trace block identifiers by hashing together addresses of aggressively scheduled instructions from multiple iterations of a loop. In this process, the loop is unrolled and scheduled until we identify a repeating pattern in the string. Instructions corresponding to this repeating pattern form the kernel for our software pipelined schedule. We evaluate this approach to create aggressive schedules by using it in dynamic hardware and software optimization systems for an in-order architecture.
Partial equiasymptotic stability of nonlinear dynamic systems
Authors: S. A. Alekseeva, V. I. Vorotnikov, V. A. Feofanova
Venue: Automation and Remote Control (2005)

For nonlinear nonautonomous dynamic systems, partial equiasymptotic stability of the zero equilibrium position, equiasymptotic stability of the "partial" equilibrium position, and partial equiasymptotic stability of the "partial" equilibrium position are studied by the Lyapunov functions method. Examples are given.
Double Auction Protocols for Resource Allocation in Grids
Authors: Umesh Kant, Daniel Grosu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper we propose the double auction allocation model for grids, and three double auction protocols for resource allocation: Preston-McAfee Double Auction Protocol (PMDA), Threshold Price Double Auction Protocol (TPDA) and Continuous Double Auction Protocol (CDA). We study these protocols in terms of economic efficiency and system performance. The results show that CDA protocol is better from both resource's and user's perspective providing high resource utilization.
Processing first-order queries under limited access patterns
Authors: Alan Nash, Bertram Ludäscher
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query which can be executed observing the access patterns restrictions. If so, we say that Q is feasible. We define feasible for first-order queries---previous definitions handled only some existential cases---and characterize the complexity of many first-order query classes. For each of them, we show that deciding feasibility is as hard as deciding containment. Since feasibility is undecidable in many cases and hard to decide in some others, we also define an approximation to it which can be computed in NP for any first-order query and in P for unions of conjunctive queries with negation. Finally, we outline a practical overall strategy for processing first-order queries under limited access patterns.
A framework for handling dependencies among web services transactions
Authors: Seunglak Choi, Jungsook Kim, Hyukjae Jang, Su Myeon Kim, Junehwa Song, Hangkyu Kim, Yunjoon Lee
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper proposes an effective Web services (WS) transaction management framework to automatically manage inconsistencies occurred by relaxing isolation of WS transactions.
Hug over a distance
Authors: Florian 'Floyd' Mueller, Frank Vetere, Martin R. Gibbs, Jesper Kjeldskov, Sonja Pedell, Steve Howard
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

People in close relationships, who are separated by distance, often have difficulty expressing intimacy adequately. Based on the results of an ethnographic study with couples, a prototype was developed to test the feasibility of technology in the domain of intimacy. Hug Over a Distance is an air-inflatable vest that can be remotely triggered to create a sensation resembling a hug. Although the couples did not consider the vest to be useful in their daily lives, the prototype served to provoke and stimulate design ideas from the couples during participative design workshops. An additional and unexpected benefit was also found: the prototype enhanced the couples' understanding of the researchers' methods, suggesting that prototypes can serve as tools to make participatory design volunteers aware of their importance in academic research.
Words about Images: Coordinating Community in Amateur Photography
Authors: Rebecca E. Grinter
Venue: Computer Supported Cooperative Work (2005)

This paper describes how the adoption of digital technologies by two amateur photography communities created coordination challenges. Digital technologies disrupted the classification schemes used not just to sort images into groups for competition, but also served to coordinate the community itself. In opening up the classification scheme, members were able to see and reflect on the sources used to establish the definitions that sorted images and organised their practices not just locally but more widely across various boundaries. Without having words about images, both amateur photography communities would have struggled to coordinate.
Performance Analysis of Mobile Backbone Topology Synthesis Algorithm for Wireless Ad Hoc Networks
Authors: Huei-jiun Ju, Izhak Rubin
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper, we present a scalable fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone in mobile wireless ad hoc networks. The following features induce the key advantages offered by the algorithm: a. The MBN-TSA algorithm presented here is designed to adapt to realistic behavior of wireless environment. The backbone layout is dynamically formed and locally modified. b. A control mechanism, employing the BN_Neighbor_Limit threshold as a key parameter, is introduced to improve the stability of the MBN structure. c. Analytical results show that the MBN-TSA has very little control overhead: time complexity of the order of O(1) and message complexity of the order of O(1) per node. By carrying out extensive simulations, we demonstrate the performance features of the MBN-TSA and the throughput improvement using our ondemand MBN based protocol when compared to AODV.
A Precise Capacitance-to-Pulse Width Converter for Integrated Sensors
Authors: P. Bruschi, D. Navarrini, G. Barillaro, A. Gola
Venue: Analog Integrated Circuits and Signal Processing (2005)

This work describes a novel approach for interfacing capacitive sensors in the sub-pF range. The system generates a PWM signal with a linear relationship between the pulse duration and the sensor capacitance. The circuit exhibits intrinsic low sensitivity to temperature and process variations and is therefore an interesting solution when extremely wide operating temperature ranges are required. A detailed analysis of the noise characteristics, aimed to give indications about the circuit optimisation, is presented. The interface has been designed using the 0.35 ¿ m BCD6 process of STMicroelectronics and tested by means of electrical simulations.
SimFlex: a fast, accurate, flexible full-system simulation framework for performance evaluation of server architecture
Authors: Nikolaos Hardavellas, Stephen Somogyi, Thomas F. Wenisch, Roland E. Wunderlich, Shelley Chen, Jangwoo Kim, Babak Falsafi, James C. Hoe, Andreas G. Nowatzyk
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

The new focus on commercial workloads in simulation studies of server systems has caused a drastic increase in the complexity and decrease in the speed of simulation tools. The complexity of a large-scale full-system model makes development of a monolithic simulation tool a prohibitively difficult task. Furthermore, detailed full-system models simulate so slowly that experimental results must be based on simulations of only fractions of a second of execution of the modelled system.This paper presents SIMFLEX, a simulation framework which uses component-based design and rigorous statistical sampling to enable development of complex models and ensure representative measurement results with fast simulation turnaround. The novelty of SIMFLEX lies in its combination of a unique, compile-time approach to component interconnection and a methodology for obtaining accurate results from sampled simulations on a platform capable of evaluating unmodified commercial workloads.
A computer graphics human figure application of bio-stereometrics
Authors: William A. Fetter
Venue: ACM SIGDA Newsletter (1978)

A study of improved computer graphic representation of the human figure is being conducted under a National Science Foundation grant. Special emphasis is given bio-stereometrics as a primary data base from which applications requiring a variety of levels of detail may be prepared. For example, a human figure represented by a single point can be very useful in overview plots of a population. A crude ten point figure can be adequate for queuing theory studies and simulated movement of groups. A one hundred point figure can usefully be animated to achieve different overall body activities including male and female figures. A one thousand point figure similarly animated, begins to be useful in anthropometrics and kinesiology gross body movements. Extrapolations of this order-of-magnitude approach ultimately should achieve very complex data bases and a program which automatically selects the correct level of detail for the task at hand. See Summary Figure 1.
Using Positive Reinforcement as a Quality Tool
Authors: Barbara Hirsh
Venue: IEEE Software (2005)

Many quality practitioners rely on auditing to verify compliance of process changes. However, when my division used a positive reinforcement approach to verify compliance, we saw deeperinstitutionalization of the desired organizational change.
Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes
Authors: Olav Lysne, Timothy Mark Pinkston, Jose Duato
Venue: IEEE Transactions on Parallel and Distributed Systems (2005)

Dynamic network reconfiguration is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal. Current approaches either require virtual channels in the network or they work only for a limited set of routing algorithms and/or fault patterns. In this paper, we present a methodology for devising deadlock free and dynamic transitions between old and new routing functions that is consistent with newly proposed theory [CHECK END OF SENTENCE]. The methodology is independent of topology, can be applied to any deadlock-free routing function, and puts no restrictions on the routing function changes that can be supported. Furthermore, it does not require any virtual channels to guarantee deadlock freedom. This research is motivated by current trends toward using increasingly larger Internet and transaction processing servers based on clusters of PCs that have very high availability and dependability requirements, as well as other local, system, and storage area network-based computing systems.
Wayne State University: description of the UNO natural language processing system as used for MUC-6
Authors: Lucja Iwańska
Venue: Proceedings of the 6th conference on Message understanding (1995)

The UNO natural language processing (NLP) system implements a Boolean algebra computational model of natural language [Iwa&nacute;ska, 1992] [Iwa&nacute;ska, 1993] [Iwa&nacute;ska, 1994] [Iwa&nacute;ska, 1996b] and reflects our research hypothesis that natural language is a very expressive, yet computationally tractable knowledge representation and reasoning system with its own representational and inferential machinery. One of our goals is to experimentally demonstrate that an NLP system that closely parallels the representational and inferential characteristics of natural language allows one to achieve an in-depth processing (eg., querring automatically from texts created knowledge bases or entity classification), with close-to-real-time, high-recall-and-precision performance.
EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup
Authors: V. C. Ravikumar Rabi N. Mahapatra, Laxmi Narayan Bhuyan
Venue: IEEE Transactions on Computers (2005)

Ternary Content Addressable Memories (TCAMs) have been emerging as a popular device in designing routers for packet forwarding and classifications. Despite their premise on high-throughput, large TCAM arrays are prohibitive due to their excessive power consumption and lack of scalable design schemes. This paper presents a TCAM-based router architecture that is energy and storage efficient. We introduce prefix aggregation and expansion techniques to compact the effective TCAM size in a router. Pipelined and paging schemes are employed in the architecture to activate a limited number of entries in the TCAM array during an IP lookup. The new architecture provides low power, fast incremental updating, and fast table look-up. Heuristic algorithms for page filling, fast prefix update, and memory management are also provided. Results have been illustrated with two large routers (bbnplanet and attcanada) to demonstrate the effectiveness of our approach.
Sample size dependence of estimation error of information carried by neuronal spike train
Authors: Jun Murakami, Tomohide Kidachi, Miki Haseyama, Tateo Shimozawa
Venue: Systems and Computers in Japan (2005)

The operating performance of a neural system should be represented by the amount of information carried by neurons. The neuron behaves as a pulse encoder, which converts a stimulus waveform into a discrete pulse (spike) train. In practice, the rate of information transmission is estimated on the basis of a finite number of spikes obtained in a finite observation period. Consequently, the result includes an error. This paper considers the case in which the rate of information transmission is derived from the stimulus&ndash;response coherence, and analyzes the relation between the estimation error and the sample size (total number of spikes). It is found that the estimation error of information carried by a single spike is inversely proportional to the total number of spikes used for the estimation. It is pointed out that the asymptotic value of inverse proportion should be used for the comparison of information obtained from different neurons. The validity of the relation between the number of samples and the information per spike is verified by using data obtained from the cricket cercal sensory cells. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 84&ndash;95, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10420
A formal frame for robust parsing
Authors: M. Vilares, V. M. Darriba, J. Vilares, F. J. Ribadas
Venue: Theoretical Computer Science (2004)

A robust parser for context-free grammars, based on a dynamic programming architecture, is described. We integrate a regional error repair algorithm and a strategy to deal with incomplete sentences including unknown parts of unknown length. Experimental tests prove the validity of the approach, illustrating the perspectives for its application in real systems over a variety of different situations, as well as the causes underlying the computational behavior observed.