ppxscal/embedding_network huggingface dataset:
Looking for expertise in physical interactions
Authors: Ben Kraal, Vesna Popovic
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

In this paper, we describe the methods we have used to investigate expertise in interaction with physical interfaces. This paper covers the background of the interfaces (compression bandages), describes the methods used and presents findings on the use of tacit and explicit knowledge during interaction. Due to the increase in interest in interfaces that cross between the physical and digital, this method may be of interest to researchers who are involved in similar projects.
Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching
Authors: S. P. Ghosh
Venue: IEEE Transactions on Software Engineering (1976)

The problem of distributing a data base (with logical associations between segment types) on a computer network such that multiple segment types satisfying a query can be retrieved in paralel from different nodes has been introduced. Properties of such distributions without redundancy and with redundancy have been discussed. Lower bounds on the number of nodes needed for such distributions have been given. Algorithms for constructing such distributions have also been given. Distributions of data bases for queries whose target segments form a combinatorial set have been studied in detail. Closed form expressions for redundancy have been obtained for such query sets.
On guarding the vertices of rectilinear domains
Authors: Matthew J. Katz, Gabriel S. Roisman
Venue: Computational Geometry: Theory and Applications (2008)

We prove that guarding the vertices of a rectilinear polygon P, whether by guards lying at vertices of P, or by guards lying on the boundary of P, or by guards lying anywhere in P, is NP-hard. For the first two proofs (i.e., vertex guards and boundary guards), we construct a reduction from minimum piercing of 2-intervals. The third proof is somewhat simpler; it is obtained by adapting a known reduction from minimum line cover. We also consider the problem of guarding the vertices of a 1.5D rectilinear terrain. We establish an interesting connection between this problem and the problem of computing a minimum clique cover in chordal graphs. This connection yields a 2-approximation algorithm for the guarding problem.
An Architecture for Privacy Preserving Collaborative Filtering on Web Portals
Authors: Waseem Ahmad, Ashfaq Khokhar
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Popular E-commerce portals such as Amazon and eBay require user personal data to be stored on their servers for serving these users with personalized recommendations. These recommendations are derived by virtue of collaborative filtering. Collaborative Filtering (CF) is a method to perform Automated Recommendations based upon the assumption that users who had similar interests in past, will have similar interests in future too. Storing user personal information at such servers has given rise to a number of privacy concerns[13] which are effecting business of these services[15]. In this paper, we present a novel architecture for privacy preserving collaborative Filtering for these services. The proposed architecture attempts to restore user trust in these services by introducing the notion of 'Distributed Trust'. This essentially mean that instead of trusting a single server, a coalition of servers is trusted. Distributions of trust makes the proposed architecture fault resilient and robust against security attacks. Moreover, the architecture employs an efficient crossing minimization based biclustering algorithm for collaborative filtering. This algorithm is easily amenable to privacy preserving implementation. The privacy preserving implementation makes use of a threshold homomorphic cryptosystem. The proposed algorithm is fully implemented and evaluated with encouraging results.
Research of Real-time Forecast Technology in Fault of Missile Guidance System Based on Grey Model and Data Fusion
Authors: Xinguo Wang, Aihua Li, Xiaogang Zhou, Hualong Xu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

To solve fault forecast in missile guidance system, a new fault forecast method was presented, in which the grey system and multiple-sensor data fusion were used. Grey Model (GM) forecast is invalid when the data sequence is zero-mean random process, to overcome the drawback, present an improved GM method. The simulation results show the fault forecast method has better performance in missile guidance systems.
Video Mining - Learning Patterns of Behaviour via an Intelligent Image Analysis System
Authors: D. A. Bell, A. Beck, P. Miller, Q. X. Wu, A. Herrera
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper we describe a system for capturing time-varying sequences of behavioural patterns of agents or robots from a video clips. The detailed time slices of action are `coarsened' to provide gross, molecular units of behaviour. Combinations of these are then represented in the form of a table, which is mined using Rough sets methods here, although various other mining techniques can also be used. Some preliminary experiments are reported to prove the concept.
A Method to Generate a Feature Model from a Business Process Model for Business Applications
Authors: Jongsu Bae, Sungwon Kang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

As the information technology evolves, more and more organizations rely on software systems to automate their business activities and automated business process is recognized as a core competency in organization. There are many techniques for modeling business activities and bridging business activities and system models. But these methods focus on single system development only and, therefore, when we develop a family of business applications using those methods tends to yield low productivity, low quality and high maintenance cost. We consider that SPL (Software Product Line) is the most promising method to solve this problem by increasing reusability. But current SPL methods rarely focus on business applications domain and business process modeling to generate domain models for business applications. In this paper, we propose a method for deriving a feature model from a business process model that consists of the necessary steps and the relationships between relevant models.
Provision of quality of service in wireless fourth generation networks
Authors: Faouzi Zarai, Noureddine Boudriga
Venue: International Journal of Communication Systems (2007)

A key word describing next generation wireless networks is &lsquo;seamless&rsquo;. Wireless fourth generation (4G) networks represent a set of new technologies that will enable seamless integration of various wireless access systems, while targeting to support various sophisticated and quality of service constraining applications, such as high-speed data services and multimedia services. This paper first proposes an architecture for 4G networks. The most significant feature of this architecture is its flexibility, openness and ability to enable seamless handoff in a single logical overlay network composed of many heterogeneous access networks. A medium access control (MAC) protocol for basic access networks is then introduced. A generic scheduling scheme, named CS-EDF (channel state-earliest deadline first) and the details of an efficient handoff management method are also briefly introduced. The bandwidth utilization, handoff resources reservation, and scheduling scheme performances of the proposed schemes are discussed. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Shadow-Driven 4D Haptic Visualization
Authors: Hui Zhang Andrew Hanson
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Just as we can work with two-dimensional floor plans to communicate 3D architectural design, we can exploit reduced-dimension shadows to manipulate the higher-dimensional objects generating the shadows.In particular, by taking advantage of physically reactive 3D shadow-space controllers, we can transform the task of interacting with 4D objects to a new level of physical reality.We begin with a teaching tool that uses 2D knot diagrams to manipulate the geometry of 3D mathematical knots via their projections; our unique 2D haptic interface allows the user to become familiar with sketching, editing, exploration, and manipulation of 3D knots rendered as projected imageson a 2D shadow space. By combining graphics and collision-sensing haptics, we can enhance the 2D shadow-driven editing protocol to successfully leverage 2D pen-and-paper or blackboard skills. Building on the reduced-dimension 2D editing tool for manipulating 3D shapes, we develop the natural analogy to produce a reduced-dimension 3D tool for manipulating 4D shapes.By physically modeling the correct properties of 4D surfaces, their bending forces, and their collisions in the 3D haptic controller interface, we can support full-featured physical exploration of 4D mathematical objects in a manner that is otherwise far beyond the experience accessible to human beings.As far as we are aware, this paper reports the first interactive system with force-feedback that provides "4D haptic visualization" permitting the user tomodel and interact with 4D cloth-like objects.
Spectral Generative Models for Graphs
Authors: David White, Richard C. Wilson
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Generative models are well known in the domain of statistical pattern recognition. Typically, they describe the probability distribution of patterns in a vector space. The individual patterns are defined by vectors and so the individual features of the pattern are well defined. In contrast, very little work has been done with generative models of graphs because graphs do not have a straightforward vectorial representation. Because of this, simple statistical quantities such as mean and variance are difficult to define for a group of graphs. While we can define statistical quantities of individual edges, it is not so straightforward to define how sets of edges in graphs are related. In this paper we examine the problem of creating generative distributions over sets of graphs. We use the spectral representation of the graphs to construct a dual vector space for the graphs. The spectral decomposition of a graph can be used to extract information about the relationship of edges and parts in a graph. Distributions are then defined on the vector spaces and used to generate new samples. Finally, these points must be used to reconstruct the sampled graph.
Application Environments/Runtime
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

With the advances in middleware and Web services technologies, network sendees are evolving from simple client-sender applications to self-configuring services that can compose primitive components distributed in the Internet into a value-added service configuration that provides rich functionalities to users. A resulting research problem is how to continuously adapt such composite service configurations at run time in order to cope with the increasingly dynamic and heterogeneous network environments and computing platforms. In this paper, we propose a self-adaptation architecture that allows service developers to specify their service-specific adaptation knowledge as "externalized" adaptation strategies. These adaptation strategies are used by a general, shared adaptation framework to perform run-time adaptation operations that automatically incorporate service-specific knowledge. In addition to the strategies, we also identify another aspect of adaptation knowledge that is not addressed by previous solutions: adaptation coordination. Our framework provides integrated support for the specification and execution of both aspects of developers' adaptation knowledge. 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
Back-End Storage Networks
Authors: H. A. Freeman
Venue: Computer (1980)

Shared storage will be essential to the success of the large, multiple-host data-base systems of the 1980's.
ID Prediction Algorithm for Tag Collision Arbitration in RFID System
Authors: Hyun Jun Yeo, Yong Hwan Kim, Hwa Young Lim, Yong Soo Park, Kwang Seon Ahn
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In radio frequency identification (RFID) system, the reader needs the anti-collision algorithm for fast identifying all of the tags in the interrogation zone. This paper proposes the tree-based ID prediction algorithm (IPA) to arbitrate the tag collision. For IPA, the count-bits, which represents the number of bit "1's in the ID, are added to the left position of the tag ID. The reader predicts correctly ID by using count-bits, the number of collided bits and the information of the identified bits. By using IPA, the reader can identify more than one tag at once. IPA can reduce the number of the requests transmitted from the reader, thus it shortens the time of identifying all of the tags in the interrogation zone.
On the Delay Required to Realize Boolean Functions
Authors: F. P. Preparata, D. E. Muller
Venue: IEEE Transactions on Computers (1971)

Using as logic modules two-input one-output arbitrary logic gates, this note considers the problem of the longest chain (number of levels) in a tree-type interconnection realizing a Boolean function of n variables. Specifically, we are interested in the minimum number of levels L(n) by which we can constructively realize all Boolean functions of n variables. It was previously shown that L(n)=n for n=3, 4 and it was so conjectured for n= 5; in this note we are able to show that this holds for n=5, 6, 7, 8.
A Data Mining Approach to Generating Network Attack Graph for Intrusion Prediction
Authors: Zhi-tang Li, Jie Lei, Li Wang, Dong Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

A network attack graph provides a global view of all possible sequences of exploits which an intruder may use to penetrate a system. Attack graphs can be gen- erated by model checking techniques or intrusion alert correlation. In this paper we proposed a data mining approach to generating attack graphs. Through associ- ation rule mining, the algorithm generates multi-step attack patterns from historical intrusion alerts which comprise the attack graphs. The algorithm also calcu- lates the predictability of each attack scenario in the attack graph which represents the probability for the corresponding attack scenario to be the precursor of fu- ture attacks. Then the real-time intrusion alerts can be correlated to attack scenarios and ranked by the pre- dictability scores. The ranking result can help identify the appropriate evidence for intrusion prediction from a large volume of raw intrusion alerts. The approach is validated by DARPA 2000 and DARPA 1999 intrusion detection evaluation datasets.
Specification of Synchronizing Processes
Authors: K. Ramamritham
Venue: IEEE Transactions on Software Engineering (1983)

The formalism of temporal logic has been suggested to be an appropriate tool for expressing the semantics of concurrent programs. This paper is concerned with the application of temporal logic to the specification of factors affecting the synchronization of concurrent processes. Towards this end, we first introduce a model for synchronization and axiomatize its behavior. SYSL, a very high-level language for specifying synchronization properties, is then described. It is designed using the primitives of temporal logic and features constructs to express properties that affect synchronization in a fairly natural and modular fashion. Since the statements in the language have intuitive interpretations, specifications are humanly readable. In addition, since they possess appropriate formal semantics, unambiguous specifications result.
Fully-Buffered DIMM Memory Architectures: Understanding Mechanisms, Overheads and Scaling
Authors: Brinda Ganesh, Aamer Jaleel, David Wang, Bruce Jacob
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Performance gains in memory have traditionally been obtained by increasing memory bus widths and speeds. The diminishing returns of such techniques have led to the proposal of an alternate architecture, the Fully-Buffered DIMM. This new standard replaces the conventional memory bus with a narrow, high-speed interface between the memory controller and the DIMMs. This paper examines how traditional DDRx based memory controller policies for scheduling and row buffer management perform on a Fully-buffered DIMM memory architecture. The split-bus architecture used by FBDIMM systems results in an average improvement of 7% in latency and 10% in bandwidth at higher utilizations. On the other hand, at lower utilizations, the increased cost of serialization resulted in a degradation in latency and bandwidth of 25% and 10% respectively. The split-bus architecture also makes the system performance sensitive to the ratio of read and write traffic in the workload. In larger configurations, we found that the FBDIMM system performance was more sensitive to usage of the FBDIMM links than to DRAM bank availability. In general, FBDIMM performance is similar to that of DDRx systems, and provides better performance characteristics at higher utilization, making it a relatively inexpensive mechanism for scaling capacity at higher bandwidth requirements. The mechanism is also largely insensitive to scheduling policies, provided certain ground rules are obeyed.
Power modeling and efficient FPGA implementation of FHT for signal processing
Authors: Abbes Amira, Shrutisagar Chandrasekaran
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Fast Hadamard transform (FHT) belongs to the family of discrete orthogonal transforms and is used widely in image and signal processing applications. In this paper, a parameterizable and scalable architecture for FHT with time and area complexities of O(2(W + 1)) and O(2N2), respectively, has been proposed, where W and N are the word and vector lengths. A novel algorithmic transformation for the FHT based on sparse matrix factorization and distributed arithmetic (DA) principles has been presented. The architecture has been parallelized and pipelined in order to achieve high throughput rates. Efficient and optimized field-programmable gate array implementation of the proposed architecture that yield excellent performance metrics has been analyzed in detail. Additionally, a functional level power analysis and modeling methodology has been proposed to characterize the various power and energy metrics of the cores in terms of system parameters and design variables. The mathematical models that have been derived provide quick presilicon estimate of power and energy measures, allowing intelligent tradeoffs when incorporating the developed cores as subblocks in hardware-based image and video processing systems.
A Thread-tag Based Semantics for Sequence Diagrams
Authors: Haitao Dan, Robert M. Hierons, Steve Counsell
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

The sequence diagram is one of the most popular behaviour modelling languages which offers an intuitive and visual way of describing expected behaviour of Object-Oriented software. Much research work has investigated ways of providing a formal semantics for sequence diagrams. However, these proposed semantics may not properly interpret sequence diagrams when lifelines do not correspond to threads of controls. In this paper, we address this problem and propose a thread-tag based sequence diagram as a solution. A formal, partially ordered multiset based semantics for the thread-tag based sequence diagrams is proposed.
Multiscale analysis of short term heart beat interval, arterial blood pressure, and instantaneous lung volume time series
Authors: Leonardo Angelini, Roberto Maestri, Daniele Marinazzo, Luigi Nitti, Mario Pellicoro, Gian Domenico Pinna, Sebastiano Stramaglia, Salvatore A. Tupputi
Venue: Artificial Intelligence in Medicine (2007)

Motivations: Physiological systems are ruled by mechanisms operating across multiple temporal scales. A recently proposed approach, multiscale entropy analysis, measures the complexity at different time scales and has been successfully applied to long term electrocardiographic recordings. The purpose of this work is to show the applicability of this methodology, rooted on statistical physics ideas, to short term time series of simultaneously acquired samples of heart rate, blood pressure and lung volume, from healthy subjects and from subjects with chronic heart failure. In the same spirit, we also propose a multiscale approach, to evaluate interactions between time series, by performing a multivariate autoregressive (AR) modeling of the coarse grained time series. Methods: We apply the multiscale entropy analysis to our data set of short term recordings. Concerning the multiscale version of the multivariate AR approach, we apply it to the four dimensional time series so as to detect scale dependent patterns of interactions between the physiological quantities. Results: Evaluating the complexity of signals at the multiple time scales inherent in physiologic dynamics, we find new quantitative indicators which are statistically correlated with the pathology. Our results show that multiscale entropy calculated on all the measured quantities significantly differs (P
A New Hierarchical Conceptual Graph Formalism Adapted for Chinese Document Retrieval
Authors: Yi Hu, Ruzhan Lu, Yuquan Chen, Hui Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, we present a hierarchical conceptual graph formalism to describe the meaning of document content in a specified domain. This formalism can be considered as an extension of the Sowa formalism of conceptual graphs, in which concept vertices are extended to be a recursive structure. Based on this hierarchical framework, we index the documents and queries into such graphs, and propose a new comparison operator between graphs taking the needs of retrieval into account. This operator is the core of the searching process of our document management system, called HCG-DMS, which manages Chinese documents for virtual database. This Chinese collection is searched by their conceptual graphs built from the titles now. The first retrieval evaluation of our method gives better results than traditional Boolean-model based documentary system.
Optimal Excitation Control of Synchronous Generator Based on Adaptive Ants Colony Algorithm
Authors: Huilan Jiang, Xuegong Yin, Yunshan Chen, Dongwei Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

According to the characters of excitation system of generator and several defects of ant colony algorithm(ACA), adaptive ant colony algorithm(AACA) for optimizing PID parameters of excitation controller of generator is presented in this paper on the basis of conventional PID controller and PID controller based on ACA. Excitation controller of synchronous generator based on AACA is designed. The simulating results show that this excitation controller controls voltage better than either the conventional PID controller or the PID controller based on ACA on both robustness and accuracy.