ppxscal/embedding_network huggingface dataset:
Privacy patterns for online interactions
Authors: Sasha Romanosky, Alessandro Acquisti, Jason Hong, Lorrie Faith Cranor, Batya Friedman
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

A proper security architecture is an essential part of implementing robust and reliable networked applications. Security patterns have shown how reoccurring problems can be best solved with proven solutions. However, while they are critical for ensuring the confidentiality, integrity and availability of computing systems, security patterns do not specifically (or necessarily) address the privacy of individuals. Building on existing privacy pattern work, we identify three privacy patterns for web-based activity: INFORMED CONSENT FOR WEB-BASED TRANSACTIONS, MASKED ONLINE TRAFFIC, and MINIMAL INFORMATION ASYMMETRY. The first pattern addresses a system architecture issue and draws on Friedman's model for informed consent. The second and third patterns provide support for end users and extend Jiang's 'Principle of Minimum Asymmetry.' These patterns describe how users can protect their privacy by both revealing less about themselves, and acquiring more information from the party with whom they are communicating.
A System for Dynamic Adaptation of Web Interfaces Based on User Interaction Requirements
Authors: Javier Gonzalez-Pisano, Maria Rodriguez-Fernandez, Martin Gonzalez-Rodriguez, Jose Ramon Bobes-Bascaran, Jaime Garcia-Marsa
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This article makes the proposal for a software architecture that allows dynamic adaptation of Web interfaces depending on user interaction requirements, giving special attention to individuals who have any kind of disability. This task is achieved through several transformations on visual aspects of the Web pages such as changes on the sizes of objects, colors, relative position of the elements or navigation device used.The system separates the functionality of a Web site and its interface at runtime to customize later some of the elements of the interface according to the characteristics of the individual, taking advantage of the widespread use of Web standards such as CSS so that it is not necessary to use any additional platform for the specification of the interface. User information will be updated continuously through the use of interface autonomous agents that store data about navigation process, performing corrective actions to allow dynamic adaptation to the changing conditions of the user.
An Elimination Algorithm for Functional Constraints
Authors: Yuanlin Zhang, Roland H. Yap, Chendong Li, Satyanarayana Marisetti
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Functional constraints are studied in Constraint Satisfaction Problems (CSP) using consistency concepts (e.g., [1,4]). In this paper, we propose a new method --- variable substitution --- to process functional constraints. The idea is that if a constraint is functional on a variable, this variable in another constraint can be substituted using the functional constraint without losing any solution. We design an efficient algorithm to reduce, in $\mathcal{O}(ed^2)$, a general binary CSP containing functional constraints into a canonical form which simplifies the problem and makes the functional portion trivially solvable. When the functional constraints are also bi-functional, then the algorithm is linear in the size of the CSP.
Generating Robust Investment Strategies with Agent-Based Co-evolutionary System
Authors: Rafał Dreżewski, Jan Sepielak, Leszek Siwik
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Agent-based co-evolutionary systems seem to be convenient for modeling market-related behaviors, since they allow for defining competing and/or co-operating agents which can interact and communicate with each other and influence the environment and other agents. In the course of this paper the idea of utilizing of agent-based co-evolutionary approach for supporting decisions of financial investor through generating possible investment strategies is presented and experimentally verified.
Building wireless mesh networks in forests: antenna direction, transmit power, and vegetation effects on network performance
Authors: Kuang-Ching Wang, Gayatri Venkatesh, Sajindra Pradhananga, Sandeep Lokala, Shari Carter, Jason Isenhower, James Vaughn
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

Wireless mesh networks have become an effective solution for extending Internet connectivity to large areas without an existing communication infrastructure. Building a mesh network in areas with heavy vegetation, however, is challenging due to their severe radio attenuating effects. At Clemson, a wireless mesh network testbed is being built in deep forests to connect watershed monitoring sensors to Internet. This paper presents the testbed and link performance measurements conducted with varied antenna orientation, transmit power, and obstructing vegetation between wireless mesh routers. The results will be useful for deriving radio link models for assessing the performance and reliability of forest wireless networks.
T-rotation: Multiple Publications of Privacy Preserving Data Sequence
Authors: Youdong Tao, Yunhai Tong, Shaohua Tan, Shiwei Tang, Dongqing Yang
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

In privacy preserving data publishing, most current methods are limited only to the static data which are released once and fixed. However, in real dynamic environments, the current methods may become vulnerable to inference. In this paper, we propose the t-rotation method to process this continuously growing dataset in an effective manner. T-rotation mixes t continuous periods to form the dataset and then anonymizes. It avoids the inference by the temporal background knowledge and considerably improves the anonymity quality.
An ILP Refinement Operator for Biological Grammar Learning
Authors: Daniel C. Fredouille, Christopher H. Bryant, Channa K. Jayawickreme, Steven Jupe, Simon Topp
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

We are interested in using Inductive Logic Programming (ILP) to infer grammars representing sets of biological sequences. We call these biological grammars. ILP systems are well suited to this task in the sense that biological grammars have been represented as logic programs using the Definite Clause Grammar or the String Variable Grammar formalisms. However, the speed at which ILP systems can generate biological grammars has been shown to be a bottleneck. This paper presents a novel refinement operator implementation, specialised to infer biological grammars with ILP techniques. This implementation is shown to significantly speed-up inference times compared to the use of the classical refinement operator: time gains larger than 5-fold were observed in $\frac{4}{5}$ of the experiments, and the maximum observed gain is over 300-fold.
Enhanced Security Scheme for Managing Heterogeneous Server Platforms
Authors: Jiho Kim, Duhyun Bae, Sehyun Park, Ohyoung Song
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In this paper, we propose enhanced security scheme for managing heterogeneous server platforms. We apply fault tolerant architecture to basic remote server management model for providing security enhancement. This security enhancement includes several security services such as authentication, integrity, confidentiality, role based access control, and single-sign on. The traditional management methods cannot obtain these strong security services. Also, we present implementation results to verify functionality of the proposed scheme and demonstrate the performance of certificate validation that occupy most of total latency.
Decentralized Event-Triggered Broadcasts over Networked Control Systems
Authors: Xiaofeng Wang, Michael D. Lemmon
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

This paper examines event-triggered broadcasting of state information in distributed networked systems. Event-triggering has the agent broadcast its state information when its local "error" signal exceeds a given threshold. We present a decentralized approach for determining event-triggering thresholds for nonlinear subsystems with the assumption that each agent only has access to its local state. The main results of this paper show that our decentralized event triggering scheme guarantees the asymptotic stability of the entire networked control system.
Spatial Abstraction: Aspectualization, Coarsening, and Conceptual Classification
Authors: Lutz Frommberger, Diedrich Wolter
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

Spatial abstraction empowers complex agent control processes. We propose a formal definition of spatial abstraction and classify it by its three facets, namely aspectualization, coarsening, and conceptual classification. Their characteristics are essentially shaped by the representation on which abstraction is performed. We argue for the use of so-called aspectualizable representations which enable knowledge transfer in agent control tasks. In a case study we demonstrate that aspectualizable spatial knowledge learned in a simplified simulation empowers strategy transfer to a real robotics platform.
Virtual Environments for Anyone
Authors: Heinrich Godbersen
Venue: IEEE MultiMedia (2008)

Editors' NoteDifferent demands to computing power, graphics processing capabilities, and modalities of user interaction have traditionally kept VR, computer graphics, and games separate research domains. But recently, powerful programmable GPUs and VR-style input devices like the Wii controller have become common. Expensive, custom-built hardware setups are no longer needed to build exciting VR appliances.In this issue's column, Heinrich Godbersen from TFH Berlin argues that this change will bring the worlds of VR, computer graphics, and games together. He discusses how technological advances enable him to move between those worlds and create game-like VR appliances such as Flight Vienna with inexpensive commodity hardware and development tools.&#x2014;William I. Grosky and Utz Westermann
The Marking of Verb-Actant Relations in Georgian
Authors: G. Chikoidze
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)

The purpose of our research is to find a transparent and consistent basis for representing the relations between the Georgian verb and its actants. We use the metaphor of an "action chain" as a means to elucidate the complex interdependencies representing the most general aspects of the verbal meaning, as well as the core component of the utterance as a whole, namely the standpoint from which the speaker considers the event described in the utterance. 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
Ischemic Stroke Segmentation on CT Images Using Joint Features
Authors: Andrius Ušinskas, Romualdas A. Dobrovolskis, Bernd F. Tomandl
Venue: Informatica (2004)

The paper describes a new method to segment ischemic stroke region on computed tomography (CT) images by utilizing joint features from mean, standard deviation, histogram, and gray level co-occurrence matrix methods. Presented unsupervised segmentation technique shows ability to segment ischemic stroke region.
Shannon Wavelet Analysis
Authors: Carlo Cattani
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper the differentiable structure of the Shannon wavelets is defined and the projection of a linear differential operators is given for any order. As application, the wavelet solution of a heat propagation problem is computed and the contribution of the different scale components is explicitly shown.
Mimicry Attacks Demystified: What Can Attackers Do to Evade Detection?
Authors: Hilmi Günes Kayacik, A. Nur Zincir-Heywood
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

Mimicry attacks have been the focus of detector research where the objective of the attacker is to generate an attack that evades detection while achieving the attacker’s goals. If such an attack can be found, it implies that the target detector is vulnerable against mimicry attacks. In this work, we emphasize that there are two components of a buffer overflow attack: the preamble and the exploit. Although the attacker can modify the exploit component easily, the attacker may not be able to prevent preamble from generating anomalous behavior since during preamble stage, the attacker does not have full control. Previous work on mimicry attacks considered an attack to completely evade detection, if the exploit raises no alarms. On the other hand, in this work, we investigate the source of anomalies in both the preamble and the exploit components against two anomaly detectors that monitor four vulnerable UNIX applications. Our experiment results show that preamble can be a source of anomalies, particularly if it is lengthy and anomalous.
OpenAdap.net: Evolvable Information Processing Environment
Authors: Alessandro E. Villa, Javier Iglesias
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

OpenAdap.net is an Open Source project aimed at breaking the barriers existing in the flow of information access and information processing. The infrastructure makes it possible the dissemination of resources like knowledge, tools or data, their exposure to evaluation in ways that might be unanticipated and hence support the evolution of communities of users around a specific domain. The architecture is designed by analogy with a virtual distributed operating system in which the dynamic resources are presented as files in a structured virtual file system featuring ownership and access permissions.
Artificial Intelligence Is Engineering Intelligence --- Why Should We Care About Natural Intelligence?
Authors: Thomas Christaller
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Artificial Intelligence is about designing and constructing artefacts, normally not about explaining human intelligence. So, why should we care about natural intelligence when talking about AI? There are several important more or less recent findings in brain science as well as ethology which require a deeper rethinking on the AI side. Based on them, the hypothesis in this talk is: The rising complexity of the behaviour system and of personalized social relationships was one of the major reasons for developing intelligence - contrary to the huge resource consumption that intelligence costs an individual. The most important result of this development was the capability of forecasting the behaviour of conspecifics for survival in a complex social environment. This capability was also useful for other purposes, including forecasting behaviour of individuals of other species and nature itself.
Detecting Protein-Protein Interaction Sentences Using a Mixture Model
Authors: Yun Niu, Igor Jurisica
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

This paper proposes a mixture model approach for automatic detection of protein-protein interaction sentences. We combine rule-based and SVM algorithms to achieve both high precision and recall. Experimental evaluation shows that the mixture model outperforms each individual model. Particularly, recall is substantially improved using the mixture model compared to SVM with only a small reduction in precision. We apply this approach to annotate interactions in I2D database of protein-protein interactions with references from Medline.
Facilitating Agent Development in Open Distributed Systems
Authors: Mauro Gaspari, Davide Guidi
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

One of the main reasons behind the success of the Web is that many "regular users" are able to create Web pages that, using hyperlinks, incrementally extend both the size and the complexity of the Web itself. The development of agents in the Web infrastructure should ideally be driven by the same paradigm: users being able to write simple or advanced agents. These agents will then provide capabilities using a set of resources, such as standard Web pages, Web services and, of course, other agents. However, agents providing advanced services will never be developed in the same way as Web pages have been created in the past. In fact programming agents is a complex task that needs adequate skills and tools in order to be carried out successfully. As a consequence, only few people are currently able to contribute to their development. The question that arises is whether this gap could be possibly reduced in the future. In this paper we address this question presenting NOWHERE, an open agent communication infrastructure which facilitates the programming task in open distributed multi-agent systems.
A novel technique for synthesizing distributed and concurrent protocol specifications
Authors: Jehad Al Dallal, Kassem Saleh
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Several methods have been proposed for synthesizing computer communication protocol specifications starting from service specifications. Some protocol synthesis methods based on the Finite State Machine (FSM) model assume that primitives in the service specifications cannot be executed simultaneously. Others either handle only controlled primitive concurrency or have tight restrictions on the applicable FSM topologies. This paper proposes a concurrent-based protocol synthesis method that eliminates the restrictions imposed by the earlier methods. The synthesis method uses a sequential-based synthesis method to derive a sequential protocol specification (P-SPEC) from a service specification (S-SPEC) and then applies several transformation rules to re-model the resulting P-SPEC to consider the concurrency behavior specified in the SSPEC.
On 2-Detour Subgraphs of the Hypercube
Authors: J&#x00f3;zsef Balogh, Alexandr Kostochka
Venue: Graphs and Combinatorics (2008)

A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y &#x2208; V(G), d H (x, y) &#x2264; d G (x, y)&#x00a0;+&#x00a0;2. We prove a conjecture of Erd&#x0151;s, Hamburger, Pippert, and Weakley by showing that for some positive constant c and every n, each 2-detour subgraph of the n-dimensional hypercube Q n has at least clog2 n &#x00b7; 2n edges.
On the use of archetypes as benchmarks
Authors: Giovanni C. Porzio, Giancarlo Ragozini, Domenico Vistocco
Venue: Applied Stochastic Models in Business and Industry (2008)

Benchmarking plays a relevant role in performance analysis, and statistical methods can be fruitfully exploited for its aims. While clustering, regression, and frontier analysis may serve some benchmarking purposes, we propose to consider archetypal analysis as a suitable technique. Archetypes are extreme points that synthesize data and that, in our opinion, can be profitably used as benchmarks. That is, they may be viewed as key reference performers in the comparison process. We suggest a three-step data driven benchmarking procedure, which enables users: (i) to identify some reference performers, (ii) to analyze their features, (iii) to compare observed performers with them. An exploratory point of view is preferred, and graphical devices are adopted throughout the procedure. Finally, our approach is presented by means of an illustrative example based on The Times league table of the world top 200 universities. Copyright &copy; 2008 John Wiley & Sons, Ltd. This paper is based on a presentation given at the SMAP06 Workshop, Cassino, April 2006.
Semantic fitting and reconstruction
Authors: Torsten Ullrich, Volker Settgast, Dieter W. Fellner
Venue: Journal on Computing and Cultural Heritage (JOCCH) (2008)

The current methods to describe the shape of three-dimensional objects can be classified into two groups: methods following the composition of primitives approach and descriptions based on procedural shape representations. As a 3D acquisition device returns an agglomeration of elementary objects (e.g. a laser scanner returns points), the model acquisition pipeline always starts with a composition of primitives. Due to the semantic information carried with a generative description, a procedural model provides valuable metadata that make up the basis for digital library services: retrieval, indexing, and searching. An important challenge in computer graphics in the field of cultural heritage is to build a bridge between the generative and the explicit geometry description combining both worlds&mdash;the accuracy and systematics of generative models with the realism and the irregularity of real-world data. A first step towards a semantically enriched data description is a reconstruction algorithm based on decreasing exponential fitting. This approach is robust towards outliers and multiple dataset mixtures. It does not need a preceding segmentation and is able to fit a generative shape template to a point cloud identifying the parameters of a shape.
Review from a Tools' Perspective
Authors: M. Nagl
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

IMPROVE can also be regarded as a tool integration project with a broad understanding of "integration" (cf. part I of this book). This section is to summarize our findings on tools by regarding four different views on these tools: (a) contributions of IMPROVE to a better support of development processes by using tools, (b) lessons learned from tool construction/integration, (c) how tool construction and modeling of development processes interact, and (d) how application-specific or general our results on tools are. The review is restricted to the academic viewpoint. The industrial review for tools --- but also for other perspectives --- is given in Sect. 8.3. 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