ppxscal/embedding_network huggingface dataset:
A Context-Based Institutional Normative Environment
Authors: Henrique Lopes Cardoso, Eugénio Oliveira
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

We explore the concept of an agent-based Electronic Institution including a normative environment that supports electronic contract formation by providing a contextual normative background. We formalize the normative state using first-order logic and define institutional rules and norms operating on that state. A suitable semantics regarding the use of norms within a hierarchical context structure is given, based on norm activation conflict and defeasibility. Norm activation relies on substitution as in first-order logic. Reasoning about the fulfillment and violation of deadline obligations is formalized using linear temporal logic; implementation with institutional rules is discussed. Examples exploiting the normative environment are given.
Classification of pathological shapes using convexity measures
Authors: Paul L. Rosin
Venue: Pattern Recognition Letters (2009)

Two new shape measures for quantifying the degree of convexity are described. When applied to assessment of skin lesions they are shown to be an effective indicator of malignancy, outperforming Lee et al's. OII scale-space based irregularity measure. In addition, the new measures were applied to the classification of mammographic masses and lung field boundaries and were shown to perform well relative to a large set of common shape measures that appear in the literature such as moments, compactness, symmetry, etc.
Algebraic model for the intercommunicating hardware components behaviour
Authors: Anca Vasilescu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Process algebra represents the study of concurrent communicating processes in an algebraic framework. For the interest of the present results we use the Milner's process algebra SCCS for specifying the synchronized communication between specific hardware components. In this paper, the original contribution of the author consists in defining and verifying the SCCS specifications for the intercommunicating hardware components. With such an algebraic model, we remark the main advantage of both formal and automated verification of the proposed SCCS agents, instead of a simulation-based verification of the computer components behaviour.
A Multiple-Mask Operation Compatible with IEEE 802.15.4a Non-coherent UWB Ranging Systems
Authors: Woon-Yong Park, Sungsoo Choi, Won-Cheol Lee
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

During the execution of precise ranging in the time domain, the most important fact to consider is how to achieve an accurate estimate of the time corresponding to first arrival of the transmitter. However, it is difficult to extract an estimate of the time-of-arrival (TOA) through use of a simple correlator due to degradation on correlation, and in the case where the pulse repetition interval (PRI) is less than the maximum excess delay (MED). In order to enhance the correlation capability, this paper proposes a TOA estimation method that obeys a threshold predetermined in a non-coherent system using multiple-mask operation (MMO). The performance of the proposed scheme is verified by conducting simulations under two different types of channel situations. The simulation results show that the proposed scheme performs well even in a dense indoor multipath environment and with the existence of multiple simultaneously operating piconets (SOPs).
A write-based solver for SAT modulo the theory of arrays
Authors: Miquel Bofill, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solver for arrays in the context of the DPLL(T) approach to SMT. The main characteristics of our solver are: (i) no translation of writes into reads is needed, (ii) there is no axiom instantiation, and (iii) the T-solver interacts with the Boolean engine by asking to split on equality literals between indices. Unlike most state-of-the-art array solvers, it is not based on a lazy instantiation of the array axioms. This novelty might make it more convenient to apply this solver in some particular environments. Moreover, it is very competitive in practice, specially on problems that require heavy reasoning on array literals.
Multiple robot / single human interaction: effects on perceived workload
Authors: J. A. Adams
Venue: Behaviour & Information Technology (2009)

This paper presents results from a user evaluation of a real multiple robot system in which the human's perceived workload and performance were measured. Participants completed tasks with one, two and four real heterogeneous mobile ground-based robots for indoor material transportation tasks. Twelve participants completed four trials of each task over two days. Generally speaking, little difference was found between the one-and two-robot tasks; however, perceived workload significantly increased while performance decreased during the four-robot task. A correlation analysis found that perceived workload increased as the number of commands (in total and by command type) and completion times increased. The highest number of accidents and user errors occurred during the four-robot task. In order to increase the number of robots a single human can supervise, the human must be provided with capabilities that reduce the number of required commands while also optimising the human's interactions with the robots.
O' game, can you feel my frustration?: improving user's gaming experience via stresscam
Authors: Chang Yun, Dvijesh Shastri, Ioannis Pavlidis, Zhigang Deng
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

One of the major challenges of video game design is to have appropriate difficulty levels for users in order to maximize the entertainment value of the game. Game players may lose interests if a game is either too easy or too difficult. This paper presents a novel methodology to improve user's experience in computer games by automatically adjusting the level of the game difficulty. The difficulty level is computed from measurements of the facial physiology of the players at a distance. The measurements are based on the assumption that the players' performance during the game-playing session alters blood flow in the supraorbital region, which is an indirect measurement of increased mental activities. This alters heat dissipation, which can be monitored in a contact-free manner through a thermal imaging-based stress monitoring and analysis system, known as StressCam. In this work, we investigated on two primary objectives: (1) the feasibility of utilizing the facial physiology in automatically adjusting the difficulty level of the game and (2) the capability of the automatic difficulty level adjustment in improving game players' experience. We employed and extended a XNA video game for this study, and performed an in-depth, comparative usability evaluation on it. Our results show that the automatic difficulty adjustable system successfully maintains game players' interests and substantially outperforms traditional fixed-difficulty mode games. Although a number of issues of this preliminary study remain to be investigated further, this research opens a new direction that utilizes non-contact stress measurements for monitoring and further enhancing a variety of user-centric, interactive entertainment activities.
Comparing two off-the-shelf robots for the demonstration of Thai folk dances: an initial study
Authors: Chun Che Fung, Thitipong Nandhabiwat
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper, we examined the implementation of two off-the-shelf humanoid robots for the demonstration and training of Thai folk dances. One is based on a low cost robot, "RS Media" by by WowWee. It has a recommended retail price (RRP) of USD300. The other robot is the "SPC-101C" from Speecys Corp. SPC-101C's RRP is about ten times of RS Media. The objective is to determine the appropriateness of these two robots for use in the training and demonstration of Thai dance movements. The paper presents results from an initial investigation. The SPC-101C is more flexible and has more advanced functions. Interestingly, it was observed that some of the movements are better on the cheaper robot. However, the faster response and advanced interactivity of SPC-101C definitely has greater potential for more complex movements and advanced applications.
Team work in software development student projects
Authors: Anca Andreescu, Iulian Intorsureanu, Adina Uta, Rodica Mihalca
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

To enhance students' capabilities regarding team work in real software development projects, should be a major objective for any Computer Science department within a University. Starting from the authors' experience in coordinating student teams for the development of complex projects, this paper outlines a set of considerations in this regard.
Evolutionary operators for optimal gate location in liquid composite moulding
Authors: Frédéric Ratle, Vincent Achim, François Trochu
Venue: Applied Soft Computing (2009)

A multi-objective evolutionary algorithm is applied to the problem of optimal gate location in liquid composite moulding. The Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is implemented and the efficiency of different variation operators is assessed on a benchmark problem, i.e., a mould of simple geometry. Following this, the algorithm is applied to a more complex mould geometry with the best variation operators. It is shown that the sole use of mutation proved better in the case of a complex part, whereas crossover proved helpful only for a simpler geometry.
AAML Based Avatar Animation with Personalized Expression for Online Chatting System
Authors: Junfa Liu, Yiqiang Chen, Xingyu Gao, Jinjing Xie, Wen Gao
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper presents an online chatting system with automatic expression animation and animated avatar. The system is constructed upon an XML based language AAML (Affective Animation Markup Language), which describes hierarchically affective content for online communication. Once the user types a chatting sentence, the AAML produces a piece of personalized facial animation. The animation would be sent to the remote client right now to enrich the chatting process. Comparatively, our system is designed with its dedicated feature that its structure is hierarchical and open, so the users can extend the AAML, defining their own tags to realize personal affective expression. In addition, caricature generation according to an input facial photograph is embedded in the framework, so the animation is synthesized based on the caricature with entertainment effect. Successful application of the online chatting system shows that our system can enhance affective interaction by the customized facial animation and the animated avatar that is similar with the user. The function can also be widely applied in online or mobile environment such as multimedia message synthesis.
A polyhedron representation for computer vision
Authors: Bruce G. Baumgart
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

My approach to computer vision is best characterized as inverse computer graphics. In computer graphics, the world is represented in sufficient detail so that the image forming process can be numerically simulated to generate synthetic television images; in the inverse, perceived television pictures (from a real TV camera) are analyzed to compute detailed geometric models.
Three models for gene assembly in ciliates: a comparison
Authors: Miika Langille, Ion Petre, Vladimir Rogojin
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

We survey in this paper the main differences among three variants of an intramolecular model for gene assembly: the general, the simple, and the elementary models. We present all of them in terms of sorting signed permutations and compare their behavior with respect to: (i) completeness, (ii) confluence (with the notion defined in three different setups), (iii) decidability, (iv) characterization of the sortable permutations in each model, (v) sequential complexity, and (vi) experimental validation.
Total Tomography
Authors: Michael Jay Schillaci
Venue: Computing in Science and Engineering (2009)

Michael J. Schillaci reviews Advances in Discrete Tomography and Its Applications.
Proceedings of 2nd Workshop on General Purpose Processing on Graphics Processing Units
Venue: ACM International Conference Proceeding Series; Vol. 383 (2009)

Graphics cards have long been used to accelerate gaming and 3D graphics applications. More recently, they have begun to be used to accelerate more general purpose and high performance applications. GPUs are beginning to be used to accelerate a wide range of remote sensing, environmental monitoring, business forecasting and medical imaging applications, though have relied on programming interfaces that utilized graphics primitives and libraries. Only recently have general purpose programming environments become available that allow these platforms to be used to accelerate a wider class of applications. We are pleased to present these 12 high quality papers that were selected for the final program of GPGPU-2. The goal of this workshop is to provide a forum to discuss these general purpose programming environments and platforms, as well as describe successful applications that have leveraged this new approach to acceleration. This year's workshop focuses on a range of applications, though also presents new work in GPU languages and optimization techniques, as well as GPU reliability
Checking assignments of controls to risks for internal control
Authors: Yasuhito Arimoto, Michiharu Kudoh, Yuji Watanabe, Kokichi Futatsugi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

It has become a more important role in society to manage Internal Control in industry while improper activities by well-known corporations are revealed one after another. Financial Instruments and Exchange Law is promulgated on June 14th, 2006, to impose documentation of financial reporting on Japanese listed companies. To document financial reporting, each company has to evaluate control activities in administrative work-flows. Evaluation is to check if control activities in administrative workflows prevent or mitigate latent risks properly. The decision-making criteria for evaluation depend on the evaluator and are not seen explicitly. This causes lack of consistency of evaluation. To avoid inconsistency, the decision-making criteria for the evaluation should be specified precisely. In this paper, we propose a decision-making criterion for evaluation and show how evaluation can be done with it. Evaluation with precisely defined decision-making criteria raises reliability of financial reporting. This research is helpful to construct an e-Government system for evaluations of business processes for Internal Control.
Describing and Calculating of Geometry Adjacency Relation with Voronoi Tessellation
Authors: Jiatian Li, Xiaoqing Zuo, Min Shang, Chunxiao Wang
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Geometry adjacency relation is a new important spatial relationship and can help many fields of Geographic Information System (GIS). This paper described the geometry adjacency relation with topology and metric based on Voronoi model. (i) The geometry adjacency relation is an equivalence relation for an object set is proved, and more it is represented by Voronoi adjacency graph (VAG). (ii) A local computing method (V2) of geometry adjacency upon on VAG is proposed, which takes distance as a foundational operator to ensure influence neighbors. (iii) A prototype application of the V2 method to three queries of geometry adjacency is briefly discussed.
Hamiltonian connectedness in 3-connected line graphs
Authors: Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan
Venue: Discrete Applied Mathematics (2009)

We investigate graphs G such that the line graph L(G) is hamiltonian connected if and only if L(G) is 3-connected, and prove that if each 3-edge-cut contains an edge lying in a short cycle of G, then L(G) has the above mentioned property. Our result extends Kriesell's recent result in [M. Kriesell, All 4-connected line graphs of claw free graphs are hamiltonian-connected, J. Combin. Theory Ser. B 82 (2001) 306-315] that every 4-connected line graph of a claw free graph is hamiltonian connected. Another application of our main result shows that if L(G) does not have an hourglass (a graph isomorphic to K"5-E(C"4), where C"4 is an cycle of length 4 in K"5) as an induced subgraph, and if every 3-cut of L(G) is not independent, then L(G) is hamiltonian connected if and only if @k(L(G))>=3, which extends a recent result by Kriesell [M. Kriesell, All 4-connected line graphs of claw free graphs are hamiltonian-connected, J. Combin. Theory Ser. B 82 (2001) 306-315] that every 4-connected hourglass free line graph is hamiltonian connected.
Privacy-preserving 802.11 access-point discovery
Authors: Janne Lindqvist, Tuomas Aura, George Danezis, Teemu Koponen, Annu Myllyniemi, Jussi Mäki, Michael Roe
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

It is usual for 802.11 WLAN clients to probe actively for access points in order to hasten AP discovery and to find "hidden" APs. These probes reveal the client's list of preferred networks, thus, present a privacy risk: an eavesdropper can infer attributes of the client based on its associations with networks. We propose an access-point discovery protocol that supports fast discovery and hidden networks while also preserving privacy. Our solution is incrementally deployable, efficient, requires only small modifications to current client and AP implementations, interoperates with current networks, and does not change the user experience. We note that our solution is faster than the standard hidden-network discovery protocol based on measurements on a prototype implementation.
Rooted k-connections in digraphs
Authors: András Frank
Venue: Discrete Applied Mathematics (2009)

The problem of computing a minimum cost subgraph D^'=(V,A^') of a directed graph D=(V,A) so as to contain k edge-disjoint paths from a specified root r"0@?V to every other node in V was solved by Edmonds [J. Edmonds, Submodular functions, matroids, and certain polyhedra, in: R. Guy, H. Hanani, N. Sauer, J. Schonheim (Eds.), Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970, pp. 69-87] by an elegant reduction to weighted matroid intersection. A corresponding problem when openly disjoint paths are requested rather than edge-disjoint ones was solved in [A. Frank, E. Tardos, An application of submodular flows, Linear Algebra Appl. 114-115 (1989) 329-348] with the help of submodular flows. Here we show that the use of submodular flows is actually avoidable and even a common generalization of the two rooted k-connection problems reduces to matroid intersection. The approach is based on a new matroid construction extending what Whiteley [W. Whiteley, Some matroids from discrete applied geometry, in: J.E. Bonin, J.G. Oxley, B. Servatius (Eds.), Matroid Theory, in: Contemp. Math., vol. 197, Amer. Math. Soc, Providence, RI, 1996, pp. 171-311] calls count matroids. We also provide a polyhedral description using supermodular functions on bi-sets and this approach enables us to handle more general rooted k-connection problems. For example, with the help of a submodular flow algorithm the following restricted version of the generalized Steiner-network problem is solvable in polynomial time: given a digraph D=(V,A) with a root-node r"0, a terminal set T, and a cost function c:A->R"+ so that each edge of positive cost has its head in T, find a subgraph D^'=(V,A^') of D of minimum cost so that there are k openly disjoint paths in D^' from r"0 to every node in T.
Computational algorithms for generating efficient and innovative load-carrying structures
Authors: Xiaodong Huang, Yi Min Xie, Kazem Ghabraie
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

The evolutionary structural optimization (ESO) method is based on the simple concept of gradually removing underutilized material and at the same time adding efficient material to the structure. As a result, the resulting structural shape evolves towards an optimum. This paper presents the latest developments of ESO method in generating efficient and innovative structures, including optimal design of bridges, optimization of periodic structures, optimal design of a structure with multiple materials and shape and reinforcement optimization of underground tunnels.
Accurate Network-Scale Power Profiling for Sensor Network Simulators
Authors: Joakim Eriksson, Fredrik Österlind, Niclas Finne, Adam Dunkels, Nicolas Tsiftes, Thiemo Voigt
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

Power consumption is the most important metric in wireless sensor network research, but existing simulation tools for measuring or estimating power consumption are either impractical or have unclear accuracy. We present COOJA/MSPSim, a practical simulation-based tool for network-scale power estimation based on Contiki's built-in power profiling mechanism, the COOJA sensor network simulator and the MSPSim sensor node emulator. We compare experimental results measured on real sensor nodes with simulation results for three different MAC protocols. The accuracy of our results indicates that COOJA/MSPSim enables accurate network-scale simulation of the power consumption of sensor networks.
Menus leaf: enrichir les menus lin&eacute;aires par des gestes
Authors: Gilles Bailly, Anne Roudaut, Eric Lecolinet, Laurence Nigay
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

We present a new kind of linear menu based on gesture, called Leaf menu. The Leaf menu is adapted to the selection of commands for the cases of small handheld touchscreen devices (PDA, smartphone): Indeed it supports finger-based interaction, minimizes the required screen space, manages occlusion and can be used close to the screen borders. Moreover the Leaf menu suppports eyes-free selection. It can also be used in the context of a tabletop and of a personal computer by providing an alternative to keyboard shortcuts.