ppxscal/embedding_network huggingface dataset:
The complexity and distribution of hard problems
Authors: D. W. Juedes, J. H. Lutz
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

Measure-theoretic aspects of the /spl les//sub m//sup P/-reducibility structure of exponential time complexity classes E=DTIME(2/sup linear/) and E/sub 2/=DTIME(2/sup polynomial/) are investigated. Particular attention is given to the complexity (measured by the size of complexity cores) and distribution (abundance in the sense of measure) of languages that are /spl les//sub m//sup P/-hard for E and other complexity classes. Tight upper and lower bounds on the size of complexity cores of hard languages are derived. The upper bounds say that the /spl les//sub m//sup P/-hard languages for E are unusually simple in, the sense that they have smaller complexity cores than most languages in E. It follows that the /spl les//sub m//sup P/-complete languages for E form a measure 0 subset of E (and similarly in E/sub 2/). This latter fact is seen to be a special case of a more general theorem, namely, that every /spl les//sub m//sup P/-degree (e.g. the degree of all /spl les//sub m//sup P/-complete languages for NP) has measure 0 in E and in E/sub 2/.
Exploiting idle register classes for fast spill destination
Authors: Fang Lu, Lei Wang, Xiaobing Feng, Zhiyuan Li, Zhaoqing Zhang
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

On today's microprocessors, there often exist several different types of registers, e.g. general purpose registers and floating point registers. A given program may use one type of registers much more frequently than other types. This creates an opportunity to employ the infrequently used registers as spill destinations for the more frequently used register types. In this paper, we present a code optimization method named idle register exploitation (IRE) to exploit such opportunities. We developed a model, called the IRE model, or IREM, to determine the static performance gains of IRE versus spilling to the stack. On a microprocessor with fast data paths between different types of registers, we find that IRE method speeds up the execution of the SPECint benchmark suite from 1.7% to 10%. In contrast, on microprocessors with less efficient data transfer paths, the performance gain is limited. In some cases, performance may even suffer degradation. This result argues strongly for the adoption of fast data paths between different types of registers for the purpose of reducing register spills, which is important in view of the increased significance of memory bottlenecks on future microprocessors.
REDLIB for the Formal Verification of Embedded Systems
Authors: Farn Wang
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

To promote the technology of dense-time system model-checking in both academia and industry, we developed a library, called REDLIB, which supports full TCTL model-checking of dense-time automata with multiple fairness assumptions. REDLIB uses the BDD-like diagrams for the efficient representation and manipulation of dense-time statespaces. Users can use the procedures in REDLIB to quickly construct dense-time models and carry out basic Boolean and state-space operations, postcondtion/precondition calculation, state-space representation normalizations, greatest fixpoint calculation, parametric safety analysis of linear hybrid systems, speed-up techniques for greatest fixpoint evaluation, and coverage analysis of dense-time statespaces. REDLIB also has a preprocessor that allows for high-level constructs like arrays, message channels, dynamic memory allocation, procedure calls, and timers. In this article, we discuss the features of REDLIB and give small examples to show how to use REDLIB. 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
Stochastic Optimization Modeling and Quantitative Project Management
Authors: Uma Sudhakar Rao, Srikanth Kestur, Chinmay Pradhan
Venue: IEEE Software (2008)

A successful project effectively manages four cornerstones—schedule, cost, scope, and quality—to achieve its goals. Every project activity influences these four cornerstones. Stochastic optimization modeling factors in the uncertainties associated with project activities and provides insight into the expected project outputs as probability distributions rather than as deterministic approximations. Integrating stochastic optimization modeling with quantitative project management provides near-real-time feedback, enabling projects to monitor areas that induce maximum variability and thereby initiate corrective actions as required.
HECOL: Homography and epipolar-based consistent labeling for outdoor park surveillance
Authors: Simone Calderara, Andrea Prati, Rita Cucchiara
Venue: Computer Vision and Image Understanding (2008)

Outdoor surveillance is one of the most attractive application of video processing and analysis. Robust algorithms must be defined and tuned to cope with the non-idealities of outdoor scenes. For instance, in a public park, an automatic video surveillance system must discriminate between shadows, reflections, waving trees, people standing still or moving, and other objects. Visual knowledge coming from multiple cameras can disambiguate cluttered and occluded targets by providing a continuous consistent labeling of tracked objects among the different views. This work proposes a new approach for coping with this problem in multi-camera systems with overlapped Fields of View (FoVs). The presence of overlapped zones allows the definition of a geometry-based approach to reconstruct correspondences between FoVs, using only homography and epipolar lines (hereinafter HECOL: Homography and Epipolar-based COnsistent Labeling) computed automatically with a training phase. We also propose a complete system that provides segmentation and tracking of people in each camera module. Segmentation is performed by means of the SAKBOT (Statistical and Knowledge Based Object Tracker) approach, suitably modified to cope with multi-modal backgrounds, reflections and other artefacts, typical of outdoor scenes. The extracted objects are tracked using a statistical appearance model robust against occlusions and segmentation errors. The main novelty of this paper is the approach to consistent labeling. A specific Camera Transition Graph is adopted to efficiently select the possible correspondence hypotheses between labels. A Bayesian MAP optimization assigns consistent labels to objects detected by several points of views: the object axis is computed from the shape tracked in each camera module and homography and epipolar lines allow a correct axis warping in other image planes. Both forward and backward probability contributions from the two different warping directions make the approach robust against segmentation errors, and capable of disambiguating groups of people. The system has been tested in a real setup of a urban public park, within the Italian LAICA (Laboratory of Ambient Intelligence for a friendly city) project. The experiments show how the system can correctly track and label objects in a distributed system with real-time performance. Comparisons with simpler consistent labeling methods and extensive outdoor experiments with ground truth demonstrate the accuracy and robustness of the proposed approach.
An embodied interface for teaching computational thinking
Authors: Judith Good, Pablo Romero, Benedict du Boulay, Henry Reid, Katherine Howland, Judy Robertson
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We describe an innovative educational system designed to, firstly, motivate young people to engage with computational concepts and secondly, provide them with tools to do so in an embodied manner. The interface is designed as a "magic mirror" in which users can, through augmented reality technology, take on the role of a character and control the character's movements via their own movements. They are able to record movements, and using a Wii Remote as a mouse and pointing device, organise these movements into sequences. We are now working on ways in which the recorded movements can be manipulated in ways that foster computational thinking.
A parallel algorithm for accurate dot product
Authors: N. Yamanaka, T. Ogita, S. M. Rump, S. Oishi
Venue: Parallel Computing (2008)

Parallel algorithms for accurate summation and dot product are proposed. They are parallelized versions of fast and accurate algorithms of calculating sum and dot product using error-free transformations which are recently proposed by Ogita et al. [T. Ogita, S.M. Rump, S. Oishi, Accurate sum and dot product, SIAM J. Sci. Comput. 26 (6) (2005) 1955-1988]. They have shown their algorithms are fast in terms of measured computing time. However, due to the strong data dependence in the process of their algorithms, it is difficult to parallelize them. Similarly to their algorithms, the proposed parallel algorithms in this paper are designed to achieve the results as if computed in K-fold working precision with keeping the fastness of their algorithms. Numerical results are presented showing the performance of the proposed parallel algorithm of calculating dot product.
Agent-based protein structure prediction
Authors: Luca Bortolussi, Agostino Dovier, Federico Fogolari
Venue: Multiagent and Grid Systems (2007)

A protein is identified by a finite sequence of amino acids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting the 3D native conformation of a protein, when its sequence of amino acids is known. Although it is accepted that the native state minimizes the free energy of the protein, all current mathematical models of the problem are affected by intrinsic computational limits, and moreover there is no common agreement on which is the most reliable energy function to be used. In this paper we present an agent-based framework for ab-initio simulations, composed by different levels of agents. Each amino acid of an input protein is viewed as an independent agent that communicates with the others. Then we have also strategic agents and cooperative ones. The framework allows a modular representation of the problem and it is easily extensible for further refinements and for different energy functions. Simulations at this level of abstraction allow fast calculation, distributed on each agent. We have written a multi-thread implementation, and tested the feasibility of the engine with two energy functions.
Kinematic state estimation and motion planning for stochastic nonholonomic systems using the exponential map
Authors: Wooram Park, Yan Liu, Yu Zhou, Matthew Moses, Gregory s. Chirikjian
Venue: Robotica (2008)

A nonholonomic system subjected to external noise from the environment, or internal noise in its own actuators, will evolve in a stochastic manner described by an ensemble of trajectories. This ensemble of trajectories is equivalent to the solution of a Fokker–Planck equation that typically evolves on a Lie group. If the most likely state of such a system is to be estimated, and plans for subsequent motions from the current state are to be made so as to move the system to a desired state with high probability, then modeling how the probability density of the system evolves is critical. Methods for solving Fokker-Planck equations that evolve on Lie groups then become important. Such equations can be solved using the operational properties of group Fourier transforms in which irreducible unitary representation (IUR) matrices play a critical role. Therefore, we develop a simple approach for the numerical approximation of all the IUR matrices for two of the groups of most interest in robotics: the rotation group in three-dimensional space, SO(3), and the Euclidean motion group of the plane, SE(2). This approach uses the exponential mapping from the Lie algebras of these groups, and takes advantage of the sparse nature of the Lie algebra representation matrices. Other techniques for density estimation on groups are also explored. The computed densities are applied in the context of probabilistic path planning for kinematic cart in the plane and flexible needle steering in three-dimensional space. In these examples the injection of artificial noise into the computational models (rather than noise in the actual physical systems) serves as a tool to search the configuration spaces and plan paths. Finally, we illustrate how density estimation problems arise in the characterization of physical noise in orientational sensors such as gyroscopes.
Ontology Based Affective Context Representation
Authors: Kuderna-Iulian Benta, Anca Rarău, Marcel Cremene
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this paper we propose an ontology based representation of the affective states for context aware applications that allows expressing the complex relations that are among the affective states and between these and the other context elements. This representation is open to map different affective spaces; basic and secondary states relation (using Fuzzy Logic), the relation between these states and other context elements as location, time, person, activity etc. The proposed affective context model is encoded in OWL. Due to difficulties in direct detection of the secondary affective states we propose a method to infer the characteristic values of these states from other context elements values. The deduces states are used here to improve the behavior of a Context Aware Museum Guide in order to react more intuitively and more intelligent by taking into account the users affective states.
Handbook of Hidden Markov Models in Bioinformatics, 1 edition
Authors: Martin Gollery
Venue: Chapman & Hall/Crc Mathematical And Computational Biology (2008)

Demonstrating that many useful resources, such as databases, can benefit most bioinformatics projects, the Handbook of Hidden Markov Models in Bioinformatics focuses on how to choose and use various methods and programs available for hidden Markov models (HMMs). The book begins with discussions on key HMM and related profile methods, including the HMMER package, the sequence analysis method (SAM), and the PSI-BLAST algorithm. It then provides detailed information about various types of publicly available HMM databases, such as Pfam, PANTHER, COG, and metaSHARK. After outlining ways to develop and use an automated bioinformatics workflow, the author describes how to make custom HMM databases using HMMER, SAM, and PSI-BLAST. He also helps you select the right program to speed up searches. The final chapter explores several applications of HMM methods, including predictions of subcellular localization, posttranslational modification, and binding site. By learning how to effectivelyuse the databases and methods presented in this handbook, you will be able to efficiently identify features of biological interest in your data.
Impact of static load modeling on industrial: load nodal prices
Authors: G. Reza Yousefi, M. Mohsen Pedram
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This paper is concerned with the nodal prices in a competitive electricity market based on the pool parading when the industrial loads are statistically modeled. Specifically it addresses the impact of static load modeling on the active and reactive marginal costs, while loads are varying. Based on nodal pricing theory of marginal costs, an approach is proposed in this paper, in which the impacts of static load modeling on marginal costs of both active and reactive power of industrial loads are calculated. The proposed algorithm is evaluated on IEEE 14-bus test system.
Real-time cooperative multi-target tracking by dense communication among Active Vision Agents
Authors: Norimichi Ukita
Venue: Web Intelligence and Agent Systems (2007)

We have proposed a real-time multi-target tracking system by cooperative behaviors of Active Vision Agents (AVAs), where an AVA is a logical model of a network-connected computer with an active camera. All AVAs change their roles adaptively by negotiating with each other. The previous system, however, was unable to simultaneously track target objects that are larger in number than the AVAs. In this paper, we realize the increase in number of simultaneously trackable objects by improving cooperative tracking protocols in terms of the following two functions: (1) each AVA provides information of observed objects for several agencies (i.e., a group of AVAs that track the same target) and (2) each agency can receive information of its target also from AVAs tracking other objects. Experimental results demonstrate that our system can track multiple targets (larger in number than the cameras) simultaneously and robustly in real time.
Cluster-based Group Key Agreement for Wireless Ad hoc Networks
Authors: Elisavet Konstantinou
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The establishment of a group key in wireless ad hoc networks is considered a difficult task from both an algorithmic and computational point of view. The reason is the special nature and the constraints posed by these networks. In this paper, we present an efficient group key agreement protocol which is particularly suitable for energy constrained, dynamically evolving wireless ad hoc networks. The topology of the network is reflected in a structure composed by small clusters. This clustering allows the synchronous execution of efficient tripartite key agreement protocols based on pairings. The required computations are simple for the devices to implement, the size of the exchanged messages is minimum and the storage memory required in every node is very small. The proposed protocol also avoids the usage of a TTP or a central authority and achieves a good energy balance. Finally, we compare the communication/computation complexity of our protocol with previously known protocols and show that it compares favourably with them.
Topological routing to maximize routability for package substrate
Authors: Shenghua Liu, Guoqiang Chen, Tom Tong Jing, Lei He, Tianpei Zhang, Robi Dutta, Xian-Long Hong
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Compared with on-chip routers, the existing commercial tools for off-chip routing have a much lower routability and often result in a large number of unrouted nets for manual routing. In this paper, we develop an effective, yet efficient, substrate routing algorithm, applying dynamic pushing to alleviate the net ordering problem and reordering and rerouting for further wire length and congestion reduction. Compared with an industrial design tool that leaves 936 nets unrouted for nine industrial designs with a total of 6100 nets, our algorithm reduces the unrouted nets to 212, a 4.5-times net number reduction and practically more design time reduction.
On incorporating an on-line strip packing algorithm into elastic Grid reservation-based systems
Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar Buyya
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

In Grid systems, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. In this paper, we introduce an elastic reservation model, where users can query about a resource availability on a given time interval. They can also provide a reservation duration time and/or number of compute nodes needed as soft constraints to the query. Next, we provide an adapted version of an on-line strip packing algorithm, that takes into a consideration of resource utilization when processing reservation requests. We evaluate our algorithm with a real workload trace and show that the proposed algorithm manages a higher resource utilization and number of acceptance compared to an ad-hoc rigid approach.
Occurrence indices of elements in linear recurrence sequences over primary residue rings
Authors: D. N. Bylkov, O. V. Kamlovskii
Venue: Problems of Information Transmission (2008)

We study distances to the first occurrence (occurrence indices) of a given element in a linear recurrence sequence over a primary residue ring $$ \mathbb{Z}_{p^n } $$ . We give conditions on the characteristic polynomial F(x) of a linear recurrence sequence u which guarantee that all elements of the ring occur in u. For the case where F(x) is a reversible Galois polynomial over $$ \mathbb{Z}_{p^n } $$ , we give upper bounds for occurrence indices of elements in a linear recurrence sequence u. A situation where the characteristic polynomial F(x) of a linear recurrence sequence u is a trinomial of a special form over ¿4 is considered separately. In this case we give tight upper bounds for occurrence indices of elements of u.
Nonzero solutions for a class of set-valued variational inequalities in reflexive Banach spaces
Authors: Jianghua Fan, Wenhong Wei
Venue: Computers Mathematics with Applications (2008)

In this paper, we study the existence of nonzero solutions for a class of set-valued variational inequalities involving set-contractive mappings by using the fixed point index approach in reflexive Banach spaces. Some new existence theorems of nonzero solutions for this class of set-valued variational inequalities are established.
Quality Driven Web Service Selection and Ranking
Authors: Demian Antony D'Mello, V. S. Ananthanarayana
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The increasing number of Web service providers with numerous functionally similar or same Web services produced a new problem of choosing a suitable Web service for the requester based on his expectations. The Quality of Service (QoS) can be used to select and rank functionally similar Web services. In this paper we define four Web service provider qualities to distinguish functionally similar and qualitatively competitive Web services. The main objective of this paper is to explore the mechanism which breaks the tie that may arise among functionally similar and qualitatively equivalent (competitive) Web services during Web service selection and ranking.
An environment for supporting active learning in courses on language processing
Authors: José-Luis Sierra, Ana M. Fernández-Pampillon, Alfredo Fernández-Valmayor
Venue: ACM SIGCSE Bulletin (2008)

PAG (Prototyping with Attribute Grammars) is an environment that promotes active learning in courses on language processing (e.g. compiler construction and computational linguistics). In PAG, learners can specify the syntax and the semantics of their languages with attribute grammars. Then, the environment generates prototypes of processors for the languages specified which learners can test with different inputs. For each valid input the prototypes produce one or more decorated syntax trees, which learners can navigate using the semantic equations in the original grammar. In this paper we describe the environment and we report its educational uses.