ppxscal/embedding_network huggingface dataset:
New distributions properties and applications in digital control
Authors: Monica Leba, Emil Pop
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

In this paper, the definition, modeling and simulation of elementary Swartz distributions and their properties are first considered. Using this theory a new theorem and property were demonstrated, modeled and simulated with significant application examples. The paper presents an extremely useful application for digital control of power electronics. The proposed solution uses the properties and the new theorem in order to solve complex nonlinear equations to produce appropriate digital control signals. This solution can be easily coded in a hardware description language and downloaded in an ASIC chip as part of an embedded controller.
Power Transients Characterization and Classification Using Higher-Order Cumulants and Competitive Layers
Authors: Juan-José González De-La-Rosa, Antonio Moreno Muñoz, Isidro Lloret, Carlos G. Puntonet, Juan-Manuel Górriz
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

This paper deals with power-quality (PQ) event detection, classification and characterization using higher-order sliding cumulants to examine the signals. Their maxima and minima are the main features, and the classification strategy is based in competitive layers. Concretely, we concentrate on the task of differentiating two types of transients (short duration and long duration). By measuring the fourth-order central cumulants' maxima and minima, we build the two-dimensional feature measured vector. Cumulants are calculated over high-pass digitally filtered signals, to avoid the low-frequency 50-Hz signal. We have observed that the minima and maxima measurements produce clusters in the feature space for 4th-order cumulants; 3rd-order cumulants are not capable of differentiate these two very similar PQ events. The experience aims to set the foundations of an automatic procedure for PQ event detection.
Real Vehicle Routing and Dispatching with Dynamic Fuzzy Travel Times
Authors: Lianxi Hong, Min Xu
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The paper presents a model of the real world vehicle routing and dispatching problem. In real world, vehicle travel speeds are varying with period of time and can not be expressed as exact values. So the time-dependent and fuzzy travel speeds are introduced into the model. A dispatching period is divided into some time slices and each time slice is designated a triangular fuzzy speed. The travel time is calculated by fuzzy value integral to insure FIFO property. The method of comparing two triangular fuzzy numbers is applied to check whether or not customers' time windows are satisfied. A hybrid intelligent approach combining genetic algorithm and ant colony algorithm is proposed for solving the dispatching model. A chromosome of the genetic algorithm is regarded as a ant of ant colony algorithm, and its fitness is regarded as the pheromone that remains on way that it passes. And chromosomes are constructed by searching path method of ant colony algorithm. The approach is viable and valid by computing a real instance.
Prediction of over Represented Transcription Factor Binding Sites in Co-regulated Genes Using Whole Genome Matching Statistics
Authors: Giulio Pavesi, Federico Zambelli
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The identification of binding sites for transcription factors regulating gene transcription is one of the most important and challenging problems in molecular biology and bioinformatics. Here we present an algorithm that, given a set of promoters from co---regulated genes, identifies over-represented binding sites by using profiles (position specific frequency matrices) defining the sequence binding specificity of known TFs as well as matching statistics on a whole---genome level, bypassing the need of defining matching thresholds and/or the use of homologous sequences. Preliminary tests performed on experimentally validated sequence sets are very promising; moreover, the same algorithm is suitable also for the use with any model of the binding specificity of TFs.
Finiteness Properties of Some Families of GP-Trees
Authors: César L. Alonso, José Luis Montaña
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

We provide upper bounds for the Vapnik-Chervonenkis dimension of classes of subsets of that can be recognized by computer programs built from arithmetical assignments, infinitely differentiable algebraic operations (like k-root extraction and, more generally, operations defined by algebraic series of fractional powers), conditional statements and while instructions. This includes certain classes of GP-trees considered in Genetic Programming for symbolic regression and bi-classification. As a consequence we show explicit quantitative properties that can help to design the fitness function of a GP learning machine.
Robust Color Classification Using Fuzzy Reasoning and Genetic Algorithms in RoboCup Soccer Leagues
Authors: Alireza Kashanipour, Amir Reza Kashanipour, Nargess Shamshiri Milani, Peyman Akhlaghi, Kaveh Khezri Boukani
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Color segmentation is typically the first step of vision processing for a robot operating in a color coded environment, like RoboCup soccer, and many object recognition modules rely on that, in this paper we present a method for color segmentation that is based on fuzzy logic. Fuzzy sets are defined on the H, S and L components of the HSL color space and provide a fuzzy logic model that aims to follow the human intuition of color classification. The membership functions used for the fuzzy inference are optimized by genetic algorithms. The method requires the setting of only a few parameters and has been proved to be very robust to noise and light variations, allowing for setting parameters only once. The approach has been implemented on MRL middle size robots, and successfully experimented in the numbers of the friendly matches of the Middle size in the 2006's games.
Development of Activity Models of Integrated Safety and Disaster Management for Industrial Complex Areas
Authors: Yukiyasu Shimada, Hossam A. Gabbar
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

There are increasing challenges that face industrial organizations to manage safety in normal and to minimize risks when disaster occurs. Such challenges increase when many production plants are placed in industrial complex area. This paper describes activity models to manage plant safety and disasters of production plants in industrial complex areas. The proposed activity models are used to design and develop integrated decision support and management system for safety and disaster management of industrial complex areas, which is validated using case study scenarios.
Contrast-Set Mining of Aircraft Accidents and Incidents
Authors: Zohreh Nazeri, Daniel Barbara, Kenneth Jong, George Donohue, Lance Sherry
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

Identifying patterns of factors associated with aircraft accidents is of high interest to the aviation safety community. However, accident data is not large enough to allow a significant discovery of repeating patterns of the factors. We applied the STUCCO algorithm to analyze aircraft accident data in contrast to the aircraft incident data in major aviation safety databases and identified factors that are significantly associated with the accidents. The data pertains to accidents and incidents involving commercial flights within the United States. The NTSB accident database was analyzed against four incident databases and the results were compared. We ranked the findings by the Factor Support Ratio, a measure introduced in this work.
On the (High) Undecidability of Distributed Synthesis Problems
Authors: David Janin
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The distributed synthesis problem [11] is known to be undecidable. Our purpose here is to study further this undecidability.For this, we consider distributed games [8], an infinite variant of Peterson and Reif multiplayer games with partial information [10], in which Pnueli and Rosner's distributed synthesis problem can be encoded and, when decidable [11,6,7], uniformly solved [8].We first prove that even the simple problem of solving 2-process distributed game with reachability conditions is undecidable ($\Sigma^0_1$-complete). This decision problem, equivalent to two process distributed synthesis with fairly restricted FO-specification was left open [8]. We prove then that the safety case is $\Pi^0_1$-complete. More generally, we establish a correspondence between 2-process distributed game with Mostowski's weak parity conditions [9] and levels of the arithmetical hierarchy. finally, distributed games with general ¿-regular infinitary conditions are shown to be highly undecidable ($\Sigma^1_1$-complete).
Midpoints Versus Endpoints: From Protocols to Firewalls
Authors: Diana Bidder-Senn, David Basin, Germano Caronni
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

Today's protocol specifications only define the behaviour of principals representing communication endpoints. But in addition to endpoints, networks contain midpoints, which are machines that observe or filter traffic between endpoints. In this paper, we explain why midpoints should handle protocols differently from endpoints and thus midpoint specifications are needed. With a case study, using the TCP protocol and three different firewalls as midpoints, we illustrate the consequences of the current lack of protocol specifications for midpoints, namely that the same protocol is implemented differently by the different firewalls. We then propose a solution to the problem: We give an algorithm that generates a midpoint automaton from specifications of endpoint automata. We prove that the resulting midpoint automata are correct in that they forward only those messages that could have resulted from protocol-conform endpoints. Finally, we illustrate the algorithm on the TCP protocol.
An Adaptive Threshold Neural-Network Scheme for Rotorcraft UAV Sensor Failure Diagnosis
Authors: Juntong Qi, Xingang Zhao, Zhe Jiang, Jianda Han
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper presents an adaptive threshold neural-network scheme for Rotorcraft Unmanned Aerial Vehicle (RUAV) sensor failure diagnosis. The approach based on adaptive threshold has the advantages of better detection and identification ability compared with traditional neural-network-based scheme. In this paper, the proposed scheme is demonstrated using the model of a RUAV and the results show that the adaptive threshold neural-network method is an effective tool for sensor fault detection of a RUAV.
A Joint Moments Based Analysis of Networks of MAP/MAP/1 Queues
Authors: András Horváth, Gábor Horváth, Miklós Telek
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

The decomposition based approximate numerical analysis of queueing networks of MAP/MAP/1 queues is considered in this paper. One of the most crucial decisions of decomposition based queueing network analysis is the description of inter-node traffic. Utilizing recent results on Marko arrival processes (MAPs), we apply a given number of joint moments of the consecutive inter-event times to describe the inter-node traffic. This traffic description is compact (uses far less parameters than the alternative methods) and flexible (allows an easy reduction of the complexity of the model, which increases in each analysis step). Numerical examples demonstrate the accuracy and the computational complexity of the proposed approximate analysis method.
Interactive Mining of Functional MRI Data
Authors: Jerzy Korczak
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Discovery of the image voxels of the brain that represent real activity is, in general, very difficult because of a weak signal-to-noise ratio and the presence of artifacts. The first tests of the classical data mining algorithms in this field showed low performances and weak quality of recognition. In this article, a new interactive data-driven approach to functional Magnetic Resonance Imagery mining is presented, allowing the observation of cerebral activity. Several non-supervised classification algo-rithms have been developed and tested on sequences of fMRI images. The results of the tests have shown that the number of classes, signal-to-noise ratio, and volumes of activated and explored zones have a strong influence on the classifier performances.
Recognition of circular patterns on GPUs: Performance analysis and contributions
Authors: Antonio Ruiz, Nicolás Guil, Manuel Ujaldón
Venue: Journal of Parallel and Distributed Computing (2008)

We develop a novel approach for computing the circle Hough transform entirely on graphics hardware (GPU). A primary role is assigned to vertex processors and the rasterizer, overshadowing the traditional foreground of pixel processors and enhancing parallel processing. Resources like the vertex cache or blending units are studied too, with our set of optimizations leading to extraordinary peak gain factors exceeding 358x over a typical CPU execution. Software optimizations, like the use of precomputed tables or gradient information and hardware improvements, like hyperthreading and multicores are explored on CPUs as well. Overall, the GPU exhibits better scalability and much greater parallel performance to become a solid alternative for computing the classical circle Hough transform versus those optimal methods run on emerging multicore architectures.
Self-adaptive Evolutionary Methods in Designing Skeletal Structures
Authors: Adam Borkowski, Piotr Nikodem
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

This paper focuses on modified genetic algorithm based on the graph representation and specialized genetic operators. Advantages of changed representation, multi-level organization as well as self-adaptive aspects of the proposed method are described. The results of algorithm usage in optimising skeletal structures are also presented.
Tug-of-War: An Adaptive and Cost-Optimal Data Storage and Query Mechanism in Wireless Sensor Networks
Authors: Yuh-Jzer Joung, Shih-Hsiang Huang
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

We propose Tug-of-War (ToW) for data storage and query mechanism in sensor networks. ToW is based on the concept of data-centric storage where events and queries meet on some rendezvous node so that queries for the events can be sent directly to the node without being flooded to the network. However, rather than fixing the rendezvous point, we dynamically replicate the point and float them in between query nodes and event sensor nodes according to the relative frequencies of events and queries. By carefully calculating the optimal setting, we are able to minimize the total communication costs while adapting to the environment.
Members of parliaments' use of ICT in a comparative European perspective
Authors: Jens Hoff
Venue: Information Polity (2004)

This article presents the research questions, research methodology, and some of the major results of a comparative, survey-based study of the use of ICT by members of parliament in seven European countries. The overall research question is whether ICT is an active driver in changing the role of MPs by strengthening either their delegate or trustee role, or whether we see the contours of a totally new role for MPs in the "information society". Even though the data does not permit a full answer to this question, they allow us to see at least the contours of a new role for the MP in which attention to information flows and the media comes more to the fore, and where ability to influence the political agenda through digital means is crucial. Three other results from the surveys stand out clearly: a) there is a rather clear North-South divide in Europe concerning both what types of ICT are used by MPs, and the extent to which they are used. For MPs from the Northern European countries included in the study ICT has become an indispensable daily tool, while this is less so in the more southern countries, b) in explaining differences and similarities in MPs use of ICT across countries, institutional factors like the organization of work in parliament, and the MPs parliamentary position seem to be the most important, c) MPs ICT competence and ICT experience are more important factors in explaining their attitudes towards the democratic potentials of ICT than more traditional background variables such as gender, age and party affiliation and size.
The Application of Adaptive Critic Design in the Nosiheptide Fermentation
Authors: Dapeng Zhang, Aiguo Wu, Fuli Wang, Zhiling Lin
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

An adaptive critic design is used in the nosiheptide fermentation process to solve the intractable optimization problem. The utility function is defined as the increment of biomass concentration at the adjacent intervals. The state variables are chosen as the biomass concentration, the substrate concentration, the dissolved oxygen concentration and the inhibition concentration. The decision variables are chosen as the temperature, the stirring speed, the airflow and the tank pressure. The adaptive critic method determines optimal control laws for a system by successively adapting the critic networks and the action network. The simulation shows at the same initial conditions this technique can make the fermentation shorten 6 hours.
Biprobabilistic values for bicooperative games
Authors: J. M. Bilbao, J. R. Fernández, N. Jiménez, J. J. López
Venue: Discrete Applied Mathematics (2008)

The present paper introduces bicooperative games and develops some general values on the vector space of these games. First, we define biprobabilistic values for bicooperative games and observe in detail the axioms that characterize such values. Following the work of Weber [R.J. Weber, Probabilistic values for games, in: A.E. Roth (Ed.), The Shapley Value: Essays in Honor of Lloyd S. Shapley Cambridge University Press, Cambridge, 1988, pp. 101-119], these axioms are sequentially introduced observing the repercussions they have on the value expression. Moreover, compatible-order values are introduced and there is shown the relationship between these values and efficient values such that their components are biprobabilistic values.
Novel VQ Designs for Discrete HMM On-Line Handwritten Whiteboard Note Recognition
Authors: Joachim Schenk, Stefan Schwärzler, Günther Ruske, Gerhard Rigoll
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

In this work we propose two novel vector quantization (VQ) designs for discrete HMM-based on-line handwriting recognition of whiteboard notes. Both VQ designs represent the binary pressure information without any loss. The new designs are necessary because standard k-means VQ systems cannot quantize this binary feature adequately, as is shown in this paper.Our experiments show that the new systems provide a relative improvement of r = 1.8 % in recognition accuracy on a character- and r = 3.3 % on a word-level benchmark compared to a standard k-means VQ system. Additionally, our system is compared and proven to be competitive to a state-of-the-art continuous HMM-based system yielding a slight relative improvement of r = 0.6 %.
2008 Special Issue: Deterministic neural dynamics transmitted through neural networks
Authors: Yoshiyuki Asai, Apratim Guha, Alessandro E. P. Villa
Venue: Neural Networks (2008)

Precise spatiotemporal sequences of neuronal discharges (i.e., intervals between epochs repeating more often than expected by chance), have been observed in a large set of experimental electrophysiological recordings. Sensitivity to temporal information, by itself, does not demonstrate that dynamics embedded in spike trains can be transmitted through a neural network. This study analyzes how synaptic transmission through three archetypical types of neurons (regular-spiking, thalamo-cortical and resonator), simulated by a simple spiking model, can affect the transmission of precise timings generated by a nonlinear deterministic system (i.e., the Zaslavskii mapping in the present study). The results show that cells with subthreshold oscillations (resonators) are very sensitive to stochastic inputs, and are not a good candidate for transmitting temporally coded information. Thalamo-cortical neurons may transmit very well temporal patterns in the absence of background activity, but jitter accumulates along the synaptic chain. Conversely, we observed that cortical regular-spiking neurons can propagate filtered temporal information in a reliable way through the network, and with high temporal accuracy. We discuss the results in the general framework of neural dynamics and brain theories.
Egocentrism Presumption Method with N-Gram for e-Business
Authors: Nobuo Suzuki, Kazuhiko Tsuda
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

For the business communication by e-mail with cellular phones, we think there is a serious problem. We sometimes misunderstand the intention of a sender and get into trouble as a result. Such missing each other is caused by a human egocentrism. Therefore, this egocentrism becomes a prevention factor of the good communication on e-Business. To handle this problem, this paper proposes a new model of the egocentrism for e-Business on the Internet based on DSM method which is the standard evaluation index of mental diseases in the psychiatry. It also describes a technique to predict egocentrism using N-gram model. Finally, we examined an evaluation experiment and got results that the precision was 100% and the recall was 34%. From these results, we conclude that this egocentrism presumption method is useful way to reduce misunderstanding the intention of messages on the Internet for e-Business.
'Scattergun' or 'rifle' approach to communication: MPs in the blogosphere
Authors: Nigel Jackson
Venue: Information Polity (2008)

The existing literature suggests that MPs will use a weblog to promote their activities to constituents in a very similar way to how they use websites. Yet, the discussion of Web 1.0 and Web 2.0 suggests that the nature of this debate is evolving. This article, based on a three month content analysis of seven MPs' weblogs, and interviews with four of these blogging MPs, seeks to identify what impact a weblog has on their workload, roles and how they communicate. The findings suggest that contrary to some of the existing literature, MPs do not use a weblog to support existing roles, such as their constituency role. Rather, a weblog appears to have a very narrow and specific role to enhance debate within a separate e-constituency.