ppxscal/embedding_network huggingface dataset:
Information Theoretical Approach to Identification of Hybrid Systems
Authors: Li Pu, Jinchun Hu, Badong Chen
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this paper, we present a noisy version of the algebraic geometric approach of identifying parameters of discrete-time linear hybrid system. Two approximate ways of estimating hybrid parameters are considered: one is using MSE criteria, while the other is based on the information divergence that measures the distance between the error probability density function (PDF) of the identified model and the desired error PDF. A stochastic information divergence gradient algorithm is derived for the identification problem of non-gaussian system.
The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings
Authors: Patrick Solé, Dimitrii Zinoviev
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

Weighted degree trace codes over even characteristic Galois rings give binary sequences by projection on their most significant bit (MSB). Upper bounds on the aperiodic correlation, peak to sidelobe level (PSL), partial period imbalance and partial period pattern imbalance of these sequences are derived. The proof technique involves estimates of incomplete character sums over Galois rings, combining Weil-like bounds with Fourier transform estimates.
K-link: A Peer-to-Peer Solution for Organizational Knowledge Management
Authors: Giuseppe Pirro', Domenico Talia, Massimo Ruffolo
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

In the latest years knowledge management received more and more attention as a source of competitive advantage for enterprises and organizations, therefore becomes important to understand how computer science solutions should be designed to efficiently manage knowledge. Most of the current knowledge management systems use technological architectures that are in contradiction with the social processes concerning the creation of new knowledge, slowing down organizational innovation. Actually, most of those systems use centralized architectures filtering knowledge from any form of personal and contextual interpretation. Recently a new paradigm supporting cooperative and dynamic aspects of knowledge management (KM) has been proposed: Distributed Knowledge Management (DKM). In particular, peer to peer (P2P) architectures seem to naturally fulfil the requirements of this new model. Nevertheless, current P2P architectures suffer from heavy limitations due to the lack of semantic supports for handling knowledge. To overcome these limitations, the scientific community is appraising the possibility of using ontologies as a semantic support in KM processes. This paper presents an ontology based P2P system for DKM named K-link. The system design and its implementation are described. Moreover an ad hoc ontology framework for supporting organizational KM is also presented.
A Computer Game Designed for All
Authors: Roland Ossmann, Klaus Miesenberger, Dominique Archambault
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Computer games are one of the most challenging applications concerning accessibility and usability for people with disabilities. There are only a few games available, which are accessible and most of the time only for a special group of people with specific needs, e.g. games for blind people. Due to this designing games for all and implementing accessibility in mainstream games is a rather new challenge. This paper presents a game designed for all and will discuss the benefits of different accessibility features to several groups of people with disabilities.
Transparent Connectivity for Embedded System Design
Authors: C. Pearson, T. Giuma, A. Harris
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Embedded system design is a topic of interest to multidisciplinary fields including electrical engineering and computer science. In order to correctly focus on the correct aspects of embedded system design, be it hardware for electrical engineering students, or software for computer science students, seamless connectivity between the hardware and software aspects needs to be provided. One approach to provide students from both fields with practical experience is to develop a transparent bridge between the hardware and software layers of the embedded system design. In this paper we demonstrate a Universal Serial Bus/Serial Peripheral Interface (USB/SPI) transparent bridge to interface an embedded system to a personal computer. The bridge consists of a hardware module that transmits the embedded system data through SPI to a PC using USB. A device driver for the USB/SPI Bridge provides a straightforward application programming interface to the embedded system. The bridge can aide students studying embedded system design and students studying computer software development to collaborate on design projects.
Security in a peer-to-peer data grid storage system
Authors: Liangliang Xiao, I-Ling Yen, Farokh Bastani
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

The data grid storage systems enable the sharing and coordinated use of data from various sources to fit the needs of many data-intensive applications. Many data grids are being developed in various application domains, such as bioinformatics, health care, geo-science, military information systems, etc. The storage subsystem in a data grid plays an important role and can have significant impact on data grid security, dependability, and access performance.
A New Mechanical Algorithm for Solving System of Fredholm Integral Equation Using Resolvent Method
Authors: Weiming Wang, Yezhi Lin, Zhenbing Zeng
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

In this paper, by using the theories and methods of mathematical analysis and computer algebra, a complete iterated collocation method for solving system of Fredholm integral equation is established, furthermore, the truncated error is discussed. And a new mechanical algorithm FredEqns is established, too. The algorithm can provide the approximate solution of system of Fredholm integral equation. Some examples are presented to illustrate the efficiency and accuracy of the algorithm. This will be useful for the integral system solving and mathematical theorems automatic proving.
Breast Mass Detection under Increased Ambient Lighting
Authors: Benjamin J. Pollard, Amarpreet S. Chawla, Noriyuki Hashimoto, Ehsan Samei
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Under typical dark conditions found in mammography reading rooms, a reader's pupils will contract and dilate as the visual focus moves between the high luminance display and the darker background wall, potentially resulting in visual fatigue and degraded diagnostic performance. A controlled increase of ambient lighting can, however, minimize this luminance discrepancy, potentially reducing pupillary action while improving reader comfort and detection ability. A psychophysical study was conducted to determine the effect of a controlled ambient lighting increase on observer detection of subtle masses within mammograms viewed on a DICOM-calibrated medical-grade LCD. Four mammographers read 86 mammograms (43 normal and 43 with cancerous masses) under a dark room condition (1 lux) and an elevated room illuminance level (50 lux). Results show generally constant or decreased average selection times and decreased average observer performance under elevated illuminance. Differences, however, were not statistically significant, and of the same magnitude as interobserver variability.
Managing Conflict Resolution in Norm-Regulated Environments
Authors: Martin J. Kollingbaum, Wamberto W. Vasconcelos, Andres García-Camino, Tim J. Norman
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

Norms are the obligations, permissions and prohibitions associated with members of a society. Norms provide a useful abstraction with which to specify and regulate the behaviour of self-interested software agents in open, heterogeneous systems. Any realistic account of norms must address their dynamic nature: the norms associated with agents will change as agents act (and interact) --- prohibitions can be lifted, obligations can be fulfilled, and permissions can be revoked as a result of agents' actions. These norms may at times conflict with one another, that is, an action may be simultaneously prohibited and obliged (or prohibited and permitted). Such conflicts cause norm-compliant agents to experience a paralysis: whatever they do (or not do) will go against a norm. In this paper we present mechanisms to detect and resolve normative conflicts. We achieve more expressiveness, precision and realism in our norms by using constraints over first-order variables. The mechanisms to detect and resolve norm conflicts take into account such constraints and are based on first-order unification and constraint satisfaction. We also explain how the mechanisms can be deployed in the management of norms regulating environments for software agents.
Test-Cost Sensitive Classification Based on Conditioned Loss Functions
Authors: Mumin Cebe, Cigdem Gunduz-Demir
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We report a novel approach for designing test-cost sensitive classifiers that consider the misclassification cost together with the cost of feature extraction utilizing the consistency behavior for the first time. In this approach, we propose to use a new Bayesian decision theoretical framework in which the loss is conditioned with the current decision and the expected decisions after additional features are extracted as well as the consistency among the current and expected decisions. This approach allows us to force the feature extraction for samples for which the current and expected decisions are inconsistent. On the other hand, it forces not to extract any features in the case of consistency, leading to less costly but equally accurate decisions. In this work, we apply this approach to a medical diagnosis problem and demonstrate that it reduces the overall feature extraction cost up to 47.61 percent without decreasing the accuracy.
Athos: Efficient Authentication of Outsourced File Systems
Authors: Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos
Venue: Proceedings of the 11th international conference on Information Security (2008)

We study the problem of authenticated storage, where we wish to construct protocols that allow to outsource any complex file system to an untrusted server and yet ensure the file-system's integrity. We introduce Athos, a new, platform-independent and user-transparent architecture for authenticated outsourced storage. Using light-weight cryptographic primitives and efficient data-structuring techniques, we design authentication schemes that allow a client to efficiently verify that the file system is fully consistent with the exact history of updates and queries requested by the client. In Athos, file-system operations are verified in time that is logarithmic in the size of the file system using optimal storage complexity--constant storage overhead at the client and asymptotically no extra overhead at the server. We provide a prototype implementation of Athos validating its performance and its authentication capabilities.
Assumption-Based Argumentation for Epistemic and Practical Reasoning
Authors: Francesca Toni
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

Assumption-based argumentation can serve as an effective computational tool for argumentation-based epistemic and practical reasoning, as required in a number of applications. In this paper we substantiate this claim by presenting formal mappings from frameworks for epistemic and practical reasoning onto assumption-based argumentation frameworks. We also correlate these mappings to formulations of epistemic and practical reasoning in abstract argumentation terms.
Text Entailment for Logical Segmentation and Summarization
Authors: Doina Tatar, Andreea Diana Mihis, Dana Lupsa
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

Summarization is the process of condensing a source text into a shorter version preserving its information content ([2]). This paper presents some original methods for text summarization by extraction of a single source document based on a particular intuition which is not explored till now: the logical structure of a text. The summarization relies on an original linear segmentation algorithm which we denote logical segmentation (LTT) because the score of a sentence is the number of sentences of the text which are entailed by it.The summary is obtained by three methods: selecting the first sentence(s) from a segment, selecting the best scored sentence(s) from a segment and selecting the most informative sentence(s) (relative to the previously selected) from a segment. Moreover, our methods permit dynamically adjusting the derived summary size, independently of the number of segments.Alternatively, a Dynamic Programming (DP) method, based on the continuity principle and applied to the sentences logically scored as above is proposed. This method proceeds by obtaining the summary firstly and then determining the segments.Our methods of segmentation are applied and evaluated against the segmentation of the text "I spent the first 19 years" of Morris and Hirst ([17]). The original text is reproduced at [26]. Some statistics about the informativeness of the summaries with different lengths and obtained with the above methods relatively to the original (summarized) text are given. These statistics prove that the segmentation preceding the summarization could improve the quality of obtained summaries.
An efficient pattern matching algorithm for comparative Genome sequence analysis
Authors: Muneer Ahmad, Hassan Mathkour
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Sequences, meant as logic units of meaningful term successions, can be considered the backbone of data. Consider, for instance, genetic sequences, where the terms are genetic symbols, or plain natural language sentences, formed by words. To name just few examples of sequence use, consider the adoption of sentences for the description of the real world modeled in the database and their role in composing documents. Searching in sequence repositories often requires going beyond exact matching to determine the sequences which are similar or close to a given query sentence (approximate matching). The similarity involved in this process can be based either on the semantics of the sequence or just on its syntax. The former considers the meaning of the terms in the sequences, and is almost impossible to elaborate the results before the proper extraction and analysis while the later approach is sufficiently comprehensive at implementation level. It finds the number of approximate matches of the sequences for optimal results.
On the Limits of Information Flow Techniques for Malware Analysis and Containment
Authors: Lorenzo Cavallaro, Prateek Saxena, R. Sekar
Venue: Proceedings of the 5th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2008)

Taint-tracking is emerging as a general technique in software security to complement virtualization and static analysis. It has been applied for accurate detection of a wide range of attacks on benign software, as well as in malware defense. Although it is quite robust for tackling the former problem, application of taint analysis to untrusted (and potentially malicious) software is riddled with several difficulties that lead to gaping holes in defense. These holes arise not only due to the limitations of information flow analysis techniques, but also the nature of today's software architectures and distribution models. This paper highlights these problems using an array of simple but powerful evasion techniques that can easily defeat taint-tracking defenses. Given today's binary-based software distribution and deployment models, our results suggest that information flow techniques will be of limited use against future malware that has been designed with the intent of evading these defenses.
A Systematic Framework for Designing and Evaluating Persuasive Systems
Authors: Harri Oinas-Kukkonen, Marja Harjumaa
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

A growing number of information technology systems and services are being developed to change users' attitudes or behavior or both. Despite the fact that attitudinal theories from social psychology have been quite extensively applied to the study of user intentions and behavior, these theories have basically provided checklists or rules of thumb rather than systematic design methods or methodologies to develop software solutions. This article is conceptual-theoretical by its nature. It discusses the process of designing and evaluating persuasive systems and describes what kind of content and software functionality may be found at the final product. Seven underlying postulates behind persuasive systems, ways to analyze the user and the use context, and persuasive design strategies and guidelines are highlighted. Based on the works of Fogg, the article also lists techniques for persuasive system content and functionality, describing example software requirements and implementations. Some new techniques are suggested. Moreover, a new categorization of these techniques is proposed, composing of the primary task, dialogue, system credibility, and social support categories.
Extracting Curve Skeletons from Gray Value Images for Virtual Endoscopy
Authors: Christian Bauer, Horst Bischof
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

The extraction of curve skeletons from tubular networks is a necessary prerequisite for virtual endoscopy applications. We present an approach for curve skeleton extraction directly from gray value images that supersedes the need to deal with segmentations and skeletonizations. The approach uses properties of the Gradient Vector Flow to derive a tube-likeliness measure and a medialness measure. Their combination allows the detection of tubular structures and an extraction of their medial curves that stays centered also in cases where the structures are not tubular such as junctions or severe stenoses. We present results on clinical datasets and compare them to curve skeletons derived with different skeletonization approaches from high quality segmentations. Our approach achieves a high centerline accuracy and is computationally efficient by making use of a GPU based implementation of the Gradient Vector Flow.
Algebraic Identification of MIMO SARX Models
Authors: Laurent Bako, René Vidal
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

We consider the problem of identifying the parameters of a multiple-input multiple-output switched ARX model with unknown number of submodels of unknown and possibly different orders. This is a very challenging problem because of the strong coupling between the unknown discrete state and the unknown model parameters. We address this challenge by algebraically eliminating the discrete state from the switched system equations. This algebraic procedure leads to a set of hybrid decoupling polynomials on the input-output data, whose coefficients can be identified using linear techniques. The parameters of each subsystem can then be identified from the derivatives of these polynomials. This exact analytical solution, however, comes with an important price in complexity: The number of coefficients to be identified grows exponentially with the number of outputs and the number of submodels. We address this issue with an alternative scheme in which the input-output data is first projected onto a low-dimensional linear subspace. The projected data is then fit with a single hybrid decoupling polynomial, from which the classification of the data according to the generating submodels can be obtained. The parameters of each submodel are then identified from the input-output data associated with each submodel.
A Top Down Interpreter for LPAD and CP-Logic
Authors: Fabrizio Riguzzi
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Logic Programs with Annotated Disjunctions and CP-logic are two different but related languages for expressing probabilistic information in logic programming. The paper presents a top down interpreter for computing the probability of a query from a program in one of these two languages. The algorithm is based on the one available for ProbLog. The performances of the algorithm are compared with those of a Bayesian reasoner and with those of the ProbLog interpreter. On programs that have a small grounding, the Bayesian reasoner is more scalable, but programs with a large grounding require the top down interpreter. The comparison with ProbLog shows that the added expressiveness effectively requires more computation resources.
Accessible Flash Is No Oxymoron: A Case Study in E-Learning for Blind and Sighted Users
Authors: Maria Krüger
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Flash applications are widespread on the Internet, whether used for streaming audio and video or for interactive games. Its critical perception regarding accessibility is partly unjustified, as judging accessible Flash an oxymoron has become obsolete. In fact, it is possible to enable people with special needs to profit from interactive Flash applications. This paper demonstrates the creation of such an accessible Flash application for both blind and sighted users.
Do Computers Belong in Art?
Authors: John ChromaSet
Venue: IEEE Computer Graphics and Applications (1987)

If you are a computer artist and have colleagues or students who still fear the computer as a medium, you might want to show this article to them. It was adepted from a paper delivered at NCGA's Computer Graphics 87. 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