ppxscal/embedding_network huggingface dataset:
The Evaluations of FTF-IDF Scoring for Fresh Information Retrieval
Authors: Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Fresh information is important for real business. However, conventional search engines are not suited for fresh information retrieval because they are based on centralized architecture. So, we have developed a distributed search engine, Cooperative Search Engine (CSE), which based on distributed architecture. CSE can search fresh information in a short time. The cost of fresh information retrieval is O(1) in the average case, but O(n) in the worst case. So, CSE is scalable, because it is not depended on the system scale. However, even if the performance is good, it is not enough for fresh information retrieval. The value of information is determined by both freshness and relevance. Traditional ranking methods consider either freshness or relevance. So, we propose FTF-IDF scoring which considers both freshness and relevance. In this paper, we evaluate its effects.
Event Logging: Portable and Efficient Checkpointing in Heterogeneous Environments with Non-FIFO Communication Platforms
Authors: Zhao Peng, Alexey Lastovetsky
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

The Chandy-Lamport checkpointing algorithm is widely used in fault tolerant implementations of MPI. However, it assumes the FIFO property of message passing, which is not guaranteed by the MPI standard at the application level. Therefore, this algorithm cannot serve as a basis for an implementation-independent fault tolerant MPI. In this paper, we present a variant of the Chandy-Lamport algorithm that does not rely on the FIFO property. This algorithm can be implemented on top of MPI and, hence, used for development of a supplement software component enabling the fault tolerance of any MPI implementation compliant with the MPI standard. We prove the correctness of the algorithm and analyze its performance. Experimental results demonstrating the efficiency of the algorithm are also presented.
The statistical significance of the MUC-4 results
Authors: Nancy Chinchor
Venue: Proceedings of the 4th conference on Message understanding (1992)

The MUC-4 scores of recall, precision, and the F-measures are used to measure the performance of the participating systems. The differences in the scores between any two systems may be due to chance or may be due to a significant difference between the two systems. To rule out the possibility that the difference is due to chance, statistical hypothesis testing is used. The method of hypothesis testing used is a computationally-intensive method known as approximate randomization. The method and the statistical significance of the results for the two MUC-4 test sets, TST3 and TST4, will be discussed in this paper.
The performance of a grammar checker with deviant language input
Authors: Janne Bondi Johannessen, Kristin Hagen, Pia Lane
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

This paper reports on an evaluation performed on the Grammar Checker for Norwegian (NGC), developed at The Text Laboratory, University of Oslo. The ability of the NGC to find errors made by different "non-standard" linguistic groups is analysed and compared to its performance when tested on texts written by "standard" users. Then possible ways of adapting the NGC for use on deviant language input are discussed.
Bootstrapping Free-Space Optical Networks
Authors: Fang Liu, Uzi Vishkin, Stuart Milner
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We introduce a challenging problem in establishing and initially configuring a Free Space Optical (FSO) network. In such networks, it is assumed that each communication node is a base station, including a router and optical transceivers, and its number of transceivers is limited. In addition, the FSO networks are characterized by narrow beam, directional links (operating at 1550 nm, for example). The problem is to initially configure the transceivers to form a connected topology-an NP-complete problem because of the transceiver limitation. It also needs to configure the transceivers in a "distributed" fashion, because a node can have direct knowledge of only its neighbors. We have developed a fully distributed approximation algorithm, which constructs a spanning tree with maximal node degree at most one larger than that in the optimal solution. Due to its distributed nature, this algorithm outperforms knownserial algorithms. For a graph with 200 nodes generated in some randomized model, speedups greater than 6 have been demonstrated.
A Tunable Square Root Domain Oscillator
Authors: Karim O. Mohammed, Ahmed M. Soliman
Venue: Analog Integrated Circuits and Signal Processing (2005)

This letter presents a square root domain oscillator; which inherits the tunability, linearity, and frequency response of square root domain filters. The oscillator is based on an extreme case of a second order bandpass filter with quality factor set to infinity. The oscillator function is demonstrated analytically and by simulation.
Panel on mobility in sensor networks
Authors: Alexandros Labrinidis, Anthony Stefanidis
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Sensor networks are promising unprecedented levels of access to information about the physical world, in real time. Many areas of human activity are starting to see the benefits of utilizing sensor networks, in almost all such cases, sensor networks are statically deployed. The next evolutionary step for sensor networks is to handle mobility in all its forms. This panel aims to identify the benefits from such a step and recognize the resulting research challenges.
Gender HCI issues in problem-solving software
Authors: Laura Beckwith
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Thus far, researchers have not investigated gender HCI issues in the context of end-user problem-solving software. Designers' ignorance of gender differences is particularly evident in studies showing software is unintentionally designed for males. We are investigating gender HCI issues using quantitative and qualitative empirical methods, using formative work to consider gender-conscious design features, implementing these features in our research prototype, and following up with summative work to evaluate effectiveness.
What does aspect-oriented programming mean to Cobol?
Authors: Ralf Lämmel, Kris De Schutter
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

We study AOP in the context of business programming with Cobol. We face the following questions: What are join points in Cobol programs? What is advice? Does classic Cobol provide any constructs that hint at AOP? (Yes!) What are typical crosscutting concerns in the Cobol world? How do otherwise typical crosscutting concerns make sense for Cobol? How does AOP for Cobol align with classic re-engineering transformations for Cobol? We deliver an AOP language design for Cobol. Codename: AspectCobol. While we adopt several ideas from AspectJ and friends, we also devise original techniques for joint-point identification and context capture. We briefly discuss a prototypical implementation of AspectCobol.
The Globus eXtensible Input/Output System (XIO): A Protocol Independent IO System for the Grid
Authors: William Allcock, John Bresnahan, Rajkumar Kettimuthu, Joseph Link
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

In distributed heterogeneous Grid environments the protocols used to exchange bits are crucial. As researchers work hard to discover the best new protocol for the Grid, application developers struggle with ways to use these new protocols. A stable, consistent, and intuitive framework is needed to aid in the implementation and use of these protocols. While the application must not be burdened with the protocol details some of it may need to be exposed to take advantage of potential optimizations. In this paper we examine how the Globus XIO API provides this framework. We will explore the performance implications of using this abstraction layer and the benefits gained in application as well as protocol development.
Nanoantennas for uncooled, double-band, CMOS compatible, high-speed infrared sensors: Research Articles
Authors: Gábor Matyi
Venue: International Journal of Circuit Theory and Applications (2004)

Nanoantennas for double-band uncooled sensors are proposed for infrared focal plane arrays (FPA). Metal-oxide-metal tunnel diodes integrated with the nanoantennas are square-law detectors for currents induced in the antennas by incident infrared radiation. The sensors that operate in the long-wave infrared band are CMOS compatible and facilitate high-speed processing exceeding 1000 frames per second. Double-band sensors are proposed for each pixel of the FPA. The double-band character of the sensor's responsivity is insured by the design of the antenna geometry. The frequency dependence of the insulator material is taken into account. Simulations of the proposed design are promising. Copyright &copy; 2004 John Wiley & Sons, Ltd.
PRC Inc.: description of the PAKTUS system used for MUC-5
Authors: Bruce Loatman, Chih-King Yang
Venue: Proceedings of the 5th conference on Message understanding (1993)

The PRC Adaptive Knowledge-based Text Understanding System (PAKTUS) was developed as an Independent Research and Development project at PRC from 1984 through 1992. It includes a core English lexicon and grammar, a concept network, processes for applying these to lexical, syntactic, semantic, and discourse analysis, and tools that support the adaptation of the generic core to new domains, primarily by acquiring sublanguage and domain-specific lexicon and topic patterns. The lexical, syntactic, and semantic analysis components required little adaptation for MUC-5, the most significant change being conversion of the task-specific semantic representations to object-oriented form. The discourse analysis component was modified to operate on the task-specific semantic structures, rather than the generic case frames.
Establishing network computer forensics classes
Authors: Louise L. Soe, Dan Manson, Marcy Wright
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

This paper discusses the deployment of computer forensics classes at undergraduate and graduate levels in a shared classroom/lab environment. The course content combined broad-based computer forensics theory and practice with hands-on forensics tools, including networked EnCase Enterprise forensics software. Our discussion covers teaching and learning issues from the perspectives of the instructors and the graduate and undergraduate students. Lessons learned in these initial course offerings reveal effective practices as well as areas that require improvement..
An Image Sensor Node for Wireless Sensor Networks
Authors: Zhi-Yan Cao, Zheng-Zhou Ji, Ming-Zeng Hu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Visual information is the most intuitive information perceived by human. Image sensors are able to provide the visual information for recognition, monitoring and surveillance. Networks of visual sensors are the solution of choice for a number of societal, research, and educational applications. Architectural challenges are posed for designers of image sensor nodes such as computational power, energy consumption, energy sources, communication channels, and sensing capabilities. We discuss the characteristics and requirements for an image sensor node. An image sensor node is designed and implemented for wireless sensor network. It includes an embedded processor, memory, a CMOS image sensor, image acquisition unit, RF module and power unit etc. Power-efficient hardware management strategies are proposed for the image sensor node. Image compression problem of image sensor nodes is discussed in detail.
Robust Face Detection with Multi-Class Boosting
Authors: Yen-Yu Lin, Tyng-Luh Liu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

With the aim to design a general learning framework for detecting faces of various poses or under different lighting conditions, we are motivated to formulate the task as a classification problem over data of multiple classes. Specifically, our approach focuses on a new multi-class boosting algorithm, called MBHboost, and its integration with a cascade structure for effectively performing face detection. There are three main advantages of using MBHboost: 1) each MBH weak learner is derived by sharing a good projection direction such that each class of data has its own decision boundary; 2) the proposed boosting algorithm is established based on an optimal criterion for multi-class classification; and 3) since MBHboost is flexible with respect to the number of classes, it turns out that it is possible to use only one single boosted cascade for the multi-class detection. All these properties give rise to a robust system to detect faces efficiently and accurately.
QCA channel routing with wire crossing minimization
Authors: Brian Stephen Smith, Sung Kyu Lim
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemical molecules. QCA layout is currently restricted to a single layer with very limited number of wire crossing permitted. Thus, wire crossing minimization is crucial in improving the manufacturability of QCA circuits. In this article, we present the first QCA channel routing algorithm for wire crossing minimization. Our channel routing algorithm is able to reduce crossings, where Left-Edge First, Yoshimura and Kuh, and topologically-based algorithms fail to do so.
Design of a High-Speed Optical Interconnect for Scalable Shared-Memory Multiprocessors
Authors: Avinash Karanth Kodi, Ahmed Louri
Venue: IEEE Micro (2005)

The architecture proposed here reduces remote memory access latency by increasing connectivity and maximizing channel availability for remote communication. It also provides efficient and fast unicast, multicast, and broadcast capabilities, using a combination of aggressively designed multiplexing techniques. Simulations show that this architecture provides excellent interconnect support for a highly scalable, high-bandwidth, low-latency network.
Application networking on peer-to-peer networks
Authors: Mu Su, Chi-Hung Chi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper proposes the AN.P2P architecture to facilitate efficient peer-to-peer content delivery with heterogeneous presentation requirements. In general, the AN.P2P enables a peer to deliver the original content objects and an associated workflow to other peers. The workflow is composed of content adaptation tasks. Hence, the recipient can reuse the original object to generate appropriate presentations for other peers.
On lattices, learning with errors, random linear codes, and cryptography
Authors: Oded Regev
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the 'learning from parity with error' problem to higher moduli. It can also be viewed as the problem of decoding from a random linear code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however, is quantum. Hence, an efficient solution to the learning problem implies a quantum algorithm for SVP and SIVP. A main open question is whether this reduction can be made classical.Using the main result, we obtain a public-key cryptosystem whose hardness is based on the worst-case quantum hardness of SVP and SIVP. Previous lattice-based public-key cryptosystems such as the one by Ajtai and Dwork were only based on unique-SVP, a special case of SVP. The new cryptosystem is much more efficient than previous cryptosystems: the public key is of size Õ(n2) and encrypting a message increases its size by Õ(n)(in previous cryptosystems these values are Õ(n4) and Õ(n2), respectively). In fact, under the assumption that all parties share a random bit string of length Õ(n2), the size of the public key can be reduced to Õ(n).
Optimal Production and Marketing Planning
Authors: Seyed J. Sadjadi, Maryam Oroujee, Mir. B. Aryanezhad
Venue: Computational Optimization and Applications (2005)

This paper presents an integrated production, marketing and inventory model which determines the production lot size, marketing expenditure and product's selling price. Our model is highly nonlinear and non-convex and cannot be solved directly. Therefore, Geometric Programming (GP) is used to locate the optimal solution of the proposed model. In our GP implementation, we use a transformed dual problem in order to reduce the model to an optimization of an unconstrained problem in a single variable and the resulting problem is solved using a simple line search. We analyze the solution in different cases in order to study the behaviour of the model and for each case, a numerical example is used to demonstrate the implementation of our analysis.
Matroids Induced by Packing Subgraphs
Authors: Marek Janata
Venue: SIAM Journal on Discrete Mathematics (2005)

This paper is concerned with the classification of families of graphs $\mathcal T$ with the following property: For any graph G, the subsets of vertices of G that can be saturated by packing copies of graphs from $\mathcal T$ form a collection of independent sets of a matroid. From this point of view, we present a characterization of so-called EHP-families of graphs (i.e., families consisting of K2, hypomatchable graphs, and propellers). The main result is the following: For a matroid-inducing EHP-family $\mathcal T$, we characterize connected graphs H such that the family $\mathcal T\cup\{H\}$ is also matroid-inducing.
The International Cotton Genome Initiative workshop I, at PAG XIII: Conference Papers
Authors: R. J. Kohel, John Z. Yu
Venue: Comparative and Functional Genomics (2005)

This article is a U.S. Government work and is in the public domain in the U.S.A
Analytical Modelling of Hot-Spot Traffic in Deterministically-Routed K-Ary N-Cubes
Authors: S. Loucif, M. Ould-Khaoua, G. Min
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

Many research studies have proposed analytical models to evaluate the performance of k-ary n-cubes with deterministic wormhole routing. Such models however have so far been confined to uniform traffic distributions. There has been hardly any model proposed that deal with non-uniform traffic distributions that could arise due to, for instance, the presence of hot-spots in the network. This paper proposes the first analytical model to predict message latency in k-ary n-cubes with deterministic routing in the presence of hot-spots. The validity of the model is demonstrated by comparing analytical results with those obtained through extensive simulation experiments.
Variable Structure in DEVS Component-Based Modeling and Simulation
Authors: Xiaolin Hu, Bernard P. Zeigler, Saurabh Mittal
Venue: Simulation (2005)

Variable structure refers to the ability of a system to dynamically change its structure according to different situations. It provides component-based modeling and simulation environments with powerful modeling capability and the flexibility to design and analyze complex systems. In this article, the authors discuss variable structure--specifically, the structure change and interface change capability--in DEVS-based modeling and simulation environments. The operations of structure change and interface change are discussed, and their respective operation boundaries are defined. Three examples are given to illustrate the role of variable structure and how it can be used to model and design adaptive complex systems. Principles for the implementation of variable structure are also presented and illustrated in the DEVSJAVA modeling and simulation environment.
Generic Global Rigidity
Authors: Robert Connelly
Venue: Discrete Computational Geometry (2005)

Suppose a finite configuration of labeled points p = (p1,. . . ,pn) in Ed is given along with certain pairs of those points determined by a graph G such that the coordinates of the points of p are generic, i.e., algebraically independent over the integers. If another corresponding configuration q = (q1,. . . ,qn) in Ed is given such that the corresponding edges of G for p and q have the same length, we provide a sufficient condition to ensure that p and q are congruent in Ed. This condition, together with recent results of Jackson and Jord&#x00e1;n, give necessary and sufficient conditions for a graph being generically globally rigid in the plane.
The seventh annual Bio-Ontologies meeting: Conference Editorials - Moat House Hotel, Glasgow, 30 July 2004. The Seventh Annual Bio-Ontologies Meeting, Moat House Hotel, Glasgow.
Authors: Phillip Lord, Robert Stevens
Venue: Comparative and Functional Genomics (2004)

The Annual Bio-Ontologies Meeting [1] has now reached its seventh consecutive year, running as a special interest group (SIG) of the much larger ISMB conference. This year's meeting in Glasgow had approximately 100 attendees. Since the advent of the Gene Ontology, which coincided with the first Bio-Ontologies Meeting, we have seen a year-on-year strengthening of the field; bio-ontologies has moved from being dominated by computer science to be led by biological applications; discussion is less about &lsquo;what is an ontology?&rsquo; and more about &lsquo;how to build an ontology which is fit for purpose?&rsquo;. This strengthening of the field can be seen elsewhere. Both the main ISMB conference and this year's Pacific Symposium on Biocomputing (PSB) [2] have seen a large number of submissions to their ontologies track. For the first time a selection of the papers from the SIG is being published in this issue of Comparative and Functional Genomics. We hope that this will complement the publications of the larger conferences, bringing to a wider audience the cutting edge research that characterizes the Bio-Ontologies SIG. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Transferability of skills over the IT career path
Authors: Choong Kwon Lee
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

The primary goal of this study is to help IT professionals prepare themselves for their future careers by identifying transferable skills across the three different IT jobs: programmer/analysts, systems analysts, and IT managers. By collecting and analyzing data from Fortune 500 corporate websites, this research attempts to provide IT professionals with a list of skills that they need to retain and new skills to develop for their future careers.