ppxscal/embedding_network huggingface dataset:
A Robust Route Maintenance Scheme for Wireless Ad-Hoc Networks
Authors: Kwan-Woong Kim, Mike Myung-Ok Lee, Changkug Kim, Yong-Kab Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Ad hoc networks are dynamic networks that consist of mobile nodes. Nodes in Ad hoc networks are usually laptops, PDAs or mobile phones. These devices feature Bluetooth and/or IEEE 802.11 (WiFi) network interfaces and communicate in a decentralized manner. Due to characteristics of Ad-hoc networks, Mobility is a key feature of routing protocol design. In this study, we present an enhanced routing maintenance scheme that cope with topology changes pre-actively. The key feature of the proposed scheme is that switches next-hop node to alternative neighbor node before link breakage for preventing route failure. From extensive experiments by using NS2, the performance of the proposed scheme has been improved by comparison to AODV protocol.
Approximate Solution Sampling (and Counting) on AND/OR Spaces
Authors: Vibhav Gogate, Rina Dechter
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampling/Importance Resampling (SIR) component of our previous scheme of SampleSearch-SIR by taking advantage of the decomposition implied by the network's AND/OR search space. We also describe how our new scheme can approximately count and lower bound the number of solutions of a constraint network. We demonstrate both theoretically and empirically that our new algorithm yields far better performance than competing approaches.
Similarity-Based Information Retrieval and Its Role within Spatial Data Infrastructures
Authors: Krzysztof Janowicz, Marc Wilkes, Michael Lutz
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

While similarity has gained in importance in research about information retrieval on the (geospatial) semantic Web, information retrieval paradigms and their integration into existing spatial data infrastructures have not been examined in detail so far. In this paper, intensional and extensional paradigms for similarity-based information retrieval are introduced. The differences between these paradigms with respect to the query and results are pointed out. Web user interfaces implementing two of these paradigms are presented, and steps towards the integration of the SIM-DL similarity theory into a spatial data infrastructure are discussed. Remaining difficulties are highlighted and directions of further work are given.
Rapid convergence to feature layer correspondences
Authors: Jörg Lücke, Christian Keck, Christoph von der Malsburg
Venue: Neural Computation (2008)

We describe a neural network able to rapidly establish correspondence between neural feature layers. Each of the network's two layers consists of interconnected cortical columns, and each column consists of inhibitorily coupled subpopulations of excitatory neurons. The dynamics of the system builds on a dynamic model of a single column, which is consistent with recent experimental findings. The network realizes dynamic links between its layers with the help of specialized columns that evaluate similarities between the activity distributions of local feature cell populations, are subject to a topology constraint, and can gate the transfer of feature information between the neural layers. The system can robustly be applied to natural images, and correspondences are found in time intervals estimated to be smaller than 100 ms in physiological terms.
Multiphase Data Exchange in Distributed Logic-Algebraic Based Processing
Authors: Leszek Borzemski, Mariusz Fraś
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

The problems formulated for a class of expert systems with knowledge representation in the form of facts can be solved applying the logic-algebraic (LA) method. Parallel processing of logic-algebraic algorithms addresses issue of data exchange. During so called task composition step the data processed on each processor has to be distributed to all other processors. In the paper we introduce a multiphase data exchange used for information dissemination in LA parallel computations. For the assumed processing system model we derive the analytical formulae for the task composition completion time in balanced and non-balanced data distribution.
A Listening Agent Exhibiting Variable Behaviour
Authors: Elisabetta Bevacqua, Maurizio Mancini, Catherine Pelachaud
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Within the Sensitive Artificial Listening Agent project, we propose a system that computes the behaviour of a listening agent. Such an agent must exhibit behaviour variations depending not only on its mental state towards the interaction (e.g., if it agrees or not with the speaker) but also on the agent's characteristics such as its emotional traits and its behaviour style. Our system computes the behaviour of the listening agent in real-time.
Work Process Models
Authors: M. Eggersmann, B. Kausch, H. Luczak, W. Marquardt, C. Schlick, N. Schneider, R. Schneider, M. Theißen
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

Empirical studies are a prerequisite for creating meaningful models of work processes, which can be used to analyze, improve, and automate design processes. In this contribution, a modeling procedure is presented, which comprises the creation of semi-formal models of design processes, their analysis and improvement, and finally the formalization of the models as a prerequisite for the implementation of supportive software tools. Several modeling languages have been created for representing design processes, including the C3 language for participative modeling of design processes on a semi-formal level and a Process Ontology for the formal representation of design processes.
View-Invariant Human Action Detection Using Component-Wise HMM of Body Parts
Authors: Bhaskar Chakraborty, Marco Pedersoli, Jordi Gonzàlez
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper presents a framework for view-invariant action recognition in image sequences. Feature-based human detection becomes extremely challenging when the agent is being observed from different viewpoints. Besides, similar actions, such as walking and jogging, are hardly distinguishable by considering the human body as a whole. In this work, we have developed a system which detects human body parts under different views and recognize similar actions by learning temporal changes of detected body part components. Firstly, human body part detection is achieved to find separately three components of the human body, namely the head, legs and arms. We incorporate a number of sub-classifiers, each for a specific range of view-point, to detect those body parts. Subsequently, we have extended this approach to distinguish and recognise actions like walking and jogging based on component-wise HMM learning.
Estimating the Change of Web Pages
Authors: Sung Jin Kim, Sang Ho Lee
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

This paper presents the estimation methods computing the probabilities of how many times web pages are downloaded and modified, respectively, in the future crawls. The methods can make web database administrators avoid unnecessarily requesting undownloadable and unmodified web pages in a page group. We postulate that the change behavior of web pages is strongly related to the past change behavior. We gather the change histories of approximately three million web pages at two-day intervals for 100 days, and estimate the future change behavior of those pages. Our estimation, which was evaluated by actual change behavior of the pages, worked well.
Performance Validation on Multicore Mobile Devices
Authors: Thomas Hubbard, Raimondas Lencevicius, Edu Metz, Gopal Raghavan
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

The validation of modern software systems on mobile devices needs to incorporate both functional and non-functional requirements. While some progress has been made in validating performance (including power consumption) on current mobile devices, future mobile devices will incorporate multiple processing units, more complex software and hardware that will raise additional challenges. This paper outlines ideas for future directions in performance validation on multicore devices, based on the current work in model-based validation, application state monitoring and performance assertions.
EasyLife: A Location-Aware Service Oriented Mobile Information System
Authors: J. M. Shen, M. J. O'Grady, G. M. O'Hare
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Many examples of Location-aware services have been developed in recent years as the enabling technologies mature. However, these services frequently exist in isolation and address specific niche markets. The diversity of the mobile computing community suggests that enabling dynamic combinations of location-area services would be an appropriate deployment strategy. In this way, customers could subscribe to those services that address their particular needs. This paper introduces EasyLife, an agent-based architecture designed to facilitate the development of suites of location-aware services that customers can configure according to their preferences.
Safe and Reliable Metro Platform Screen Doors Control/Command Systems
Authors: Thierry Lecomte
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

In this article we would like to present some recent applications of the B formal method to the development of safety critical system. These SIL3/SIL4 compliant systems have their functional specification based on a formal model. This model has been proved, guaranteeing a correct by construction behaviour of the system in absence of failure of its components. The constructive process used during system specification and design leads to a high quality system which has been qualified by French authorities. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A low complexity selective mapping OFDM using multiple IFFT stages
Authors: A. Ghassemi, T. Aaron Gulliver
Venue: International Journal of Communication Networks and Distributed Systems (2008)

A low complexity Selective Mapping (SLM) technique for reducing the Peak-to-Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing (OFDM) signal is introduced. The intermediate signals within an N-point IFFT using a radix Decimation In Time (DIT) or Decimation In Frequency (DIF) IFFT algorithm are used to generate the phase sequences. It is shown that DIF provides lower multiplicative complexity in generating the SLM sequences compared to DIT, with the same PAPR reduction. In addition, a high radix FFT algorithm provides better PAPR reduction performance per stage with less multiplicative complexity compared to a low radix algorithm. We further reduce the computational complexity by proposing a low computational complexity technique based on multiplying the phase sequences at multiple IFFT stages. This new technique greatly reduces the multiplicative complexity while providing similar PAPR reduction to Ordinary SLM (O-SLM). The additive complexity is also reduced.
Prediction of Information Diffusion Probabilities for Independent Cascade Model
Authors: Kazumi Saito, Ryohei Nakano, Masahiro Kimura
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

We address a problem of predicting diffusion probabilities in complex networks. As one approach to this problem, we focus on the independent cascade (IC) model, and define the likelihood for information diffusion episodes, where an episode means a sequence of newly active nodes. Then, we present a method for predicting diffusion probabilities by using the EM algorithm. Our experiments using a real network data set show the proposed method works well.
The Role of Computer Graphics and Visualization in the GII
Authors: Nahum Gershon, Judith R. Brown
Venue: IEEE Computer Graphics and Applications (1996)

"The information infrastructure will enable all Americans to access information and communicate with each other easily, reliably, securely, and cost effectively in any medium—voice, data, image, or video—any time, anywhere. This capability will enhance the productivity of work and lead to dramatic improvements in social services, education, and entertainment".Vision for a 21st Century Information InfrastructureReport issued by the Council of CompetitivenessMay 1993
Learning Visual Compound Models from Parallel Image-Text Datasets
Authors: Jan Moringen, Sven Wachsmuth, Sven Dickinson, Suzanne Stevenson
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

In this paper, we propose a new approach to learn structured visual compound models from shape-based feature descriptions. We use captioned text in order to drive the process of grouping boundary fragments detected in an image. In the learning framework, we transfer several techniques from computational linguistics to the visual domain and build on previous work in image annotation. A statistical translation model is used in order to establish links between caption words and image elements. Then, compounds are iteratively built up by using a mutual information measure. Relations between compound elements are automatically extracted and increase the discriminability of the visual models. We show results on different synthetic and realistic datasets in order to validate our approach.
Note: Packing of graphs with small product of sizes
Authors: Alexandr V. Kostochka, Gexin Yu
Venue: Journal of Combinatorial Theory Series B (2008)

We show that for every @e>0, there exists n"0=n"0(@e) such that for every n>n"0, two n-vertex graphs G"1 and G"2 with e(G"1)e(G"2)=
Assessing the Quality of Rules with a New Monotonic Interestingness Measure Z
Authors: Salvatore Greco, Roman Słowiński, Izabela Szczech
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

The development of effective interestingness measures that help in interpretation and evaluation of the discovered knowledge is an active research area in data mining and machine learning. In this paper, we consider a new Bayesian confirmation measure for "if..., then..." rules proposed in [4]. We analyze this measure, called Z, with respect to valuable property M of monotonic dependency on the number of objects in the dataset satisfying or not the premise or the conclusion of the rule. The obtained results unveil interesting relationship between Z measure and two other simple and commonly used measures of rule support and anti-support, which leads to efficiency gains while searching for the best rules.
REBUS-PLS: A response-based procedure for detecting unit segments in PLS path modelling
Authors: V. Esposito Vinzi, L. Trinchera, S. Squillacciotti, M. Tenenhaus
Venue: Applied Stochastic Models in Business and Industry (2008)

Structural equation models (SEMs) make it possible to estimate the causal relationships, defined according to a theoretical model, linking two or more latent complex concepts, each measured through a number of observable indicators, usually called manifest variables. Traditionally, the component-based estimation of SEMs by means of partial least squares (PLS path modelling, PLS-PM) assumes homogeneity over the observed set of units: all units are supposed to be well represented by a unique model estimated on the overall data set. In many cases, however, it is reasonable to expect classes made of units showing heterogeneous behaviours to exist. Two different kinds of heterogeneity could be affecting the data: observed and unobserved heterogeneity. The first refers to the case of a priori existing classes, whereas in unobserved heterogeneity no information is available either on the number of classes or on their composition. If a group structure for the statistical units is given, the aim of the analysis is to search for any differences in the behaviours of the a priori given classes. In PLS-PM this would mean studying the effect of directly observed moderating variables, i.e. estimating as many (local) models as there are classes. Unobserved heterogeneity, instead, implies identifying classes of units (a priori unknown) having similar behaviours. Such heterogeneity is captured by an unobserved (latent) discrete moderating variable defining both the number of classes and the class membership. A new method for unobserved heterogeneity detection in PLS-PM is proposed in this paper: response-based procedure for detecting unit segments in PLS-PM (REBUS-PLS). REBUS-PLS, according to PLS-PM features, does not require distributional hypotheses and may lead to local models that are different in terms of both structural and measurement models. An application of REBUS-PLS on real data will be shown. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Requirements of Users with Disabilities for E-government Services in Greece
Authors: George Margetis, Stavroula Ntoa, Constantine Stephanidis
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

E-government services are a main concern for bringing administrations closer to citizens and businesses. Accessibility to people with disabilities is one of the main characteristics of such services which is necessary in order to achieve wide public acceptance. This paper discusses a requirements elicitation survey for the development of accessible e-government services carried out in Greece in the context of a national project co-funded by the European Social Fund (ESF) and the Hellenic Ministry of Interior. The main survey results are presented and discussed.
On positive periodic solutions of functional difference equations with forcing term and applications
Authors: Xingyuan Liu, Yuji Liu
Venue: Computers Mathematics with Applications (2008)

Consider the following non-autonomous first order functional difference equation @Dx(n)=a(n)x(n)-@lh(n)f(n,x(n),x(n-@t"1(n)),...,x(n-@t"m(n)))+r(n),n@?Z. It is shown that, under certain assumptions, there exist positive periodic solutions. Applications are given to illustrate the main results.
Multiscale Modeling of Biopolymer Translocation Through a Nanopore
Authors: Maria Fyta, Simone Melchionna, Efthimios Kaxiras, Sauro Succi
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

We employ a multiscale approach to model the translocation of biopolymers through nanometer size pores. Our computational scheme combines microscopic Langevin molecular dynamics (MD) with a mesoscopic lattice Boltzmann (LB) method for the solvent dynamics, explicitly taking into account the interactions of the molecule with the surrounding fluid. Both dynamical and statistical aspects of the translocation process were investigated, by simulating polymers of various initial configurations and lengths. For a representative molecule size, we explore the effects of important parameters that enter in the simulation, paying particular attention to the strength of the molecule-solvent coupling and of the external electric field which drives the translocation process. Finally, we explore the connection between the generic polymers modeled in the simulation and DNA, for which interesting recent experimental results are available.
Filtering and Sophisticated Data Processing for Web Information Gathering
Authors: Yuefeng Li, Ning Zhong, Xujuan Zhou, Sheng-Tang Wu
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Mismatch and overload are two fundamental issues regarding the efficiency of Web information gathering. To provide a satisfactory solution, this paper presents a Web information gathering system that encapsulates two phases: the filtering and sophisticated data processing. The objective of the filtering is to quickly filter out most irrelevant data in order to avoid mismatch. The phase of the sophisticated data processing can use more sophisticated techniques without carefully considering time complexities. The second phase is for solving the problem of the information overload.
A 2.4GHz low power highly linear mixer for direct-conversion receivers
Authors: Jenn-Tzer Yang, Yu-Min Mu, Ming-Jeui Wu, Yuan-Hao Lee, Yi-Yuan Huang
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

In this paper, a 2.4GHz low power down- conversion mixer with high linearity for direct-conversion receivers based on a standard 0.18µm CMOS technology is proposed. In the circuit design, Gilbert cell architecture and Common-Gate configuration are used. A simple buffer is applied in the IF output. Simulation results show that the mixer can operate at 2.4GHz and obtain the conversion gain of 11.08dB and the IIP3 of 13.64dBm. The return-loss and the noise figure (NF) are below -28dB and about 14dB, respectively. The low power highly linear mixer consumes around 3.96 mW from 1.8-V power supply.
Evolving Efficient Connection for the Design of Artificial Neural Networks
Authors: Min Shi, Haifeng Wu
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Most of the recent neuroevolution (NE) approaches explore new network topologies based on a neuron-centered design principle. So far evolving connections has been poorly explored. In this paper, we propose a novel NE algorithm called Evolving Efficient Connections (EEC), where the connection weights and the connection paths of networks are evolved separately. We compare our new method with standard NE and several popular NE algorithms, SANE, ESP and NEAT. The experimental results indicate evolving connection weights along with connection paths can significantly enhance the performance of standard NE. Moreover the performances of cooperative coevolutionary algorithms are superior to non-cooperative evolutionary algorithms.
A Neuro-fuzzy Learning System for Adaptive Swarm Behaviors Dealing with Continuous State Space
Authors: Takashi Kuremoto, Masanao Obayashi, Kunikazu Kobayashi, Hirotaka Adachi, Kentaro Yoneda
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Swarm intelligence has brought a new paradise for function optimization, structural optimization, multi-agent systems and other study fields. In our previous work, we proposed a neuro-fuzzy system using reinforcement learning algorithm (actor-critic method with TD error learning algorithm) to acquire optimized swarm behaviors. This paper improves the conventional learning system, which only deals with discrete state space and action space, to solve how a swarm to learn and obtain its adaptive behaviors in the continuous state space. The improved system adopts a new policy function of action which is possible to yield continuous actions corresponding to continuous states. The effectiveness of proposed system is investigated by computer simulations with more kinds of environments for the goal-exploration problem.