ppxscal/embedding_network huggingface dataset:
A Signature-Based Liver Cancer Predictive System
Authors: Ray R. Hashemi, Joshua H. Early, Mahmood Bahar, Alexander A. Tyler, John F. Young
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The predictive system presented in this paper employs both SOM and Hopfield nets to determine whether a given chemical agent causes cancer in the liver. The SOM net performs the clustering of the training set and delivers a signature for each cluster. Hopfield net treats each signature as an exemplar and learns the exemplars. Each record of the test set is considered a corrupted signature. The Hopfield net tries to un-corrupt the test record using learned exemplars and map it to one of the signatures and consequently to the prediction value associated with the signature. Four pairs of training and test sets are used to test the system. To establish the validity of the new predictive system, its performance is compared with the performance of the Discriminant analysis and the Rough Sets methodology applied on the same datasets.
ModelGen: Model Independent Schema Translation
Authors: Paolo Atzeni, Paolo Cappellari, Philip A. Bernstein
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

A customizable and extensible tool is proposed to implement ModelGen, the model management operator that translates a schema from one model to another. A wide family of models is handled, by using a metamodel in which models can be succinctly and precisely described. The approach is novel because the tool exposes the dictionary that stores models, schemas, and the rules used to implement translations. In this way, the transformations can be customized and the tool can be easily extended.
A Classifier-based Text Mining Approach for Evaluating Semantic Relatedness Using Support Vector Machines
Authors: Chung-Hong Lee, Hsin-Chang Yang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The quantification of evaluating semantic relatedness among texts has been a challenging issue that pervades much of machine learning and natural language processing. This paper presents a hybrid approach of a text-mining technique for measuring semantic relatedness among texts. In this work we develop several text classifiers using Support Vector Machines (SVM) method to supporting acquisition of relatedness among texts. First, we utilized our developed text mining algorithms, including text mining techniques based on classification of texts in several text collections. After that, we employ various SVM classifiers to deal with evaluation of relatedness of the target documents. The results indicate that this approach can also be fitted to other research work, such as information filtering, and re-categorizing resulting documents of search engine queries.
Quantum-dot cellular automata SPICE macro model
Authors: Rui Tang, Fengming Zhang, Yong-Bin Kim
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper describes a SPICE model development methodology for Quantum-Dot Cellular Automata (QCA) cells and presents a SPICE model for QCA cells. The model is validated by simulating the basic logic gates such as inverter and majority voter. A full-adder is designed with QCA cells using the SPICE model as a test vehicle and the function is verified successfully. The proposed model makes it possible to design and simulate QCA combinational circuits and hybrid circuits of QCA and other NANO devices using SPICE.
The book as user interface: lowering the entry cost to email for elders
Authors: Scott Davidoff, Carson Bloomberg, Ian Anthony R. Li, Jennifer Mankoff, Susan R. Fussell
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Substantial stumbling blocks confront computer-illiterate elders. We introduce a novel user interface technology to lower these start up costs: the book as user interface, or BUI. Book pages contain both step-by-step instructions and tangible controls, turning a complex interaction into a walk-up-and-use scenario. The system expands support past the technical artifact to a go-to relationship. ElderMail users designate an internet-savvy trusted friend or relative to help with complex tasks. In this paper, we conduct a preliminary evaluation of a BUI-based email system, and report our findings. While research has augmented paper artifacts to provide alternate access into the digital world, we find that elders use the BUI as a way to circumvent the digital world.
Degree reduction for trigonometric functions
Authors: Mary H. Payne, Robert N. Hanek
Venue: ACM SIGNUM Newsletter (1983)

This report is a companion to Reference 1 on radian reduction. As in Reference 1, the motivation arises from a desire to eliminate messages like "argument too large" in trigonometric function routines. The presence of very large arguments in the VAX H format, on the Crayl, and on an IEEE machine with extended registers, make this a real problem. As for the radian reduction algorithm, the degree algorithm will reduce any argument, however large, so long as it is representable; its speed is nearly independent of the size of the argument to be reduced; and full accuracy is maintained in the neighborhoods of the zeros of the desired function. We believe that the approach is new and represents a significant improvement over procedures currently in use. A variant of the procedure is used in Version 3 of the VAX Math Library.
Web services considered harmful?
Authors: Rohit Khare, Jeff Barr, Mark Baker, Adam Bosworth, Tim Bray, Jeffery McManus
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

It has been estimated that all of the Web Services specifications and proposals ("WS-*") weigh in at several thousand pages by now. At the same time, their predecessor technologies such as XML-RPC have developed alongside other "grassroots" technologies like RSS. This debate has arguably even risen to the architectural level, contrasting "service-oriented architectures" with REST-based architectural styles. Unfortunately, the multiple overlapping specifications, standards bodies, and vendor strategies tend to obscure the very real successes of providing machine-automatable services over the Web today. This panel asks: Are current community processes for developing, debating, and adopting Web Services are helping or hindering the adoption of Web Services technology? URL: <http://labs.commerce.net/wiki/images/1/19/CN-TR-04-05.pdf.
The completeness of logic programming with sort predicates
Authors: Ken Kaneiwa
Venue: Systems and Computers in Japan (2004)

All order-sorted logic can be regarded as a generalized first-order predicate logic that includes many and ordered sorts (i.e., a sort-hierarchy). In the fields of knowledge representation and AI, this logic with sort-hierarchy has been used to design a logic-based language appropriate for representing taxonomic knowledge. By incorporating the sort-hierarchy, order-sorted resolution and sorted logic programming have been formalized that provide efficient reasoning mechanisms with structural representation. In this work, Beierle's group developed an order-sorted logic to couple separated taxonomic knowledge and assertional knowledge. Namely, its language allows us to make use of sorts to denote not only the types of terms but also unary predicates (called sort predicates). In this paper, we propose a sorted logic programming language with sort predicates in order to improve the practicability of the logic proposed by Beierle. The linear resolution is obtained by adding inference relative to sort predicates and subsort relations. In the semantics, the terms and formulas that follow the sorted signature extended with sort predicates are interpreted over its corresponding &Sigma;+-structures. Finally, we build the Herbrand models of programs containing sort predicates, and thus prove the soundness and completeness of this logic programming. &copy; 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 35(1): 37&ndash;46, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10409
Semantic and structural analysis of TV diving programs
Authors: Fei Wang, Jin-Tao Li, Yong-Dong Zhang, Shou-Xun Lin
Venue: Journal of Computer Science and Technology (2004)

Automatic content analysis of sports videos is a valuable and challenging task. Motivated by analogies between a class of sports videos and languages, the authors propose a novel approach for sports video analysis based on compiler principles. It integrates both semantic analysis and syntactic analysis to automatically create an index and a table of contents for a sports video. Each shot of the video sequence is first annotated and indexed with semantic labels through detection of events using domain knowledge. A grammar-based parser is then constructed to identify the tree structure of the video content based on the labels. Meanwhile, the grammar can be used to detect and recover errors during the analysis. As a case study, a sports video parsing system is presented in the particular domain of diving. Experimental results indicate the proposed approach is effective.
The Analysis of Large Order Bessel Functions in Gravitational Wave Signals from Pulsars
Authors: F. A. Chishtie, S. R. Valluri, K. M. Rao, D. Sikorski, T. Williams
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

In this work, we present the analytic treatment of the large order Bessel functions that arise in the Fourier Transform (FT) of the Gravitational Wave (GW) signal from a pulsar.Weoutline several strategies which employ asymptotic expansions in evaluation of such Bessel functions which also happen to have large argument. Large order Bessel functions also arise in the Peters-Mathews model of binary inspiralling stars emitting GW and several problems in potential scattering theory. Other applications also arise in a variety of problems in Applied Mathematics as well as in the Natural Sciences and present a challenge for High Performance Computing (HPC).
Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing
Authors: Andrew J. Page, Thomas J. Naughton
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynamically changing resources and adapts to variable system resources. It operates in a batch fashion and utilises a genetic algorithm to minimise the total execution time. We have compared our scheduler to six other schedulers, three batch-mode and three immediate-mode schedulers. We have performed simulations with randomly generated task sets, using uniform, normal, and Poisson distributions, whilst varying the communication overheads between the clients and scheduler. We have achieved more efficient results than all other schedulers across a range of different scenarios while scheduling 10,000 tasks on up to 50 heterogeneous processors.
Nonlinear analysis of steel frameworks through direct modification of member stiffness properties
Authors: L. Xu, Y. Liu, D. E. Grierson
Venue: Advances in Engineering Software (2005)

This paper presents a computer-based method for nonlinear analysis of planar steel frameworks under monotonic loading that is directly based on the matrix displacement method of analysis. Stiffness degradation factors progressively deteriorate the post-elastic bending, shearing and axial stiffness properties of framework members over an incremental load history until failure of part or all of the structure occurs. The analytical procedure is based on Timoshenko beam theory to allow for the analysis of frameworks for which effects of shear deformation on elastic behavior may be significant, and employs transcendental stability functions to model the effect of axial force on the bending stiffness of members. Also accounted for is the influence of residual stresses on the initial-yield and full-yield capacities of members, and the effect of both combined moment plus axial force and combined moment plus shear force on the post-elastic behavior of members. The nonlinear analysis method is applied for two benchmark planar steel structures, and it is shown to give results comparable to both experimental and analytical results previously published in the literature. The method is readily implemented on a computer using conventional matrix structural analysis techniques, and is directly applicable for the efficient nonlinear analysis of frameworks of any scale or complexity.
Covert two-party computation
Authors: Luis von Ahn, Nicholas Hopper, John Langford
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We introduce covert two-party computation, a stronger notion of security than standard secure two-party computation. Like standard secure two-party computation, covert two-party computation allows Alice and Bob, with secret inputs xA and xB respectively, to compute a function f(xA,xB) without leaking any additional information about their inputs. In addition, covert two-party computation guarantees that even the existence of a computation is hidden from all protocol participants unless the value of the function mandates otherwise. This allows the construction of protocols that return f(xA,xB) only when it equals a certain value of interest (such as "Yes, we are romantically interested in each other") but for which neither party can determine whether the other even ran the protocol whenever f(xA,xB) is not a value of interest. Since existing techniques for secure function evaluation always reveal that both parties participate in the computation, covert computation requires the introduction of new techniques based on provably secure steganography. We introduce security definitions for covert two-party computation and show that this surprising notion can be achieved by a protocol given the Decisional Diffie-Hellman assumption in the "honest but curious" model. Using this protocol as a subroutine, we present another protocol which is fair and secure against malicious adversaries in the Random Oracle Model --- unlike most other protocols against malicious adversaries, this protocol does not rely on zero-knowledge proofs (or similar cut-and-choose techniques), because they inherently reveal that a computation took place. We remark that all our protocols are of comparable efficiency to protocols for standard secure two-party computation.
Book review: Hard Disk Quick Reference by Motdton, P. D. & Stanley, Timothy S. (Que Corporation, 1989)
Venue: ACM SIGSMALL/PC Notes (1991)

The book is divided into eight chapters and five appendices. The book starts with basic information and definitions of hard disks and their controllers. Next the book covers the hardware installation of hard disks on the IBM PC/XT/AT computers. The description is intended to give the reader a general feel and an overview of the installation process. The book provides detailed layouts and descriptions to identify the various cables and to set the proper jumpers on the controllers. The books then describes the software installation process where the hard disk is formatted and partitioned. It is recommend that the reader follows the installation instructions provided by the manufacturer of his/her particular disk when actually instaling the disk. The book then provides numerous samples of configuration and start-up files as well as a brief description of RAM disks and Cache programs.
Best constant approximants in Lorentz spaces
Authors: F. E. Levis, H. H. Cuenya
Venue: Journal of Approximation Theory (2004)

In this paper, we give a characterization of best constant approximants in Lorentz spaces Lw,q, 1 ≤ q < ∞ and we establish a way to obtain the best constant approximants maximum and minimum. We also study monotony of the best constant approximation operator.
Tantrix TM rotation puzzles are intractable
Authors: Markus Holzer, Waltraud Holzer
Venue: Discrete Applied Mathematics (2004)

It is shown that the TANTRIXTM rotation puzzle can be used to emulate a circuit with AND- and NOT-gates. In particular, a rotation puzzle is constructed, that has a solution if and only if there exists an assignment to the input variables such that the corresponding circuit evaluates to true. This shows that the rotation puzzle is intractable, i.e., NP-complete. Moreover, we also consider infinite TANTRIXTM rotation puzzles. Based on a circuit construction, too, we show that in this case the problem becomes even worse, namely undecidable.
The case for technology for developing regions
Authors: Eric A. Brewer
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Moore's Law and the wave of technologies it enabled have led to tremendous improvements in productivity and the quality of life in the industrialized world. Yet, technology has had almost no effect on the four billion people that make less US$2000/day. In this talk I argue that the decreasing costs of computing and wireless networking make this the right time to spread the benefits of technology, and that the biggest missing piece is a lack of focus on the problems that matter, including health, education, and government. After covering some example applications that have shown very high impact, I take an early look at the research agenda for developing regions. Finally, I examine some of the pragmatic issues required to make progress on these very challenging problems. My goal is to convince high-tech researchers that technology for developing regions is an important and viable research topic.
The semantic webscape: a view of the semantic web
Authors: Juhnyoung Lee, Richard Goodwin
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

It has been a few years since the semantic Web was initiated by W3C, but its status has not been quantitatively measured. It is crucial to understand the status at this early stage, for researchers, developers and administrators to gain insight into what will come in this field. The objective of our work is to quantitatively measure and present the status of the semantic Web. We conduct a longitudinal study on the semantic Web pages to track trends in the use of semantic markup languages. This paper presents early results of this study with two historical data sets from October 2003 and October 2004. Our results show that while it is very early stage of semantic Web adoption, its growth outpaces that of the entire Web for the period. Also, RDF (Resource Description Framework) has dominated among semantic markup languages, taking about 98% of all semantic pages on the Web. It has been used in a variety of metadata annotation applications. This study shows that the most popular application is RSS (RDF Site Summary) for syndicating news and blogs, which takes more than 60% of all semantic Web pages. It also shows that the use of OWL (Web Ontology Language) which was recommended by W3C in early 2004 has been increased 900% for the period.
The GridSite Web-Grid security system: Research Articles
Authors: Andrew McNab
Venue: Software&mdash;Practice Experience (2005)

This paper describes the architecture of the GridSite system, which adds support for several Grid security protocols to the Apache Web server platform. These include the Globus GSI authentication system, Grid Access Control Language (GACL) access policy files, and Distinguished Name (DN) List and Virtual Organization Membership Service (VOMS) group memberships. Particular emphasis is placed on how the architecture of GridSite has evolved during the past 3 years, how this has been influenced by operational experience with production systems, and how the project has led to new developments, such as GACL. Finally, a description is given of how GridSite has been made to interoperate with other deployed security systems, both as producers and consumers of GridSite's authorization information. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Roughness Sense Display Representing Temporal Frequency Changes of Tactile Information in Response to Hand Movements
Authors: Masashi Konyo, Takashi Maeno, Akinori Yoshida, Satoshi Tadokoro
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We propose a hypothesis on mechanism of roughness perception based on temporal frequency changes of tactile information. Roughness sense can be considered as relative information to the hand velocity. Finite element analysis using human finger model showed that spatial information of the rough surface can be reflected in the temporal frequency changes at the position of tactile receptors. It should be important for roughness sense display to make a vibratory stimulation changing frequencies in response to the hand velocities.
Jabiru: Harnessing Java 3D Behaviors for Device and Display Portability
Authors: Julie N. Stromer, Gerald T. Quon, Paul M. K. Gordon, Andrei L. Turinsky, Christoph W. Sensen
Venue: IEEE Computer Graphics and Applications (2005)

Java 3D is a mature API for developing 3D applications, particularly in bioinformatics, where Java and Perl are the preferred programming languages due to their small learning curve and runtime multi-operating system support. We have wrapped a CAVE immersive 3D environment in Java 3D and have successfully ported several Java 3D applications originally created for desktop environments to this immersive environment.We have created Jabiru (Java 3D Application Behavior Immersive Virtual Reality Utilities), a package of extensible Java 3D graphics manipulation behaviors that is loadable (dynamically) into existing Java 3D applications. This is achieved at runtime via a plain text configuration file read by Java 3D's ConfiguredUniverse utilities. This enables existing Java 3D applications to transparently import functionality intended for virtual reality usage.