ppxscal/embedding_network huggingface dataset:
An Efficient Newton-Krylov Implementation of the Constrained Runs Scheme for Initializing on a Slow Manifold
Authors: Christophe Vandekerckhove, Ioannis Kevrekidis, Dirk Roose
Venue: Journal of Scientific Computing (2009)

The long-term dynamic behavior of many dynamical systems evolves on a low-dimensional, attracting, invariant slow manifold, which can be parameterized by only a few variables ("observables"). The explicit derivation of such a slow manifold (and thus, the reduction of the long-term system dynamics) is often extremely difficult or practically impossible. For this class of problems, the equation-free framework has been developed to enable performing coarse-grained computations, based on short full model simulations. Each full model simulation should be initialized so that the full model state is consistent with the values of the observables and close to the slow manifold. To compute such an initial full model state, a class of constrained runs functional iterations was proposed (Gear and Kevrekidis, J. Sci. Comput. 25(1), 17---28, 2005; Gear et al., SIAM J. Appl. Dyn. Syst. 4(3), 711---732, 2005). The schemes in this class only use the full model simulator and converge, under certain conditions, to an approximation of the desired state on the slow manifold. In this article, we develop an implementation of the constrained runs scheme that is based on a (preconditioned) Newton-Krylov method rather than on a simple functional iteration. The functional iteration and the Newton-Krylov method are compared in detail using a lattice Boltzmann model for one-dimensional reaction-diffusion as the full model simulator. Depending on the parameters of the lattice Boltzmann model, the functional iteration may converge slowly or even diverge. We show that both issues are largely resolved by using the Newton-Krylov method, especially when a coarse grid correction preconditioner is incorporated.
Introducing Preferences over NFPs into Service Selection in SOA
Authors: Christian Schröpfer, Maxim Binshtok, Solomon Eyal Shimony, Aviram Dayan, Ronen Brafman, Philipp Offermann, Oliver Holschke
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

When implementing a business or software activity in SOA, a match is sought between the required functionality and that provided by a web service. In selecting services to perform a certain business functionality, often only hard constraints are considered. However, client requirements over QoS or other NFP types are often soft and allow tradeoffs. We use a graphical language for specifying hard constraints, preferences and tradeoffs over NFPs as well as service level objectives (SLO). In particular, we use the TCP and UCP network formalisms to allow for a simple yet very flexible specification of hard constraints, preferences, and tradeoffs over these properties. Algorithms for selecting web services according to the hard constraints, as well as for optimizing the selected web service configuration, according to the specification, were developed.
Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
Authors: Fabrizio Riguzzi
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of well founded models of the normal logic programs obtained by selecting one disjunct from each ground LPAD clause. The paper presents SLGAD resolution that computes the (conditional) probability of a ground query from an LPAD and is based on SLG resolution for normal logic programs. SLGAD is evaluated on classical benchmarks for well founded semantics inference algorithms, namely the stalemate game and the ancestor relation. SLGAD is compared with Cilog2 and SLDNFAD, an algorithm based on SLDNF, on the programs that are modularly acyclic. The results show that SLGAD deals correctly with cyclic programs and, even if it is more expensive than SLDNFAD on problems where SLDNFAD succeeds, is faster than Cilog2 when the query is true in an exponential number of instances.
Specification of a framework for semantic annotation of geospatial data on the web
Authors: Carla Geovana N. Macário, Claudia Bauzer Medeiros
Venue: SIGSPATIAL Special (2009)

The Web is a huge repository of geospatial information (GI), distributed all over the world. Efficient retrieval of this information is a key factor in planning and decision-making in a variety of domains. However, the proposed standards and specifications for data annotation and exchanging enable only syntactic interoperability. Semantic heterogeneity still presents challenges for GI retrieval. One possible approach to tackle these problems is to elicit knowledge by means of semantic annotations, based on multiple ontologies. This work describes a framework to support management of semantic annotations for digital content on the Web, for agricultural planning and monitoring. This will help end-users (agronomers, farmers, Earth scientists) to work cooperatively in developing integrated practices for land management. Content to be annotated in this context includes, for instance, satellite images, sensor data temporal series (e.g., from ground sensors or weather stations), and all kinds of textual data files.
RCP-based HIL Simulation and Control for 2-DOF Tracking Robot of Maneuvering Target
Authors: Zhizhong Tong, Hui Zhang, Zhengmao Ye, Junwei Han
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

The research on tracking control system of maneuvering target is a hot issue. 2-DOF robot has kinematic capability of tracking non-maneuvering and maneuvering targets in air, while the servo control of the robot is crucial for the performance of target tracking. Traditional routine, including modeling, simulation and controller design, is a serial process, so the burdensome iterative steps bring about restrictions to the development period and efficiency. RCP as a live design can realize a smooth and fast transition from conceptual design to experimental verifications. Based on this technique a design routine is proposed and used for HIL simulation of 2-DOF Tracking Robot of Maneuvering Target. Experimental results show that the new routine is efficient and the requirements are better fulfilled.
The effect of investor psychology on the complexity of stock market: An analysis based on cellular automaton model
Authors: Ying Fan, Shang-Jun Ying, Bing-Hong Wang, Yi-Ming Wei
Venue: Computers and Industrial Engineering (2009)

In this paper, using a developed cellular automaton model of the stock market, variables reflecting fractal and stability properties are introduced to describe complexity in the stock market; the concept of discrete level is defined to characterize market stability. Based on the model, the dependency of market complexity on the investors' imitation degree is investigated. The results show a clear correlation between investors' imitation degree and complexity of the stock market.
Improved book-embeddings of incomplete hypercubes
Authors: Toru Hasunuma
Venue: Discrete Applied Mathematics (2009)

In this paper, we show that any incomplete hypercube with, at most, 2^n+2^n^-^1+2^n^-^2 vertices can be embedded in n-1 pages for all n>=4. For the case n>=4, this result improves Fang and Lai's result that any incomplete hypercube with, at most, 2^n+2^n^-^1 vertices can be embedded in n-1 pages for all n>=2. Besides this, we show that the result can be further improved when n is large - e.g., any incomplete hypercube with at most 2^n+2^n^-^1+2^n^-^2+2^n^-^7 (respectively, 2^n+2^n^-^1+2^n^-^2+2^n^-^7+2^n^-^2^3^0) vertices can be embedded in n-1 pages for all n>=9 (respectively, n>=232).
An Epidemic Theoretic Framework for Vulnerability Analysis of Broadcast Protocols in Wireless Sensor Networks
Authors: Pradip De, Yonghe Liu, Sajal K. Das
Venue: IEEE Transactions on Mobile Computing (2009)

While multi-hop broadcast protocols, such as Trickle, Deluge and MNP, have gained tremendous popularity as a means for fast and convenient propagation of data/code in large scale wireless sensor networks, they can, unfortunately, serve as potential platforms for virus spreading if the security is breached. To understand the vulnerability of such protocols and design defense mechanisms against piggy-backed virus attacks, it is critical to investigate the propagation process of these protocols in terms of their speed and reachability. In this paper, we propose a general framework based on the principles of epidemic theory, for vulnerability analysis of current broadcast protocols in wireless sensor networks. In particular, we develop a common mathematical model for the propagation that incorporates important parameters derived from the communication patterns of the protocol under test. Based on this model, we analyze the propagation rate and the extent of spread of a malware over typical broadcast protocols proposed in the literature. The overall result is an approximate but convenient tool to characterize a broadcast protocol in terms of its vulnerability to malware propagation. We have also performed extensive simulations which have validated our model.
The influence that partition arrangement in the environment using PC in the public area gives the user's impression
Authors: Haruhisa Yamaguchi, Yumi Yamaguchi, Takafumi Terasawa, Hironori Sasaki, Yuka Kawasaki, Ayaka Ueda
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

People treat personal information by a computer in public spaces nowadays, but VDT work environment is not designed adequately enough for that purpose. In order to provide user-centered design of work environment in public areas, we need guidelines for designing VDT work environment in public areas. We conducted an experiment in which users showed their impressions of different types of partitioned work areas in public space. We found that users evaluate the work environment in public areas based on sense of security, comfortableness, and liberation, and analyzed the connections of these three factors by the factor score.
Noise Cancellation on ECG and Heart Rate Signals Using the Undecimated Wavelet Transform
Authors: Oscar Hernández, Edgar Olvera
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

This article describes the research carried out to eliminate the noise found in ECG signals and cardiac rhythm. The purpose to obtain clarity and reliability in the acquiring signals which can later be interpreted by a specialist. The work is based on the use of the Undecimated Wavelet Transform (UWT). In order to get a better identification of the acquired signal the Wavelet filter D6 (Daubechies) was chosen, primarily because its scaling function is closely related to the shape of the ECG, fitting very well with the applications constraints. The processed signals were acquired using an amplifying board of bioelectrical signals (front-end board) and a NI PCI-6221 data acquisition board with a sampling frequency of 200 Hz. The ECG signals are obtained through the implant of electrodes connected to a channel of the front-end board. The cardiac rhythm is then obtained using an optic dactilar sensor connected to an independent channel of the ECG signal. The amplifying board was designed and developed for researching purposes on the telemedicine and signal processing area. The application to denoise the ECG signal was developed by LabView® and is capable of graphically showing the data before and after it’s processed.
3D finite difference computation on GPUs using CUDA
Authors: Paulius Micikevicius
Venue: Proceedings of 2nd Workshop on General Purpose Processing on Graphics Processing Units (2009)

In this paper we describe a GPU parallelization of the 3D finite difference computation using CUDA. Data access redundancy is used as the metric to determine the optimal implementation for both the stencil-only computation, as well as the discretization of the wave equation, which is currently of great interest in seismic computing. For the larger stencils, the described approach achieves the throughput of between 2,400 to over 3,000 million of output points per second on a single Tesla 10-series GPU. This is roughly an order of magnitude higher than a 4-core Harpertown CPU running a similar code from seismic industry. Multi-GPU parallelization is also described, achieving linear scaling with GPUs by overlapping inter-GPU communication with computation.
STAREX: the JPL-STAR computer resident executive
Authors: John A. Rohr
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

STAREX, the resident executive for the JPL-STAR computer is presented. The JPL-STAR computer is a faulttolerant computer which includes hardware self-repair capability. All programs which run on the computer require special considerations for proper operation in the faulttolerant hardware environment. System programs use a single variable to indicate the rollback status of the active routine. User programs periodically invoke system routines to save the program state and establish rollback points. When a fault occurs, hardware self-repair occurs first, followed by software recovery to resume computation in a proper state. A brief description of the JPL-STAR computer is given, followed by an overview and then implementation details of STAREX. Finally, the fault-tolerance considerations in the design of STAREX are discussed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Edutainment with a mixed reality book: a visually augmented illustrative childrens' book
Authors: Raphaël Grasset, Andreas Dünser, Mark Billinghurst
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Recently several researchers have developed augmented reality books which involve overlaying virtual content onto the pages of a real book. In this paper, we extend this general concept by adding virtual visual and auditory enhancements to an already published book. Together with the author and professionals in education we have explored various alternatives of combining virtual and real content, new dedicated interactions techniques, and visual effects to enhance immersion. In this paper we report on the design and development of a new type of 'mixed reality book'. We also summarize user feedback collected during different user trials and demonstrations of the prototype.
A Temporal-domain Error Concealment Algorithm Effective in Motion Boundary Improvement
Authors: De Fang Zhao, Sheng Rong Gong, Shu Kui Zhang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In order to ease the motion boundary in temporal-domain algorithms, the paper propose to utilize the luminance of macro-block(MB) around the lost MB, to obtain a more precise and dense motion vectors, the rational function be used in motion vector interpolation. Mutation points in the vector field are detected, as a combination of movement of the border, in the same way, the missing pieces of motion vector interpolation are available along the direction of the boundary through the final match algorithm,Experimental results show that the algorithm is better.
Retrieving XML data from heterogeneous sources through vague querying
Authors: Bettina Fazzinga, Sergio Flesca, Andrea Pugliese
Venue: ACM Transactions on Internet Technology (TOIT) (2009)

We propose a framework for querying heterogeneous XML data sources. The framework ensures high autonomy to participating sources as it does not rely on a global schema or on semantic mappings between schemas. The basic intuition is that of extending traditional approaches for approximate query evaluation, by providing techniques for combining partial answers coming from different sources, possibly on the basis of limited knowledge about the local schemas (i.e., key constraints). We define a query language and its associated semantics, that allows us to collect as much information as possible from several heterogeneous XML sources. We provide algorithms for query evaluation and characterize the complexity of the query language. Finally, we validate the approach in a medical application scenario.
Exploring Human Factors in Formal Diagram Usage
Authors: Andrew Fish, Babak Khazaei, Chris Roast
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Formal diagrammatic notations have been developed as alternatives to symbolic specification notations. Ostensibly to aid users in performing comprehension and reasoning tasks, restrictions called wellformedness conditions may be imposed. However, imposing too many of these conditions can have adverse effects on the utility of the notation (e.g. reducing the expressiveness). Understanding the human factors involved in the use of a notation, such as how user-preference and comprehension relate to the imposition of wellformedness conditions, will enable the notation designers to make more informed design decisions. Euler diagrams are a simple visualization of set-theoretic relationships which are the basis of more expressive constraint languages. We have performed exploratory studies with Euler diagrams which indicated that novice user preferences strongly conform to the imposition of all wellformedness conditions, but that even a limited exposure diminishes this preference.
Backtracking-based load balancing
Authors: Tasuku Hiraishi, Masahiro Yasugi, Seiji Umatani, Taiichi Yuasa
Venue: ACM SIGPLAN Notices (2009)

High-productivity languages for parallel computing become more important as parallel environments including multicores become more common. Cilk is such a language. It provides good load balancing for many applications including irregular ones; that is, it keeps all workers busy by creating plenty of "logical" threads and adopting the oldest-first work stealing strategy. This paper proposes a "logical thread"-free framework called Tascell, which achieves a higher performance and supports a wider range of parallel environments including clusters without loss of productivity. A Tascell worker spawns a "real" task only when requested by another idle worker. The worker performs the spawning by temporarily "backtracking" and restoring its oldest task-spawnable state. Our approach eliminates the cost of spawning/managing logical threads. It also promotes the reuse of workspaces and improves the locality of reference since it does not need to prepare a workspace for each concurrently runnable logical thread. Furthermore, Tascell enables elegant and highly-efficient backtrack search algorithms with delayed workspace copying. For instance, our 16-queens problem solver is 1.86 times faster than Cilk on a system with two dual-core processors. Our approach also enables a single program to run in both shared and distributed memory environments with reasonable efficiency and scalability.
Improving on-line construction of two-dimensional suffix trees for square matrices
Authors: Joong Chae Na, Namhee Kim, Jeong Seop Sim, Dong Kyue Kim
Venue: Information Processing Letters (2009)

The two-dimensional (2-D) suffix tree of an nxn square matrix A is a compacted trie that represents all square submatrices of A. We consider constructing 2-D suffix trees on-line, which means, instead of giving the whole matrix A in advance, A is separated and each part of A is given at different time as algorithms proceed. In general, developing an on-line algorithm is more difficult than developing an off-line algorithm. Moreover, the smaller the input grain size is, the harder it is to develop an on-line algorithm. In the case of 2-D suffix tree construction, dealing with a character at a time is harder than dealing with a row or a column at a time. In this paper we propose a randomized linear-time algorithm for constructing 2-D suffix trees on-line. This algorithm is superior to previous algorithms in two ways: (1) This is the first linear-time algorithm for constructing 2-D suffix trees on-line. Although there have been some linear-time algorithms for off-line construction, there were no linear-time algorithms for on-line construction. (2) We deal with the most fine-grain on-line case, i.e., our algorithm can construct a 2-D suffix tree even though only one character of A is given at a time, while previous on-line algorithms require at least a row and/or a column at a time.
An Energy-Effective Link Quality Monitoring Mechanism for Event-driven Wireless Sensor Network
Authors: Jian Shu, Linlan Liu, Ronglei Zhang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Link quality monitoring mechanism is an indispensable means to protect network health. With ensuring certain monitoring accuracy, to reduce energy consumption as much as possible is a critical issue of wireless sensor network. Considering the feature of relatively less traffic in event-driven Wireless Sensor network during no event state, the paper proposes a link quality monitoring mechanism named DSTC, which is based on PRR. And EWMA algorithm is employed to smooth the results of monitoring. Experiments prove that compared to the normal mechanism, DSTC mechanism can reduce energy consumption dramatically and extend the lifetime of network, while ensuring certain accuracy of measurement.
Ship compartment modeling based on a non-manifold polyhedron modeling kernel
Authors: Sang-Uk Lee, Myung-Il Roh, Ju-Hwan Cha, Kyu-Yeul Lee
Venue: Advances in Engineering Software (2009)

Currently, ship compartment modeling systems which are being used in shipyards support compartment modeling of the bottom-up approach. That is, a compartment model of a ship is being generated by modeling all compartments one by one. However, this method requires much time and efforts because the ship consists of compartments of several tens to several hundreds. To solve this problem, a new compartment modeling method of the top-down approach is proposed in this study. The proposed method is based on space subdivision as if we cut food into many small pieces. For this, a new modeling operation named a ''Place'' operation which is a kind of Boolean operations is developed. A non-manifold polyhedron modeling kernel containing the Place operation is also developed. Furthermore, a ship compartment modeling system was developed based on the modeling kernel. To evaluate the applicability of the proposed method and the developed kernel, it is applied to compartment modeling of various ships. As a result, it is shown that a designer can perform easily and rapidly compartment modeling by using the proposed method in early time.
CAMEO - camera, audio and motion with emotion orchestration for immersive cinematography
Authors: Hyunju Shim, Bo Gyeong Kang
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

This paper introduces a system for an automatic 3D animation production, CAMEO, which offers various kinds of direction knowledge from the real world in a unified manner. To accumulate direction knowledge, we have worked in cooperation with real world experts and developed a system which orchestrates direction knowledge into computer algorithm and data. We also defined a set of XML schema to represent 3D animation contents in XML format. The advantage of our approach is the harmony of direction factors which enables users to write the narrative and expect 3D animation reflected with all direction factors automatically.