ppxscal/embedding_network huggingface dataset:
Designing high-performance and scalable clustered network attached storage with infiniband
Authors: Dhabaleswar K. Panda
Venue:  (2008)

The Internet age has exponentially increased the volume of digital media that is being shared and distributed. Broadband Internet has made technologies such as high quality streaming video on demand possible. Large scale supercomputers also consume and create huge quantities of data. This media and data must be stored, cataloged and retrieved with high-performance. Researching high-performance storage subsystems to meet the I/O demands of applications in modern scenarios is crucial. Advances in microprocessor technology have given rise to relatively cheap off-the-shelf hardware that may be put together as personal computers as well as servers. The servers may be connected together by networking technology to create farms or clusters of workstations (COW). The evolution of COWs has significantly reduced the cost of ownership of high-performance clusters and has allowed users to build fairly large scale machines based on commodity server hardware. As COWs have evolved, networking technologies like InfiniBand and 10 Gigabit Ethernet have also evolved. These networking technologies not only give lower end-to-end latencies, but also allow for better messaging throughput between the nodes. This allows us to connect the clusters with high-performance interconnects at a relatively lower cost. With the deployment of low-cost, high-performance hardware and networking technology, it is increasingly becoming important to design a storage system that can be shared across all the nodes in the cluster. Traditionally, the different components of the file system have been stringed together using the network to connect them. The protocol generally used over the network is TCP/IP. The TCP/IP protocol stack in general has been shown to have poor performance especially for high-performance networks like 10 Gigabit Ethernet or InfiniBand. This is largely due to the fragmentation and reassembly cost of TCP/IP. The cost of multiple copies also serves to severely degrade the performance of the stack. Also, TCP/IP has been been shown to reduce the capacity of network attached storage systems because of problems like incast. In this dissertation, we research the problem of designing high-performance communication subsystems for network attached storage (NAS) systems. Specifically, we delve into the issues and potential solutions with designing communication protocols for high-end single-server and clustered server NAS systems. Orthogonally, we also investigate how a caching architecture may potentially enhance the performance of a NAS system. Finally, we look at the potential performance implications of using some of these designs in two scenarios; over a long haul network and when used as a basis for checkpointing parallel applications.
Enforcing transitivity in coreference resolution
Authors: Jenny Rose Finkel, Christopher D. Manning
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being coreferent with each of two other mentions, it will also consider the likelihood of those two mentions being coreferent when making a final assignment. This is exactly the kind of constraint that integer linear programming (ILP) is ideal for, but, surprisingly, previous work applying ILP to coreference resolution has not encoded this type of constraint. We train a coreference classifier over pairs of mentions, and show how to encode this type of constraint on top of the probabilities output from our pairwise classifier to extract the most probable legal entity assignments. We present results on two commonly used datasets which show that enforcement of transitive closure consistently improves performance, including improvements of up to 3.6% using the b3 scorer, and up to 16.5% using cluster f-measure.
A BDD Approach to the Feature Subscription Problem
Authors: T. Hadzic, D. Lesaint, D. Mehta, B. O'Sullivan, L. Quesada, N. Wilson
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important since it enhances the users' experience considerably. However, regardless how service providers organise their catalogues of features, they cannot achieve complete configurability due to the existence of feature interactions. Distributed Feature Composition (DFC) provides a comprehensive methodology, underpinned by a formal architecture model to address this issue. In this paper we present an approach based on using Binary Decision Diagrams (BDD) to find optimal reconfigurations of features when a user's preferences violate the technical constraints defined by a set of DFC rules. In particular, we propose hybridizing constraint programming and standard BDD compilation techniques in order to scale the construction of a BDD for larger size catalogues. Our approach outperforms the standard BDD techniques by reducing the memory requirements by as much as five orders-of-magnitude and compiles the catalogues for which the standard techniques ran out of memory.
An efficient algorithm for building a distributional thesaurus (and other Sketch Engine developments)
Authors: Pavel Rychlý, Adam Kilgarriff
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

Gorman and Curran (2006) argue that thesaurus generation for billion+-word corpora is problematic as the full computation takes many days. We present an algorithm with which the computation takes under two hours. We have created, and made publicly available, thesauruses based on large corpora for (at time of writing) seven major world languages. The development is implemented in the Sketch Engine (Kilgarriff et al., 2004). Another innovative development in the same tool is the presentation of the grammatical behaviour of a word against the background of how all other words of the same word class behave. Thus, the English noun constraint occurs 75% in the plural. Is this a salient lexical fact? To form a judgement, we need to know the distribution for all nouns. We use histograms to present the distribution in a way that is easy to grasp.
Dynamic Software Updates for Accelerating Scientific Discovery
Authors: Dong Kwan Kim, Myoungkyu Song, Eli Tilevich, Calvin J. Ribbens, Shawn A. Bohner
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Distributed parallel applications often run for hours or even days before arriving to a result. In the case of such long-running programs, the initial requirements could change after the program has started executing. To shorten the time it takes to arrive to a result when running a distributed computationally-intensive application, this paper proposes leveraging the power and flexibility of dynamic software updates. In particular, to enable flexible dynamic software updates, we introduce a novel binary rewriting approach that is more efficient than the existing techniques. While ensuring greater flexibility in enhancing a running program for new requirements, our binary rewriting technique incurs only negligible performance overhead. We validate our approach via a case study of dynamically changing a parallel scientific simulation.
What Do We Know about Knowledge Management? Practical Implications for Software Engineering
Authors: Torgeir Dingsøyr, Finn Olav Bjørnson, Forrest Shull
Venue: IEEE Software (2009)

Knowledge management is an overarching idea with a large potential impact on knowledge-intensive work such as software engineering. What do we know about these approaches and how they work in practice? What are the main findings from research on knowledge management in software engineering, and what are these findings' practical implications? This article summarizes a systematic review of research on knowledge management in software engineering, characterizing the research findings and practical implications according to knowledge management school.
Semantic representation of context models: a framework for analyzing and understanding
Authors: Salma Najar, Oumaima Saidani, Manuele Kirsch-Pinheiro, Carine Souveyet, Selmin Nurcan
Venue: Proceedings of the 1st Workshop on Context, Information and Ontologies (2009)

Context-aware systems are applications that adapt themselves to several situations involving user, network, data, hardware and the application itself. In this paper, we review several context models proposed in different domains: content adaptation, service adaptation, information retrieval, etc. The purpose of this review is to expose the representation of this notion semantically. According to this, we propose a framework that analyzes and compares different context models. Such a framework intends helping understanding and analyzing of such models, and consequently the definition of new ones. This framework is based on the fact that context-aware systems use context models in order to formalize and limit the notion of context and that relevant information differs from a domain to another and depends on the effective use of this information. Based on this framework, we consider in this paper a particular application domain, Business Processes, in which the notion of context remains unexplored, although it is required for flexibility and adaptability. We propose, in this paper, an ontology-based context model focusing on this particular domain.
The Design of a New Policy Model to Support Ontology-Driven Reasoning for Autonomic Networking
Authors: John Strassner, José Neuman Souza, Sven Meer, Steven Davy, Keara Barrett, David Raymer, Srini Samudrala
Venue: Journal of Network and Systems Management (2009)

The purpose of autonomic networking is to manage the business and technical complexity of networked components and systems. However, the lack of a common lingua franca makes it impossible to use vendor-specific network management data to ascertain the state of the network at any given time. Furthermore, the tools used to analyze management data, which include information and data models, ontologies, machine learning algorithms, and policy languages, are all different, and hence require different data in different formats. This paper describes a new version of the Directory Enabled Networks next generation (DEN-ng) policy model, which is part of the FOCALE autonomic network architecture. This new policy model has been built using three guiding principles: (1) the policy model is rooted in information models, so that it can govern managed entities, (2) the model is expressly constructed to facilitate the generation of ontologies, so that reasoning about policies constructed from the model may be done, and (3) the model is expressly constructed so that a policy language can be developed from it.
Finding topic trends in digital libraries
Authors: Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee Giles
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

We propose a generative model based on latent Dirichlet allocation for mining distinct topics in document collections by integrating the temporal ordering of documents into the generative process. The document collection is divided into time segments where the discovered topics in each segment is propagated to influence the topic discovery in the subsequent time segments. We conduct experiments on the collection of academic papers from CiteSeer repository. We augment the text corpus with the addition of user queries and tags and integrate the citation graph to boost the weight of the topical terms. The experiment results show that segmented topic model can effectively detect distinct topics and their evolution over time.
Genotype–phenotype associations
Authors: Timothy D. O'Connor, Nicholas I. Mundy
Venue: Bioinformatics (2009)

Motivation: Mapping between genotype and phenotype is one of the primary goals of evolutionary genetics but one that has received little attention at the interspecies level. Recent developments in phylogenetics and statistical modelling have typically been used to examine molecular and phenotypic evolution separately. We have used this background to develop phylogenetic substitution models to test for associations between evolutionary rate of genotype and phenotype. We do this by creating hybrid rate matrices between genotype and phenotype. Results: Simulation results show our models to be accurate in detecting genotype–phenotype associations and robust for various factors that typically affect maximum likelihood methods, such as number of taxa, level of relevant signal, proportion of sites affected and length of evolutionary divergence. Further, simulations show that our method is robust to homogeneity assumptions. We apply the models to datasets of male reproductive system genes in relation to mating systems of primates. We show that evolution of semenogelin II is significantly associated with mating systems whereas two negative control genes (cytochrome b and peptidase inhibitor 3) show no significant association. This provides the first hybrid substitution model of which we are aware to directly test the association between genotype and phenotype using a phylogenetic framework. Availability: Perl and HYPHY scripts are available upon request from the authors. Contact: to252@cam.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online.
Automatic Golf Ball Trajectory Reconstruction and Visualization
Authors: Tadej Zupančič, Aleš Jaklič
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

The article presents the steps required to reconstruct a 3D trajectory of a golf ball flight, bounces and roll in short game. Two video cameras were used to capture the last parts of the trajectories including the bounces and roll. Each video sequence is processed and the ball is detected and tracked until is stops. Detected positions from both video sequences are then matched and 3D trajectory is obtained and presented as an X3D model.
Resource Based Solution to Teachers' Knowledge Management
Authors: Sun Hongtao, Lu Wang, Hongwei Dai
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

With the rapid development of ICT (Information and Communication Technology) based education, more and more multimedia resources are available to schools. However the quality of these resources and their utilization are far from satisfactory. To fully utilize these multimedia resources in classroom instruction involves a combination of teachers' practical knowledge and presentation knowledge. Instruction design can be the bridge between multimedia teaching/learning resources and teachers' knowledge. In this paper, a solution of representing teachers' knowledge is suggested. With the help of a set of rules on how teachers use the multimedia teaching resources in a visualized way, the practical knowledge of teachers is to be represented and thus, reused. In this process, the understanding of multimedia teaching/leaning resources in instruction becomes explicit and can be shared among teachers.
Multi-dimensional top-k dominating queries
Authors: Man Lung Yiu, Nikos Mamoulis
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2009)

The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it provides data analysts an intuitive way for finding significant objects. In addition, it combines the advantages of top-k and skyline queries without sharing their disadvantages: (i) the output size can be controlled, (ii) no ranking functions need to be specified by users, and (iii) the result is independent of the scales at different dimensions. Despite their importance, top-k dominating queries have not received adequate attention from the research community. This paper is an extensive study on the evaluation of top-k dominating queries. First, we propose a set of algorithms that apply on indexed multi-dimensional data. Second, we investigate query evaluation on data that are not indexed. Finally, we study a relaxed variant of the query which considers dominance in dimensional subspaces. Experiments using synthetic and real datasets demonstrate that our algorithms significantly outperform a previous skyline-based approach. We also illustrate the applicability of this multi-dimensional analysis query by studying the meaningfulness of its results on real data.
Simplified order 4.0 weak Taylor schemes for additive noise
Authors: A. Tocino
Venue: Journal of Computational and Applied Mathematics (2009)

Following Kloeden and Platen [P.E. Kloeden and E. Platen, Numerical Solution of Stochastic Differential Equations, Springer-Verlag, Berlin, 1992] Taylor schemes are considered here as the starting point to obtain simplified Taylor schemes replacing the multiple integrals by simpler variables. The conditions that a group of variables has to fulfill so that the new scheme reaches weak-order 4.0 in the additive noise case are given explicitly, as well as the way to find such groups. For a particular selection, a pair of stochastic schemes with order 4.0 in the weak sense, correcting the one proposed in [P.E. Kloeden and E. Platen, Numerical Solution of Stochastic Differential Equations, Springer-Verlag, Berlin, 1992], is obtained.
A novel interacting multiple model algorithm
Authors: HongQuan Qu, LiPing Pang, ShaoHong Li
Venue: Signal Processing (2009)

For maneuvering target tracking, the interacting multiple model (IMM) algorithm employs a fixed model set. The performance of this algorithm depends on the model set adopted. The result of using too many models is as bad as the case of too few models. Therefore, a variable structure IMM (VSIMM) was presented and applied to ground target tracking. This algorithm improves performance and reduces computational load with using auxiliary information. But it is difficult to extend the VSIMM to other scenario (for example, aerial target), where there is not auxiliary information such as a map. A novel interacting multiple model (Novel-IMM) algorithm was presented to solve the problem of model set adaptation without auxiliary information. The Novel-IMM algorithm consists of N independent IMM filters operating in parallel, and each independent IMM filter also consists of multiple sub-filters, which operate interactively. In every time index, only one IMM output of a certain model set is used; but for a long time, the algorithm will alternatively choose an output of the model set to be the optimum final output. The Novel-IMM approach was illustrated in detail with an aerial complex maneuvering target tracking example.
Tracking Down Under: Following the Satin Bowerbird
Authors: Aniruddha Kembhavi, Ryan Farrell, Yuancheng Luo, David Jacobs, Ramani Duraiswami, Larry S. Davis
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

Sociobiologists collect huge volumes of video to study animal behavior (our collaborators work with 30,000 hours of video). The scale of these datasets demands the development of automated video analysis tools. Detecting and tracking animals is a critical first step in this process. However, off-the-shelf methods prove incapable of handling videos characterized by poor quality, drastic illumination changes, non-stationary scenery and foreground objects that become motionless for long stretches of time. We improve on existing approaches by taking advantage of specific aspects of this problem: by using information from the entire video we are able to find animals that become motionless for long intervals of time; we make robust decisions based on regional features; for different parts of the image, we tailor the selection of model features, choosing the features most helpful in differentiating the target animal from the background in that part of the image. We evaluate our method, achieving almost 83% tracking accuracy on a more than 200,000 frame dataset of Satin Bowerbird courtship videos.
Experimental analysis and numerical modelling of the forming process of polypropylene replicas of micro-cavities using hot embossing
Authors: Mohamed Sahli, Christine Millot, Claude Roques-Carmes, Chantal Khan Malek
Venue: Microsystem Technologies (2009)

Numerical modelling of the deformation of a polymer using the finite elements method in axisymetrical mode was performed using the LsDyna&#x00ae; software to describe the filling of micro-cavities during the forming process of the material using the hot embossing. These simulations firstly allow verifying whether the chosen forming process conditions promote or not an optimized filling of the superficial cavities in order to achieve precise replicas which best reproduce the superficial topography of the mould. The simulations were carried out to evaluate the filling of the cavities taking into account the mechanical behaviour of the selected polymer into the model. Moreover, these models were developed to verify the effect of the distribution of the mould cavities on their filling. The influence of the mobility of non deformable rigid plates on the filling of the cavities represents an auxiliary variable. In the approach presented, the compression plates are assumed to be parallel and non deformable, whereas the polymer disk follows a rubbery behaviour around a temperature equal to 140&#x00b0;C. Globally the modelling results are satisfactory for they are rather close to the experimental observations conducted. In summary, the effect of the normal stress as also the distribution of micro-cavities at the mould surface seem to prevail in the case of the forming process by hot embossing.
XML schema mappings
Authors: Shun'ichi Amano, Leonid Libkin, Filip Murlak
Venue: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2009)

Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amount of attention. Our goal is to develop a theory of expressive XML schema mappings. Such mappings should be able to use various forms of navigation in a document, and specify conditions on data values. We develop a language for XML schema mappings, and concentrate on three types of problems: static analysis of mappings, their complexity, and their composition. We look at static analysis problems related to various flavors of consistency: for example, whether it is possible to map some document of a source schema into a document of the target schema, or whether all documents of a source schema can be mapped. We classify the complexity of these problems. We then move to the complexity of mappings themselves, i.e., recognizing pairs of documents such that one can be mapped into the other, and provide a classification based on sets of features used in mappings. Finally we look at composition of XML schema mappings. We study its complexity and show that it is harder to achieve closure under composition for XML than for relational mappings. Nevertheless, we find a robust class of XML schema mappings that have good complexity properties and are closed under composition.