ppxscal/embedding_network huggingface dataset:
Comparative Performance Analysis of Three Sub-Optimal Projection Techniques for Multidimensional Signal Detection
Authors: Askar Hamdulla, Bao-zhu Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

The paper derive the projection method which a set of samples is represented by a single sample, it maximizes the probability of signal detection for a fixed probability of false alarm and solve the cumbersome of multidimensional signal detection, The focus of the paper is performance analysis of three sub-optimal projection techniques (maximum value projection, summation projection and the probabilistic weighted summation projection) for multidimensional signal detection, there are pros and cons respectively by running Monte-Carlo simulations and analysis the losses of projection algorithms, The paper obtains the theory and the simulation results which are useful to realize optimize multidimensional signal detection.
Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony
Authors: Taoyang Wu, Vincent Moulton, Mike Steel
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

Given a set X of taxa, a phylogenetic X-tree T that is only partially resolved, and a collection of characters on X, we consider the problem of finding a resolution (refinement) of T that minimizes the parsimony score of the given characters. Previous work has shown that this problem has a polynomial time solution provided certain strong constraints are imposed on the input. In this paper we provide a new algorithm for this problem, and show that it is fixed parameter tractable under more general conditions.
Methodological Review: Empirical distributional semantics: Methods and biomedical applications
Authors: Trevor Cohen, Dominic Widdows
Venue: Journal of Biomedical Informatics (2009)

Over the past 15 years, a range of methods have been developed that are able to learn human-like estimates of the semantic relatedness between terms from the way in which these terms are distributed in a corpus of unannotated natural language text. These methods have also been evaluated in a number of applications in the cognitive science, computational linguistics and the information retrieval literatures. In this paper, we review the available methodologies for derivation of semantic relatedness from free text, as well as their evaluation in a variety of biomedical and other applications. Recent methodological developments, and their applicability to several existing applications are also discussed.
Characterization of the similarity between diffusion tensors for image registration
Authors: Emma Muñoz-Moreno, Marcos Martin-Fernandez
Venue: Computers in Biology and Medicine (2009)

Registration algorithms are usually based on measures that must be optimized, whose choice has a great influence in the final result. For diffusion tensor imaging, scalar measures cannot be directly applied, and therefore new cost functions must be defined, regarding the special features of these data. We present a new pointwise similarity measure, named diffusion type based (DTB), that considers the physical meaning of the diffusion tensor. Theoretically, it is proved that DTB corrects the drawbacks of previous analogous measures, as well as it provides a more realistic result than generic measures. These conclusions are corroborated by experiments, where registration algorithms are driven by DTB and other broadly used measures. It is shown both quantitatively and visually that DTB leads to better results, and is more robust in presence of noise.
Supporting group decisions by mediating deliberation to improve information pooling
Authors: Joshua E. Introne
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Group decision support systems (GDSS) hold significant potential for improving decision making, but they have not been broadly adopted. One reason for this is that these platforms introduce representational work for users that is distinct from a more familiar deliberative interaction but they offer uncertain payoff. This article presents a study with a platform that addresses this problem by leveraging the argumentative structure of deliberative conversation to drive a decision support algorithm. The platform uses argument visualization to mediate the collaborators' conversation. The study demonstrates that the platform addresses a known deficiency in human information pooling called the common knowledge phenomenon.
Transition behaviors from coupled-to-uncoupled CdTe-ZnTe symmetric versus asymmetric double quantum wells
Authors: Nacir Tit, Ihab M. Obaidat
Venue: Microelectronics Journal (2009)

The coupling behaviors between symmetric versus asymmetric CdTe-ZnTe double quantum wells (DQWs) are theoretically investigated based on the application of the sp3s* tight-binding method including the spin-orbit interaction. This method is used to calculate the band structures of the (CdTe)Nw1(ZnTe)NbM(CdTe) Nw2-ZnTe DQWs versus the barrier thickness (Nb), and well widths (Nw1 and Nw2). Special attention was given to the decoupling behaviors between the wells in both symmetric and asymmetric cases. The decoupling of the asymmetric DQWs is found to occur at a critical barrier thickness (of about ) shorter than the case of symmetric DQWs (of about ) because, in the former case, the bound state wavefunctions have more tendency to localize in one of the two wells. Our modelling of asymmetric DQWs (with Nw1=6 and Nw2=3) yields results in excellent agreement with the available experimental photoluminescence data.
Uncertainty-aware Wireless Sensor Networks
Authors: Sanchita Mal-Sarkar, Iftikhar U. Sikder, Chansu Yu, Vijay K. Konangi
Venue: International Journal of Mobile Communications (2009)

The characterisation of uncertainty and the management of Quality of Service are important issues in mobile communications. In a Wireless Sensor Network, there is a high probability of redundancy, correlation and noise in the sensor features since data is often collected from a large array of densely deployed neighbouring sensors. This article proposes a soft computing approach to manage uncertainty by reasoning over inconsistent, incomplete, and fragmentary information using classical rough set and dominance-based rough set theories. A methodological and computational basis is provided and is illustrated in a real world sensor network application of aquatic biodiversity mapping under uncertainty.
Zero anaphora resolution by case-based reasoning and pattern conceptualization
Authors: Dian-Song Wu, Tyne Liang
Venue: Expert Systems with Applications: An International Journal (2009)

Effective anaphora resolution is helpful to many applications of natural language processing such as machine translation, summarization and question answering. In this paper, a novel resolution approach is proposed to tackle zero anaphora, which is the most frequent type of anaphora shown in Chinese texts. Unlike most of the previous approaches relying on hand-coded rules, our resolution is mainly constructed by employing case-based reasoning and pattern conceptualization. Moreover, the resolution is incorporated with the mechanisms to identify cataphora and non-antecedent instances so as to enhance the resolution performance. Compared to a general rule-based approach, the proposed approach indeed improves the resolution performance by achieves 78% recall and 79% precision on solving 1051 zero anaphora instances in 382 narrative texts.
Supervised locally linear embedding with probability-based distance for classification
Authors: Lingxiao Zhao, Zhenyue Zhang
Venue: Computers Mathematics with Applications (2009)

We present a novel dimension reduction method for classification based on probability-based distance and the technique of locally linear embedding (LLE). Logistic Discrimination (LD) is adopted for estimating the probability distribution as well as for classification on the reduced data. Different from the supervised locally linear embedding (SLLE) that is only used for the dimension reduction of training data, our probability-based locally linear embedding (PLLE) can be applied on both training and testing data. Five microarray data sets in high-dimensional spaces, the IRIS data, and a real set of handwritten digits are experimented. The numerical results show the proposed methodology performs better, compared with the LD classifiers applied on the lower-dimensional embedding coordinates computed by LLE or SLLE.
Is Wikipedia growing a longer tail?
Authors: Shyong (Tony) K. Lam, John Riedl
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Wikipedia has millions of articles, many of which receive little attention. One group of Wikipedians believes these obscure entries should be removed because they are uninteresting and neglected; these are the deletionists. Other Wikipedians disagree, arguing that this long tail of articles is precisely Wikipedia's advantage over other encyclopedias; these are the inclusionists. This paper looks at two overarching questions on the debate between deletionists and inclusionists: (1) What are the implications to the long tail of the evolving standards for article birth and death? (2) How is viewership affected by the decreasing notability of articles in the long tail? The answers to five detailed research questions that are inspired by these overarching questions should help better frame this debate and provide insight into how Wikipedia is evolving.
MySpace, MyKids: A Parent's Guide to Protecting Your Kids and Navigating MySpace.com
Authors: Jason Illian
Venue:  (2007)

Boasting more that 75 million users, the MySpace online community is the second most visited site on the Internet. It has become a haven for teens and young adults, a virtual hangout where friends (and strangers) share thoughts, pictures, music, video, and more. Parents naturally wonder... Should they be concerned? What can they do to protect their kids? Are there valuable uses for MySpace? Jason Illian demonstrates that with careful use and close monitoring, MySpace can help kids facilitate relationships and help parents understand and interact with their childrens world like never before. In addition to teaching adults how to log on to MySpace and set up an account, this valuable guide explains how parents can talk with their kids about their MySpace communications, join groups, forums, and bulletin boards to keep informed, and use filters, alerts, and other technologies to track their kids online activities.
Measurement of Pressure Distribution from PIV Experiments
Authors: S. Y. Jaw, J. H. Chen, P. C. Wu
Venue: Journal of Visualization (2009)

In this study, a non-staggered grid SIMPLER pressure solution algorithm, which is able to produce correct pressure distribution directly if correct velocities are given, is proposed to solve the pressure distribution for PIV experiments. The cell face pseudo velocity required in the pressure equation is approximated by a simple linear average of the adjacent nodal pseudo velocities so that the velocity and pressure are collocated without causing the checkerboard pressure distribution problem. In addition, the proposed pressure solution algorithm has the features that upwind effects of the convective terms are considered, boundary conditions are not required, and the pressure distribution obtained can be used to correct the velocity field so that the continuity equation is satisfied. These features make the present algorithm a superior method to calculate the pressure distribution for PIV experiments. The pressure field solved is realistic and accurate. The proposed pressure equation solver is first calibrated with a two-dimensional cavity flow. It is found that the results are almost identical to the exact solution of the test flow. The algorithm is then applied to analyze a uniform flow past two side-by-side circular cylinders in a soap film channel. With the velocity and pressure distributions successfully measured, the structures of the complex shedding flow patterns are clearly manifested.
A Novel Approach to Swarm Bot Architecture
Authors: Vinay Kumar Pilania, Shaunak Mishra, Subrat Panda, Aurosish Mishra
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Emergent behavior in social insects has inspired a new class of robots called swarm robots. However, computational and economic constraints regarding inter-robot communication still persist. This paper introduces a low cost architecture facilitating co-operative searching and transport through a master-slave swarm robot concept. Especially, we focus on the directional movement of the slave robots depending on the position of the master robot without using a camera. Experimental results show that the architecture is an economic solution for macro level inter-robot communication involving positional data on an even terrain.
Heuristic procedures and mathematical models for cell loading and scheduling in a shoe manufacturing company
Authors: Gürsel A. Süer, Ananthanarayanan Subramanian, Jing Huang
Venue: Computers and Industrial Engineering (2009)

This paper focuses on cell loading and scheduling issues in a shoe manufacturing company. It involves a three-phase solution methodology where first number of cells is determined, then cells are loaded and finally detailed scheduling is performed. Three different family definitions are used (subfamilies, families and superfamilies) during the cell loading process. Three cell loading heuristic procedures (H1, H2, and H3), a simple cell scheduling heuristic and two-level mathematical models are proposed and then compared with respect to makespan. An important observation is that better post-loading schedules did not lead to better post-scheduling results. As a result, the best schedule can only be known after both cell loading and cell scheduling functions are performed. The results showed that H1 led to the best post-scheduling makespan values and they were on the average within 3% of the optimal solution. The execution time for H1 was less than four seconds for the problems tested in the experimentation and this can be considered negligible for a manufacturing setting.
EXCEL 2007 CHARTS MADE EASY, 1 edition
Authors: Kathy Jacobs, Curt Frye, Doug Frye
Venue:  (2008)

Get beyond the basics with Excel 2007 chartsNow you can take your Excel charting skills to the next level with help from this hands-on guide. Excel 2007 Charts Made Easy shows you how to upgrade from simple pie and bar charts to rich data visualization using the full range of charts available in the latest version of the software. Discover how easy it is to create custom charts with compelling effects and to display data in more meaningful ways. Manually format chart componentsShow trends in your data with line chartsCombine line and pie charts to create area chartsPlot data using scatter charts and bubble chartsCreate and format stock chartsConnect three data points with a surface chartDisplay the relationship between various data series using doughnut chartsCompare data values with radar chartsUse PivotTables and PivotCharts to work with dynamic dataIncorporate Excel charts into Word documents and PowerPoint presentations Table of contentsAcknowledgmentsIntroductionChapter 1: Creating and Formatting a Basic Column ChartChapter 2: Creating and Formatting a Basic Bar ChartChapter 3: Creating and Formatting a Basic Line ChartChapter 4: Creating and Formatting a Basic Pie ChartChapter 5: Creating and Formatting a Basic Area ChartChapter 6: Creating and Formatting a Scatter ChartChapter 7: Creating and Formatting a Stock ChartChapter 8: Creating and Formatting a Surface ChartChapter 9: Creating and Formatting a Doughnut ChartChapter 10: Creating and Formatting a Bubble ChartChapter 11: Creating and Formatting a Radar ChartChapter 12: Creating a PivotChartChapter 13: Creating Charts for Use in Word and PowerPointChapter 14: Printing ChartsIndex
A comparison of generalized hybrid Monte Carlo methods with and without momentum flip
Authors: Elena Akhmatskaya, Nawaf Bou-Rabee, Sebastian Reich
Venue: Journal of Computational Physics (2009)

The generalized hybrid Monte Carlo (GHMC) method combines Metropolis corrected constant energy simulations with a partial random refreshment step in the particle momenta. The standard detailed balance condition requires that momenta are negated upon rejection of a molecular dynamics proposal step. The implication is a trajectory reversal upon rejection, which is undesirable when interpreting GHMC as thermostated molecular dynamics. We show that a modified detailed balance condition can be used to implement GHMC without momentum flips. The same modification can be applied to the generalized shadow hybrid Monte Carlo (GSHMC) method. Numerical results indicate that GHMC/GSHMC implementations with momentum flip display a favorable behavior in terms of sampling efficiency, i.e., the traditional GHMC/GSHMC implementations with momentum flip got the advantage of a higher acceptance rate and faster decorrelation of Monte Carlo samples. The difference is more pronounced for GHMC. We also numerically investigate the behavior of the GHMC method as a Langevin-type thermostat. We find that the GHMC method without momentum flip interferes less with the underlying stochastic molecular dynamics in terms of autocorrelation functions and it to be preferred over the GHMC method with momentum flip. The same finding applies to GSHMC.
Automatic verification of database-driven systems: a new frontier
Authors: Victor Vianu
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantees of success, it identifies restricted but reasonably expressive classes of applications and properties for which sound and complete verification can be performed in a fully automatic way. This leverages the emergence of high-level specification tools for database-centered applications that not only allow fast prototyping and improved programmer productivity but, as a side effect, provide convenient targets for automatic verification. We present theoretical and practical results on verification of database-driven systems. The results are quite encouraging and suggest that, unlike arbitrary software systems, significant classes of database-driven systems may be amenable to automatic verification. This relies on a novel marriage of database and model checking techniques, of relevance to both the database and the computer aided verification communities.
Modelling patient arrivals when simulating an accident and emergency unit
Authors: Le Yin Meng, Trevor Spedding
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents a case study of a discrete event simulation model of an Accident and Emergency Unit in a hospital in the UK. The objective of the study is to create a simulation study of the A&E Unit, to evaluate alternative scenarios and hence reducing patient waiting time. The case study uses a novel approach to predict the arrival time of patients and hence results in a more realistic platform on which to base the subsequent scenario analysis. The scenario analysis illustrates that significant reductions in the waiting time of patients can be obtained by relatively minor changes in operations.
How to interpret PubMed queries and why it matters
Authors: Lana Yeganova, Donald C. Comeau, Won Kim, W. John Wilbur
Venue: Journal of the American Society for Information Science and Technology (2009)

A significant fraction of queries in PubMed&trade; are multiterm queries without parsing instructions. Generally, search engines interpret such queries as collections of terms, and handle them as a Boolean conjunction of these terms. However, analysis of queries in PubMed&trade; indicates that many such queries are meaningful phrases, rather than simple collections of terms. In this study, we examine whether or not it makes a difference, in terms of retrieval quality, if such queries are interpreted as a phrase or as a conjunction of query terms. And, if it does, what is the optimal way of searching with such queries. To address the question, we developed an automated retrieval evaluation method, based on machine learning techniques, that enables us to evaluate and compare various retrieval outcomes. We show that the class of records that contain all the search terms, but not the phrase, qualitatively differs from the class of records containing the phrase. We also show that the difference is systematic, depending on the proximity of query terms to each other within the record. Based on these results, one can establish the best retrieval order for the records. Our findings are consistent with studies in proximity searching. &copy; 2009 Wiley Periodicals, Inc.
A Berry-Esseen type bound in kernel density estimation for strong mixing censored samples
Authors: Han-Ying Liang, Jacobo de Uña-Álvarez
Venue: Journal of Multivariate Analysis (2009)

In this paper, we discuss the estimation of a density function based on censored data by the kernel smoothing method when the survival and the censoring times form a stationary @a-mixing sequence. A Berry-Esseen type bound is derived for the kernel density estimator at a fixed point x. For practical purposes, a randomly weighted estimator of the density function is also constructed and investigated.
Metric topology on the L-fuzzy real line
Authors: Jian-zhong Xiao, Xing-hua Zhu
Venue: Fuzzy Sets and Systems (2009)

In this paper, four gauge functionals on L-fuzzy real line R(L) are introduced and a pointwise pseudo-metric function on R(L) is given by means of them. It is pointed out that this metric function is identical with the Erceg metric function, and the metric topology is identical with the usual topology. Some relations between the families of neighborhood balls and remote-neighborhood balls are revealed.
Dragon kill points: loot distribution in MMORPGs
Authors: Ernst Gunnar Gran, Sven-Arne Reinemo
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

One of the major reasons for playing Massive Multiplayer Online Role Playing Games (MMORPGs) is the possibility to show off your abilities to other players. The more rare your equipment is, the higher is the show off value of your character. And because rare items are hard to find cooperation between several players is often required. This introduces a conflict between the players, and a way to distribute loot is necessary. We introduce the problem of loot distribution in MMORPG, and we suggest and give a preliminary evaluation of a new and improved Dragon Kill Points system.
Correct-by-construction microarchitectural pipelining
Authors: Timothy Kam, Michael Kishinevsky, Jordi Cortadella, Marc Galceran-Oms
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper presents a method for correct-by-construction microarchitectural pipelining that handles cyclic systems with dependencies between iterations. Our method combines previously known bypass and retiming transformations with a few transformations valid only for elastic systems with early evaluation (namely, empty FIFO insertion, FIFO capacity sizing, insertion of anti-tokens, and introducing early evaluation multiplexors). By converting the design to a synchronous elastic form and then applying this extended set of transformations, one can pipeline a functional specification with an automatically generated distributed controller that implements stalling logic resolving data hazards off the critical path of the design. We have developed an interactive toolkit for exploring elastic microarchitectural transformations. The method is illustrated by pipelining a few simple examples of instruction set architecture ISA specifications.