ppxscal/embedding_network huggingface dataset:
A Computationally Efficient Nonlinear Predictive Control Algorithm with RBF Neural Models and Its Application
Authors: Maciej Ławryńczuk, Piotr Tatjewski
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

This paper details a computationally efficient (suboptimal) nonlinear Model Predictive Control (MPC) algorithm with Radial Basis Function (RBF) type neural network models and discusses its application to a polymerisation reactor. Neural model of the process is used on-line to determine the local linearisation and the nonlinear free trajectory. Unlike the nonlinear MPC technique, which hinges on non-convex optimisation, the presented algorithm is more reliable and less computationally demanding because it results in a quadratic programming problem, whereas its closed-loop control performance is similar.
It's All in the Anticipation
Authors: Carlos Martinho, Ana Paiva
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Since the beginnings of character animation, anticipation has been an effective part of the repertoire of tricks used to create believable animated characters. However, anticipation has had but a secondary role in the creation of synthetic virtual life forms. In this paper, we describe how a simple anticipatory mechanism that generates an affective signal resulting from the mismatch between sensed and predicted values -- the emotivector -- can help in the creation of consistent believable behaviour for intelligent virtual characters.
Particle Swarm Optimization for Two-Stage FLA Problem with Fuzzy Random Demands
Authors: Yankui Liu, Siyuan Shen, Rui Qin
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

A new class of two-stage facility location-allocation (FLA) problems is studied, in which the demands are characterized by fuzzy random variables with known possibility and probability distributions. To solve the two-stage FLA problem, an approximation method is developed to turn the original infinite dimensional FLA problem into a finite dimensional one. Since the approximating FLA problem is neither linear nor convex, conventional optimization algorithms cannot be used to solve it. To overcome this difficulty, this paper designs a hybrid algorithm, which integrates the approximation method, neural network (NN) and particle swarm optimization (PSO) algorithm, to solve the approximating two-stage FLA problem. One numerical example with five facilities and ten customers is presented to demonstrate the effectiveness of the designed algorithm.
The Java 5 generics compromise orthogonality to keep compatibility
Authors: Atanas Radenski, Jeff Furlong, Vladimir Zanev
Venue: Journal of Systems and Software (2008)

In response to a long-lasting anticipation by the Java community, version 1.5 of the Java 2 platform - referred to as Java 5 - introduced generic types and methods to the Java language. The Java 5 generics are a significant enhancement to the language expressivity because they allow straightforward composition of new generic classes from existing ones while reducing the need for a plethora of type casts. While the Java 5 generics are expressive, the chosen implementation method, type erasure, has triggered undesirable orthogonality violations. This paper identifies six cases of orthogonality violations in the Java 5 generics and demonstrates how these violations are mandated by the use of type erasure. The paper also compares the Java 5 cases of orthogonality violations to compatible cases in C# 2 and NextGen 2 and analyzes the tradeoffs in the three approaches. The conclusion is that Java 5 users face new challenges: a number of generic type expressions are forbidden, while others that are allowed are left unchecked by the compiler.
Embedded Fault Diagnosis Expert System Based on CLIPS and ANN
Authors: Tan Dapeng, Li Peiyu, Pan Xiaohong
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Embedded fault diagnosis technology requires high pertinency and small occupation space. Traditional fault diagnosis system can not satisfy the demand above. Aiming at this problem, a kind of embedded fault diagnosis expert system (E-FDES) based on CLIPS and ANN was brought forward. FDES and its relative technology were discussed, developing environment and design tool chain for E-FDES was established in Linux environment. Using modularization theory principle, system re-configuration and expansion ability were guaranteed, and data process components and graphic user interface components could be reduced to meet the embedded system running requirement. By application program interface of CLIPS and Protégé plug-in, knowledge base and rule base were realized, that decreased the developing time of system inference engine and reduced source occupation space. Industry experiments prove that this system runs stably in ARM-Linux embedded environment, switch smoothly and can recognize some common faults for the devices monitored.
The Design of Battery On-line Monitoring Device Based on Wireless Communication
Authors: Xiangling Shi, Zhenjiang Cai, Qingjian Zhai, Dening Zhang, Hongjuan Kou
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

The battery online monitoring device is regarded as the research object, a scheme based on Cirrus Logic's EP9315 processor and embedded Linux operating system is proposed. Short-distance wireless communication technology is adopted to transfer data. The hardware structure and software design of the system are also introduced. The battery inner resistance is measured by DC discharge, which guaranteed the reliability of online monitoring. The application of Fuzzy Neural Network (FNN) optimized by Genetic Algorithm (GA) in battery capacity testing has wide prospect.
Routing in ad-hoc networks with MIMO links: Optimization considerations and protocols
Authors: Karthikeyan Sundaresan, Raghupathy Sivakumar
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Smart antennas include a broad variety of antenna technologies ranging from the simple switched beams to the sophisticated digital adaptive arrays. While beam-forming antennas are good candidates for operation in strong line of sight (LOS) environments, it is the multiple input multiple output (MIMO) technology that is best suited for multipath environments. In fact, the MIMO links exploit the multipath induced rich scattering to provide high spectral efficiencies. The focus of this work is to identify the various characteristics and tradeoffs of MIMO links that can be leveraged by routing layer protocols in rich multipath environments to improve their performance. To this end, we study the relative benefits of the different strategies of operation in MIMO links both analytically and through simulations. Using the insights gained from the study, we propose a routing protocol called MIR for ad-hoc networks with MIMO links, that optimally leverages the various characteristics of MIMO links in its mechanisms to improve the network performance. We show the effectiveness of the components of the proposed protocol by evaluating its performance through ns2 simulations for a variety of network conditions. Results indicate that MIR is able to provide significant performance gains of about 100% over baseline approaches.
A pattern-driven process for secure service-oriented applications
Authors: Eduardo B. Fernandez
Venue:  (2008)

During the last few years, Service-Oriented Architecture (SOA) has been considered to be the new phase in the evolution of distributed enterprise applications. Even though there is a common acceptance of this concept, a real problem hinders the widespread use of SOA: A methodology to design and build secure service-oriented applications is needed. In this dissertation, we design a novel process to secure service oriented applications. Our contribution is original not only because it applies the MDA approach to the design of service-oriented applications but also because it allows their scouring by dynamically applying security patterns throughout the whole process. Security patterns capture security knowledge and describe security mechanisms. In our process, we present a structured map of security patterns for SOA and web services and its corresponding catalog. At the different steps of a software lifecycle, the architect or designer needs to make some security decisions. An approach using a decision tree made of security pattern nodes is proposed to help making these choices. We show how to extract a decision tree from our map of security patterns. Model-Driven Architecture (MDA) is an approach which promotes the systematic use of models during a system's development lifecycle. In the dissertation we describe a chain of transformations necessary to obtain secure models of the service-oriented application. A main benefit of this process is that it decouples the application domain expertise from the security expertise that are both needed to build a secure application. Security knowledge is captured by pre-defined security patterns, their selection is rendered easier by using the decision trees and their application can be automated. A consequence is that the inclusion of security during the software development process becomes more convenient for the architects/designers. A second benefit is that the insertion of security is semi-automated and traceable. Thus, the process is flexible and can easily adapt to changing requirements. Given that SOA was developed in order to provide enterprises with modular, reusable and adaptable architectures, but that security was the principal factor that hindered its use, we believe that our process can act as an enabler for service-oriented applications.
Resolving Performance Anomaly Using ARF-Aware TCP
Authors: Seehwan Yoo, Tae-Kyung Kim, Chuck Yoo
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

In this study, we propose ARF-aware TCP that resolves the performance anomaly in 802.11 WLAN networks. Performance anomaly is a network symptom that fairness among the nodes is broken when multiple nodes in the same channel have different link rates. Recent studies on the performance anomaly focus on QoS mechanism at MAC layer. However, MAC layer approach has drawbacks such as framing overhead or side-effects at transport protocol. ARF-aware TCP successfully provides a fair-share of wireless links in an easier way. By adjusting the congestion window size during a RTT period, we can get high fairness and enhanced throughput. The fairness index in our cases increases from 0.63, 0.74 to 0.99, 0.99 respectively. In addition, it improves the performance of sessions up to 30% by resolving the performance anomaly.
On Game Semantics of the Affine and Intuitionistic Logics
Authors: Ilya Mezhirov, Nikolay Vereshchagin
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

We show that the uniform validity is equivalent to the non-uniform validity for both Blass' semantics of [1] and Japaridze's semantics of [5] (thus proving a conjecture from [5]). We present a shorter proof (than that of [10]) of the completeness of the positive fragment of intuitionistic logic for both these semantics. Finally, we show that validity for the "parallel recurrence" version of Japaridze's semantics of [5] is equivalent to accomplishability in the sense of [4].
Routing of XML and XPath Queries in Data Dissemination Networks
Authors: Guoli Li, Shuang Hou, Hans-Arno Jacobsen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of content-based routers. Routing decisions are based on XPath expressions (XPEs) stored at each router. To enable efficient routing, while keeping the routing state small, we introduce an advertisement-based routing algorithm for XML content, present a novel data structure for managing XPEs, especially apt for the hierarchical nature of XPEs and XML, and develop several optimizations for reducing the number of XPEs required to manage the routing state. The experimental evaluation shows that our algorithms and optimizations reduce the routing table size by up to 90%, improve the routing time by roughly 85%, and reduce overall network traffic by about 35%. Experiments running on PlanetLab show the scalability of our approach.
Improving Metaheuristics for Mapping Independent Tasks into Heterogeneous Memory-Constrained Systems
Authors: Javier Cuenca, Domingo Giménez
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

This paper shows different strategies for improving some metaheuristics for the solution of a task mapping problem. Independent tasks with different computational costs and memory requirements are scheduled in a heterogeneous system with computational heterogeneity and memory constraints. The tuned methods proposed in this work could be used for optimizing realistic systems, such as scheduling independent processes onto a processors farm.
Effectiveness of Feature Space Selection on Credit Engineering on Multi-group Classification Cases
Authors: Junghee Park, Kidong Lee, Jinhwa Kim
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

This study tests the sensitivity of input feature space selection on credit rating using four classifiers as backpropagation(BP), Kohonen self-organizing feature map, discriminant analysis(DA), and logistic regression. The results of the study are that at individual methods applied, BP network outperforms two statistical counterparts while Kohonen network shows the least accuracy among the models. The results also show that the selection of the feature spaces to the accuracy outcome may not be very sensitive when we test the four methodologies altogether at aggregate level.
Probabilistic Entity Linkage for Heterogeneous Information Spaces
Authors: Ekaterini Ioannou, Claudia Niederée, Wolfgang Nejdl
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Heterogeneous information spaces are typically created by merging data from a variety of different applications and information sources. These sources often use different identifiers for data that describe the same real-word entity (for example an artist, a conference, an organization). In this paper we propose a new probabilistic Entity Linkage algorithm for identifying and linking data that refer to the same real-world entity.Our approach focuses on managing entity linkage information in heterogeneous information spaces using probabilistic methods. We use a Bayesian network to model evidences which support the possible object matches along with the interdependencies between them. This enables us to flexibly update the network when new information becomes available, and to cope with the different requirements imposed by applications build on top of information spaces.
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
Authors: Sander Stuijk, Marc Geilen, Twan Basten
Venue: IEEE Transactions on Computers (2008)

Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute intensive kernels of these applications are often specified as Cyclo-Static or Synchronous Dataflow Graphs. Communication between nodes in these graphs requires storage space which influences throughput. We present an exact technique to chart the Pareto space of throughput and storage trade-offs, which can be used to determine the minimal buffer space needed to execute a graph under a given throughput constraint. The feasibility of the exact technique is demonstrated with experiments on a set of realistic DSP and multimedia applications. To increase scalability of the approach, a fast approximation technique is developed that guarantees both throughput and a, tight, bound on the maximal overestimation of buffer requirements. The approximation technique allows to trade off worst-case overestimation versus run-time.
Multi-agent Negotiation System in Electronic Environments
Authors: Dorin Militaru
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

The main purpose of the study is to investigate how costly information could affect the performance of several types of searching agents in electronic commerce environments. Internet searching agents are tools allowing consumers to compare on-line Web-stores' prices for a product. The existing agents base their search on a predefined list of Web-stores and, as such, they can be qualified as fixed-sample size searching agents. However, with the implementation of new Internet pricing schemes, this search rule may evolve toward more flexible search methods allowing for an explicit trade-off between the communication costs and the product price. In this setting, the sequential optimal search rule is a possible alternative. However, its adoption depends on its expected performance. The present paper analyses the relative performances of two types of search agents on a virtual market with costly information. At the theoretical equilibrium of the market, we show that the sequential rule-based searching agents with a reservation price always allow consumers to pay lower total costs. We further test the robustness of this result by simulating a market where both sellers' and buyers' search agents have only partial information about the market structure.
Adaptation of Rules in the Fuzzy Control System Using the Arithmetic of Ordered Fuzzy Numbers
Authors: Piotr Prokopowicz
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper describes a new look on adaptation of fuzzy rules in fuzzy control process. New idea is based on properties of the Ordered Fuzzy Numbers. The Ordered fuzzy nunbers (OFN) are a new model of fuzzy numbers, presented a few years ago [15]. Important property and advantage of the new model of fuzzy numbers is simple realization of arithmetical operations. Thanks to that we can get neutral element of adding and multiplication in the same way like in real numbers. Easy way of calculating on the Ordered Fuzzy Numbers makes possible to use them in a fuzzy control process. In the [21] new methods of processing information for a fuzzy control system were presented. These methods basing on arithmetic of the Ordered Fuzzy Numbers.The goal of that paper is to present a way to use a good arithmetical properties of Ordered Fuzzy Numbers in the process of rules adaptation for the fuzzy control system.
NEC's ?PD7723O Digital Signal Processor
Venue: IEEE Micro (1986)

This 150-ns device performs full 32-bit floating-point arithmetic, incorporates onchip instruction and data memory, and provides both serial and parallel I/O. 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
Plenary lecture I: novel results in short-range visualization and vision systems based on gated imaging
Authors: Andrzej Sluzek
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

The idea of visibility enhancement using gated images has been known and applied for at least 20 years. The majority of gated imaging systems are used for enhancing capabilities of human vision under highly difficult conditions (fog, turbid water, strong ambient light, etc.). In most of the reported applications the range of gated-imaging systems is long enough comparing to the duration of the illumination pulses so that a simplified model of gated imaging can be used. Secondly, the systems capture individual images only and no attempts have been reported on more sophisticated visualization methods using gated images. In this presentation, we focus on the above limitations of gated-imaging systems. First, we briefly discuss and explain the theory of short-range gated imaging. In vision-related applications, short-range gated imaging is needed only in very high turbidity conditions so that we focus on gated imaging in highly turbid media. The presented ideas are illustrated by exemplary results of simulated and physical tests. One of the conclusions is that in short-range applications of gated imaging the duration of the illumination pulses should be reduced so that the depth of visualization is very limited. We propose a technique for an automatic image fusion using a sequence of gated images captured by a precisely controlled pulsed laser. The fusion of several images can provide good quality of visualization over a wide range of depths. A feasibilty study system build using this principle will be briefly discussed. The system is controlled by an FPGA device and controls the gated imaging operation with the accuracy limited by a single clock cycle duration. We believe that the proposed methods are a significant step towards system capable of providing visibility in extremely difficult scenarios (e.g. "inspecting areas of turbulent liquids, seeing through almost non-transparent liquids, etc.).
An Architecture and Protocol for the Management of Resources in Ubiquitous and Heterogeneous Systems Based on the SVP Model of Concurrency
Authors: Chris Jesshope, Jean-Marc Philippe, Michiel Tol
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

This paper proposes a novel hierarchical architecture and resource-management protocol for the delegation of work within a ubiquitous and heterogeneous environment. The protocol is based on serving an SVP place, where a component of work is delegated together with the responsibility for meeting any non-functional computational requirements such as deadline or throughput constraints. The protocol is based on a market where SANE processors bid for jobs to execute and selection is based on a cost model that reflects the energy required to meet the jobs requirements.
An Improvement of TCP Downstream Between Heterogeneous Terminals in an Infrastructure Network
Authors: Yong-Hyun Kim, Ji-Hong Kim, Youn-Sik Hong, Ki-Young Lee
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

We measured a performance of data transmission between a desktop PC and a PDA in an infrastructure network based on IEEE 802.11x wireless LAN. Assuming that a PDA is mainly used for downloading data from its stationary server, i.e., a desktop PC, a PC and a PDA acts as a fast sender and a slow receiver, respectively, due to substantial differences in their computational capabilities. With data transmission between these heterogeneous terminals a transmission time during downstream is slower than that during upstream by 20% at maximum. To mitigate this, we present two distinct approaches. First, by increasing the size of a receive buffer for a PDA the congestion window size of TCP becomes more stable. Thus, an approximate 32% increase in throughput can be obtained by increasing its size from 512 bytes to 32768 bytes. Second, a pre-determined delay between packets to be transmitted at the sender should be given. By assigning the inter-packet delay of 5 ms during downstream achieves a best performance which improves by 7% compared to that without such a delay. Besides, such a delay reduces the number of erroneous packets remarkably.