ppxscal/embedding_network huggingface dataset:
Accommodating field-dependence: a cross-over study
Authors: Adrian Parkinson, James A. Redmond, Cathal Walsh
Venue: ACM SIGCSE Bulletin (2004)

In a previous study, it was found that field-independent learners performed significantly better than field-dependent learners in a web based and in a computerised text-based environment. It was decided to adapt both a web interface and a traditional text to accommodate the Field-dependent learner so as to try to reduce the disparity in performance with Field-independents. Seventy Information Systems students were initially assessed for Field-dependence/Field-independence cognitive style using the Group Embedded Figures Test (GEFT). The group of students was divided up randomly into two halves. In Session one, group 1 studied using a Web interface Modules 1 - 9 of an Introductory Course in Artificial Intelligence. Group 2 studied the same material in hard copy form only (Text). All studied the material for one hour per week for six weeks. They were then assessed in a one-hour exam. After a period of 7 weeks, in Session 2, Group 1 studied Modules 10 - 18 using Text while group two studied the same material using the Web interface. The results showed that the performance of Field-dependent individuals, be it in text or web, to be comparable to Field-independents.
Designing metaschemas for the UMLS enriched semantic network
Authors: Li Zhang, Yehoshua Perl, Michael Halper, James Geller
Venue: Journal of Biomedical Informatics (2003)

The enriched semantic network (ESN) has previously been presented as an enhancement of the semantic network (SN) of the UMLS. The ESN's hierarchy is a DAG (Directed Acyclic Graph) structure allowing for multiple parents. The ESN is thus more complex than the SN and can be more difficult to view and comprehend. We have previously introduced the notion of a metaschema for the SN as a compact abstraction to support SN comprehension. We extend the definition of metaschema to make it applicable to a DAG classification hierarchy, such as the one exhibited by the ESN. We specify the requirements for and describe the general process of deriving such a metaschema. We derive two particular metaschemas of the ESN based on a pair of partitious. These two metaschemas and their underlying partitions are compared. Both metaschemas serve as compact representations of the ESN, allowing for convenient viewing of its hierarchy and easier comprehension.
An Approach to Security and Privacy of RFID System for Supply Chain
Authors: Xingxin (Grace) Gao, Zhe (Alex) Xiang, Hao Wang, Jun Shen, Jian Huang, Song Song
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Radio Frequency Identification (RFID) is expected to become pervasive and ubiquitous, as it can be embedded into everyday items as smart labels. A typical scenario of exploiting RFID is supply chain. The RFID based supply chain management yields convenience, efficiency and productivity gains. However, RFID systems create new risks to security and privacy. This paper briefly presents the current solutions to RFID security and privacy. A new approach is then proposed, which exploits randomized read access control and thus prevents hostile tracking and man-in-the-middle attack. In addition, compared with current schemes that achieve the similar security level, the proposed approach dramatically decreases the computation load. Another benefit is that it is suitable for RFID systems with a large number of tags.
Implementation issues for a source level symbolic debugger
Authors: John D. Johnson, Gary W. Kenney
Venue: ACM SIGPLAN Notices (1983)

This paper deals with issuces that have emerged as a result of a successful implementation of a source level symbolic debugger for HP-1000 computer systems. By analyzing a user's thought processes during a debugging session we created a powerful and easy to use tool for program analysis.
Logic-based subsumption architecture
Authors: Eyal Amir, Pedrito Maynard-Zhang
Venue: Artificial Intelligence (2004)

We describe a logic-based AI architecture based on Brooks' subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL) and use independent theorem provers to derive each layer's outputs given its inputs. We implement the subsumption of lower layers by higher layers using nonmonotonic reasoning principles. In particular, we use circumscription to make default assumptions in lower layers, and nonmonotonically retract those assumptions when higher layers draw new conclusions. We also give formal semantics to our approach. Finally, we describe layers designed for the task of robot control and a system that we have implemented that uses this architecture for the control of a Nomad 200 mobile robot.Our system combines the virtues of using the represent-and-reason paradigm and the behavioral-decomposition paradigm. It allows multiple goals to be serviced simultaneously and reactively. It also allows high-level tasks and is tolerant to different changes and elaborations of its knowledge in runtime. Finally, it allows us to give more commonsense knowledge to robots. We report on several experiments that empirically show the feasibility of using fully expressive FOL theorem provers for robot control with our architecture and the benefits claimed above.
Emergence of adaptability to time delay in bipedal locomotion
Authors: Kunishige Ohgane, Shin-Ichiro Ei, Kudo Kazutoshi, Tatsuyuki Ohtsuki
Venue: Biological Cybernetics (2004)

Based on neurophysiological evidence, theoretical studies have shown that locomotion is generated by mutual entrainment between the oscillatory activities of central pattern generators (CPGs) and body motion. However, it has also been shown that the time delay in the sensorimotor loop can destabilize mutual entrainment and result in the failure to walk. In this study, a new mechanism called flexible-phase locking is proposed to overcome the time delay. It is realized by employing the Bonhoeffer&#x2013;Van der Pol formalism &#x2013; well known as a physiologically faithful neuronal model &#x2013; for neurons in the CPG. The formalism states that neurons modulate their phase according to the delay so that mutual entrainment is stabilized. Flexible-phase locking derives from the phase dynamics related to an asymptotically stable limit cycle of the neuron. The effectiveness of the mechanism is verified by computer simulations of a bipedal locomotion model.
Some Heresy Regarding Software Engineering
Authors: Robert L. Glass
Venue: IEEE Software (2004)

Different software application domains require different programming techniques.
Responding to Policies at Runtime in TrustBuilder
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Automated trust negotiation is the process of establishingtrust between entities with no prior relationship through theiterative disclosure of digital credentials. One approach tonegotiating trust is for the participants to exchange accesscontrol policies to inform each other of the requirementsfor establishing trust. When a policy is received at run-time,a compliance checker determines which credentialssatisfy the policy so they can be disclosed. In situationswhere several sets of credentials satisfy a policy and someof the credentials are sensitive, a compliance checker thatgenerates all the sets is necessary to insure that the negotiationsucceeds whenever possible. Compliance checkersdesigned for trust management do not usually generate allthe satisfying sets. In this paper, we present two practicalalgorithms for generating all satisfying sets given a compliancechecker that generates only one set. The ability togenerate all of the combinations provides greater flexibilityin how the system or user establishes trust. For example, theleast sensitive credential combination could be disclosedfirst. These ideas have been implemented in TrustBuilder,our prototype system for trust negotiation.
Insights on outsourcing
Authors: Aaron Marcus
Venue: interactions (2004)

What's in it for us? For them? Where are we headed?
Probability Profile Method " New Approach to Data Analysis in Tandem Mass Spectrometry
Authors: Andrey Gorin, Robert M. Day, Andrey Borziak, Michael B. Strader, Gregory B. Hurst, Tema Fridman
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Tandem mass spectrometry (MS/MS) is one of the leading proteomics technologies, applicable to a wide range of experiments involving composition analysis of protein mixtures. Currently only ~10-20% of MS/MS spectral data lead to the successful peptide identifications, and the rate of false positives remains to be high. We propose Probability Profile Method (PPM) as a new route for the development of MS/MS data analysis algorithms. The principal idea can be described as a probabilistic "labeling" of the individual peaks, or as a detailed analysis of the spectra leading to peak separation into specific categories (b-ion, y-ion, double charged b-ion, etc). PPM "assignments", conducted on large and diverse data sets (~60,000 spectra), indicate that a large majority of MS/MS peaks can be identified with a surprising level of confidence, providing the foundation for a range of novel algorithmic approaches: spectra can be edited by selecting desirable peak categories: overall characteristics of MS/MS spectra, such as parent ion charge or total number of the present ions, can be rapidly estimated with a high precision; labeled peaks of the same category (e.g. b-ions) can be efficiently connected into de novo tag peptides.
Evaluating high accuracy retrieval techniques
Authors: Chirag Shah, W. Bruce Croft
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Although information retrieval research has always been concerned with improving the effectiveness of search, in some applications, such as information analysis, a more specific requirement exists for high accuracy retrieval. This means that achieving high precision in the top document ranks is paramount. In this paper we present work aimed at achieving high accuracy in ad-hoc document retrieval by incorporating approaches from question answering(QA). We focus on getting the first relevant result as high as possible in the ranked list and argue that traditional precision and recall are not appropriate measures for evaluatin this task. We instead use the mean reciprocal rank(MRR) of the first relevant result. We evaluate three different methods for modifying queries to achieve high accuracy. The experiments done on TREC data provide support for the approach of using MRR and incorporating QA techniques for getting high accuracy in ad-hoc retrieval task.
Timed Uniform Consensus Resilient to Crash and Timing Faults
Authors: Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

&Delta;-timed uniform consensus is a stronger variant of the traditional consensus and it satisfies the following additional property: The correct process terminates its execution within a constant time &Delta; (&Delta;-timeliness), and no two processes decide differently (Uniformity). In this paper, we consider the &Delta;-timed uniform consensus problem in presence of f{t} crash processes and f{c} timing-faulty processes. This paper proposes a &Delta;-timed uniform consensus algorithms. The proposed algorithm is adaptive in the following sense: It solves the &Delta;-timed uniform consensus when at least f{t} + 1 correct processes exist in the system. If the system has less than f{t} + 1 correct processes, the algorithm cannot solve the &Delta;-timed uniform consensus. However, as long as f{t} + 1 processes are non-crashed, the algorithm solves (non-timed) uniform consensus. We also investigate the maximum number of faulty processes that can be tolerated. We show that any &Delta;-timed uniform consensus algorithm tolerating up to f{t} timing-faulty processes requires that the system has at least f{t} + 1 correct processes. This impossibility result implies that the proposed algorithm attains the maximal resilience about the number of faulty processes. We also show that any &Delta;-timed uniform consensus algorithm tolerating up to f{t} timing-faulty processes cannot solve the (non-timed) uniform consensus when the system has less than f{t} + 1 non-crashed processes. This impossibility result implies that our algorithm attains the maximum adaptiveness.
CSG Operations with Voxelized Solids
Authors: Pavol Novotny, Leonid I. Dimitrov, Milos Sramek
Venue: Proceedings of the Computer Graphics International (2004)

We present a new technique for CSG operations withvoxelized geometric objects, which are represented by truncateddiscrete distance fields supplemented by additionalinformation about the surface normal. The technique removesartifacts of straightforward volumetric CSG operationsby taking into account conditions for object representability,according to which sharp details are not correctlyrepresentable in discrete distance fields. The proposedtechnique solves this shortcoming by rounding edgesand other sharp details. It works at the voxel level withoutthe necessity for reconstruction of continuous object models.
An Evaluation of Advanced Multi-Components Expansion Method of LBM on Parallel Computer
Authors: Yuichi Hirokawa, Teruo Matsuzawa
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

We propose Advanced Multi-Components Expansion Method (AMCEM), which is a modification method of Lattice Boltzmann Method (LBM) to obtain multi-components LBM model from single component LBM model. This modification method has advantages in point of flexible application to various LBM models and possibility of coupling different LBM models. In this paper, we show an overview and verify analytical conservations of physical quantities and numerical results of AMCEM. Furthermore, we discuss parallel performance of AMCEM.
Remote experiments, re-versioning and re-thinking science learning
Authors: Eileen Scanlon, Chetz Colwell, Martyn Cooper, Terry Di Paolo
Venue: Computers Education (2004)

Science and engineering students' involvement in practical work contributes to the development of their understanding of the concepts and processes of science. The Practical Experimentation by Accessible Remole Learning (PEARL) project aimed to develop a system to enable students to conduct real-world experiments at a distance using a computer. We explored methods of extending the flexibility of laboratory teaching in terms of time and location, and of meeting the requirements of students with special needs. This involved the development of remote experiments at four Universities. This paper uses one of the four experiments, spectroscopy for introductory science in a distance learning setting, to illustrate the process of developing remote experiments. We describe the evaluation work leading to refinement of the design, and an assessment of the learning experience for students. This paper presents the findings of the validation phases of the project which have established the feasibility of the remote experiment approach.
Timing Analysis in Presence of Power Supply and Ground Voltage Variations
Authors: Rubil Ahmadi, Farid N. Najm
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Given the sensitivity of circuit delay to supply and ground voltagevalues, static timing analysis (STA) must take into account supplyvoltage variations. Existing STA techniques allow one to verifythe timing at different process corners which effectively only considers cases where all the supplies are low or all are high. Cases of mismatch between the supplies of driver and load are not considered. In practice, supply voltages are neither totally independentnor totally dependent. In this work, we consider the supply andground nodes of a logic gate to be either totally independent variables, or to be directly tied or connected to those of some other gate(s) in the circuit. We also assume that the exact supplyvoltage values are not known exactly, but that only upper/lowerbounds on them are known. In this framework, we propose newtiming models for logic gates and identify the worst-case voltagecon gurations for individual gates and for simple paths. We thengive an STA technique that provides the worst-case circuit delaytaking supply variations into account.
Multi-mesh of trees with its parallel algorithms
Authors: Prasanta K. Jana
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

In recent years the multi-mesh network [Proceedings of the Ninth International Parallel Processing Symposium, Santa Barbara, CA, April 25-28, 1995, 17; IEEE Trans. on Comput. 68 (5) (1999) 536] has created a lot of interests among the researchers for its efficient topological properties. Several parallel algorithms for various trivial and non-trivial problems have been mapped on this network. However, because of its O(n) diameter, a large class of algorithms that involves frequent data broadcast in a row or in a column or between the diametrically opposite processors, requires O(n) time on an n × n multi-mesh. In search of faster algorithms, we introduce, in this paper, a new network topology, called multi-mesh of trees. This network is built around the multi-mesh network and the mesh of trees. As a result it can perform as efficiently as a multi-mesh network and also as efficiently as a mesh of trees. Several topological properties, including number of links, diameter, bisection width and decomposition are discussed. We present the parallel algorithms for finding sum of n4 elements and the n2-point Lagrange interpolation both in O(log n) time. The solution of n2-degree polynomial equation, n2-point DFT computation and sorting of n2 elements are all shown to run in O(log n) time too. The communication algorithms one-to-all, row broadcast and column broadcast are also described in O(log n) time. This can be compared with O(n) time algorithms on multi-mesh network for all these problems.
Parameterized Complexity of Constraint Satisfaction Problems
Authors: Daniel Marx
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

We prove a parameterized analog of Schaeferýs DichotomyTheorem: we show that for every finite booleanconstraint family F, deciding whether a formula containingconstraints from F has a satisfying assignmentof weight exactly k is either fixed-parameter tractable(FPT) or W[1]-complete. We give a simple characterizationof those constraints that make the problem fixedparametertractable. The special cases when the formulais restricted to be bounded occurrence, bounded tree-widthor planar are also considered, it turns out that in thesecases the problem is in FPT for every constraint familyF.
An algorithm for the detection of faces on the basis of Gabor features and information maximization
Authors: Hitoshi Imaoka, Kenji Okajima
Venue: Neural Computation (2004)

We propose an algorithm for the detection of facial regions within input images. The characteristics of this algorithm are (1) a vast number of Gabor-type features (196,800) in various orientations, and with various frequencies and central positions, which are used as feature candidates in representing the patterns of an image, and (2) an information maximization principle, which is used to select several hundred features that are suitable for the detection of faces from among these candidates. Using only the selected features in face detection leads to reduced computational cost and is also expected to reduce generalization error. We applied the system, after training, to 42 input images with complex backgrounds (Test Set A from the Carnegie Mellon University face data set). The result was a high detection rate of 87.0%, with only six false detections. We compared the result with other published face detection algorithms.
Grids of Grids of Simple Services
Authors: Geoffrey Fox
Venue: Computing in Science and Engineering (2004)

The author describes how to build systems from service-oriented grids that let you build new grids by composing and adapting existing collections (libraries) of grids. The author also suggests some best practices for deciding how to architect services and package systems.
On zone-balancing of peer-to-peer networks: analysis of random node join
Authors: Xiaoming Wang, Yueping Zhang, Xiafeng Li, Dmitri Loguinov
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-to-peer (P2P) research [1], [2], [6], [19], [31], [36]. To bring analytical understanding into the various peer-join mechanisms, we study how zone-balancing decisions made during the initial sampling of the peer space affect the resulting zone sizes and derive several asymptotic results for the maximum and minimum zone sizes that hold with high probability.
Investigation of a relationship between refresh time and implantation overlap in capacitor region of P-MOS DRAM cell
Authors: Youn-Jang Kim, Jung-Hwan Lee, Yong-Cheol Jeong, Jeong-Ho Cho
Venue: Microelectronic Engineering (2004)

In this paper, we elaborated a relationship between the refresh time and the implantation overlap in capacitor region of planar P-MOS DRAM cell based on the retention time and the localized maximum electrical field. Several samples with different overlap distance from the implanted region in capacitor area and the edge of capacitor were prepared. It appeared that retention time enhanced about two times when the distance decreased from 0.13 to 0.05 µm due to reduced leakage current on the capacitor region. Raphael simulation revealed that the lowed local electric field resulted in reduction of leakage current.
From IR to Search, and Beyond
Authors: Ramana Rao
Venue: Queue (2004)

It's been nearly 60 years since Vannevar Bush's seminal Atlantic Monthly article, "As We May Think," portrayed the image of a scholar aided by a machine, "a device in which an individual stores all his books, records, and communications, and which is mechanized so that it may be consulted with exceeding speed and flexibility." Unmistakably in this is the technology now known as search by millions and known as information retrieval (IR) by tens of thousands. From that point in 1945 to now, when some 25 million Web searches an hour are served, a lot has happened.