ppxscal/embedding_network huggingface dataset:
An Adaptive Algorithm for Information Dissemination in Self-Organizing Grids
Authors: Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Ghazaleh
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise the grid. Classical distributed information dissemination approaches such as push, pull, and their combinations, are not well suited to the problem of resource tracking, where resources are redundant and full information about all resources everywhere is neither necessary nor desirable. Aggregated, partial, or probabilistic forwarding protocols result in more efficient (but incomplete) dissemination, while maintaining sufficient information to enable effective scheduling. However, a static approach to dissemination in which all information is treated identically, is ineffective in the presence of spatial and temporal non-uniformity of resources and demands. For example, a single forwarding probability for gossipping-based dissemination may result in unnecessarily high overhead in some areas of the grid. Moreover, the right forwarding probability values can change over time, with changes in offered load and node utilization. Adaptive protocols can adjust the aggressiveness with which information is disseminated, based on current grid conditions, and can in turn increase query satisfaction rates, reduce overhead, or both. This paper explores the characteristics and behavior of adaptive probabilistic and change-sensitive information forwarding protocols, identifying and addressing several issues and problems, and introducing dissemination protocols that are better able to reduce overhead and increase query satisfaction rates for a variety of grid conditions.
Prototyping Parallel FDTD Programs by Macro Data Flow Graph Analysis
Authors: Adam Smyk, Marek Tudruj
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The paper presents a method for optimization of computations involved in solving Finite Difference Time Domain (FDTD) problems which enable electromagnetic wave propagation modeling in irregular areas. The method assumes program execution paradigm typical for macro data flow graph (MDFG) program representation. The proposed method enables MDFGs optimization based on three constituent steps. The first step consists in an initial MDFG design based on arbitrary introductory simulation area partitioning. The second step consists in merging initial macro data nodes to take into account computational system limitations and to obtain the macro node number equal to the number of physical processors in the system. The third step consists in computational cells redeployment to reduce inter-node data transmissions and balance computational loads of processors. Experimental results on parallel computational speedup are presented obtained with assumptions of different interprocessor communication systems.
From Hype to Reality: A Case Study on the Evolution of the Swiss WISP Industry
Authors: Giovanni Camponovo, Yves Pigneur
Venue: Proceedings of the International Conference on Mobile Business (2006)

The emerging use of WLAN technologies to provide WISP services in public locations has been a hot topic in the mobile industry as it threatened traditional mobile operator business models and their revenues. In contrast, some observers argued that this was simply an unjustified hype as WLAN would play a minor role or be integrated by mobile operators in their offerings. This paper studies the evolution of the WISP industry in Switzerland with two case studies. The first conducted in 2002 at the emergence of the industry to show how the hype surrounding WLAN resulted in the creation of a new industry attracting firms with various business models. The second conducted in 2006 after a period of consolidation to see how the industry evolved and whether the initial hype actually materialized.
Evaluating proposed capital and operational improvements at a marine terminal
Authors: Scott J. Bury, Naoko Akiya
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Marine terminal operations are complex, and evaluating changes is best done using a simulation tool that captures the dynamics and interactions of the system. We have developed a flexible and robust discrete-event simulation of a marine terminal that handles liquid cargo. We used this simulation to investigate proposed changes generated by a Six Sigma project to reduce congestion at the terminal. Our study provided quantitative data to base decisions on the expected operational and financial impact of the proposed changes. The simulation captured the important details of the system and increased the Six Sigma team's confidence in their recommendations. The modular architecture of the simulation allows for easy application of the simulation to different terminal simply by changing a few data tables. The structure of the simulation makes it easy for non-modelers to use the tool to perform continuing studies.
Saccadic Inhibition in Voluntary and Reflexive Saccades
Authors: Eyal M. Reingold, Dave M. Stampe
Venue: Journal of Cognitive Neuroscience (2002)

The present study investigated saccadic inhibition in both voluntary and stimulus-elicited saccades. Two experiments examined saccadic inhibition caused by an irrelevant flash occurring subsequent to target onset. In each trial, participants were required to perform a single saccade following the presentation of a black target on a gray background, 4&deg; to the left or to the right of screen center. In some trials (flash trials), after a variable delay, a 33-msec flash was displayed at the top and bottom third of the monitor (these regions turned white). In all experimental conditions, histograms of flash-to-saccade latencies documented a decrease in saccadic frequency, forming a dip, time-locked to the flash and occurring as early as 60-70 msec following its onset. The fast latency of this effect strongly suggests a low-level, reflex-like, oculomotor effect, which was referred to as saccadic inhibition. A novel procedure was developed to allow comparisons of saccadic inhibition even across conditions, which in the absence of a flash (no-flash trials) produce dissimilar saccadic reaction times (SRTs) distributions. Experiment 1 examined the effects of the fixation stimulus on saccadic inhibition by contrasting three conditions: a gap condition (fixation stimulus disappeared 200 msec prior to target onset), a step condition (offset of the fixation stimulus was simultaneous with target onset), and an overlap condition (the fixation stimulus remained on for the duration of the trial). The overlap condition produced substantially stronger saccadic inhibition, relative to the gap and the step conditions. Experiment 2 contrasted the saccadic inhibition effect obtained for prosaccades (saccades aimed at the target) with the effect obtained for antisaccades (i.e., saccades aimed away from the same target). The onset of saccadic inhibition was earlier, and its magnitude was stronger, for antisaccades, relative to prosaccades. The plausibility that the superior colliculus is the neurophysiological locus of the saccadic inhibition effect was explored.
Efficient Storage Allocation of Large-Scale Extendible Multi-dimensional Scientific Datasets
Authors: Ekow J. Otoo, Doron Rotem
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Data analyses in scientific domains involve storage, retrieval, processing and visualization of large scale multidimensional datasets. The datasets incrementally grow by appending new data to the dataset without reorganizing the already allocated data storage. The datasets, typically modeled as k-dimensional arrays, are maintained in files where the array elements are allocated in a sequence of consecutive storage locations according to some ordering of an array mapping function. Such mapping functions limit the degree of extendibility of the arrays to one dimension only. To allowing new data elements to be appended to the dataset effectively implies allowing for the arbitrary extendibility of the array. We present a mapping function F.(), that uses additional O(k log E ) storage, where E is the number of array segments appended. The function is realized with approximately the approximately the same order of complexity as a conventional array function. The algorithm presented for addressing elements of datasets in extendible multi-dimensional array files apply equally well to addressing memory resident extendible arrays.
Wireless sensor networks: energy efficiency, delay guarantee and fault tolerance
Authors: Pravin Varaiya
Venue:  (2005)

Wireless sensor systems contain new types of computing machines and run different kinds of applications in a variety of physical environments, which offers many challenges. The main design constraints of many sensor network applications are energy efficiency, delay guarantee and fault tolerance. Since these constraints impact multiple protocol layers, a joint design across all layers becomes indispensable in designing a protocol for sensor networks. In this thesis, we take the cross-layer design approach to improve the performance of protocol layers by taking into account parameters in other layers instead of merging them into one layer to preserve modularity. In addition to the interactions from lower to higher layers, the interactions from higher to lower layers are included to exploit application-specific characteristics of sensor networks such as many-to-one communication, collaborative processing and asymmetry of constraints. We first illustrate the use of sensor networks in traffic applications. We show that sensor nodes provide a vehicle detection accuracy higher than that of the current standard vehicle detection scheme, inductive loops. Moreover, the high spatial density associated with the magnetic sensors allows us to classify the vehicles and even re-identify them. We then propose a TDMA (Time Division Multiple Access) MAC protocol, PEDAMACS, that achieves both energy efficiency and delay guarantee. Although it is known that there is a tradeoff between delay and energy, PEDAMACS demonstrates that one can achieve both of them by using special characteristics of sensor networks: many-to-one and asymmetric communication. We then develop TDMA scheduling algorithms that take into account the many-to-one communication characteristic of sensor networks to decrease the delay. We formulate the lifetime maximization as a linear programming (LP) problem with the goal of determining optimal routing paths in the network. We extend the energy efficient routing to introduce anytime delay guarantee. We show that the traditional way of introducing delay constraint via capacity constraints only provide average delay performance. Anytime delay guarantee is a restriction on the routing trees after the decomposition of the LP solution. A distributed algorithm is proposed to illustrate the trade-off between delay and energy efficiency. We also extend the energy efficient routing to include multiple paths between each source and destination in the network to provide the resiliency of the network to link failures. We furthermore investigate the effect of physical layer and application layer characteristics on multi-hop routing. (Abstract shortened by UMI.)
Path Planning Optimization Using Bio-Inspirited Algorithms
Authors: Beatriz A. Garro, Humberto Sossa, Roberto A. Vazquez
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Path Planning is one of the problems in robotics. It consists on automatically determine a path from an initial position of the robot to its final position. This process has to be adaptable in order to work over several environments. Bio-inspirited algorithms, particularly ant colony optimizations (ACO) [9] are adaptable to any environments. Taking advantage of this fact, in this paper we show how bio-inspired algorithms can be used to optimize the path that a robot can follow in order to reach its target destination. We will use principles of Swarm intelligence that emulate the behavior of ants' colonies when they are looking for food aimed to find the shortest path. In addition, we propose to evolve some parameters of ACO algorithm by using a genetic algorithm (ACO-GA) in order to optimize the search of the shortest path. We also verify and compare the accuracy of ACO against ACO-GA. In order to test the accuracy of the proposed algorithm, we firstly obtain a graph from an environment and then we apply the two proposed algorithms in order to determine the best route from the origin to the target destination. To test the proposal some labyrinths of varied complexity were used.
Probability Fuzzy Cognitive Map for Decision-Making in Soccer Robotics
Authors: Hua-Qing Min, Jia-Xing Hui, Yan-Sheng Lu, Jia-zhi Jiang
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Based on research work in soccer robot decision-making, an improved Probability Fuzzy Cognitive Map (PFCM) based Soccer Robot Reasoning Model (PFCMSRRM) is proposed to overcome limitations of the popular Finite-state Machine(FSM) approach in decision-making research. Explanation is given on the structure of PFCMSRRM and its decision reasoning implementation. Learning on the weight value of PFCMSRRM is conducted using learning algorithms based on Gradient Descent and Simulated Annealing respectively. As a result, we built a PFCMSRRM system used in multi-agents ROBOCUP Middle-sized Soccer Robot Competition, with higher accuracy and speed in decision-making as compared with FSM approach, which was proved by experiments.
SIREN: a similarity retrieval engine for complex data
Authors: Maria Camila N. Barioni, Humberto Razente, Agma Traina, Caetano Traina,  Jr.
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

This paper presents a similarity retrieval engine - SIREN-that allows posing similarity queries in a relational DBMS using an extended syntax that adds the support for such type of queries in the SQL language. It discusses the main architecture of SIREN, describes some key features and provides a description of the demo.
Patients with Right Frontal Lesions are Unable to Assess and Use Advice to Make Predictive Judgments
Authors: Marian Gomez-Beldarrain, Clare Harries, Juan Carlos Garcia-Monco, Emma Ballus, Jordan Grafman
Venue: Journal of Cognitive Neuroscience (2004)

Frontal lobe damage impairs decision-making. Most studies have employed gambling and probabilistic tasks, which have an emotional (reward-punishment) component and found that patients with ventromedial sector lesions have exceptional difficulty performing normally on these tasks. We have recently presented an economic decision-making task to patients and normal volunteers that required them to not only forecast an economic outcome but also to weigh advice from four advisors about the possible outcome across 40 trials. We studied 20 patients with right frontal lobe lesions and 9 patients with parietal lobe lesions and compared their performance to 20 matched controls. Frontal lobe lesion patients were inconsistent at using advice and their forecasts were poor. Patients with dorsolateral but not orbito-frontal lesions showed some ability to assess advice. Patients with parietal lobe lesions were good at assessing advice but were slow at doing so; they were consistent but poor at using advice and their use of advice was unrelated to their forecasting. All three patient groups were overconfident in their own performance. In contrast, controls could both use and assess advice, their ability to use advice was mediated by their ability to assess it, and they were not overconfident. Group differences on an overall measure of accuracy on this task were associated with an ability to accurately plan. Differences in ability to assess and forecast were associated with planning and working memory performance. These findings indicate that patients with both right dorsolateral and orbito-frontal lesions may be impaired when required to make complex decisions related to forecasting and judgment. Our findings enlarge the scope of decision-making deficits seen in patients with frontal lobe lesions and indicate additional circumstances in which patients with frontal lobe lesions will have difficulty in deciding.
The computer display as a support of collaborative development of scientific models of magnetism
Authors: Andy Johnson
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Some student difficulties in learning science can be understood by considering the background knowledge that people necessarily assume in conversations. In learning science, students have to develop meanings and understandings that can be taken as shared in conversations. Small groups of students can be aided in their development of shareable understandings by constructing explanations of their thinking on a computer.This paper describes student interactions in a physical science course for preservice teachers. A group of students working at a computer showed fluent use of the computer screen to support making concrete statements and to extend their understandings. Their use of the screen helped the group to established shared meanings along the way to developing models of magnetic materials.
A linearly constrained blind equalization scheme based on Bussgang type algorithms
Authors: S. Zazo, J. M. Paez-Borrallo, I. A. P. Alvarez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Existing blind adaptive equalizers that use nonconvex cost functions (as Bussgang type algorithms) and stochastic gradient descent suffer from lack of global convergence to an equalizer tap set that removes sufficient ISI when an FIR equalizer is used. In this paper we propose a new algorithm including tap anchoring and gain recovery into the classical schemes. The combined effect of these strategies is to establish the preservation of the transmitted symbol preventing ill convergence, and therefore providing the ability of implementation of the inverse filter regardless of the initial ISI. Under certain hypotheses, we suggest that a globally convex scheme can be proposed overcoming the existing structures. Several computer simulations support our theoretical results.
Spatial analysis of centralization and decentralization in the population migration network
Authors: S. Tomita, Y. Hayashi
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

Althouh overcrowded and the depopulation of the population are one of the social issues in Japan, the complex mechanisms are not comprehended. Then, we tried to show this phenomenon by catching as a network. We interpreted prefectures as nodes and migration as links. We observe power law distribution in both population and migration. We insist on the necessity of reconsider the prevailing assumption that cities size or influential potential follow normal distributions. We investigate what factor influence on the migration. We compare the population and distance between prefectures. As a result, we showed that the population of destination has strong influence in migration. We visualize the migration. We characterized quantitatively and showed the whole image of the migration. This analysis may be useful at various stages in decision-making and planning support of government and municipalities.
Towards semantic service selection for B2B integration
Authors: Andreas Friesen, Kioumars Namiri
Venue: Workshop proceedings of the sixth international conference on Web engineering (2006)

There are various B2B integration scenarios where a requester can choose among several services of the same or different service providers offering similar service capabilities satisfying the request. The choice of the service to be invoked often depends on the parameters of the actual request and preferences of the requester. In this paper we introduce a solution for a dynamic (at run-time) web service selection based on semantic interpretation of offered service capabilities and the parameters specifying the actual request. The proposed solution takes into account special conditions on service usage either contractually agreed offline between requester and provider or specified by the requester without the knowledge of the provider. In general, those conditions restrict the interpretation of the original service capabilities as offered by a service provider and influence the choice of a service.
Study on Reliability Base Acquisition of Small and Mid-Sized Information System
Authors: K. H. Choi, S. Y. Rhew
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Software reliability prediction is a statistical method to put in place a timely software development practice useful for objective assessment of bidders. The current study suggests one research method that enables reliability assessment on such previous projects by studying user satisfaction. The fact that qualitative factors are more important than quantitative factors and that due to difficulties in measurement, the previous evaluation model only considered the one-sided aspect such as business environment or technical skills. This research presents a method to evaluate outsourcing businesses through reliability predictions on quantitative and qualitative factors of the proposed businesses.
Catalyzer: a novel tool for integrating, managing and publishing heterogeneous bioscience data: Research Articles
Authors: F. W. Howell, R. C. Cannon, N. H. Goddard
Venue: Concurrency and Computation: Practice Experience (2007)

The integrative ambitions of systems biology and neuroinformatics&mdash;to construct working models of the machinery of living cells and brains&mdash;will flounder unless researchers have access to the huge amounts of diverse experimental data being collected. However, the vast majority of bioscience research data that is gathered is never made available to other researchers, partly for the want of an adequate software for annotating experimental data, and partly for social reasons (researchers are rarely rewarded for publishing the actual data sets&mdash;just for journal articles summarizing findings).We have developed a novel software solution aimed at making it simpler for researchers to annotate and publish their research data. The first part of this solution is a desktop application, Catalyzer, which lets researchers structure their data at source, and complements existing ad hoc solutions in use in labs (including cryptic filenames, Word, Excel, paper lab books) while being simpler and more flexible than relational databases, which are too complex for most bioscience researchers to set up. The catalogs produced by Catalyzer are stored in XML with a user defined schema, which will simplify future data mining efforts across large numbers of distributed data sets. The approach can be summarized as &lsquo;structure at source, integrate as required&rsquo;, with the initial focus on enabling the researchers to structure their own research data; only then will other researchers be able to integrate across data sets. Copyright &copy; 2006 John Wiley & Sons, Ltd.