ppxscal/embedding_network huggingface dataset:
The Tight Span of an Antipodal Metric Space: Part II&#x2014;Geometrical Properties
Authors: Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
Venue: Discrete Computational Geometry (2004)

Suppose that X is a finite set and let &#x211d;X denote the set of functions that map X to &#x211d;. Given a metric d on X, the tight span of (X,d) is the polyhedral complex T(X,d) that consists of the bounded faces of the polyhedron [P(X,d) := {f &#x2208; &#x211d;X : f(x)+f(y) &#x2265; d(x,y)}.] In a previous paper we commenced a study of properties of T(X,d) when d is antipodal, that is, there exists an involution &#x03c3;: X&#x2192; X: x&#x21a6; $\overline{x}$ so that d(x,y)+d(y,$\overline{x}$)=d(x,$\overline{x}$) holds for all x,y &#x2208; X. Here we continue our study, considering geometrical properties of the tight span of an antipodal metric space that arise from a metric with which the tight span comes naturally equipped. In particular, we introduce the concept of cell-decomposability for a metric and prove that the tight span of such a metric is the union of cells, each of which is isometric and polytope isomorphic to the tight span of some antipodal metric. In addition, we classify the antipodal cell-decomposable metrics and give a description of the polytopal structure of the tight span of such a metric.
A nonparametric hierarchical bayesian framework for information filtering
Authors: Kai Yu, Volker Tresp, Shipeng Yu
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Information filtering has made considerable progress in recent years. The predominant approaches are content-based methods and collaborative methods. Researchers have largely concentrated on either of the two approaches since a principled unifying framework is still lacking. This paper suggests that both approaches can be combined under a hierarchical Bayesian framework. Individual content-based user profiles are generated and collaboration between various user models is achieved via a common learned prior distribution. However, it turns out that a parametric distribution (e.g. Gaussian) is too restrictive to describe such a common learned prior distribution. We thus introduce a nonparametric common prior, which is a sample generated from a Dirichlet process which assumes the role of a hyper prior. We describe effective means to learn this nonparametric distribution, and apply it to learn users' information needs. The resultant algorithm is simple and understandable, and offers a principled solution to combine content-based filtering and collaborative filtering. Within our framework, we are now able to interpret various existing techniques from a unifying point of view. Finally we demonstrate the empirical success of the proposed information filtering methods.
Smarandache-Galois fields
Authors: W. B. Vasantha Kandasamy
Venue: Smarandache Notions Journal (2004)

In this paper we study the notion of Smarandache-Galois fields and homomorphism and the Smarandache quotient ring. Galois fields are nothing but fields having only a finite number of elements. We also propose some interesting problems.
Sub-quadratic convergence of a smoothing Newton algorithm for the P0&#x2013; and monotone LCP
Authors: Zheng-Hai Huang, Liqun Qi, Defeng Sun
Venue: Mathematical Programming: Series A and B (2004)

Given *** equation here ***, the linear complementarity problem (LCP) is to find *** equation here *** such that (x, s)&#x2265; 0,s=Mx+q,xTs=0. By using the Chen-Harker-Kanzow-Smale (CHKS) smoothing function, the LCP is reformulated as a system of parameterized smooth-nonsmooth equations. As a result, a smoothing Newton algorithm, which is a modified version of the Qi-Sun-Zhou algorithm [Mathematical Programming, Vol. 87, 2000, pp. 1&#x2013;35], is proposed to solve the LCP with M being assumed to be a P0-matrix (P0&#x2013;LCP). The proposed algorithm needs only to solve one system of linear equations and to do one line search at each iteration. It is proved in this paper that the proposed algorithm has the following convergence properties: (i) it is well-defined and any accumulation point of the iteration sequence is a solution of the P0&#x2013;LCP; (ii) it generates a bounded sequence if the P0&#x2013;LCP has a nonempty and bounded solution set; (iii) if an accumulation point of the iteration sequence satisfies a nonsingularity condition, which implies the P0&#x2013;LCP has a unique solution, then the whole iteration sequence converges to this accumulation point sub-quadratically with a Q-rate 2&#x2013;t, where t&#x2208;(0,1) is a parameter; and (iv) if M is positive semidefinite and an accumulation point of the iteration sequence satisfies a strict complementarity condition, then the whole sequence converges to the accumulation point quadratically.
AZuRE, a Scalable System for Automated Term Disambiguation of Gene and Protein Names
Authors: Raf M. Podowski, John G. Cleary, Nicholas T. Goncharoff, Gregory Amoutzias, William S. Hayes
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Researchers, hindered by a lack of standard gene and protein-naming conventions, endure long, sometimes fruitless, literature searches. A system is described which is able to automatically assign gene names to their LocusLink ID (LLID) in previously unseen MEDLINE abstracts. The system is based on supervised learning and builds a model for each LLID. The training sets for all LLIDs are extracted automatically from MEDLINE references in the LocusLink and SwissProt databases. A validation was done of the performance for all 20,546 human genes with LLIDs. Of these, 7,344 produced good quality models (F-measure > 0.7, nearly 60% of which were > 0.9) and 13,202 did not, mainly due to insufficient numbers of known document references. A hand validation of MEDLINE documents for a set of 66 genes agreed well with the systemýs internal accuracy assessment. It is concluded that it is possible to achieve high quality gene disambiguation using scaleable automated techniques.
Smarandache near-rings and their generalizations
Authors: W. B. Vasantha Kandasamy
Venue: Smarandache Notions Journal (2004)

In this paper we study the Smarandache semi-near-ring and near-ring, homomorphism, also the Anti-Smarandache semi-near-ring. We obtain some interesting results about them, give many examples, and pose some problems. We also define Smarandache semi-near-ring homomorphism.
Textual Difference Visualization of Multiple Search Results utilizing Detail in Context
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

While searching documents on the web users often refinetheir query terms, to generate new result lists and exploredifferent pages, thus they end up with several result sets.Experience suggests that users compare these different sets,either implicitly or explicitly. Comparison between thesesets (a) allows users to observe similarities and differencesthat are not innately viewable by viewing the sets separately,(b) reduces the cognitive effort of switching fromone result set to another and (c) enables them to browsemore effectively. In this paper we investigate comparisonvisualization and describe a prototype search-enginesimilarity tool (SES), which visualizes the textual differenceof multiple web searches using a combination of multipleviews and visual bracketing.
Functional Validation of Programmable Architectures
Authors: Prabhat Mishra, Nikil Dutt
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Validation of programmable architectures, consisting of processor cores, coprocessors, and memory subsystems, is one of the major bottlenecks in current System-on-Chip design methodology. A critical challenge in validation of such systems is the lack of a golden reference model. Traditional validation techniques employ different reference models depending on the abstraction level and verification task (e.g., functional simulation or property checking), resulting in potential inconsistencies between multiple reference models. This paper presents a validation methodology that uses an Architecture Description Language (ADL) based specification as a golden reference model for validation of programmable architectures, and generation of executable models such as simulators and hardware prototypes. We present a validation framework that uses the generated hardware as a reference model to verify the hand-written implementation using a combination ofsymbolic simulation and equivalence checking. We also present functional coverage based test generation techniques for validation of pipelined processor architectures. Finally, the generated simulator and hardware models are also used for early exploration of programmable architectures.
Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
Authors: Martin Prei&#x00df;, Josef Stoer
Venue: Mathematical Programming: Series A and B (2004)

We consider semidefinite monotone linear complementarity problems (SDLCP) in the space *** equation here *** n of real symmetric n&#x00d7;n-matrices equipped with the cone *** equation here *** n+ of all symmetric positive semidefinite matrices. One may define weighted (using any M&#x2208; *** equation here *** n++ as weight) infeasible interior point paths by replacing the standard condition XY=rI, r>0, (that defines the usual central path) by (XY+YX)/2=rM. Under some mild assumptions (the most stringent is the existence of some strictly complementary solution of (SDLCP)), these paths have a limit as r&#x2193;0, and they depend analytically on all path parameters (such as r and M), even at the limit point r=0.
Verifying process models built using parameterized state machines
Authors: Barbara Staudt Lerner
Venue: ACM SIGSOFT Software Engineering Notes (2004)

Software process and work flow languages are increasingly used to define loosely-coupled systems of systems. These languages focus on coordination issues such as data flow and control flow among the subsystems and exception handling activities. The resulting systems are often highly concurrent with activities distributed over many computers. Adequately testing these systems is not feasible due to their size, concurrency, and distributed implementation. Furthermore, the concurrent nature of their activities makes it likely that errors related to the order in which activities are interleaved will go undetected during testing. As a result, verification using static analysis seems necessary to increase confidence in the correctness of these systems. In this paper, we describe our experiences applying LTSA to the analysis of software processes written in Little-JIL. A key aspect to the approach taken in this analysis is that the model that is analyzed consists of a reusable portion that defines language semantics and a process-specific portion that uses parameterization and composition of pieces of the reusable portion to capture the semantics of a Little-JIL process. While the reusable portion was constructed by hand, the parameterization and composition required to model a process is automated. Furthermore, the reusable portion of the model encodes the state machines used in the implementation of the Little-JIL interpreter. As a result, analysis is based not just on the intended semantics of the Little-JIL constructs but on their actual execution semantics. This paper describes how Little-JIL processes are translated into models and reports on analysis results, which have uncovered seven errors in the Little-JIL interpreter that were previously unknown as well as an error in a software process that had previously been analyzed with a different approach without finding the error.
The Complexity of Treelike Systems over "-Local Formulae
Authors: Nicola Galesi, Neil Thapen
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

We describ e a system LK(c[\lambda]) for refuting CNFformulae, as a restriction of the sequent calculus inwhich every formula in a sequent is defined over atmost \lambda variables. This further generalizes the systemRes(k), a generalization of Resolution to k-DNF introducedin [9]. We adapt the Pudlák-Impagliazzo game([11]) to prove lower bounds for treelike LK(c[\lambda]). Weshow that dynamic satisfiability, which was introducedin [6] to study resolution space complexity, is a sufficient"but not necessary" condition to obtain exponential lower bounds.
Acquisition of Spherical Image by Fish-eye Conversion Lens
Authors: Shigang Li, Masao Nakano, Norishige Chiba
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

In this paper, we propose a novel method of calibrating aspherical image capture system which acquires spherical imagesby using a pair of fish-eye conversion lenses with the field ofview more than hemisphere, respectively. We first exploit thevanishing points for estimating internal parameters of a camerawith the fish-eye conversion lens and the relative orientationbetween the both of fish-eye cameras. Then, these parametersare refined by computing the correlation of the overlapping partsof the two images.
An integrated Lisp programming environment
Authors: Harald Wertz
Venue: ACM SIGSOFT Software Engineering Notes (1983)

We are currently implementing a system to help experienced programmers during the development, implementation and debugging of their programs. This system, built on top of a screen oriented structural editor, offers possibilities to attach descriptors to every portion of the program and to maintain - simultaneously - different versions of the program being written, including tentative hypothetical versions. It comprises a mecanism to maintain minimal consistency between modified parts of code, the non-modified parts of code and the attached descriptors, as well as an evaluation module functioning in different modes: normal evaluation, symbolic evaluation and checking evaluation. The standard programming aids, such as indexors, pretty printers, trace packages, undo- and history-facilities are generalized to handle the descriptors and unfinished programs as well
A New Method of Secondary Structure Assignment Based on the Delaunay Tessellation of Protein Structures
Authors: Todd Taylor, Iosif Vaisman
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

A five element descriptor derived from the Delaunay tessellation of a protein structure can be assigned to each residue in the protein. The descriptor characterizes main chain topology in the neighborhood of the residue. Rules which accurately map it to the DSSP secondary structure assignment can be devised, which is surprising because the descriptor does not explicitly depend on any angles, lengths, areas, or putative hydrogen bonds, nor does it contain information or internal residue geometry.
The development and evaluation of a software prototype for computer-adaptive testing
Authors: M. Lilley, T. Barker, C. Britton
Venue: Computers Education (2004)

This paper presents ongoing research at the University of Hertfordshire on the use of computer-adaptive tests (CATs) in Higher Education. A software prototype based on Item Response Theory has been developed and is described here. This application was designed to estimate the level of proficiency in English for those students whose first language is not English. Academic staff and students evaluated the prototype introduced here and we summarise their attitude to the user interface and to pedagogical aspects of the prototype. We provide evidence that learners are not disadvantaged by the CAT approach, based on a comparison of performance between CAT and computer-based tests. A group of international students also took part in a focus group session after using the software. During this session, students discussed issues related to computer-adaptive tests, ranging from their perception that very easy tests are "meaningless" to their insights into the fairness of such computer-assisted assessments.In addition, this paper outlines how our current work will be developed further by implementing multimedia resources, developing more subjective tests and adding a stop condition associated with the calculation of standard error. Finally, the benefits and potential limitations of this method of assessment are also presented here.
Expressive interfaces
Authors: Antonio Camurri, Barbara Mazzarino, Gualtiero Volpe
Venue: Cognition, Technology and Work (2004)

Analysis of expressiveness in human gesture can lead to new paradigms for the design of improved human-machine interfaces, thus enhancing users&#x2019; participation and experience in mixed reality applications and context-aware mediated environments. The development of expressive interfaces decoding the highly affective information gestures convey opens novel perspectives in the design of interactive multimedia systems in several application domains: performing arts, museum exhibits, edutainment, entertainment, therapy, and rehabilitation. This paper describes some recent developments in our research on expressive interfaces by presenting computational models and algorithms for the real-time analysis of expressive gestures in human full-body movement. Such analysis is discussed both as an example and as a basic component for the development of effective expressive interfaces. As a concrete result of our research, a software platform named EyesWeb was developed (http://www.eyesweb.org). Besides supporting research, EyesWeb has also been employed as a concrete tool and open platform for developing real-time interactive applications.
Micro cutting of steel
Authors: J. Schmidt, H. Tritschler
Venue: Microsystem Technologies (2004)

Micro-cutting offers good potentialities in order to manufacture small and medium lot sizes of micro-parts with arbitary geometry at an economically reasonable expense. Either by direct machining or as a means to fabricate moulds for micro injection moulding, the major advantages turn out to be large removal rates, good compliance with tolerance ranges, high surface quality and a wide choice of materials which can be processed. Particularly if highly wear resistant materials are to be processed, as it is the case in mould fabrication for powder injection moulding, micro cutting of steel is a very eligible option. Consequently, the possibility to manufacture wear resistant micro structures of high aspect ratios by mechanical cutting is demonstrated with regard to its specific requirements in terms of transferability of the laboratory process into an industrial manufacturing process. Accordingly the paper focuses on process parameters and repeatability of machining results and machining capabilities.
Let's get physical: the learning benefits of interacting in digitally augmented physical spaces
Authors: Sara Price, Yvonne Rogers
Venue: Computers Education (2004)

The advent of wireless and pervasive technologies offers many opportunities for designing learning experiences that encourage children to explore, initiate and reflect. Novel forms of interactions can be developed, that exploit the 'physical' and the 'digital' in a diversity of ways that move beyond the 'desktop' genre of interactions. In this paper, we describe an approach for developing digitally augmented physical spaces. Our claim is that getting children to interact with the physical world, resulting in relevant augmented digital information appearing and which can subsequently be interacted with, is what can facilitate active learning. We describe three case studies where we developed such novel learning experiences, and explain how we were able to promote active and playful learning.
Resolution-Based Decision Procedures for the Positive Theory of Some Finitely Generated Varieties of Algebras
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In this paper we give resolution-based decision proceduresfor the positive theory of certain finitely-generatedvarieties of algebras. The method is based on the existenceof natural dualities for such classes of algebras.
Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies
Authors: Mudhakar Srivatsa, Bugra Gedik, Ling Liu
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

The peer to peer (P2P) file sharing systems such as Gnutella havebeen widely acknowledged as the fastest growing Internet applicationsever. The P2P model has many potential advantages dueto the design flexibility of overlay networks and the serverlessmanagement of cooperative sharing of information and resources.However, these systems suffer from the well-known performancemismatch between the randomly constructed overlay network topologyand the underlying IP layer topology for packet routing. Thispaper proposes to structure the P2P overlay topology using a capacity-awaremulti-tier topology to better balance load at peers with heterogeneouscapacities and to prevent low capacity nodes from downgradingthe performance of the system. To study the benefits andcost of the multi-tier capacity aware topology with respect to basicand advanced routing protocols, we also develop a probabilisticbroadening scheme for efficient routing, which further utilizescapacity-awareness to enhance the P2P routing performance of thesystem. We evaluate our design through simulations. The resultsshow that our multi-tier topologies alone can provide eight to tentimes improvements in the messaging cost, two to three orders ofmagnitude improvement in terms of load balancing characteristics,and seven to eight times lower topology construction and maintenancecosts when compared to Gnutellas random power-law topology.
A real-time shadow approach for an augmented reality application using shadow volumes
Authors: Michael Haller, Stephan Drab, Werner Hartmann
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

Shadows add a level of realism to a rendered image. Moreover, they are used as visual clues to determine spacial relationships and real-time shadows will gain importance in current real-time computer graphics applications for this reason. Twenty-five years ago, Crow published the shadow volume approach for determining shadowed regions of a scene. In this paper we present a modified real-time shadow volume algorithm that can be used in an Augmented/Mixed Reality application. Finally, the proposed concepts provide a novel sense of visual output of an AR application.
Security Policy Reconciliation in Distributed Computing Environments
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

A major hurdle in sharing resources between organizationsis heterogeneity. Therefore, in order for two organizationsto collaborate their policies have to be resolved. Theprocess of resolving different policies is known as policyreconciliation, which in general is an intractable problem.This paper addresses policy reconciliation in the context ofsecurity. We present a formal framework and hierarchicalrepresentation for security policies. Our hierarchical representationexposes the structure of the policies and leads toan efficient reconciliation algorithm. We also demonstratethat agent preferences for security mechanisms can be readilyincorporated into our framework. We have implementedour reconciliation algorithm in a library called the PolicyReconciliation Engine or PRE. In order to test the implementationand measure the overhead of our reconciliationalgorithm, we have integrated PRE into a distributed high-throughputsystem called Condor.