ppxscal/embedding_network huggingface dataset:
Checking Interaction Consistency in MARMOT Component Refinements
Authors: Yunja Choi
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The refinement process of component designs is one of the basic building blocks for systematic component-based development. In this process, identifying inconsistent specifications of interactions among refined and refining components can be a critical issue for system safety and/or reliability.To efficiently identify interaction inconsistencies, we have been developing a consistency checking framework integrated into the model-driven component-based development methodology Marmot, using model checking as a debugging tool. We introduce our notion of interaction consistency, propose a general framework for integrating the consistency checking mechanism into the refinement process, and demonstrate how the efficiency of identifying inconsistencies can be improved through abstractions.
Types for safe resource sharing in sequential and concurrent programming
Authors: Hongwei Xi
Venue:  (2008)

Though the potential of linear logic in facilitating reasoning on resource usage has long been recognized, its convincing use in practice is still rare. Recently, Zhu and Xi developed a type system that can effectively support safe memory manipulation through pointers. However, this linear type system does not provide adequate support for resource sharing. As a consequence, it requires that resources be threaded through functions, which can cause serious difficulties in practice (e.g. program modularity may be sacrificed) and thus severely restrict the use of linear types. In this dissertation, we develop a general type-theoretical framework for supporting safe sharing of linear resources. In sequential programming, we first introduce a modality, which we refer to as the sharing modality, in support of resource sharing (with no use of locks). We then develop the underlying type theory for the sharing modality and establish its soundness based on a notion of types with effects. Also, an intimate relation between this modality and the issue of code reentrancy is formally studied in this context. Next, we formalize a concurrent programming language equipped with a linear type system and establish its soundness, which guarantees that many common safety violations (e.g., race conditions and resource corruptions) can never occur during the evaluation of a well-typed program. A novel aspect of this language lies in a formal treatment of linear locks for protecting shared resources. The resources protected by linear locks cannot be leaked, as such locks are themselves a form of resources that must be safely reclaimed after their use. We carry out the type theoretical development in the Applied Type System framework, which makes it standard to accommodate (universally and existentially quantified) dependent types, polymorphic types and also a paradigm of programming with theorem proving. We use the programming language ATS for implementation and present a variety of realistic running examples in support of practical use of the developed type theory. As a significant and interesting application, we describe an approach to constructing reliable Linux device drivers in ATS, providing a solid proof of concept.
Nasopharyngeal Carcinoma Data Analysis with a Novel Bayesian Network Skeleton Learning Algorithm
Authors: Alex Aussem, Sergio Rodrigues Morais, Marilys Corbex
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

In this paper, we discuss efforts to apply a novel Bayesian network (BN) structure learning algorithm to a real world epidemiological problem, namely the Nasopharyngeal Carcinoma (NPC). Our specific aims are : (1) to provide a statistical profile of the recruited population, (2) to help indentify the important environmental risk factors involved in NPC, and (3) to gain insight on the applicability and limitations of BN methods on small epidemiological data sets obtained from questionnaires. We discuss first the novel BN structure learning algorithm called Max-Min Parents and Children Skeleton (MMPC) developped by Tsamardinos et al. in 2005. MMPC was proved by extensive empirical simulations to be an excellent trade-off between time and quality of reconstruction compared to most constraint based algorithms, especially for the smaller sample sizes. Unfortunately, MMPC is unable to deal with datasets containing approximate functional dependencies between variables. In this work, we overcome this problem and apply the new version of MMPC on Nasopharyngeal Carcinoma data in order to shed some light into the statistical profile of the population under study.
Enterprise mobility and support outsourcing: A research model and initial findings
Authors: Christina C. Loh, Andrew D. Stadlen, Rahul C. Basole, John D. Moses, Conor Tuohy
Venue: Information-Knowledge-Systems Management (2008)

The evolution of the wireless industry and the rapid proliferation of a mobile workforce have left businesses at a disadvantage. Business customers must be creative with currently available support resources in order to address their needs. Organizations with high mobile usage maturity levels are moving towards greater device and policy standardization and are seeking a solution to their problems. Given the intrinsic gaps in current mobile network operator business models to meet business customers' wireless device support needs, and that businesses themselves are just starting to develop their capabilities in-house, this paper investigates organizational receptiveness towards outsourcing and the potentially compelling benefits that outsourcing offers.
A Domain-Specific Modelling Approach for Autonomic Network Management
Authors: Brian Pickering, Miguel A. Fernández, Antonio Castillo, Erhan Mengusoglu
Venue: Proceedings of the 3rd IEEE international workshop on Modelling Autonomic Communications Environments (2008)

This paper describes IBM's and Telefónica's joint work in progress in the field of Domain-Specific Modelling applied to Autonomic Network Management in the context of the European IST FP6 project MODELPLEX. In modelling edge-of-network devices which act as service access points from consumers to the telephone network, we have introduced a dynamic aspect to the network topology which affects the way Service Level Agreements (SLAs) should be modelled and processed within an autonomic management control loop. It is suggested that it is not possible to separate system and rule for managing services across a service-provider network.
Interpretable Piecewise Linear Classifier
Authors: Pitoyo Hartono
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

The objective of this study is to build a model of neural network classifier that is not only reliable but also, as opposed to most presently available neural networks, logically interpretable in a human-plausible manner. Presently, most of the studies of rule extraction from trained neural networks focus on extracting rule from existing neural network models that were designed without the consideration of rule extraction, hence after the training process they are meant to be used as a kind black box. Consequently, this makes rule extraction a hard task. In this study we construct a model of neural network ensemble with the consideration of rule extraction. The function of the ensemble can be easily interpreted to generate logical rules that are understandable to human. We believe that the interpretability of neural networks contributes to the improvement of the reliability and the usability of neural networks when applied critical real world problems.
On the Identification of Hammerstein Systems Having Saturation-like Functions with Positive Slopes
Authors: Rimantas Pupeikis
Venue: Informatica (2006)

The aim of the given paper is the development of an approach for parametric identification of Hammerstein systems with piecewise linear nonlinearities, i.e., when the saturation-like function with unknown slopes is followed by a linear part with unknown parameters. It is shown here that by a simple input data rearrangement and by a following data partition the problem of identification of a nonlinear Hammerstein system could be reduced to the linear parametric estimation problem. Afterwards, estimates of the unknown parameters of linear regression models are calculated by processing respective particles of input-output data. A technique based on ordinary least squares is proposed here for the estimation of parameters of linear and nonlinear parts of the Hammerstein system, including the unknown threshold of the piecewise nonlinearity, too. The results of numerical simulation and identification obtained by processing observations of input-output signals of a discrete-time Hammerstein system with a piecewise nonlinearity with positive slopes by computer are given.
Quasi-interpolation projectors for box splines
Authors: Tom Lyche, Carla Manni, Paul Sablonnière
Venue: Journal of Computational and Applied Mathematics (2008)

We consider box spline quasi-interpolants based on local linear functionals of point evaluator and integral type. The approximations are easy to compute, and reproduce the whole spline space in question.
User-Controllable GPGPU-Based Target-Driven Smoke Simulation
Authors: Jihyun Ryu, Sanghun Park
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The simulation of fluid phenomena, such as smoke, water, fire, has developed rapidly in computer games, special effects, and animation. The various physics-based methods can result in high quality images. However, the simulation speed is also important issue for consideration in applications. This paper describes an efficient method for controlling smoke simulation, running entirely on the GPU. Our interest is in how to reach given user-defined target smoke states in real time. Given an initial smoke state, we propose to simulate the smoke towards a special target state. This control is made by adding special external force terms to the standard flow equation.
Visual-Based View-Invariant Human Motion Analysis: A Review
Authors: Xiaofei Ji, Honghai Liu, Yibo Li, David Brown
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper provides a comprehensive survey of research on view-invariant human motion analysis. Recent research has shown that view-invariant related issues has been one of the bottlenecks for human motion understanding. The priority in this paper has been given to view-invariant pose representation and estimation, behaviour understanding. Research challenges and future directions are discussed in the end.
Trans-Media Pseudo-Relevance Feedback Methods in Multimedia Retrieval
Authors: Stephane Clinchant, Jean-Michel Renders, Gabriela Csurka
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)

We present here some transmedia similarity measures that we recently designed by adopting some "intermediate level" fusion approaches. The main idea is to use some principles coming from pseudo-relevance feedback and, more specifically, transmedia pseudo-relevance feedback for enriching the mono-media representation of an object with features coming from the other media. One issue that arises when adopting such a strategy is to determine how to compute the mono-media similarity between an aggregate of objects coming from a first (pseudo-)feedback step and one single multimodal object. We propose two alternative ways of adressing this issue, that result in what we called the "transmedia document reranking" and "complementary feedback" methods respectively.For the ImageCLEF - Photo Retrieval Task, it appears that mono-media retrieval performance is more or less equivalent for pure image and pure text content (around 20% MAP). Using our transmedia pseudofeedback-based similarity measures allowed us to dramatically increase the performance by ~50% (relative). From a cross-lingual perspective, the use of domain-specific, corpus-adapted probabilistic dictionaries seems to offer better results than the use of a broader, more general standard dictionary. With respect to the monolingual baselines, multilingual runs show a slight degradation of retrieval performance ( ~6 to 10% relative).
Compromising Anonymity Using Packet Spinning
Authors: Vasilis Pappas, Elias Athanasopoulos, Sotiris Ioannidis, Evangelos P. Markatos
Venue: Proceedings of the 11th international conference on Information Security (2008)

We present a novel attack targeting anonymizing systems. The attack involves placing a malicious relay node inside an anonymizing system and keeping legitimate nodes "busy." We achieve this by creating circular circuits and injecting fraudulent packets, crafted in a way that will make them spin an arbitrary number of times inside our artificial loops. At the same time we inject a small number of malicious nodes that we control into the anonymizing system. By keeping a significant part of the anonymizing system busy spinning useless packets, we increase the probability of having our nodes selected in the creation of legitimate circuits, since we have more free capacity to route requests than the legitimate nodes. This technique may lead to the compromise of the anonymity of people using the system.To evaluate our novel attack, we used a real-world anonymizing system, TOR. We show that an anonymizing system that is composed of a series of relay nodes which perform cryptographic operations is vulnerable to our packet spinning attack. Our evaluation focuses on determining the cost we can introduce to the legitimate nodes by injecting the fraudulent packets, and the time required for a malicious client to create n-length TOR circuits. Furthermore we prove that routers that are involved in packet spinning do not have the capacity to process requests for the creation of new circuits and thus users are forced to select our malicious nodes for routing their data streams.
Modeling Human Expertise on a Cheese Ripening Industrial Process Using GP
Authors: Olivier Barrière, Evelyne Lutton, Cedric Baudrit, Mariette Sicard, Bruno Pinaud, Nathalie Perrot
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Industrial agrifood processes often strongly rely on human expertise, expressed as know-how and control procedures based on subjective measurements (color, smell, texture), which are very difficult to capture and model. We deal in this paper with a cheese ripening process (of french Camembert), for which experimental data have been collected within a cheese ripening laboratory chain. A global and a monopopulation cooperative/coevolutive GP scheme (Parisian approach) have been developed in order to simulate phase prediction (i.e. a subjective estimation of human experts) from microbial proportions and Ph measurements. These two GP approaches are compared to Bayesian network modeling and simple multilinear learning algorithms. Preliminary results show the effectiveness and robustness of the Parisian GP approach.
EU Research in Software and Services: Activities and Priorities in FP7
Authors: Jesús Villasante
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Over the past years, Service-Oriented Architectures have become a paradigm in enterprises for enabling more efficient and flexible business processes and addressing some of the technological challenges posed by the service-based economy. Using loosely coupled services, they allow for discovery, composition and orchestration capabilities that are needed by end-users, business processes or other services. 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
Modeling time and topology for animation and visualization with examples on parametric geometry
Authors: K. E. Jordan, Lance E. Miller, E. L. F. Moore, T. J. Peters, Alexander Russell
Venue: Theoretical Computer Science (2008)

The art of animation relies upon modeling objects that change over time. A sequence of static images is displayed to produce an illusion of motion. Even for simple cases, a careful analysis exposes that formal topological guarantees are often lacking. This absence of rigor can result in subtle, but significant, topological flaws. A new modeling approach is proposed to integrate topological rigor with a continuous model of time. Examples will be given for Bezier curves, while indicating extensions to a richer class of parametric curves and surfaces. Applications to scientific visualization for molecular modeling are discussed. Prototype animations are available for viewing over the web.
Visual thesaurus: a product review
Authors: Sharon Worrell
Venue: ACM SIGCAS Computers and Society (2008)

I'm a self-confessed internet junkie, and I'm rarely surprised by anything that I find nowadays. But when I stumbled across the Visual Thesaurus (www.visualthesaurus.com) I have to admit that I was intrigued. I love to write for fun, but invariably end up using the same old words. I'm not a huge fan of the traditional Roget's Thesaurus -- I'm embarrassed to say how long it took me to master it, but it was more than a couple of years -- so I thought it would be fun to see connected words laid out in a more visual manner.
MAGE: A Grid Management System Based on Mobile Agent and Multi-Layered Architecture
Authors: Sungju Kwon, Eun-Ser Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

MAGE (Mobile Agent-based Grid Environment) is a monitoring system on Grid computing environment to provide a dynamically reconfigurable multi-layered architecture. With the growing requirement of computational power and hardware resources, Grid takes one of the major roles in several researches and many business areas. Grid computing has, recently, migrated to pervasive and ubiquitous computing with the advanced capabilities of mobile, lightweight, and thin devices. MAGE, an agent-based lightweight Grid application toolkit, consists of multi-hierarchical layers with dynamically configurable agents to achieve independence from various types of communication, message interpretation, and diverse actual tasks. Each element of application can be replaced with a new task without intervention of other tasks because an agent represents a service in MAGE. This paper describes various Grid design issues and advantages of MAGE.
Verified Process-Context Switch for C-Programmed Kernels
Authors: Artem Starostin, Alexandra Tsyban
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

A context switch -- an act of saving and restoring the state of a CPU such that multiple processes can share a single CPU resource -- is an essential feature of multitasking operating systems. Commonly computationally intensive and necessarily accessing hardware registers, context-switch procedures are implemented as inline assembly portions in C-programmed operating-system kernels. Feasible verification of operating systems is usually attempted in some kind of C semantics. However, seamless verification of kernels requires reasoning about context-switch routines in semantics of assembly language. At the end of the day, both semantics meet together in an overall correctness theorem of operating system. The task of formal integration of correctness results achieved on different semantical layers is challenging but inevitable for systems verification.The paper describes a formal approach to pervasive reasoning about interleaved computations of user processes and a C-programmed kernel. The interleaving is achieved by context-switch procedures implemented in inline assembly. We report on the correctness proof of the context-switch procedures and elaborate on our experience in formal integration of this result into the correctness proof of CVM, a verified framework for microkernel programmers.
On Developing Methods for XML Databases
Authors: William V. Do, Eric Pardede
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Although procedures and methods have been long established in Relational and Object-Relational DBMS, they have yet to make an appearance in XML Database. Currently no form of methods exists on XML DBMS, along with any syntactical approach to the problem. The direct translation of methods from relational tables to hierarchical data form is not possible. This paper addresses the issues of building XML Methods, their capability and limitations. For implementation, we use an open-source Native XML DBMS. A preliminary analysis is also provided to show the methods performance.
Seeing the Face and Observing the Actions: The Effects of Nonverbal Cues on Mediated Tutoring Dialogue
Authors: Federico Tajariol, Jean-Michel Adam, Michel Dubois
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Mediated communication technologies, conveying verbal and nonverbal cues, are more and more employed in learning activities. Nevertheless, their effects on teacher-student interaction have been not clearly stated yet. Through two experimental studies, we investigated on the effects of nonverbal communication cues (kinesic and ostensive-inferential) on synchronous mediated tutoring dialogue, in which a tutor and a student communicate through audio-video communication tools. The outcomes show that kinesic cues lead tutor to monitor more carefully learner's ongoing task and to encourage much more them, while ostensive-inferential cues improve learner's task performance and lead both tutor and student to focus better on tutoring speech acts.
Formal Languages: Origins and Directions
Authors: S. A. Greibach
Venue: IEEE Annals of the History of Computing (1981)

Origins of the theory of formal languages and automata are surveyed starting from 1936 with the work of Turing and Post. Special attention is given to the machine translation projects of the 1950s and early 1960s and associated work in mathematical linguistics. The development of the Chomsky hierarchy of grammars, machines, and languages from 1956 to 1964 is traced. It is observed that the same important ideas emerged independently for the automatic analysis and translation of both natural and artificial languages. Since 1964, formal language theory is part of theoretical computer science. A few of the directions since 1964 are considered: restrictions and extensions of context-free grammars and pushdown store automata, unifying frameworks, and complexity questions.
On Composite Service Optimization Across Distributed QoS Registries
Authors: Fei Li, Fangchun Yang, Kai Shuang, Sen Su
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Web service composition is a promising technology to effectively integrate distributed autonomous services in service oriented paradigm. When providing composite services, ensuring user experienced QoS (Quality of Service) in dynamic environment poses a great challenge. In this paper, we present a distributed service selection approach for optimizing composite service with complex structures. The approach does not require a centralized QoS registry to have complete composition logic, but runs on our distributed QoS architecture iteratively. Experimental results show that the approach is efficient and effective for our problem.