ppxscal/embedding_network huggingface dataset:
A Simple Criterion for Nodal 3-connectivity in Planar Graphs
Authors: Colm Ó Dúnlaing
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper gives a simple characterisation of nodally 3-connected planar graphs, which have the property that barycentric mappings, and more generally convex combination mappings, are embeddings. This has applications in numerical analysis (grid generation), and in computer graphics (image morphing, surface triangulations, texture mapping): see [Michael S. Floater (2002). Convex combination maps. In Algorithms for Approximation IV, 18-23, J. Levesley, I.J. Anderson, and J.C. Mason (eds), University of Huddersfield; Geoffrey White (2004). Mesh parametrization for texture mapping. Undergraduate computer science project, Oxford University].
Data-driven fuzzy clustering based on maximum entropy principle and PSO
Authors: Debao Chen, Chunxia Zhao
Venue: Expert Systems with Applications: An International Journal (2009)

To identify the optimum fuzzy rule base is the major difficulty in designing fuzzy model. To design optimum fuzzy rule base, which is traditionally achieved by tedious trial and error process, from numerical data, a novel data-driven fuzzy clustering method based on maximum entropy principle (MEP) and particle swarm optimization (PSO) is proposed. In this algorithm, the memberships of output variables are inferred by maximum entropy principle, and the centers of fuzzy rule base are optimized by PSO. Comparing with the method that designing fuzzy rule base only by PSO or other evolutionary computation methods, the number of parameters to be optimized decreased greatly, and the computation cost declined. To check the effectiveness of the suggested approach, three examples for modeling are examined comparing with the method only using PSO. The performance of the identified fuzzy models is demonstrated.
Towards interactive simulation in automotive design
Authors: Andr&#x00e9; Stork, Clemens-August Thole, Stanislav Klimenko, Igor Nikitin, Lialia Nikitina, Yuri Astakhov
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

One of the important tasks in Mechanical Engineering is to increase the safety of the vehicle and decrease its production costs. This task is typically solved by means of Multiobjective Optimization, which formulates the problem as a mapping from the space of design variables to the space of target criteria and tries to find an optimal region in these multidimensional spaces. Due to high computational costs of numerical simulations, the sampling of this mapping is usually very sparse and scattered. Combining design of experiments methods, metamodeling, new interpolation schemes and innovative graphics methods, we enable the user to interact with simulation parameters, optimization criteria, and come to a new interpolated crash result within seconds. We denote this approach as Simulated Reality, a new concept for the interplay between simulation, optimization and interactive visualization. In this paper we show the application of Simulated Reality for solution of real life car design optimization problems.
Coping with episodic connectivity in heterogeneous networks
Authors: Rao Naveed Bin Rais, Thierry Turletti, Katia Obraczka
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

In this paper, we present an efficient message delivery mechanism that enables distribution/dissemination of messages in an internet connecting heterogeneous networks and prone to disruptions in connectivity. We call our protocol MeDeHa (pronounced "medea") for Message Delivery in Heterogeneous, Disruption-prone Networks. MeDeHa is complementary to the IRTF's Bundle Architecture: while the Bundle Architecture provides storage above the transport layer in order to enable interoperability among networks that support different types of transport layers, MeDeHa stores data at the link layer addressing heterogeneity at lower layers (e.g., when intermediate nodes do not support higher-layer protocols). MeDeHa also takes advantage of network heterogeneity (e.g., nodes supporting more than one network) to improve message delivery. For example, in the case of IEEE 802.11 networks, participating nodes may use both infrastructure- and ad hoc modes to deliver data to otherwise unavailable destinations. Another important feature of MeDeHa is that there is no need to deploy special-purpose nodes such as message ferries, data mules, or throwboxes in order to relay data to intended destinations, or to connect to the backbone network wherever infrastructure is available. The network is able to store data destined to temporarily unavailable nodes for some time depending upon existing storage as well as quality-of-service issues such as delivery delay bounds imposed by the application. We evaluate MeDeHa via simulations using indoor scenarios (e.g. convention centers, exposition halls, museums etc.) and show significant improvement in delivery ratio in the face of episodic connectivity. We also showcase MeDeHa's support for different levels of quality-of-service through traffic differentiation and message prioritization.
Intelligent network functionalities in wireless 4G networks: Integration scheme and simulation analysis
Authors: Noureddine Boudriga, Mohammad S. Obaidat, Faouzi Zarai
Venue: Computer Communications (2008)

In future wireless and mobile environments it is likely that mobile stations will be able to choose between multiple access networks offering competing services. Wireless 4G network should offer a wide use of information processing techniques, efficient manipulation of the network resources, and reuse of network functions. It should also allow the insertion of supplementary capacities making it easy to add services. In this article, first we study the design of intelligent services in wireless fourth generation networks. Then, we propose several intelligent network functionalities to determine the best network to use efficiently. Finally, we study the effect of the intelligent functions on the network performance using simulation analysis.
The playing session: enhanced playability for mobile gamers in massive metaverses
Authors: S. Cacciaguerra, G. D'Angelo
Venue: International Journal of Computer Games Technology (2008)

Internet ubiquity and the success of mobile gaming devices are increasing the interest in wireless access to virtual environments. Mainly due to the mobility factor and wireless medium features, traditional gaming architectures are not enough to guarantee good levels of playability and fairness to mobile gamers. We suggest a new mechanism, called playing session, capable of controlling communications between mobile devices and the game infrastructure. In case of network failures, a mimicking mechanism is in charge of playing, until the communication channel is restored. The goal is to reproduce, with an adequate level of mimesis, the user behavior. According to this approach, it will be possible to enhance the overall playability of Internet games without requiring any modification to the existing communication infrastructure.
A Method for Query Expansion Using the Related Word Extraction Algorithm
Authors: Tetsuya Oishi, Shunsuke Kuramoto, Tsunenori Mine, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 (2008)

When searching for information a user wants, search engines often return lots of results unintended by the user. Query expansion is a promising approach to solve this problem. In the query expansion research, one of big issues is to generate appropriate keywords representing the user's intention. This paper proposes the related word extraction algorithm (RWEA) which pays attention to the distance between sentences where keywords in the original query appear. The RWEA is based on the idea that a word nearby important words is also important. We conducted several experiments to evaluate the RWEA. The results promise the effectiveness of the RWEA for improving search results.
The problem of cooperation among different wireless sensor networks
Authors: Pedro O.S. Vaz de Melo, Felipe D. da Cunha, Jussara M. Almeida, Antonio A.F. Loureiro, Raquel A.F. Mini
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

An important issue in the design of a wireless sensor network (WSN) is to devise techniques to make efficient use of its energy, and thus, extend its lifetime. When two WSNs are deployed at the same place and their sensors cooperate with the other networks forwarding their packets, the distance of the transmissions decreases and, therefore, the power consumption as well. The goal of this work is to examine the extent to which different WSNs can cooperate and save their energy. Simulation results reveal that different densities and data collecting rates among WSNs, the routing algorithm and the path loss exponent have major impact in the establishment of cooperation.
Small satellite remote sensing and applications-history, current and future
Authors: Yong Xue, Yingjie Li, Jie Guang, Xiaoye Zhang, Jianping Guo
Venue: International Journal of Remote Sensing (2008)

The small satellite renaissance began in the 1980s and is changing the economics of space. Technological trends have supported the advancement of small satellites in the 1-500 kg range. The number of countries actively participating has grown substantially during the past years. Satellite constellations (groups of satellites working in concert) are emerging as a powerful and effective application. In this paper, we focus on the small satellites than can perform remote sensing or Earth observation tasks. An overview is presented of the small satellite literature on Earth observation. The aim of the survey is threefold: an introduction for those new to the field, an overview for those working in the field and a reference for those searching for literature on a specific application for Earth observation. Small satellite programmes are classified according to the geographic regions. The small satellite industry and small satellite systems are addressed. In terms of applications, small satellite constellations are discussed in more detail. Finally, future developments are put forward. Telegeoprocessing combined with grid computing will provide the infrastructure and technologies for the development of Processing on Demand for Small Satellite Constellation systems.
Atmospheric aerosols measurements and the reliability problem
Authors: A. D. Yegorov, I. A. Potapova, YU. B. Rzhonsnitskaya
Venue: International Journal of Remote Sensing (2008)

The role and place of the problem on global ecological security in a general problem on global security and risk have been analysed within the experiments programmes initiated by academician K. Ya. Kondratyev. The data obtained within these programmes have necessitated particularly more detailed investigations of atmospheric aerosols characteristics. This paper discusses the problem of the reliability with which the characteristics of atmospheric aerosols are determined from the results of lidar, photoelectric, and filter measurements including mono-and multiposition measurements of backscattering signals, measurements of weak backscattering signals and data comparisons. Rigorous differential and approximate solutions of the lidar equation are analysed. The results of determining the transparency of atmospheric air contaminated with industrial discharges, and automotive exhausts are presented. Substantial variations are found in the relationship between the backscattering coefficient and the extinction coefficient in an inhomogeneous atmosphere. It is concluded that the efficiency of lidar methods for probing the atmosphere based on a rigorous solution of the problem is determined by the definiteness of the region in which they are applicable. The accuracy of lidar measurements can be improved using the dependence of the results on the measurement range. The comparison shows that the asymmetric data-processing scheme is much more effective then the symmetric scheme.
Multiscale facial structure representation for face recognition under varying illumination
Authors: Taiping Zhang, Bin Fang, Yuan Yuan, Yuan Yan Tang, Zhaowei Shang, Donghui Li, Fangnian Lang
Venue: Pattern Recognition (2009)

Facial structure of face image under lighting lies in multiscale space. In order to detect and eliminate illumination effect, a wavelet-based face recognition method is proposed in this paper. In this work, the effect of illuminations is effectively reduced by wavelet-based denoising techniques, and meanwhile the multiscale facial structure is generated. Among others, the proposed method has the following advantages: (1) it can be directly applied to single face image, without any prior information of 3D shape or light sources, nor many training samples; (2) due to the multiscale nature of wavelet transform, it has better edge-preserving ability in low frequency illumination fields; and (3) the parameter selection process is computationally feasible and fast. Experiments are carried out upon the Yale B and CMU PIE face databases, and the results demonstrate that the proposed method achieves satisfactory recognition rates under varying illumination conditions.
Joint Extraction of Compound Entities and Relationships from Biomedical Literature
Authors: Cartic Ramakrishnan, Pablo N. Mendes, Rodrigo A. T. S. da Gama, Guilherme C. N. Ferreira, Amit P. Sheth
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

In this paper we identify some limitations of contemporary information extraction mechanisms in the context of biomedical literature. We present an extraction mechanism that generates structured representations of textual content. Our extraction mechanism achieves this by extracting compound entities, and relationships between them, occuring in text. A detailed evaluation of the relationship and compound entities extracted is presented. Our results show over 62% average precision across 8 relationship types tested with over 82% average precision for compound entity identification.
A non-linearly virtual sample generation technique using group discovery and parametric equations of hypersphere
Authors: Der-Chiang Li, Yao-Hwei Fang
Venue: Expert Systems with Applications: An International Journal (2009)

In manufacturing systems, only a small training dataset can be obtained in the early stages. A small training dataset usually leads to low learning accuracy with regard to classification of machine learning, and the knowledge derived is often fragile, and this is called the small sample problem. This research mainly aims at overcoming this problem using a special nonlinear classification technique to generate virtual samples to enlarge the training dataset for learning improvement. This research proposes a new sample generation method, named non-linear virtual sample generation (NVSG), which combines a unique group discovery technique and a virtual sample generation method using parametric equations of hypersphere. By applying a back-propagation neural network (BPN) as the learning tool, the computational experiments obtained from the simulated dataset and the real dataset quoted from the Iris Plant Database show that the learning accuracy can be significantly improved using NVSG method for very small training datasets.
Sensorimotor coordination aftereffects of exposure to a virtual environment
Authors: Deborah L. Harm, Laura C. Taylor, Millard F. Reschke, Jeffrey T. Somers, Jacob J. Bloomberg
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Virtual reality environments (VRs) offer unique training opportunities, particularly for training astronauts and preadapting them to microgravity. The purpose of the current research was to compare disturbances in eye&#x2013;head&#x2013;hand (EHH) and eye&#x2013;head (GAZE) sensorimotor coordination produced by repeated exposures to VR systems. In general, we observed significant increases in position errors in manual target acquisition for both horizontal and vertical targets. We also observed a significant decrement in the ability of subjects to maintain gaze on horizontal eccentric targets immediately after exposure to VR. These preliminary findings provide some direction for developing training schedules for VR users that facilitate adaptation and support the idea that VRs may serve as an analog for sensorimotor effects of spaceflight.
Rtreemix
Authors: Jasmina Bogojeska, Adrian Alexa, André Altmann, Thomas Lengauer, Jörg Rahnenführer
Venue: Bioinformatics (2008)

Summary: In genetics, many evolutionary pathways can be modeled by the ordered accumulation of permanent changes. Mixture models of mutagenetic trees have been used to describe disease progression in cancer and in HIV. In cancer, progression is modeled by the accumulation of chromosomal gains and losses in tumor cells; in HIV, the accumulation of drug resistance-associated mutations in the viral genome is known to be associated with disease progression. From such evolutionary models, genetic progression scores can be derived that assign measures for the disease state to single patients. Rtreemix is an R package for estimating mixture models of evolutionary pathways from observed cross-sectional data and for estimating associated genetic progression scores. The package also provides extended functionality for estimating confidence intervals for estimated model parameters and for evaluating the stability of the estimated evolutionary mixture models. Availability:Rtreemix is an R package that is freely available from the Bioconductor project at http://www.bioconductor.org and runs on Linux and Windows. Contact: jasmina@mpi-inf.mpg.de
Estimation of the cost resulting from mobility management protocols using a generic mathematical model
Authors: Ali Diab, Andreas Mitschele-Thiel, Florian Liers
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

An important challenge for "All-IP" wireless networks is the development of solutions for seamless mobility. A lot of mobility management protocols have been developed to match real-time requirements in these networks. Estimation of the cost, resulting from deploying these protocols, is very important. So far, this cost are estimated by developing a mathematical model for each individual protocol. Until now, there is no generic mathematical model that can be used for a wide range of mobility management protocols. In this paper, such a generic mathematical model is proposed. The parameters of the generic model are chosen to reflect the characteristics of the studied protocols, mobility patterns and network topologies. A case study motivates the selected parameters for Mobile IP version 6 (MIPv6) and includes the given network topology and mobility pattern. The main advantage of the developed generic model is the fast, simple and accurate cost estimation.
Managing Very-Large Distributed Datasets
Authors: Miguel Branco, Ed Zaluska, David Roure, Pedro Salgado, Vincent Garonne, Mario Lassnig, Ricardo Rocha
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

In this paper, we introduce a system for handling very large datasets, which need to be stored across multiple computing sites. Data distribution introduces complex management issues, particularly as computing sites may make use of different storage systems with different internal organizations. The motivation for our work is the ATLAS Experiment for the Large Hadron Collider (LHC) at CERN, where the authors are involved in developing the data management middleware. This middleware, called DQ2, is charged with shipping petabytes of data every month to research centers and universities worldwide and has achieved aggregate throughputs in excess of 1.5 Gbytes/sec over the wide-area network. We describe DQ2's design and implementation, which builds upon previous work on distributed file systems, peer-to-peer systems and Data Grids. We discuss its fault tolerance and scalability properties and briefly describe results from its daily usage for the ATLAS Experiment.
A vision-based fuzzy logic controller for backing-up an autonomous vehicle
Authors: Wei Cheng Wang, Rongshun Chen
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2008)

This paper reports a real-time approach for backing-up car control, in which an image sensor and a fuzzy logic controller are utilized. In the system, a CCD camera is employed as an image sensor for detecting motions of a backing-up car. The fuzzy logic controller receives the motion information from the image sensor, and then generates the steering signal of the car to complete a closed-loop control system of backing-up an autonomous vehicle. The MATLAB/Simulink&reg; are installed in a PC to execute the control action through a model car, driven by two electric motors. Both simulations and experimental results are presented to verify the feasibility of the proposed method.
DiMo: distributed node monitoring in wireless sensor networks
Authors: Andreas Meier, Mehul Motani, Hu Siquan, Simon Künzli
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Safety-critical wireless sensor networks, such as a distributed fire- or burglar-alarm system, require that all sensor nodes are up and functional. If an event is triggered on a node, this information must be forwarded immediately to the sink, without setting up a route on demand or having to find an alternate route in case of a node or link failure. Therefore, failures of nodes must be known at all times and in case of a detected failure, an immediate notification must be sent to the network operator. There is usually a bounded time limit, e.g., five minutes, for the system to report network or node failure. This paper presents DiMo, a distributed and scalable solution for monitoring the nodes and the topology, along with a redundant topology for increased robustness. Compared to existing solutions, which traditionally assume a continuous data-flow from all nodes in the network, DiMo observes the nodes and the topology locally. DiMo only reports to the sink if a node is potentially failed, which greatly reduces the message overhead and energy consumption. DiMo timely reports failed nodes and % greatly minimizes the false-positive rate and energy consumption compared with other prominent solutions for node monitoring.
Exploring local community structures in large networks
Authors: Feng Luo, James Z. Wang, Eric Promislow
Venue: Web Intelligence and Agent Systems (2008)

In this paper, three new algorithms, a greedy algorithm, a KL-like algorithm, and an add-all algorithm, are proposed to find local optimal community structures in large networks starting from a given source vertex. The time complexity for finding a local community of all these algorithms is O(K 2d), where K is the number of vertices to be explored in the sub-graph and d is the average degree of the vertices in the sub-graph. A JAVA tool is developed based on these algorithms to identify local community structures in large networks. The results of using this tool to analyze a co-purchase network from Amazon.com show that local community structures exist in this large-scale co-purchase network. Further analyses of the identified local communities show that purchases of media items form more compact local communities than purchases of book items do, indicating that recommending digital media items to customers based on co-purchasing information in the online store is more efficient than recommending books.