ppxscal/embedding_network huggingface dataset:
Detecting gesture force peaks for intuitive interaction
Authors: Zachary Fitz-Walter, Samuel Jones, Dian Tjondronegoro
Venue: Proceedings of the 5th Australasian Conference on Interactive Entertainment (2008)

With the release of the Nintendo Wii in 2006, the use of haptic force gestures has become a very popular form of input for interactive entertainment. However, current gesture recognition techniques utilised in Nintendo Wii games fall prey to a lack of control when it comes to recognising simple gestures. This paper presents a simple gesture recognition technique called Peak Testing which gives greater control over gesture interaction. This recognition technique locates force peaks in continuous force data (provided by a gesture device such as the Wiimote) and then cancels any peaks which are not meant for input. Peak Testing is therefore technically able to identify movements in any direction. This paper applies this recognition technique to control virtual instruments and investigates how users respond to this interaction. The technique is then explored as the basis for a robust way to navigate menus with a simple flick of the wrist. We propose that this flick-form of interaction could be a very intuitive way to navigate Nintendo Wii menus instead of the current pointer techniques implemented.
Adaptive reference levels in a level-crossing analog-to-digital converter
Authors: Karen M. Guan, Suleyman S. Kozat, Andrew C. Singer
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Level-crossing analog-to-digital converters (LC ADCs) have been considered in the literature and have been shown to efficiently sample certain classes of signals. One important aspect of their implementation is the placement of reference levels in the converter. The levels need to be appropriately located within the input dynamic range, in order to obtain samples efficiently. In this paper, we study optimization of the performance of such an LC ADC by providing several sequential algorithms that adaptively update the ADC reference levels. The accompanying performance analysis and simulation results show that as the signal length grows, the performance of the sequential algorithms asymptotically approaches that of the best choice that could only have been chosen in hindsight within a family of possible schemes.
Privacy policy enforcement in enterprises with identity management solutions
Authors: Marco Casassa Mont, Robert Thyne
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

People are usually asked by enterprises and other organizations to disclose their personal information to access web services and engage in business interactions. Enterprises need this information to enable their business processes. This is unlikely to change, at least in the foreseeable future. When collecting personal data, enterprises must satisfy privacy laws and policies along with addressing people's expectations on how their data should be handled. Currently much is done by means of manual processes, in particular in terms of privacy enforcement: these processes are prone to mistakes and hard to comply with. Automation can help enterprises to deal with these privacy management issues, in particular the enforcement of privacy policies on collected personal data. Enterprises have already been investing in identity management solutions: they require that approaches to automate privacy management should keep into account and leverage these solutions. This paper discusses our research and development work to automate the enforcement of privacy policies in enterprises. Our model of privacy policy enforcement is introduced along with the technical details of a related prototype, integrated (as a proof of concept) with HP Select Access, a state-of-the-art identity management solution. This technology is currently under productisation. We discuss our current results and next steps.
A class of high-performance multi-level power factor correct switching converter based on predictive control technology: analysis, design and experiment
Authors: Chao Gao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

This paper gives some researches and analyses about the working features of main circuit of tri-level boost power factor correct (PFC) converter and the advantages of tri-level switch converter in aspects of bearing high-voltage of power components, overall system loss and magnetic component selection based upon the single-level boost PFC switch converter. Besides, relying on the application of microprocessor in power converter technology and Digital Signal Processing chip's strong calculating capacity, and it presents the adoption of modified scheme of tri-level boost PFC converter under the control of predictive control algorithm.
Segmented patching broadcasting protocol for video data
Authors: Satish Chand, Bijendra Kumar, Hari Om
Venue: Computer Communications (2009)

In adaptive segment-based patching scheme, the video is divided into fixed number of segments, which are transmitted over the server channels. For efficient transmission of the video segments, the server channels are classified into two types - regular and patching channels. A regular channel generally transmits fixed number of segments and a patching channel helps transmitting those segments that cannot be provided by any regular channel to the users. The number of segments transmitted by the first regular channel is decided by the number of regular channels that are allocated to the video by the video server. Other regular channels transmit pre-specified number of segments. This scheme estimates the bandwidth of the patching channels based on the requests received at the video server in terms of fixed time intervals, called time slots. The bandwidth estimation in this scheme is less accurate because for multiple requests received in a time slot more than one patching channels are used. Second, the probability distribution considered in this scheme does not satisfy the basic rule, i.e., the sum of all probabilities is not 1. In this paper, we address these issues and propose a new protocol named as Segmented Patching Broadcasting Protocol for Video Data. The average server bandwidth allocated to the patching channels is much less as compared to the adaptive segment-based patching scheme because only one patching channel is sufficient for any number of requests received in a time slot.
USS-TDMA: Self-stabilizing TDMA Algorithm for Underwater Wireless Sensor Network
Authors: Zhongwen Guo, Zhengbao Li, Feng Hong
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Underwater wireless Sensor network is often constrained by limited power, limited communication range and high bit error rate (BER). We focus on designing a TDMA service for a cube-based underwater wireless sensor network. Such network is readily found in many applications in the area of monitoring, hazard detection, and so on. In this paper, we propose an underwater self-stabilizing TDMA Algorithm for assigning time slots to sensors. We present the TDMA algorithm customized for different communication patterns, namely, broadcast, convergecast and local gossip, which occur commonly in sensor networks. The algorithm is self-stabilizing and energy efficiency. Meanwhile, with the localization service, the algorithm can be used in mobile sensor networks.
Towards Ludics Programming: Interactive Proof Search
Authors: Alexis Saurin
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Girard [1] introduced Ludics as an interactive theory aiming at overcoming the distinction between syntax and semantics in logic.In this paper, we investigate how ludics could serve as a foundation for logic programming, providing a mechanism for interactive proof search, that is proof search by interaction (or proof search by cut-elimination).
Distributed processing of problem-solving applications for farmers
Authors: Robert Gammill, Lynn Thorp
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Intercomputer data communication via modem and telephone promises to have an important impact on rural areas. Unattended and inexpensive late-night communication has the potential for providing routine, noninterruptive, and rapid information interchange. An application of intercomputer communication to reduce the cost of using remote timesharing services has been experimentally developed at North Dakota State University (NDSU). An agricultural problem-solving program from the AGNET system in Nebraska has been split into three parts: interactive input of user data, computation of results, and production of an output report. The interactive input is then carried out on a computer near the user, eliminating interactive long-distance communication costs. The data collected are transmitted to the AGNET timesharing machine for calculation. The transmission, including login, is rapidly carried out by the local machine, using a protocol interpreter developed at NDSU. The results of the calculations are then transmitted back in compact form to the user's machine, where they are formatted and displayed. Only a minute of connect time to AGNET is required instead of half an hour. The protocol interpreter used to do this is described in some detail. Such splitting of functions between computers promises to allow high-quality problem-solving services to be provided on central machines, with personal or local machines providing interactive input and printed output services.
Teaching database security and auditing
Authors: Li Yang
Venue: ACM SIGCSE Bulletin (2009)

Hands-on laboratory experiences are essential critical for students to understand concepts and gain real-world insights in database security and auditing. We are developing a set of hands-on labs to integrate theories of database security into practices. Our designed labs do not require purchasing any commercial software or pre-configuration. Each lab includes objectives, results, and resources to help students to understand database security concepts including access control, virtual private database, and database auditing etc. We use two major database products (Microsoft SQL Server and Oracle 10g) to design and implement our labs.
ShadowPlay: a generative model for nonverbal human-robot interaction
Authors: Eric M. Meisner, Selma Àbanovic, Volkan Isler, Linnda R. Caporeal, Jeff Trinkle
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Humans rely on a finely tuned ability to recognize and adapt to socially relevant patterns in their everyday face-to-face interactions. This allows them to anticipate the actions of others, coordinate their behaviors, and create shared meaning to communicate. Social robots must likewise be able to recognize and perform relevant social patterns, including interactional synchrony, imitation, and particular sequences of behaviors. We use existing empirical work in the social sciences and observations of human interaction to develop nonverbal interactive capabilities for a robot in the context of shadow puppet play, where people interact through shadows of hands cast against a wall. We show how information theoretic quantities can be used to model interaction between humans and to generate interactive controllers for a robot. Finally, we evaluate the resulting model in an embodied human-robot interaction study. We show the benefit of modeling interaction as a joint process rather than modeling individual agents.
A Utility-Based Dynamic Bandwidth Allocation Algorithm in IEEE 802.16 Networks to Minimize Average Queuing Delay
Authors: Ridong Fei, Kun Yang, Shumao Ou, Wenyong Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

This paper starts with detailing the IEEE 802.16 network architecture and the quality of service (QoS) architecture; followed by a network utility function, which is related to the average queuing delay of each subscriber station (SS); and then a dynamic bandwidth allocation (DBA) algorithm is proposed. This algorithm takes into consideration the QoS requirements of different traffic types and makes use of a utility function to minimize the average queuing delay. Simulation results have shown the efficiency of the DBA.
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Authors: Steffen Rendle, Lars Schmidt-Thieme
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the queries are about pairs of objects. As the target relation satisfies the axioms of transitivity, from one queried pair additional constraints can be inferred. We derive both the upper and lower bound on the number of queries needed to converge to the optimal solution. Besides restricting the set of possible solutions, constraints can be used as training data for learning a similarity measure. For selecting queries that result in a large number of meaningful constraints, we present an approximative optimal selection technique that greedily minimizes the expected loss in each round of active learning. This technique makes use of inference of expected constraints. Besides the theoretical results, an extensive evaluation for the application of record linkage shows empirically that the proposed selection method leads to both interesting and a high number of constraints.
Placing Text Boxes on Graphs
Authors: Sjoerd Hagen, Marc Kreveld
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

In this paper we consider the problem of placing a unit square on a face of a drawn graph bounded by n vertices such that the area of overlap is maximized. Exact algorithms are known that solve this problem in O(n 2) time. We present an approximation algorithm that&mdash;for any given &epsilon;>&thinsp;0&mdash;places a (1&thinsp;+&thinsp;&epsilon;)-square on the face such that the area of overlap is at least the area of overlap of a unit square in an optimal placement. The algorithm runs in $O(\frac{1}{\epsilon}\, n\log^2 n)$ time. Extensions of the algorithm solve the problem for unit discs, using $O(\frac{\log (1/\epsilon)}{\epsilon\sqrt{\epsilon}}\, n\log ^2n)$ time, and for bounded aspect ratio rectangles of unit area, using $O(\frac{1}{\epsilon^2}\, n\log^2 n)$ time.
Combine LHS with MOEA to Optimize Complex Pareto Set MOPs
Authors: Jinhua Zheng, Biao Luo, Miqing Li, Jing Li
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

The Pareto set (PS) of real multi-objective optimization problems (MOPs) are often unknown and complex, so, it is significant for multi-objective evolutionary algorithms (MOEAs) to solve complex PS MOPs (CPS_MOPs namely). In this paper, we combined Latin hypercube sampling (LHS) with MOEA, proposed a LHS based MOEA (LHS-MOEA). We suggested two kinds of LHS-MOEA, in which LHS local search and evolutionary operator are combined to handle CPS_MOPs. Through some experiments, the results demonstrate that LHS-MOEA performs much better than the traditional prevalent MOEA -- NSGA-II in solving CPS_MOPs.
Vairë: A Tool to Improve the Usability in Embedded Applications Based on User Adjustment
Authors: Mauro Teófilo, Alexandre Martini, Wesley Silva
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

The usability is being considered an incisive factor of the application's success of mobile computation segment, it is based on user experience conception limitation, so any techniques, method or idea which could improve the mobile user experience, must be carefully studied. The Vairë tool uses Mandos method of interaction for infrastructure support and together they propose a new interaction form founded on the fact that the way of using an embedded application in a mobile phone varies in accordance to the user. The Vairë is a visual tool for improvement of Mandos usage experience in an application, adapting the same in agreement with user's will, giving the user interface design power to the most interested one: the user.
Low-connectivity and full-coverage three dimensional wireless sensor networks
Authors: Xiaole Bai, Chuanlin Zhang, Dong Xuan, Jin Teng, Weijia Jia
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint paths between any two sensor nodes in a WSN, where k ≤ 4. In this paper, we design a set of patterns for these networks. In particular, we design and prove the optimality of 1- and 2-connectivity patterns under any value of the ratio of communication range rc over sensing range rs, among regular lattice deployment patterns. We further propose a set of patterns to achieve 3- and 4-connectivity patterns and investigate the evolutions among all the proposed low-connectivity patterns. Finally, we study the proposed patterns under several practical settings.
Coordination mechanisms for selfish scheduling
Authors: Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz
Venue: Theoretical Computer Science (2009)

In machine scheduling, a set of jobs must be scheduled on a set of machines so as to minimize some global objective function, such as the makespan, which we consider in this paper. In practice, jobs are often controlled by independent, selfishly acting agents, which each select a machine for processing that minimizes the (expected) completion time. This scenario can be formalized as a game in which the players are job owners, the strategies are machines, and a player's disutility is the completion time of its jobs in the corresponding schedule. The equilibria of these games may result in larger-than-optimal overall makespan. The price of anarchy is the ratio of the worst-case equilibrium makespan to the optimal makespan. In this paper, we design and analyze scheduling policies, or coordination mechanisms, for machines which aim to minimize the price of anarchy of the corresponding game. We study coordination mechanisms for four classes of multiprocessor machine scheduling problems and derive upper and lower bounds on the price of anarchy of these mechanisms. For several of the proposed mechanisms, we also prove that the system converges to a pure-strategy Nash equilibrium in a linear number of rounds. Finally, we note that our results are applicable to several practical problems arising in communication networks.
Tool support for learning B&#x00fc;chi automata and linear temporal logic
Authors: Yih-Kuen Tsay, Yu-Fang Chen, Ming-Hsien Tsai, Kang-Nien Wu, Wen-Chin Chan, Chi-Jian Luo, Jinn-Shu Chang
Venue: Formal Aspects of Computing (2009)

We introduce a graphical interactive tool, named GOAL, that can assist the user in understanding B&#x00fc;chi automata, linear temporal logic, and their relation. B&#x00fc;chi automata and linear temporal logic are closely related and have long served as fundamental building blocks of linear-time model checking. Understanding their relation is instrumental in discovering algorithmic solutions to model checking problems or simply in using those solutions, e.g., specifying a temporal property directly by an automaton rather than a temporal formula so that the property can be verified by an algorithm that operates on automata. One main function of the GOAL tool is translation of a temporal formula into an equivalent B&#x00fc;chi automaton that can be further manipulated visually. The user may edit the resulting automaton, attempting to optimize it, or simply run the automaton on some inputs to get a basic understanding of how it operates. GOAL includes a large number of translation algorithms, most of which support past temporal operators. With the option of viewing the intermediate steps of a translation, the user can quickly grasp how a translation algorithm works. The tool also provides various standard operations and tests on B&#x00fc;chi automata, in particular the equivalence test which is essential for checking if a hand-drawn automaton is correct in the sense that it is equivalent to some intended temporal formula or reference automaton. Several use cases are elaborated to show how these GOAL functions may be combined to facilitate the learning and teaching of B&#x00fc;chi automata and linear temporal logic.
Towards a theory of search queries
Authors: George H. L. Fletcher, Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as "dataspace models." Such information management systems must allow querying in simple ways, mostly by a form of searching. Motivated by these developments, we propose a theory of search queries in a general model of dataspaces. In this model, a dataspace is a collection of data objects, where each data object is a collection of data items. Basic search queries are expressed using filters on data items, following the basic model of boolean search in information retrieval. We characterise semantically the class of queries that can be expressed by searching. We apply our theory to classical relational databases, where we connect search queries to the known class of fully generic queries, and to dataspaces where data items are formed by attribute--value pairs. We also extend our theory to a more powerful, associative form of searching where one can ask for objects that are similar to objects satisfying given search conditions. Such associative search queries are shown to correspond to a very limited kind of joins. Specifically, we show that the basic search language extended with associative search can define exactly the queries definable in a restricted fragment of the semijoin algebra working on an explicit relational representation of the dataspace.
Breaks in Continuity of Surgical Care: Considerations for eHealth Systems Design
Authors: Svetlena Taneva, Gudela Grote, Effie Law, Jacqueline Higgins
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Coordination in healthcare settings is a complex distributed process, mediated by a number of artifacts. We describe the coordination mechanisms in a surgical unit and identify the critical themes and structures of coordination that reveal the coordination needs of clinicians. Interestingly, we find that intra-team coordination works well despite the fact that it is mostly implicit. It is inter-team explicit coordination that presents significant overhead, the main effort being in maintaining awareness system-wide. We discuss the implications for eHealth systems design.