ppxscal/embedding_network huggingface dataset:
Modus ponens and modus tollens in discrete implications
Authors: M. Mas, M. Monserrat, J. Torrens
Venue: International Journal of Approximate Reasoning (2008)

This paper is devoted to the study of discrete implications that satisfy modus ponens (MP), modus tollens (MT) or both (MPT). The main goal is to characterize all R, S, QL and D-implications on a finite chain L, derived from smooth t-norms, satisfying these properties for a given smooth t-norm T"1. The case when T"1 is non-smooth is also discussed for a special family of t-norms.
Analysis of Relationships between Smiley and Atmosphere during Chat with Emotional Characters
Authors: Junko Itou, Jun Munemori
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

In this research, we analyze the relationships among smiley, user's mental states represented by smiley, nonverbal expressions of emotional characters, and atmospheres during embodied character chat system. The character behave as agents of users and automatically act on messages of the users and the other character's action. We performed an experiment to investigate the relationships using embodied character.
LePUS3: An Object-Oriented Design Description Language
Authors: Epameinondas Gasparis, Jonathan Nicholson, Amnon H. Eden
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

LePUS3 [1] (lepus.org.uk) is a logic, visual, object-oriented Design Description Language: a formal specification language designed to capture and convey the building-blocks of object-oriented design. LePUS3 minimal vocabulary constitutes of abstraction mechanisms that can specify effectively and precisely design patterns and the design of JavaTM (C++, Smalltalk, etc.) programs at any level of abstraction.
Bisimplicial vertices in even-hole-free graphs
Authors: Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce Reed, Paul Seymour
Venue: Journal of Combinatorial Theory Series B (2008)

A hole in a graph is an induced subgraph which is a cycle of length at least four. A hole is called even if it has an even number of vertices. An even-hole-free graph is a graph with no even holes. A vertex of a graph is bisimplicial if the set of its neighbours is the union of two cliques. In this paper we prove that every even-hole-free graph has a bisimplicial vertex, which was originally conjectured by Reed.
A New Algorithm for Community Identification in Linked Data
Authors: Nacim Fateh Chikhi, Bernard Rothenburger, Nathalie Aussenac-Gilles
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In this paper, we propose four specifications which can be used for the evaluation of community identification algorithms. Furthermore, a novel algorithm VHITS meeting the four established specifications is presented. Basically, VHITS is based on a two-step approach. In the first step, the Nonnegative Matrix Factorization is used to estimate the community memberships. In the second step, a voting scheme is employed to identify the hubs and authorities of each community. VHITS is then compared to the HITS and PHITS algorithms. Experimental results show that VHITS is more adapted than HITS and PHITS to the task of community identification in citation networks.
Aer()sculpture, art made out of threatened sky
Authors: Ioannis Michalou(di)s
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Between mountains and clouds meeting each other, nearby a lake changing colors every day, this is the place visual artist Ioannis MICHALOU(di)S has chosen to have his atelier/lab. This first cloud-hunter follows Centaurs' and Nymphs' footprints, lies in wait of air streams, grapping pieces of sky... shaping them, molding them, creating "images of forms" and baptizing them as aer( )sculptures. 99, 9% air and 0, 1% glass is the composition of every aer()sculpture. In Space Technology, this same composition is named silica aerogel. This immaterial material is the lightest solid on planet Earth -- with three Guinness Prizes - and is used also by NASA as an excellent heat insulator for spacecrafts and for stardust collection, http://www.jpl.nasa.gov/stardust/photo/aerogel.html. MICHALOU(di)S is the first visual artist worldwide bringing this ethereal material in Art, choosing to hunt with it skies and dreams. Despite the fact that the space technology required for the creation of the aer()sculptures costs inevitably a lot in time and money, the results are always amazing: weightless sculptures having the ability to hover or float opening, this way, new paths towards a Space Art era where the light and immaterial opens a dialog or replace the heavy and voluminous. Each aer()sculpture is - at the same time - a "ready made" but also a masterpiece. And that because the inner world of every aer()sculpture is different thanks to the microcosmos seen throughout the sculpture: airy clouds, fragments of gold, orbits of planets creating "spaces in between". Light and shadow is one more dialogue opened when a light beam transpierces each blue aer()sculpture projecting their transparent goldhue shadow in orbit. If humans are (organic) carbon based representations then every aer()sculpture is an (inorganic) silica based representation. We know that silica -the natural glass, other than the chemical silicone- is a basic component for the industrial fabrication of data storage devices for computers, cf. Silicon Valley, CA. If we accept now the hypothesis that one day silica will be the Bank of all human memory then we can surely say that every aer()sculpture travels also as a Memory Ark. Past, Present and Future are melted together into an unknown infinity where Space and Time become Logos. Into an endless beginning...
A Semantic Foundation for Trust Management Languages with Weights: An Application to the RT Family
Authors: Stefano Bistarelli, Fabio Martinelli, Francesco Santini
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

In this paper, we present a variant of Datalog language (we call it Datalog W ) able to deal with weights on ground facts and to consequently compute a feedback result for the goal satisfaction. The weights are chosen from a proper c-semiring. In our context, our goal is to use this language as a semantic foundation for languages for expressing trust relationships. As a matter of fact, many of them have a semantics given in terms of crisp constraints: our approach is to extend them to cover also the soft case. Thus, we apply Datalog W as the basis to give a uniform semantics to declarative RT W (Trust Management) language family. The approach is rather generic and could be applied to other trust management languages based on Datalog, as a semantic sublayer to represent trust management languages where the trust level is relevant.
Catadioptric Camera Calibration by Polarization Imaging
Authors: O. Morel, R. Seulin, D. Fofi
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

A new efficient method of calibration for catadioptric sensors is presented in this paper. It is based on an accurate measurement of the three-dimensional parameters of the mirror by means of polarization imaging. While inserting a rotating polarizer between the camera and the mirror, the system is automatically calibrated without any calibration patterns. Moreover it permits to relax most of the constraints related to the calibration of the catadioptric systems. From the measurement of three-dimensional parameters, we apply the generic calibration concept to calibrate the catadioptric sensor. The influence of the disturbed measurement of the parameters on the reconstruction of a synthetic scene is presented. Finally, experiments prove the validity of the method with some preliminary results on three-dimensional reconstruction.
Nonuniform bribery
Authors: Piotr Faliszewski
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we request. Our model is an extension of the one of Faliszewski et al. [9], where each voter has a single price for any change we may ask for. We show polynomial-time algorithms for our version of bribery for a broad range of voting protocols, including plurality, veto, approval, and utility-based voting. In addition we prove NP-completeness for a couple of our nonuniform bribery problems for weighted voters, and give approximation algorithms for two NP-complete bribery problems defined in [9].
Three User Profile Similarity Calculation (UPSC) Methods and Their Evaluation
Authors: Hassan Naderi, Béatrice Rumpler
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Collaborative Information Retrieval (CIR) is a new technique for resolving the current problem of information retrieval systems. A CIR system registers the previous user interactions to response to the subsequent user queries more efficiently. However well-known problem of personalization in retrieval systems is more acute in CIR systems. The goals and the characteristics of two users may be different; so when they send the same query to a CIR system, they may be interested in two different lists of documents. To solve this problem, we have developed a personalized CIR system, called PERCIRS, based onthe user profiles' similarity to satisfy their queries.Thus selecting an efficient method to calculate the similarity between user profiles is a key factor for enhancing PERCIRS’s efficiency. In this paper, we propose three methods for user profile similarity calculation. Finally, we introduce a mechanism for evaluating these methods.
Moving in the Time: An Ontology for Identifying Legal Resources
Authors: João Alberto Oliveira Lima, Monica Palmirani, Fabio Vitali
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

The paper presents an application of the FRBROO document model for defining an information ontology of legal resources that takes into account the dimension of time. FRBR-based paradigms are used within several existing projects in computer support of activities in the legal domain, but they are mostly oriented to bibliographic organization of documents without a real modeling of the peculiar characteristics of the legal domain. Also, all of them refer to the current version of the FRBR model, called FRBRER. Yet, in these years the FRBR model is undergoing a major revision and a new version using an object-oriented approach is being developed. Thus we first have updated the model of legal resources to rely on the new object-oriented model, called FRBROO. More importantly, consistency problems were corrected and the time dimension was introduced, which came very useful when considering the legal domain and dealing with legal resources. Therefore, while it is not in the scope of this paper to define an abstract model of the norms (e.g. obligations, permissions, etc.) or the representation of the norms (e.g. rules model), we rather focus our attention on the abstract description of the normative acts lifecycle and how it is possible to fill the gap between the rule modeling and the structure of the legal resources.
A mobile agent approach to opportunistic harvesting in wireless sensor networks
Authors: R. Tynan, C. Muldoon, M. J. O'Grady, G. M. P. O'Hare
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

This demonstration illustrates the feasibility of harvesting data from a WSN by interested parties, either in the WSN coverage area or in a remote location. Embedded and mobile agents are harnessed for the data capture process. Individual nodes communicate with gateways to which, user devices connect. Users can query and view the local data in an ad-hoc manner, and possibly remotely configure and manipulate the data capture process. It is envisaged that the combination of embedded and mobile agents offer a dynamic method of sensor data viewing and processing, either in situ, or in a central repository.
On establishing a benchmark for evaluating static analysis alert prioritization and classification techniques
Authors: Sarah Heckman, Laurie Williams
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Benchmarks provide an experimental basis for evaluating software engineering processes or techniques in an objective and repeatable manner. We present the FAULTBENCH v0.1 benchmark, as a contribution to current benchmark materials, for evaluation and comparison of techniques that prioritize and classify alerts generated by static analysis tools. Static analysis tools may generate an overwhelming number of alerts, the majority of which are likely to be false positives (FP). Two FP mitigation techniques, alert prioritization and classification, provide an ordering or classification of alerts, identifying those likely to be anomalies. We evaluate FAULTBENCH using three versions of a FP mitigation technique within the AWARE adaptive prioritization model. Individual FAULTBENCH subjects vary in their optimal FP mitigation techniques. Together, FAULTBENCH subjects provide a precise and general evaluation of FP mitigation techniques.
Spike train probability models for stimulus-driven leaky integrate-and-fire neurons
Authors: Shinsuke Koyama, Robert E. Kass
Venue: Neural Computation (2008)

Mathematical models of neurons are widely used to improve understanding of neuronal spiking behavior. These models can produce artificial spike trains that resemble actual spike train data in important ways, but they are not very easy to apply to the analysis of spike train data. Instead, statistical methods based on point process models of spike trains provide a wide range of data-analytical techniques. Two simplified point process models have been introduced in the literature: the time-rescaled renewal process (TRRP) and the multiplicative inhomogeneous Markov interval (m-IMI) model. In this letter we investigate the extent to which the TRRP and m-IMI models are able to fit spike trains produced by stimulus-driven leaky integrate-and-fire (LIF) neurons. With a constant stimulus, the LIF spike train is a renewal process, and the m-IMI and TRRP models will describe accurately the LIF spike train variability. With a time-varying stimulus, the probability of spiking under all three of these models depends on both the experimental clock time relative to the stimulus and the time since the previous spike, but it does so differently for the LIF, m-IMI, and TRRP models. We assessed the distance between the LIF model and each of the two empirical models in the presence of a time-varying stimulus. We found that while lack of fit of a Poisson model to LIF spike train data can be evident even in small samples, the m-IMI and TRRP models tend to fit well, and much larger samples are required before there is statistical evidence of lack of fit of the m-IMI or TRRP models. We also found that when the mean of the stimulus varies across time, the m-IMI model provides a better fit to the LIF data than the TRRP, and when the variance of the stimulus varies across time, the TRRP provides the better fit.
Image Retrieval Using Modified Color Variation Co-occurrence Matrix
Authors: Yung-Fu Chen, Yung-Kuan Chan, Guo-Uei Chang, Meng-Chi Tsao, Yu-Jhuang Syu, Chuen-Horng Lin
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Texture is widely used as an important feature for content based image retrieval (CBIR). In this paper, color variation co-occurrence matrix (CVCM) modified from a previous investigation has been proposed for describing texture characteristics of an image. An image is processed and converted into four CVCMs based on overlapping 3 x 3 windows scanning from top to bottom and left to right. Each 3 x 3 window is divided into 4 grids with the central pixel located at four different corners. First, the original image with a size of N x x N y is converted into 4 motif matrices from individual scanning windows according to the traversal between the differences of four adjacent pixels. By contrasting to a previous method that 6 motif patterns were discriminated, an additional pattern was used to resolve ambiguity amounting to 7 motif patterns in total. By computing the probability of adjacent pattern pairs, an image retrieval system has been developed. The performance of the CVCM system was evaluated in the experiments using four different image sets. The experimental results reveal that the proposed CVCM-based image retrieval system outperforms the methods proposed by Huang and Dai and Jhanwar et al.
Overview of the CLEF-2007 Cross-Language Speech Retrieval Track
Authors: Pavel Pecina, Petra Hoffmannová, Gareth J. Jones, Ying Zhang, Douglas W. Oard
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The CLEF-2007 Cross-Language Speech Retrieval (CL-SR) track included two tasks: to identify topically coherent segments of English interviews in a known-boundary condition, and to identify time stamps marking the beginning of topically relevant passages in Czech interviews in an unknown-boundary condition. Six teams participated in the English evaluation, performing both monolingual and cross-language searches of ASR transcripts, automatically generated metadata, and manually generated metadata. Four teams participated in the Czech evaluation, performing monolingual searches of automatic speech recognition transcripts.
How Do Java Programs Use Inheritance? An Empirical Study of Inheritance in Java Software
Authors: Ewan Tempero, James Noble, Hayden Melton
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Inheritance is a crucial part of object-oriented programming, but its use in practice, and the resulting large-scale inheritance structures in programs, remain poorly understood. Previous studies of inheritance have been relatively small and have generally not considered issues such as Java's distinction between classes and interfaces, nor have they considered the use of external libraries.In this paper we present the first substantial empirical study of the large-scale use of inheritance in a contemporary OO programming language. We present a suite of structured metrics for quantifying inheritance in Java programs. We present the results of performing a corpus analysis using those metrics to over 90 applications consisting of over 100,000 separate classes and interfaces. Our analysis finds higher use of inheritance than anticipated, variation in the use of inheritance between interfaces and classes, and differences between inheritance within application types compared with inheritance from external libraries.
Parallel Lossless Data Compression: A Particle Dynamic Approach
Authors: Dianxun Shuai
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper presents a new generalized particle model (GPM) to generate the prediction coding for lossless data compression. Local rules for particle movement in GPM, parallel algorithm and its implementation structure to generate the desired predictive coding are discussed. The proposed GPM approach has advantages in terms of encoding speed, parallelism, scalability, simplicity, and easy hardware implementation over other sequential lossless compression methods.
A Composite Network Security Assessment
Authors: Suleyman Kondakci
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

This paper presents a new concept of security assessment methodology while promoting several areas of its application. Attack pattern analysis, network security monitoring locally or remotely are the major application areas of this concept. Instead of testing each asset or a network node separately by applying repetitive attacks and assessments, the composite system generates and executes attacks once, composes risk data, and uses the risk data for the entire network in order to perform the overall assessment. This unique approach can be used as a model to guide development of intrusion detection systems, intelligent network security analysis, monitoring systems, and also as a complementary function in information security test and evaluation laboratories. 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
Floresta Sintá(c)tica: Bigger, Thicker and Easier
Authors: Cláudia Freitas, Paulo Rocha, Eckhard Bick
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

In this paper, we describe the resumption of activities of Floresta Sintá(c)tica, a treebank for Portuguese. We present some underlying guidelines around the project and how they influence our linguistic choices. We then describe the new texts added to the treebank, proceed to mention the new syntactic information added to the old texts, and finally describe the new user-friendly search system and the plans for its expansion.
On the Stability and the Parameters of Particle Swarm Optimization
Authors: Keiichiro Yasuda, Nobuhiro Iwasaki, Genki Ueno
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

In this paper, swarm activity is defined as the root mean square velocity of the particles in Particle Swarm Optimization (PSO). A new method for determining the numerical stability of PSO based on swarm activity was developed. Using the results of a numerical stability analysis of PSO, the search of conventional PSO methods is examined. From this analysis, issues related to diversification and intensification during the search can be explored.
The Universal Remote Console: A Universal Access Bus for Pervasive Computing
Authors: Bill LaPlant, Shari Trewin, Gottfried Zimmermann, Gregg Vanderheiden
Venue: IEEE Pervasive Computing (2004)

The Universal Remote Console standards will help enable the graceful integration of pervasive computing environments with human users.
Artificial Environment for Simulation of Emergent Behaviour
Authors: Rafal Sienkiewicz, Wojciech Jedruch
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The paper presents an artificial world model in which various self-organization and self-modification processes could be simulated. The model is a two dimensional space in which there are stacks of hexagonal tiles which are moving, colliding, and making bonds between them. On the higher level of organization a structure of tiles specifies some function whose execution affects other tiles in its neighborhood. The functions encoded in the structures of tiles are expressed in the simple Prolog like language. Few examples illustrate the behavior of the system.