ppxscal/embedding_network huggingface dataset:
Encoding a process algebra using the Event B method: Application to the validation of human&#x2013;computer interactions
Authors: Yamine Ait-Ameur, Mickael Baron, Nadjet Kamel, Jean-Marc Mota
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2009)

This paper presents the use of the B technique in its event based definition. We show that it is possible to encode, using Event B, the models (i.e., transition systems) associated to a process algebra with asynchronous semantics. The obtained Event B models consider that the Event B model associated to the left hand side of a BNF rule defining the algebra expressions is refined by a model corresponding to the right hand side of the same rule. The translation rules of each operator of a basic process algebra are given. Then, an example illustrating each translation rule is given. This approach is based on a proof technique and therefore it does not suffer from the state number explosion problem occurring in classical model checking. The interest of this work is the capability to validate user tasks or scenarios when using a given system and particularly a critical system. Finally, we discuss the application of this approach for validating user interfaces tasks in the human&#x2013;computer interaction area.
Applying Processes Rescheduling over Irregular BSP Application
Authors: Rodrigo Rosa Righi, Laércio Lima Pilla, Alexandre Silva Carissimi, Philippe O. Navaux, Hans-Ulrich Heiss
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

This paper shows an evaluation of processes rescheduling over an irregular BSP (Bulk Synchronous Parallel) application. Such application is based on dynamic programming and its irregularity is presented through the variation of computation density along the matrix' cells. We are using MigBSP model for processes rescheduling, which combines multiple metrics - Computation, Communication and Memory - to decide about processes migration. The main contribution of this paper includes the viability to use processes migration on irregular BSP applications. Instead to adjust the load of each process by hand, we presented that automatic processes rebalancing is an effortless technique to obtain performance. The results showed gains greater than 10% over our multi-cluster architecture. Moreover, an acceptable overhead from MigBSP was observed when no migrations happen during application execution. 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
Discovering System Dynamics in Software Engineering: Foundations for the Software Learning Organization
Authors: James D. Hart
Venue:  (2008)

The software community is undergoing unprecedented rates of change today. The most successful software companies must learn to adapt quickly to changing environments. Our current "mechanistic" worldview, the basis for most of our software development processes, is no longer adequate. In Discovering System Dynamics in Software Engineering, Jim Hart articulates a different worldview, where software leaders and managers see their companies as dynamic, interconnected living systems. With nearly 100 figures, dozens of real-world software engineering situations, and two chapters dedicated to illustrating a detailed method, the author explains step-by-step how to apply causal loop diagramming to solve complex, persistent problems in today's software companies that seem unsolvable using traditional techniques. The many exercises and "Further Reading" sections encourage individuals and groups to further cultivate their collaborative systems thinking skills. 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
A framework for synthetic stego
Authors: Philip Ritchey, Jorge R. Ramos, Vernon Rego
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

We present a technique for hiding information in stochastic settings via data-synthesizing schemes based on transform-expand-sample (Tes) processes. The technique is applicable whenever data generated by an application or process is sufficiently complex to exhibit random but structured behavior (such as in collective data transforms), and data trajectories have viable alternatives that are unverifiable or simply hard to verify. In such cases, a synthesizing procedure generates novel data that either actually replaces, or is generated instead of, application or process data. When information can be hidden in such data at levels higher than typical levels of noise, message-neutralizing attacks will fail; and if synthetic data, stego data and application/process data cannot be distinguished, secure stego transmissions can be launched. An information-theoretic model shows that such hiding techniques are arbitrarily secure. We present some experimental results.
Automated tracking in digitized videofluoroscopy sequences for spine kinematic analysis
Authors: Shing Chun Benny Lam, Brendan McCane, Robert Allen
Venue: Image and Vision Computing (2009)

Spine kinematic analysis provides useful information to aid understanding of the segmental motion of the vertebrae. Digitized videofluoroscopy (DVF) is the existing practical modality to image spine motion for kinematic data acquisition. However, obtaining kinematic parameters from DVF sequence requires manual landmarking which is a laborious process and can be subjective and error prone. This work develops an automated spine motion tracking algorithm for DVF sequences within a Bayesian framework. By utilizing the anatomical relationships between vertebrae, a dynamic Bayesian network with a particle filter at each node is constructed. The proposed algorithm overcomes the dimensionality problem in a regular particle filter and has more efficient and robust performance. It can provide results of about 1^o and 2pixels (0.2mm) variability in rotation and translation estimation, respectively, during repeated initialization analysis on sequences from simulation and in vivo healthy human subject studies.
Self-stabilizing robot formations over unreliable networks
Authors: Seth Gilbert, Nancy Lynch, Sayan Mitra, Tina Nolte
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2009)

We describe how a set of mobile robots can arrange themselves on any specified curve on the plane in the presence of dynamic changes both in the underlying ad hoc network and in the set of participating robots. Our strategy is for the mobile robots to implement a self-stabilizing virtual layer consisting of mobile client nodes, stationary Virtual Nodes (VNs), and local broadcast communication. The VNs are associated with predetermined regions in the plane and coordinate among themselves to distribute the client nodes relatively uniformly among the VNs' regions. Each VN directs its local client nodes to align themselves on the local portion of the target curve. The resulting motion coordination protocol is self-stabilizing, in that each robot can begin the execution in any arbitrary state and at any arbitrary location in the plane. In addition, self-stabilization ensures that the robots can adapt to changes in the desired target formation.
On compressing social networks
Authors: Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be compressed. Boldi and Vigna (WWW 2004), showed that Web graphs can be compressed down to three bits of storage per edge; we study the compressibility of social networks where again adjacency queries are a fundamental primitive. To this end, we propose simple combinatorial formulations that encapsulate efficient compressibility of graphs. We show that some of the problems are NP-hard yet admit effective heuristics, some of which can exploit properties of social networks such as link reciprocity. Our extensive experiments show that social networks and the Web graph exhibit vastly different compressibility characteristics.
Integrating organizational control into multi-agent learning
Authors: Chongjie Zhang, Sherief Abdallah, Victor Lesser
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Multi-Agent Reinforcement Learning (MARL) algorithms suffer from slow convergence and even divergence, especially in large-scale systems. In this work, we develop an organization-based control framework to speed up the convergence of MARL algorithms in a network of agents. Our framework defines a multi-level organizational structure for automated supervision and a communication protocol for exchanging information between lower-level agents and higher-level supervising agents. The abstracted states of lower-level agents travel upwards so that higher-level supervising agents generate a broader view of the state of the network. This broader view is used in creating supervisory information which is passed down the hierarchy. The supervisory policy adaptation then integrates supervisory information into existing MARL algorithms, guiding agents' exploration of their state-action space. The generality of our framework is verified by its applications on different domains (distributed task allocation and network routing) with different MARL algorithms. Experimental results show that our framework improves both the speed and likelihood of MARL convergence.
Fourier Domain Scoring with Document Structure Consideration
Authors: Daniel Dusinski, Piotr S. Szczepaniak
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Recently, Fourier and cosine discrete transformations have been proposed for textual document retrieval and ranking. The advantage of those methods is that they use spatial information about flow of terms through documents. Here, we investigate the question if consideration of important document elements like titles, sections, sentences, etc. improves efficiency the original Fourier domain scoring method.
English Composition and Learning Support System Using a Search Engine
Authors: Yuichi Tsunashima, Yuta Kawasaki, Kazuaki Ando
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

This paper proposes a support system for English composition and learning using a search engine. The proposed system constructs queries automatically from an entered expression. It provides tables and graphs based on hit counts of those queries, and usage of the expression based on user's English level. The system also constructs a learning support function based on user's search log. The user can search example sentences on the Web and verify sentences and expressions that the user wrote, and learn English effectively.
An Adaptive Channel Handoff Strategy for Opportunistic Spectrum Sharing in Cognitive Global Control Plane Architecture
Authors: Zhiming Xu, Yu Wang, Jingguo Zhu, Jian Tang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

In the cognitive wireless networks, the channel handoff strategy which controls the communication in a channel to migrate to another channel when primary users hope to access directly affects the quality-of-service of cognitive users and primary users. In this paper, we propose a Cognitive Global Control Plane (CGCP) which embraces the controlling of spectrum sensing, channel handoff and node mobility. With the CGCP architecture, an adaptive channel handoff strategy is given out. We analyze the handoff algorithm with Markov chain theory and some tradeoffs between performance and overhead. The results of performance evaluation show that the channel handoff strategy can adaptively and flexibly perform channel handoff.
Electrical study of sulfur passivated In0.53Ga0.47As MOS capacitor and transistor with ALD Al2O3 as gate insulator
Authors: Han-Chung Lin, Wei-E. Wang, Guy Brammertz, Marc Meuris, Marc Heyns
Venue: Microelectronic Engineering (2009)

In this paper we compare the interface trap distributions D"i"t(E) of sulfur treated Al"2O"3/In"0"."5"3Ga"0"."4"7As interfaces, which underwent MOS capacitor and transistor fabrication processes. Lower interface trap densities were found close to the conduction band edge for both cases. The inversion channel MOSFET achieves high device performance despite the fact that its oxide-semiconductor interface quality is a notch below that of the MOS capacitor with optimized process.
FPGA: what's in it for a database?
Authors: Rene Mueller, Jens Teubner
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increasing number of different cores (we already see dedicated units for graphics or network processing). Orchestrating the diversity of processing functionality is going to be a major challenge in the upcoming years, be it to optimize for performance or for minimal energy consumption. We expect field-programmable gate arrays (FPGAs or "programmable hardware") to soon play the role of yet another processing unit, found in commodity computers. It is clear that the new resource is going to be too precious to be ignored by database systems, but it is unclear how FPGAs could be integrated into a DBMS. With a focus on database use, this tutorial introduces into the emerging technology, demonstrates its potential, but also pinpoints some challenges that need to be addressed before FPGA-accelerated database systems can go mainstream. Attendees will gain an intuition of an FPGA development cycle, receive guidelines for a "good" FPGA design, but also learn the limitations that hardware-implemented database processing faces. Our more high-level ambition is to spur a broader interest in database processing on novel hardware technology.
The fuzzy-interpolative adaptive controllers
Authors: Marius M. Balas, Valentina E. Balas, Nikos E. Mastorakis
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

We can consider the general system theory and the specific knowledge on the controlled processes as world knowledge for controllers. The fuzzy-interpolative methodology is able to embed such world knowledge into low level control devices (µC, DSP, ASIC, etc.). In some previous papers we presented an adaptive architecture (FSAIC) that is using a fuzzy-interpolative adaptive corrector able to identify the current operating regime by means of a qualitative analyze of the phase trajectory of the error. In this paper we are simplifying the approach and use the fuzzy-interpolative technique in order to build a self-adjusting PID controller.
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach
Authors: Eugénie Foustoucos, Labrini Kalantzi
Venue: Fundamenta Informaticae (2009)

We model the monadic second-order logic (MSO) evaluation problem on finite colored trees in a purely database theoretic framework, based on the well-knownMSO-automata connection: we reduce the problem to an acyclic conjunctive query evaluation problem on the one hand and to a monadic datalog evaluation problem on the other hand. This approach offers the possibility to solve the MSO problem using optimized evaluation methods for relational algebra expressions and for datalog programs (such as Yannakakis algorithm [27] and the rewriting method using resolutionbased filtering referred to as "magic sets" method in [3]): we use these methods for evaluating our queries and giving estimates of their complexity. This is the first time, to our knowledge, that a solution to the MSO evaluation problem related to relational algebra is given; furthermore, thanks to this reduction, we prove that the automata-based algorithm given in [8] constitutes a particular "instance" of Yannakakis algorithm. Besides the optimized database methods that we propose for solving the MSO evaluation problem, our results prove that MSO-definable queries over colored trees are datalog-definable; this result subsumes the corresponding result in [12] which states that unary MSO queries are monadic datalog-definable and it also subsumes the well-known result that any MSO-definable class of trees is monadic datalog-definable.
On-Body Sensing Solutions for Automatic Dietary Monitoring
Authors: Oliver Amft, Gerhard Tröster
Venue: IEEE Pervasive Computing (2009)

Automatic dietary monitoring uses sensors to recognize eating behavior, offering vital, continuous infor mation about a user's food intake. Using this information, administrators can adapt and personalize weight and diet coach ing programs. The data can also inform nutrition research on diet and eating behaviors.
The Digital Photographer's Guide to Filters: The Complete Guide to Hardware and Software Filtration
Authors: Ross Hoddinott
Venue:  (2007)

Digital photography has changed the art of filtering forever - no longer is it just a matter of in-camera technique, but now encompasses a wide range of manipulations in the digital darkroom. In this comprehensive guide for the modern photographer, Ross Hoddinott explains when and how to use traditional hardware filters on your camera and how to achieve the same effects with software instead - as well as a wealth of other digital filter-effects that were impracticable or impossible on film. This book provides an up-to-the-moment guide to all photographic filtering issues and is beautifully illustrated with Ross Hoddinott's superb digital pictures. 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
Lotus Notes Domino 8: Upgrader's Guide What's new in the latest Lotus Notes Domino Platform
Authors: Tim Speed, Dick McCarrick, Bennie Gibson, Brad Schauf, Joseph Anderson, David Byrd, Barry Rosen
Venue:  (2007)

Lotus Notes is an integrated desktop client option for accessing business email, calendars, and applications on a Lotus Domino server. Domino is an application server that can be used as a standalone web server or as the server component of IBM's Lotus Domino product, which provides a powerful collaborative platform for development of customized business applications. It also provides enterprise-grade email, messaging, and scheduling capabilities. The Lotus Notes powerhouse has been part of the corporate application and messaging architecture for more than 20 years and, over the years, Lotus Notes has come to signify the essence of electronic business communications. With Lotus Notes 8, IBM has once again provided the user with an intuitive, fully integrated platform to enhance each user's experience with business communications. It is no longer just an email tool, but a basis to extend business communications to a new level. This book reviews the current release of the powerful Lotus Notes and Domino architecture platform. "Written by some of the senior architects and specialists of IBM Software Services for Lotus, this book will provide you with an excellent guide to help you realize the value of your investment in Lotus Notes 8. You will learn how to leverage the full capabilities of Lotus Notes 8 and how to quickly move from your existing technology base to this new, feature-rich platform. The authors explore the enhanced productivity tools available with this release, integrating word processing, presentations, and spreadsheets into a seamless unit with your messaging and collaboration solution." "Developers are not forgotten, as new features and tools are revealed. You will delve into the world of SOA, as the authors show you how Lotus Notes can be part of an SOA strategy that can accelerate your business integration and generate value. The book finishes with a few words about other Lotus products, such as Lotus Sametime, Lotus Quickr, Lotus Connections, and IBM WebSphere Portal--like IBM Lotus Notes, all built on the open-standards-based Eclipse Rich Client Platform (RCP) technology. These products are all converging to become the next generation of people productivity solutions." [Taken from the foreword of the book, written by Mark J. Guerinot, Director, Americas IBM Software Services for Lotus (ISSL)]
Measurement of the detection thresholds of hair on human hairy skin using direct vibrotactile stimulation
Authors: Masahiro Furukawa, Naohisa Nagaya, Yuki Hashimoto, Hiroyuki Kajimoto, Masahiko Inami
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

This paper reports the detection threshold of human hairy skin with the use of a direct vibrotactile stimulus to the hair on human hairy skin. We designed an experimental method to quantify the psychological effect and developed a stimulation instrument to directly stimulate the hair. This vibrotactile stimulation was provided from the tip of tweezers which traveled horizontally against the human skin. The stimulation point was the approximate middle region of the hair on the middle finger. A psychological experiment was conducted based on the hypothesis that a frequency characteristic exists on hairy skin with direct stimulus to the hair. As a result, a significant difference between frequencies was not obtained with ANOVA. The dispersion in the range of low frequency range (25 to 80 Hz) indicates the distribution density of the mechanical receptor. The threshold curve indicates that the distribution density of the tactile meniscus cell can be attributed to the range of low-frequency, and hair follicle receptors (RA) can be attributed to the high-frequency portion.
GeoComputation 2009
Authors: Yong Xue, Forrest M. Hoffman, Dingsheng Liu
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

The tremendous computing requirements of today's algorithms and the high costs of high-performance supercomputers drive us to share computing resources. The emerging computational Grid technologies are expected to make feasible the creation of a computational environment handling many PetaBytes of distributed data, tens of thousands of heterogeneous computing resources, and thousands of simultaneous users from multiple research institutions (Giovanni et al. 2003).
Combination of interval-valued fuzzy set and soft set
Authors: Xibei Yang, Tsau Young Lin, Jingyu Yang, Yan Li, Dongjun Yu
Venue: Computers Mathematics with Applications (2009)

The soft set theory, proposed by Molodtsov, can be used as a general mathematical tool for dealing with uncertainty. By combining the interval-valued fuzzy set and soft set models, the purpose of this paper is to introduce the concept of the interval-valued fuzzy soft set. The complement, ''AND'' and ''OR'' operations are defined on the interval-valued fuzzy soft sets. The DeMorgan's, associative and distribution laws of the interval-valued fuzzy soft sets are then proved. Finally, a decision problem is analyzed by the interval-valued fuzzy soft set. Some numerical examples are employed to substantiate the conceptual arguments.