ppxscal/embedding_network huggingface dataset:
Evalutation of UML CASE tool with haptics
Authors: Mohamad Eid, Atif Alamri, Jamil Melhem, Abdulmotaleb El Saddik
Venue: Proceedings of the 2008 Ambi-Sys workshop on Haptic user interfaces in ambient media systems (2008)

Haptics technology has received enormous attention to enhance human computer interaction. Indeed haptics offers a natural user interface based on human gesture system. In this paper, we present a prototype haptic-enabled UML CASE tool that allows software engineering developers to intuitively interact and touch the modeling elements of the tool and feel the force feedback. The tool uses the Omni Phantom device, a common single-point of interaction haptic device. We performed a usability study to compare the haptic-based approach against the traditional mouse-based approach. Even though some users expressed the tiresome of using the haptic device, the study demonstrated the potential of incorporating the haptic modality in UML development tools in terms of user involvement, socialism, and motivation.
Design and evaluation of network reconfiguration protocols for mostly-off sensor networks
Authors: Yuan Li, Wei Ye, John Heidemann, Rohit Kulkarni
Venue: Ad Hoc Networks (2008)

A new class of sensor network applications is mostly-off. Exemplified by Intel's FabApp, in these applications the network alternates between being off for hours or weeks, then activating to collect data for a few minutes. While configuration of traditional sensornet applications is occasional and so need not be optimized, these applications may spend half their active time in reconfiguration every time when they wake up. Therefore, new approaches are required to efficiently ''resume'' a sensor network that has been ''suspended'' for long time. This paper focuses on the key question of when the network can determine that all nodes are awake and ready to communicate. Existing approaches assume worst-case clock drift, and so must conservatively wait for minutes before starting an application. We propose two reconfiguration protocols to largely reduce the energy cost during the process. The first approach is low-power listening with flooding, where the network restarts quickly by flooding a control message as soon as the first node determines that the whole network is up. The second protocol uses local update with suppression, where nodes only notify their one-hop neighbors, avoiding the cost of flooding. Both protocols are fully distributed algorithms. Through analysis, simulation and testbed experiments, we show that both protocols are more energy efficient than current approaches. Flooding works best in sparse networks with six neighbors or less, while local update with suppression works best in dense networks (more than six neighbors).
Engineering-Approach Accelerates Computational Understanding of V1---V2 Neural Properties
Authors: Shunji Satoh, Shiro Usui
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

We present two computational models: (i) long-range horizontal connections and the nonlinear effect in V1 and (ii) the filling-in process at the blind spot. Both models are obtained deductively from standard regularization theory to show that physioligical evidence of V1 and V2 neural properties is essential for efficient image processing. We stress that the engineering approach should be imported to understand visual systems computationally, even though this approach usually ignores physiological evidence and the target is neither neurons nor the brain.
Pervasive symbiotic advertising
Authors: C. Narayanaswami, D. Coffman, M. C. Lee, Y. S. Moon, J. H. Han, H. K. Jang, S. McFaddin, Y. S. Paik, J. H. Kim, J. K Lee, J. W. Park, D. Soroker
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

The proliferation of powerful mobile devices and the deployment of large displays in public spaces give rise to new and exciting opportunities in personalized and targeted advertising. Advertising in such public spaces also raises interesting questions in several areas such as capturing and aggregating user context, tailoring of ads, measuring advertisement efficacy, capturing user attention, charging model and monetization, user privacy, and the roles of parties in the ecosystem among others. In this paper, we introduce the opportunities and challenges in delivering advertisements to ambient displays utilizing information pertaining to users near the display. We then discuss some ways to address them and describe our first prototype. Though many traditional challenges concerning the design, usability, connectivity, and applications of mobile systems are still important, we believe that applications and challenges resulting from symbiosis between mobile systems and surrounding devices, such as the subject of this paper, are a rich area for further exploration by the mobile computing community.
Periodic orbits in periodic discrete dynamics
Authors: Ziyad AlSharawi
Venue: Computers Mathematics with Applications (2008)

We study the combinatorial structure of periodic orbits of nonautonomous difference equations x"n"+"1=f"n(x"n) in a periodically fluctuating environment. We define the @C-set to be the set of minimal periods that are not multiples of the phase period. We show that when the functions f"n are rational functions, the @C-set is a finite set. In particular, we investigate several mathematical models of single-species without age structure, and find that periodic oscillations are influenced by periodic environments to the extent that almost all periods are divisors or multiples of the phase period.
Multigrid Reinforcement Learning with Reward Shaping
Authors: Marek Grześ, Daniel Kudenko
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Potential-based reward shaping has been shown to be a powerful method to improve the convergence rate of reinforcement learning agents. It is a flexible technique to incorporate background knowledge into temporal-difference learning in a principled way. However, the question remains how to compute the potential which is used to shape the reward that is given to the learning agent. In this paper we propose a way to solve this problem in reinforcement learning with state space discretisation. In particular, we show that the potential function can be learned online in parallel with the actual reinforcement learning process. If the Q-function is learned for states determined by a given grid, a V-function for states with lower resolution can be learned in parallel and used to approximate the potential for ground learning. The novel algorithm is presented and experimentally evaluated.
Discrimination of Homographs Distorted by a Lengthy Impulsive Noise
Authors: Šarūnas Paulikas, Dalius Navakauskas
Venue: Informatica (2006)

The paper addresses the problem of discrimination of homographs when a lengthy segment of an uttered word is missing. The considered discrimination procedure is done by recognizer that operates on cepstrum coefficients extracted from the speech signal. For restoration of the missing speech segment rather than use of the known speech signal, it has been proposed to calculate speech signal characteristics: the period of fundamental frequency and intensity. By experimentation it has been shown that the polynomial approximation of speech signal characteristics improves homograph discrimination results. An extra computational burden associated with the proposed method is not high because it involves recalculation of the already extracted Fourier coefficients.
Set-Theoretic Volume Model Evaluation and Picture-Plane Coherence
Authors: Ken Sears, Alan Middleditch
Venue: IEEE Computer Graphics and Applications (1984)

The class of scan-line processing algorithms introduced here can be used for efficient image generation and volume integral calculations and is shown to outperform previous methods.
A Heuristic Routing Algorithm
Authors: Philip Dennis
Venue: IEEE Micro (1983)

This algorithm, implemented on an inexpensive microcomputer, solved a sophisticated operations research problem. 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
Conflicting Visual and Proprioceptive Reflex Responses During Reaching Movements
Authors: David W. Franklin, Udell So, Rieko Osu, Mitsuo Kawato
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

The visually and mechanically induced corrective motor responses of hand position during reaching movements were investigated. Subjects performed reaching movements on a robotic manipulandum where the hand position was presented to the subjects by means of a projected display. On random reaching trials the subject's hand position was mechanically perturbed relative to the predicted hand trajectory. The visual representation of the hand position was either perturbed in the same direction as the hand, mirrored relative to the hand, or not perturbed at all. The visually induced reflexive responses were still elicited after a mechanical perturbation, whether or not the information agreed with the mechanical perturbation. The visually induced reflexes contributed to limb stiffness after 200 ms from the onset. If the visual and mechanical errors were consistent, the restoring force to a perturbation (or the effective stiffness) was increased at long latencies. The results suggest that on short time scales, error signals from different sensory modalities are processed separately, combined only at the output stage.
On Normalisation of Infinitary Combinatory Reduction Systems
Authors: Jeroen Ketema
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

For fully-extended, orthogonal infinitary Combinatory Reduction Systems, we prove that terms with perpetual reductions starting from them do not have (head) normal forms. Using this, we show that 1 needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduction Systems, and that 1 weak and strong normalisation coincide for such systems as a whole and, in case reductions are non-erasing, also for terms. 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
Feature Discovery with Type Extension Trees
Authors: Paolo Frasconi, Manfred Jaeger, Andrea Passerini
Venue: Proceedings of the 18th international conference on Inductive Logic Programming (2008)

We are interested in learning complex combinatorial features from relational data. We rely on an expressive and general representation language whose semantics allows us to express many features that have been used in different statistical relational learning settings. To avoid expensive exhaustive search over the space of relational features, we introduce a heuristic search algorithm guided by a generalized relational notion of information gain and a discriminant function. The algorithm succesfully finds interesting and interpretable features on artificial and real-world relational learning problems.
Linear Distinguishing Attack on Shannon
Authors: Risto M. Hakala, Kaisa Nyberg
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

In this paper, we present a linear distinguishing attack on the stream cipher Shannon. Our distinguisher can distinguish the output keystream of Shannon from 2107 keystream words while using an array of 232 counters. The distinguisher makes use of a multidimensional linear transformation instead of a one-dimensional transformation, which is traditionally used in linear distinguishing attacks. This gives a clear improvement to the keystream requirement: we need approximately 25 times less keystream than when a one-dimensional transform is used.
A Collaborative Forensics Framework for VoIP Services in Multi-network Environments
Authors: Hsien-Ming Hsu, Yeali S. Sun, Meng Chang Chen
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

We propose a collaborative forensics framework to trace back callers of VoIP services in a multi-network environment. The paper is divided into two parts. The first part discusses the critical components of SIP-based telephony and determines the information needed for traceback in single and multiple Autonomous Systems (ASs). The second part proposes the framework and the entities of collaborative forensics. We also propose an algorithm for merging collected data. The mechanism used to execute collaborative forensics with cooperating units is presented and the procedures used in the collaborative architecture are described. For every entity, we suggest some interesting topics for research.
Function Evaluation Via Linear Programming in the Priced Information Model
Authors: Ferdinando Cicalese, Eduardo Sany Laber
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We determine the complexity of evaluating monotone Boolean functions in a variant of the decision tree model introduced in [Charikar et al. 2002]. In this model, reading different variables can incur different costs, and competitive analysis is employed to evaluate the performance of the algorithms. It is known that for a monotone Boolean function f, the size of the largest certificate, aka PROOF(f), is a lower bound for &gamma;(f), the best possible competitiveness achievable by an algorithm on f. This bound has been proved to be achievable for some subclasses of the monotone Boolean functions, e.g., read once formulae, threshold trees. However, determining &gamma;(f) for an arbitrary monotone Boolean function has so far remained a major open question, with the best known upper bound being essentially a factor of 2 away from the above lower bound. We close the gap and prove that for any monotone Boolean function f, &gamma;(f) = PROOF(f). In fact, we prove that &gamma;(f) &le; PROOF(f) holds for a class much larger than the set of monotone Boolean functions. This class also contains all Boolean functions.
Detecting Statistical Covariations of Sequence Physicochemical Properties
Authors: Moshe A. Gadish, David K. Chiu
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

Sequence analysis often does not take the physicochemical properties into account. On the other hand, some of these properties when identified may be useful in inferring the folding and functional attributes of the molecule when considered with the original sequence information. We evaluated here an analysis using multiple aligned sequences incorporating five physicochemical properties. In addition to site invariance information, we also consider the covariation or interdependence patterns between aligned sites using an information measure. We propose a method based on analyzing the expected mutual information between sites that is statistically significant with a confidence level. When summing the measured information along the aligned sites, we compare the pattern from the measure to the structural and active site of the molecule. In the experiments, the model enzyme molecule lysozyme is chosen. The aligned sequence data are evaluated based on the mapped physicochemical properties of the amino acid residues. Analysis between the original and the transformed sequence data incorporating the physicochemical properties are then compared subtracted and visualized. From the comparisons, the plots show that some of the selected physicochemical properties in the analysis correlate to the locations of active sites and certain folding structure such as helices. The experiments generally support the useful role of incorporating additional physicochemical properties into sequence analysis, when significance of the statistical variations is taken into account.
A Virtual Agent for a Cooking Navigation System Using Augmented Reality
Authors: Kenzaburo Miyawaki, Mutsuo Sano
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this paper, we propose a virtual agent for a cooking navigation system which use the ubiquitous sensors. The cooking navigation system can recognize the progress of cooking and can show appropriate contents suitable to the situation. Most cooking navigation systems show only a movie and a text. However, the recognition system of cooking is applicable to realize a virtual agent which can perform helpful actions suitable to the users' behavior. We implemented the virtual agent, and demonstrated the cooking navigation system including the agent.
Virtual social interactions: Evolutionary, social psychological and technological perspectives
Authors: Ahmed Y. Mahfouz, Andreas G. Philaretou, Antonis Theocharous
Venue: Computers in Human Behavior (2008)

This paper represents an exploratory and quantitative investigation into online dating from evolutionary, psychological, and technological points of view. In the past decade, the relatively inexpensive availability of user-friendly, fast, and reliable Internet technology has appealed to millions of consumers who suddenly found themselves engrossed by this sensational medium of communication, information, consumerism, and service. The majority of Internet users tend to be either recreational or utilitarian oriented, using such medium for a wide variety of tasks ranging from corresponding with friends and significant others, information gathering, purchasing goods and services, and, increasingly so, seeking and securing suitable dating and marital partners. The following research questions constitute the driving force for the current investigation: What are the evolutionary and social psychological intricacies of online dating? What are the technological variants or dimensions that render the consumption of online dating services appealing to users? An online survey was administered to 247 subjects to explore these questions and determine the technological dimensions of virtual social interaction. Exploratory factor analysis was then conducted to analyse the data. Eight technological dimensions emerged as a result of the analysis and served as the basis for the study's technological perspectives model of virtual social interactions.
A Dynamic Routing Algorithm in Multicast Communication Networks
Authors: Hee-Seon Jang, Jeom-Goo Kim, Kee-Sung Cho
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper proposes a heuristic algorithm to construct a shared-route in multicast routing networks that provide communications between multi-users such as IPTV, remote educations/health, and internet broadcasting. The measures of maximum delay, average delay, estimated delay between nodes are adopted for performance analysis. The performance of algorithm is compared with the optimal solution in which enumeration method is used to find the shared-route with minimum delay. Under the routing network with the uniformly distributed delay between nodes, the simulation results show that the algorithm using the estimated delay outperforms the other algorithms.
A Graph Theoretic Approach to Protein Structure Selection
Authors: Marco Vassura, Luciano Margara, Piero Fariselli, Rita Casadio
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

Protein Structure Prediction (PSP) aims to reconstruct the 3D structure of a given protein starting from its primary structure (chain of amino acids). It is a well known fact that the 3D structure of a protein only depends on its primary structure. PSP is one of the most important and still unsolved problems in computational biology. Protein Structure Selection (PSS), instead of reconstructing a 3D model for the given chain, aims to select among a given, possibly large, number of 3D structures (called decoys) those that are closer (according to a given notion of distance) to the original (unknown) one. Each decoy is represented by a set of points in ¿3. Existing methods for solving PSS make use of suitably defined energy functions which heavily rely on the primary structure of the protein and on protein chemistry. In this paper we present a completely different approach to PSS which does not take advantage at all of the knowledge of the primary structure of the protein but only relies on the graph theoretic properties of the decoys graphs (vertices represent amino acids and edges represent pairs of amino acids whose euclidean distance is less than or equal to a fixed threshold). Even if our methods only rely on approximate geometric information, experimental results show that some of the graph properties we adopt score similarly to energy-based filtering functions in selecting the best decoys. Our results show the principal role of geometric information in PSS, setting a new starting point and filtering method, for existing energy function-based techniques.
A robotic soccer passing task using petri net plans
Authors: P. F. Palamara, V. A. Ziparo, L. locchi, D. Nardi, P. Lima, H. Costelha
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

This demonstration shows the implementation of a cooperative and coordinated robotic task in the soccer domain. Two Sony AIBO robots are placed on a soccer field with the task of passing a ball (Figure 1). Initially the robots search for the ball, and when they have located it, they exchange their local information about its position. This information is used to decide which robot will pass the ball (i.e. take the Passer role) and which robot will intercept it (i.e. take the Receiver role). The Passer robot reaches the ball, grabs it and turns to the Receiver. In the meanwhile, the Receiver moves to a predefined distance to the Passer. When both the Passer and Receiver robots have completed these tasks, they synchronize and execute, respectively, a pass and an intercept behavior. At the end of the execution, a final synchronization is performed. The robots exchange information about the outcome of the behavior, and they repeat the plan.
Towards Automated Game Design
Authors: Mark J. Nelson, Michael Mateas
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Game generation systems perform automated, intelligent design of games (i.e. videogames, boardgames), reasoning about both the abstract rule system of the game and the visual realization of these rules. Although, as an instance of the problem of creative design, game generation shares some common research themes with other creative AI systems such as story and art generators, game generation extends such work by having to reason about dynamic, playable artifacts. Like AI work on creativity in other domains, work on game generation sheds light on the human game design process, offering opportunities to make explicit the tacit knowledge involved in game design and test game design theories. Finally, game generation enables new game genres which are radically customized to specific players or situations; notable examples are cell phone games customized for particular users and newsgames providing commentary on current events. We describe an approach to formalizing game mechanics and generating games using those mechanics, using WordNet and ConceptNet to assist in performing common-sense reasoning about game verbs and nouns. Finally, we demonstrate and describe in detail a prototype that designs micro-games in the style of Nintendo's WarioWare series.