ppxscal/embedding_network huggingface dataset:
Formal specification applied to multiuser distributed services: experiences in collaborative t-learning
Authors: Martín López-Nores, José Pazos-Arias, Jorge García-Duque, Yolanda Blanco-Fernández, Manuel Ramos-Cabrer, Alberto Gil-Solla, Ana Fernández-Vilas, Rebeca Díaz-Redondo
Venue: Journal of Systems and Software (2006)

The development of multiuser and distributed software systems faces the difficulty to program the applications correctly, in a way that guarantees the desired interaction among the users. Motivated by experiences with collaborative t-learning services (i.e. multiuser educational services over Interactive TV), this paper presents a solution to that problem, based on supplementing visual development with formal specification techniques. As a contribution to the development of interactive systems, a software process is introduced that helps defining the separate and the conjoint behavior of different users, incrementally and using highly-accessible formalisms.
Deactivation of Sensory-Specific Cortex by Cross-Modal Stimuli
Authors: Paul J. Laurienti, Jonathan H. Burdette, Mark T. Wallace, Yi-Fen Yen, Aaron S. Field, Barry E. Stein
Venue: Journal of Cognitive Neuroscience (2002)

Visual and auditory cortices traditionally have been considered to be "modality-specific." Thus, their activity has been thought to be unchanged by information in other sensory modalities. However, using functional magnetic resonance imaging (fMRI), the present experiments revealed that ongoing activity in the visual cortex could be modulated by auditory information and ongoing activity in the auditory cortex could be modulated by visual information. In both cases, this cross-modal modulation of activity took the form of deactivation. Yet, the deactivation response was not evident in either cortical area during the paired presentation of visual and auditory stimuli. These data suggest that cross-modal inhibitory processes operate within traditional modality-specific cortices and that these processes can be switched on or off in different circumstances.
Catechol O-Methyltransferase Val158Met Polymorphism is Associated with Cognitive Performance in Nondemented Adults
Authors: Cindy M. De Frias, Kristina Annerbrink, Lars Westberg, Elias Eriksson, Rolf Adolfsson, Lars-Göran Nilsson
Venue: Journal of Cognitive Neuroscience (2005)

The catechol O-methyltransferase (COMT) gene is essential in the metabolic degradation of dopamine in the prefrontal cortex. In the present study, we examined the effect of a Val158 Met polymorphism in the COMT gene on individual differences and changes in cognition (executive functions and visuospatial ability) in adulthood and old age. The participants were 292 nondemented men (initially aged 35&ndash;85 years) from a random sample of the population (i.e., the Betula study) tested at two occasions with a 5-year interval. Confirmatory factor analyses were used to test the underlying structure of three indicators of executive functions (verbal fluency, working memory, and Tower of Hanoi). Associations between COMT, age, executive functioning, and visuospatial (block design) tasks were examined using repeated-measures analyses of variance. Carriers of the Val allele (with higher enzyme activity) compared with carriers of the Met/Met genotype (with low enzyme activity) performed worse on executive functioning and visuospatial tasks. Individuals with the Val/Val genotype declined in executive functioning over the 5-year period, whereas carriers of the Met allele remained stable in performance. An Age &times; COMT interaction for visuospatial ability located the effect for middle-aged men only. This COMT polymorphism is a plausible candidate gene for executive functioning and fluid intelligence in nondemented middle-aged and older adults.
Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
Authors: Philipp Friese, Jörg Rambau
Venue: Discrete Applied Mathematics (2006)

We develop and experimentally compare policies for the control of a system of k elevators with capacity one in a transport environment with l floors, an idealized version of a pallet elevator system in a large distribution center of the Herlitz PBS AG in Falkensee. Each elevator in the idealized system has an individual waiting queue of infinite capacity. On each floor, requests arrive over time in global waiting queues of infinite capacity. The goal is to find a policy that, without any knowledge about future requests, assigns an elevator to each request and a schedule to each elevator so that certain expected cost functions (e.g., the average or the maximal flow times) are minimized. We show that a reoptimization policy for minimizing average squared waiting times can be implemented to run in real-time (1 s) using dynamic column generation. Moreover, in discrete event simulations with Poisson input it outperforms other commonly used policies like multi-server variants of greedy and nearest neighbor.
Functional Dependency Maintenance and Lossless Join Decomposition in XML Model Decomposition
Authors: Xia Li, Fei-yue Ye, Hong-juan Yuan, Wen-tao Peng
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The paper studies "equality" in XML model decomposition. XML IFD, TFD, AFD and MVD are proposed. According to complexity of these FDs, four XML normal forms are presented. FD maintenance and lossless join decomposition of DTD are defined to analyze "equality" of decomposition. Four lossless algorithms are proposed to decompose DTD into some XML normal form and validity of these algorithms is analyzed.
Simulation and gaming as a support tool for lean manufacturing systems: a case example from industry
Authors: Durk-Jouke van der Zee, Jannes Slomp
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this article we illustrate how simulation and gaming can be used to support lean manufacturing systems. More in particular we study a case example from industry -- a manual assembly line for mail-inserting systems -- for which we have developed a simulation game. This paper focuses on the development steps of the simulation game. The objective of the game is to support the introduction of lean principles in an existing assembly line. The simulation game can be used to demonstrate applicability of a lean control concept at the assembly line and to train workers to make appropriate control decisions within this concept. In this paper, we indicate a definite need for the development of this game. The systematic way in which it is developed, the use of a general simulation language in the design phase, and its usefulness may stimulate the introduction of simulation games in more industrial settings.
Analysis of a customer demand driven semiconductor supply chain in a distributed simulation test bed
Authors: Chin Soon Chong, Peter Lendermann, Boon Ping Gan, Brett Marc Duarte, John W. Fowler, Thomas E. Callarman
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Effective supply chain management (SCM) enables organizations to be more competitive in the current world of global manufacturing by reducing costs and improving the quality of customer service. Simulation can assist in moving towards these goals by evaluating the feasibility of alternative policies for managing a supply chain. However, simulation of multiple factories within the supply chain, with a high level of granularity in particular, can be very complex and computationally intensive. In this paper, we describe how a distributed simulation test bed enabling very detailed supply chain simulation can be used to study a customer-demand driven semiconductor supply chain.
Automatic Priming of Semantically Related Words Reduces Activity in the Fusiform Gyrus
Authors: Thalia Wheatley, Jill Weisberg, Michael S. Beauchamp, Alex Martin
Venue: Journal of Cognitive Neuroscience (2005)

We used rapid, event-related fMRI to identify the neural systems underlying object semantics. During scanning, subjects silently read rapidly presented word pairs (150 msec, SOA = 250 msec) that were either unrelated in meaning (ankle&ndash;carrot), semantically related (fork&ndash;cup), or identical (crow&ndash;crow). Activity in the left posterior region of the fusiform gyrus and left inferior frontal cortex was modulated by word-pair relationship. Semantically related pairs yielded less activity than unrelated pairs, but greater activity than identical pairs, mirroring the pattern of behavioral facilitation as measured by word reading times. These findings provide strong support for the involvement of these areas in the automatic processing of object meaning. In addition, words referring to animate objects produced greater activity in the lateral region of the fusiform gyri, right superior temporal sulcus, and medial region of the occipital lobe relative to manmade, manipulable objects, whereas words referring to manmade, manipulable objects produced greater activity in the left ventral premotor, left anterior cingulate, and bilateral parietal cortices relative to animate objects. These findings are consistent with the dissociation between these areas based on sensory- and motor-related object properties, providing further evidence that conceptual object knowledge is housed, in part, in the same neural systems that subserve perception and action.
Fuzzy Measures on the Gene Ontology for Gene Product Similarity
Authors: Mihail Popescu, James M. Keller, Joyce A. Mitchell
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2006)

One of the most important objects in bioinformatics is a gene product (protein or RNA). For many gene products, functional information is summarized in a set of Gene Ontology (GO) annotations. For these genes, it is reasonable to include similarity measures based on the terms found in the GO or other taxonomy. In this paper, we introduce several novel measures for computing the similarity of two gene products annotated with GO terms. The fuzzy measure similarity (FMS) has the advantage that it takes into consideration the context of both complete sets of annotation terms when computing the similarity between two gene products. When the two gene products are not annotated by common taxonomy terms, we propose a method that avoids a zero similarity result. To account for the variations in the annotation reliability, we propose a similarity measure based on the Choquet integral. These similarity measures provide extra tools for the biologist in search of functional information for gene products. The initial testing on a group of 194 sequences representing three proteins families shows a higher correlation of the FMS and Choquet similarities to the BLAST sequence similarities than the traditional similarity measures such as pairwise average or pairwise maximum.
Web Services Directory Based on Peer-to-Peer Technology
Authors: Joachim Gotze, Markus Hillenbrand, Paul Muller
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Service-oriented architectures foster the interaction of a multitude of different services. In order to ensure flawless service interaction a directory service is needed that can be used to find suitable services for a desired task. A centralized solution for local services might be suitable for small systems, but on a larger scale - when systems start to interact via Federations of Trust - the need for an highly available and easily maintainable directory service arises.
Energy-efficient data caching and prefetching for mobile devices based on utility
Authors: Huaping Shen, Mohan Kumar, Sajal K. Das, Zhijun Wang
Venue: Mobile Networks and Applications (2005)

In mobile computing environments, vital resources like battery power and wireless channel bandwidth impose significant challenges in ubiquitous information access. In this paper, we propose a novel energy and bandwidth efficient data caching mechanism, called GreedyDual Least Utility (GD-LU), that enhances dynamic data availability while maintaining consistency. The proposed utility-based caching mechanism considers several characteristics of mobile distributed systems, such as connection-disconnection, mobility handoff, data update and user request patterns to achieve significant energy savings in mobile devices. We develop an analytical model for energy consumption of mobile devices in a dynamic data environment. Based on the utility function derived from the analytical model, we propose algorithms for cache replacement and passive prefetching of data objects. Our comprehensive simulation experiments demonstrate that the proposed caching mechanism achieves more than 10% energy saving and near-optimal performance tradeoff between access latency and energy consumption.
The Survivability of the Augmented Logical Ring Topology in WDM Networks
Authors: Yung-Chiao Chen, Chuan-Ching Sue, Sy-Yen Kuo
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

The logical ring topology is a simple protection scheme in WDM networks. The failure of a single physical fiber link may cause the failure of multiple lightpaths. The service becomes unprotected if the failure propagates to the logical ring topology. In this paper, we focus on the elimination of failure propagation from the physical WDM Network to the logical topology. We propose a method to make the augmented logical ring topology survivable. The Augmented Survivable Edges (ASE) is based on the connectivity problem of the logical topology. Our method makes the modification of logical ring topology cost-effective, i.e., with the minimal number of the additional edges to the original logical ring topology. Finally, we show the results on various network cases
EagleKeeper: a coached practice environment for flightline avionics
Authors: Sandra Katz
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The approach to training complex, technical tasks that we have shaped at the Learning Research and Development Center is one of learning by doing with reflection after tasks are performed. That is, we engineer work-like experiences in a simulated environment, providing coaching so that trainees are never unable to complete a task, and opportunities for students to "replay" a record of their solution, critique that performance with the "computer" coach, compare it to expert performances, and ask questions about their own or a simulated expert's actions. We refer to tutoring systems based on this approach as intelligent coached practice environments. The approach has been shown to be effective when the training tasks represent the hardest parts of the real job. In fact, recent versions of our tutoring systems have achieved not only high levels of training on specific jobs, but also substantial transfer to new but related jobs [Gott et al., in press].
Trimming of 3D solid finite element meshes using parametric surfaces: application to sheet metal forming
Authors: A. J. Baptista, J. L. Alves, D. M. Rodrigues, L. F. Menezes
Venue: Finite Elements in Analysis and Design (2006)

In this paper we present a methodology for trimming 3D solid finite element meshes using a non-uniform rational B-spline (NURBS) surfaces representation. The algorithms applied in the identification of the spatial position of the finite element (FE) nodes and elements relative to the trimming surface are described, as well as, the explanation of the correction methods adopted to geometrically rearrange the trimmed elements. Three different strategies are proposed to adjust, with greater or lesser accuracy, the trimmed FE mesh to the trimming surface. The first consists only of an element elimination strategy, while the other two are based on a nodal stretching strategy, aiming for more accurate adjustment of the finite elements boundary to the trimming surface. Finally, to highlight the capabilities of the developed program, a mesh generation example is given by trimming a mesh with the shape of a blank automotive panel.
Modeling Analytical Indicators Using DataWarehouse Metamodel
Authors: Andrzej Januszewski, Tadeusz Pankowski
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

We propose a metamodel-oriented framework for modeling business analytical indicators. In the modeling we apply the CWM's Behavioral metamodel and discuss the advantages of using it to plan and model business warehouses. We show how to model indicators in the conformity with such a metamodel. This approach, which is based on a standard metamodel, allows us to realize data transformations between different implementations of different data repositories. In this way, it is possible to achieve interoperability of independently designed data warehouse systems.
Process Matchmaking on a P2P Environment
Authors: Remzi Celebi, Huseyin Ellezer, Cem Baylam, Ibrahim Cereci, Hurevren Kilic
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

A process matchmaking environment based on P2P architecture and Gnutella protocol is established. Java Agent Development Framework (JADE) is used as middleware. The processes are modeled as one-input transition systems augmented by goal state descriptions. A polynomial-time algorithm for handling matchmaking of peer process encounters is developed. The environment can easily be customized to a specific application domain by simple user-interface modifications and through the development of related state ontologies.
Secure Mobile and Wireless Communication Services for Collaborative Virtual Gaming
Authors: Babak Akhgar, Wolfgang Orth, Norbert Meyer, Miika Tuisku, Gregor Pipan, Mario Lopez Gallego, Jose Alberto Garcia, Maurizio Cecchi, Jean-Noel Colin
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

The paper reports on the current research activities and innovations provisioning secure ICT services. The identified research challenges and roadmap represent a significant step towards the development of global federated security services for the Web, Grid and particularly for future Mobile and Wireless communication (ICT platforms). The overall aim of the research is to provide seamless traversal to access distributed resources in the heterogeneous Web, Grid, and particularly Mobile and Wireless spaces. Furthermore, in order to consider the value and usefulness of the Trust-ME framework its strategic impact is assessed in terms of its proposed application to real world integrated scenario in a collaborative virtual gaming.
Visualizing the Underwater Behavior of Humpback Whales
Authors: Colin Ware, Roland Arsenault, Matthew Plumlee, David Wiley
Venue: IEEE Computer Graphics and Applications (2006)

Until recently, scientists knew little about what whales did underwater. Studying theunderwater behavior of marine mammals is difficult; light doesn't travel far through water, and divers can't keep within visual range of an animal capable of sustained speeds of 5 knots. Scientists can use sonar technologies to image marine mammals underwater, but sonar records provide only occasional brief glimpses of whales underwater. A new collaboration between visualization experts, engineers, and marine biologists has changed this. For the first time, we can see and study the foraging behavior of humpback whales. This is important not just for purely scientific reasons. Whales are dying because of ship collisions and entanglements with fishing gear in ever-increasing numbers. Understanding their behavior could lead to changes in shipping regulations or in the nature and deployment of fishing apparatus.
Mesh simplification using ellipsoidal schema for isotropic quantization of face-normal vectors
Authors: Ganesan Subramaniam, Kenneth Ong
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

In this paper, we present a method for simplification of arbitrary 3D meshes that is based on Isotropic Quantization of face-normal vectors. There are three stages. Firstly, a codebook that contains the unique face-normal vectors of the 3D mesh is generated using our Ellipsoidal Schema. Secondly, the polygons of the mesh are grouped into patches: based on the codebook vectors and the locality information of the polygons. Polygons that have isotropic and geographical similarities are grouped together. And the resulting patch is approximately a flat plane with its corresponding codebook vector as its normal. In the last stage, our mesh simplification technique re-triangulates the patch, in which the algorithm only considers the vertices on the borders of the patch. We demonstrate that our technique yields better results when applied with multiple iterations than when using a single iteration. Thus using patch-wise quantization, our technique is able to simplify 3D meshes.
Accuracy of Time-Domain Algorithms for Self-Similarity: An Empirical Study
Authors: Julio C. Ramirez Pacheco, Deni Torres Roman
Venue: Proceedings of the 15th International Conference on Computing (2006)

Self-similarity plays an important role in the performance analysis of modern computer networks. An important problem is then to obtain an accurate inference of the degree of self-similarity and use this value for design and control purposes. Several algorithms for inferring the degree of self-similarity in a time series are currently in use. Unfortunately, several variables affect the accuracy of these algorithms. In this paper we identify these sources of inaccuracies and find the correct values for obtaining minimum biased estimates of the parameter of self-similarity. This "tuning" is done to several time-domain algorithms for selfsimilarity. The effect of the series length in the accuracy of these algorithms is also studied. This is done by the use of a cumulative analysis of self-similar traces. Based on this study we propose the minimum length series to obtain accurate estimates of the self-similarity parameter.
Pricing derivative securities in incomplete markets
Authors: Sergey Sarykalin, Stan Uryasev
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We propose the algorithms for pricing American and European options in incomplete markets. We consider a non-self-financing replicating portfolio and minimize the hedging error consisting of the self-financing error of the portfolio dynamics and the error of the option's payoff replication. We treat the pricing problem as regression with constraints and reduce it to a quadratic minimization problem. The algorithms of pricing American and European options differ in imposing one additional type of constraints. Prices of options for different initial and strike prices can be found in one optimization run. The algorithms create a table representing the option price as a function of time and the underlying stock price for the whole lifetime of the option. We illustrate the numerical performance of the algorithms with options on futures contracts in natural gas market.