ppxscal/embedding_network huggingface dataset:
DDDAS for Autonomic Interconnected Systems: The National Energy Infrastructure
Authors: C. Hoffmann, E. Swain, Y. Xu, T. Downar, L. Tsoukalas, P. Top, M. Senel, M. Bell, E. Coyle, B. Loop, D. Aliprantis, O. Wasynczuk, S. Meliopoulos
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The most critical element of the nation's energy infrastructure is our electricity generation, transmission, and distribution system known as the "power grid." Computer simulation is an effective tool that can be used to identify vulnerabilities and predict the system response for various contingencies. However, because the power grid is a very large-scale nonlinear system, such studies are presently conducted "open loop" using predicted loading conditions months in advance and, due to uncertainties in model parameters, the results do not provide grid operators with accurate "real time" information that can be used to avoid major blackouts such as were experienced on the East Coast in August of 2003. However, the paradigm of Dynamic Data-Driven Applications Systems (DDDAS) provides a fundamentally new framework to rethink the problem of power grid simulation. In DDDAS, simulations and field data become a symbiotic feedback control system and this is refreshingly different from conventional power grid simulation approaches in which data inputs are generally fixed when the simulation is launched. The objective of the research described herein was to utilize the paradigm of DDDAS to develop a marriage between sensing, visualization, and modelling for large-scale simulation with an immediate impact on the power grid. Our research has focused on methodological innovations and advances in sensor systems, mathematical algorithms, and power grid simulation, security, and visualization approaches necessary to achieve a meaningful large-scale real-time simulation that can have a significant impact on reducing the likelihood of major blackouts.
A Rich Services Approach to CoCoME
Authors: Barry Demchak, Vina Ermagan, Emilia Farcas, To-Ju Huang, Ingolf H. Krüger, Massimiliano Menarini
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

Systems-of-systems integration projects present exquisite challenges for software and systems engineering researchers and practitioners. Traditional integration approaches involve time-consuming rework bearing major financial and technical risk. Service-Oriented Architectures (SOAs) have emerged as a widely accepted solution to this challenge because they use standards-based infrastructure to forge large-scale systems out of loosely-coupled, interoperable services. SOAs can create systems-of-systems by mapping existing systems into services, then orchestrating communication between the services. New functionality can be created by either adding new services or modifying communication among existing services. Because of these features, SOA projects are particularly amenable to agile development processes. Consequently, well executed SOAs can drive down financial and technical risk by improving flexibility and reducing time to market.
Bringing Haptics to Second Life for Visually Impaired People
Authors: Maurizio Pascale, Sara Mulatto, Domenico Prattichizzo
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Potential applications of online virtual worlds are attracting the interest of many researchers around the world. One and perhaps the most famous example of such systems is Linden Lab's Second Life. Last year, sources for its client application have been released under the GPL license, allowing anyone to extend it building a modified client. This work presents an effort to explore the possibilities that haptic technologies can offer to multiuser online virtual worlds, to provide users with an easier, more interactive and immersive experience. A haptic-enabled version of the Second Life Client, supporting major haptic devices, is proposed. Two haptic-based input modes have been added which help visually impaired people to navigate and explore the simulated 3D environment by exploiting force feedback capabilities of these devices.
Control of single-sector economy over a finite time interval with allowance for employer consumption
Authors: N. S. Demin, E. V. Kuleshova
Venue: Automation and Remote Control (2008)

The problem of optimal control of a single-sector economics over a finite time interval was studied for the class of the linear uniform production functions in terms of the criterion for maximum employer consumption under exponential growth of the manpower resources. Solution was obtained in the form of the "turnpike theorem." Its properties were considered. The results obtained were specified for the case of the Cobb-Douglas production function.
Visual Analytics: Definition, Process, and Challenges
Authors: Daniel Keim, Gennady Andrienko, Jean-Daniel Fekete, Carsten Görg, Jörn Kohlhammer, Guy Melançon
Venue: Information Visualization: Human-Centered Issues and Perspectives (2008)

We are living in a world which faces a rapidly increasing amount of data to be dealt with on a daily basis. In the last decade, the steady improvement of data storage devices and means to create and collect data along the way influenced our way of dealing with information: Most of the time, data is stored without filtering and refinement for later use. Virtually every branch of industry or business, and any political or personal activity nowadays generate vast amounts of data. Making matters worse, the possibilities to collect and store data increase at a faster rate than our ability to use it for making decisions. However, in most applications, raw data has no value in itself; instead we want to extract the information contained in it.
Cyclic Additive and Quantum Stabilizer Codes
Authors: Jürgen Bierbrauer
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

We develop the theory of additive cyclic codes and of cyclic quantum stabilizer codes.
Shape-Based Alignment of Hippocampal Subfields: Evaluation in Postmortem MRI
Authors: Paul A. Yushkevich, Brian B. Avants, John Pluta, David Minkoff, John A. Detre, Murray Grossman, James C. Gee
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

This paper estimates the accuracy of hippocampal subfield alignment via shape-based normalization. Evaluation takes place in postmortem MRI dataset acquired at 9.4 Tesla with many averages and approximately 0.01,mm3 voxel resolution. Continuous medial representations (cm-reps) are used to establish geometrical correspondences between hippocampal formations in different images; the extent to which these correspondences match up subfields is evaluated and compared to normalization driven by image forces. Shape-based normalization is shown to perform only slightly worse than image-based normalization; this is encouraging because the former is more applicable to in vivo MRI, which typically lacks features that distinguish hippocampal subfields.
Algorithms for ε-Approximations of Terrains
Authors: Jeff M. Phillips
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Consider a point set ${\mathcal{D}}$ with a measure function $\mu : {\mathcal{D}} \to \mathcal{R}$. Let ${\mathcal{A}}$ be the set of subsets of $\mathcal{D}$ induced by containment in a shape from some geometric family (e.g. axis-aligned rectangles, half planes, balls, k-oriented polygons). We say a range space $(\mathcal{D}, \mathcal{A})$ has an &epsilon;-approximation P if $$\max_{R \in \mathcal{A}} \left| \frac{\mu(R \cap P)}{ \mu(P)} - \frac{\mu(R \cap \mathcal{D})}{ \mu(\mathcal{D})} \right| \leq \varepsilon.$$ We describe algorithms for deterministically constructing discrete &micro;-approximations for continuous point sets such as distributions or terrains. Furthermore, for certain families of subsets $\mathcal{A}$, such as those described by axis-aligned rectangles, we reduce the size of the &epsilon;-approximations by almost a square root from $O(\frac{1}{\varepsilon^2} \log \frac{1}{\varepsilon})$ to . This is often the first step in transforming a continuous problem into a discrete one for which combinatorial techniques can be applied. We describe applications of this result in geospatial analysis, biosurveillance, and sensor networks.
Efficient Method for Point-Based Rendering on GPUs
Authors: Lamei Yan, Youwei Yuan
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

We describe methods for high-performance and high-quality rendering of point models, including advanced shading, anti-aliasing, and transparency. we keep the rendering quality as the previous GPU-based point rendering approaches, while involving normal vector computation for each frame. We also present efficient data structures for hierarchical rendering on modern graphics processors (GPUs). In addition we will address methods for geometric processing, filtering and resampling of point models. Examples are presented to illustrate the quality of the meshes produced, and the flexibilities of the computational system.
Homotopy Conditions for Tolerant Geometric Queries
Authors: Vadim Shapiro
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

Algorithms for many geometric queries rely on representations that are comprised of combinatorial (logical, incidence) information, usually in a form of a graph or a cell complex, and geometric data that represents embeddings of the cells in the Euclidean space E d . Whenever geometric embeddings are imprecise, their incidence relationships may become inconsistent with the associated combinatorial model. Tolerant algorithms strive to compute on such representations despite the inconsistencies, but the meaning and correctness of such computations have been a subject of some controversy.This paper argues that a tolerant algorithm usually assumes that the approximate geometric representation corresponds to a subset of E d that is homotopy equivalent to the intended exact set. We show that the Nerve Theorem provides systematic means for identifying sufficient conditions for the required homotopy equivalence, and explain how these conditions are used in the context of geometric and solid modeling.
SORMA --- Business Cases for an Open Grid Market: Concept and Implementation
Authors: Jens Nimis, Arun Anandasivam, Nikolay Borissov, Garry Smith, Dirk Neumann, Niklas Wirström, Erel Rosenberg, Matteo Villa
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

Economic mechanisms enhance technological solutions by setting the right incentives to reveal information about demand and supply accurately. Market or pricing mechanisms are ones that foster information exchange and can therefore attain efficient allocation. By assigning a value (also called utility) to their service requests, users can reveal their relative urgency or costs to the service. The implementation of theoretical sound models induce further complex challenges. The EU-funded project SORMA analyzes these challenges and provides a prototype as a proof-of-concept. In this paper the approach within the SORMA-project is described on both conceptual and technical level.
Extracting Response Times from Fluid Analysis of Performance Models
Authors: Jeremy T. Bradley, Richard Hayden, William J. Knottenbelt, Tamas Suto
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

Recent developments in the analysis of stochastic process algebra models allow for transient measures of very large models to be extracted. By performing so-called fluid analysis of stochastic process algebra models, it is now feasible to analyse systems of size 101000 states and beyond. This paper seeks to extend the type of measure that can be extracted from this style of fluid analysis. We present a systematic transformation of a PEPA model that will allow us to extract measures analogous to response times. We end by extracting these response-time measures from a PEPA model of a healthcare system.
Large Deformation Diffeomorphic Metric Curve Mapping
Authors: Joan Glaunès, Anqi Qiu, Michael I. Miller, Laurent Younes
Venue: International Journal of Computer Vision (2008)

We present a matching criterion for curves and integrate it into the large deformation diffeomorphic metric mapping (LDDMM) scheme for computing an optimal transformation between two curves embedded in Euclidean space ¿ d . Curves are first represented as vector-valued measures, which incorporate both location and the first order geometric structure of the curves. Then, a Hilbert space structure is imposed on the measures to build the norm for quantifying the closeness between two curves. We describe a discretized version of this, in which discrete sequences of points along the curve are represented by vector-valued functionals. This gives a convenient and practical way to define a matching functional for curves. We derive and implement the curve matching in the large deformation framework and demonstrate mapping results of curves in ¿2 and ¿3. Behaviors of the curve mapping are discussed using 2D curves. The applications to shape classification is shown and experiments with 3D curves extracted from brain cortical surfaces are presented.
Diagonal Circuit Identity Testing and Lower Bounds
Authors: Nitin Saxena
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x 1,...,x n ) (i.e. C is a sum of powers of linear functions) is zero. We also prove an exponential lower bound showing that such a circuit will compute determinant or permanent only if there are exponentially many linear functions. Our techniques generalize to the following new results: 1 Suppose we are given a depth-4 circuit (over any field $\mathbb{F}$) of the form: $$C({x_1},\ldots,{x_n}):=\sum_{i=1}^k L_{i,1}^{e_{i,1}}\cdots L_{i,s}^{e_{i,s}}$$where, each L i,j is a sum of univariate polynomials in $\mathbb{F}[{x_1},\ldots,{x_n}]$. We can test whether C is zero deterministically in poly(size(C), max i {(1 + e i,1) ¿ (1 + e i,s )}) field operations. In particular, this gives a deterministic polynomial time identity test for general depth-3 circuits C when the d: =degree(C) is logarithmic in the size(C). 1 We prove that if the above circuit C(x 1,...,x n ) computes the determinant (or permanent) of an m×m formal matrix with a "small" $s=o\left(\frac{m}{\log m}\right)$ then k = 2 ¿(m). Our lower bounds work for all fields $\mathbb{F}$. (Previous exponential lower bounds for depth-3 only work for nonzero characteristic.) 1 We also present an exponentially faster identity test for homogeneous diagonal circuits (deterministically in poly(nklog(d)) field operations over finite fields).
Alternative Distance Metrics for Enhanced Reliability of Spatial Regression Analysis of Health Data
Authors: Stefania Bertazzon, Scott Olson
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

We present a spatial autoregressive model (SAR) to investigate the relationship between the incidence of heart disease and a pool of selected socio-economic factors in Calgary (Canada). Our goal is to provide decision makers with a reliable model, which can guide locational decisions to address current disease occurrence and mitigate its future occurrence and severity. To this end, the applied model rests on a quantitative definition of neighbourhood relationships in the city of Calgary. Our proposition is that such relationships, usually described by Euclidean distance, can be more effectively described by alternative distance metrics. The use of the most appropriate metric can improve the regression model by reducing the uncertainty of its estimates, ultimately providing a more reliable analytical tool for management and policy decision making.
A Visual Analytics Framework for the Examination Timetabling Problem
Authors: J. Joshua Thomas, Ahamad Tajudin Khader, Bahari Belaton
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

The research aspiration is to develop a visual framework for the examination timetabling problem. To perform the task we identified visual analytics as a multi-disciplinary field, directly supports the timetable designers, assist with visual metaphors, patterns to make decisions. Here we deemed three stages on the problem domain. It deals with pre-processing, during the processing and post-processing; in each of the processes are with transaction on data which transform into timetables. These processes are interrelated with one another for any heuristic based, evolutionary algorithm guided timetabling systems. However, the importance aspect is the significance of visualization among the three processes and how it contributes in each process. This paper discuss two aspects, it wraps the framework with literature and an implication on the pre-processing through visualizing data and knowledge with graph visualization.
Towards Collaborative Intelligent Tutors: Automated Recognition of Users' Strategies
Authors: Ya'Akov Gal, Elif Yamangil, Stuart M. Shieber, Andee Rubin, Barbara J. Grosz
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper addresses the problem of inferring students' strategies when they interact with data-modeling software used for pedagogical purposes. The software enables students to learn about statistical data by building and analyzing their own models. Automatic recognition of students' activities when interacting with pedagogical software is challenging. Students can pursue several plans in parallel and interleave the execution of these plans. The algorithm presented in this paper decomposes students' complete interaction histories with the software into hierarchies of interdependent tasks that may be subsequently compared with ideal solutions. This algorithm is evaluated empirically using commercial software that is used in many schools. Results indicate that the algorithm is able to (1) identify the plans students use when solving problems using the software; (2) distinguish between those actions in students' plans that play a salient part in their problem-solving and those representing exploratory actions and mistakes; and (3) capture students' interleaving and free-order action sequences.
Educational Games Design Issues: Motivation and Multimodal Interaction
Authors: Mladjan Jovanovic, Dusan Starcevic, Velimir Stavljanin, Miroslav Minovic
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

In this paper we present an approach to identifying and constructing profiles of user interfaces for educational games. Our approach is based on framing games as educational tools that incorporate fun and learning through motivation as the key ingredient in the learning process, and multimodal interaction as the medium for conveying educational material. To date, there is no common standard to design this kind of games and individual solutions are usually carried out by an ad hoc process. Proposed solution formalizes design process describing educational games in terms of estimated effects they produce on players. Building upon research on learning and motivation theory, we are connecting these effects with player learning preferences and motivation states. Our main contribution is to suggest design issues that should be taken into account when designing educational games. We exemplify the approach through our ongoing VStrat project, framework for designing educational games.
Ontology-Mediated Integration of Intranet Web Services
Authors: Tse-Ming Tsai, Han-Kuan Yu, Hsin-Te Shih, Ping-Yao Liao, Ren-Dar Yang, Seng-cho T. Chou
Venue: Computer (2003)

XML-based Web services standards have simplified integration with open Internet protocols and given machines an enhanced ability to communicate. Developers are striving to tap into the depth of mutual understanding that can be culled from the Web's diverse content to provide a vast increase in available services.Dealing with this flood of options will require sweeping automation. To meet this challenge, the authors built their smart office task automation framework—SOTA—using Web services, an ontology, and agent components.
Neural Correlates of Anticipation in Cerebellum, Basal Ganglia, and Hippocampus
Authors: Jason G. Fleischer
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

Animals anticipate the future in a variety of ways. For instance: (a) they make motor actions that are timed to a reference stimulus and motor actions that anticipate future movement dynamics; (b) they learn to make choices that will maximize reward they receive in the future; and (c) they form memories of behavioral episodes such that the animal's future actions can be predicted by current neural activity associated with those memories. Although these effects are clearly observable at the behavioral level, research into the mechanisms of such anticipatory learning are still largely in the early stages. This review, intended for those who have a computational background and are less familiar with neuroscience, addresses neural mechanisms found in the mammalian cerebellum, basal ganglia, and the hippocampus that give rise to such adaptive anticipatory behavior.
Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
Authors: Tateaki Sasaki, Fujio Kako
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

Computation of Gröbner bases of polynomial systems with coefficients of floating-point numbers has been a serious problem in computer algebra for many years; the computation often becomes very unstable and people did not know how to remove the instability. Recently, the present authors clarified the origin of instability and presented a method to remove the instability. Unfortunately, the method is very time-consuming and not practical. In this paper, we first investigate the instability much more deeply than in the previous paper, then we give a theoretical analysis of the term cancellation which causes loss of accuracy in various cases. On the basis of this analysis, we propose a practical method for computing Gröbner bases with coefficients of floating-point numbers. The method utilizes multiple precision floating-point numbers, and it removes the drawbacks of the previous method almost completely. Furthermore, we present a practical method of estimating the ill-conditionedness of the input system.
Competencies and Profiles Management for Virtual Organizations Creation
Authors: Jiří Hodík, Jiří Vokřínek, Jiří Bíba, Petr Bečvář
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Sharing information about profiles and offered competencies of individual members within an alliance of cooperating companies facilitates searching for potential members of Virtual Organizations. This paper presents a concept of structuring of the competencies as well as a prototype proving this concept. The prototype follows a naturally hybrid architecture of alliances that consists of mutually independent alliance partners, who may be supported by central institutions of the alliance. The use of the agent-based solution enables information sharing among partners in such distributed and dynamic environment.