ppxscal/embedding_network huggingface dataset:
VAMANA - A Scalable Cost-Driven XPath Engine
Authors: Venkatesh Raghavan, Kurt Deschler, Elke A. Rundensteiner
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Abstract¡ Several systems have recently been proposed for the evaluation of XPath expressions. However, none of these systems have demonstrated both scalability with large document sizes and robust support for the XPath language. Many of the scalability problems can be attributed to inadequate use of indexing during query evaluation. While poor support for the XPath language is often a consequence of an architecture overly optimized for certain queries. Finally, the proposed systems fail to adequately address costing with respect to query optimizations. We present VAMANA as a solution for a cost driven and scalable evaluation of ad-hoc XPath expressions. VAMANA's index-oriented query plans allow queries to be evaluated while reading only a fraction of the data. VAMANA's pipelined query framework minimizes the cost of intermediate query processing while providing cost-based transformations to further improve performance. Our experimental study con¦rms that VAMANA's cost-driven optimization approach for optimizing queries achieves a substantial performance improvement with negligible optimization overhead compared to non-optimized queries. Our study comparing VAMANA against several leading XML query engines demonstrates that VAMANA's query engine is signi¦cantly faster than these existing solutions in all considered cases.
A robust minimum variance beamformer with new constraint on uncertainty of steering vector
Authors: Zhu Liang Yu, Meng Hwa Er
Venue: Signal Processing (2006)

A robust minimum variance beamformer, also called robust Capon beamformer (RCB), with a new constraint on the uncertainty of nominal array steering vector (ASV) is proposed in this paper. Unlike the uncertainty constraints used in literature, the proposed constraint is constructed by replacing the nominal ASV with the projected one onto the signal-plus-interference subspace. With this compact uncertainty constraint, the proposed RCB achieves higher output signal-to-noise-plus-interference ratio (SINR) compared with the conventional RCBs. Theoretical analysis and simulation results show the effectiveness of the proposed RCB.
Towards the Interoperability between MPEG-21 REL and Creative Commons Licenses
Authors: Eva Rodriguez, Jaime Delgado
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

Digital Rights Management systems enable the distribution and use of multimedia content in a controlled way through the complete digital value chain. The terms and conditions of use, delivery and access to multimedia content are specified using a Rights Expression Language. A REL is a formal language designed to define the permissions and constraints of use of multimedia content. Creative Commons has defined different types of licenses to govern digital works when publishing them. Nevertheless, these licenses do not use a specific REL. A key issue is to express CC licenses using a REL. Then, DRM systems can control the use of the governed digital works. This paper presents two approaches to express CC licenses using the MPEG-21 REL.
A Model of Prefrontal Cortex Dopaminergic Modulation during the Delayed Alternation Task
Authors: Jean-Claude Dreher, Emmanuel Guigon, Yves Burnod
Venue: Journal of Cognitive Neuroscience (2002)

Working memory performance is modulated by the level of dopamine (DA) D1 receptors stimulation in the prefrontal cortex (PFC). This modulation is exerted at different time scales. Injection of D1 agonists/antagonists exerts a long-lasting influence (several minutes or hours) on PFC pyramidal neurons. In contrast, during performance of a cognitive task, the duration of the postsynaptic effect of phasic DA release is short lasting. The functional relationships of these two time scales of DA modulation remain poorly understood. Here we propose a model that combines these two time scales of DA modulation on a prefrontal neural network. The model links the cellular and behavioral levels during performance of the delayed alternation task. The network, which represents the activity of deep-layer pyramidal neurons with intrinsic neuronal properties, exhibits two stable states of activity that can be switched on and off by excitatory inputs from long-distance cortical areas arriving in superficial layers. These stable states allow PFC neurons to maintain representations during the delay period. The role of an increase of DA receptors stimulation is to restrict inputs arriving on the prefrontal network. The model explains how the level of working memory performance follows an inverted U-shape with an increased stimulation of DA D1 receptors. The model predicts that (1) D1 receptor agonists increase perseverations, (2) D1 antagonists increase distractability, and (3) the duration of the postsynaptic effect of phasic DA release in the PFC is adjusted to the delay period of the task. These results show how the precise duration of the postsynaptic effect of phasic DA release influences behavioral performance during a simple cognitive task.
Adaptive teaching strategies to improve individual student achievement in problem-based learning environments
Authors: Rebecca Dennin, Philip J. Smith
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

This study investigates the use of adaptive teaching strategies to promote learning in cooperative learning settings. The Biology Sleuth, a problem-based learning environment, was developed as a testbed to vary the distribution of critical resources and to examine the use of teaching strategies and their effects on group dynamics and individual learning. Students work in small groups, aided by various resources including a knowledge-base, each other, the software, and the teacher. This study examines the effects of applying two different teaching strategies and suggests that these strategies can have a large impact on both group dynamics and individual learning. A 35% improvement (p < .05) was measured in the treatment group. Based on this work we suggest that while many design features are chosen while developing training tools, designers also need to explicitly consider how these environments can be adapted during use to maximize the learning experience.
Defeasible Protocols in Persuasion Dialogues
Authors: Ioan Alfred Letia, Raluca Vartic
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Defeasible protocols lead to a more refined and accurate handling of persuasion dialogues, important in human - artificial agent communication, a step forward to effective practical argumentation support systems.
BTL2 and the expressive power of ECTL+
Authors: Alexander Rabinovich, Philippe Schnoebelen
Venue: Information and Computation (2006)

We show that ECTL+, the classical extension of CTL with fairness properties, is expressively equivalent to BTL2, a natural fragment of the monadic logic of order. BTL2 is the branching-time logic with arbitrary quantification over paths, and where path formulac are restricted to quantifier depth 2 first-order formulae in the monadic logic of order. This result, linking ECTL+ to a natural fragment of the monadic logic of order, provides a characterization that other branching-time logics, e.g., CTL, lack. We then go on to show that ECTL+ and BTL2 are not finitely based (i.e., they cannot be defined by a finite set of temporal modalities) and that their model-checking problems are of the same complexity.
Approximating Data in $$\mathfrak{R}^{n}$$ by a Quadratic Underestimator with Specified Hessian Minimum and Maximum Eigenvalues
Authors: J. B. Rosen, John Glick
Venue: Journal of Global Optimization (2006)

The problem of approximating m data points (x i , y i ) in $$\mathfrak{R}^{n+1}$$ , with a quadratic function q(x, p) with s parameters, m ¿ s, is considered. The parameter vector $$p\in \mathfrak{R}^s$$ is to be determined so as to satisfy three conditions: (1) q(x, p) must underestimate all m data points, i.e. q(x i , p) ¿ y i , i=1,...,m. (2) The error of the approximation is to be minimized in the L1 norm. (3) The eigenvalues of H are to satisfy specified lower and upper bounds, where H is the Hessian of q(x, p) with respect to x. This is called the Quadratic Underestimator with Bounds on Eigenvalues (QUBE) problem. An algorithm for its solution (QUBE algorithm) is given and justified, and computational results presented. The QUBE algorithm has application to finding the global minimum of a basin (or funnel) shaped function with a large number of local minima. Such problems arise in computational biology where it is desired to find the global minimum of an energy surface, in order to predict native protein-ligand docking geometry (drug design) or protein structure. Computational results for a simulated docking energy surface, with n=15, are presented. It is shown that specifying a small condition number for H improves the ability of the underestimator to correctly predict the global minimum point.
Empirical Studies on Multi-label Classification
Authors: Tao Li, Chengliang Zhang, Shenghuo Zhu
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In classic pattern recognition problems, classes are mutually exclusive by definition. However, in many applications, it is quite natural that some instances belong to multiple classes at the same time. In other words, these applications are multi-labeled, classes are overlapped by definition and each instance may be associated to multiple classes. In this paper, we present a comparative study on various multi-label approaches using both gene and scene data sets. We expect our research efforts provide useful insights on the relationships among various classifiers as well as various evaluation measures and shed lights on future research. Although there is no clear winner across various performance measures, SVM Binary and Multi-label ADTree perform better than the others on most counts. We then propose a meta-learning approach by combining SVM binary and ADTree. Our experiments demonstrate that the combined method can take the advantages of the single approaches.
Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography
Authors: Sandeep Kumar, Thomas Wollinger, Christof Paar
Venue: IEEE Transactions on Computers (2006)

Digit Serial Multipliers are used extensively in hardware implementations of elliptic and hyperelliptic curve cryptography. This contribution shows different architectural enhancements in Least Significant Digit (LSD) multiplier for binary fields GF(2^m). We propose two different architectures, the Double Accumulator Multiplier (DAM) and N-Accumulator Multiplier (NAM), which are both faster compared to traditional LSD multipliers. Our evaluation of the multipliers for different digit sizes gives optimum choices and shows that currently used digit sizes are the worst possible choices. Hence, one of the most important results of this contribution is that digit sizes of the form 2^l-1, where l is an integer, are preferable for the digit multipliers. Furthermore, one should always use the NAM architecture to get the best timings. Considering the time area product DAM or NAM gives the best performance depending on the digit size.
A Statewide Telemedicine Network for Public Health in Brazil
Authors: Rafael Simon Maia, Aldo von Wangenheim, Luiz Felipe Nobre
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The use of modern telecommunications technologies like telemedicine and the internet it's essential to decrease the centralization of the Brazilian's public healthcare service, and to improve the access to specialty care in small-tows and rural localities. In this paper, we describe the development and implementation of a public statewide telemedicine network in the Brazilian's State of Santa Catarina.
Reading the Windows to the Soul: Evidence of Domain-Specific Sparing in Williams Syndrome
Authors: Helen Tager-Flusberg, Jenea Boshart, Simon Baron-cohen
Venue: Journal of Cognitive Neuroscience (1998)

This study tested the hypothesis that Williams syndrome, a rare genetic neurodevelopmental disorder with an unusual cognitive phenotype, involves spared abilities in the domain of understanding other minds. A group of retarded adults with Williams syndrome was compared to an age-,IQ-,and languagematched group of adults with Prader-Willi syndrome, another genetic disorder without the cognitive characteristics of Williams syndrome, and a group of age-matched normal adults, on a task that taps mentalizing ability. The task involved selecting the correct labels to match photographs of complex mental state expressions in the eye region of the face. The adults with Williams syndrome performed significantly better than the adults with Prader-Willi on this task, and about half the group performed in the same range as the normal adults. These findings are consistent with anecdotal evidence about Williams syndrome and provide evidence that mentalizing is a distinct cognitive domain.This spared cognitive capacity may be linked to the relative sparing of limbic-cerebellar neural substrate in Williams syndrome, which is also connected to cortico-frontal regions that are known to be involved in understanding complex mental states.
Bicoherence Used to Predict Lucky Regions in Turbulence Affected Surveillance
Authors: Z. Wen, D. Fraser, A. Lambert
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Long-distance surveillance is an emerging technology which attracts more and more attention from researchers in different areas, particularly for security applications. One of the major challenges of such technology is how to remove the effect due to atmospheric turbulence to get highresolution images. A common practice is to take shortexposure images of the target so that the effect of atmospheric turbulence is frozen, and then the raw images are post-processed to estimate a good quality image (speckle imaging techniques). A new lucky region approach based on such techniques is presented in this paper. The lucky regions are extracted through bicoherence analysis, and the final output image is obtained by post-processing (dewarping and blind deconvolving) the lucky regions. The new technique allows for automatic identification and extraction of lucky regions, and can be easily implemented. Realworld results show that the algorithm is promising.
Reducing Scan Test Data Volume and Time: A Diagnosis Friendly Finite Memory Compactor
Authors: Sverre Wichlund, Einar J. Aas
Venue: Proceedings of the 15th Asian Test Symposium (2006)

As the latest process technologies are combined with steadily increasing design sizes, the result is a dramatic increase in the number of scan test vectors that must be applied during manufacturing test. This in turn may result in costly tester reloads and unacceptable test application times. In this paper we present a finite memory test response compactor (a class of compactors originally proposed in [1]) which is diagnosis friendly. The latter is important to maintain throughput on the test floor [2,3]. Yet, the compactor has comparable performance to other schemes [1,4,5] when it comes to 'X' tolerance and aliasing.
A Platform for Collaborative Engineering
Authors: Giacomo Fecondo, Antonio Santagata, Franca Perrina, Eugenio Zimeo
Venue: IT Professional (2006)

As companies outsource more project activities, they need more control over the supply chain. With this platform, project managers can easily schedule, control, and monitor activitiestightly integrating a variety of services.
A Systematic Approach for Application Migration in a Grid Computing Environment
Authors: Anirban Chakrabarti, Shubhashis Sengupta, Adarsh Upadhyay, Anish Damodaran
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Enterprises are looking at Grid computing as a technology of enormous potential. One such issue is the issue of Grid application migration, where legacy applications are migrated to the Grid environment. The Grid Application Migration Framework (GAMF), is an attempt to provide a systematic approach for handling the migration process. The framework consists of three independently deployable components: Grid Code Analyzer (GCA), Grid Task Generator (GTG), and Grid Simulator (GS). The GCA component analyzes the different applications and generates a Directed Acyclic Graph (DAG) based on the information obtained from analysis. The DAG is based on both static and runtime information available from application profiling. The DAG information is then analyzed and Grid tasks are generated based on different DAG reducing and clustering algorithms. The simulator takes the generated DAG as input and provides and analyzes the application performance with respect to Grid infrastructure and policies.
Integrating bioinformatic data sources over the SFSU ER design tools XML databus
Authors: Yan Liu, Sorna Vincent, Marguerite C. Murphy
Venue: Workshop proceedings of the sixth international conference on Web engineering (2006)

The SFSU ER Design Tools were developed to support database design and data integration over multiple implementation data models. These tools allow users to enter and view Entity Relationship (ER) schemas and to translate ER schemas into a variety of equivalent implementation schemas, including Relational (ANSI SQL2), Object Oriented (ODMG 3.0), Spreadsheet (Universal Relation with associated functional dependencies) and W3C XML DTD. In addition, for each implementation data model, the Tools generate DDL statements to create a database, as well as simple JDBC/ODBC based code to dump stored data into an XML file and to load data from an XML file into a database. Data can be transferred from one data store to another over an HTTP based XML Databus. In this paper we describe the design and implementation of our XML Databus using Web Services, as well as a new strategy to support integration of bioinformatics data sets. We first manually identify semantically equivalent attributes in both schemas, then automatically join the corresponding data sets into a single integrated collection of XML formatted data. Our software is operational, and preliminary performance measurements over DTD and data downloaded from the NIH-NCBI Web site show that our strategy is feasible for moderately sized data sets.
Algorithms and monte carlo methods in computational biology
Authors: Stephen M. Krone
Venue:  (2006)

We study three different aspects of computational biology: interacting particle systems, phylogenetic distance methods, and Markov Chain Monte Carlo. Our study of interacting particle systems has two components: First, a Windows-based simulator has been developed. It serves as a platform for many spatial biology studies; for example, plasmid transfer in biofilms. Second, a specific ecological model of multi-species cross-feeding has been studied using the simulator, where we have observed spatial self-organization and pattern formation (particularly, spiral waves). A mathematical derivation, which is based on analysis of partial differential equations, explains the phase-transitions observed in simulations. Distance methods have been widely used to infer phylogenies (evolution trees among different species) because they are fast and reasonably accurate. In this study, we have proved that a popular distance method named neighbor-joining is in fact a special case of least squares methods. The proof relates neighbor-joining to least squares statistics. Hence it provides an explanation for the robustness and accuracy of neighbor-joining. In an empirical study of MCMC, we investigate, through extensive simulations., how a mixture of local and heavy-tailed proposals (a.k.a. "small world proposals") can dramatically increase the convergence rates of Markov chains that admit stationary measures that are multi-modal. In the theoretical part of the study, we have proved, using techniques of state decomposition and isoperimetric inequalities for log-concave distributions, that the ''small world proposals" turn a "slowly mixing" chain into a "rapidly mixing" chain.
On a traitor tracing scheme from ACISP 2003
Authors: Dongvu Tonien
Venue: Information Processing Letters (2006)

At ACISP 2003 conference, Narayanan, Rangan and Kim proposed a secret-key traitor tracing scheme used for pay TV system. In this note, we point out a flaw in their scheme.
Cohesion in virtual teams: validating the perceived cohesion scale in a distributed setting
Authors: Wm. David Salisbury, Traci A. Carte, Laku Chidambaram
Venue: ACM SIGMIS Database (2006)

With the advent of new technology-enabled organizational forms, firms are increasingly relying on virtual teams to accomplish organizational objectives. For those studying these environments, sound measurement of work team phenomena, such as group cohesion, is the key to understanding the impact of these new technologies on team processes and performance. Bollen and Hoyle (1990) created a six-item Perceived Cohesion Scale (PCS) to measure cohesion in groups and employed a study of large groups to assess the psychometric qualities of their scale. Chin et al. (1999) validated the PCS measure using a study of small groups that were collocated. The present effort extends the Chin et al. (1999) adaptation of Bollen and Hoyle's PCS scale to virtual teams and attempts to validate it in this setting. Our findings indicate support for the validity, reliability and factorial stability of the measure in this virtual team context.
On the Use of Nodes with Controllable Mobility for Conserving Power in MANETs
Authors: Eashwar R. Chittimalla, Aravindhan Venkateswaran, Venkatesh Sarangan, Raj Acharya
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

We explore the idea of using relay nodes with controllable mobility as intermediate hops for reducing the power consumption in a mobile ad hoc network (MANET). We formulate the relay positioning problem and propose four variations of a simple algorithm to compute the optimal position and the movement of the relay nodes. Results from a preliminary simulation study indicate that deployment of relay nodes does result in considerable power savings in MANETs.