ppxscal/embedding_network huggingface dataset:
Research on Neural Networks Based on Culture Particle Swarm Optimization and Its Application in Power Load Forecasting
Authors: Dongxiao Niu, Mian Xing
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The neural network has been applied to the area of power load forecast successfully, but it has such disadvantages of local optimization and slow convergence speed. A new kind of neural networks forecast model based on culture particle swarm optimization was proposed for overcoming those disadvantages. Utilizing the colony aptitude of particle swarm and the ability of conserving the evolving knowledge of the culture algorithm, the new algorithm (called culture particle swarm optimization) constructed the population space based on particle swarm and the knowledge space. The two spaces evolved independently, at the same time, the population space continuously transferred the evolving knowledge to the knowledge space, and then the knowledge space used that knowledge to direct the population space to achieve global optimization. This algorithm can solve the above disadvantages of normal neural networks and the premature problem of particle swarm optimization. The application in power load forecasting showed that this neural network based on culture particle swarm optimization achieved better forecast result.
Australian case studies in mobile commerce
Authors: Jonathan O'Donnell, Margaret Jackson, Marita Shelly, Julian Ligertwood
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2007)

Sixteen wireless case studies highlight issues relating to mobile commerce in Australia. The issues include: the need for a clear business case; difficulty of achieving critical mass and acceptance of a new service; training and technical issues, as well as staff acceptance issues; that privacy and security issues arise through the potential to track the location of people and through the amounts of personal data collected; difficulties in integrating with existing back-end systems; projects being affected by changes to legislation, or requiring changes to the law; and that while there is potential for mobile phone operators to develop new billing methods that become new models for issuing credit, they are not covered by existing credit laws. We have placed the case studies in a Fit-Viability framework and analyzed the issues according to key success criteria. While many organizations are keen to use the technology, they are struggling to find a compelling business case for adoption and that without a strong business case projects are unlikely to progress past the pilot stage.
A confidence-based framework for business to consumer (B2C) mobile commerce adoption
Authors: Yuk Kuen Wong, Chao Jung Hsu
Venue: Personal and Ubiquitous Computing (2008)

The Technology Acceptance Model (TAM) has been considered to be fundamental in determining the acceptance of new technology in the past decades. The two beliefs, ease of use and usefulness, in the model may not, however, fully explain the consumers' behavior in an emerging environment, such as mobile commerce (m-commerce). This paper aims to develop a framework for m-commerce adoption in consumer decision-making processes. In this paper TAM has been adopted and extended to analyze successful m-commerce adoption. The key elements of the proposed confidence-based framework for B2C m-commerce adoption include psychological and behavioral factors. Psychological factors include history-based confidence, institution-based confidence and personality-based confidence. Behavioral factors include perceived ease of use and perceived usefulness of the mobile application and technology.
Simultaneous dynamic voltage scaling of processors and communication links in real-time distributed embedded systems
Authors: Jiong Luo, Niraj K. Jha, Li-Shiuan Peh
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Dynamic voltage scaling has been widely acknowledged as a powerful technique for trading off power consumption and delay for processors. Recently, variable-frequency (and variable-voltage) parallel and serial links have also been proposed, which can save link power consumption by exploiting variations in the bandwidth requirement. This provides a new dimension for power optimization in a distributed embedded system connected by a voltage-scalable interconnection network. At the same time, it imposes new challenges for variable-voltage scheduling as well as flow control. First, the variable-voltage scheduling algorithm should be able to trade off the power consumption and delay jointly for both processors and links. Second, for the variable-frequency network, the scheduling algorithm should not only consider the real-time constraints, but should also be consistent with the underlying flow control techniques. In this paper, we address joint dynamic voltage scaling for variable-voltage processors and communication links in such systems. We propose a scheduling algorithm for real-time applications that captures both data flow and control flow information. It performs efficient routing of communication events through multihops, as well as efficient slack allocation among heterogeneous processors and communication links to maximize energy savings, while meeting all real-time constraints. Our experimental study shows that on an average, joint voltage scaling on processors and links can achieve 32% less power compared with voltage scaling on processors alone.
Design Opportunity Tree of Capability Improve for Level-up and Software Process Improvement
Authors: Eun-Ser Lee, Haeng-kon Kim, Sun-myoung Hwang
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

There are many risk items of the project development that cause the process maturity level occurring in the quality problems during process management and project progress. This paper designs the opportunity tree that level-up the current environments and their problems solution as well. For the similar projects, we can estimate defects and prepare to solve them by using domain expert knowledge and the opportunity tree, which can greatly improve the software process. And this paper reference ISO/IEC 15504 as the international standard. Also, this paper is intended to develop the relationship between process improvement and their causes to introduce. Therefore, using defect causes, we understand the associated relationship between AHP and design Opportunity Tree to level-up.
Context-based filtering for assisted brain-actuated wheelchair driving
Authors: Gerolf Vanacker, José del R. Millán, Eileen Lew, Pierre W. Ferrez, Ferran Galán Moles, Johan Philips, Hendrik Van Brussel, Marnix Nuttin
Venue: Computational Intelligence and Neuroscience (2007)

Controlling a robotic device by using human brain signals is an interesting and challenging task. The device may be complicated to control and the nonstationary nature of the brain signals provides for a rather unstable input. With the use of intelligent processing algorithms adapted to the task at hand, however, the performance can be increased. This paper introduces a shared control system that helps the subject in driving an intelligent wheelchair with a noninvasive brain interface. The subject's steering intentions are estimated from electroencephalogram (EEG) signals and passed through to the shared control system before being sent to the wheelchair motors. Experimental results show a possibility for significant improvement in the overall driving performance when using the shared control system compared to driving without it. These results have been obtained with 2 healthy subjects during their first day of training with the brain-actuated wheelchair.
Evaluation of partial path queries on xml data
Authors: Stefanos Souldatos, Xiaoying Wu, Dimitri Theodoratos, Theodore Dalamagas, Timos Sellis
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML query processing. Many algorithms have been presented for this operation. These algorithms focus mainly on the evaluation of path-pattern or tree-pattern queries. In this paper, we define a partial path-pattern query language, and we address the problem of its efficient evaluation on XML data. In order to process partial path-pattern queries, we introduce a set of sound and complete inference rules to characterize structural relationship derivation. We provide necessary and sufficient conditions for detecting query unsatisfiability and node redundancy. We show how partial path-pattern queries can be equivalently put in a canonical directed acyclic graph form. We developed two stack-based algorithms for the evaluation of partial path-pattern queries, PartialMJ and PartialPathStack. PartialMJ computes answers to the query by merge-joining the results of the root-to-leaf paths of a spanning tree of the query. PartialPathStack exploits a topological order of the nodes of the query graph to match the query pattern as a whole to the XML tree. The experimental evaluation of our algorithms shows that PartialPathStack is independent of intermediate results and largely outperforms PartialMJ.
Current Issues in the Architecture of Microprocessors
Authors: B. L. Peuto
Venue: Computer (1977)

Despite the fact that microcomputers have existed commercially for only five years, microcomputer architecture is not an entirely new field. It is, rather, the application of the general principles of computer architecture to microcomputers. In "Planning a Computer System," Frederick P. Brooks Jr. defines computer architecture as being, like other architecture, "the art of determining the needs of the user of the structure and then designing to meet those needs as effectively as possible within economic and technological constraints."1
On-Line Diagnosis of Unrestricted Faults
Authors: J. F. Meyer
Venue: IEEE Transactions on Computers (1975)

A formal model for the study of on-line diagnosis is introduced and used to investigate the diagnosis of unrestricted faults. Within this model a fault of a system S is considered to be a transformation of S into another system S' at some time r. The resulting faulty system is taken to be the system which looks like S up to time r and like S' thereafter. Notions of fault tolerance and error are defined in terms of the resulting system being able to mimic some desired behavior as specified by a system S. A notion of on-line diagnosis is formulated which involves an external detector and a maximum time delay within which every error caused by a fault in a prescribed set must be detected.
A Domain-Configurable Development Environment for Service-Oriented Applications
Authors: Philippe Lalanda, Cristina Marin
Venue: IEEE Software (2007)

Composing software services requires solving both low-level technical problems and high-level semantic issues. Two complementary tools allow service composition within domains. The first lets users develop general service-oriented applications. It relies on the notions of abstract and concrete services and uses a generative approach to obtain executable applications. The second tool lets users define domain-specific knowledge and specialize the first tool for a given domain. The resulting domain-centric environment allows for abstract specifications of service-oriented applications. The authors have successfully used this environment to develop Internet gateways in the power-distribution field. This article is part of a special issue on service-centric software systems.
Automated Design of Multiple-Valued Logic Circuits by Automatic Theorem Proving Techniques
Authors: W. S. Wojciechowski
Venue: IEEE Transactions on Computers (1983)

This paper describes a method for the automatic synthesis of multiple-valued combinational logic circuits using automatic theorem proving techniques. Logic design of multiple-valued circuits is considerably more complex than binary design because of the associated combinatorial explosion. Two general approaches which can be taken in axiomatizing the environment of combinational logic design in multiple-valued logic have been investigated. These axiomatizations, formulated in the language of first order logic, are used to state the problem of combinational logic design as a theorem proving problem. This formulation together with a representation of the function being designed can be used as input to an automatic theorem proving program. The circuit design can then be obtained from the proof generated by the theorem prover.
New Join Operator Definitions and Implementation Methods for Sensor Networks
Authors: Seungjae Lee, Changhwa Kim, Sangkyung Kim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Recently, researches on relational database approaches to sensor networks are being tried. There occur, however, some problems in applying directly the traditional relational database concepts into a sensor network in that every database operation is performed only on the real existing data which are tuples in database relations. In addition, when searching tuples, it extracts only the tuples of which attribute values are exactly same with key values. These causes some problems to perform join operation in sensor networks. For instance, let us assume a sensor network that two different classes of nodes are randomly scattered in the same area. We cannot get join results to know the relationship between two different classes of sensing values because there might be no nodes at a exact same location. For a solution about the above described problem we propose in this paper new join operators its implementation method. This new join operators could provide more effective data management and standard interfaces to application programs in sensor networks. In addition, it would decrease energy consumption of nodes reducing the number of transmission.
RFID Indoor Positioning Based on Probabilistic RFID Map and Kalman Filtering
Authors: Abdelmoula Bekkali, Horacio Sanson, Mitsuji Matsumoto
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

developing technology which uses wireless communication for automatic identification of objects. The localization of RFID tagged objects in their environment is becoming an important feature for the ubiquitous computing applications. In This paper we introduce a new positioning algorithm for RFID tags using two mobile RFID readers and landmarks which are passive or active tags with known location and distributed randomly. We present an analytical method for estimating the location of the unknown tag by using the multilateration with the landmarks and a probabilistic RFID map-based technique with Kalman Filtering to enhance the location estimation of the tag. This algorithm is independent from the readers coordinates, and hence it can be more practical due to its mobility and its low cost to achieve a high deployment of this emerging technology. Results obtained after conducting extensive simulations demonstrate the validity and suitability of the proposed algorithm to provide high performance level in terms of accuracy and scalability. Index Terms-- RFID, Indoor Location Estimation, Kalman Filtering, Probabilistic Map Matching.
Fast Iterative Kernel Principal Component Analysis
Authors: Simon Günter, Nicol N. Schraudolph, S. V. N. Vishwanathan
Venue: The Journal of Machine Learning Research (2007)

We develop gain adaptation methods that improve convergence of the kernel Hebbian algorithm (KHA) for iterative kernel PCA (Kim et al., 2005). KHA has a scalar gain parameter which is either held constant or decreased according to a predetermined annealing schedule, leading to slow convergence. We accelerate it by incorporating the reciprocal of the current estimated eigenvalues as part of a gain vector. An additional normalization term then allows us to eliminate a tuning parameter in the annealing schedule. Finally we derive and apply stochastic meta-descent (SMD) gain vector adaptation (Schraudolph, 1999, 2002) in reproducing kernel Hilbert space to further speed up convergence. Experimental results on kernel PCA and spectral clustering of USPS digits, motion capture and image denoising, and image super-resolution tasks confirm that our methods converge substantially faster than conventional KHA. To demonstrate scalability, we perform kernel PCA on the entire MNIST data set.
Variation Measure between Fuzzy Variables Using Inverse Credibility Distributions
Authors: Jin Peng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Variation measure between fuzzy variables, as a type of distance-like measure, is an important topic in fuzzy the- ory and there are many ways to define a variation mea- sure between fuzzy variables. This paper proposes a type of variation measure between fuzzy variables defined by inverse credibility distribution and discusses some proper- ties of the variation measure. As an illustration, the case of variation measure between triangular fuzzy variables is examined.
Communication Structures for Large Networks of Microcomputers
Authors: L. D. Wittie
Venue: IEEE Transactions on Computers (1981)

This paper compares nine network interconnection schemes and introduces "dual-bus hypercubes," a cost-effective method of connecting thousands of dual-port single-chip microcomputers into a room-sized information processing system, a "network computer." Each network node is a chip containing memory and a pair of processors for tasks and input/output. Nodes are linked by shared communication buses, each conceptually spanning a D-dimensional, W-wide hypercube of N = WD nodes. Each node shares two buses. Each bus is shared by up to W nodes. The number of bus connections per node is fixed to satisfy chip pin limitations.
Burrows–Wheeler compression: Principles and reflections
Authors: Peter Fenwick
Venue: Theoretical Computer Science (2007)

After a general description of the Burrows-Wheeler transform and a brief survey of recent work on processing its output, the paper examines the coding of the zero-runs from the MTF recoding stage, an aspect with little prior treatment. It is concluded that the original scheme proposed by Wheeler is extremely efficient and unlikely to be much improved. The paper then proposes some new interpretations and uses of the Burrows-Wheeler transform, with new insights and approaches to lossless compression, perhaps including techniques from error correction.
Comparative Dimensional Analysis of Atrial Fibrillation of Treatment of PPF (propafenone)
Authors: Kuang-Fu Tien
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Two sets of numerical data based on signals recorded from a basket composed of 32 channels of the right atrium of a patient, one set as baseline during patient's fibrillation while the other set is collected after a dose of PPF (propafenone) were applied. There are 27 channels with 260,000 numerical good data. Autocorrelation function with up to 3000 delays on each channel is established which verifies the assumption of chaotic phenomenon. Then we locate the scale where the first relative minimum occurs as delay time for orbit reconstruction. However, we take only the first 10% data for further computation. Computation based on C language is set to find out saturation of Embedded space and D2 dimension representing fractal dimension. Embedded dimension of baseline is 20-26 with D2 dimension 5.0-5.2. embedded dimension after PPF still is 20-26, and D2 dimension 4.7-5.0, slightly lowered.
Whither data mining?
Authors: Rakesh Agrawal, Ramakrishnan Srikant
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The last decade has witnessed tremendous advances in data mining. We take a retrospective look at these developments, focusing on association rules discovery, and discuss the challenges and opportunities ahead.
A search method for reducing local cost in distributed constraint optimization problem
Authors: Masato Noto, Daiki Hashimoto, Mitsutoshi Matsuda
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

A distributed constraint optimization problem (DCOP) distributes the variables and constraints among intelligent agents to enable it to be treated as a constraint satisfaction problem. In this paper, we propose a search method based on the asynchronous distributed optimization (Adopt) algorithm that has been proposed for DCOP. Adopt is a complete method based on a depth-first-search, and operates asynchronously to find the optimal solution for the overall cost. We propose a distributed search method that builds on the merits of Adopt by considering the local load of each agent as opposed to overall optimization. The effect of the proposal was evaluated in simulations.
Specification and Implementation of Mutual Exclusion
Authors: P. B. Hansen
Venue: IEEE Transactions on Software Engineering (1978)

This paper presents a constructive approach to the problem of specifying, implementing, and verifying operations that will give concurrent processes exclusive access to a resource. The method eliminates the need for auxiliary variables and establishes the correctness of a whole class of solutions to the same problem. The solutions are derived directly from the specifications using a language construct called guarded regions. Several new solutions to well-known exclusion problems are presented.
A Signal Detection Method for Harmonic Signal Submerged in Chaotic Background
Authors: Xiaodong Sun, Yaowu Shi, Haixin Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper presents a method to detect weak harmonic signal embedded in chaotic `noise'. Since harmonic signal and chaotic signal have different correlation characteristic ,we can transform the mixed signal to a new data sequence, which has new harmonic signal. The new harmonic signal's frequency is in proportion to the harmonic signal to be detected and it's frequency is beyond the center bandwidth of other elements . Then we can detect the weak harmonic signal on the basis of extended empirical mode decomposition (EEMD).The method is also suit for the situation which background signals is mixture of chaotic signal and strong gaussian white noise. The Simulation experiments show that the method is effective and feasible. Key words: empirical mode decomposition , chaos ; harmonic signal .
A Method for the Synthesis of Dynamic Biometric Signature Data
Authors: C. Rabasse, R. Guest, M. Fairhurst
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper describes a novel method for the generation of synthetic handwritten signatures, in the form of a series of time-stamped pen data channels, for use in dynamic signature verification experimentation. The technique introduces modelled variability within the generated data based on variation that is naturally found within genuine source data. Experimentation using the SVC2004 dataset and a commercial signature verification engine shows that the synthesized data achieves comparative verification performance to the use of genuine data.