ppxscal/embedding_network huggingface dataset:
Robust Visual Mining of Data with Error Information
Authors: Jianyong Sun, Ata Kabán, Somak Raychaudhury
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Recent results on robust density-based clustering have indicated that the uncertainty associated with the actual measurements can be exploited to locate objects that are atypical for a reason unrelated to measurement errors. In this paper, we develop a constrained robust mixture model, which, in addition, is able to nonlinearly map such data for visual exploration. Our robust visual mining approach aims to combine statistically sound density-based analysis with visual presentation of the density structure, and to provide visual support for the identification and exploration of `genuine' peculiar objects of interest that are not due to the measurement errors. In this model, an exact inference is not possible despite the latent space being discretised, and we resort to employing a structured variational EM. We present results on synthetic data as well as a real application, for visualising peculiar quasars from an astrophysical survey, given photometric measurements with errors.
Model-Checking Large Finite-State Systems and Beyond
Authors: Luboš Brim, Mojmír Křetínský
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

With the increase in the complexity of computer systems, it becomes even more important to develop formal methods for ensuring their quality. Early detection of errors requires application of advanced analysis, verification and validation techniques for modelling resources, temporal properties, datatype invariants, and security properties. Various techniques for automated and semi-automated analysis and verification of computer systems have been proposed.
MAISim: mobile agent malware simulator
Authors: Rafał Leszczyna, Igor Nai Fovino, Marcelo Masera
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

One of the problems related to the simulation of attacks against critical infrastructures is the lack of adequate tools for the simulation of malicious software (malware). Malware attacks are the most frequent in the Internet and they pose a serious threat against critical networked infrastructures. To address this issue we developed Mobile Agent Malware Simulator (MAISim). The framework uses the technology of mobile agents and it aims at simulation of various types of malicious software (viruses, worms, malicious mobile code). Moreover it can be flexibly deployed over computer network of an arbitrary information system.
Improving the Efficiency of Exact Two Dimensional On-Line Pattern Matching Algorithms
Authors: Charalampos S. Kouzinopoulos, Konstantinos G. Margaritis
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exact two dimensional pattern matching algorithms. Both the original algorithms and the variants are compared in terms of running time for different sets of data.
SwarmClass: A Novel Data Clustering Approach by a Hybridization of an Ant Colony with Flying Insects
Authors: Amira Hamdi, Nicolas Monmarché, M. Adel Alimi, Mohamed Slimane
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

Swarm behaviors contribute to the resolution of very large number of difficult tasks thanks to simplified models and elementary rules [1]. This work claims a new swarm based behavior used for unsupervised classification. The proposed behavior starts from the ants collective sorting behavior as initially proposed by Lumer and Faieta [2] and overwrites it with additional behaviors inspired from birds and spiders. Our algorithm is then based on the existing work of [3], [4] and [2]. The proposed approach, called SwarmClass, outperforms previous ant-based clustering methods and resolve all its drawbacks by the introduction of simple swarm techniques and without the need of complex parameters configuration and prior information on classes' partition and distribution. Our proposed algorithm uses ants' segregation behavior to group similar objects together; birds' moving behavior to control next relative positions for a moving ant; and spiders' homing behavior to manage ants' movements when conflicting situations occur.
The Risk Factor in the Adaptation of Worksites in ICT-Related Jobs
Authors: Renzo Andrich, Giacomo Liverani, Lucia Pigini
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

If working tasks are carried out in inadequate conditions, workers with functional limitations may, over time, risk developing further disabilities. While several validated risk assessment methods exist for able-bodied workers, few studies have been carried out for workers with disabilities. This paper, which reports the preliminary findings of a Study funded by the Italian Ministry of Labour, describes a general methodology for the technical and organizational re-design of a worksite, based on risk assessment and irrespective of any worker disability. To this end, two samples of disabled workers, composed of people with mild and severe motor disabilities, were recruited. By using a mix of risk assessment methods and the ICF taxonomy, an adapted worksite was designed for the individual workers in the study, and a prospective evaluation was carried out to check whether the new design would eliminate the risks. One case study is reported in detail - a man with congenital malformations who works as a help-desk operator for technical assistance in the ICT department of a big organization.
Energy-Efficient Medium Access Control for Wireless Sensor Networks
Authors: Po-Jen Chuang, Chih-Shin Lin
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Energy efficiency is a primary issue for the performance of a wireless sensor network. This paper works on both communication and transmission to reduce unnecessary energy waste, i.e., to conserve energy consumption, for a wireless sensor network. To improve idle listening, for example, we allow sensor nodes to activate or sleep periodically; to improve collision and overhearing, we use an algorithm to alternate the wakeup time of neighboring sensor nodes and thus reduce transmission latency.
An NLP-Based 3D Scene Generation System for Children with Autism or Mental Retardation
Authors: Yılmaz Kılıçaslan, Özlem Uçar, Edip Serdar Güner
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

It is well-known that people with autism or mental retardation experience crucial problems in thinking and communicating using linguistic structures. Thus, we foresee the emergence of text-to-image conversion systems to let such people establish a bridge between linguistic expressions and the concepts these expressions refer to via relevant images. S2S is such a system for converting Turkish sentences into representative 3D scenes via the mediation of an HPSG-based NLP module. A precursor to S2S, a non-3D version, has been tested with a group of students with autism and mental retardation in a special education center and has provided promising results motivating the work presented in this paper.
Multi-dimensional Histogram-Based Image Segmentation
Authors: Daniel Weiler, Julian Eggert
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In this paper we present an approach for multi-dimensional histogram-based image segmentation. We combine level-set methods for image segmentation with probabilistic region descriptors based on multi-dimensional histograms. Unlike stated by other authors we show that colour space histograms provide a reasonable and efficient description of image regions. In contrast to Gaussian Mixture Model based algorithms no parameter learning and estimation of the number of mixture components is required. Compared to recent level-set based segmentation methods satisfying segmentation results are achieved without specific features (e.g. texture). In a comparison with state-of-the-art image segmentation methods it is shown that the proposed approach yields competitive results.
The reflexive solutions of the matrix equation AX B = C
Authors: D. S. Cvetkovi-Iliíc
Venue: Computers Mathematics with Applications (2006)

In this paper, we study the existence of a reflexive, with respect to the generalized reflection matrix P, solution of the matrix equation AX B = C. For the special case when B = I, we get the result of Peng and Hu [1].
Vibrational spectral analysis of 2,6 Bis (p-methoxy benzylidene) cyclohexanone using density functional theory
Authors: J. Binoy, A. Amal Raj, R. Reghunathan, I. Hubert Joe, V. S. Jayakumar
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The geometry optimization and the computation of vibrational wavenumbers have been carried out for 2,6 Bis (p-methoxy benzylidene) cyclohexanone using density functional theory at B3LYP/6-31G(d) level. The optimized geometry reveals that the central cyclohexanone ring possesses a nearly 'half chair' conformation. The steric interaction causes the twisting of phenyl rings and the twisting of both Ph1 and Ph2 are energetically favored by 6.66 kJ mol$^{-1}$ and 6.86 kJ mol$^{-1}$ respectively. The relaxed PES scan studies have been conducted to expose the changes in the geometrical parameters caused by ring twisting. The stretching vibrational modes involving aromatic hydrogen atoms participating in steric interaction have been observed to possess higher vibrational wavenumbers. The unusual lowering of C=O stretching vibrational wavenumber has been noticed, attributable to the mesomeric interaction of the group -CH=C-(C=O)-C=CH-. The methylene groups involving steric interaction have been found to possess different spectral behavior compared to free CH$_{2}$ groups. The computed geometry and vibrational spectrum of cyclohexanone at B3LYP/6-31G(d) level have been used to analyze, the spectral distinction between chaired cyclohexanone and half chaired central cyclohexanone ring in BMBC and also the bond angle effect and conjugation effects on carbonyl stretching modes.
Semantic Access Control in Web Based Communities
Authors: Najeeb Elahi, Mohammad M. R. Chowdhury, Josef Noll
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Web based social communities are one of the most widely used applications nowadays. Ubiquitous computing and access capabilities leverage the evolution of highly dynamic social communities. Recently, security and privacy concerns within these communities have increased significantly. This paper addresses these challenges by controlling access to community resources exploiting Semantic Web technologies. In this regard, a conceptual community framework and its access control mechanisms are formalised using the Web Ontology Language. Access to the resources is controlled by defining differential access rights based on the relationships between the individuals and the communities. Instead of an explicit definition, some additional facts of the mechanisms are inferred by executing Semantic Web rules using the Jess rule engine over the designed ontology. These information are then passed back into the ontology to enrich the existing ontology.
Maximal Termination
Authors: Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

We present a new approach for termination proofs that uses polynomial interpretations (with possibly negative coefficients) together with the "maximum" function. To obtain a powerful automatic method, we solve two main challenges: (1) We show how to adapt the latest developments in the dependency pair framework to our setting. (2) We show how to automate the search for such interpretations by integrating " max " into recent SAT-based methods for polynomial interpretations. Experimental results support our approach.
Automatic, evolutionary test data generation for dynamic software testing
Authors: Anastasis A. Sofokleous, Andreas S. Andreou
Venue: Journal of Systems and Software (2008)

This paper proposes a dynamic test data generation framework based on genetic algorithms. The framework houses a Program Analyser and a Test Case Generator, which intercommunicate to automatically generate test cases. The Program Analyser extracts statements and variables, isolates code paths and creates control flow graphs. The Test Case Generator utilises two optimisation algorithms, the Batch-Optimistic (BO) and the Close-Up (CU), and produces a near to optimum set of test cases with respect to the edge/condition coverage criterion. The efficacy of the proposed approach is assessed on a number of programs and the empirical results indicate that its performance is significantly better compared to existing dynamic test data generation methods.
A Study on the Role of Force Feedback for Teleoperation of Industrial Overhead Crane
Authors: Ildar Farkhatdinov, Jee-Hwan Ryu
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In this paper, a study on the role of force feedback for teleoperation of industrial overhead crane is presented. Teleoperation of industrial crane was described and analyzed. We proposed several types of force feedback signals which can reduce sway motion in industrial crane. First, force feedback signal was selected and designed based on dynamic model of the system. Then, we simplified force feedback calculation method, and proposed velocity and sway angle based force feedback signals. Series of simulations and experiments for studying the role of force feedback for crane teleoperation were performed. User study showed importance of force feedback in crane teleoperation for reducing load sway. Experimental results for load anti-sway control without and with force feedback were compared and analyzed. Force feedback in teleoperation of overhead crane helped human-operator to reduce load sway two times faster than in conventional system without force feedback. Research illuminated a large role of force feedback compare to vision in industrial crane teleoperation.
Distributed and Heuristic Policy-Based Resource Management System for Large-Scale Grids
Authors: Edgar Magaña, Joan Serrat
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

This paper presents a distributed and heuristic policy-based system for resource management in large-scale Grids. This approach involves three phases: resource discovery, scheduling and allocation. The resource discovery phase is supported by the SNMP-based Balanced Load Monitoring Agents for Resource Scheduling (SBLOMARS). In this approach, network and computational resources are monitored by autonomous monitoring agents, offering a pure decentralized monitoring system. The resource scheduling phase is supported by the Balanced Load Multi-Constrained Resource Scheduler (BLOMERS). It is a heuristic resource scheduler, which includes an implementation of a Genetic Algorithm (GA), as an alternative to solve the inherent NP-hard problem for resource scheduling in large-scale Grids. Allocation phase is supported by means of a Policy-based Grid Management Architecture (PbGMA). This architecture integrates different sources of service necessities such as requirements demanded by customers, applications requirements and network conditions. It interfaces with Globus middleware to allocate services into the selected resources with certain levels of QoS.
An Immune System Based Multi-robot Mobile Agent Network
Authors: W. Wilfred Godfrey, Shivashankar B. Nair
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

A biological immune system comprises components that circulate within the body and defend it from attacks by pathogens. Its artificial counterpart has found applications in a wide spectrum of domains including Robotics. The cells in an immune system can be viewed to be analogous to mobile agents that migrate from one node (organ) to another. Mobility of such agents provides the framework for movement of components within a system. In this paper we describe the modeling of a mobile agent based robotic system that works on the principles of an artificial immune system. The mobile agents form the B-cell equivalents, generating rule-sets (antibodies) that help the robot to overcome a problem (antigen).
Adaptive user preference modeling and its application to in-flight entertainment
Authors: Hao Liu, Ben Salem, Matthias Rauterberg
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This paper first presents an adaptive user preference model for personalized service delivery systems. In this model, user preference is modeled by a two-layer tree with dynamic changeable structures. The top layer of the tree is used for modeling user's long term service preference. Each node represents user's long term evolving commitment to certain categories of service. The lower layer of the tree is used for modeling user spontaneous service requirement which depends on context of use. Each node relates one context of use to one or more desired service requirements. The tree is dynamically constructed by the formal relation definitions among nodes. The advantage of this structure is three folds: (1) it can not only model the user's long term but also spontaneous preference items. More over, the relations between all preference items are formally defined; (2) if the number of preference items is many, it is more efficient and easier to find the right preference items; (3) if the user desired service has been removed, the system can utilize the personalized hierarchy service structure of the preference tree to calculate and recommend similar services. After the introduction of the user preference modeling, an algorithm of how to build it is presented. Finally, we customized the user preference for personalized in-flight entertainment recommendation to validate its features.
Information Security Economics - and Beyond
Authors: Ross Anderson
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

The economics of information security has recently become a thriving and fastmoving discipline. As distributed systems are assembled from machines belonging to principals with divergent interests, incentives are becoming as important to dependability as technical design. The new field provides valuable insights not just into security topics such as privacy, bugs, spam, and phishing, but into more general areas such as system dependability (the design of peer-to-peer systems and the optimal balance of effort by programmers and testers), and policy (particularly digital rights management). This research program has been starting to spill over into more general security questions (such as law-enforcement strategy), and into the interface between security and the social sciences. Most recently it has started to interact with psychology, both through the psychologyand- economics tradition and in response to phishing. The promise of this research program is a novel framework for analyzing information security problems - one that is both principled and effective.
Signature Generation and Detection of Malware Families
Authors: V. Sai Sathyanarayan, Pankaj Kohli, Bezawada Bruhadeshwar
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

Malware detection and prevention is critical for the protection of computing systems across the Internet. The problem in detecting malware is that they evolve over a period of time and hence, traditional signature-based malware detectors fail to detect obfuscated and previously unseen malware executables. However, as malware evolves, some semantics of the original malware are preserved as these semantics are necessary for the effectiveness of the malware. Using this observation, we present a novel method for detection of malware using the correlation between the semantics of the malware and its API calls. We construct a base signature for an entire malware class rather than for a single specimen of malware. Such a signature is capable of detecting even unknown and advanced variants that belong to that class. We demonstrate our approach on some well known malware classes and show that any advanced variant of the malware class is detected from the base signature.
A Declarative Debugger for Maude
Authors: Adrian Riesco, Alberto Verdejo, Narciso Martí-Oliet, Rafael Caballero
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in the Maude language, is presented. Starting from an incorrect computation (a reduction, a type inference, or a rewrite), the debugger builds a tree representing this computation and guides the user through it to find a wrong statement. We present the debugger's main features, such as support for functional and system modules, two possible constructions of the debugging tree, two different strategies to traverse it, use of a correct module to reduce the number of questions asked to the user, selection of trusted vs. suspicious statements, and trusting of statements "on the fly".
Randomized Approach for Target Coverage Scheduling in Directional Sensor Network
Authors: Jian Wang, Changyong Niu, Ruimin Shen
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Recently directional sensors have been widely deployed as they are more practicable under constraints of manufacture, size and cost. One common functionality of networks formed by such directional sensors is to monitor a set of discrete targets continuously. Large scale deployment makes sensor recharge impossible. By abundant deployment, it is reasonable and necessary to select subsets of sensors to operate alternatively so as to prolong the network lifetime. Such problem has been proved to be NP-Complete. This paper approximates network lifetime problem by randomized algorithm. Through constructing elementary sessions, which denotes active subset of sensors covering all targets, and linear programming, the approximating solution is derived within extremely less duration comparing to previous works. Simulation results demonstrate the algorithm's performance and sound explanation is also presented.