ppxscal/embedding_network huggingface dataset:
Inverse electroencephalography for volumetric sources
Authors: Andrés Fraguela Collar, Monserrat Morín Castillo, Jacobo Oliveros Oliveros
Venue: Mathematics and Computers in Simulation (2008)

In this work the problem of recovering bioelectrical sources on the cerebral volume, from measurement of the potential generated by these sources on the scalp, is studied. This problem is an ill posed problem, since given a measurement on the scalp, there are different bioelectrical sources that produce this measurement and small variations in the input data can produce significant variations in the source localization. The problem is studied through a boundary value problem, which is obtained using a model that describes the head as a conductive layer medium. This model allows relationships between the characteristics of the bioelectrical activity and the EEG to be established. We find in this work conditions under which the inverse solution is unique and we give an algorithm to find it. In the simple case, when the head is modeled through two concentric circles, we give a regularization strategy.
Assessing Machine Volition: An Ordinal Scale for Rating Artificial and Natural Systems
Authors: George L. Chadderdon
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2008)

Volition, although often poorly defined, is a concept of interest and utility to both philosophers and researchers in artificial intelligence. In this article, a definition of volition is proposed and a functionally defined, physically grounded ordinal scale and a procedure by which volition might be measured are put forward: a type of Turing test for volition, but motivated by an explicit analysis of the concept being tested and providing results that are graded, rather than Boolean, so that candidate systems may be ranked according to their degree of volitional endowment. It is proposed that volition is a functional, aggregate property of certain physical systems and it is defined as the capacity for adaptive decision-making. The scale, similar in scope to Daniel Dennett's Kinds of Minds scale, is then outlined, as well as a set of progressive &#x201C;litmus tests&#x201D; for determining where a candidate system falls on the scale. Such a formulation may be useful for understanding volition and assessing the progress made in engineering intelligent, autonomous artificial organisms.
Coloring inductive graphs on-line
Authors: S. Irani
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Online graph coloring, in which the vertices are presented one at a time, is considered. Each vertex must be assigned a color, different from the colors of its neighbors, before the next vertex is given. The class of d-inductive graphs is treated. A graph G is said to be d-inductive if the vertices of G can be numbered so that each vertex has at most d edges to higher numbered vertices. First Fit (FF) is the algorithm that assigns each vertex the lowest numbered color possible. It is shown that if G is d-inductive, then FF uses O(d log n) colors on G. This yields an upper bound of O(log n) on the performance ratio of FF on chordal and planar graphs. FF does as well as any online algorithm for d-inductive graphs; it is shown that for any d and any online graph-coloring algorithm A, there is a d-inductive graph that forces A to use Omega (d log n) colors to color G. Online graph coloring with lookahead is also investigated.
Teaching statistics with Excel 2007 and other spreadsheets
Authors: John C. Nash
Venue: Computational Statistics Data Analysis (2008)

This article considers which activities in teaching statistics may be suitable candidates for the application of spreadsheets, and whether spreadsheets in general and Excel 2007 in particular are suitable for these tasks.
Algorithms and data structures for external memory
Authors: Jeffrey Scott Vitter
Venue: Foundations and Trends® in Theoretical Computer Science (2008)

Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this manuscript, we survey the state of the art in the design and analysis of algorithms and data structures for external memory (or EM for short), where the goal is to exploit locality and parallelism in order to reduce the I/O costs. We consider a variety of EM paradigms for solving batched and online problems efficiently in external memory. For the batched problem of sorting and related problems like permuting and fast Fourier transform, the key paradigms include distribution and merging. The paradigm of disk striping offers an elegant way to use multiple disks in parallel. For sorting, however, disk striping can be nonoptimal with respect to I/O, so to gain further improvements we discuss distribution and merging techniques for using the disks independently. We also consider useful techniques for batched EM problems involving matrices, geometric data, and graphs. In the online domain, canonical EM applications include dictionary lookup and range searching. The two important classes of indexed data structures are based upon extendible hashing and B-trees. The paradigms of filtering and bootstrapping provide convenient means in online data structures to make effective use of the data accessed from disk. We also re-examine some of the above EM problems in slightly different settings, such as when the data items are moving, when the data items are variable-length such as character strings, when the data structure is compressed to save space, or when the allocated amount of internal memory can change dynamically. Programming tools and environments are available for simplifying the EM programming task. We report on some experiments in the domain of spatial databases using the TPIE system (Transparent Parallel I/O programming Environment). The newly developed EM algorithms and data structures that incorporate the paradigms we discuss are significantly faster than other methods used in practice.
Fast Qualitative Reasoning about Actions for Computing Anticipatory Systems
Authors: Natsumi Kitajima, Yuichi Goto, Jingde Cheng
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A computing anticipatory system has to reason about actions as fast as possible in order to decide its next actions anticipatorily. We have implemented an action reasoning engine with general-purpose for various computing anticipatory systems and performed some experiments with the action reasoning engine and empirical knowledge represented quantitatively. Our experiments showed that the quantitative approach is very time-consuming and therefore it is not suitable to computing anticipatory systems with high reliability and high security requirements.This paper presents a qualitative approach for reasoning about actions fast. We show that the qualitative approach is more effective than the quantitative approach and therefore it is more suitable to computing anticipatory systems with high reliability and high security requirements.
Real-time gripping detection for a mechanically actuated microgripper
Authors: M. M. Blideran, M. Fleischer, F. Grauvogel, K. Löffler, M. G. Langer, D. P. Kern
Venue: Microelectronic Engineering (2008)

The possibility of controlled gripping during micromanipulation procedures is widely desired in the fields of microbiology and microassembly. For achieving it, measurement or calculation of the forces exerted by the end segment of the manipulator are required. This work presents a method for detecting the gripping moment for a mechanically actuated silicon microgripper. A procedure that combines measurements with simulation results was developed for calculating the forces exerted by the tips of the gripper.
Characterizing user mobility in second life
Authors: Chi-Anh La, Pietro Michiardi
Venue: Proceedings of the first workshop on Online social networks (2008)

In this work we present a measurement study of user mobility in Second Life. We first discuss different techniques to collect user traces and then focus on results obtained using a crawler that we built. Tempted by the question whether our methodology could provide similar results to those obtained in real-world experiments, we study the statistical distribution of user contacts and show that user mobility in Second Life presents similar traits to those of real humans. We further push our analysis to radio networks that emerge from user interaction and show that they are highly clustered. Lastly, we focus on the spatial properties of user movements and observe that users in Second Life revolve around several points of interest traveling in general short distances. Using maximum likelihood estimation, we show that our empirical data best fit to power-law with cutoff distributions, indicating that contact time distributions in a virtual environment has very similar characteristics to those observed in real-world experiments.
Supply chain planning for hurricane response with wind speed information updates
Authors: Emmett J. Lodree,  Jr., Selda Taskin
Venue: Computers and Operations Research (2009)

This paper introduces a stochastic inventory control problem that is relevant to proactive disaster recovery planning as it relates to preparing for potential hurricane activity. In particular, we consider a manufacturing or retail organization who experiences demand surge for items such as flashlights, batteries, and gas-powered generators, where the magnitude of demand surge is influenced by various characteristics of an ensuing storm. The planning horizon begins during the initial stages of storm development, when a particular tropical depression or disturbance is first observed, and ends when the storm dissipates. Since hurricane characteristics can be predicted with more accuracy during the later stages of the planning horizon relative to the earlier stages, the inventory control problem is formulated as an optimal stopping problem with Bayesian updates, where the updates are based on hurricane predictions. A dynamic programming algorithm is described to solve the problem, and several examples involving real hurricane wind speed data are presented to illustrate the methodology.
Fighting criminals: Adaptive inferring and choosing the next investigative objects in the criminal network
Authors: ZhengYou Xia
Venue: Knowledge-Based Systems (2008)

When a criminal probabilistic network has been constructed, criminal investigators can access verified information about some nodes of network after investigations. Effective and efficient techniques are needed to help law enforcement and intelligence agencies to infer the state of other nodes and choose the next new investigative objects in the criminal network. In this paper, we propose a technique that employs a belief propagation algorithm to help criminal investigators to infer the criminal probability of other members by using verified partial information. In an updated criminal probabilistic network, this paper also presents a technique called EMPFS which extends the modified PFS algorithm. EMPFS algorithm is used to solve choice of next key investigative objects from criminal network. Experimental results show that the precision and efficiency of two techniques might be improved by exact constructing of the crime probabilistic network.
Digital signal processing In V.90 modem technology
Authors: Jasvir Singh, Davinder Pal Sharma, S. S. Bhatti
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In the present cyber age everyone wants higher Internet speeds at very lower cost. To achieve this V.90 modem is the best choice, because using this one can achieve data rates up to 56kbps on cheaper analog telephone lines. Present paper highlights the basic issues involved in V.90 modem technology. Various Digital Signal Processing functions involved in this technology are discussed. Cost of modem can further be reduced to significant extent by software implementation of modem using Digital Signal Processor (DSP), so focus is given on the facts related to software implementation of V.90 modem on DSP.
Detection of spatial conflicts between rivers and contours in digital map updating
Authors: J. Chen, W. Liu, Z. Li, R. Zhao, T. Cheng
Venue: International Journal of Geographical Information Science (2007)

In the process of topographic map updating, spatial conflicts (inconsistency) between rivers and contours may be created. This project studies the particularity and complexity of the relationships between rivers and contours, and develops a method for automatic detection of the spatial conflicts between them. This method consists of a refined descriptive spatial model (called a topological chain), an algorithm for the computation of spatial relations, and a set of rules for the determination of spatial conflicts. In the spatial relation model, the topological relationships, order relationships, and metric relationships are integrated to describe the line-line spatial relationships. The rules are derived from the natural relations between rivers and contours in the real world. The effectiveness of this method has been verified by using the national 1:50 000 topographic map databases. An accuracy of 91% has been achieved.
Disk scrubbing versus intra-disk redundancy for high-reliability raid storage systems
Authors: Ilias Iliadis, Robert Haas, Xiao-Yu Hu, Evangelos Eleftheriou
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Two schemes proposed to cope with unrecoverable or latent media errors and enhance the reliability of RAID systems are examined. The first scheme is the established, widely used disk scrubbing scheme, which operates by periodically accessing disk drives to detect media-related unrecoverable errors. These errors are subsequently corrected by rebuilding the sectors affected. The second scheme is the recently proposed intradisk redundancy scheme which uses a further level of redundancy inside each disk, in addition to the RAID redundancy across multiple disks. Analytic results are obtained assuming Poisson arrivals of random I/O requests. Our results demonstrate that the reliability improvement due to disk scrubbing depends on the scrubbing frequency and the workload of the system, and may not reach the reliability level achieved by a simple IPC-based intra-disk redundancy scheme, which is insensitive to the workload. In fact, the IPC-based intra-disk redundancy scheme achieves essentially the same reliability as that of a system operating without unrecoverable sector errors. For heavy workloads, the reliability achieved by the scrubbing scheme can be orders of magnitude less than that of the intra-disk redundancy scheme.
Provenance for Computational Tasks: A Survey
Authors: Juliana Freire, David Koop, Emanuele Santos, Cláudio T. Silva
Venue: Computing in Science and Engineering (2008)

The problem of systematically capturing and managing provenance for computational tasks has recently received significant attention because of its relevance to a wide range of domains and applications. The authors give an overview of important concepts related to provenance management, so that potential users can make informed decisions when selecting or designing a provenance solution.
Revolution and Resistance: Rethinking Power in Computing History
Authors: Rebecca Slayton
Venue: IEEE Annals of the History of Computing (2008)

If one theme dominates memory and imagination about computing, it is "revolution." But the term describes the relationship between transformations in computing and political power in diverse and even contradictory ways. Concepts from the study of social movements can help explain changes in and around computing, clarifying contradictions.
An efficient approach for service retrieval
Authors: Kyong-Ha Lee, Kyu-Chul Lee, Kyung-Ok Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

The efficient discovery of services from a large-scale collection of services has become an important issue[1, 15]. We studied a pragmatic and efficient method for Web service retrieval. We regarded service retrieval as information retrieval on the proprietary XML formats, which are service descriptions in the registry DB. We enhanced the IR techniques to model and compute service similarity against queries on the off-the-shelf DBMS. Our technique considers not only UDDI data entries but also WSDL definitions of services. We also provide a technique to enhance performance of retrieval, considering structural features on the service descriptions.
Analytical results for design space exploration of multi-core processors employing thread migration
Authors: Ravishankar Rao, Sarma Vrudhula, Krzysztof Berezowski
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Migrating threads away from the hot cores in a multicore processor allows them to operate at up to higher speeds. While this technique has already attracted a lot of research effort, the majority of thread migration studies are simulation-based. Although they are valuable for micro-architectural level optimization, they require prohibitively long simulation times, and hence have limited value for early design space exploration. We derive closed form expressions for the steady-state throughput of a multicore processor that employs thread migration and throttling for thermal management. These expressions can be evaluated under a millisecond (vs days for cycle-accurate simulation), and allow designers greater flexibility in evaluating the trade-offs involved in implementing thread migration on-chip. We also developed a system-level power/thermal simulator that we used to validate the analytical results.
A Key Distribution Scheme for Wireless Sensor Networks
Authors: Yong Ho Kim, Hwaseong Lee, Dong Hoon Lee
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Recently, some random key pre-distribution approaches have been proposed for pair-wise key establishment in sensor networks recently. Unfortunately, all of them have the following problem if some sensor nodes are captured by an attacker. Some pair-wise keys of non-captured nodes can be compromised. In this paper, we propose a novel key distribution scheme with strong resilience against node capture.
Low power design under parameter variations
Authors: Swarup Bhunia, Kaushik Roy
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Design considerations for low-power operations and robustness with respect to variations typically impose contradictory design requirements. Low-power design techniques such as voltage scaling, dual-Vth and gate sizing can have large negative impact on parametric yield under process variations. In this tutorial, we focus on circuit/architectural design techniques for low power under parameter variations. We consider both logic and memory design and encompass modeling, analysis as well as design methodology to simultaneously achieve low power and variation tolerance. Design techniques to minimize power under parametric yield constraint as well as major process adaptation techniques using voltage scaling, adaptive body biasing or logic restructuring will be presented. Techniques to deal with within-die parameter variations in logic and memory circuits primarily caused by random dopant fluctuations will be discussed with emphasis on frequency assignments and body biasing. Finally, we will discuss temperature-aware design, dynamic adaptation to temperature and cover on-going research activities in related area such as low-power and variation tolerant multi-core processor design.
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
Authors: Jie Wu, Fei Dai, Shuhui Yang
Venue: IEEE Transactions on Computers (2008)

In this paper, we propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). This approach uses an iterative application of a selected local solution. Each application of the local solution enhances the result obtained from the previous iteration, but each is based on a different node priority scheme. Then, we integrate this iterative process into the process for handling dynamic network topology and propose two extensions: cyclic iterative local solution (CILS) and seamless iterative local solution (SILS). CILS offers a natural extension of ILS to the dynamic environment, but suffers from broken CDS and non-adaptiveness. With a novel use of a monotonically increasing sequence number for dynamic node priority, SILS offers an extension with the desirable properties of correctness, progressiveness, locality, and seamlessness. Extensive simulations are conducted, under ns-2 and a custom simulator, to evaluate the effectiveness of the proposed approach in both static and dynamic environments.
Learning Bayesian networks from incomplete databases using a novel evolutionary algorithm
Authors: Man Leung Wong, Yuan Yuan Guo
Venue: Decision Support Systems (2008)

This paper proposes a novel method for learning Bayesian networks from incomplete databases in the presence of missing values, which combines an evolutionary algorithm with the traditional Expectation Maximization (EM) algorithm. A data completing procedure is presented for learning and evaluating the candidate networks. Moreover, a strategy is introduced to obtain better initial networks to facilitate the method. The new method can also overcome the problem of getting stuck in sub-optimal solutions which occurs in most existing learning algorithms. The experimental results on the databases generated from several benchmark networks illustrate that the new method has better performance than some state-of-the-art algorithms. We also apply the method to a data mining problem and compare the performance of the discovered Bayesian networks with the models generated by other learning algorithms. The results demonstrate that our method outperforms other algorithms.
A study on usability of human-robot interaction using a mobile computer and a human interface device
Authors: T. H. Song, J. H. Park, S. M. Chung, S. H. Hong, K. H. Kwon, S. Lee, J. W. Jeon
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

A variety of devices are used for robot control such as personal computers or other human interface devices, haptic devices, and so on. However, sometimes it is not easy to select a device which fits the specific character of varied kinds of robots while at the same time increasing the user's convenience. Under these circumstances, in this study, we have tried to measure user convenience. We tried to understand the characteristics of several devices used to achieve human robot interaction by using each of these devices that could be used with a personal computer: We used a button type device, a joystick, a driving device which consisted of a handle and pedals, and a motion-based human interface device including an acceleration sensor.
A good characterization of cograph contractions
Authors: Van Bang Le
Venue: Journal of Graph Theory (1999)

A graph is called a graph contraction if it is obtained from a cograph (a graph with no induced path on four vertices) by contracting some pairwise disjoint independent sets and then making the &ldquo;contracted&rdquo; vertices pairwise adjacent. Cograph contractions are perfect and generalize cographs and split graphs. This article gives a good characterization of cograph contractions, solving a problem posed by M. Hujter and Zs. Tuza. &copy; John Wiley & Sons, Inc. J Graph Theory 30: 309&ndash;318, 1999