ppxscal/embedding_network huggingface dataset:
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Authors: Shuang Liu, Fang Liu, Clement Yu, Weiyi Meng
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content words in the phrase are within a window of a certain size. The window sizes for different types of phrases are different and are determined using a decision tree. Phrases are more important than individual terms. Consequently, documents in response to a query are ranked with matching phrases given a higher priority. We utilize WordNet to disambiguate word senses of query terms. Whenever the sense of a query term is determined, its synonyms, hyponyms, words from its definition and its compound words are considered for possible additions to the query. Experimental results show that our approach yields between 23% and 31% improvements over the best-known results on the TREC 9, 10 and 12 collections for short (title only) queries, without using Web data.
A novel EEPROM cell for smart card application
Authors: Junghwan Lee, Minkyung Ko
Venue: Microelectronic Engineering (2004)

In this article, a new EEPROM cell suitable for smart card application is described. The cell has self-aligned select gate on both side walls of floating gate and this enables to give very small cell size. The cell size is 1.84 µm2 with 0.25 µm logic process. The cells are programmed and erased by Fowler-Nordheim (FN) tunneling. It appears that programming requires 1 ms at 16 V, while erasing requires 2 ms at 14 V. It shows excellent retention and endurance characteristic. Especially, the cell is stable after million cycles of endurance testing, and thus is suitable for smart card application.
Analysis of a Systematic Search-Based Algorithm for Determining Protein Backbone Structure from a Minimum Number of Residual Dipolar Couplings
Authors: Lincong Wang, Bruce Randall Donald
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We have developed an ab initio algorithm for determining a protein backbone structure using global orientational restraints on internuclear vectors derived from residual dipolar couplings (RDCs) measured in one or two different aligning media by solution nuclear magnetic resonance (NMR) spectroscopy [14, 15]. Specifically, the conformation and global orientations of individual secondary structure elements are computed, independently, by an exact solution, systematic search-based minimization algorithm using only 2 RDCs per residue. The systematic search is built upon a quartic equation for computing, exactly and in constant time, the directions of an internuclear vector from RDCs, and linear or quadratic equations for computing the sines and cosines of backbone dihedral (ö, ø) angles from two vectors in consecutive peptide planes. In contrast to heuristic search such as simulated annealing (SA) or Monte-Carlo (MC) used by other NMR structure determination algorithms, our minimization algorithm can be analyzed rigorously in terms of expected algorithmic complexity and the coordinate precision of the protein structure as a function of error in the input data. The algorithm has been successfully applied to compute the backbone structures of three proteins using real NMR data.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Energy saving is a critical task for sensor networks withlimited energy supply. Wakeup schemes that turn off sensors'radio when communication is not necessary have great potentialin energy saving. However, existing wakeup schemes encountercritical tradeoffs between energy saving and wakeuplatency, and little attention has been paid to reducing thepacket end-to-end delay while preserving the energy savingcapability. We argue that a long delay can be detrimental forlarge sensor networks. This paper proposes a wakeup schemethat helps to achieve the balance between energy saving andend-to-end delay. The conditions under which the proposedscheme can show improvement are identified.
Improving real-time collaboration with highlighting
Authors: Haifeng Shen, Chengzheng Sun
Venue: Future Generation Computer Systems (2004)

Highlighting is a common tool in most single-user editors. It provides users with a mechanism of communication and collaboration between the author and readers by emphasizing some important text. This tool is also necessary and even more valuable in multi-user collaborative editors. However, it is non-trivial to extend it from single-user environment to multi-user environment because of the following challenges: (1) the need to differentiate highlights performed by different users, (2) the need to tackle inconsistency problems caused by concurrent operations and non-deterministic communication latency, and (3) the need to provide a flexible undo facility with the capability of undoing any highlighting operation at any time. In this paper, we will systematically address these issues and offer our solutions. These solutions lay a foundation for handling update operations similar in nature to highlighting, which update attributes of text instead of inserting/deleting text.
Using symbolic execution to characterize behavior
Authors: Donald Cohen, William Swartout, Robert Balzer
Venue: Proceedings of the workshop on Rapid prototyping (1982)

Prototypes are built for a variety of reasons. This paper offers an alternative to the use of a prototype as a means of testing a specification (i.e. someone who "knows" what he wants compares his intuitive understanding with the behavior of the prototype on particular test cases). The alternative is symbolic execution of a formal specification, i.e. the specification is the prototype and its behavior is determined by symbolic execution rather than the traditional "concrete" execution. This is an extension of the approach to rapid prototyping based on operational specification [Balzer 82] and an alternative to testing prototypes whether manually constructed or developed mechanically from such an operational specification [Feather 82]. One advantage of this approach is that the prototype need not be built at all. Of course, the formal specification must be written, but this is often necessary anyway, especially if the specifier and implementor are different people. A more important advantage arising from symbolic execution is that a large subset of the possible behaviors can be examined at once.
Policy-Based Validation of SAN Configuration
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Historically, storage has been directly connected toservers for fast local access and easy configuration. Inrecent years, storage area networks (SANs) have definedan alternative storage paradigm that allows storage to beshared among servers using fast interconnects. One of thekey challenges of SAN management is the large numberof configuration problems that are encountered in a typicalSAN deployment. These configuration problems can beaddressed by SAN management software. However, hardcodingthe SAN configuration rules into the managementsoftware is not a viable option since it is not possible toeasily modify or replace old configuration rules and specifynew policies and guidelines. In this paper, we proposea novel policy-based SAN configuration validation systemthat can be used to specify, store, and evaluate configurationpolicies for SANs. We also introduce five new operatorsfor collection policies that are useful for evaluating awide variety of practical SAN configuration policies foundin practice. The policy-based SAN configuration checkingapproach proposed in this paper is discussed withinthe context of device interoperability constraints. However,this approach is extensible as it can also be used to enforceperformance, reliability, and security-related configurationconstraints.
Resolving Linkage Anomalies in Extracted Software System Models
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Program model linking has been largely overlooked andnot constrained properly in the extraction of software systemmodels. This often results in inaccurate system modelsat different levels of abstraction even if programs can beextracted correctly. This paper describes two constrainedapproaches toward accurate linkage resolution. The firstapproach is purely based on a set of linking heuristics. Thesecond approach leverages the software build process andalso utilizes linking heuristics. We compare these two approachesand discuss their benefits and limitations. The empiricalresults from a case study of the PostgreSQL databasesystem are also presented. Our study shows that inappropriatelinkage resolution leads to a relatively large numberof dependency anomalies at higher levels of abstraction.These anomalies can be effectively removed using ourproposed approaches.
Multi-phase minimal fault-tolerant wormhole routing in meshes
Authors: Jipeng Zhou, Francis C. M. Lau
Venue: Parallel Computing (2004)

In a multiprocessor system, it is important that the shortest path is always selected for inter-process communication. If every node in the system can acquire the accurate status of all nodes, then optimal routing is possible, but this is not feasible in view of the space and time costs involved. We propose a fault-tolerant wormhole routing algorithm for the mesh network in this paper, which is based on the idea of multi-phase minimal routing. The algorithm requires only local information at every node. When messages in transit come in contact with a fault region, they would select a locally minimal path around the region. The proposed algorithm can tolerate convex fault regions with only four virtual channels per physical channel regardless of how processors of different fault regions may overlap. The aggregation of locally minimal path segments gives a complete routing path between source and destination. Via simulation, we find that the algorithm has near optimal performance in most cases.
The Integer Hull of a Convex Rational Polytope
Authors: Jean B. Lasserre
Venue: Discrete Computational Geometry (2004)

Given $A\in\Z^{m\times n}$ and $b\in\Z^m$, we consider the integer program $\max \{c&#x2019;x\vert Ax=b;x\in\N^n\}$ and provide an {\it equivalent} and {\it explicit} linear program $\max \{\widehat{\xcc}&#x2019;q\vert \m q=r;q\geq 0\}$, where $\m,r,\widehat{c}$ are easily obtained from $A,b,c$ with no calculation. We also provide an explicit algebraic characterization of the integer hull of the convex polytope $\p=\{x\in\R^n\vert Ax=b;x\geq0\}$. All strong valid inequalities can be obtained from the generators of a convex cone whose definition is explicit in terms of $\m$.
Scanning capacitance microscopy and -spectroscopy on SiO2 films with embedded Ge and Si nanoclusters
Authors: R. Beyer, E. Beyreuther, J. von Borany, J. Weber
Venue: Microelectronic Engineering (2004)

Scanning capacitance microscopy (SCM) and -spectroscopy (SCS) were applied to study the charge trapping and the charge retention in silicondioxide layers with embedded Ge- or Si-nanoclusters. The nanoclusters were formed by ion beam synthesis. Applying a dc bias to the conductive nano-tip charge injection into the dielectric was achieved. While SCM images visualize the localized trapped charge in the oxide, the locally recorded dC/dV versus V curves allow to quantify the trap density. The evaluation of dC/dV shifts was used to compare the electronic properties of different oxide layers in dependence on the implantation parameters. In addition it is demonstrated, that combined SCM/SCS measurements are a suitable tool for the examination of the charge decay as well as of the reliability and degradation of oxide layers on a nanoscale.
Multiply intersecting families of sets
Authors: Zoltán Füredi, Zsolt Katona
Venue: Journal of Combinatorial Theory Series A (2004)

Let [n] denote the set {1, 2, ...,n}, 2[n] the collection of all subsets of [n] and F ⊂ 2[n] be a family. The maximum of |F| is studied if any r subsets have an at least s-element intersection and there are no ρ subsets containing t + 1 common elements. We show that |F| ≤ Σi = 0t - s (n - s i) + t + ρ - s/t + 2 - s(n - s t + 1 - s) + ρ - 2 and this bound is asymptotically the best possible as n → ∞ and t ≥ 2s ≥ 2, r, ρ ≥ 2 are fixed.
Rapid Prototyping and Performance Analysis for CDMA2000
Authors: M. De Nobili, R. W. Stewart, G. C. Freeland
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

A cdma2000 physical layer compliant library for rapidprototyping and system modelling is presented in thispaper. The CDMA2000Lib for SystemView simulationenvironment provides all the functionality required fortransmitter and receiver design, building and testing.Different CDMA signal transmission scenarios areimplemented and simulated using the libraryýs functionalblocks (or tokens), in order to describe its features andbenefits. Single-pilot signals and signals with multiple codechannels are generated and analyzed in the time domain.An estimation of the Error Vector Magnitude (EVM)parameter is computed for a non-linear system model,represented by a Traveling Wave Tube Amplifier (TWTA).The amplifier transfer function is described and the CDMAsignal degradation is studied. A multipath Rayleigh fadingchannel model is considered and implemented to analyzeand study the behavior of a traditional rake receiverdemodulating a CDMA signal.
Coloured Text Pixel with Tile Based Methods for Computer Graphics Studies of Symmetric Patterns
Authors: Amer Salman, Rula Salman, Edwin Love
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

We have used computer graphics to generate, study and analysis more than 400 symmetrical patterns. We then identified common and rare pattern types. The study of geometry has always produced and continues to produce many beautiful symmetric forms. These patterns offer a rich source for exploration by artists and are also of interest to mathematicians, architects, archaeologists and others. The work in this paper discusses a new recipe using colour, text and symmetry to generate a unique construction, which richly illustrates and reflects the influence of the written word (e.g. poems or prose) whether random, symmetrical or recurring. In producing such a work of art we might hypothesise that once a item of literature is written it contains its own pattern of imaging and using symmetry we can explore this. It focuses on the rare type of patterns and it goes on to develop algorithm-based tilling that will be used to evolve our Java program.
Entropy Based Approach to Data Loss Reparation Through the Indeterminate Fine-Grained Parallel Computation
Authors: Ekaterina O. Nemenchinskaya, Yuri V. Kondratenko, Michael G. Sadovsky
Venue: Open Systems Information Dynamics (2004)

The new method of a gap recovery in symbol sequences is presented. A covering is combined from the suitable reasonably short strings of the parts of a sequence available for observation. Two criteria are introduced to choose the best covering. It must yield the maximum of entropy of a frequency dictionary developed over the sequence obtained due to the recovery, if an overlapping combined from the copies of strings from the available parts of the sequence exists. The second criterion identifies the best covering in case when one has to use any string to cover the gap; here the best covering must yield the minimum of specific entropy of the frequency dictionary developed over the available parts of the sequence against the one developed over the entire sequence obtained due to the recovery. Kirdin kinetic machine which is the ideal fine-grained structureless computer has been used to resolve the problem of the reconstruction of a gap in symbol sequence.
Resource selection for domain-specific cross-lingual IR
Authors: Monica Rogati, Yiming Yang
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

An under-explored question in cross-language information retrieval (CLIR) is to what degree the performance of CLIR methods depends on the availability of high-quality translation resources for particular domains. To address this issue, we evaluate several competitive CLIR methods - with different training corpora - on test documents in the medical domain. Our results show severe performance degradation when using a general-purpose training corpus or a commercial machine translation system (SYSTRAN), versus a domain-specific training corpus. A related unexplored question is whether we can improve CLIR performance by systematically analyzing training resources and optimally matching them to target collections. We start exploring this problem by suggesting a simple criterion for automatically matching training resources to target corpora. By using cosine similarity between training and target corpora as resource weights we obtained an average of 5.6% improvement over using all resources with no weights. The same metric yields 99.4% of the performance obtained when an oracle chooses the optimal resource every time.
A Method to Evaluate Logic Functions in the Presence of Unknown Inputs Using LUT Cascades
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In logic simulation, we often need to evaluate two-valuedlogic functions in the presence of unknown inputs. However,a naive method often produces imprecise results. Inthese cases, we can obtain precise values by evaluating theregular ternary logic function for the given two-valued logicfunction. This paper shows a hardware realization of regularternary logic functions. We use look-up table (LUT) cascadesto implement double-rail logic representation. Theevaluation time for n-input logic function is O(n) They requiremuch smaller amount of hardware than naive memory implementations.
Fitting and Manipulating Freeform Shapes by Extendable Freeform Templates
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Finding effective and efficient methods to fit andmanipulate an existing freeform shape is one of thestate-of-the-art topics in computer-aided design.Although general approaches give satisfied results, thecomputation time and the complexity often preventtheir further developments in more complex casesespecially in reusing an existing design. In this paper,for a better control of existing freeform shapes, featurebased deformable freeform templates are introducedas the bridge between user actions and the existingfreeform shapes. By the advantage of the small numberof intrinsic parameters, existing freeform shapes arequickly approximated by the deformable templates.Based on the extendable concept, those deformabletemplates are further developed to match complexfreeform shapes. With the distance and the projectionmapping, the original shape and the approximatedtemplate are associated. Thus, further shapemanipulations can be conducted effectively using theshape intrinsic parameters. Numerical experiments areconducted in order to verify the proposed algorithms.It is also described how the matching technique can beapplied in computer graphics and computer-aideddesign applications.
FRTR: A Scalable Mechanism for Global Routing Table Consistency
Authors: Lan Wang, Daniel Massey, Keyur Patel, Lixia Zhang
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR),for detecting and correcting route inconsistencies between neighboring BGProuters. The large size of today's global routing table makes the conventional periodic update approach, used by most routing protocols, infeasible. FRTR letsneighboring routers periodically exchange Bloom filter digests of their routing state.The digest exchanges not only enable the detection of potential inconsistencies during normal operations, but also speed up recoveryafter a BGP session reset. FRTR achieves low bandwidth overhead by using small digests,and it achieves strong consistency by "salting" the digests with random seeds to remove false-positives. Our analysis and simulation results show that, with one round of message exchanges, FRTR can detect and recover over 91%of random errors that the current BGP would havemissed with an overhead as low as 1.3% of a full routing table exchange. With salted digests FRTR can detect and recover all the errors with a probability close to100% after a few rounds of message exchanges.
Verification of Scanned Engineering Parts with CAD Models Based on Discrete Curvature Estimation
Venue: Proceedings of the Shape Modeling International 2004 (2004)

The manufacturing industry constantly needs to verifymachined objects against their original CAD models.Given a prototype design, an engineer should be able todetermine whether the part was manufactured well, that is,whether it fits the CAD model exactly. However, derivativecomputations are unstable for real data, and the estimatedcurvature is thus very sensitive to noise. Moreover, inmany cases, spatial fitting of corresponding points is notsufficient. The current work utilizes the curvatureproperties to inspect a manufactured part.
Using Semi-Implicit Representation of Algebraic Surfaces
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In [3] we introduced a new general representation of algebraicsurfaces, that we called semi-implicit, which encapsulatesboth usual and less known surfaces. Here we specializethis notion in order to apply it in Solid Modeling: weview a surface in ¿^3 as a one-parameter (algebraic) familyof algebraic low-degree curves. The paper mainly addressesthe topic of performing the usual CAD operationswith semi-implicit representation of surfaces.We derive formulaefor computing the normal and the curvatures at a regularpoint. We provide exact algorithms for computing selfintersectionsof a surface and more generally its singularlocus.We also present some surface/surface intersection algorithmsrelying on generalized resultant calculations.
MAS Dynamics on Stage
Authors: N. Baerten, J. Braspenning
Venue: Virtual Reality (2003)

We aim to explore a new kind of user interface solely dedicated to presenting the global inner dynamics of Multi-Agent Systems (MASs) on a higher level. Being complex systems, MASs are often only or barely understood by their designer(s). Could we enable a particular kind of agent to tell the designer&#x2019;s story about the agent- and human-interactive behaviours taking place inside the MAS in a meaningful way? Could a set of virtual actors turn this story into a &#x2018;dynamic user-experience&#x2019;? After taking a closer look at how to gain insight into complex systems and why to pick a drama-based approach, we present the three pillars of perception, interpretation and presentation, on which we base our visualisation efforts. We show how they relate to various research fields such as agent technology, human computer interaction, psychology, computer graphics, animation, drama, body language and cognitive ergonomics. Based upon these insights we introduce a conceptual model for drama-based visualisation, followed by a stepwise description of how this framework could be applied. The article closes with some reflections and conclusions.