ppxscal/embedding_network huggingface dataset:
BICA: A Boolean Indepenedent Component Analysis Approach
Authors: Bruno Apolloni, Simone Bassis, Andrea Brega
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

We analyze the potentialities of an approach to represent general data records through Boolean vectors in the philosophy of ICA. We envisage these vectors at an intermediate step of a clustering procedure aimed at taking decisions from data. With a "divide et conquer" strategy we first look for a suitable representation of the data and then assign them to clusters. We assume a Boolean coding to be a proper representation of the input of the discrete function computing assignments. We demand the following of this coding: to preserve most information so as to prove appropriate independently of the particular clustering task; to be concise, in order to get understandable assignment rules; and to be sufficiently random, to prime statistical classification methods. In the paper we toss these properties in terms of entropic features and connectionist procedures, whose validation is checked on a series of benchmarks.
Convertible Authenticated Encryption Scheme Without Using Conventional One-Way Function
Authors: Hung-Yu Chien
Venue: Informatica (2003)

An authenticated encryption allows the designated recipient to verify the authenticity while recovering the message. To protect the recipient's benefit in case of a later dispute, a convertible authenticated encryption scheme allows the recipient to convert the authenticated encryption into an ordinary signature so that it becomes a publicly verifiable. This paper shows a universal forgery attack on Araki et al.'s convertible authenticated encryption scheme, and proposes a new convertible authenticated encryption scheme. Without using any conventional one-way function, the proposed scheme simplifies its security assumption on only a public hard problem - the discrete logarithm problem.
Parameter Synthesis for Piecewise Affine Systems from Temporal Logic Specifications
Authors: Boyan Yordanov, Calin Belta
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In this paper, we consider discrete-time continuous-space Piecewise Affine (PWA) systems with parameter uncertainties, and study temporal logic properties of their trajectories. Specifically, given a PWA system with polytopal parameter uncertainties, and a Linear Temporal Logic (LTL) formula over linear predicates in the states of the system, we attempt to find subsets of parameters guaranteeing the satisfaction of the formula by all trajectories of the system. We illustrate our method by applying it to a PWA model of a two-gene network.
Part-of-Speech Tagging Based on Machine Translation Techniques
Authors: Guillem Gascó I Mora, Joan Andreu Sánchez Peiró
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

In this paper, a new approach to the Part-of-Speech (PoS) tagging problem is proposed. The PoS tagging problem can be viewed as a special translation process where the source language is the set of strings being considered and the target language is the sequence of POS tags. In this work, we have used phrase-based machine translation technology to tackle the PoS tagging problem. Experiments on the Penn Treebank WSJ task were carried out and very good results were obtained.
A Data-Aggregation Algorithm Based on Adaptive Ant Colony System in Wireless Sensor Networks
Authors: Zhiyu Li, Haoshan Shi
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Data aggregation is an essential paradigm for energy efficient routing in energy constraint wireless sensor networks (WSN). Data aggregation in WSN can be treated as searching for the Minimum Steiner Tree (MST) including source nodes and sink node. In this paper, we propose a Data-aggregation Algorithm based on Adaptive Ant Colony System (AACS) algorithm. In this algorithm, Directed Diffusion (DD) is used to deliver interest message, and AACS algorithm is used to construct MST. The data sent by the source nodes is transmitted to the constructed MST and then is retransmitted to the sink node after aggregation. Compared with Destination Driven Shortest Path (DDSP) algorithm, NS2 simulation result shows that this algorithm can help reduce network energy consumption and prolong the life span of the network.
Heuristic methods to use don't cares in automated design of reversible and quantum logic circuits
Authors: Majid Mohammadi, Mohammad Eshghi
Venue: Quantum Information Processing (2008)

This paper introduces a broad concept of don't cares in reversible and quantum logic circuits. Don't cares are classified into three categories: inputs, outputs, and conditions. Some heuristic methods to use these don't cares, when an optimization algorithm such as genetic algorithm is used, are also presented. We show that, these methods decrease the quantum cost of the reversible or quantum logic circuit, as well as the design time of the resulting circuit. Some examples are also synthesized and optimized using the don't care concept and genetic algorithms.
Quantitative Game Semantics for Linear Logic
Authors: Ugo Lago, Olivier Laurent
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of interaction framework introduced by the first author. In our model the time measure is given by means of slots, as introduced by Ghica in a recent paper. The cost associated to a strategy is polynomially related to the normalization time of the interpreted proof, in the style of a complexity-theoretical full abstraction result.
On Black-Box Ring Extraction and Integer Factorization
Authors: Kristina Altmann, Tibor Jager, Andy Rupp
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

The black-box extraction problem over rings has (at least) two important interpretations in cryptography: An efficient algorithm for this problem implies (i) the equivalence of computing discrete logarithms and solving the Diffie-Hellman problem and (ii) the in-existence of secure ring-homomorphic encryption schemes.In the special case of a finite field, Boneh/Lipton [1] and Maurer/ Raub [2] show that there exist algorithms solving the black-box extraction problem in subexponential time. It is unknown whether there exist more efficient algorithms.In this work we consider the black-box extraction problem over finite rings of characteristic n, where n has at least two different prime factors. We provide a polynomial-time reduction from factoring n to the black-box extraction problem for a large class of finite commutative unitary rings. Under the factoring assumption, this implies the in-existence of certain efficient generic reductions from computing discrete logarithms to the Diffie-Hellman problem on the one side, and might be an indicator that secure ring-homomorphic encryption schemes exist on the other side.
Data Reallocation by Exploiting FPGA Configuration Mechanisms
Authors: Oliver Sander, Lars Braun, Michael Hübner, Jürgen Becker
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

Xilinx Virtex and Spartan FPGAs offer the possibility of dynamic and partial reconfiguration. This feature can be used in self-adaptive systems for providing the possibility to meet application requirements by exchanging parts of the hardware while other parts stay operative. The designer has to pay special attention to the communication wires connecting and crossing the reconfigurable areas. Module interfacing is still relatively complex, resource consuming and inflexible especially when regarding 2-dimensional reconfiguration approaches. In this paper a method is exploitet that overcomes these limitations achieved by using the reconfiguration interface not only for device configuration but also for data transfer between modules. In this paper we describe the approach in detail and present first implementation results.
Transition to Service-Oriented Enterprise Architecture
Authors: Martin Assmann, Gregor Engels
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

Enterprise Architecture (EA) has undergone many changes since the IT has found its way into enterprises. At the moment the Service-Oriented Architecture (SOA) is being hyped but has also gained some importance. Implementing SOA can have many implications for an enterprise, depending on how visionary the implemented architecture is. This paper provides the description of an enterprise architecture that is fully-fledged concerning service-orientation and points out the architectural challenges that have to be mastered with future research results.
Real-time embedded wireless networks: algorithms and experiences
Authors: Ragunathan Rajkumar
Venue:  (2008)

Embedded systems are everywhere. Over the past decade, we have come to rely on real-time embedded systems in time-critical, safety-critical and mission-critical applications such as electronic stability control for automotive safety, fly-by-wire in avionics and infusion pumps in medical instrumentation. We are currently observing two radical transformations in the integration of embedded computing with physical processes. First, they are becoming networked. Secondly, there is a need for tighter interaction with physical systems. There are several fundamental barriers in delivering robust real-time services across multiple wireless links, The barriers include the large dynamic range of time-varying channel capacity and application demand, uncoordinated interference across the shared wireless channel which makes communication unreliable, facilitation of global time synchronization across large node populations and the devices' energy constraints. This thesis aims to provide both a theoretical framework and practical system designs for resource allocation in multi-hop wireless networks with real-time properties. We explore the limits of node and network energy-efficiency, maximum transmission concurrency and bounded end-to-end communication delay. Our work spans three types of wireless networks: single-hop broadband networks, multi-hop sensor networks and mobile vehicle-to-vehicle networks. We consider optimizations across the physical layer, radio frequency components, communication-theoretic tradeoffs, to energy-efficient link layers and network scheduling algorithms for real-time applications such as voice and MPEG-4 streaming. For each network type, we have built systems and deployed wireless networks to verify the feasibility and performance of our research. For single-hop broadband networks, we show that by cross-layer adaptation, we achieve bounded-optimal performance across the energy, timeliness and quality of service dimensions at runtime. With our approach, the wireless transceiver's lifetime is increased by a factor of 3-to-9 compared to the gains of conventional energy management techniques. For multi-hop broadband mesh networks, our network scheduling algorithms provide maximal collision-free transmission concurrency. They outperform CSMA-based random access protocols by a factor of 5-to-8 and provide an upper bound for multi-hop throughput. With economical global time-synchronization, we are able to provide predictable and near-ideal network lifetime for battery-operated multi-hop sensor networks. Our time synchronized protocol achieves a practical node lifetime of over 2 years on 2 AA batteries. Finally, for mobile vehicular networks, our spatio-temporal synchronized broadcast protocols deliver delay-bounded service and have been deployed across a fleet of vehicles.
Fast path planning in virtual colonoscopy
Authors: Jeongjin Lee, Gyehyun Kim, Ho Lee, Byeong-Seok Shin, Yeong Gil Shin
Venue: Computers in Biology and Medicine (2008)

We propose a fast path planning algorithm using multi-resolution path tree propagation and farthest visible point. Initial path points are robustly generated by propagating the path tree, and all internal voxels locally most distant from the colon boundary are connected. The multi-resolution scheme is adopted to increase computational efficiency. Control points representing the navigational path are successively selected from the initial path points by using the farthest visible point. The position of the initial path point in a down-sampled volume is accurately adjusted in the original volume. Using the farthest visible point, the number of control points is adaptively changed according to the curvature of the colon shape so that more control points are assigned to highly curved regions. Furthermore, a smoothing step is unnecessary since our method generates a set of control points to be interpolated with the cubic spline interpolation. We applied our method to 10 computed tomography datasets. Experimental results showed that the path was generated much faster than using conventional methods without sacrificing accuracy, and clinical efficiency. The average processing time was approximately 1s when down-sampling by a factor of 2, 3, or 4. We concluded that our method is useful in diagnosing colon cancer using virtual colonoscopy.
PID control of a biped robot
Authors: Liaquat Ali Khan, Juwairiyah Naeem, Umar Khan, S. Zahid Hussain
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

Humans are the most complicated structured robots possible. The world today is striving to make robots that replicate the human stride. While walking humans, constantly shifts their weight from one leg to the other to balance the COG (center of gravity). Biped robots most closely resemble the human walk. However, current biped robots lack adaptability and stability. This paper presents the design of a Proportional Integral Derivative control for a 4- DOF (Degree of Freedom) Biped Robot that ensures maximum stability during its walk. The system is analyzed with the addition of PI, PD and PID controls to the system transfer function. The effectiveness of the design is verified by computer simulations.
PICO: A Middleware Framework for Pervasive Computing
Authors: Mohan Kumar, Behrooz A. Shirazi, Sajal K. Das, Byung Y. Sung, David Levine, Mukesh Singhal
Venue: IEEE Pervasive Computing (2003)

Pervasive information communities organization is a framework for creating mission-oriented dynamic communities of autonomous software entities that perform tasks for users and devices. PICO provides automated continual services to improve quality of life and uses resources efficiently by enhancing existing Internet services. PICO's main components are software entities, called delegents (intelligent delegates), and hardware entities, called camileuns (connected, adaptive, mobile, intelligent, learned, efficient, ubiquitous nodes). Its novel features include creating mission-oriented dynamic communities of software agents, just-in-time communication and proactive collaboration among these communities, and adapting hardware and software changes as well as application requirements. As a pervasive computing paradigm, PICO has applications in domains such as telemedicine, military, crisis management, and many day-to-day activities.
Analog VLSI Layout Design and the Circuit Board Manufacturing of Advanced Image Processing for Artificial Vision Model
Authors: Masashi Kawaguchi, Takashi Jimbo, Naohiro Ishii
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

We propose herein an artificial vision model for the motion detection which uses analog electronic circuits and design the analog VLSI layout. We also have manufactured the circuit board. The proposed model is comprised of four layers. The model was shown to be capable of detecting a movement object. The number of elements in the model, is reduced in its' realization using the integrated devices. The proposed model is robust with respect to fault tolerance. Moreover, the connection of this model is between adjacent elements, making hardware implementation easy.
Case-Based Group Recommendation: Compromising for Success
Authors: Kevin Mccarthy, Lorraine Mcginty, Barry Smyth
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

There are increasingly many recommendation scenarios where recommendations must be made to satisfy groups of people rather than individuals. This represents a significant challenge for current recommender systems because they must now cope with the potentially conflicting preferences of multiple users when selecting items for recommendation. In this paper we focus on how individual user models can be aggregated to produce a group model for the purpose of biasing recommendations in a critiquing-based, case-based recommender. We describe and evaluate 3 different aggregation policies and highlight the benefits of group recommendation using live-user preference data.
Collocation---Based Two Step Runge---Kutta Methods for Ordinary Differential Equations
Authors: R. D'Ambrosio, M. Ferro, B. Paternoster
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

We introduce a general family of collocation based two---step Runge---Kutta methods for the numerical integration of Ordinary Differential Equations depending on the stage values at two consecutive step points. We describe two constructive techniques and analyze the properties of the resulting methods.
Classification in Very High Dimensional Problems with Handfuls of Examples
Authors: Mark Palatucci, Tom M. Mitchell
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Modern classification techniques perform well when the number of training examples exceed the number of features. If, however, the number of features greatly exceed the number of training examples, then these same techniques can fail. To address this problem, we present a hierarchical Bayesian framework that shares information between features by modeling similarities between their parameters. We believe this approach is applicable to many sparse, high dimensional problems and especially relevant to those with both spatial and temporal components. One such problem is fMRI time series, and we present a case study that shows how we can successfully classify in this domain with 80,000 original features and only 2 training examples per class.
Adaptive and Reflective Middleware for QoS-Enabled CCM Applications
Authors: Nanbor Wang, Douglas C. Schmidt, Michael Kircher, Kirthika Parameswaran
Venue: IEEE Distributed Systems Online (2001)

Existing middleware specifications, such as Real-Time CORBA and CORBA Messaging, address many quality-of-service (QoS) properties by defining policies that control connection multiplexing, request priority, queuing order, routing, and dependability. They do not, however, define strategies for configuring these QoS properties into applications flexibly, transparently, and adaptively. Application developers must therefore make these configuration decisions manually. This process is tedious and error-prone, and suboptimal for complex distributed realtime and embedded (DRE) systems. Although the recently adopted CORBA Component Model (CCM) defines a standard configuration framework for packaging and deployingsoftware components, conventional CCM implementations focus on functionality rather than adaptive QoS, which makes the CCM currently unsuitable for DRE applications withdemanding QoS requirements.
Using α-ctl to Specify Complex Planning Goals
Authors: Silvio Lago Pereira, Leliane Nunes Barros
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

The temporal logic ctl has been the preferred specification language in the model checking framework. However, when this framework is used for nondeterministic planning, it is not adequate to deal with many useful planning problems with temporally extended goals. This is because the validity of ctl formulas expressing such goals is not evaluated on the planning domain, but on the execution structure of the policy synthesized by the planning algorithm. In previous work we have presented a new variant of ctl, named &alpha; ctl, which semantics can be defined directly on the planning domain. An advantage of this new logic is that plan synthesis can be obtained as a collateral effect of verifying the validity of a formula in the planning domain. In this paper we show how to use &alpha; -ctl to express some complex planning goals.
Clustered Dynamic Conditional Correlation Multivariate GARCH Model
Authors: Tu Zhou, Laiwan Chan
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

The time-varying correlations between multivariate financial time series have been intensively studied. For example DCC and Block-DCC models have been proposed. In this paper, we present a novel Clustered DCC model which extends the previous models by incorporating clustering techniques. Instead of using the same parameters for all time series, a cluster structure is produced based on the autocorrelations of standardized residuals, in which clustered entries sharing the same dynamics. We compare and investigate different clustering methods using synthetic data. To verify the effectiveness of the whole proposed model, we conduct experiments on a set of Hong Kong stock daily returns, and the results outperform the original DCC GARCH model as well as Block-DCC model.
Discrete Wavelet Diffusion for Image Denoising
Authors: Kashif Rajpoot, Nasir Rajpoot, J. Alison Noble
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

Nonlinear diffusion, proposed by Perona-Malik, is a well-known method for image denoising with edge preserving characteristics. Recently, nonlinear diffusion has been shown to be equivalent to iterative wavelet shrinkage, but only for (1) Mallat-Zhong dyadic wavelet transform and (2) Haar wavelet transform. In this paper, we generalize the equivalence of nonlinear diffusion to non-linear shrinkage in the standard discrete wavelet transform (DWT) domain. Two of the major advantages of the standard DWT are its simplicity (as compared to 1) and its potential to benefit from a greater range of orthogonal and biorthogonal filters (as compared to both 1 and 2). We also extend the wavelet diffusion implementation to multiscale. The qualitative and quantitative results shown for a variety of images contaminated with noise demonstrate the promise of the proposed standard wavelet diffusion.
Symbolic negotiation: Partial deduction for linear logic with coalition formation
Authors: Peep Küngas, Mihhail Matskin
Venue: Web Intelligence and Agent Systems (2008)

In this paper we present a formalism for symbolic negotiation while regarding symbolic negotiation as cooperative problem solving (CPS). CPS is based on symbolic reasoning and is extended with negotiation and coalition formation rules. We formalize partial deduction for intuitionistic linear logic and use it as a foundation for formalization of symbolic negotiation. We also formalize the process of coalition formation and analyse its effect to symbolic negotiation and CPS. Soundness and compleness proofs for the proposed formalisms are given.