ppxscal/embedding_network huggingface dataset:
Detection and translation of OOV terms prior to query time
Authors: Ying Zhang, Phil Vines
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Accurate cross-language information retrieval requires that query terms be correctly translated. Several new techniques to improve the translation of out of vocabulary terms in English-Chinese cross-language information retrieval have been developed. However, these require queries and a document collection to enable translation disambiguation. Although effective, they involve much processing and searching of the Web at query time, and may not be practical in a production web search engine. In this work, we consider what tasks maybe carried out beforehand, the goal being to reduce the processing required at query time. We have successfully developed new techniques to extract and translate out of vocabulary terms using the Web and add them into a translation dictionary prior to query time.
An analysis of communication mode in group support systems research
Authors: Jerry Fjermestad
Venue: Decision Support Systems (2004)

Group support systems (GSS) have been the subject of many investigations and meta-analyses over the past decade. This study presents, summarizes, and analyzes the results of 145 experiments that used communication mode as an independent variable. The results show that the modal outcome for GSSs compared to Face-to-Face (FtF) methods is "no difference," while the overall percentage of positive effects for results that compare GSS to FtF is 29.2%. The results suggest that the use of a GSS improves decision quality, depth of analysis, equality of participation, and satisfaction over manual methods. Additionally, more detailed analysis suggests that task type, GSS type and the interaction of both have a moderating effect on adaptation and outcome factors. Specifically, groups working on idea generation tasks using GSS decision room technology improve to 39.6% (GSS>FtF) effect. Conversely, asynchronous computer-mediated communication (CMC) groups working on decision making tasks improved to 46.4% (GSS>FtF) effect. FtF groups show higher levels of consensus and perceived quality, communicate more, and are more efficient (requiring less time to complete the tasks). No differences are observed between FtF and GSS groups on satisfaction and usability.
Lower bounds for dynamic connectivity
Authors: Mihai Pǎtraşcu, Erik D. Demaine
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We prove an Ω(lg Erik n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if the graph is formed by disjoint paths, and thus also applies to trees and plane graphs. The bound is known to be tight for these restricted cases, proving optimality of these data structures (e. g., Sleator and Tarjan's dynamic trees). Our trade-off is known to be tight for trees, and the best two data structures for dynamic connectivity in general graphs are points on our trade-off curve. In this sense these two data structures are optimal, and this tightness serves as strong evidence that our lower bounds are the best possible. From a more theoretical perspective, our result is the first logarithmic cell-probe lower bound for any problem in the natural class of dynamic language membership problems, breaking the long standing record of Ω(lg n / lg lg n). In this sense, our result is the first data-structure lower bound that is "truly" logarithmic, i. e., logarithmic in the problem size counted in bits. Obtaining such a bound is listed as one of three major challenges for future research by Miltersen [13] (the other two challenges remain unsolved). Our techniques form a general framework for proving cell-probe lower bounds on dynamic data structures. We show how our framework also applies to the partial-sums problem to obtain a nearly complete understanding of the problem in cell-probe and algebraic models, solving several previously posed open problems.
Designing software without backtracking: the part of dream and the part of reality
Authors: Ali Mili
Venue: ACM SIGSOFT Software Engineering Notes (1982)

The research effort reported on here is an attempt to identify the cause of backtracking in Software design and to present a sketch of remedies to it.
Improved class prediction in DNA microarray gene expression data by unsupervised reduction of the dimensionality followed by supervised learning with a perceptron
Authors: Lucía Conde, Álvaro Mateos, Javier Herrero, Joaquín Dopazo
Venue: Journal of VLSI Signal Processing Systems (2003)

This manuscript describes a combined approach of unsupervised clustering followed by supervised learning that provides an efficient classification of conditions in DNA array gene expression experiments (different cell lines including some cancer types, in the cases shown). Firstly the dimensionality of the dataset of gene expression profiles is reduced to a number of non-redundant clusters of co-expressing genes using an unsupervised clustering algorithm, the Self Organizing Tree Algorithm (SOTA), a hierarchical version of Self Organizing Maps (SOM). Then, the average values of these clusters are used for training a perceptron that produces a very efficient classification of the conditions. This way of reducing the dimensionality of the data set seems to perform better than other ones previously proposed such as principal component analysis (PCA). In addition, the weights that connect the gene clusters to the different experimental conditions can be used to assess the relative importance of the genes in the definition of these classes. Finally, Gene Ontology (GO) terms are used to infer a possible biological role for these groups of genes and to asses the validity of the classification from a biological point of view.
Some systems, applications and models I have known
Authors: Kenneth C. Sevcik
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Being named recipient of the 2004 ACM Sigmetrics Achievement Award has done several things to me. It brought me surprise that I would be singled out from the many people who have made significant and sustained contributions to the field of performance evaluation. It also brought me deep appreciation for all the students and colleagues with whom I have worked and come to know as friends over the years. Finally, it has caused me to ponder and reminisce about many of the research projects and consulting studies in which I have participated.In this talk, I will describe various systems I have used and studied, various applications of interest, and various models that I, and others, have used to try to gain insights into the performance of systems. Some lessons of possible future relevance that emerge from this retrospective look at a wide variety of projects are the following: <ol>Exact Answers Are Overrated -- While exact solutions of mathematical models are intellectually satisfying, they are often not needed in practice. Analytic Models Have a Role -- Analytic models can be used to obtain quick and inexpensive answers to performance questions in many situations where neither simulation nor experimentation are feasible. Assumptions Matter -- Subtle changes to the assumptions that underlie an analytic model can substantially alter the conclusions reached based on the model.</olAfter considering all the methods of analysis, simulation and experimentation, my recommendation for the very best means to attain substantially improved computer system performance is: Wait thirty years!
Why current IR engines fail
Authors: Chris Buckley
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Observations from a unique investigation of failure analysis of Information Retrieval (IR) research engines are presented. The Reliable Information Access (RIA) Workshop invited seven leading IR research groups to supply both their systems and their experts to an effort to analyze why their systems fail on some topics and whether the failures are due to system flaws, approach flaws, or the topic itself. There were surprising results from this cross-system failure analysis. One is that despite systems retrieving very different documents, the major cause of failure for any particular topic was almost always the same across all systems. Another is that relationships between aspects of a topic are not especially important for state-of-the-art systems; the systems are failing at a much more basic level where the top-retrieved documents are not reflecting some aspect at all.
On Energy-Constrained Real-Time Scheduling
Authors: Tarek A. AlEnawy, Hakan Aydin
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

In this paper, we explore the feasibility and performanceoptimization problems for real-time systems that must remainfunctional during an operation/mission with a fixed, initialenergy budget. We show that the feasibility problem is NP-Hardin the context of systems with Dynamic Voltage Scaling(DVS) capability and discrete speed levels. Then, we focuson energy-constrained periodic task systems where theavailable energy budget is not sufficient to meet all thedeadlines. We propose techniques to maximize the totalnumber of deadlines met and the total reward (utility) whileguaranteeing the completion of the mission and a minimumperformance for each task. We consider separately: (i)systems with or without DVS capability, and (ii) off-line(static) and on-line (dynamic) solutions to select mostvaluable jobs for execution. We also discuss the tractabilityof the involved optimization problems. Our on-linealgorithms combine job promotion, job demotion and speedreduction techniques to maximize the system performancewhile guaranteeing the completion of the mission. Weevaluate our schemes through simulations and show that theon-line schemes can yield significant performanceimprovements over static solutions.
A Compositional Claim-based Component Certification Procedure
Authors: Hailiang Mei, Johan Lukkien, Johan Muskens
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Component-based software construction is of much interest in software engineering due to its promise of black-box composition and independent deployment. Because of this black-box nature, users of components must be concerned with their trustworthiness, in particular when third parties are involved. Component certification is used to improve trust, usually relating the component to the party that made it. In order to support predictable assembly the certification procedure should also address extra-functional properties. In addition, certificates should remain valid across certain compositions. In this paper we present a certification procedure in the context of the ROBOCOP component architecture We discuss specific requirements, introduce terminology and present a solution.
Using Probabilistic Methods to Optimize Data Entry in Accrual of Patients to Clinical Trials
Authors: Bhavesh D. Goswami, Lawrence O. Hall, Dmitry B. Goldgof, Eugene Fink, Jeffrey P. Krischer
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

A clinical trial is a study conducted on a group of patients to evaluate a new treatmentprocedure. Usually, clinicians manually select patients for a clinical trial; the choice of eligiblepatients is a labor-intensive process, and clinicians are often unable to identify sufficientnumber of patients, which delays the evaluation of new treatments. We have developed a web-based system that helps clinicians to determine the eligibility of patients for multiple clinicaltrials. It uses probabilistic techniques that minimize the amount of manual data entry, byordering the related data-entry steps. We describe the developed system and give the results of applying it to retrospective data of breast cancer patients at the Moffitt Cancer Center.
Dihedral Escherization
Authors: Craig S. Kaplan, David H. Salesin
Venue: Proceedings of Graphics Interface 2004 (2004)

"Escherization" [9] is a process that finds an Escher-like tiling of the plane from tiles that resemble a user-supplied goal shape. We show how the original Escherization algorithm can be adapted to the dihedral case, producing tilings with two distinct shapes. We use a form of the adapted algorithm to create drawings in the style of Escher's print Sky and Water. Finally, we develop an Escherization algorithm for the very different case of Penrose's aperiodic tilings.
Developing Web-Based Infrastructures For Collaborative Working: The Case For Localised Solutions
Authors: Stephen Sobol, Jennie Roux
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper reports on the application of a series of web-based data systems as a tool for collaborative working. The data systems were specifically designed, using Cold Fusion, to meet the requirements of particular user groups. The rapid application development - and consequent close tailoring to the needs of users - made possible by the technology, permits an examination of a number of different systems enabling a consideration of the factors which might lead to success. The concept of 'bottom-up' database application development is presented. Conclusions relate to the wider application of this technology in organisations where more localised system development may offer efficiency and effectiveness gains compared to more centralised systems.
Adaptive Edge Spinning Algorithm for Poligonization of Implicit Surfaces
Authors: Martin Cermak, Vaclav Skala
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents an adaptive method forpolygonization of implicit surfaces. The method insistson the shape of triangles and the accuracy of resultingapproximation as well. The main advantages of thetriangulation presented are simplicity and the stablefeatures that can be used for next expanding. Theimplementation is not complicated and only thestandard data structures are used. The presentedalgorithm is based on the surface tracking scheme andit is compared with the other algorithms based on thesimilar principle, such as the Marching cubes and theMarching triangles algorithms.
Implicit vs. Explicit Resource Allocation in SMT Processors
Authors: Francisco J. Cazorla, Peter M. W. Knijnenburg, Rizos Sakellariou, Enrique Fernandez, Alex Ramirez, Mateo Valero
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In a Simultaneous Multithreaded (SMT) architecture, the front end of a superscalar is adapted in order to be able to fetch from several threads while the back end is shared among the threads. In this paper, we describe different resource sharing models in SMTprocessors. We show that explicit resource allocation can improve SMT performance. In addition, it enables SMTs to solve other QoS requirements, not realizable before.
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Authors: Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob Van Stee
Venue: Journal of Scheduling (2003)

The unit price seat reservation problem is investigated. The seat reservation problem is the problem of assigning seat numbers on-line to requests for reservations in a train traveling through k stations. We are considering the version where all tickets have the same price and where requests are treated fairly, that is, a request which can be fulfilled must be granted.For fair deterministic algorithms, we provide an asymptotically matching upper bound to the existing lower bound which states that all fair algorithms for this problem are ½-competitive on accommodating sequences, when there are at least three seats.Additionally, we give an asymptotic upper bound of 7/9 for fair randomized algorithms against oblivious adversaries.We also examine concrete on-line algorithms, First-Fit and Random for the special case of two seats. Tight analyses of their performance are given.
Towards a Semantic Framework for Non-functional Specifications of Component-Based Systems
Authors: Steffen Zschaler
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

It is now widely recognized that the so-called non-functional or extra-functional properties of a software system are at least as important as its somewhat more classical functional properties and that they must be considered as early as possible in the development cycle in order to avoid costly failures. In this paper we define elements of a semantic framework for non-functional specifications of component-based systems. We focus on how the run-time environment uses components, whose non-functional properties have been specified, and the available system resources to provide a service with specified non-functional properties.
Comparing model checking and logical reasoning for real-time systems
Authors: Henning Dierks
Venue: Formal Aspects of Computing (2004)

We apply both model checking and logical reasoning to a real-time protocol for mutual exclusion. To this end we employ PLC-Automata, an abstract notion of programs for real-time systems. A logic-based semantics in terms of Duration Calculus is used to verify the correctness of the protocol by logical reasoning. An alternative but consistent operational semantics in terms of Timed Automata is used to verify the correctness by model checkers. Since model checking of the full model does not terminate in all cases within an acceptable time we examine abstractions and their influence on model-checking performance. We present two abstraction methods that can be applied successfully for the protocol presented.
Component Middleware to Support Non-repudiable Service Interactions
Authors: Nick Cook, Paul Robinson, Santosh Shrivastava
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The wide variety of services and resources availableover the Internet presents new opportunities to create valueadded, inter-organisational Composite Services (CSs) frommultiple existing services. To preserve their autonomy andprivacy, each organisation needs to regulate access both totheir services and to shared information within the CS. Keymechanisms to facilitate such regulated interactions are thecollection and verification of non-repudiable evidence ofthe actions of the parties to the CS. The paper describes howcomponent-based middleware can be enhanced to supportnon-repudiable service invocation and information sharing.A generic implementation, based on a J2EE applicationserver, is presented.
Implications of Traffic Characteristics on Quality of Service in Broadband Multi Service Networks
Authors: Gerhard Haslinger
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Quality of service (QoS) aspects in telecommunication networks interrelate requirements of users and applications with network architectures supporting relevant transmission properties. New challenges arise in multi service platforms with increasing variety of service demands, which comes together with a higher variability in traffic profiles. We try to give a general and comprehensive picture of the effect of traffic characteristics and control mechanisms on quality of service (QoS). Broadband access platforms are considered from source traffic profiles to QoS aware dimensioning for aggregated traffic in the IP backbone. Networks based on multiprotocol label switching (MPLS) are included, which combine capabilities for network monitoring, planning and traffic engineering with full support of differentiated and integrated services as main QoS concepts introduced by the Internet engineering task force (IETF).
Computational Analysis and Classification of p53 Mutants According to Primary Structure
Authors: Krishna Gopalakrishnan, R. H. Zadeh, Kayvan Najarian, Alireza Darvish
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Widely used multiple alignment based techniques can give false results for single base mutation as the primary sequence of mutants and that of the wild types are very similar. We present a technique that uses signal processing methods along with biochemical properties of individual amino acids for the analysis of proteins. Each amino acid of mutant protein is replaced with the corresponding biochemical properties generates a set of biochemical signals. These signals are used to extract signal processing features like complexity, mobility, fractal dimension, and wavelet transformation. In an experimental study of p53 protein, mutants resulting from single mutation of eight residue of the β-strand 326-33 to alanine were analyzed for their ability to stimulate transcription, to inhibit the growth of Saos-2 cells, and to repress the promoter of multidrug resistance gene. Our classification results, merely based on the analysis of primary sequences, are matching with those of the experiential studies.
A first look at HealthCyberMap medical semantic subject search engine
Authors: Maged N. Kamel Boulos
Venue: Technology and Health Care (2004)

HealthCyberMap (〈http://healthcybermap.semanticweb.org〉) is a Semantic Web project that aims at mapping selected parts of health information resources in cyberspace in novel semantic ways to improve their retrieval and navigation. This paper describes HealthCyberMap semantic subject search engine methodology and early prototype which attempt to overcome the limitations of conventional free text search engines. Explicit concepts in resource metadata map onto a brokering domain ontology (a clinical terminology or classification) allowing a Semantic Web search engine to infer implicit meanings (synonyms and semantic relationships) not directly mentioned in either the resource or its metadata. Similarly, user queries would map to the same ontology allowing the search engine to infer the implicit semantics of user queries and use them to optimise retrieval. Related issues of metadata, clinical terminologies and automatic vs. manual indexing of medical Web resources are also discussed, together with future methodological directions, which include the use of a true terminology server as an intelligent broker between user queries and HealthCyberMap pool of resource metadata. A comparative evaluation of the new engine based on relevance metrics is also proposed.
Preconditioned Iterative Linear Solvers for Unstructured Grids on the Earth Simulator
Authors: Kengo Nakajima
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Efficient parallel preconditioned iterative linear solvers for unstructured grid have been developed for symmetric multiprocessor (SMP) cluster architectures with vector processors such as the Earth Simulator. Three types of preconditioning methods (ICCG, multigrid and selective-blocking for contact problems) have been developed and performance has been demonstrated on the Earth Simulator using flat-MPI and hybrid parallel programming models, where each of three preconditioning methods corresponds to typical finite-element type applications in solid earth simulation developed in GeoFEM project. Simple 3D linear elastic problems with more than 2.2 ×10¿ DOF have been solved using 3×3 block ICCG(0) method and PDJDS/CM-RCM reordering on 176 nodes of the Earth Simulator, achieving performance of 3.80 TFLOPS. Multicolor and RCM ordering provide excellent parallel and vector performance of the three preconditioned methods on the Earth Simulator.