ppxscal/embedding_network huggingface dataset:
Experiments with the 4 Query Sets of WebCLEF 2006
Authors: Stephen Tomlinson
Venue: Evaluation of Multilingual and Multi-modal Information Retrieval: 7th Workshop of the Cross-Language Evaluation Forum, CLEF 2006, Alicante, Spain, September 20-22, 2006, Revised Selected Papers (2007)

In the WebCLEF mixed monolingual retrieval task of the Cross-Language Evaluation Forum (CLEF) 2006, the system was given 1939 known-item queries, and the goal was to find the desired page in the 82GB EuroGOV collection (3.4 million pages crawled from government sites of 27 European domains). The 1939 queries included 124 new manually-created queries, 195 manually-created queries from last year, and two sets of 810 automatically-generated queries. In our experiments, the results on the automatically-generated queries were not always predictive of the results on the manually-created queries; in particular, our title-weighting and duplicate-filtering techniques were fairly effective on the manually-created queries but were detrimental on the automatically-generated queries. Further investigation uncovered serious encoding issues with the automatically-generated queries; for instance, the queries labelled as Greek actually used Latin characters. 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
Accuracy of Baseline and Complex Methods Applied to Morphosyntactic Tagging of Polish
Authors: Marcin Kuta, Michał Wrzeszcz, Paweł Chrząszcz, Jacek Kitowski
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The paper presents baseline and complex part-of-speech taggers applied to the modified corpus of Frequency Dictionary of Contemporary Polish. Accuracy of 5 baseline part-of-speech taggers is reported. On the base of these results complex methods are worked out. Thematic split and attribute split methods are proposed and evaluated. Tagging accuracy of voting methods is evaluated finally. The most accurate baseline taggers are SVMTool (for a simple tagset) and fnTBL (for a complex tagset). Voting method called Total Precision achieves the top accuracy among all looked over methods.
Classification of Breast Masses in Mammogram Images Using Ripley's K Function and Support Vector Machine
Authors: Leonardo Oliveira Martins, Erick Corrêa Silva, Aristófanes Corrêa Silva, Anselmo Cardoso Paiva, Marcelo Gattass
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Female breast cancer is a major cause of death in western countries. Several computer techniques have been developed to aid radiologists to improve their performance in the detection and diagnosis of breast abnormalities. In Point Pattern Analysis, there is a statistic known as Ripley's K function that is frequently applied to Spatial Analysis in Ecology, like mapping specimens of plants. This paper proposes a new way in applying Ripley's K function to classify breast masses from mammogram images. The features of each nodule image are obtained through the calculate of that function. Then, the samples gotten are classified through a Support Vector Machine (SVM) as benign or malignant masses. SVM is a machine-learning method, based on the principle of structural risk minimization, which performs well when applied to data outside the training set. The best result achieved was 94.94% of accuracy, 92.86% of sensitvity and 93.33% of specificity.
Mining Trajectories of Laboratory Data using Multiscale Matching and Clustering
Authors: Shusaku Tsumoto, Shoji Hirano
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This paper shows application of trajectory mining techniquesto laboratory examination data, where dynamics of two laboratoryexaminations are represented as a trajectory in a two dimensionalplane. Each trajectory is segmented and compared with other trajectoriesby multiscale matching, and clustered by using similarities obtainedby matching technique.Experimental results on chronic hepatitis data demonstratedthat the method could find the groups of trajectorieswhich reflects temporal covariance of platelet, albumin and cholineesterase.
A Mining Algorithm Using Property Items Extracted from Sampled Examples
Authors: Jun-Ichi Motoyama, Shinpei Urazawa, Tomofumi Nakano, Nobuhiro Inuzuka
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

This paper proposes a mining algorithm for relational frequent patterns based on a bottom-up property extraction from examples. The extracted properties, called property items, are used to construct patterns by a level-wise way like Apriori. The property items are assumed to have a special form, which is defined in terms of mode declaration of predicates. The algorithm produces frequent itemsets as patterns without duplication in the sense of logical equivalence. It is implemented as a system called Mapix and is evaluated with four different datasets with comparison to Warmr. Mapix had large advantage in runtime.
Fpga acceleration of molecular dynamics simulations
Authors: Martin Herbordt
Venue:  (2008)

While molecular dynamics simulations (MD) are a fundamental method for gaining the understanding of chemical and biological systems, their computational cost is extremely high: Simulating macromolecules requires thousands of node hours and cell-level systems remain altogether out of reach. We address this issue by using an emerging mode of high performance computing that is based on configurable logic in the form of Field Programmable Gate Arrays (FPGAs). The problem is that, while FPGAs have often delivered 100-fold speed-ups per node over microprocessor-based systems, the applications have generally been limited to those with small regular kernels operating on low-precision integer data types. MD possesses neither. We address this problem by creating an explicitly designed FPGA-coprocessor that can be integrated into generic commercially available systems. MD is an iterative technique: the forces on each particle are computed, then applied using the equations of motion. We use standard partitioning by computing bonded forces, motion updates, and bookkeeping on the host, while computing the remaining forces (which dominate) on the FPGA accelerator. For the short-range forces we combine the following: cell lists, systematically determined interpolation and precision, handling of exclusion, and support for models with large numbers of particles. This has required new microarchitectures for the cell list processor and off-chip memory controller; and extensive experimentation to explore the design space to optimize precision, interpolation order, interpolation mode, table sizes, and simulation quality. To perform efficient and accurate numerical computation on FPGA, we created a novel arithmetic mode that is tuned for computing high order polynomial interpolation. For the long-range forces we use the multigrid method: we show that this is an excellent match to FPGAs with the primary operations having a favorable systolic structure and taking advantage of the large number of independently addressable RAMs. The significance of this work lies at several levels: the 5&times; to 10&times; acceleration of MD production code while retaining simulation quality; the turings of algorithms for the FPGA; the system integration; the new arithmetic mode; the numerous novel microarchitectures; and the methods for optimizing MD implementations on FPGAs.
Irregular Coarse-Grain Data Parallelism under LPARX
Authors: Scott R. Kohn, Scott B. Baden
Venue: Scientific Programming (1996)

LPARX is a software development tool for implementing dynamic, irregular scientific applications, such as multilevel finite difference and particle methods, on high-performance multiple instruction multiple data (MIMD) parallel architectures. It supports coarse-grain data parallelism and gives the application complete control over specifying arbitrary block decompositions. LPARX provides structural abstraction, representing data decompositions as first-class objects that can be manipulated and modified at runtime. LPARX, implemented as a C++ class library, is currently running on diverse MIMD platforms, including the Intel Paragon, Cray C-90, IBM SP2, and networks of workstations running under PVM. Software may be developed and debugged on a singe-processor workstation.
Group Communications in Mobile Ad Hoc Networks
Authors: Prasant Mohapatra, Chao Gui, Jian Li
Venue: Computer (2004)

Efficient support of group communications is critical for most ad hoc network applications. However, manet group communications issues differ from those in wired environments because the wireless communications medium has variable and unpredictable characteristics, and the signal strength and propagation fluctuate with respect to time and environment. The authors provide an overview of group communications issues such as protocol design, state maintenance, and performance. They also discuss representative protocols and examine related issues such as reliability, power conservation, quality of service, security, and areas requiring additional research.
Learning Software Project Management on the Web: The Impact of Question Prompts
Authors: Pantelis M. Papadopoulos, Stavros N. Demetriadis, Ioannis G. Stamelos, Ioannis A. Tsoukalas
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

This work focuses on the efficiency of question prompts for supporting students, when learning through cases in an ill-structured domain, such as Software Project Management. Three groups of students studied cases in a lab-session time period using a web-based environment, where question prompts directed students to think on important issues of the case material. The first group studied the cases without the question prompts, the second group studied, while prompted to provide written answers to questions embedded in the cases, and the third group studied and was asked only to think of possible answers for the question prompts. Post-tests did not reveal any significant differences between the three groups. This result is discussed in the light of a previous study, which showed that this kind of prompting may have beneficial impact on student learning in a prolonged study-time setting, where students are able to self-regulate their study activity.
Efficient Generic Forward-Secure Signatures and Proxy Signatures
Authors: Basel Alomair, Krishna Sampigethaya, Radha Poovendran
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

We propose a generic method to construct forward-secure signature schemes from standard signature schemes. The proposed construction is more computationally efficient than previously proposed schemes. In particular, the key updating operation in the proposed scheme is orders of magnitude more computationally efficient than previous schemes, making it attractive for a variety of applications, such as electronic checkbooks. Another advantage of our proposed scheme is the ability to be easily extended to proxy signature schemes. We define two notions of forward-security in the proxy signature setup, namely, strong forward-secure proxy signatures and weak forward-secure proxy signatures. We then describe a construction of a scheme that satisfies the strong forward-secure proxy signature property.
Exploration of TCM Masters Knowledge Mining
Authors: Xijin Tang, Nan Zhang, Zheng Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

With a very long history, traditional Chinese medicine (TCM) has a rich knowledge about human health and disease by its special way. To avoid losing lots of precious knowledge of TCM masters, endeavors have been engaged to keep down those knowledge of TCM masters, such as their growth experiences, effective practical cases toward sickness and typical treating methods and principles. In this paper, some computerized methods are applied toward those collected materials about some alive TCM masters in China mainland to show a different way of exposing essential ideas of those TCM masters which aims to help people understand the correspondence of TCM views toward disease and body, and facilitate tacit knowledge transfer. This work is one kind of qualitative meta-synthesis of TCM masters' knowledge.
A Minimal Pair in the Quotient Structure M/NCup
Authors: Rongfang Bie, Guohua Wu
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

In this paper, we prove the existence of a minimal pair of c.e. degrees a and b such that both of them are cuppable, and no incomplete c.e. degree can cup both of them to 0'. As a consequence, [a] and [b] form a minimal pair in M/NCup, the quotient structure of the cappable degrees modulo noncuppable degrees. We also prove that the dual of Lempp's conjecture is true.
Modeling of Requirements Tracing
Authors: Matthias Heindl, Stefan Biffl
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

Software customers want both sufficient product quality and agile response to requirements changes. Formal software requirements tracing helps to systematically determine the impact of changes and to keep track of development artifacts that need to be re-tested when requirements change. However, full tracing of all requirements on the most detailed level can be very expensive and time consuming. In the paper an initial "tracing activity model" is introduced along with a framework that allows measuring the expected cost and benefit of tracing approaches. In a feasibility study a subset of the activities belonging to the model has been applied to compare three tracing strategies: agile, "just in time" tracing, and fully formal tracing. The study focused on re-testing and it has been performed in the context of an industry project where the customer was a large financial service provider.In the study a) the model was found useful to capture costs and benefits of the tracing activities and to compare different strategies; b) a combination of tracing approaches proved helpful in balancing agility and formalism.
Fractal Model Based Face Recognition for Ubiquitous Environments
Authors: Shuenn-Shyang Wang, Su-Wei Lin, Cheng-Ming Cho
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

In Ubiquitous environments, it is required to identify the user in order to utilize the knowledge of the user's behavior and situation. In this paper, we propose a novel method of face recognition using dominant facial region extraction and fractal model. In order to improve the performance of the face recognition system, we propose an algorithm to extract the dominant facial region from the face images that includes the most discriminated part of the face, and for each dominant facial region it was presented by its fractal model and stored in database. The fractal model of the dominant facial region is then utilized as fractal facial features for face recognition. To further improve the performance of the face recognition system , we also propose the techniques of weighting mask and DC_Free MSE. Finally, some experimental results are presented and demonstrate the excellent performance of our face recognition approach.
Chernoff-Based Multi-class Pairwise Linear Dimensionality Reduction
Authors: Luis Rueda, Claudio Henríquez, B. John Oommen
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Linear dimensionality reduction techniques have been studied very well for the two-class problem, while the corresponding issues encountered when dealing with multiple classes are far from trivial. In this paper, we show that dealing with multiple classes, it is not expedient to treat it as a multi-class problem, but it is better to treat it as an ensemble of Chernoff-based two-class reductions onto different subspaces. The solution is achieved by resorting to either Voting, Weighting, or a Decision Tree combination scheme. The ensemble methods were tested on benchmark datasets demonstrating that the proposed method is not only efficient, but also yields an accuracy comparable to that obtained by the optimal Bayes classifier.
A Fast Handoff Scheme Between PDSNs in 3G Network
Authors: Jae-Hong Ryu, Dong-Won Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

This paper proposes a fast handoff scheme between PDSNs (Packet Data Serving Nodes) which provide packet services to a mobile node. The proposed handoff scheme does not require reestablishment of a PPP connection that may occur in the process of performing handoff between PDSNs. The handoff method between PDSNs requires that the PDSNs should receive subscribers' information about mobile nodes from their neighbor PDSNs forming a communication network. When the PDSN recognizes the mobile node moving into its coverage area, it can quickly establish a communication channel with the mobile node based on the subscriber information received already. As a result, the handoff is performed without reestablishing PPP. Therefore, the handoff between PDSNs can be performed faster removing time needed for establishing a PPP session with a terminal and for terminating a previously set up PPP session.
Conic Representations for Shape Description
Authors: Peter Wilson
Venue: IEEE Computer Graphics and Applications (1987)

The question of what is the "best" form of geometry for use in CAD systems and for data exchange between systems has often been argued with much intuition but few facts. I will present here some numerical stability results for several formulations of conic curves with the conclusion that the point/vector/scalar representation performs best. This also leads to a form of referential geometry that has significant advantages for use in geometric modeling systems.
A pilot study to compare programming effort for two parallel programming models
Authors: Lorin Hochstein, Victor R. Basili, Uzi Vishkin, John Gilbert
Venue: Journal of Systems and Software (2008)

Context: Writing software for the current generation of parallel systems requires significant programmer effort, and the community is seeking alternatives that reduce effort while still achieving good performance. Objective: Measure the effect of parallel programming models (message-passing vs. PRAM-like) on programmer effort. Design, setting, and subjects: One group of subjects implemented sparse-matrix dense-vector multiplication using message-passing (MPI), and a second group solved the same problem using a PRAM-like model (XMTC). The subjects were students in two graduate-level classes: one class was taught MPI and the other was taught XMTC. Main outcome measures: Development time, program correctness. Results: Mean XMTC development time was 4.8h less than mean MPI development time (95% confidence interval, 2.0-7.7), a 46% reduction. XMTC programs were more likely to be correct, but the difference in correctness rates was not statistically significant (p=.16). Conclusions: XMTC solutions for this particular problem required less effort than MPI equivalents, but further studies are necessary which examine different types of problems and different levels of programmer experience.
Software Development for High-Performance, Reconfigurable, Embedded Multimedia Systems
Authors: Alberto La Rosa Luciano Lavagno, Claudio Passerone
Venue: IEEE Design Test (2005)

Editors'note: Reconfigurable platforms can be very effective for lowering production costs because they allow the reuse of architectural resources across a variety of applications. In this article, the authors describe a methodology and a set of tools that allow extensive design exploration for hardware-software codesign, with the goal of improving the overall utilization of reconfigurable multimedia platforms.—Radu Marculescu, Carnegie Mellon University and Petru Eles, Linköping University
Customized Design of Hearing Aids Using Statistical Shape Learning
Authors: Gozde Unal, Delphine Nain, Greg Slabaugh, Tong Fang
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

3D shape modeling is a crucial component of rapid prototyping systems that customize shapes of implants and prosthetic devices to a patient's anatomy. In this paper, we present a solution to the problem of customized 3D shape modeling using a statistical shape analysis framework. We design a novel method to learn the relationship between two classes of shapes, which are related by certain operations or transformation. The two associated shape classes are represented in a lower dimensional manifold, and the reduced set of parameters obtained in this subspace is utilized in an estimation, which is exemplified by a multivariate regression in this paper. We demonstrate our method with a felicitous application to estimation of customized hearing aid devices.
FPGA-Based Control for the Wire-Saving of Five-Fingered Haptic Interface
Authors: Takahiro Endo, Yuki Kawachi, Haruhisa Kawasaki, Tetsuya Mouri
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

We have developed the five-fingered Haptic Interface Robot: HIRO II + that can present the force at the human five fingertips. Since the number of the wiring cables for motors and sensors increases by making the robot multi-DOF, it is a big obstruction of the miniaturization and the smooth movement of the robot. So, we developed the wire-saving interface board which is based on FPGA, and we considered the control system of HIRO II + . This paper presents the concept of FPGA-based control system for the wire-saving of HIRO II + and presents the experimental result to show high potential of the interface.
Multi-agent Model of Technological Shifts
Authors: James G. Mccarthy, Tony Sabbadini, Sonia R. Sachs
Venue: Multi-Agent-Based Simulation VIII: International Workshop, MABS 2007, Honolulu, HI, USA, May 15, 2007, Revised and Invited Papers (2008)

We present a multi-agent simulation model of a concentrated industry undergoing technological change. The simulation consists of heterogeneous firm agents, heterogeneous consumer agents, and one intermediating agent, the auctioneer, who aggregates market information to transmit to agents and to arrive at prices. Firms seek to maximize profit by estimating market demand, entering and exiting product markets, and optimizing output based on strategic conjectures of competing firm behavior. Consumers maximize utility by optimizing consumption within their budget sets. The auctioneer matches firm research with shifting consumer preferences, diffuses product knowledge among firms and consumers, and sets prices. We study . technological shifts; the diffusion of new technologies that directly compete with and replace existing ones. Sensitivity analysis is discussed in terms of the effects that model parameters have on product adoption, demand, output, spending, price, and profits. We validate our model against actual industry data on film cameras versus digital cameras.