ppxscal/embedding_network huggingface dataset:
Node fault robustness for heterogeneous dynamic sensor networks
Authors: Simone Gabriele, Paolo Di Giamberardino
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

The paper deals with the problem of computing reference trajectories for a network of mobile sensors in order to maximize the coverage with respect to multiple quantities within a prefixed time interval. A centralized formulation of the problem is given for the case of sensing nodes provided with a different set of sensors (hence heterogeneity). The same formulation is shown to be useful for facing the problem of nodes faults, yielding to a robust coverage problem. Constraints introduced by kinematic and dynamic actuator limits, by communication and by collision avoidance are considered in the formulation. A global solution is proposed and some simulations are reported to show its effectiveness.
Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs
Authors: Helen C. Purchase, Amanjit Samra
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs which represent changing relational information over time. Like the static layout algorithms that preceded these, empirical work lags behind their design, and assumptions are made about how users' comprehension may be enhanced without human data to support them. This paper presents an experiment investigating an existing dynamic layout algorithm, focusing on the effect of the preservation of the mental map on comprehension. The results indicate that extremes produce better performance, suggesting that individual preference may be important.
Arithmetic Operators for Pairing-Based Cryptography
Authors: Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we first study an accelerator for the ¿ T pairing over $\mathbb{F}_3[x]/(x^{97}+x^{12}+2)$. Our architecture is based on a unified arithmetic operator which performs addition, multiplication, and cubing over $\mathbb{F}_{3^{97}}$. This design methodology allows us to design a compact coprocessor (1888 slices on a Virtex-II Pro 4 FPGA) which compares favorably with other solutions described in the open literature. We then describe ways to extend our approach to any characteristic and any extension field.
EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
Authors: Rajeev Goré, Linh Anh Nguyen
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

The description logic $\mathcal{SHI}$ extends the basic description logic $\mathcal{ALC}$ with transitive roles, role hierarchies and inverse roles. The known tableau-based decision procedure [9] for $\mathcal{SHI}$ exhibit (at least) NEXPTIME behaviour even though $\mathcal{SHI}$ is known to be EXPTIME-complete. The automata-based algorithms for $\mathcal{SHI}$ often yield optimal worst-case complexity results, but do not behave well in practice since good optimisations for them have yet to be found. We extend our method for global caching in $\mathcal{ALC}$ to $\mathcal{SHI}$ by adding analytic cut rules, thereby giving the first EXPTIME tableau-based decision procedure for $\mathcal{SHI}$, and showing one way to incorporate global caching and inverse roles.
Probabilistic Decision Making in Robot Soccer
Authors: Pablo Guerrero, Javier Ruiz-Del-Solar, Gonzalo Díaz
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Decision making is an important issue in robot soccer, which has not been investigated deeply enough by the RoboCup research community. This paper proposes a probabilistic approach to decision making. The proposed methodology is based on the maximization of a game situation score function, which generalizes the concept of accomplishing different game objectives as: passing, scoring a goal, clearing the ball, etc. The methodology includes a quantitative method for evaluating the game situation score. Experimental results in a high-level strategy simulator, which runs our four-legged code in simulated AIBOs' robots, show a noticeable improvement in the scoring effectiveness achieved by a team that uses the proposed approach for making decisions.
Focus+Context Resolution Adaption for Autostereoscopic Displays
Authors: Timo Ropinski, Frank Steinicke, Gerd Bruder, Klaus Hinrichs
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

In this paper we introduce concepts in order to enhance the resolution of autostereoscopic displays for performing routine tasks. Our Sim2D3D technique presented earlier allows users to work with any 2D or 3D application in an autostereoscopic desktop environment. We have conducted a user study to investigate the impact of this technique on routine tasks performed using autostereoscopic displays. The problems identified in this user study led us to further improve the design of autostereoscopic user interfaces by increasing the effective resolution for context areas.
Multimedia and VR Support for Direct Communication of Designers
Authors: A. Schüppen, O. Spaniol, D. Thißen, I. Assenmacher, E. Haberstroh, T. Kuhlen
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The development of design processes in chemical engineering and plastics processing requires close cooperation between designers of different companies or working groups. A large number of communication relationships is established, e.g. for the clarification of problems within single tasks, or within project meetings covering the discussion about interim results. With the ongoing development of a process, different types of communication relationships will occur, as the required communication form as well as the extent of communication are depending on the work task. For an efficient support of the communication between designers, support tools are needed to enable cooperative computer-aided work tailored to an actual task and to obtain a speed-up of the development of a process.This section discusses several activities to improve the communication between engineers by multimedia and Virtual Reality tools and protocol mechanisms for supporting new forms of cooperative work in the design of a process. To ease the usage of those tools and protocols within the work processes, they are integrated into the normal working environments of the designers. For communication processes involving geographically distributed designers, the communication platform KomPaKt was developed, which integrates the new communication and cooperation tools for different purposes in a single, configuration-free, and intuitive user interface. As a specially interesting case of cooperation between designers, the technology of immersive Virtual Reality for simulation sciences was examined in more detail using the example of compound extruders, as Virtual Reality technology plays a key role in interdisciplinary communication processes.
The Study of Response Model & Mechanism Against Windows Kernel Compromises
Authors: Dong Hwi Lee, Jae Myung Kim, Kyong-Ho Choi, Kuinam J. Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Malicious codes have been widely documented and detected in information security breach occurrences of Microsoft Windows platform. Legacy information security systems are particularly vulnerable to breaches, due to Window kernel-based malicious codes,that penetrate existing protection and remain undetected. To date there has not been enough quality study into and information sharing about Windows kernel and inner code mechanisms, and this is the corereason for the success of these codes into entering systems and remaining undetected. This paper focus on classification and formalization of type, target and mechanism of various Windows kernel-based attacks,and will present suggestions for effective response methodologies in the categories of ; "Kernel memory protection", "Process & driver protection" and "File system & registry protection". An effective Windows kernel protection system will be presented through the collection and analysis of Windows kernel and inside mechanisms, and through suggestions for the implementation methodologies of unreleased and new Windows kernel protection skill. Results presented in this paper will explain that the suggested system be highly effective and has more accurate for intrusion detection ratios, then the current legacy security systems (i.e., virus vaccines, and Windows IPS, etc) intrusion detection ratios. So, It is expected that the suggested system provides a good solution to prevent IT infrastructure from complicated and intelligent Windows kernel attacks.
Synthesis of Dancing Character Motion from Beatboxing Sounds
Authors: Kyung-Kyu Kang, Dongho Kim
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

This paper describes a real-time system to synthesize a dancing character that is matched with beatboxing sounds. It is easier for humans to make a rhythmical sound with their mouth and vocal like a beatboxing than playing musical instruments. The system extracts rhythm features from dancing motion clips contained in a motion clip database at a preprocessing step. While performing beatboxing in real time, the system extracts rhythm features from those sounds and then finds appropriate a clip in the database whose rhythm features are matched to the sounds.
Graph-Based Design and Analysis of Dynamic Software Architectures
Authors: Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi, Dan Hirsch, Alberto Lluch Lafuente
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented in Alloy; ii) a process algebraic presentation of graph transformation implemented in Maude. The two approaches are compared by showing how different aspects can be tackled, including representation issues, modelling phases, property specification and analysis.
Rule Bases Integration on the Example of a Fuzzy Model of WIG20
Authors: Izabela Rejer
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Sometimes, when a fuzzy model is created, two knowledge sources are available --- a data set describing the behavior of an analyzed system and a set of expert rules. In such case three possible approaches to the modelling process are possible: utilize a data set, utilize a set of expert rules or utilize both knowledge sources simultaneously. According to the author of this paper, the third approach is the most reasonable because by joining expert rules with rules created on the basis of a data set, fuzzy model inherits the specific advantages of both rule sets. The aim of this paper is to verify this statement and to illustrate (on a real example) the superiority of a model composed of expert and "data" rules over a model composed only of expert rules and a model composed only of "data" rules. The paper presents a writer's method of combining two rule bases and its application for building a combined fuzzy model of a real economic problem.
A Novel Algorithm for Associative Classification
Authors: Gourab Kundu, Sirajum Munir, Md. Faizul Bari, Md. Monirul Islam, Kazuyuki Murase
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Associative classifiers have been the subject of intense research for the last few years. Experiments have shown that they generally result in higher accuracy than decision tree classifiers. In this paper, we introduce a novel algorithm for associative classification "Classification based on Association Rules Generated in a Bidirectional Apporach" (CARGBA). It generates rules in two steps. At first, it generates a set of high confidence rules of smaller length with support pruning and then augments this set with some high confidence rules of higher length with support below minimum support. Experiments on 6 datasets show that our approach achieves better accuracy than other state-of-the-art associative classification algorithms.
Two-Point Codes on Norm-Trace Curves
Authors: Carlos Munuera, Guilherme C. Tizziotti, Fernando Torres
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

We determine the Weierstrass semigroup of a pair of rational points on Norm-Trace curves. We use this semigroup to improve the lower bound on the minimum distance of two-point algebraic geometry codes arising from these curves.
Security aspects in wireless networks
Authors: Bojan Bakmaz, Miodrag Bakmaz, Zoran Bojkovic
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

This work presents a survey of some recent security aspects in wireless networks and discuss challenges in designing integrated security platform in wireless network environment. Firstly, recent security issues together with general security analysis and criteria are outlined. Starting from the point that security in wireless networks mainly involves authentication, confidentiality, integrity and authorization, integration of different wireless networks is analyzed. The importance of secure handover between heterogeneous networks is emphasized, too.
Rotation Invariant Texture Classification Using Gabor Wavelets
Authors: Qingbo Yin, Jong Nam Kim, Kwang-Seok Moon
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

This paper presents a new method for rotation invariant texture classification based on Gabor wavelets. The Gabor representation has been shown to be optimal in the sense of minimizing the joint two-dimensional uncertainty in space and frequency, and the Gabor wavelet can be used to decompose an image into multiple scales and multiple orientations. Two group features, i.e. the global feature vector and local feature matrix, can be constructed by the mean and variance of the Gabor filtered image. The global feature vector is rotation invariant, and the local feature matrix can be adjusted by a circular shift operation to rotation invariant so that all images have the same dominant direction. By the two group features, a discriminant can be found to classify the rotated images. In the primary experiments, comparatively high correct classification rates were obtained using a large sample sets with 1998 rotated images of 111 Brodazt texture classes.
On a Graph Calculus for Algebras of Relations
Authors: R. Freitas, P. A. Veloso, S. R. Veloso, P. Viana
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

We present a sound and complete logical system for deriving inclusions between graphs from inclusions between graphs, taken as hypotheses. Graphs provide a natural tool for expressing relations and reasoning about them. Here we extend this system to a sound and complete one to cope with proofs from hypotheses. This leads to a system dealing with complementation. Other approaches using pictures for relations use as bases the theory of allegories or rewriting systems. Our formalism is more widely applicable and provides a common denominator of these approaches.
Hover or tap?: supporting pen-based menu navigation for older adults
Authors: Karyn Moffatt, Sandra Yuen, Joanna McGrenere
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Tablet PCs are gaining popularity, but many users, particularly older ones, still struggle with pen-based interaction. One type of error, drifting, occurs when users accidentally hover over an adjacent menu, causing their focus menu to close and the adjacent one to open. In this paper, we propose two approaches to address drifting. The first, tap, requires an explicit tap to switch menus, and thus, eliminates the possibility of a drift. The second, glide, uses a distance threshold to delay switching, and thereby reduce the likelihood of a drift. We performed a comparative evaluation of our approaches with a control interface. Tap was effective at reducing drifts for both groups, but it was only popular among older users. Glide surprisingly did not show any performance improvement. Additional research is needed to determine if the negative findings for glide are a result of the particular threshold used, or reflect a fundamental flaw in the glide approach.
A Group Key Agreement Scheme Revisited
Authors: Zhengjun Cao, Lihua Liu
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

In PKC'2004, a constant-round group key exchange protocol is proposed. It takes advantage of the properties of the ElGamal encryption scheme combined with the standard secret sharing technique. In this paper, we show that the scheme can be greatly simplified because the standard secret sharing technique does not work well. Based on the observation, we present a revisited scheme. It saves about 4/5 cost of the original scheme. In addition, its security can be directly reduced to the underlying Schnorr's signature scheme and the ElGamal encryption.
Optimal Feature Point Selection and Automatic Initialization in Active Shape Model Search
Authors: Karim Lekadir, Guang-Zhong Yang
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

This paper presents a novel approach for robust and fully automatic segmentation with active shape model search. The proposed method incorporates global geometric constraints during feature point search by using inter-landmark conditional probabilities. The A* graph search algorithm is adapted to identify in the image the optimal set of valid feature points. The technique is extended to enable reliable and fast automatic initialization of the ASM search. Validation with 2-D and 3-D MR segmentation of the left ventricular epi-cardial border demonstrates significant improvement in robustness and overall accuracy, while eliminating the need for manual initialization.
Simple Perceptually-Inspired Methods for Blob Extraction
Authors: Paolo Falcoz
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Studies in Visual Attention (VA) and eye movements have shown that humans generally only attend a few regions of interest (ROIs) in an image. The idea is to perform image analysis only on a small neighborhood of each ROI. This regions can be thought of as the most informative parts of the image, and as such can be analyzed with respect to colors, textures, and shapes. In this paper we will focus on color-driven blob extraction. Inspiration from the human retina guides the definition of neighborhood of a ROI, while psychological factors in human color perception are used to drive color selection.
A Scalable Formal Framework for Analyzing the Behavior of Nature-Inspired Routing Protocols
Authors: Muhammad Shahzad, Saira Zahid, Muddassar Farooq
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Nature-inspired routing algorithms for fixed networks is an active area of research. In these algorithms, ant- or bee-agents are deployed for collecting the state of a network and providing them to autonomous and fully distributed controllers at each network node. In these routing systems the agents, through local interactions, self-organize to produce system-level behaviors which show adaptivity to changes and perturbations in the network environment. The formal modeling of such fully self-organizing, distributed and adaptive routing systems is a difficult task. In this paper, we propose a scalable formal framework that has following desirable features: (1) it models important performance metrics: throughput, delay and goodness of links, (2) it is scalable to any size of topology, (3) it is robust to changing network traffic conditions. The proposed framework is utilized to model a well-known BeeHive protocol which is further validated on NTTNeT (a 57 node topology). To the best of our knowledge, this is the first formal framework that has been validated on such a large topology.
Cellular Automata Simulation of Traffic Jam in Sag Section
Authors: Yukiko Wakita, Takuya Kuroda, Eisuke Kita
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

A traffic congestion often occurs near a sag section on a freeway. Since a road gradient changes gradually in a sag section, a driver dose not notice it and therefore, a traffic congestion occurs.This paper describes the cellular automata simulation of the traffic flow through a sag section. The simulation is performed by the stochastic velocity model[4]. The results show that the effect of a sag zone to the traffic congestion becomes strong according to the increase of car density and that average velocity tends to decrease not at the sag section but at a little ahead point of sag section.
Using a blog to bridge the mathematical knowledge at the tertiary level
Authors: Fariel Mohan, B. S. Bhatt
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Over the decades, the imparting of knowledge by teachers have always been proven challenging. Research in teaching has contributed to some improvement in teaching. In the Caribbean, financial assistance for research in teaching is very limited. This paper looks at the challenges faced with the teaching of Mathematics at the tertiary level based on the shortcomings of the teaching of mathematics at the secondary level. The paper illustrates a cost effective approach based on the social constructivism in creating a community learning scenario by using a virtual classroom to teach Mathematics. The paper highlights the benefits of collaborative learning by the student academic success, self confidence improvement and togetherness resulting from the first phase of the project.