ppxscal/embedding_network huggingface dataset:
Modeling Information Pathway of Motor Control Using Coherence Analysis
Authors: Norlaili Mat Safri, Siti Hajar Aminah Ali, Siti Zuraimi Salleh, Nobuki Murayama
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Motor behavior can be guided by visual information. For example, hand actions were modified by visual cues that provided initial weight and size estimates of objects. Vision provides important inputs to the representational system which are linked not directly to motor outputs but are linked to cognitive systems. The visual and voluntary motor tasks are controlled by the brain signals which drive the cortical activity and perception. But the cortical activity are not driven by these external stimulus alone, relatively sensory information need to be integrated with various internal constraints such as planned actions, expectations, recent memories, etc. This paper presents C3-EEG coherence analysis during two different visual tasks concurrent with isometric contraction of the first dorsal interosseous (FDI) muscle. The functional connection between different brain regions was investigated to model information pathway of motor control in humans.
Srink-wrapped boundary face algorithm for surface reconstruction from unorganized 3D points
Authors: Bon Ki Koo, Chang Woo Chu, Jae Chul Kim, Young Kyu Choi
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

A new surface reconstruction method, called shrink-wrapped boundary face (SWBF) algorithm, is proposed for approximating the surface from a set of unorganized 3D points. SWBF surmounts the genus-0 spherical topology restriction of previous shrink-wrapping based mesh generation technique. Furthermore, SWBF is much faster since it requires only local nearest-point-search in the shrinking process. According to experiments, it is proved to be very robust and efficient for mesh generation from unorganized points cloud.
SMILE tree: a stream data multi-query indexing technique with level-dimension nodes and extended-range nodes
Authors: Minsoo Lee, Hyejung Yoon, Yearn Jeong Kim, Yoon-kyung Lee
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.
Stochastic multivalued network for optimization: application to the graph Maxcut problem
Authors: Domingo López-Rodríguez, Enrique Mérida-Casermeiro, J. M. Ortiz-de-Lazcano-Lobato
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

The aim of this paper is to present the stochastic version of the multivalued neural model MREM, which has achieved very good results in many applications, as an optimization technique. The purpose of this stochastic version is to avoid certain local minima of the objective function minimized by the network, that is, the energy function. To this end, the description of the theoretical bases of this model, guaranteeing the convergence to minima, is carried out rigorously. In order to show the efficiency of this new model, the model, in its two versions, deterministic and stochastic, has been applied to the resolution of the well-known problem of graph partition, MaxCut. Computational experiments show that in most cases the stochastic model achieves better results than the deterministic one.
A 3/7-Level Mixed-Mode Algorithmic Analog-to-Digital Converter
Authors: Kazuki Akutagawa, Kazuya Machida, Takao Waho
Venue: Proceedings of the 38th International Symposium on Multiple Valued Logic (2008)

A 3/7-level mixed-mode algorithmic analog-to-digital onverter (ADC) is proposed. The operation comprises six phases to obtain the 8-bit resolution. The 3-level mode is used in the first three phases for an accurate conversion, while the 7-level mode is used for the last three phases to improve the sampling speed. Transistor-level simulations assuming 0.18-$\mu $m CMOS technology with a supply voltage of 1.8 V are carried out to estimate the circuit performance. A signal-to-noise ratio of 48.1dB ($\approx $7.7 bit) is obtained at a sampling frequency of 12.8 MHz, which is superior to the results obtained from conventional 3-level and 7-level algorithmic ADCs.
A geometric approach to spectral subtraction
Authors: Yang Lu, Philipos C. Loizou
Venue: Speech Communication (2008)

The traditional power spectral subtraction algorithm is computationally simple to implement but suffers from musical noise distortion. In addition, the subtractive rules are based on incorrect assumptions about the cross terms being zero. A new geometric approach to spectral subtraction is proposed in the present paper that addresses these shortcomings of the spectral subtraction algorithm. A method for estimating the cross terms involving the phase differences between the noisy (and clean) signals and noise is proposed. Analysis of the gain function of the proposed algorithm indicated that it possesses similar properties as the traditional MMSE algorithm. Objective evaluation of the proposed algorithm showed that it performed significantly better than the traditional spectral subtractive algorithm. Informal listening tests revealed that the proposed algorithm had no audible musical noise.
A weighted interference estimation scheme for interface switching wireless mesh networks
Authors: Yunxia Feng, Minglu Li, Min-You Wu
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The number of available channels in a specific wireless network is bounded. Therefore, co-channel interference is inevitable in most wireless networks. The co-channel interference problem in wireless mesh networks is more serious than that in single-hop wireless networks. It is preferable for mesh nodes to dynamically adjust channels to elevate the interference level of networks. In this paper, we introduce the conception of communication constraint to denote the strategies that decide the mode of interface switching. We develop an interference estimation scheme. The proposed scheme uses a weight to represent the effects of loads distribution and relative distance between nodes on the interference level of network. We compare the performance of our solution with the model presented by Gupta and Kumar [14] through both graph-based and NS2 simulations. Extensive results show that our solution achieves better performance than the compared scheme when the number of available channels is small.
Fundamental parallel algorithms for private-cache chip multiprocessors
Authors: Lars Arge, Michael T. Goodrich, Michael Nelson, Nodari Sitchinava
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

In this paper, we study parallel algorithms for private-cache chip multiprocessors (CMPs), focusing on methods for foundational problems that are scalable with the number of cores. By focusing on private-cache CMPs, we show that we can design efficient algorithms that need no additional assumptions about the way cores are interconnected, for we assume that all inter-processor communication occurs through the memory hierarchy. We study several fundamental problems, including prefix sums, selection, and sorting, which often form the building blocks of other parallel algorithms. Indeed, we present two sorting algorithms, a distribution sort and a mergesort. Our algorithms are asymptotically optimal in terms of parallel cache accesses and space complexity under reasonable assumptions about the relationships between the number of processors, the size of memory, and the size of cache blocks. In addition, we study sorting lower bounds in a computational model, which we call the parallel external-memory (PEM) model, that formalizes the essential properties of our algorithms for private-cache CMPs.
Game content creation and it proficiency: An exploratory study
Authors: Elisabeth Hayes
Venue: Computers Education (2008)

Computer and video gaming are often considered to be potential routes to the development of aptitude and interest in using other forms of information technology (IT). The purpose of this exploratory study was to determine the extent to which young people who play games engage in related IT practices, such as creating and sharing content or creating fan sites. Additional goals were to identify differences in such practices according to grade level, gender, and access to IT-related resources in the home, as well as to explore relationships between engagement in game-related practices and perceived proficiency in general computer-related skills.
SAP APO Interview Questions, Answers, and Explanations: SAP APO Certification Review
Authors: Jens,  Schmeer
Venue:  (2007)

The Ultimate Reference & Learning Guide for SAP APO/SCM careers! With Certification Questions, Answers, and Explanations. It's clear that SAP APO/SCM is the future for supply chain optimization in SAP - but finding good reference materials can be difficult. Now, for the first time, a world class SAP consultant shares his knowledge and understanding of this complex topic. SAP APO Interview Questions, Answers, and Explanations guides you easily through your learning process. From helping you to assess your SAP APO skills, to helping screen candidates for your APO positions, SAP APO Interview Questions will help you understand what you really need to know. This book is organized around several areas of SAP APO: Demand Planning, Master Data, Basis, CoreInterFace (CIF), Production Planning, Transport Planning, and more. More than just a rehash of SAP documentation and sales presentations, each question is based on implementation project know-how gained on high-profile SAP APO implementations. Key topics include: SAP Advanced Planning and Optmization, SAP Supply Chain Management SCM, SAP Event Management, SAP Demand Planning, SAP Master Data, SAP CoreInterFace (CIF), SAP Production Planning PP.
RingSTM: scalable transactions with a single atomic instruction
Authors: Michael F. Spear, Maged M. Michael, Christoph von Praun
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Existing Software Transactional Memory (STM) designs attach metadata to ranges of shared memory; subsequent runtime instructions read and update this metadata in order to ensure that an in-flight transaction's reads and writes remain correct. The overhead of metadata manipulation and inspection is linear in the number of reads and writes performed by a transaction, and involves expensive read-modify-write instructions, resulting in substantial overheads. We consider a novel approach to STM, in which transactions represent their read and write sets as Bloom filters, and transactions commit by enqueuing a Bloom filter onto a global list. Using this approach, our RingSTM system requires at most one read-modify-write operation for any transaction, and incurs validation overhead linear not in transaction size, but in the number of concurrent writers who commit. Furthermore, RingSTM is the first STM that is inherently livelock-free and privatization-safe while at the same time permitting parallel writeback by concurrent disjoint transactions.We evaluate three variants of the RingSTM algorithm, and find that it offers superior performance and/or stronger semantics than the state-of-the-art TL2 algorithm under a number of workloads.
Algebraic properties on the cuts of lattice-valued regular languages
Authors: Changjian Liang, Yongming Li
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

In this paper, the algebraic operations on the cuts of lattice-valued regular languages are studied. Some sufficient conditions are given to guarantee the family of the cuts of lattice-valued regular languages to be closed under such algebraic operations as union, intersection, complement, quotient, homomorphism, inverse homomorphism, concatennation, reversal, etc.
Extension of cascaded simple feature based face detection to facial expression recognition
Authors: Do Hyoung Kim, Sung Uk Jung, Myung Jin Chung
Venue: Pattern Recognition Letters (2008)

In this paper, we extend cascaded rectangle features based face detection to facial expression. New types of rectangle features that are suitable for facial expression recognition (FER) are proposed. We choose those as rectangle features for FER in a 3x3 matrix form, using a variant of AdaBoost. In addition, the FER system constituted with the proposed rectangle feature set is compared to that with a typical rectangle feature set with regard to its capacity. Simulation and experimental results indicate that the proposed features show better representation and classification in FER.
Challenges and architectural approaches for authenticating mobile users
Authors: João Pedro Sousa
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

This paper casts an architectural eye at existing work on security and privacy in mobile computing. Specifically, it focuses on authentication as it leads up to access control from two points of view: servicer providers granting access to users, and users granting access to service providers. The paper identifies three classes of problems addressed by existing work. Then, it teases out architectural patterns being used to address those problems, their assumptions, properties, and remaining challenges.
An Estimation-Theoretic Interpretation of Video Rate Distortion Optimization with Lagrangian Formulation
Authors: Zhen Li, Alexis Michael Tourapis
Venue: Proceedings of the Data Compression Conference (2008)

Rate distortion optimization with Lagrangian formulation is widely used in video encoder control and has proved effective in achieving a good trade-off between coding efficiency and computational complexity. It is generally interpreted as a source coding problem with a fidelity criterion. However, this interpretation cannot fully explain the Lagrangian formulation for motion estimation and how to select the corresponding Lagrangian multipliers. In this paper, we provide a new perspective based on an estimation-theoretic interpretation that formulates motion estimation and mode decision as a maximum a posteriori (MAP) estimation problem. Several interesting conclusions can be drawn from this interpretation. We show that the Lagrangian formulation in video encoder control is a straightforward result under this interpretation. With this interpretation, we can further analyze the Lagrangian multiplier’s dependence on the quantization parameter and motion intensity of the content.
The good and the bad system: does the test collection predict users' effectiveness?
Authors: Azzah Al-Maskari, Mark Sanderson, Paul Clough, Eija Airio
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Test collections are extensively used in the evaluation of information retrieval systems. Crucial to their use is the degree to which results from them predict user effectiveness. At first, past studies did not substantiate a relationship between system and user effectiveness; more recently, however, correlations have begun to emerge. The results of this paper strengthen and extend those findings. We introduce a novel methodology for investigating the relationship, which shows great success in establishing a significant correlation between system and user effectiveness. It is shown that users behave differently and discern differences between pairs of systems that have a very small absolute difference in test collection effectiveness. Our results strengthen the use of test collections in IR evaluation, confirming that users' effectiveness can be predicted successfully.
Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph
Authors: Mir Shahriar Emami, Mohammad Reza Fattahi, Hossein Keshmiri
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper we evaluate our presented Quantum Approach for finding the Estimation of the Length of the Shortest Path in a Connected Weighted Graph which is achieved with a polynomial time complexity about and as a result of evaluation we show that the Probability of Success of our presented Quantum Approach is increased if the Standard Deviation of the Length of all possible paths between Source and Target vertices is increased also we show that if the Standard Deviation is low nevertheless our Quantum Computation Approach is satisfactory and even the standard deviation is exactly zero the probability of Success of our Quantum Approach is not only zero but also is %100. Also we present a Classic Parallel Approach for finding the Estimation of the Length of the shortest path and then as a comparison between our Quantum Computation and Classic Parallel Approaches we show that even by applying the Classic Parallel Approach the problem can be solved with time complexity about.
Planning and learning in permutation groups
Authors: A. Fiat
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Planning is defined as the problem of synthesizing a desired behavior from given basic operations, and learning is defined as the dual problem of analyzing a given behavior to determine the unknown basic operations. Algorithms for solving these problems in the context of invertible operations on finite-state environments are developed. In addition to their obvious artificial intelligence applications, the algorithms can efficiently find the shortest way to solve Rubik's cube, test ping-pong protocols, and solve systems of equations over permutation groups.
Prediction of pricing and hedging errors for equity linked warrants with Gaussian process models
Authors: Gyu-Sik Han, Jaewook Lee
Venue: Expert Systems with Applications: An International Journal (2008)

Gaussian process (GP) model is a Bayesian kernel-based learning machine. In this paper, we propose a GP model with a various mixed kernel for pricing and hedging ELWs (equity linked warrants) traded at KRX with predictive distribution. We experiment with daily market data relevant to KOSPI200 call ELWs from March 2006 to July 2006, comparing the performance of the GP model with those of various neural network (NN) models to show its effectiveness. The applied NN models contain early stopping, regularized NN, and bagging. The proposed GP model shows that its forecast capability outperforms those of the three NN models in terms of both pricing and hedging errors, thereby generating consistent results.
On the recursive sequence xn+1=AΠKi=l' xn-2j-1 / B + C Π k-li=l' xn-2i
Authors: Alaa. E. Hamza, R. Khalaf-Allah
Venue: Computers Mathematics with Applications (2008)

The aim of this work is to investigate the global stability, periodic nature, oscillation and the boundedness of solutions of the difference equation x"n"+"1=A@?i=lkx"n"-"2"i"-"1B+C@?i=lk-1x"n"-"2"i,n=0,1,... where A,B,C are nonnegative real numbers and l,k are nonnegative integers, l
Solving Constrained Optimization via a Modified Genetic Particle Swarm Optimization
Authors: Liu Zhiming, Wang Cheng, Li Jian
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

was derived from the original particle swarm optimization (PSO), which is incorporated with the genetic reproduction mechanisms, namely crossover and mutation. Based on which a modified genetic particle swarm optimization (MGPSO) was introduced to solve constrained optimization problems. In which the differential evolution (DE) was incorporated into GPSO to enhance search performance. At each generation GPSO and DE generated a position for each particle, respectively, and the better one was accepted to be a new position for the particle. To compare and ranking the particles, the lexicographic order ranking was introduced. Moreover, DE was incorporated to the original PSO with the same method, which was used to be compared with MGSPO. MGPSO were experimented with wellknown benchmark functions. By comparison with original PSO algorithms and the evolution strategy, the simulation results have shown its robust and consistent effectiveness. Index Terms Particle swarm optimization, genetic algorithm, constrained optimization.
Dynamic Undeniable Fair Certified Email with DDoS Protection
Authors: Yongyuth Permpoontanalarp, Jatupoom Kanokkanjanapong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Fair certified email is an email system which employs the fair exchange protocol. All existing approaches to fair certified email achieve the fair exchange property between a single sender and a receiver only. But they do not offer the fair exchange between all senders and a receiver. So, a malicious receiver can deny receiving messages from some senders but do receive messages from other senders. Also, the existing certified email protocols do not prevent the distributed denial of service attack by malicious senders. We propose a new certified email protocol which provides the fair exchange for all senders, called the undeniable fairness, and distributed denial of service protection.
The game of life: an outreach model for high school students with disabilities
Authors: Richard E. Ladner, Tammy VanDeGrift
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In this hands-on special session, attendees will learn about and use a Game of Life cellular automata framework (Java) to assist with outreach activities. Using the framework, students with no prior programming experience can create interesting behaviors within thirty minutes. The special session leaders have successfully used this approach for thirteen years in a one-week summer workshop for disabled high school students. The SIGCSE special session will include an introduction to the framework and keys to its success as an outreach activity, followed by participants solving, programming, and proposing specific problems. Attendees will be equipped to guide Game of Life outreach activities at their own outreach events.