ppxscal/embedding_network huggingface dataset:
Application-level simulation for network security
Authors: Rainer Bye, Stephan Schmidt, Katja Luther, Sahin Albayrak
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

We introduce and describe a novel network simulation tool called NeSSi (Network Security Simulator). NeSSi incorporates a variety of features relevant to network security distinguishing it from general-purpose network simulators. Its capabilities such as profilebased automated attack generation, traffic analysis and interface support for the plug-in of detection algorithms allow it to be used for security research and evaluation purposes. NeSSi has been utilized for testing intrusion detection algorithms, conducting network security analysis, and developing distributed security frameworks at the application level. NeSSi is built upon the agent component-ware framework JIAC [5], resulting in a distributed and easy-to-extend architecture. In this paper, we provide an overview of the NeSSi architecture and briefly demonstrate its usage in three example security research projects. These projects comprise of evaluation of stand-alone detection unit performance, detection device deployment at central nodes in the network and comparison of different detection algorithms.
About 4-States Solutions to the Firing Squad Synchronization Problem
Authors: Hiroshi Umeo, Jean-Baptiste Yunès, Naoki Kamikawa
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.
Case Attraction in Ancient Greek
Authors: Scott Grimm
Venue: Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers (2007)

Case attraction has stood as a puzzling, and elusive, oddity of older Indo-European languages. This paper focuses on attraction in Ancient Greek, establishing both the regularity of the operation and its underlying motivation. A novel method is proposed for grounding case in terms of a feature-based representation of agentivity properties, loosely based on Dowty's proto-role theory, but reformulated in terms of privative opposition and hierarchically organized via a lattice. This structure is then used to model the case system of Ancient Greek and derive a hierarchical ordering on the case system in terms of agentivity. Modelling the interaction between this hierarchy and the other factors involved in case attraction in the Optimality Theory framework yields a full solution, predicting both its distribution and frequencies therein. 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
Discovering User Profiles from Semantically Indexed Scientific Papers
Authors: Giovanni Semeraro, Pierpaolo Basile, Marco Gemmis, Pasquale Lops
Venue: From Web to Social Web: Discovering and Deploying User and Content Profiles: Workshop on Web Mining, WebMine 2006, Berlin, Germany, September 18, 2006. Revised Selected and Invited Papers (2007)

Typically, personalized information recommendation services automatically infer the user profile, a structured model of the user interests, from documents that were already deemed relevant by the user. We present an approach based on Word Sense Disambiguation (WSD) for the extraction of user profiles from documents. This approach relies on a knowledge-based WSD algorithm, called JIGSAW, for the semantic indexing of documents: JIGSAW exploits the WordNet lexical database to select, among all the possible meanings (senses) of a polysemous word, the correct one. Semantically indexed documents are used to train a naïve Bayes learner that infers "semantic", sense-based user profiles as binary text classifiers (user-likes and user-dislikes).Two empirical evaluations are described in the paper. In the first experimental session, JIGSAW has been evaluated according to the parameters of the Senseval-3 initiative, that provides a forum where the WSD systems are assessed against disambiguated datasets. The goal of the second empirical evaluation has been to measure the accuracy of the user profiles in selecting relevant documents to be recommended. Performance of classical keyword-based profiles has been compared to that of sense-based profiles in the task of recommending scientific papers. The results show that sense-based profiles outperform keyword-based ones.
Self-tuning fuzzy sliding-mode control for time-delay chaotic systems
Authors: Lon-Chen Hung, Yeong-Chin Chen, Shuh-Han Chao, Jsung-Ta Tsai
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

This In this paper, a new self-tuning control scheme is developed for a class of time-delay chaotic systems. It is implemented by using fuzzy sliding-mode control with self-tuning method. The adjustment of the membership functions are restricted within a stable range derived from a stability analysis. The adaptation laws are derived using a Lyapunov stability analysis, so that both system tracking stability and error convergence can be guaranteed in the closed-loop system.
VUMA: A Visual User Modelling Approach for the Personalisation of Adaptive Systems
Authors: Melanie B. Späth, Owen Conlan
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Current approaches to explicit user modelling are generally time consuming and tedious for the user. Oftentimes poor usability and overly long questionnaires deter the end user from reusing such modelling tools, thus only facilitating explicit personalisation once as they enter the system. This paper proposes a visual approach to user modelling resulting in the VUMA (Visual User Modelling Approach) tool that can be used in a playful and dynamic manner repeatedly during a user's engagement with a personalisation system. This work proposes and evaluates a visually empowering, usable, highly configurable and playful user modelling interface that is utilised to elicit user interests and preferences in a chosen knowledge domain.
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Authors: Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosystems. We present an efficient implementation for computing Tate pairing on a mobile phone using Java. We implemented the ¿ T pairing (a recent efficient variation of Duursma-Lee algorithm) over some finite fields of characteristic 3 with extension degree m = { 97, 167, 193, 239 }. Our optimized implementation for m = 97 achieved about 0.5 seconds for computing the ¿ T pairing over FOMA SH901iS, NTT DoCoMo. Then our implementation of the ¿ T pairing is compared in the same platform with other Java program of the standard cryptosystems, i.e., RSA cryptosystem and elliptic curve cryptosystem (ECC). The computation speed of the ¿ T pairing is comparable to that of RSA or ECC on the same mobile device.
Universal Approximation and QoS Violation Application of Extreme Learning Machine
Authors: Lei Chen, Lifeng Zhou, Hung Keng Pung
Venue: Neural Processing Letters (2008)

Neural networks have been successfully applied to many applications due to their approximation capability. However, complicated network structures and algorithms will lead to computational and time-consuming burdens. In order to satisfy demanding real-time requirements, many fast learning algorithms were explored in the past. Recently, a fast algorithm, Extreme Learning Machine (ELM) (Huang et al. 70:489---501, 2006) was proposed. Unlike conventional algorithms whose neurons need to be tuned, the input-to-hidden neurons of ELM are randomly generated. Though a large number of experimental results have shown that input-to-hidden neurons need not be tuned, there lacks a rigorous proof whether ELM possesses the universal approximation capability. In this paper, based on the universal approximation property of an orthonormal method, we firstly illustrate the equivalent relationship between ELM and the orthonormal method, and further prove that neural networks with ELM are also universal approximations. We also successfully apply ELM to the identification of QoS violation in the multimedia transmission.
Performance of OpenMP Benchmarks on Multicore Processors
Authors: Ami Marowka
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

The appearance of Multicore processors brings high performance computing to the desktop and opens the doors of mainstream computing for parallel computing. This paradigm shift leads the integration of parallel programming standards for high-end shard-memory machine architectures into desktop programming environments. In this paper we present a performance study of these new systems. We evaluate the performance of an OpenMP shared-memory programming model that is integrated into Microsoft Visual Studio C++ 2005 and Intel C++ compilers on a multicore processor. We benchmarked using the NAS OpenMP high-level applications benchmarks and the EPCC OpenMP low-level benchmarks. We report the basic timings, scalability, and runtime profiles of each benchmark and analyze the running results.
Embedding Dynamic Behaviour into a Self-configuring Software System
Authors: Paul Ward, Mariusz Pelc, James Hawthorne, Richard Anthony
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

This paper describes a methodology for embedding dynamic behaviour into software components. The implications and system architecture requirements to support this adaptivity are discussed. This work is part of a European Commission funded and industry supported project to produce a reconfigurable middleware for use in automotive systems. Such systems must be trustable against illegal internal behaviour and activity with external origins, additional devices for example. Policy-based computing is used here as an example of embedded logic. A key contribution of this work is the way in which static and dynamic aspects of the system are interfaced, such that the behaviour can be changed very flexibly (even during run-time), without modification, recompilation or redeployment of the embedded application code. An implementation of these concepts is presented, focussing on achieving trust in the use of dynamic behaviour.
The Installation and Maintenance of Colossus
Authors: W. W. Chandler
Venue: IEEE Annals of the History of Computing (1983)

The article describes the procedures adopted for the installation and maintenance of the Colossus machines installed at Bletchley Park during the latter years of World War II.
Artificial agents learning human fairness
Authors: Steven de Jong, Karl Tuyls, Katja Verbeeck
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Recent advances in technology allow multi-agent systems to be deployed in cooperation with or as a service for humans. Typically, those systems are designed assuming individually rational agents, according to the principles of classical game theory. However, research in the field of behavioral economics has shown that humans are not purely self-interested: they strongly care about fairness. Therefore, multi-agent systems that fail to take fairness into account, may not be sufficiently aligned with human expectations and may not reach intended goals. In this paper, we present a computational model for achieving fairness in adaptive multi-agent systems. The model uses a combination of Continuous Action Learning Automata and the Homo Egualis utility function. The novel contribution of our work is that this function is used in an explicit, computational manner. We show that results obtained by agents using this model are compatible with experimental and analytical results on human fairness, obtained in the field of behavioral economics.
OLDES: Designing a Low-Cost, Easy-to-Use e-Care System Together with the Stakeholders
Authors: Christophe Ponsard, Mike Martin, Sarah Walsh, Susan Baines, Sébastien Rousseaux, Giovanni Rinaldi, Fulvio Tamburriello
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

With the growing number of senior citizen, Europe is going to face major challenge to deliver care for them. The OLDES project funded by the Information Society Technology Programme of the European Union is exploring how ICT can help in the cost-effective scaling of the care delivery while also improving the well-being of elderly people. Designing a caring system is intrinsically complex because of the personal dimension and the many stakeholders involved across multiple organisations boundaries with different cultures.This paper describes the approach taken in OLDES to produce a design able to cope with the needs of the various stakeholders. Rather than following a traditional "requirements to design solution", a co-constructive approach was taken where the multiple actors, including patients, carers, social services, services managers were involved. A distributed animation tool was used to support this approach, enabling validation through various graphical representations of the system behavior. The resulting platform still, under development, will be tested in two major European towns: Bologna and Praha.
Lifting Wavelet-Based Two-Dimensional Scalar Field Simulation for Underwater Navigation Application
Authors: Yi Lin, Yuefeng Liu, Lei Yan, Qingxi Tong
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

The lack of reference maps has been the constraint factor in underwater geophysical field of earth (GFE) aided navigation research, because the developed positioning algorithms can not be verified by accurate GFE-distribution patterns enough. After analysis of positioning modes in underwater navigation, two-dimensional scalar field can be concluded as the common mathematical fundamental. Combined with the requirements of references' diversity, this paper proposes lifting wavelet-based distribution-detail simulation algorithm, which combines with improved random-relation skeleton generation method. The efficient-generated two-dimensional scalar fields can help test matching algorithms' validity to references' diversity, and can also determine interpolation methods' applicability based on statistical analysis.
Security Enhancement of a Flexible Payment Scheme and Its Role-Based Access Control
Authors: Chin-Chen Chang, Yi-Fang Cheng, Iuon-Chang Lin
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

Recently, Wang, Cao, and Zhang proposed a practical and anonymous payment scheme. In the scheme, the authors claimed that their scheme can identify those who spend a coin more than once. That means the scheme can verify the payments in an offline batch process and prevent a consumer from double spending. In this paper, we show that Wang, Cao, and Zhang's scheme can not identify consumers those who spend the same coin repeatedly in two or more different shops at the same time. So, all consumers can apply the security flaw to perform double spending successfully. In order to overcome this security flaw, we provide an improved version of the scheme in this paper.
Division of Labour in Self-organised Groups
Authors: Roderich Groß, Shervin Nouyan, Michael Bonani, Francesco Mondada, Marco Dorigo
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

In social insect colonies, many tasks are performed by higher-order entities, such as groups and teams whose task solving capacities transcend those of the individual participants. In this paper, we investigate the emergence of such higher-order entities using a colony of up to 12 physical robots. We report on an experimental study in which the robots engage in a range of different activities, including exploration, path formation, recruitment, self-assembly and group transport. Once the robots start interacting with each other and with their environment, they self-organise into teams in which distinct roles are performed concurrently. The system displays a dynamical hierarchy of teamwork, the cooperating elements of which comprise higher-order entities. The study shows that teamwork requires neither individual recognition nor inter-individual differences, and as such might contribute to the ongoing debate on the role of such characteristics for the division of labour in social insects.
iJoin: Importance-Aware Join Approximation over Data Streams
Authors: Dhananjay Kulkarni, Chinya V. Ravishankar
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

We address approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available memory, precluding exact processing. Moreover, in many real-world applications such as for news-feeds and sensor-data, different tuples may have different importance levels. Current methods pay little attention to load-shedding when tuples bear such importance semantics, and perform poorly due to premature tuple drops and unproductive tuple retention. We propose a novel framework, called iJoin, which overcomes these drawbacks, maximizes result importance, and has the best performance compared to earlier work.
Principles for Knowledge Engineering on the Web
Authors: Guus Schreiber
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

With the advent of the Web and the efforts towards a Semantic Web the nature of knowledge engineering has changed drastically. The new generation of knowledge systems has left the closed world of isolated applications and feeds on the heterogeneous knowledge sources available online. We propose principles for a new style of knowledge engineering on a Web scale. We illustrate these principles with examples from our efforts in developing a Semantic Web application targeted at large-scale cross-collection search in virtual cultural-heritage collections.
An EDF Interrupt Handling Scheme for Real-Time Kernel: Design and Task Simulation
Authors: Peng Liu, Ming Cai, Tingting Fu, Jinxiang Dong
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Traditional model of interrupt managemnent has been used for several decades. But it is often incapacity to incorporate reliability and temporal predictability demanded on real-time systems. Many solutions have been proposed to improve efficiency of interrupt handling such as In-line Interrupt Handling and Predictable Interrupt Management In this paper we propose a model that schedules interrupts in terms of their deadlines. Hard priorities of IRQs are still left to hardware. We only manager interrupts that can enter the kernel space so that hard real-time can be assured. Each interrupt will be scheduled only before its first execution according to their arrival time and deadlines so that the scheme is very simple and easy to be implemented. The scheme tries to make as many as possible ISRs finish their work within the time limit. Finally we do some experiments, which prove there is a big decrease of nested overtime interrupts, by means of task simulation on VxWorks.
Research on CSCL Interaction Intensity Measurement Model Based on E-portfolio
Authors: Hongwei Wang, Jiewu Xia, Xianshan Zhou
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In CSCL, the interaction extent between members is an important factor to the group learning effect. A reasonable measurement of interaction intensity can provide a basis for the managers when guiding the groups with weak interaction and also for learners’ self reflection. Aiming at the shortcoming of the present model, in the paper we analyzed the factors that affect interaction intensity, put forward a measurable intensity measurement model, by using the vector with three dimensions--the interaction initiator, the interaction feedback and the interaction actor, can measure the interaction intensity at a given time, then it can effectively aide managers of the CSCL interaction to manage and induct the learners.
Automation of repetitive web browsing tasks with voice-enabled macros
Authors: Yevgen Borodin
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Non-visual aural web browsing remains inefficient as compared to regular browsing with visual modalities. This paper proposes an approach for automation of repetitive browsing tasks by using personalized macros, which are easy to record and replay with a speech-enabled interface. The prototype system is implemented in the framework of the HearSay non-visual web browser.
Formalization of Network Quality-of-Service Requirements
Authors: Christian Webel, Reinhard Gotzhein
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

The provision of network Quality-of-Service (network QoS) is a major challenge in the development of future communication systems. Before designing and implementing these systems, the network QoS requirements are to be specified. Existing approaches to the specification of network QoS requirements are mainly focused on specific domains or individual system layers. In this paper, we present a holistic, comprehensive formalization of network QoS requirements, across layers. QoS requirements are specified on each layer by defining QoS domain, consisting of QoS performance, reliability, and guarantee, and QoS scalability, with utility and cost functions. Furthermore, we derive preorders on multi-dimensional QoS domains, and present criteria to reduce these domains, leading to a manageable subset of QoS values that is sufficient for system design and implementation. The relationship between layers is formalized by two kinds of QoS mappings. QoS domain mappings associate QoS domains of two abstraction levels. QoS scalability mappings associate utility and cost functions of two abstraction levels. We illustrate our approach by examples from the case study Wireless Video Transmission.