ppxscal/embedding_network huggingface dataset:
Intelligent Electric Power Monitor and Meter Reading System Based on Power Line Communication and OFDM
Authors: Qi-Song Chen, Xiao-Wei Chen
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

With the development of high rate data transmission technology via distribution line communication, the electric power, data, voice and video can be transferred in the same electric power distribution network, and the technology will be put in operation widely in the future. However the traditional technology of power line communication is not adaptable to the complex and harsh environment of distribution line channel. To achieve the task, this paper analyzes the nature of low voltage power line channel, explains the principle of Orthogonal Frequency Division Multiplexing, and introduces a practical communication system over PLC based on OFDM with hardware and software realization. Meanwhile, to improve the performance of the intelligent monitor system, the prediction system, based on data mining preparation and Least Squares Support Vector Machine, is presented for the short-term electric power consumption monitor system. In practice, the new intelligent system is highly reliable, economical, expendable, and works well.
Object-Oriented Implementation of Adaptive Mesh Refinement Algorithms
Authors: William Y. Crutchfield, Michael L. Welcome
Venue: Scientific Programming (1993)

We describe C++ classes that simplify development of adaptive mesh refinement (AMR) algorithms. The classes divide into two groups, generic classes that are broadly useful in adaptive algorithms, and application-specific classes that are the basis for our AMR algorithm. We employ two languages, with C++ responsible for the high-level data structures, and Fortran responsible for low-level numerics. The C++ implementation is as fast as the original Fortran implementation. Use of inheritance has allowed us to extend the original AMR algorithm to other problems with greatly reduced development time.
Hybrid Learning and Ubiquitous Learning
Authors: Ji-Ping Zhang
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

Ubiquitous learning (U-Learning) has an increasing trend as the coming forth of more new media and instructional ideas. U-Learning focuses on the combination of learning environment and substance space, emphasizing the learning can be happen as seeing, hearing, reading, or apperceiving whenever the learner wanted. Hybrid learning, sometimes called "blended learning", emphasizes to maximize student's learning within different learning environments (traditional and digital). It also means that learning requires students to meet for face to face classes while providing much of the learning content and interaction online via delivery software and instructional tools.This paper will discuss concept and characteristics of U-learning and H-learning, the different between the H- and U-learning, and their relationship.
Convergence analysis of sectional methods for solving breakage population balance equations-II: the cell average technique
Authors: Jitendra Kumar, Gerald Warnecke
Venue: Numerische Mathematik (2008)

This work presents the convergence of the cell average technique (Kumar et al. in Powder Technol 179:205&#x2013;228, 2007) for solving breakage population balance equation. Similarly to our paper Kumar and Warnecke (Numerische Math, 2008) of this series, we study convergence on four different types of meshes. A second order convergence is proved for uniform, locally uniform and non-uniform smooth meshes. Finally the scheme is analyzed on random mesh and it is found that the scheme is only first order accurate. Nevertheless we obtain for locally uniform as well as for random mesh one order higher accuracy than the fixed pivot technique discussed by the authors in the first paper. All mathematical observations of convergence analysis are also validated numerically and numerical results are compared with the results of the first part.
Data Structure for Association Rule Mining: T-Trees and P-Trees
Authors: Frans Coenen, Paul Leng, Shakil Ahmed
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Two new structures for Association Rule Mining (ARM), the T-tree, and the P-tree, together with associated algorithms, are described. The authors demonstrate that the structures and algorithms offer significant advantages in terms of storage and execution time.
Adaptive Synchronization of Delayed Chaotic Systems
Authors: Lidan Wang, Shukai Duan
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

In this paper the adaptive synchronization between two delayed chaotic systems with uncertain parameters is investigated. The sufficient condition for parameter identification is derived based on the Lyapunov stability theory. Through choosing the appropriate adaptive controller, parameter identification and adaptive synchronization can be achieved simultaneously. Finally, numerical results illustrate the effectiveness of the theorems.
Timing optimization via nest-loop pipelining considering code size
Authors: Qingfeng Zhuge, Chun Jason Xue, Meikang Qiu, Jingtong Hu, Edwin H. -M. Sha
Venue: Microprocessors Microsystems (2008)

Embedded systems have strict timing and code size requirements. Software pipelining is one of the most important optimization techniques to improve the execution time of loops by increasing the parallelism among successive loop iterations. However, there is no effective techniques exist for solving the software pipelining problem on nested loops. The existing software pipelining techniques for single loops can only explore the parallelism of the innermost loop, so the final timing performance is inferior. While multi-dimensional (MD) retiming can explore the outer loop parallelism, it introduces large overheads in loop index generation and code size due to loop transformation. In this paper, we show how the computation time and code size of a pipelined nested loop is affected by execution sequence and retiming, assuming there is no loop unfolding. We present the theory of Software PIpelining for NEsted loops (SPINE) to reveal the relationship among the computation time of an iteration, the execution sequence, and the software pipelining degree of a nested loop using retiming concepts. Two algorithms of Software PIpelining for NEsted loops (SPINE) are proposed based on the fundamental understanding of the properties of software pipelining for nested loops: the SPINE-FULL algorithm generates fully parallelized loops with the minimal overheads. The SPINE-ROW-WISE algorithm achieves the maximal parallelism in an iteration with a fixed row-wise execution sequence. Therefore, the overheads due to loop transformation are minimal. Our technique can be directly applied to imperfect nested loops. The experimental results show that the average improvement on the execution time of the pipelined loop generated by SPINE is 71.7% compared with that generated by the standard software pipelining technique. The average code size is reduced by 69.5% compared with that generated by the MD retiming technique.
Design and implementation of an efficient web cluster with content-based request distribution and file caching
Authors: Mei-Ling Chiang, Yu-Chen Lin, Lian-Feng Guo
Venue: Journal of Systems and Software (2008)

We have implemented an efficient and scalable web cluster named LVS-CAD/FC (i.e. LVS with Content-Aware Dispatching and File Caching). In LVS-CAD/FC, a kernel-level one-way content-aware web switch based on TCP Rebuilding is implemented to examine and distribute the HTTP requests from clients to web servers, and the fast Multiple TCP Rebuilding is implemented to efficiently support persistent connection. Besides, a file-based web cache stores a small set of the most frequently accessed web files in server RAM to reduce disk I/Os and a light-weight redirect method is developed to efficiently redirect requests to this cache. In this paper, we have further proposed new policies related to content-based workload-aware request distribution, in which the web switch considers the content of requests and workload characterization in request dispatching. In particular, web files with more access frequencies would be duplicated in more servers' file-based caches, such that hot web files can be served by more servers. Our goals are to improve cluster performance by obtaining better memory utilization and increasing the cache hit rates while achieving load balancing among servers. Experimental results of practical implementation on Linux show that LVS-CAD/FC is efficient and scales well. Besides, LVS-CAD/FC with the proposed policies can achieve 66.89% better performance than the Linux Virtual Server with a content-blind web switch.
Fast and Informed Action Selection for Planning with Sensing
Authors: Alexandre Albore, Héctor Palacios, Hector Geffner
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)

Consider a robot whose task is to pick up some colored balls from a grid, taking the red balls to a red spot, the blue balls to a blue spot and so on, one by one, without knowing either the location or color of the balls but having a sensor that can find out both when a ball is near. This problem is simple and can be solved by a domain-independent contingent planner in principle, but in practice this is not possible: the size of any valid plan constructed by a contingent planner is exponential in the number of observations which in these problems is very large. This doesn't mean that planning techniques are of no use for these problems but that building or verifying complete contingent plans is not feasible in general. In this work, we develop a domain-independent action selection mechanism that does not build full contingent plans but just chooses the action to do next in a closed-loop fashion. For this to work, however, the mechanism must be both fast and informed. We take advantage of recent ideas that allow delete and precondition-free contingent problems to be converted into conformant problems, and conformant problems into classical ones, for mapping the action selection problem in contingent planning into an action selection problem in classical planning that takes sensing actions into account. The formulation is tested over standard contingent planning benchmarks and problems that require plans of exponential size.
Medical Image Segmentation Using New Hybrid Level-Set Method
Authors: Yan Zhang, Bogdan J. Matuszewski, Lik-Kwan Shark, Christopher J. Moore
Venue: Proceedings of the 2008 Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (2008)

In this paper, a new hybrid medical image segmentation method in the level-set framework is proposed. The method uses both the object’s boundary and region information to achieve robust and accurate segmentation results. The boundary information can help to detect the precise location of the target object and the region information can help to prevent the boundary leakage problem. Experimental results on a synthetic image as well as real 2D and 3D medical images are also shown in the paper with the emphasis on the comparisons between the new hybrid method and the Chan-Vese method.
Developing a Quality Framework for Model-Driven Engineering
Authors: Parastoo Mohagheghi, Vegard Dehlen
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

This paper presents some related work on quality frameworks and requirements for evaluating them. It also discusses characteristics of model-driven engineering that are important when building a quality framework, such as its use of models in several stages of development and maintenance, generation of other artifacts from models and its multi-abstraction level approach that requires consistency and traceability. We present a 7-step process on how to define a quality framework that is adapted to model-driven engineering, and which integrates quality engineering with quality evaluation. As an example, the framework is applied on transformation quality. We maintain that the transformation process and transformation mapping should be discussed separately, as they require different approaches, and suggest quality goals, quality-carrying properties to achieve the quality goals and methods for evaluating these properties.
Imitation Learning in Uncertain Environments
Authors: Steffen Priesterjahn, Markus Eberling
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper describes a new evolutionary learning method to handle the fast adaptation of a group of agents in an uncertain environment. The method is a result of our research towards the generation of intelligent agents in computer games and is inspired by the idea of social learning or cultural evolution. Thus, the agents try to adapt by the exchange of information about advantageous behaviours within the population. This paper evaluates the new approach by addressing the generation of competitive artificial players in a real-time action game.
Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles International Airport
Authors: James Pita, Manish Jain, Janusz Marecki, Fernando Ordóñez, Christopher Portway, Milind Tambe, Craig Western, Praveen Paruchuri, Sarit Kraus
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent full security coverage at all times, which allows adversaries to observe and exploit patterns in selective patrolling or monitoring, e.g. they can plan an attack avoiding existing patrols. Hence, randomized patrolling or monitoring is important, but randomization must provide distinct weights to different actions based on their complex costs and benefits. To this end, this paper describes a promising transition of the latest in multi-agent algorithms -- in fact, an algorithm that represents a culmination of research presented at AAMAS - into a deployed application. In particular, it describes a software assistant agent called ARMOR (Assistant for Randomized Monitoring over Routes) that casts this patrolling/monitoring problem as a Bayesian Stackelberg game, allowing the agent to appropriately weigh the different actions in randomization, as well as uncertainty over adversary types. ARMOR combines three key features: (i) It uses the fastest known solver for Bayesian Stackelberg games called DOBSS, where the dominant mixed strategies enable randomization; (ii) Its mixed-initiative based interface allows users to occasionally adjust or override the automated schedule based on their local constraints; (iii) It alerts the users if mixed-initiative overrides appear to degrade the overall desired randomization. ARMOR has been successfully deployed since August 2007 at the Los Angeles International Airport (LAX) to randomize checkpoints on the roadways entering the airport and canine patrol routes within the airport terminals. This paper examines the information, design choices, challenges, and evaluation that went into designing ARMOR.
Lattice Boltzmann Simulation of Mixed Convection in a Driven Cavity Packed with Porous Medium
Authors: Zhenhua Chai, Zhaoli Guo, Baochang Shi
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The problem of mixed convection in a driven cavity packed with porous medium is studied with lattice Boltzmann method. A lattice Boltzmann model for incompressible flow in porous media and another thermal lattice Boltzmann model for solving the energy equation are proposed based on the generalized volume-averaged flow model. The present models have been validated by simulating mixed convection in a driven cavity (without porous medium) and it is found that the numerical results predicted by present models are in good agreement with available data reported in previous studies. Extensive parametric studies on mixed convection in a driven cavity filled with porous medium are carried out for various values of Reynolds number, Richardson number and Darcy number. It is found that the flow and temperature patterns change greatly with variations of these parameters.
Noise-Induced Adaptive Decision-Making in Ant-Foraging
Authors: Bernd Meyer, Madeleine Beekman, Audrey Dussutour
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

Ant foraging is a paradigmatic example of self-organized behavior. We give new experimental evidence for previously unobserved short-term adaptiveness in ant foraging and show that current mathematical foraging models cannot predict this behavior. As a true extension, we develop Itô diffusion models that explain the newly discovered behavior qualitatively and quantitatively. The theoretical analysis is supported by individual-based simulations. Our work shows that randomness is a key factor in allowing self-organizing systems to be adaptive. Implications for technical applications of Swarm Intelligence are discussed.
Mitochondrial SNPs associated with Japanese centenarians, Alzheimer's patients, and Parkinson's patients
Authors: Shigeru Takasaki
Venue: Computational Biology and Chemistry (2008)

In this paper we examined the relations between three classes of people (96 Japanese centenarians, 96 Japanese Alzheimer's disease (AD) patients and 96 Japanese Parkinson's disease (PD) patients) and their mitochondrial single nucleotide polymorphism (mtSNP) frequencies at individual mitochondrial DNA (mtDNA) positions of the entire mt-genome by using the radial basis function (RBF) networks. As a result, we got new findings of mtSNPs for representing characteristics of individual classes. These mtSNPs show distinct differences for three classes of people. That is, individual classes of people are characterized by unique mtSNPs. Interestingly, Japanese centenarians are closely associated with haplogroup D4, Japanese AD patients with haplogroup G2a, and Japanese PD patients with haplogroup M7a. These characteristics of mtSNPs are different from those of previously reported works. As the amino acid replacement mtSNPs were at four mtDNA positions, it is indicated that mtSNPs of synonymous nucleotide substitutions as well as those of nonsynonymous nucleotide substitutions may play important roles in mitochondrial functions.
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Authors: Alfonsas Misevičius
Venue: Informatica (2006)

Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the performance of the genetic search in the context of the grey pattern problem (GPP) are discussed. The main attention is paid to the investigation of the solution recombination, i.e., crossover operators which play an important role by developing robust genetic algorithms. We implemented seven crossover operators within the hybrid genetic algorithm (HGA) framework, and carried out the computational experiments in order to test the influence of the recombination operators to the genetic search process. We examined the one point crossover, the uniform like crossover, the cycle crossover, the swap path crossover, and others. A so-called multiple parent crossover based on a special type of recombination of several solutions was tried, too. The results obtained from the experiments on the GPP test instances demonstrate promising efficiency of the swap path and multiple parent crossovers.
A Case for Multimedia Streaming over the Grid Infrastructure
Authors: Lambros Lambrinos, Fotis Georgatos
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

The grid infrastructure consists of nodes all over the world which are usually interconnected with high speed network links and provide storage and processing facilities. In this paper, we investigate how this massive infrastructure can be utilized to facilitate efficient and scaleable real-time multimedia streaming. The aim is to avoid the issues usually associated with one-to-many media streaming architectures through the use of a mechanism that initiates reflectors as and when they are needed thereby reducing bandwidth-related bottlenecks and ensuring that the delay between the last media distribution point and the receiving client is as low as possible.
Tools for Deaf Accessibility to an eGOV Environment
Authors: Stavroula-Evita Fotinea, Eleni Efthimiou
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper focuses on design and implementation of deaf accessibility tools currently integrated in a portal environment intended to serve communication of disabled citizens with the Hellenic State. Deaf accessibility is supported by a sign language terminology glossary, while interaction with the portal is supported by the use of a virtual finger-spelling and digit keyboard. In order to facilitate overall interaction of users with the portal environment, a manual-like facility has been developed in the form of fully accessible courses, which direct the unfamiliar user and cover all aspects of the portal's services and use of accessibility tools.
Noisy Road Network Matching
Authors: Yago Diez, Mario A. Lopez, J. Antoni Sellarès
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

Let $\mathcal{N}$ and $\mathcal{M}$ be two road networks represented in vector form and covering rectangular areas R and R¿, respectively, not necessarily parallel to each other, but with R¿ ¿ R. We assume that $\mathcal{N}$ and $\mathcal{M}$ use different coordinate systems at (possibly) different, but known scales. Let $\mathcal{B}$ and $\mathcal{A}$ denote sets of "prominent" road points (e.g., intersections) associated with $\mathcal{N}$ and $\mathcal{M}$, respectively. The positions of road points on both sets may contain a certain amount of "noise" due to errors and the finite precision of measurements. We propose an algorithm for determining approximate matches, in terms of the bottleneck distance, between $\mathcal{A}$ and a subset $\mathcal{B}'$ of $\mathcal{B}$. We consider the characteristics of the problem in order to achieve a high degree of efficiency. At the same time, so as not to compromise the usability of the algorithm, we keep the complexity required for the data as low as possible. As the algorithm that guarantees to find a possible match is expensive due to the inherent complexity of the problem, we propose a lossless filtering algorithm that yields a collection of candidate regions that contain a subset S of $\mathcal{B}$ such that $\mathcal{A}$ may match a subset $\mathcal{B}'$ of S. Then we find possible approximate matchings between $\mathcal{A}$ and subsets of S using the matching algorithm. We have implemented the proposed algorithm and report results that show the efficiency of our approach.