ppxscal/embedding_network huggingface dataset:
Requirements engineering for trust management: model, methodology, and reasoning
Authors: Paolo Giorgini, Fabio Massacci, John Mylopoulos, Nicola Zannone
Venue: International Journal of Information Security (2006)

A number of recent proposals aim to incorporate security engineering into mainstream software engineering. Yet, capturing trust and security requirements at an organizational level, as opposed to an IT system level, and mapping these into security and trust management policies is still an open problem. This paper proposes a set of concepts founded on the notions of ownership, permission, and trust and intended for requirements modeling. It also extends Tropos, an agent-oriented software engineering methodology, to support security requirements engineering. These concepts are formalized and are shown to support the automatic verification of security and trust requirements using Datalog. To make the discussion more concrete, we illustrate the proposal with a Health Care case study.
An Extended OCSP Protocol for Grid CA Cross-certification
Authors: Shaomin Zhang, Huitao Gong, Baoyi Wang
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

In grid environment, there are many administrative domains, each domain has its own CA, and entities in different domains need authentication when accessing each other. The OCSP (Online Certificate Status Protocol) stands out due to its ability to carry near real time certificate status information and meet the need of grid. The paper proposes an extended OCSP protocol that can provide trust status for certificate to benefit the certificate validation between different domains. We describe the extended OCSP protocol, the realization framework and the work mechanism. An extended OCSP responder is built to verify the feasibility of the extended OCSP protocol for grid.
Large-scale Learning with SVM and Convolutional for Generic Object Categorization
Authors: Fu Jie Huang, Yann LeCun
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The detection and recognition of generic object categories with invariance to viewpoint, illumination, and clutter requires the combination of a feature extractor and a classifier. We show that architectures such as convolutional networks are good at learning invariant features, but not always optimal for classification, while Support Vector Machines are good at producing decision surfaces from wellbehaved feature vectors, but cannot learn complicated invariances. We present a hybrid system where a convolutional network is trained to detect and recognize generic objects, and a Gaussian-kernel SVM is trained from the features learned by the convolutional network. Results are given on a large generic object recognition task with six categories (human figures, four-legged animals, airplanes, trucks, cars, and "none of the above"), with multiple instances of each object category under various poses, illuminations, and backgrounds. On the test set, which contains different object instances than the training set, an SVM alone yields a 43.3% error rate, a convolutional net alone yields 7.2% and an SVM on top of features produced by the convolutional net yields 5.9%.
Using Boosting Techniques to Improve Software Reliability Models Based on Genetic Programming
Authors: Eduardo Oliveira, Aurora Pozo, Silvia Regina Vergilio
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Software reliability models are used to estimate the probability of a software fails along the time. They are fundamental to plan test activities and to ensure the quality of the software being developed. Two kind of models are generally used: time or test coverage based models. In our previous work, we successfully explored Genetic Programming (GP) to derive reliability models. However, nowadays Boosting techniques (BT) have been successfully applied with other Machine Learning techniques, including GP. BT merge several hypotheses of the training set to get better results. With the goal of improving the GP software reliability models, this work explores the combination GP and BT. The results show advantages in the use of the proposed approach.
A high-level specification for Semantic Web Service Discovery Services
Authors: Andreas Friesen, Egon Börger
Venue: Workshop proceedings of the sixth international conference on Web engineering (2006)

We define a high-level model to mathematically capture the semantical meaning of Semantic Web Service Discovery Locations (SWS Discovery Services), their distribution and communication mechanisms. This model captures, to our best knowledge, all published semantic web service discovery approaches relying on capability-based semantic matchmaking.
Reflections on Reflection in Agile Software Development
Authors: David Talby, Orit Hazzan, Yael Dubinsky, Arie Keren
Venue: Proceedings of the conference on AGILE 2006 (2006)

This paper analyzes the reflections of an agile team, developing a large-scale project in an industry setting. The team uses an Iteration Summary Meeting practice, which includes four elements: The customer's summary, a formal presentation of the system, review of metrics and a reflection. The technique for the entire meeting and for the reflection element in particular is described, and empirical evidence is given to show that it is assessed as highly effective, achieving its intended goals, and increasing team satisfaction. Further, the proposed practice supports tracking past decisions. This practice is shown to be valuable to stabilizing a new project as well as a continuous improvement forum for a stable project. It also incurs a lower overhead than existing alternative reflection practices.
Reduct Generation and Classification of Gene Expression Data
Authors: Bashirahamad F. Momin, Sushmita Mitra, Rana Datta Gupta
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Identification of gene subsets responsible for discerning between available samples of gene microarray data is an important task in Bioinformatics. Due to the large number of genes in samples, there is an exponentially large search space of solutions. The main challenge is to reduce or remove the redundant genes, without affecting discernibility between objects. Reducts, from rough set theory, correspond to a minimal subset of essential genes. We present an algorithm for generating reducts from gene microarray data. It proceeds by preprocessing gene expression data, discretization of real value attributes into categorical followed by positive region based approach for reduct generation. For comparison, different approaches for reduct generation have also been discussed. Results on benchmark gene expression datasets demonstrate more than 90% reduction of redundant genes.
A Feasible and Practical Coalition Formation Mechanism Leveraging Compromise and Task Relationships
Authors: Samir Aknine, Onn Shehory
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Recent studies have shown that compromise may facilitate coalition formation and increase agent utilities. In this study we leverage on those results. We devise a novel coalition formation mechanism that enhances compromise. Our mechanism can utilize information on task relationships to reduce formation complexity. The suggested mechanism works well with both cardinal and ordinal task values. Via experiments we show that the use of the suggested compromise-based coalition formation mechanism provides significant savings in the computation and communication complexity of coalition formation. Our results also show that when information on task relationships is used, the complexity of coalition formation is further reduced. We demonstrate successful use of the mechanism for collaborative information filtering, where agents combine linguistic rules to analyze documents' contents.
Orthogonal polynomials for exponential weights x2ρe-2Q(x) on [0,d), II
Authors: Eli Levin, Doron Lubinsky
Venue: Journal of Approximation Theory (2006)

Let I = [0, d), where d is finite or infinite. Let Wp (x) = xp exp (-Q (x)), where p > - ½ and Q is continuous and increasing on I, with limit ∞ at d. We obtain further bounds on the orthonormal polynomials associated with the weight Wp2, finer spacing on their zeros, and estimates of their associated fundamental polynomials of Lagrange interpolation. In addition, we obtain weighted Markov and Bernstein inequalities.
Development of a virtual heritage model to enable a comparison of active navigation with passive observation
Authors: Richard Laing, Stephen Scott, Anna Conniff, Tony Craig, Carlos Galan Diaz
Venue: Proceedings of the conference on Information Visualization (2006)

In the context of urban redesign and public participation, this research project is investigating whether active exploration of a desktop virtual model of an urban environment leads to better understanding and perception than passive observation of a walkthrough of that same model. The results from the experimental study will potentially have implications for how architects and planners present their design ideas to clients and the public in the future. This paper also provides an overview of a methodology used to design, programme and enable a fully interactive virtual model of an existing built environment using the Unreal Runtime engine. The method emerged from a study of heritage values within the built environment, which included an assessment of the heritage values associated with the tradition of timber grass-roofed buildings and narrow passageways that make up the old town centre of Torshavn known as Tinganes.
Power and negotiation: lessons from agent-based participatory simulations
Authors: Paul Guyot, Alexis Drogoul, Shinichi Honiden
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Participatory simulations are conducted to improve our knowledge of human behaviors, to help in solving conflicts, to shape interaction protocols between humans and to teach some aspects of collective management.Agent-based participatory simulations differ from other kinds of participatory simulations including role playing games and experimental economics simulations. The control architecture of the agents, in these simulations, is more or less integrally replaced by a human player and the interactions between players are limited by the communication protocols designed for the agents, usually the exchange of electronic messages logged for further analysis. Such systems can be considered as ideal multi-agent systems featuring cognitive and intelligent agents. Previous work demonstrated that running this kind of simulations helps to design and improve multi-agent simulations.In this paper, we present a series of agent-based participatory experiments studying negotiation in an abstract case of common resource pool management. The roles were designed in such a way that conflicts should emerge during the negotiations. Observing the behavior of human players, we noticed the apparition of power relations between players. We observed that this power in negotiations was unrelated to any a priori dependence between agents or between roles but was instead drawn from strategies and, more surprisingly, this power was built on an emerging ontology.
Characterizing CTL-like logics on finite trees
Authors: Zoltán Ésik
Venue: Theoretical Computer Science (2006)

We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic.
A normative framework for agent-based systems
Authors: Fabiola López Y López, Michael Luck, Mark D'Inverno
Venue: Computational Mathematical Organization Theory (2006)

One of the key issues in the computational representation of open societies relates to the introduction of norms that help to cope with the heterogeneity, the autonomy and the diversity of interests among their members. Research regarding this issue presents two omissions. One is the lack of a canonical model of norms that facilitates their implementation, and that allows us to describe the processes of reasoning about norms. The other refers to considering, in the model of normative multi-agent systems, the perspective of individual agents and what they might need to effectively reason about the society in which they participate. Both are the concerns of this paper, and the main objective is to present a formal normative framework for agent-based systems that facilitates their implementation.
What's Wrong with Hit Ratio?
Authors: Arie Ben-David
Venue: IEEE Intelligent Systems (2006)

Hit ratio is currently the most common metric for measuring the accuracy of classifiers. However, it doesn't compensate for classifications that might have been due to chance. The problem's magnitude is studied here through an empirical experiment on three multivalued UCI (University of California, Irvine) classification data sets, using two well-known machine learning models: C4.5 and naive Bayes. The author shows that using hit ratio can lead to erroneous conclusions. He proposes using Cohen's kappa, as a statistically robust alternative that takes random hits into account.Like any other metric, Cohen's kappa has its own shortcomings, but the author proposes that unless a better simple alternative is found, it should be mandatory in any scientific report about classifier accuracy.
M2: Multicasting Mixes for Efficient and Anonymous Communication
Authors: Ginger Perng, Michael K. Reiter, Chenxi Wang
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

We present a technique to achieve anonymous multicasting in mix networks to deliver content from producers to consumers. Employing multicast allows content producers to send (and mixes to forward) information to multiple consumers without repeating work for each individual consumer. In our approach, consumers register interest for content by creating paths in the mix network to the content's producers. When possible, these paths are merged in the network so that paths destined for the same producer share a common path suffix to the producer. When a producer sends content, the content travels this common suffix toward its consumers (in the reverse direction) and "branches" into multiple messages when necessary. We detail the design of this technique and then analyze the unlinkability of our approach against a global, passive adversary who controls both the producer and some mixes. We show that there is a subtle degradation of unlinkability that arises from multicast. We discuss techniques to tune our design to mitigate this degradation while retaining the benefits of multicast.
Testing the Efficiency and Independence of Attentional Networks
Authors: Jin Fan, Bruce D. McCandliss, Tobias Sommer, Amir Raz, Michael I. Posner
Venue: Journal of Cognitive Neuroscience (2002)

In recent years, three attentional networks have been defined in anatomical and functional terms. These functions involve alerting, orienting, and executive attention. Reaction time measures can be used to quantify the processing efficiency within each of these three networks. The Attention Network Test (ANT) is designed to evaluate alerting, orienting, and executive attention within a single 30-min testing session that can be easily performed by children, patients, and monkeys. A study with 40 normal adult subjects indicates that the ANT produces reliable single subject estimates of alerting, orienting, and executive function, and further suggests that the efficiencies of these three networks are uncorrelated. There are, however, some interactions in which alerting and orienting can modulate the degree of interference from flankers. This procedure may prove to be convenient and useful in evaluating attentional abnormalities associated with cases of brain injury, stroke, schizophrenia, and attention-deficit disorder. The ANT may also serve as an activation task for neuroimaging studies and as a phenotype for the study of the influence of genes on attentional networks.
An Onset Advantage without a Preview Benefit: Neuropsychological Evidence Separating Onset and Preview Effects in Search
Authors: Glyn W. Humphreys, Christian N. L. Olivers, Eun Young Yoon
Venue: Journal of Cognitive Neuroscience (2006)

Visual search is facilitated if half the distractors are presented as a preview prior to the presentation of the target and second set of distractors&mdash;the preview benefit [Watson, D. G., & Humphreys, G. W. Visual marking: Prioritizing selection for new objects by top-down attentional inhibition of old objects. Psychological Review, 104, 90&ndash;122, 1997]. On one account, the preview advantage is due to automatic capture of attention by the onsets in the second, search display [Donk, M., & Theeuwes, J. Visual marking beside the mark: Prioritizing selection by abrupt onsets. Perception & Psychophysics, 93, 891&ndash;900, 2001]. We provide a neuropsychological test of this assertion. We examined onset capture and preview benefits in search in a group of neuropsychological patients with unilateral parietal damage. We demonstrate a normal pattern of performance when patients detected targets defined by onsets relative to those defined by offsets, irrespective of whether the onset target fell contra- or ipsilateral to the lesion. In contrast, there was a normal preview benefit in search only for ipsilesional targets, and preview search was impaired in the contralesional field. The data demonstrate that the preview benefit can dissociate from the onset advantage in search, and that onsets remain strongly weighted for attention even in the contralesional field of patients with parietal lesions.
Gradient field-based task assignment in an AGV transportation system
Authors: Danny Weyns, Nelis Boucké, Tom Holvoet
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value, however, they may not be flexible enough to cope with continuously changing circumstances. In this paper we study and validate the feasibility of a field-based approach for task assignment in a complex problem domain.In particular, we apply the field-based approach for task assignment in an AGV transportation system. In this approach, transports emit fields into the environment that attract idle AGVs. To avoid multiple AGVs driving towards the same transport, AGVs emit repulsive fields. AGVs combine received fields and follow the gradient of the combined fields, that guide them towards pick locations of transports. The AGVs continuously reconsider the situation of the environment and task assignment is delayed until the load is picked, improves the flexibility of the system.Extensive experiments indicate that the field-based approach outperforms the standard Contract Net approach on various performance measures, such as the average wait time of transports and throughput. Limitations of the field-based approach are an unequal distribution of wait times across different transports and a small increase of bandwidth occupation.
Stimulation Spectrum Based High-dimensional Data Visualization
Authors: Kan Liu, Ping Liu, Dawei Jin
Venue: Proceedings of the conference on Information Visualization (2006)

One of the main goals of high-dimensional data visualization is to reduce dimensions, so that the data can be projected onto 2-D or 3-D space. This paper proposes a stimulation spectrum based visualization approach, in which each high-dimension data is regarded as a stimulation spectrum and the change of each value of data attribute corresponds to the change of wavelength of visible spectrum. According to the relationship between stimulation spectrum and color space, we can project high-dimensional data onto 3- dimensional space, and easily observe the distribution of the data. We also demonstrate this novel approach with synthetic data and real data, and the result is very promising.
Maximum entropy algorithm for spectral estimation problem with gaps
Authors: R. Ugrinovsky
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The maximum entropy approach to the solution of power density estimation problems with gaps is studied in context of the trigonometric moment problem with gaps. We establish the necessary and sufficient conditions for the existence of solution and describe all solutions of the spectral density estimation problem. The considered approach allows us to describe any possible extrapolation of the autocorrelation function agrees with a set of known values and a priori information about spectral power density and to introduce into consideration the new definition of the entropy functional which coincides with the generally used one in case of conventional spectral power density estimation problem. The effective algorithm to construct maximum entropy solution of the power density estimation problem with gaps is proposed. 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
Transfer, processing and distribution of cosmic ray data from Tibet
Authors: Kai Nan, Yongzheng Ma, Hongmei Zhang, Gang Chen
Venue: Future Generation Computer Systems (2006)

The YBJ-ARGO experiment uses cosmic ray data collected at the International Cosmic Ray Observatory in Tibet. Because of the observatory's location, transferring those data at a speed of 0.5 TB per day is challenging. Furthermore, the stream of raw data needs to be processed in a timely fashion before the resulting, reconstructed data are made available to the physicists-users. These processes demand large capacity, computing and storage resources. In this paper, we introduce the processes of transfer, processing and distribution of cosmic ray data from Tibet. A working demonstration was presented at the iGrid 2005 workshop.
SymPhone: design and implementation of a VoIP peer for Symbian mobile phones using Bluetooth and SIP
Authors: Patrick Stuedi, Andreas Frei, Luc Burdet, Gustavo Alonso
Venue: Proceedings of the 4th international workshop on Wireless mobile applications and services on WLAN hotspots (2006)

VoIP is born from the growing Internet infrastructure, which has over the years seen significant improvements in both bandwidth and end-to-end latency. In this paper, we explore making VoIP available on a mobile phone. For that purpose, we propose an architecture and describe the various components involved. Data entering and leaving the mobile phone is encapsulated in a wireless Bluetooth connection. The bridge to the Internet is provided by a linux Bluetooth access point. The system is compatible with current VoIP standards using RTP and SIP for data and signaling transmission, respectively. It has been tested to work in combination with several known softphones. Both RTP and SIP stack are built on top of a special IP emulation layer on the mobile phone, which has been developed to facilitate the migration of the application onto devices having a direct IP binding available for Bluetooth such as BNEP (Bluetooth Network Encapsulation Protocol). Apart from presenting design and implementation details, the paper also provides measurement results with regard to delay and session setup time and discusses certain limitations of the application evolving from restrictions imposed by the mobile phone's programming platform.