ppxscal/embedding_network huggingface dataset:
Structures for phase classification
Authors: J. Lau, S. Schoemackers, B. Calder
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Most programs are repetitive, where similar behavior can be seen at different execution times. Proposed algorithms automatically group these similar intervals of execution into phases, where all he intervals in a phase have homogeneous behavior and similar resource requirements. In this paper we examine different program structures for capturing phase behavior. The goal is to compare the size and accuracy of these structures for performing phase classification. We focus on profiling the frequency of program level structures that are independent from underlying architecture performance metrics. This allows the phase classification to be used across different hardware designs that support the same instruction set (ISA). We compare using basic blocks, loop branches, procedures, opcodes, register usage, and memory address information for guiding phase classification. We compare these different structures in terms of their ability to create homogeneous phases, and evaluate the accuracy of using these structures to pick simulation points for SimPoint.
Experimental Analysis of an RFID Security Protocol
Authors: Zongwei Luo, Terry Chan, Jenny S. Li, Edward Wong, William Cheung, Victor Ng, Wilton Fok
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Radio frequency identification (RFID) technology is expected to become a critical and ubiquitous infrastructure technology of logistics and supply chain management (SCM) related processes and services. Low-cost has been the key to RFID adoption in many logistics/SCM applications. However, the deployment of such tags may create new threats to user privacy due to the powerful track and trace capabilities of the tags, in addition to tag/reader manufacturing challenges. As a result, some security mechanisms must be imposed on the RFID tags for addressing the privacy problems. This paper provides detailed discussion on our proposal of a lightweight RFID security protocol. It examines the features and issues through experimental analysis pertinent to efficiency and scalability to meet the requirements of the proposed security protocol in metering and payment e-commerce applications.
A Simple Clockless Network-on-Chip for a Commercial Audio DSP Chip
Authors: Mikkel B. Stensgaard, Tobias Bjerregaard, Jens Sparso, Johnny Halkjaer Pedersen
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

We design a very small, packet-switched, clockless Network-on-Chip (NoC) as a replacement for the existing crossbar-based communication infrastructure in a commercial audio DSP chip. Both solutions are laid out in a 0.18 ìm process, and compared in terms of area, power consumption and routing complexity. Even though the NoC turns out to be larger and more power consuming than the existing crossbar implementation, it still accounts for less than 1% of the total chip area and power consumption, and is justified by a long list of advantages: The NoC is modular, scalable, and in contrast to the existing crossbar, it allows all blocks to communicate. The total wire length is decreased by 22% which eases the layout process and makes the design less prone to routing congestion. Not least, the communicating blocks are decoupled by means of the NoC, providing a Globally-Asynchronous, Locally-Synchronous (GALS) system where independent clocking of the individual blocks is enabled. This study shows that NoCs are feasible even for small systems.
Cortical Surface Shape Analysis Based on Spherical Wavelet Transformation
Authors: Peng Yu, Xiao Han, Florent Segonne, Rudolph Pienaar, Randy L. Buckner, Polina Golland, P. Ellen Grant, Bruce Fischl
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Shape analysis of neuroanatomical structures has proven useful in the study of neuropathology and neurodevelopment. Advances in medical imaging have made it possible to study this shape variation in vivo. In this paper, we propose the use of a spherical wavelet transformation to extract cortical surface shape features, as wavelets can characterize the underlying functions in a local fashion in both space and frequency. Our results demonstrate the utility of the wavelet approach in both detecting the spatial scale and pattern of shape variation in synthetic data, and for quantifying and visualizing shape variations of cortical surface models in subject populations.
A methodology for analyzing the temporal evolution of novice programs based on semantic components
Authors: Christopher D. Hundhausen, Jonathan L. Brown, Sean Farley, Daniel Skarpas
Venue: Proceedings of the second international workshop on Computing education research (2006)

Empirical studies of novice programming typically rely on code solutions or test responses as the basis of their analyses. While such data can provide insight into novice programming knowledge, they say little about the programming processes in which novices engage. For those interested in improving novice programming environments, a key research question arises: How can we collect and analyze data on novice programming that will enable us (a) to analyze and compare the programming processes promoted by alternative novice programming environments, and (b) ultimately to build better novice programming environments? To address this question, we have collected a large video corpus of novices as they construct code solutions in various versions of ALVIS Live! [17], a novice programming environment. Through detailed post-hoc analyses of our video corpus, we have developed a methodology for compiling the moment-by-moment evolution of novice code solutions. Based on an analysis of a model code solution's key semantic components, our methodology enables researchers to document, on a second-by-second basis, (a) what part of a code solution a programmer is focusing on, and (b) where the semantic feedback provided by the programming environment is helping. Although it is time and labor intensive, our methodology provides researchers with a standard set of data and representations for comparing the programming processes promoted by alternative programming environments.
A Treasure Hunting Learning Model for Students Studying History and Culture in the Field with Cellphone
Authors: Alex Chang, Maiga Chang, Athena Hsieh
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In the treasure hunting process, the hunters could only get few hints with simple words, therefore they must think over with the experience they learned before. The goal of this paper is to propose a treasure hunting learning model and implement a system based on the model. Within the treasure hunting learning model students will become a treasure hunter when they are learning in the field. The learning model makes learning more fun by asking students some questions according to their learning records and physical position. In order to make the system portable and treasure hunting liked, we implement the treasure hunting learning model with the most simple and common cellphone, that is the text-mode cellphone. To verify the learning model is working, a traditional history and culture course in college was taken as the experiment.
Modeling Collaborative Learning Activities on e-Learning Platforms
Authors: Christian Martel, Laurence Vignollet, Christine Ferraris, Jean-Pierre David, Anne Lejeune
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The scenarization of educational activities, especially those that are going to take place within elearning platforms, has for a number of years represented a major challenge for groups working to favor the emergence of educational standards. In this paper we describe a meta-model, LDL (Learning Design Language), to formalize scenarized activities. We particularly highlight the correct adaptation of this meta-model for modeling various collaborative situations.
Removing Timed Delays in Stochastic Automata
Authors: Fida Kamal Dankar, Gregor V. Bocmann
Venue: Proceedings of the 15th International Conference on Computing (2006)

We present a method to remove timed delays (transitions corresponding to timed internal actions) from a subset of stochastic automata. After removing the internal actions, the steady state probability of a subset of the states of the automata is preserved. The stochastic automata considered in this paper have the property of being Markov regenerative processes.
Guest Editors' Introduction: High-Performance Interconnects
Authors: Fabrizio Petrini, Olav Lysne, Ron Brightwell
Venue: IEEE Micro (2006)

We are pleased to introduce this special issue of IEEE Micro, featuring articles that capture the latest results on high-performance interconnection networks, including some of the best presentations from last summer's Hot Interconnects 13 at Stanford University. Hot Interconnects provides a unique international forum for researchers and developers of state-of-the-art hardware and software architectures for interconnection networks at all scales, ranging from on-chip processor-memory interconnects to high-performance networks for the largest and most powerfulsupercomputers.
Contribution of information and communication technology to total factor productivity and externalities effects
Authors: Hwan-Joo Seo, Young Soo Lee
Venue: Information Technology for Development (2006)

In this article, the authors attempt to find out what roles the digital divide plays in the dynamics of the growth gap among countries by looking at the relationship between ICT investment and the evolution of total factor productivity in 38 countries. The empirical results show that the digital divide, on one hand, widens the growth gap between countries. On the other hand, the global ICT diffusion generates ICT externalities, which have positive effects on the total factor productivity of less-developed countries. Therefore, the global digitalization may have both negative impacts, manifested in a widening digital divide and growth gap, and positive impacts reflected in the effects of knowledge spillovers.
Monitoring Genetic Variations in Variable Length Evolutionary Algorithms
Authors: Michael Defoin Platel, Manuel Clergue
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Initially, Artificial Evolution focuses on Evolutionary Algorithms handling solutions coded in fixed length structures. In this context, the role of crossover is clearly the mixing of information between solutions. The development of Evolutionary Algorithms operating on structures with variable length, of which genetic programming is one of the most representative instances, opens new questions on the effects of crossover. Beside mixing, two new effects are identified : the diffusion of information inside solutions and the variation of the solutions sizes. In this paper, we propose a experimental framework to study these three effects and apply it on three different crossovers for genetic programming : the Standard Crossover, the One-Point Crossover and the Maximum Homologous Crossover. Exceedingly different behaviors are reported leading us to consider the necessary future decoupling of the mixing, the diffusion and the size variation.
Optimizing Web Services Performance by Using Similarity-Based Multicast Protocol
Authors: Khoi Anh Phan, Zahir Tari, Peter Bertok
Venue: Proceedings of the European Conference on Web Services (2006)

Web services have emerged as a key technology that enables interoperability between distributed applications. It is desirable that SOAP, being the Web service transport protocol for inter-connecting applications across organizations, performs efficiently in environments where there are a large number of transactions. This paper presents a novel approach to address this issue and hence improve Web services performance. We propose a similaritybased SOAP multicast protocol (SMP) that reduces the network load by optimizing the generated traffic size. In particular, SMP reuses the common template among the SOAP messages and only sends one copy of the common part to multiple clients. The results obtained from our experiments indicate that SMP achieved a 75 percent reduction in network traffic compared to traditional SOAP unicast.
Five strategies for overcoming obviousness
Authors: Philip G. Emma
Venue: IEEE Micro (2006)

Among rejections issued by the US Patent and Trademark Office, by far the most refer to section 103 of US Code Title 35.Patents, which says, basically, "Although your invention may be new, it's also obvious." Philip Emma explores five strategies for overcoming an obviousness rejection: arguing nonworkability, different universes, or opposition to normal practice; claiming a combination patent; and "peeling the onion."
Optimal Grid Exploitation Algorithms for Data Mining
Authors: Valerie Fiolet, Richard Olejnik, Guillem Lefait, Bernard Toursel
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

Although many Data Mining tasks have been parallelized and can thus be executed on dedicated clusters, few solutions currently exist to solve Data Mining problems on a grid or a non-specialized network of workstations. The current tendency is to focus on the use of grids and/or desktop grids in order to exploit any available workstations with no considerations of their physical positions. If a grid specific algorithm has some common characteristics with a dedicated-cluster algorithm, many constraints are inherent to the use of the grid. In particular, resource volatility and communications cost reduce the parallelism effectiveness. The DisDaMin project (DIStributed DAta MINing) revisits the data mining tasks and proposes new exploitable algorithms for grids. The DisDaMin mechanisms first implement a specific fragmentation of the data using clustering methods, and then realize asynchronous collaborative techniques according to the specifics of execution on grids. The use of this fragmentation method makes it possible to carry out optimal local processing on each node, with a minimum of communications. Using this, we introduce the distributed algorithm DICCoop, an adaptation of DIC (see [3]). Simulations were performed to prove the efficiency of the proposed mechanisms and are hosted on the french national grid GRID5000 (part of the European CoreGrid). We analyse the impact of the numerous parameters on optimization of parallel efficiency.
Experimental study of electrical FitzHugh-Nagumo neurons with modified excitability
Authors: Stéphane Binczak, Sabir Jacquir, Jean-Marie Bilbault, Viktor B. Kazantsev, Vladimir I. Nekorkin
Venue: Neural Networks (2006)

We present an electronical circuit modelling a FitzHugh-Nagumo neuron with a modified excitability. To characterize this basic cell, the bifurcation curves between stability with excitation threshold, bistability and oscillations are investigated. An electrical circuit is then proposed to realize a unidirectional coupling between two cells, mimicking an inter-neuron synaptic coupling. In such a master-slave configuration, we show experimentally how the coupling strength controls the dynamics of the slave neuron, leading to frequency locking, chaotic behavior and synchronization. These phenomena are then studied by phase map analysis. The architecture of a possible neural network is described introducing different kinds of coupling between neurons.
Geometry-guided computation of 3D electrostatics for large biomolecules
Authors: Xuejun Hao, Amitabh Varshney
Venue: Computer Aided Geometric Design (2006)

Electrostatic interactions play a central role in biological processes. Development of fast computational methods to solve the underlying Poisson-Boltzmann equation (PBE) is vital for biomolecular modeling and simulation package. In this paper, we propose new methods for efficiently computing the electrostatic potentials for large molecules by using the geometry of the molecular shapes to guide the computation. The accuracy and stability of the solution to the PBE is quite sensitive to the boundary layer between the solvent and the solute which defines the molecular surface. In this paper, we present a new interface-layer-focused PBE solver. First, we analytically construct the molecular surface of the molecule and compute a distance field from the surface. We then construct nested iso-surface layers outwards and inwards from the surface using the distance field. We have developed a volume simplification algorithm to adaptively adjust the density of the irregular grid based on the importance to the PBE solution. We have generalized the finite difference methods using Taylor series expansion on the irregular grids. Our algorithm achieves about three times speedup in the iterative solution process of PBE, with more accurate results on an analytical solvable testing case, compared with the popular optimized DelPhi program.
A Method of High Bit-Rate Data Hiding in Music Using Spline Interpolation
Authors: Ryuta Fujimoto, Mamoru Iwaki, Tohru Kiryu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Acoustical signals in digital form can include additional information, this information is separate from the original signal even though they are both stored in a same file. Methods for storing additional information into the original acoustical signal itself have been investigated. Their bit-rate is at most several hundred bit per second. This paper proposes a new method for digital watermarking with higher bit-rate. Its information hiding and detection method is based on spline interpolation. As a result of listening experiment, bit-rate of above 1 kbps was achieved without audible deterioration.
Simulating a virtual customer service center
Authors: Daniel S. Riley
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In today's global economy, it may be cost efficient to spread customer service center work across multiple cities, countries or continents. The obstacle to enabling these efficiencies is sizing how much work to send to each location and how many agents it would require to handle that work. Further complications include the potential desire for one-way sharing and prioritization of centers to handle calls. Traditional call center models are inadequate to accurately size virtual customer service centers, as sub-optimization may be counterproductive to the whole. Using simulation, this gap can be bridged, allowing a truly optimal staffing solution for a call center that may have agents taking the same set of calls in New York, Hong Kong and anywhere in-between.
A Simple Yet Effective Data Clustering Algorithm
Authors: Soujanya Vadapalli, Satyanarayana R. Valluri, Kamalakar Karlapalem
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In this paper, we use a simple concept based on k-reverse nearest neighbor digraphs, to develop a framework RECORD for clustering and outlier detection. We developed three algorithms - (i) RECORD algorithm (requires one parameter), (ii) Agglomerative RECORD algorithm (no parameters required) and (iii) Stability-based RECORD algorithm( no parameters required). Our experimental results with published datasets, synthetic and real-life datasets show that RECORD not only handles noisy data, but also identifies the relevant clusters. Our results are as good as (if not better than) the results got from other algorithms.
Optimistic concurrency control and recovery in a multi personal computer system
Authors: Jakob Karszt, Herbert Kuss, Georg Lausen
Venue: ACM SIGSMALL Newsletter (1983)

In this paper we present an attractive concurrency control and recovery method to manage the transactions of a multi user Personal Computer system on a shared data base in a star constellation.
A method of face recognition based on fuzzy clustering and parallel neural networks
Authors: Jianming Lu, Xue Yuan, Takashi Yahagi
Venue: Signal Processing (2006)

This paper presents a method for face recognition based on fuzzy clustering and parallel neural networks. Neural networks have been widely used in various fields. However, the computing efficiency decreases rapidly if the scale of the neural network (NN) increases. In this paper, a new method of face recognition based on the neuron-fuzzy system is proposed. In particular, the face patterns are divided into several small-scale parallel neural networks based on fuzzy clustering, and they are combined to obtain the recognition result. The proposed method achieves 98.71% recognition accuracy using 310 frontal face images and 98.06% recognition accuracy using 310 rotated face images corresponding to 31 individuals.
Optimal computing budget allocation for multi-objective simulation models
Authors: Loo Hay Lee, Ek Peng Chew, Suyan Teng, David Goldsman
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation plays a vital role in identifying the best system design from among a set of competing designs. To improve simulation efficiency, ranking and selection techniques are often used to determine the number of simulation replications required so that a pre-specified level of correct selection is guaranteed at a modest possible computational expense. As most real-life systems are multi-objective in nature, in this paper, we consider a multi-objective ranking and selection problem, where the system designs are evaluated in terms of more than one performance measure. We incorporate the concept of Pareto optimality into the ranking and selection scheme, and try to find all of the non-dominated designs rather than a single "best" one. A simple sequential solution method is proposed to allocate the simulation replications. Computational results show that the proposed algorithm is efficient in terms of the total number of replications needed to find the Pareto set.
New Z-cyclic triplewhist frames and triplewhist tournament designs
Authors: R. Julian R. Abel, Norman J. Finizio, Gennian Ge, Malcolm Greig
Venue: Discrete Applied Mathematics (2006)

Triplewhist tournaments are a specialization of whist tournament designs. The spectrum for triplewhist tournaments on v players is nearly complete. It is now known that triplewhist designs do not exist for v = 5, 9, 12, 13 and do exist for all other v ≡ 0, 1 (mod 4) except, possibly, v = 17. Much less is known concerning the existence of Z-cyclic triplewhist tournaments. Indeed, there are many open questions related to the existence of Z-cyclic whist designs. A (triple)whist design is said to be Z-cyclic if the players are elements in Zm ∪ A where m = v, A = 0 when v ≡ 1 (mod 4) and m = v - 1, A = {∞} when v ≡ 0 (mod 4) and it is further required that the rounds also be cyclic in the sense that the rounds can be labelled, say, R1, R2.... in such a way that Rj+1 is obtained by adding + 1 (mod m) to every element in Rj. The production of Z-cyclic triplewhist designs is particularly challenging when m is divisible by any of 5, 9, 11, 13, 17. Here we introduce several new triplewhist frames and use them to construct new infinite families of triplewhist designs, many for the case of m being divisible by at least one of 5, 9, 11, 13, 17.
Directional radio propagation measurements for near-ground peer-to-peer networks
Authors: David W. Browne, Chris Loo, Jesen Ha, Henrik Borgstrom, Michael P. Fitz, William Kaiser, Valerie Bick, Katherine Kuan, Eric Seidler, Haleh Tabrizi
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

This demonstration will present a radio testbed that is being used to characterize the quality of directional peer-to-peer wireless communications in wilderness environments.