ppxscal/embedding_network huggingface dataset:
Marginal likelihoods for non-Gaussian models using auxiliary mixture sampling
Authors: Sylvia Frühwirth-Schnatter, Helga Wagner
Venue: Computational Statistics Data Analysis (2008)

Several new estimators of the marginal likelihood for complex non-Gaussian models are developed. These estimators make use of the output of auxiliary mixture sampling for count data and for binary and multinomial data. One of these estimators is based on combining Chib's estimator with data augmentation as in auxiliary mixture sampling, while the other estimators are importance sampling and bridge sampling based on constructing an unsupervised importance density from the output of auxiliary mixture sampling. These estimators are applied to a logit regression model, to a Poisson regression model, to a binomial model with random intercept, as well as to state space modeling of count data.
Current Status and Future Perspectives for Unmanned Aircraft System Operations in the US
Authors: K. Dalamagkidis, K. P. Valavanis, L. A. Piegl
Venue: Journal of Intelligent and Robotic Systems (2008)

An aircraft (manned aircraft) may enter safely and legally into the US National Airspace System if and only if it has an airworthiness certificate complying with Federal Aviation Administration requirements. Although corresponding requirements, procedures and regulations for unmanned aircraft are in early development stages, they are expected to be similar to those set for manned aviation. This paper presents a brief overview of current airworthiness certification procedures and requirements for manned aviation, followed by a survey of the current status of Unmanned Aircraft System (UAS) regulations in the US but also internationally. Future perspectives of UAS regulation are discussed along with a proposed UAS classification for certification purposes, presentation of a possible certification roadmap, as well as regulatory paths for ultra-light UAS.
Development of a new porous pin chuck for lithography
Authors: A. Une, K. Yoshitomi, M. Mochida
Venue: Microelectronic Engineering (2008)

The feature size for next-generation devices is decreasing and edge exclusion widths are becoming stricter, decreasing from 2 to 1.5mm. The development of a new porous pin chuck is thus necessary for flattening large wafers, including the periphery, which has small and extremely low pins. A reverse production process from the conventional method was adopted to form pins after careful polishing of the chuck surface. It is now possible to both measure and achieve a high level of flatness for pin chucks, while reducing vacuum leakage. Average pin heights were 33@mm in the suction region and 5@mm in the static-pressure seal. The uniformity of pin heights in the seal was improved compared with the conventional static-pressure-seal pin chuck. In addition, the contact ratio between the back surface of a wafer and the pin tops was reduced to 25% that of conventional static-pressure-seal pin chucks by using pins with smaller diameters and porous material.
Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph
Authors: S. Khuller, S. G. Mitchell, V. V. Vazirani
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Given a graph G and two pairs of vertices s/sub 1/, t/sub 1/ and s/sub 2/, t/sub 2/, the two disjoint paths problem asks for vertex-disjoint paths connecting s/sub i/ with t/sub i/, i=1, 2. A fast parallel (NC) algorithm is given for this problem, which has applications in certain routing situations. If G is nonplanar, an algorithm that finds a Kuratowski homeomorph in G (i.e. a subgraph homeomorphic to K/sub 3.3/ or K/sub 5/) is given. This complements the known NC planarity algorithms, which give a planar embedding in the positive case; the algorithm provides a certificate of nonplanarity in the negative case. Both algorithms are processor efficient; in each case, the processor-time product is within a polylogarithmic factor of the best known sequential algorithm.
Multi MicroBlaze system for parallel computing
Authors: P. Huerta, J. Castillo, J. I. Mártinez, V. López
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Embedded systems need more computational power to satisfy today's applications' needs, like audio/video encoding/decoding, image processing, etc. An option for increasing the computational power of a system is to include various microprocessors and make them work in parallel. This paper presents a study of the viability of making a multiprocessor system on a chip (MPSoC) using the MicroBlaze soft-processor core from Xilinx. Performance of data communication is studied, and also a parallel application is used for testing speedup and efficiency of the system.
Comparing state machines
Authors: Udo Kelter, Maik Schmidt
Venue: Proceedings of the 2008 international workshop on Comparison and versioning of software models (2008)

State machines and similar state models are heavily used model types in model-driven development. This paper discusses how state models can be compared, more precisely how the difference between two state models should be defined, how it can be efficiently computed, and how it can be displayed. Some of the issues result from an inappropriate design of the UML metamodels and can be solved by switching to a more appropriate metamodel. Another issue are move operations, which raise the question how to optimize a difference. We argue in favour of simple heuristics and the interactive correction of a difference.
Dynamic proportion portfolio insurance using genetic programming with principal component analysis
Authors: Jiah-Shing Chen, Chia-Lan Chang, Jia-Li Hou, Yao-Tang Lin
Venue: Expert Systems with Applications: An International Journal (2008)

This paper proposes a dynamic proportion portfolio insurance (DPPI) strategy based on the popular constant proportion portfolio insurance (CPPI) strategy. The constant multiplier in CPPI is generally regarded as the risk multiplier. Since the market changes constantly, we think that the risk multiplier should change according to market conditions. This research identifies risk variables relating to market conditions. These risk variables are used to build the equation tree for the risk multiplier by genetic programming. Experimental results show that our DPPI strategy is more profitable than traditional CPPI strategy. In addition, principal component analysis of the risk variables in equation trees indicates that among all the risk variables, risk-free interest rate influences the risk multiplier most.
WS-BPEL Process Compiler for Resource-Constrained Embedded Systems
Authors: Hendrik Bohn, Andreas Bobek, Frank Golatowski
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Process management and workflow systems play an important role in the composition of services in business as well as automation environments. Processes are designed using tools and deployed on a process management engine which control their execution. Unfortunately, the extensive requirements of process management engines on the underlying hard- and software often exceeds the limits of the resources of embedded systems in terms of memory and processing power. This paper proposes an approach of compiling processes to executable programs with very small footprints which can also be run on embedded systems with limited resources. This approach uses the WS-BPEL 2.0 specification for designing the process, XSL transformation and the Apache Axis2 Java architecture for the code generation being flexible and adaptable to future extensions and enhancements of WS-BPEL.
A New Method for Active Noise Cancellation in the Presence of Three Unknown Moving Sources
Authors: Mohammad Abdollahpouri, Ali Khaki-Sedigh, Hamid Khaloozadeh
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper introduces a new scheme for building a clean room with no unwanted sound in it. Resent efforts for building such rooms always encounter problems because of the stochastic nature of these systems. A real clean room not only faces some non-moving sources, but also faces some moving ones, that probably the sound source is a moving one in reality. In order to solve the problem of motion of those moving sources, one must design a method to solve this problem which we definitely encounter with. Active noise cancellation needs the direction of transmission of the unwanted sound in order to reduce its effect. Hence, these rooms need an identifier, which we suggest a clean room identification algorithm in this paper. Recent efforts for building these kind of room, always suppose the non-moving sound sources which we may encounter a moving one in every day life. The other problem is the mutual effect of each source on the other microphones. Those non-moving sources just cause mutual effect on all microphones and compel us using a separator. Therefore, these systems need a separator, which we use BSS algorithms in order to reach this aim. Finally, simulation results are provided to illustrate the main points.
Load-driven neighbourhood reconfiguration of Gnutella overlay
Authors: Evangelos Pournaras, Georgios Exarchakos, Nick Antonopoulos
Venue: Computer Communications (2008)

Unstructured P2P networks support distributed applications whose workload may vary significantly over time and between nodes. Self-optimizing systems try to keep the load in the network balanced despite the frequent load fluctuations. Several P2P systems exhibit a number of related features but fail to avoid centralisation under high-load situations. ERGO aims to balance the overloaded nodes by rewiring some of their incoming links to underloaded ones via a set of interconnected servers which index the underloaded nodes. In two simulated environments, ERGO load-balancing on Gnutella network increases the balanced nodes and network availability by preserving its efficiency and even reducing its messages.
Avoiding Policy-based Deadlocks in Business Processes
Authors: Mathias Kohler, Andreas Schaad
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In the field of business process management, deadlocks describe a situation where a workflow execution is blocked and cannot be completed. We speak of policy-based deadlocks if such a situation is caused by unsatisfiable resource requirements due to security constraints specified as part of the business process. In this paper we propose a method to avoid policy-based deadlocks by analyzing a workflow's security constraints, determine the minimal required number of users, and provide an optimal user-activity assignment for a deadlock-free workflow execution. We will finally validate our proposed approach by applying it to a real-world scenario.
Verifying really complex systems: on earth and beyond
Authors: Andreas Kuehlmann, Anjan Bose, David E. Corman, Rob A. Rutenbar, Robert M. Manning, Anna Newman
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Functional verification is a major part of the effort to design electronic systems. Over the years, EDA has developed a suite of tools and methods to address the verification challenges by a patchwork of approaches. However, as the system complexity continues to increase, traditional methods may not be adequate to ensure flawless behavior. In this educational panel, we will explore how complex systems are validated in other areas. Four speakers will cover the verification challenges in airplane design, complex Mars exploration missions, modeling and rendering of movie animations, and the design of continent-wide national power grids. Using real-life examples, each speaker will introduce the general topic, outline the specific verification challenges, and discuss how they are approached in their specific domain. The following discussion will analyze commonalities and differences between the areas and explore lessons to be learned from them for EDA.
A new current-mode current-controlled current-conveyor based universal filter
Authors: M. T. Abuelma'atti, A. Bentrcia, M. K. Al-Absi, S. M. Al-Shahrani
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A new mixed-mode biquad circuit is presented. The circuit uses six second-generation current-controlled current-conveyors (CCIIs), and two grounded capacitors and can realize lowpass, highpass, bandpass, notch, lowpass notch, highpass notch and allpass responses from the same topology. The low-pass gain, high-pass gain, bandpass gain and the parameters ω0 and ω0/Q0 enjoy orthogonal electronic tunability. Simulation results are included.
Gait alignment in mobile phone conversations
Authors: Roderick Murray-Smith, Andrew Ramsay, Simon Garrod, Melissa Jackson, Bojan Musizza
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Conversation partners on mobile phones can align their walking gait without physical proximity or visual feedback. We investigate gait synchronization, measured by accelerometers while users converse via mobile phones. Hilbert transforms are used to infer gait phase angle, and techniques from synchronization theory are used to infer level of alignment. Experimental conditions include the use of vibrotactile feedback to make one conversation partner aware of the other's footsteps. Three modes of interaction are tested: reading a script, discussing a shared image and spontaneous conversation. The vibrotactile feedback loop on its own is sufficient to create synchronization, but there are complex interference effects when users converse spontaneously. Even without vibration crosstalk, synchronisation appeared for long periods in the spontaneous speech condition, indicating that users were aligning their walking behaviour from audible cues alone.
Computing the Fréchet distance between simple polygons
Authors: Kevin Buchin, Maike Buchin, Carola Wenk
Venue: Computational Geometry: Theory and Applications (2008)

We present the first polynomial-time algorithm for computing the Frechet distance for a non-trivial class of surfaces: simple polygons, i.e., the area enclosed by closed simple polygonal curves, which may lie in different planes. For this, we show that we can restrict the set of maps realizing the Frechet distance, and develop an algorithm for computing the Frechet distance using the algorithm for curves, techniques for computing shortest paths in a simple polygon, and dynamic programming.
A Parallel Algorithm for Closed Cube Computation
Authors: Jinguo You, Jianqing Xi, Pingjian Zhang, Hu Chen
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Closed cubing is a very efficient algorithm for data cube compression proposed recently in the literature. It losslessly condenses a group of cells into one cell if these cells have the same aggregate value and preserve roll-up/drill-down semantics. Despite its importance, parallel closed cubing solutions for huge data sets are not well studied so far to the best of the authors’ knowledge. This paper presents a parallel closed cube construction and query algorithm over low cost PC clusters using the MapReduce framework. In addition, we proved that with the number of data blocks increases, the closed cubes’ storage size decreases gradually. Thus users can specify the number of data blocks to balance the performance between cubes storage and query time. Experimental study demonstrates that our algorithm is efficient and scalable.
On illegal composition of first-class agent interaction protocols
Authors: Tim Miller, Peter McBurney
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

In this paper, we examine the composition of first-class protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agents use at runtime to acquire the rules of the protocol. This is in contrast to the standard approach of hard-coding interaction protocols directly into agents --- an approach that seems too restrictive for many intelligent and adaptive agents. In previous work, we have proposed a framework called RASA, which regards protocols as first-class entities. RASA includes a formal, executable language for multi-agent protocol specification, which, in addition to specifying the order of messages using a process algebra, also allows designers to specify the rules and consequences of protocols using constraints. Rather than having hard-coded decision making mechanisms for choosing their next move, agents can inspect the protocol specification at runtime to do so. Such an approach would allow the agents to compose protocols at runtime, instead of relying on statically designed protocols. In this paper, we investigate the implications of protocol composition by examining the conditions under which composing existing legal protocols would lead to illegal protocols --- that is, protocols that can fail during execution through no fault of the participants. We precisely define what constitutes an illegal protocol, and present proof obligations about compositions that, when discharged, demonstrate that a composition is legal.
Augmented Learning: Research and Design of Mobile Educational Games
Authors: Eric Klopfer
Venue:  (2008)

New technology has brought with it new tools for learning, and research has shown that the educational potential of video games resonates with scholars, teachers, and students alike. In Augmented Learning, Eric Klopfer describes the largely untapped potential of mobile learning games--games played on such handheld devices as cell phones, Game Boys, and Sony PSPs--to make a substantial impact on learning. Examining mobile games from both educational and gaming perspectives, Klopfer argues that the strengths of the mobile platform--its portability, context sensitivity, connectivity, and ubiquity--make it ideal for learning games in elementary, secondary, university, and lifelong education. Klopfer begins by exploring the past and present of education, educational technology, "edutainment," and mobile games, and then offers a series of case studies of mobile educational games that have been developed and implemented in recent years. These games--either participatory (which require interaction with other players) or augmented reality (which augment the real world with virtual information)--can be produced at lower cost than PC or full-size console games. They use social dynamics and real-world contexts to enhance game play, can be integrated into the natural flow of instruction more easily than their big-screen counterparts, and can create compelling educational and engaging environments for learners. They are especially well-suited for helping learners at every level develop twenty-first century skills--including the ability to tackle complex problems and acquire information in "just-in-time" fashion. All of this, Klopfer argues, puts mobile learning games in a unique and powerful position within educational technology.
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
Authors: Kimmo Fredriksson, Szymon Grabowski
Venue: Information Retrieval (2008)

We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p 0 g(a 0,b 0)p 1 g(a 1,b 1)¿p m¿1, where p i ¿ Σ, Σ is some finite alphabet, and g(a i ,b i ) denotes a gap of length a i ¿b i between symbols p i and p i+1. The text symbol t j matches p i iff t j ¿ p i . Moreover, we require that if p i matches t j , then p i+1 should match one of the text symbols $$ t_{j+a_i+1} \ldots t_{j+b_i+1}.$$ Either or both of a i and b i can be negative. We also consider transposition invariant matching, i.e., the matching condition becomes t j ¿ p i + ¿, for some constant ¿ determined by the algorithms. We give algorithms that have efficient average and worst case running times. The algorithms have important applications in music information retrieval and computational biology. We give experimental results showing that the algorithms work well in practice.
State-of-the-Art in Volterra Series Modeling for ADC Nonlinearity
Authors: Hu Xiao, Ma Hong, Peng Juan, Tian Chen
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

The Volterra series behavioral approach has been largely applied in recent years for modeling of nonlinear dynamic systems. Only recently it was used to mathematically model time-invariable systems such as analog to digital devices (ADCs). In this paper, the Volterra series modeling methods for ADC nonlinearity are briefly introduced according to a classification criterion based on the main research trends. And also we indicate that the adaptive Volterra identification, combination Volterra series with Hammerstein and Wiener models is the fashion of modeling ADCs, and besides those trending, the inverse adaptive Volterra model will be widely used in ADC nonlinear error calibration.
A Novel Handover Scheme Based on Adaptive Agent for Reducing Real-Time Communication Latency in Automation Environment
Authors: Jamal Raiyn
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Delay and Interference are considered as the main reasons limiting the capacity and increasing the handover call blocking probability in cellular systems. The probability of handover failure is considered a common criterion for performance evaluation of handovers in cellular systems. Reducing the latency in the handover process is considered a major challenge in WLAN. For real-time communication and automation very low latency is needed. To reduce the latency in the handover process, we introduce a new handover scheme based on adaptive agents. Furthermore, in this paper we discuss and analyze handover managements in cellular systems.
Towards Reliable Trust Management based on Structural Trust Scopes of Distributed Roles
Authors: Gang Yin, Ning Zhou, Huaimin Wang
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Role based trust management uses distributed role hierarchies (DRH) to provide flexible and scalable authorization in multi-domain environments, but DRHare inherently transitive and may easily lead to unexpected or even illegal authorization. In this paper, we propose TS-DRH, a generalized extension of DRH based on a novel trust scope model of distributed roles. TS-DRH introduces the notion of scoped roles with four kinds of structural trust scopes, and uses scoped roles to control the member scopes of senior roles and the permission scopes of junior roles, and thus helps to control the propagation of role memberships and permissions in DRH. This paper also designs rule based semantics and a compliance checking algorithm to compute authorization decisions for TS-DRH.