ppxscal/embedding_network huggingface dataset:
Grammatical Inference as a Tool for Constructing Self-learning Syntactic Pattern Recognition-Based Agents
Authors: Janusz Jurek
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Syntactic pattern recognition-based agents have been proven to be a useful tool for constructing real-time process control intelligent systems. In the paper the problem of self-learning schemes in the agents is discussed. Learning capabilities are very important if practical applications of the agents are considered, since the agents should be able to accumulate knowledge about the environment and flexible react to the changes in the environment. As it is shown in the paper, the learning scheme in the agents can be based on a suitable grammatical inference algorithm.
Fuzzy Adaptive Search Method for Parallel Genetic Algorithm Tuned by Evolution Degree Based on Diversity Measure
Authors: Yoichiro Maeda, Qiang Li
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

Generally, as for Genetic Algorithms (GAs), it is not always optimal search efficiency, because genetic parameters (crossover rate, mutation rate and so on) are fixed. For this problem, we have already proposed Fuzzy Adaptive Search Method for GA (FASGA) that is able to tune the genetic parameters according to the search stage by the fuzzy reasoning. On the other hand, in order to improve the solution quality of GA, Parallel Genetic Algorithm (PGA) based on the local evolution in plural sub-populations (islands) and the migration of individuals between islands has been researched.In this research, Fuzzy Adaptive Search method for Parallel GA (FASPGA) combined FASGA with PGA is proposed. Moreover as the improvement method for FASPGA, Diversity Measure based Fuzzy Adaptive Search method for Parallel GA (DM-FASPGA) is also proposed. Computer simulation was carried out to confirm the efficiency of the proposed method and the simulation results are also reported in this paper.
Relative Pose Estimation from Two Circles
Authors: Stefan Rahmann, Veselin Dikov
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

Motion estimation between two views especially from a minimal set of features is a central problem in computer vision. Although algorithms for computing the motion between two calibrated cameras using point features exist, there is up to now no solution for a scenario employing just circles in space. For this task a minimal and linear solver is presented using only two arbitrary circles. It is shown that the derived algorithm is not hampered by critical configurations. Here, the problem of relative pose estimation is cast into a combined reconstruction plus absolute orientation algorithm. Thus, even for small or vanishing translations the relative pose between cameras can be computed in a stable manner within a single algorithm.
A one-time signature using run-length encoding
Authors: Rainer Steinwandt, Viktória I. Villányi
Venue: Information Processing Letters (2008)

A one-time signature scheme using run-length encoding is presented, that in the random oracle model offers security against chosen-message attacks. For parameters of interest, the proposed scheme enables about 33% faster verification with a comparable signature size than a construction of Merkle and Winternitz. The public key size remains unchanged (1 hash value). The main price for the faster verification is an increase of the time for signing messages and for key generation.
On a conjecture of Erdős, Graham and Spencer, II
Authors: Jin-Hui Fang, Yong-Gao Chen
Venue: Discrete Applied Mathematics (2008)

It is conjectured by Erdos, Graham and Spencer that if 1@?a"1@?a"2@?...@?a"s are integers with @?"i"="1^s1/a"i
Analysis of countermeasures of worm propagations and interactions in wired and wireless networks
Authors: Ahmed Helmy
Venue:  (2007)

&ldquo;War of the worms&rdquo; is a war between opposing computer worms, creating complex worm interactions as well as a detrimental impact on infrastructure. For example, in September 2003 the Welchia worms were launched to terminate the Blaster worms and patch the vulnerable hosts. We propose a new Worm Interaction Model (based upon and extending beyond the epidemic model) focusing on random-scan network worm interactions and encounter-based worm interactions. Motivated by &ldquo;war of the worms&rdquo;, we propose a worm interaction approach that relies upon automated beneficial worm generation aiming to alleviate problems of worm propagations in such networks. We also propose a new set of metrics to quantify the effectiveness of one worm terminating other worm. To understand the dynamic of worm interactions and its performance, we mathematically model worm interactions based on major worm interaction factors including worm interaction types, network characteristics, and node characteristics using ordinary differential equations and analyze their effects on our proposed metrics. Our study provides the first work to characterize and investigate worm interactions of random-scan worms in multi-hop networks. For encounter-based worms, we validate our proposed model using extensive synthetic and trace-driven simulations. We find that, all the above worm interaction factors significantly affect the pattern of worm propagations. For example, immunization linearly decreases the infection of susceptible nodes while on-off behavior only impacts the duration of infection. Using realistic mobile network measurements, we find that encounters are &ldquo;bursty&rdquo;, multi-group and non-uniform. The trends from the trace-driven simulations are consistent with the model, in general. Immunization and timely deployment seem to be the most effective to counter the worm attacks in such scenarios while cooperation may help in a specific case. These findings provide insight that we hope would aid to develop counter-worm protocols in future encounter-based networks.
Multi-agent Planning in Sokoban
Authors: Matthew S. Berger, James H. Lawton
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

The issue of multi-agent planning in highly dynamic environments is a major impediment to conventional planning solutions. Plan repair and replanning solutions alike have difficulty adapting to frequently changing environment states. To adequately handle such situations, this paper instead focuses on preserving individual agent plans through multi-agent coordination techniques. We describe a reactive agent system architecture in which the main focus of an agent is to be able to achieve its subgoals without interfering with any other agent. The system is a 3-level architecture, where each level is guided by the following fundamental principles, respectively: when is it valid to generate a plan for a subgoal, who is most appropriate for completing the subgoal, and how should the plan be carried out.
Click Passwords Under Investigation
Authors: Krzysztof Gołofit
Venue: Proceedings of the 12th European symposium on Research In Computer Security (2007)

The paper explores one of the graphical authentication techniques as the possible solution to the most important problems of traditional passwords. The aim of this work is to bring together the technical (cryptological) and non-technical (psychological) awareness into the research on passwords (click passwords in this case). Security issues of any authentication mechanism (relying on knowledge) should not be considered without analysis of the human factor ¿ since the users' human nature was identified as a source of major weaknesses of conventional authentication. The paper deals with techniques which reduce password space and make passwords guesses feasible. Four types of pictures areas (of graphical interfaces) were investigated in order to bring to light common vulnerabilities ¿ three of them were identified as types, which the graphical keypads should avoid. Statistics exposing strong tendentiousness in click passwords selection were presented as well. Furthermore, the paper presents a discussion on several issues of title authentication with regard to traditional passwords and other graphical techniques.
Dual mixed finite element methods for the elasticity problem with Lagrange multipliers
Authors: L. Boulaajine, S. Nicaise, L. Paquet, Rafilipojaona
Venue: Journal of Computational and Applied Mathematics (2008)

We study a dual mixed formulation of the elasticity system in a polygonal domain of the plane with mixed boundary conditions and its numerical approximation. The (essential) Neumann boundary conditions (or traction boundary condition) are imposed using a discontinuous Lagrange multiplier corresponding to the trace of the displacement field. Moreover, a strain tensor is introduced as a new unknown and its symmetry is relaxed, also by the use of a Lagrange multiplier (the rotation). The singular behaviour of the solution requires us to use refined meshes to restore optimal rates of convergence. Uniform error estimates in the Lame coefficient @l are obtained for large @l. The hybridization of the problem is performed and numerical tests are presented confirming our theoretical results.
Agent-Based Immunological Intrusion Detection System for Mobile Ad-Hoc Networks
Authors: Aleksander Byrski, Marco Carvalho
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Mobile Ad-hoc Networks are known to bring very special challenges to intrusion detection systems, mostly because of their dynamic nature and communication characteristics. In the last few years, several research efforts have proposed the use of immune-inspired systems for intrusion detection in MANETs. In most cases, however, only low-level pattern construction and matching have been considered, often customized to specific routing strategies or protocols. In this paper we present a more general, agent-based approach to the problem. Our approach proposes the use of artificial immune systems for anomaly detection in a way that is independent of specific routing protocols and services. After introducing the problem and the proposed system, we describe our proof-of-concept implementation and our preliminary experimental results over NS-2 simulations.
Formal Specification and Validation of Secure Connection Establishment in a Generic Access Network Scenario
Authors: Paul Fleischer, Lars M. Kristensen
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

The Generic Access Network (GAN) architecture is defined by the 3rd Generation Partnership Project (3GPP), and allows telephone services, such as SMS and voice-calls, to be accessed via generic IP networks. The main usage of this is to allow mobile phones to use WiFi in addition to the usual GSM network. The GAN specification relies on the Internet Protocol Security layer (IPSec) and the Internet Key Exchange protocol (IKEv2) to provide encryption across IP networks, and thus avoid compromising the security of the telephone networks. The detailed usage of these two Internet protocols (IPSec and IKEv2) is only roughly sketched in the GAN specification. As part of the process to develop solutions to support the GAN architecture, TietoEnator Denmark has developed a detailed GAN scenario which describes how IPsec and IKEv2 are to be used during the connection establishment procedure. This paper presents a CPN model developed to formally specify and validate the detailed GAN scenario considered by TietoEnator.
Memory Efficient Algorithm for Mining Recent Frequent Items in a Stream
Authors: Piotr Kołaczkowski
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In the paper we present an improved version of multistage hashing based algorithm, used to find frequent items in a stream. Our algorithm uses low-pass filters instead of simple counters, so it concentrates more on recent items and ignores the old ones. Such behaviour is similar to sliding window based algorithms, but requires less memory and is suitable for real-time applications. The algorithm continuously gives estimates of frequencies of the most frequent items. It was tested with streams having various frequency distributions and proved to work correctly. 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
Ontology-Driven Affective Chinese Text Analysis and Evaluation Method
Authors: Linhong Xu, Hongfei Lin
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

This paper studies text affective analysis from three different levels: words, sentences and discourses. Firstly, affective lexicon ontology is constructed by employing the manual and automatic classification methods referred to the present emotional classification. Then affective analysis of sentences and discourses is completed by emotional information of affective lexicon ontology. For sentential recognition, the lexical emotion information and semantic features are appended into Condition Random Fields, and the emotional chain of a text document is generated. Finally affective structure of a text document is evaluated by two different methods as single sentence evaluation and joint sentence evaluation. In analyzing the discourses, affective tone is acquired through Emotional Largest Chain method and Support Vector Machine method.
The Relation between Gaze Behavior and the Attribution of Emotion: An Empirical Study
Authors: Brent Lance, Stacy C. Marsella
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Real-time virtual humans are less believable than hand-animated characters, particularly in the way they perform gaze. In this paper, we provide the results of an empirical study that explores an observer's attribution of emotional state to gaze. We have taken a set of low-level gaze behaviors culled from the nonverbal behavior literature; combined these behaviors based on a dimensional model of emotion; and then generated animations of these behaviors using our gaze model based on the Gaze Warping Transformation (GWT) [9], [10]. Then, subjects judged the animations displaying these behaviors. The results, while preliminary, demonstrate that the emotional state attributed to gaze behaviors can be predicted using a dimensional model of emotion; and show the utility of the GWT gaze model in performing bottom-up behavior studies.
Word Sense Disambiguation with Semantic Networks
Authors: George Tsatsaronis, Iraklis Varlamis, Michalis Vazirgiannis
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

Word sense disambiguation (WSD) methods evolve towards exploring all of the available semantic information that word thesauri provide. In this scope, the use of semantic graphs and new measures of semantic relatedness may offer better WSD solutions. In this paper we propose a new measure of semantic relatedness between any pair of terms for the English language, using WordNet as our knowledge base. Furthermore, we introduce a new WSD method based on the proposed measure. Experimental evaluation of the proposed method in benchmark data shows that our method matches or surpasses state of the art results. Moreover, we evaluate the proposed measure of semantic relatedness in pairs of terms ranked by human subjects. Results reveal that our measure of semantic relatedness produces a ranking that is more similar to the human generated one, compared to rankings generated by other related measures of semantic relatedness proposed in the past.
The Motorola DSP56000 Digital Signal Processor
Authors: Kevin Kloker
Venue: IEEE Micro (1986)

The DSP56000 brings 10.25-MIPS performance to digital signal processing and retains enough similarities to other Motorola microprocessors to make it easy to learn and program.
User-Centric Content Negotiation for Effective Adaptation Service in Mobile Computing
Authors: Wai Yip Lum Francis C. M. Lau
Venue: IEEE Transactions on Software Engineering (2003)

We address the challenges of building a good content adaptation service for mobile devices and propose a decision engine that is user-centric with QoS awareness, which can automatically negotiate for the appropriate adaptation decision to use in the synthesis of an optimal adapted version. The QoS-sensitive approach complements the lossy nature of the transcoding operations. The decision engine will look for the best trade off among various parameters in order to reduce the loss of quality in various domains. Quantitative methods are suggested to measure the QoS of the content versions in various quality domains. Based on the particular user perception and other contextual information on the client capability, the network connection, and the requested content, the proposed negotiation algorithm will determine a content version with a good aggregate score. We have built a prototype document adaptation system for PDF documents to demonstrate the viability of our approach.
Transformation Patterns for Multi-staged Model Driven Software Development
Authors: Alexandre Bragança, Ricardo J. Machado
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Model driven approaches are shifting software development from a code based activity to a model based activity. Models can be refined and transformed from requirements into code specific to a platform. Although several model transformations can occur, they usually take place at a single development stage. In the case of software product lines, and particularly of software factories, the modeling of a system can occur at several stages, for instance, at the software house, at the systems integrator and at the final customer site. Basically, this requires that the model used at a particular stage can be refined at the next stage. In this paper, we explore the issues related to such an approach and we propose model transformation patterns that can be generically applied to models so that they can be used in multi staged modeling approaches. We show how to realize the approach with the Eclipse Modeling Framework and present an insurance case study.
Test the Overall Significance of p-values by Using Joint Tail Probability of Ordered p-values as Test Statistic
Authors: Yongxiang Fang, Ernst Wit
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Fisher's combined probability test is the most commonly used method to test the overall significance of a set independent p-values. However, it is very obviously that Fisher's statistic is more sensitive to smaller p-values than to larger p-value and a small p-value may overrule the other p-values and decide the test result. This is, in some cases, viewed as a flaw. In order to overcome this flaw and improve the power of the test, the joint tail probability of a set p-values is proposed as a new statistic to combine and make an overall test of the p-values. Through the development of a method and a practical application, this study reveals that the new method has plausible properties and more power.
Optical Design with Epsilon-Dominated Multi-objective Evolutionary Algorithm
Authors: Shaine Joseph, Hyung W. Kang, Uday K. Chakraborty
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Significant improvement over a patented lens design is achieved using multi-objective evolutionary optimization. A comparison of the results obtained from NSGA2 and ¿-MOEA is done. In our current study, ¿-MOEA converged to essentially the same Pareto-optimal solutions as the one with NSGA2, but ¿-MOEA proved to be better in providing reasonably good solutions, comparable to the patented design, with lower number of lens evaluations. ¿-MOEA is shown to be computationally more efficient and practical than NSGA2 to obtain the required initial insight into the objective function trade-offs while optimizing large and complex optical systems.
Identifying Regional Cardiac Abnormalities from Myocardial Strains Using Spatio-temporal Tensor Analysis
Authors: Zhen Qian, Qingshan Liu, Dimitris N. Metaxas, Leon Axel
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Myocardial deformation is a critical indicator of many cardiac diseases and dysfunctions. The goal of this paper is to use myocardial deformation patterns to identify and localize regional abnormal cardiac function in human subjects. We have developed a novel tensor-based classification framework that better conserves the spatio-temporal structure of the myocardial deformation pattern than conventional vector-based algorithms. In addition, the tensor-based projection function keeps more of the information of the original feature space, so that abnormal tensors in the subspace can be back-projected to reveal the regional cardiac abnormality in a more physically meaningful way. We have tested our novel method on 41 human image sequences, and achieved a classification rate of 87.80%. The recovered regional abnormalities from our algorithm agree well with the patient's pathology and doctor's diagnosis and provide a promising avenue for regional cardiac function analysis.
Modelling Scenes Using the Activity within Them
Authors: Hannah M. Dee, Roberto Fraile, David C. Hogg, Anthony G. Cohn
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

This paper describes a method for building visual "maps" from video data using quantized descriptions of motion. This enables unsupervised classification of scene regions based upon the motion patterns observed within them. Our aim is to recognise generic places using a qualitative representation of the spatial layout of regions with common motion patterns. Such places are characterised by the distribution of these motion patterns as opposed to static appearance patterns, and could include locations such as train platforms, bus stops, and park benches. Motion descriptions are obtained by tracking image features over a temporal window, and are then subjected to normalisation and thresholding to provide a quantized representation of that feature's gross motion. Input video is quantized spatially into N ×N pixel blocks, and a histogram of the frequency of occurrence of each vector is then built for each of these small areas of scene. Within these we can therefore characterise the dominant patterns of motion, and then group our spatial regions based upon both proximity and local motion similarity to define areas or regions with particular motion characteristics. Moving up a level we then consider the relationship between the motion in adjacent spatial areas, and can characterise the dominant patterns of motion expected in a particular part of the scene over time. The current paper differs from previous work which has largely been based on the paths of moving agents, and therefore restricted to scenes in which such paths are identifiable. We demonstrate our method in three very different scenes: an indoor room scenario with multiple chairs and unpredictable unconstrained motion, an underground station featuring regions where motion is constrained (train tracks) and regions with complicated motion and difficult occlusion relationships (platform), and an outdoor scene with challenging camera motion and partially overlapping video streams.