ppxscal/embedding_network huggingface dataset:
The role of manually-assigned keywords in query expansion
Authors: Kazem Taghva, Julie Borsack, Thomas Nartker, Allen Condit
Venue: Information Processing and Management: an International Journal (2004)

We report on two types of experiments with respect to manually-assigned keywords to documents in a collection. The first type of experiment examines the usefulness of manually-assigned keywords to automatic feedback. The second type of experiment considers the potential benefits of these keywords to the user as an interactive tool. Several experiments were run and compared. The results of these experiments indicate that there is no gain in average precision when manually-assigned keywords are used for query expansion. Further, manually-assigned keywords did not aid the user as an interactive tool for document understanding.
Performance and Dependability of Structured Peer-to-Peer Overlays
Authors: Miguel Castro, Manuel Costa, Antony Rowstron
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Structured peer-to-peer (p2p) overlay networks providea useful substrate for building distributed applications.They map object keys to overlay nodes and offer a primitiveto send a message to the node responsible for a key.They can implement, for example, distributed hash tablesand multicast trees. However, there are concerns about theperformance and dependability of these overlays in realisticenvironments. Several studies have shown that currentp2p environments have high churn rates: nodes join andleave the overlay continuously. This paper presents techniquesthat continuously detect faults and repair the overlayto achieve high dependability and good performance inrealistic environments. The techniques are evaluated usinglarge-scale network simulation experiments with fault injectionguided by real traces of node arrivals and departures.The results show that previous concerns are unfounded; ourtechniques can achieve dependable routing in realistic environmentswith an average delay stretch below two and amaintenance overhead of less than half a message per secondper node.
A Novel Multiobjective Particle Swarm Optimization for Buoys-Arrangement Design
Authors: Yongde Zhang, Shabai Huang
Venue: Proceedings of the Intelligent Agent Technology, IEEE/WIC/ACM International Conference (2004)

This paper introduces a proposal to extend the particle swarm optimization (PSO) to deal with constrained multiobjective optimization problems. PSO is modified by using the bidirectional searching strategy to guide each particle to search simultaneously in its neighborhood and the region where particles are distributed sparsely. The advantages of the approach are that it is easy to implement and the obtained solutions has a good distribution. It is validated using several test cases. The results show that the approach can efficiently find multiple Pareto optimal solutions. Finally, the approach is used to solve buoys-arrangement problem and the results are satisfying.
Modeling and verification of an air traffic concept of operations
Authors: César A. Muñoz, Gilles Dowek, Víctor Carreño
Venue: ACM SIGSOFT Software Engineering Notes (2004)

A high level model of the concept of operations of NASA's Small Aircraft Transportation System for Higher Volume Operations (SATS-HVO) is presented. The model is a non-deterministic, asynchronous transition system. It provides a robust notion of safety that relies on the logic of the concept rather than on physical constraints such as aircraft performances. Several safety properties were established on this model. The modeling and verification effort resulted in the identification of 9 issues, including one major flaw, in the original concept. Ten recommendations were made to the SATS-HVO concept development working group. All the recommendations were accepted and incorporated into the current concept of operations. The model was written in PVS. The verification is performed using an explicit state exploration algorithm written and proven correct in PVS.
Coordinated En-Route Transcoding Caching for Tree Networks
Authors: Keqiu Li, Hong Shen
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

As transcoding caching is attracting an increasingamount of attention, it is important and necessary tofind methods to distribute multiple versions of the same mediaobject in the Internet. In this paper, we first present amathematical model for the problem of optimally determiningthe locations in which to place multiple versions of thesame media object in tree networks such that the specifiedobjective is achieved. This problem is formulated as anoptimization problem. Second, we propose a low-cost dynamicprogramming-based solution for solving this problem,by which the optimal locations are obtained. Finally,we evaluate our model on different performance metricsthrough extensive simulation experiments and comparethe results of our model with those of existing modelsthat consider transcoding caching either on a path or at individualnodes only.
Low-Latency Virtual-Channel Routers for On-Chip Networks
Authors: Robert Mullins, Andrew West, Simon Moore
Venue: ACM SIGARCH Computer Architecture News (2004)

The on-chip communication requirements of manysystems are best served through the deployment of a regularchip-wide network. This paper presents the design of alow-latency on-chip network router for such applications.We remove control overheads (routing and arbitrationlogic) from the critical path in order to minimise cycle-timeand latency. Simulations illustrate that dramatic cycle timeimprovements are possible without compromising routerefficiency. Furthermore, these reductions permit flits to berouted in a single cycle, maximising the effectiveness of therouter's limited buffering resources.
On third power mean values computation of digital sum function in base n
Authors: Li Hailong
Venue: Smarandache Notions Journal (2004)

let m = a1nk1, + a2nk2 + ...... + asnks, where 1 ≤ ai < n, i = 1, 2,.., s. k1 > k2 > ... > ks ≥ 0, a(m, n) = a1 + a2 + ...... + as, for Ak(N, n) = Σm < N(m, n) (k = 1, 2, 3) . An exact calculating formula for Ak (N, n) (k = 1, 2, 3) is given.
Fast and Secure Magnetic WORM Storage Systems
Venue: Proceedings of the Second IEEE International Security in Storage Workshop (2003)

Computer forensic analysis, intrusion detection and disasterrecovery are all dependent on the existence of trustworthylog files. Current storage systems for such log filesare generally prone to modification attacks, especially by anintruder who wishes to wipe out the trail he leaves duringa successful break-in. In light of recent advances in storagecapacity and sharp drop in prices of storage devices,as well as the demand for trustworthy storage systems, it istimely to design and develop fast storage systems that practicallyhave no limit in capacity and admit "secure append-only"operations (namely data can only be appended to astorage device; once appended it can no longer be modified,and can be read out by authorized users only.) This paperreports some preliminary findings in our research intobuilding a secure append-only storage system. It discusses apossible secure append-only storage architecture that couldbe used to detect and prevent deletion or modification by inside/outside attackers. A specific implementation of the architecturebased on block device drivers and magnetic storage firmwaresis alsopresented.
Genetic sequence classification and its application to cross-species homology detection
Authors: Snehasis Mukhopadhyay, Changhong Tang, Jeffery Huang, Mathew Palakal
Venue: Journal of VLSI Signal Processing Systems (2003)

Although large-scale classification studies of genetic sequence data are in progress around the world, very few studies compare different classification approaches, e.g. unsupervised and supervised, in terms of objective criteria such as classification accuracy and computational complexity. In this paper, we study such criteria for both unsupervised and supervised classification of a relatively large sequence data set. The unsupervised approach involves use of different sequence alignment algorithms (e.g., Smith-Waterman, FASTA and BLAST) followed by clustering using the Maximin algorithm. The supervised approach uses a suitable numeric encoding (relative frequencies of tuples of nucleotides followed by principal component analysis) which is fed to a Multi-layer Backpropagation Neural Network. Classification experiments conducted on IBM-SP parallel computers show that FASTA with unsupervised Maximin leads to best trade-off between accuracy and speed among all methods, followed by supervised neural networks as the second best approach. Finally, the different classifiers are applied to the problem of cross-species homology detection.
Relationship between Network Latency and Information Quality in a Synchronized Distributed Virtual Environment
Authors: Dai Hanawa, Tatsuhiro Yonekura
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

In this paper, the theoretical modeling of interactive performance ona distributed virtual environment (DVE) is carried out. To study the degradation of the information quality caused by the existence of network latency on a simple virtual task model, Markov model is employed. Compared with the numerical simulation, the proposed model can be a good approximation of the simulation results. The results of subjective experiments show that, in average, the accuracy of human foreseeing behavior marked between the score of the first and the second order Markov models.
Performance evaluation of the hitachi SR8000 using SPEC OMP2001 benchmarks
Authors: Daisuke Takahashi, Mitsuhisa Sato, Taisuke Boku
Venue: International Journal of Parallel Programming (2003)

This paper reports the performance of a single node of the Hitachi SR8000 when using SPEC OMP2001 benchmarks. Each processing node of the SR8000 is a shared-memory parallel computer composed of eight scalar processors with pseudo-vector processing feature. We have run the all of the SPEC OMP2001 benchmarks on the SR8000. According to the results of this performance measurement, we found that the SR8000 has good scalability continuing up to 8 processors except for a few benchmark programs. The performance results demonstrate that the SR8000 achieves high performance especially for memory-intensive applications.
Weibull slope and voltage acceleration of ultra-thin (1.1-1.45 nm EOT) oxynitrides
Authors: Robert O'Connor, Robin Degraeve, Ben Kaczer, Anabela Veloso, Greg Hughes, Guido Groeseneken
Venue: Microelectronic Engineering (2004)

The reliability of ultra-thin silicon oxynitride gate dielectrics was investigated in terms of the Weibull slope of the tbd distributions, and the voltage acceleration factor. High field tBD statistics were extrapolated using a worst-case linear fit, to the low field region. The samples showed low voltage acceleration, which degrades reliability, but this is overcome by high Weibull slopes (β), which improve reliability. The high β values were investigated by monitoring the change in β as gate current increased during CVS. We saw the Weibull slope change from ≈1 at low current to 2 at high current, indicating that breakdown results from 2-trap conduction. Charge pumping measurements showed that the trap generation rate at the SiON/Si interface, where most of the Nitrogen resides was very low. Thus it was concluded that there is a much higher trap generation rate in the bulk than at the interface and this is responsible for the values of β.
On the 80th problem of F.Smarandache(II)
Authors: He Xiaolin, Guo Jinbao
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the first power mean of d(a(n)); ϕ(a(n)) and their generations,and a sery of regular result is obtained,where ϕ(n) is Euler totient funstion, d(n) is divisor function and a(n) is the sequence in problem 80 of "only problems not solutions" which was presented by professor F. Smarandache.
Image Segmentation of Uterine Cervix Images for Indexing in PACS
Authors: Shiri Gordon, Gali Zimmerman, Hayit Greenspan
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The National Cancer Institute has collected a large database of digitized 35mm slides ofthe uterine cervix, the idea being to build a system enabling to study the evolution of lesionsrelated to cervical cancer. In taking the first few steps towards this goal, the objective ofthis work is to develop and evaluate methodologies required for visual-based (i.e. content-based) indexing and retrieval that substantially improve information management of such a database. In this paper we model the properties of three tissue types using color andtexture features, and use these models for image segmentation. Statistical modeling andsegmentation tools are used for the task.
Depth through breadth, or why should we attend talks in other areas?
Authors: Avi Wigderson
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Given that the two other invited lectures in this conference are on such remote areas as "Quantum Computation" and "Algorithmic Game Theory," and given the diversity of other topics represented in the program, it makes sense to ask if the STOC/FOCS community is still one.Indeed, the program chair has asked me to respond to this question.In the talk I'll try to illustrate, with a few (of many) examples, how the presence of such diversity in our community and conferences was actually responsible for important progress in specific areas of research, why I find these a natural and expected phenomena, and why I expect this trend to continue.
PAC-learnability of Probabilistic Deterministic Finite State Automata
Authors: Alexander Clark, Franck Thollard
Venue: The Journal of Machine Learning Research (2004)

We study the learnability of Probabilistic Deterministic Finite State Automata under a modified PAC-learning criterion. We argue that it is necessary to add additional parameters to the sample complexity polynomial, namely a bound on the expected length of strings generated from any state, and a bound on the distinguishability between states. With this, we demonstrate that the class of PDFAs is PAC-learnable using a variant of a standard state-merging algorithm and the Kullback-Leibler divergence as error function.
Inversion of parameterized hypersurfaces by means of subresultants
Authors: Laurent Busé, Carlos D'Andrea
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in the case where it exists. The algorithm takes into account the monomial structure of the input polynomials.
A Study of Practical Approach of Using Motion Capture and Keyframe Animation Techniques
Authors: Mohd Izani, Ahmad Rafi Eshaq, Aishah Razak, Norzaiha Norhan
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Producing 3D character animation requires proper planning and the right tools: these include highly technical manpower and facilities. Our paper discusses a practica; approach for producing 3D character animation namely motion capture (Mocap) and keyframe animation. This research is based on our experience utilising both multimedia applications at Faculty of Creative Multimedia, Multimedia University. We analyze the strengths and weaknesses of these two methods based on a set of experiments, followed by conclusions that serve as a set of guidelines for animators as they decide on the use of motion capture or keyframe.
An Algorithm for Detecting Homologues of Known Structured RNAs in Genomes
Authors: Shu-Yun Le, Jacob V. Maizel,  Jr., Kaizhong Zhang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Distinct RNA structures are frequently involved in a wide-range of functions in various biological mechanisms. The three dimensional RNA structures solved by X-ray crystallography and various well-established RNA phylogenetic structures indicate that functional RNAs have characteristic RNA structural motifs represented by specific combinations of base pairings and conserved nucleotides in the loop region. Discovery of well-ordered RNA structures and their homologues in genome-wide searches will enhance our ability to detect the RNA structural motifs and help us to highlight their association with functional and regulatory RNA elements. We present here a novel computer algorithm, HomoStRscan, that takes a single RNA sequence with its secondary structure to search for homologous-RNAs in complete genomes. This novel algorithm completely differs from other currently used search algorithms of homologous structures or structural motifs. For an arbitrary segment (or window) given in the target sequence, that has similar size to the query sequence, HomoStRscan finds the most similar structure to the input query structure and computes the maximal similarity score (MSS) between the two structures. The homologousRNA structures are then statistically inferred from the MSS distribution computed in the target genome. The method provides a flexible, robust and fine search tool for any homologous structural RNAs.
RepeatAssembler: A Package for Annotation of Full-Length Repetitive DNA Sequences in Fungal Genomes
Authors: Mark L. Farman, Joshua W. Gilkerson, Jerzy W. Jaromczyk, Chuck Staben
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

REPEATASSEMBLER aims to automate the identification of full-length consensus sequences for repetitive DNA fragments or the genetic material that is repeated many times throughout the genome (so-called repeats). Although there are packages with similar objectives, e.g. RECON [1], none fully meets the needs of researchers in comparative genomics. Joining short repeating elements into full-length repeats is particularly intricate and handling this task properly is both the goal and the strength of our solution. REPEATASSEMBLER analyzes as few sequences as possible to screen out all repetitive sequences. Then it builds a set of non-redundant repeats and reports the full-length consensus sequence for each element in the set. REPEATASSEMBLER consistently delivers repetitive sequences that agree with known full-length repeats for several fungal genomes.
The boxer: round 2
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Round 2 of the funny boxing game featuring Vicky and Johnny, boxing dolls who cannot help but hit each other. The tomboy and a poor fella who can never win, take aim at each other in this second in a series of animations by Tuba Animation Studio. Copyright held by creator.
On delivery times in packet networks under adversarial traffic
Authors: Adi Rosén, Michael S. Tsirkin
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

We consider packet networks and make use of the "adversarial queuing theory" model [10]. We are interested in the question of guaranteeing that all packets are actually delivered to destination, and of having an upper bound on the delivery times of all packets. Whether this is possible against all rate-1 adversaries was previously posed as an open question [15, 10].Among other, we give a queuing policy that guarantees bounded delivery time whenever the rate-1 adversary itself can deliver all packets in bounded time and adheres to certain additional conditions. On the negative side we show that even the adversary itself cannot deliver all packets in bounded time for all rate-1 sequences of packets. We thus answer the open question posed by Gamarnik [15]. We further show that delivering all packets while maintaining stability (we coin the term "reliability" for this property) can be done by an offline scheduler whenever the injection of packets is done at rate of at most 1. Thus any rate-1 adversary can have this property. But, on the other hand, we also show that there is no online protocol (even centralized) that can achieve that property against all rate-1 adversaries. We thus answer an open question of Borodin et al. [10].
Using Forest Inventory Data and Geographic Information Systems to Support Forest Management Decision-Making
Authors: Ronald E. McRoberts, Krista M. Gebert, Patrick D. Miles, Greg C. Liknes, R. James Barbour
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Natural resources decision-making increasingly relies on analyses of spatial data in map-based formats. Although a variety of supporting map layers are becoming available, user-friendly tools to assist decision-makers in the analysis of the maps generally are not available. The Spatial Resources Support System (SpaRSS) is a geographic information system (GIS)-based system designed to support decision-making via the analysis of spatial natural resources data in map-based formats. The focus of support is in three areas: (1) assembly of relevant biophysical and human dimension digital data layers and maps; (2) analyses based on the integration of spatial data; and (3) comparison of results arising from different approaches to integrating spatial data and from different decision alternatives. A real-world example involving the allocation of funding for forest wildfire mitigation purposes illustrates how SpaRSS may be used to support forest management decision-making.
Multi-processor scheduling to minimize flow time with ε resource augmentation
Authors: Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We investigate the problem of online scheduling of jobs to minimize flow time and stretch on m identical machines. We consider the case where the algorithm is given either (1+ε)m machines or m machines of speed (1+ε), for arbitrarily small ε > 0. We show that simple randomized and deterministic load balancing algorithms, coupled with simple single machine scheduling strategies such as SRPT (shortest remaining processing time) and SJF (shortest job first), are O(poly(1/ε))-competitive for both flow time and stretch. These are the first results which prove constant factor competitive ratios for flow time or stretch with arbitrarily small resource augmentation. Both the randomized and the deterministic load balancing algorithms are non-migratory and do immediate dispatch of jobs.The randomized algorithm just allocates each incoming job to a random machine. Hence this algorithm is non-clairvoyant, and coupled with SETF (shortest elapsed time first), yields the first non-clairvoyant algorithm which is constant competitive for minimizing flow time with arbitrarily small resource augmentation. The deterministic algorithm that we analyze is due to Avrahami and Azar. For this algorithm, we show O(1/ε)-competitiveness for total flow time and stretch, and also for their Lp norms, for any fixed p ≥ 1.
Overview of IEEE 802.16 Security
Authors: David Johnston, Jesse Walker
Venue: IEEE Security and Privacy (2004)

When creating the new wireless communication standard IEEE 802.16, designers attempted to reuse a security scheme designed for wired media. The authors review the standard, enumerate its flaws, and outline changes that could defend it against threats.