ppxscal/embedding_network huggingface dataset:
A moving mesh approach for simulation budget allocation on continuous domains
Authors: Mark W. Brantley, Chun-Hung Chen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We introduce a moving mesh algorithm for simulation optimization across a continuous domain. During each iteration, the mesh movement is determined by allocating simulation runs to partitions of the domain that are critical in the process of identifying good solutions. The partition boundaries are then adjusted to equally distribute the allocation runs between each partition. To test the moving mesh algorithm, we implemented it using the OCBA method to allocate simulation runs to each partition. But, the simplicity of the procedure should provide flexibility for it to be used with other simulation optimization techniques. Results are presented for several numerical experiments and suggest that the technique has potential given further development.
Knowledge-building and conceptual change: an inquiry into student-directed construction of scientific explanations
Authors: Jun Oshima, Marlene Scardamalia
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The aim of this study was to examine conceptual change from a knowledge-building perspective. Knowledge-building is a process by which learners collaboratively improve their understanding by recording their current ideas as knowledge objects in a communal database. These ideas are then available for discussion and continual improvement. The target environment for our investigations was the CSILE (Computer-Supported Intentional Learning Environments) networked environment in which students report their thoughts as text or graphic notes, then collaboratively work to construct higher levels of understanding. A fifth and sixth-grade combined classroom participated in this study by constructing a database on the topic of how heat affects matter. Based on computer-tracking files, students' written discourses were evaluated by two independent criteria: (1) conceptual change, and (2) knowledge-building activities. The results suggested that students who maintained knowledge-building goals and evaluated their ideas in the context of the writings of the scientific community beyond their classroom succeeded in attaining critical conceptual change.
Local subdivision of Powell-Sabin splines
Authors: Hendrik Speleers, Paul Dierckx, Stefan Vandewalle
Venue: Computer Aided Geometric Design (2006)

We present an algorithm for local subdivision of Powell-Sabin spline surfaces. The construction of such a spline is based on a particular PS-refinement of a given triangulation. We build the new triangulation on top of this PS-refinement by applying a √3-subdivision scheme on a local part of the domain. To avoid degeneration we introduce a simple heuristic for refinement propagation, driven by a parameter. This parameter manages the trade-off between the mesh quality and the refinement localization.
A Deterministic Multidimensional Scaling Algorithm for Data Visualisation
Authors: Anthony Don, Nicolas Hanusse
Venue: Proceedings of the conference on Information Visualization (2006)

In this paper, we present I-PACK, a deterministic layout algorithm for embedding a data set X in 2D provided that distances (duv)u,v?X between data items are given or can be computed. The layout reflects well similarities and dissimilarities between items and it is computed in quasi-linear time. Experimental comparisons with other multidimensional scaling algorithms show that : i) our algorithmhas similar performance when the aspect ratio A = \frac{{\max _{u,v} (\delta uv)}} {{\min _{u,v} (\delta uv)}} is small (i.e. log2A \lt 10) and ii) the larger the aspect ratio, the better I-PACK performs with respect to otherMDS algorithms. This is also true when data can be "naturally clustered.
Rethinking Feelings: An fMRI Study of the Cognitive Regulation of Emotion
Authors: Kevin N. Ochsner, Silvia A. Bunge, James J. Gross, John D. E. Gabrieli
Venue: Journal of Cognitive Neuroscience (2002)

The ability to cognitively regulate emotional responses to aversive events is important for mental and physical health. Little is known, however, about neural bases of the cognitive control of emotion. The present study employed functional magnetic resonance imaging to examine the neural systems used to reappraise highly negative scenes in unemotional terms. Reappraisal of highly negative scenes reduced subjective experience of negative affect. Neural correlates of reappraisal were increased activation of the lateral and medial prefrontal regions and decreased activation of the amygdala and medial orbito-frontal cortex. These findings support the hypothesis that prefrontal cortex is involved in constructing reappraisal strategies that can modulate activity in multiple emotion-processing systems.
Incorporating the Boltzmann Prior in Object Detection Using SVM
Authors: Margarita Osadchy, Daniel Keren
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In this paper we discuss object detection when only a small number of training examples are given. Specifically, we show how to incorporate a simple prior on the distribution of natural images into support vector machines. SVMs are known to be robust to overfitting; however, a few training examples usually do not represent well the structure of the class. Thus the resulting detectors are not robust and highly depend on the choice of the training examples. We incorporate the prior on natural images by requiring that the separating hyperplane will not only yield a wide margin, but also that the corresponding positive half space will have a low probability to contain natural images (the background). Our experiments on real data sets show that the resulting detector is more robust to the choice of training examples, and substantially improves both linear and kernel SVMwhen trained on 10 positive and 10 negative examples.
Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Venue: ACM International Conference Proceeding Series; Vol. 200 (2006)

Welcome to the beautiful and historic city of Pisa and welcome to the Inter-Perf workshop on interdisciplinary systems approaches to performance evaluation and the design of computer and communication systems. The workshop is co-located with VALUETOOLS, the first international conference on performance evaluation methodologies and tools.Issues of particular interest in application scenarios for communication models often relate to networks that are large scale in terms computing elements and users, or closely coupled to the spatial environment of their deployment. The aim of Inter-Perf was to exploit the similarity of many such network models, such as ad-hoc networks, mobile networks, sensor networks, and peer to peer networks, with systems found in other sciences. We are delighted to have succeeded in our objective of bringing together contributions which derive insights and techniques from approaches that are standard in areas such as biological systems, physics and the social sciences, where issues of scalability, self-organization and robustness also arise.The workshop features two superb keynote talks. Laurent Massoulie addresses the stability of decentralized control mechanisms for systems that aim at proportional fair allocation of network resources and broadcasting systems for peer-to-peer data dissemination. Stavros Toumpis draws on mathematical techniques more commonly associated with various branches of physics such as optics and electrostatics to address scalability through the optimization of a macroscopic network model.The invited talk from Jochen Mundinger provide an overview of the state-of-the-art in handling reputation in the various computer science communities as well as the social sciences, and looks at the impact of liars on their peers' reputation, while the invited talk from Mathilde Durvy takes up the theme of self-organization, focussing on the benefits of non-slotted protocols on spatial reuse in multi-hop wireless networks.In addition, there is a stimulating programme of contributed talks, with topics including: information dissemination systems, analogies to thermal diffusion, defense against Internet worms, optimal networks and Braess' paradox, non-linear compartmental systems, and congestion control based on population competition models.
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
Authors: Hassan H. Malik, John R. Kender
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to improve the efficiency of hierarchical document clustering. In this paper, we introduce the notion of "closed interesting" itemsets (i.e. closed itemsets with high interestingness). We provide heuristics such as "super item" to efficiently mine these itemsets and show that they provide significant dimensionality reduction over closed frequent itemsets. Using "closed interesting" itemsets, we propose a new, sub-linearly scalable, hierarchical document clustering method that outperforms state of the art agglomerative, partitioning and frequent-itemset based methods both in terms of clustering quality and runtime performance, without requiring dataset specific parameter tuning. We evaluate twenty interestingness measures and show that when used to generate "closed interesting" itemsets, and to select parent nodes, Mutual Information, Added Value, Yule's Q and Chi- Square offer best clustering performance.
On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs
Authors: Javier Esparza, Petr Jan!car, Alexander Miller
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state encoding. For an important subclass of STGs, the marked graph STGs, we show that checking consistency is polynomial, but checking the existence of a complete state coding is co-NP-complete. In fact, co-NP-completeness already holds for acyclic and 1-bounded marked graph STGs and for live and 1-bounded marked graph STGs. We add some relevant results for freechoice, bounded, and general STGs.
An Approach to Organize Re-usability of Learning Designs and Collaboration Scripts of Various Granularities
Authors: Andreas Harrer
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Learning Processes in technology enhanced learning have been defined more rigorously in the last years to make them supportable and executable in learning environments. This is reflected in the field of educational modelling and learning design as well as in the field of collaboration scripts. Both strands share the property that they operate with learning processes utilized at very different granularity. Because of the high effort in developing such learning designs from scratch, approaches for integrating the different granularities and re-using parts of existing scenarios emerged. In this contribution we will present our conclusions how a landscape of learning process components can be organized to help the practitioner in utilizing the existing design experience for his own purposes. We will elaborate this problem both from a pedagogically and a computationally influences perspective and propose an approach to integrate them in a unified method for organizing the re-use of learning design components.
Is the Fusiform Face Area Specialized for Faces, Individuation, or Expert Individuation?
Authors: Gillian Rhodes, Graham Byatt, Patricia T. Michie, Aina Puce
Venue: Journal of Cognitive Neuroscience (2004)

Several brain imaging studies have identified a region of fusiform gyrus (FG) that responds more strongly to faces than common objects. The precise functional role of this fusiform face area (FFA) is, however, a matter of dispute. We sought to distinguish among three hypotheses concerning FFA function: face specificity, individuation, and expert individuation. According to the face-specificity hypothesis, the FFA is specialized for face processing. Alternatively, the FFA may be specialized for individuating visually similar items within a category (the individuation hypothesis) or for individuating within categories with which a person has expertise (the expert-individuation hypothesis). Our results from two experiments supported the face-specificity hypothesis. Greater FFA activation to faces than Lepidoptera, another homogeneous object class, occurred during both free viewing and individuation, with similar FFA activation to Lepidoptera and common objects (Experiment 1). Furthermore, during individuation of Lepidoptera, 83% of activated FG voxels were outside the face FG region and only 15% of face FG voxels were activated. This pattern of results suggests that distinct areas may individuate faces and Lepidoptera. In Experiment 2, we tested Lepidoptera experts using the same experimental design. Again, the results supported the face-specificity hypothesis. Activation to faces in the FFA was greater than to both Lepidoptera and objects with little overlap between FG areas activated by faces and Lepidoptera. Our results suggest that distinct populations of neurons in human FG may be tuned to the features needed to individuate the members of different object classes, as has been reported in monkey inferotemporal cortex, and that the FFA contains neurons tuned for individuating faces.
Brain Areas Specific for Attentional Load in a Motion-Tracking Task
Authors: Jorge Jovicich, Robert J. Peters, Christof Koch, Jochen Braun, Linda Chang, Thomas Ernst
Venue: Journal of Cognitive Neuroscience (2001)

Although visual attention is known to modulate brain activity in the posterior parietal, prefrontal, and visual sensory areas, the unique roles of these areas in the control of attentional resources have remained unclear. Here, we report a dissociation in the response profiles of these areas. In a parametric functional magnetic resonance imaging (fMRI) study, subjects performed a covert motion-tracking task, in which we manipulated "attentional load" by varying the number of tracked balls. While strong effects of attention - independent of attentional load - were wide-spread, robust linear increases of brain activity with number of balls tracked were seen primarily in the posterior parietal areas, including the intraparietal sulcus (IPS) and superior parietal lobule (SPL). Thus, variations in attentional load revealed different response profiles in sensory areas as compared to control areas. Our results suggest a general role for posterior parietal areas in the deployment of visual of attentional resources.
Task Scheduling in Grid Based on Particle Swarm Optimization
Authors: Tingwei Chen, Bin Zhang, Xianwen Hao, Yu Dai
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

Task scheduling is one of the core steps to effectively exploit the capabilities of resources in the Grid. The task scheduling problem is an NP-complete problem. This paper studied on the task scheduling problem in grid environment and proposed a task scheduling mechanism, which expressed each possible task scheduling scheme as a task-resource assignment graph (T-RAG) and thus mapped the task scheduling problem into a graph optimal selection problem. Moreover, in order to find the optimal solution quickly and accurately, a task scheduling algorithm based on particle swarm optimization (PSO) was proposed. This algorithm regards the longest path of the task-resource assignment graph as fitness value and encodes every task-resource assignment as a particle. Finally, the experimentation shows that the approach proposed in this paper is effective to solve task scheduling problem.
The effects of text drawing styles, background textures, and natural lighting on text legibility in outdoor augmented reality
Authors: Joseph L. Gabbard, J. Edward Swan,  II, Deborah Hix
Venue: Presence: Teleoperators and Virtual Environments (2006)

A challenge in presenting augmenting information in outdoor augmented reality (AR) settings lies in the broad range of uncontrollable environmental conditions that may be present, specifically large-scale fluctuations in natural lighting and wide variations in likely backgrounds or objects in the scene. In this paper, we motivate the need for research on the effects of text drawing styles, outdoor background textures, and natural lighting on user performance in outdoor AR. We present a pilot study and a follow-on user-based study that examined the effects on user performance of outdoor background textures, changing outdoor illuminance values, and text drawing styles in a text identification task using an optical, see-through AP, system. We report significant effects for all these variables, and discuss user interface design guidelines and ideas for future work.
Versatile anycasting with mobile IPv6
Authors: Michal Szymaniak, Guillaume Pierre, Maarten van Steen
Venue: Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications (2006)

Anycasting was introduced to facilitate efficient communication between distributed Internet services and their clients, as it allows client requests to be automatically routed to nearby service instances. However, even though several any-cast implementations have been proposed, their various limitations prevent them from being widely adopted by large-scale distributed systems.This paper identifies the key limitations of existing anycast implementations, and proposes how to implement anycast such that all these limitations are addressed without harming the performance of anycast communication. Our solution relies on address-translation capabilities present in modern operating systems. These capabilities have originally been designed for communication with mobile nodes. However, we demonstrate that one can exploit them to implement versatile anycasting at low cost.
VLSI Bio-Inspired Microsystem for Robust Microarrray Image Analysis and Recognition
Authors: Wai-Chi Fang, Jaw-Chyng L. Lue
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A VLSI bio-inspired microsystem for real-time, on-site, robust image analysis and recognition has been developed. A corresponding novel artificial neural network (ANN) learning algorithm using new sigmoid-logarithmic transfer function is invented. Our results show the trained new ANN can recognize low fluorescence patterns better than the conventional sigmoidal ANN does. A differential logarithmic imaging chip is designed for calculating logarithm of relative intensities of fluorescence signals. The single-rail logarithmic circuit and a prototype ANN chip are designed, fabricated and characterized.
Performance Evaluation of iSCSI System Optimized for Encryption Processing in the Upper Layer
Authors: Kikuko Kamisaka, Masato Oguchi, Saneyasu Yamaguchi
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

iSCSI protocol, used in building IP-based storage networks, is becoming more important because it realizes consolidation of storage at low cost. Security is a critical issue for the iSCSI protocol, on which remote storage is accessed over the IP networks. iSCSI can employ IPsec that offers a function of strong encryption. However, IPsec encryption processing degrades the performance of storage access and increases the CPU load of the server. In this paper, to perform secure storage access on iSCSI networks, we propose the storage access method of encrypting in the upper layer and its optimization, instead of using IPsec encryption that leads to the performance degradation. We implemented our proposed system, and experimentally evaluated our system accessed with multi process for simulating optimization of encryption pre-processing. As a result, our proposal, optimizing of encryption pre-processing is more efficient than the method using IPsec.
Comparative Study of Improved Neurolinear Method to Two Other Novel Feature Extraction Techniques
Authors: Aistis Raudys
Venue: Journal of Intelligent and Robotic Systems (2006)

This paper compares Neurolinear feature extraction technique to two other feature extraction techniques. The author has developed all three methods recently, but in this paper, Neurolinear method has been improved even further. The study is performed in respect to performance, accuracy and suitability for visualisation. Experimental study is performed on a variety of datasets from numerous domains: Chemistry, biology, finance etc. In total, 19 real and two artificial datasets were used. Comparison is performed in terms of computational efficiency and accuracy. Results show that Neurolinear method achieves best accuracy while Best directions method is not so accurate but often much faster.
Ensemble Method for Robust Motion Estimation
Authors: Wei Zhang, Jana Kosecka
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The core of the traditional RANSAC algorithm and its more recent efficient counterparts is the hypothesis evaluation stage, with the focus on finding the best, outlier free hypothesis. Motivated by a non-parametric ensemble techniques, we demonstrate that it proves advantageous to use the entire set of hypotheses generated in the sampling stage. We show that by studying the residual distribution of each data point with respect to the entire set of hypotheses, the problem of inlier/ outlier identification can be formulated as a classification problem. We present extensive simulations of the approach, which in the presence of a large percentage (> 50%) of outliers, provides a repeatable and, an order of magnitude more efficient method compared to the currently existing techniques. Results on widebaseline matching and fundamental matrix estimation are presented.
Bookshelf
Authors: Fernando Berzal, Stuart James Woodward, Art Sedighi
Venue: IEEE Software (2006)

Three book reviews of Software Systems Architecture: Working with Stakeholders Using Viewpoints and Perspectives by Nick Rozanski and Eoin Woods; Competitive Engineering by Tom Gilb; and Server Architectures by Rene J. Chevance.
Ubiquitous Home Security Robot Based on Sensor Network
Authors: Yoon-Gu Kim, Han-Kil Kim, Suk-Gyu Lee, Ki-Dong Lee
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

We propose and develop Home Security system based on Sensor Network (HSSN) configured by sensor nodes including radio frequency (RF), ultrasonic, temperature, light and sound sensors. Our system can acknowledge security alarm events that are acquired by sensor nodes and relayed in the hop-by-hop transmission way. There are sensor network, home security mobile robot (HSMR) and home server in this system. In the experimental results of this system, we presented that our system has more enhanced performance of response to emergency context and more speedy and accurate path planning to target position for arriving an alarm zone and acquiring the context-aware information.