ppxscal/embedding_network huggingface dataset:
Classifying racist texts using a support vector machine
Authors: Edel Greevy, Alan F. Smeaton
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this poster we present an overview of the techniques we used to develop and evaluate a text categorisation system to automatically classify racist texts. Detecting racism is difficult because the presence of indicator words is insufficient to indicate racist texts, unlike some other text classification tasks. Support Vector Machines (SVM) are used to automatically categorise web pages based on whether or not they are racist. Different interpretations of what constitutes a term are taken, and in this poster we look at three representations of a web page within an SVM -- bag-of-words, bigrams and part-of-speech tags.
Requirements for the Visualisation of Ontological Evolution
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

Ontology evolution is one of the key problems facingontology users today. Adapting ontologies to meet newrequirements involves understanding various sections ofontologies and the changes made thereafter. Currently, alarge amount of research has been undertaken in automaticchange detection and change effects, however the process isfar from automated. Users are involved at almost every stepand with ontologies becoming more commonplace and complex,tools are required to lighten the large cognitive load.We present the requirements and needs for a visualisationsolution in order to streamline ontology evolution.
Dynamic Web Service Invocation Based on UDDI
Authors: JianJun Yu, Gang Zhou
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

With the development of web technology and e-business, Web Service has been widely accepted by industry and academic research. How to find and integrate existing Web Service has become more and more important. Usually Service Requestor finds Web Service from UDDI Registry center and invokes it directly as described in Service-Oriented Architecture. But it's difficult for an enterprise user to dynamically invoke the most appropriate Web Service among a series of services with the same function. This paper briefly introduces Service-Oriented Architecture and discusses advantages and disadvantages of UDDI, then puts forward a dynamic Web Service framework that extends the Service-Oriented Architecture. Finally the paper analyzes the applicability and characteristics of the new framework.
Automated Logic SER Analysis and On-Line SER reduction
Authors: Andre K. Nieuwland, Patrick Gindner
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

This paper presents a method for automated analysis ofa combinational circuit to find the most SEU sensitive path,and proposes a way to make this path more robust for SEUin a low cost way.
A Monte Carlo Sampling Method for Drawing Representative Samples from Large Databases
Authors: Hong Guo, Wen-Chi Hou, Feng Yan, Qiang Zhu
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Sampling is important in areas like data mining,OLAP, selectivity estimation, clustering, etc. It has alsobecome a necessity in social, economical, engineering,scientific, and statistical studies where databases are toolarge to handle. In this paper, a sampling method basedon the Metropolis algorithm is proposed. Unlike theconventional uniform sampling methods, this method isable to select objects consistent with the underlyingprobability distribution. It is a simple, efficient, andpowerful method suitable for all distributions. We haveperformed experiments to examine the qualities of thesamples by comparing their statistical properties withthe underlying population. The experimental resultsshow that the samples selected by our method are bonafide representative.
Achieving High Performance via Co-Designed Virtual Machines
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

A virtual machine (VM) uses software to support a virtual instruction set architecture on a hardware platform executing a native instruction set. By co-designing the hardware and software elements of a VM, and by using an implementation-dependent native instruction set, there will be many new opportunities for improved performance and flexibility. Because the hardware-supported instruction set is implementation dependent, performance optimizations can be more easily passed from software through to hardware, and performance feedback information can be more easily passed from hardware up to the software. Furthermore, optimizations can be performed by software dynamically, as the program runs. A codesigned virtual machine may include adaptive hardware performance features, continuous hardware performance feedback, and on-the-fly optimizing re-compilation by the VM. Hardware and software can cooperate in finding instruction level parallelism across large blocks of dynamic instructions, and can efficiently implement of a number of advanced microarchitecture techniques involving control independence, prediction, speculation, and cache hierarchy management.
Simple efficient load balancing algorithms for peer-to-peer systems
Authors: David R. Karger, Matthias Ruhl
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Koorde) P2P network. Both preserve Chord's logarithmic query time and near-optimal data migration cost.Consistent hashing is an instance of the distributed hash table (DHT) paradigm for assigning items to nodes in a peer-to-peer system: items and nodes are mapped to a common address space, and nodes have to store all items residing closeby in the address space.Our first protocol balances the distribution of the key address space to nodes, which yields a load-balanced system when the DHT maps items "randomly" into the address space. To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).Our second protocol aims to directly balance the distribution of items among the nodes. This is useful when the distribution of items in the address space cannot be randomized. We give a simple protocol that balances load by moving nodes to arbitrary locations "where they are needed." As an application, we use the last protocol to give an optimal implementation of a distributed data structure for range searches on ordered data.
Silicon surface treatments in advanced MOS gate processing
Authors: K. Chang, K. Shanmugasundaram, D. O. Lee, P. Roman, C.-T. Wu, J. Wang, J. Shallenberger, P. Mumbauer, R. Grant, R. Ridley, G. Dolny, J. Ruzyllo
Venue: Microelectronic Engineering (2004)

Selected aspects of Si surface treatments in MOS gate processing were investigated. The focus was on surface conditioning prior to high-k gate dielectric mist deposition in planar MOS gate configuration and gate oxidation of inside walls of the trench etched in Si substrate. In the former case integrated anhydrous HF chemical oxide etching process lowers EOT as compared to conventional dilute HF etch performed ex situ. Additional in situ step, the UV/NO re-growth of 0.5 nm thick slightly nitrided oxide, further limits formation of an interfacial oxide and decreases EOT. In the case of oxide grown on RIE-delineated surfaces in the trench no reliable gate oxide can be formed without slight etching of RIE damaged silicon surface. No significant difference between the use of sacrificial oxidation and UV/Cl2 slight etching of walls inside the trench was observed. Trench etching process itself appears to play dominant role in determining reliability of gate oxide in this case.
Cell phones in task based learning - Are cell phones useful language learning tools?
Authors: Patrick J. Kiernan, Kazumi Aizawa
Venue: ReCALL (2004)

Cell phones are now widespread in many countries including Japan where we teach, and are particularly popular among university students. Although they can be a distraction in the classroom, functions such as Internet access and e-mail capability have transformed them into sophisticated communication tools. But are they also potentially useful in language learning? While task-based approaches (Nunan, 1989) adapted to desktop e-mail are now a growing area of research in CALL (Greenfield, 2003; Gonzalez-Lloret, 2003), cell phones have yet to receive much attention. This paper reports on a classroom research project aimed at evaluating the use of mobile phones as tools for classroom learning. Freshman university students in intact EFL classes (2 elementary classes, 2 lower intermediate) were first surveyed regarding their cell phone use and pre-tested to assess their knowledge of certain target learning structures. Following this they were subdivided into three groups: (a) using cell phone text messages, (b) using computer e-mail, and (c) speaking. The learners were paired, trained with warm-up tasks, and given two further sets of tasks to complete (one in class and the other at home). The target vocabulary appeared in the initial narrative task. All messages sent while doing the tasks were saved for analysis. The speaking task pairs were recorded and samples were transcribed for comparison. Finally learners took a post-test the following week to assess short-term learning gains. This project drew attention to a number of potential advantages of mobile phones as well as highlighting some limitations, but overall suggested that mobile phones represent a language learning resource worthy of further investigation.
3D Object Recognition Using 2D Moments and HMLP Network
Authors: M. Y. Mashor, M. K. Osman, M. R. Arshad
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

This paper proposes a method for recognition and classification of 3D objects using 2D moments and HMLP network. The 2D moments are calculated based on 2D intensity images taken from multiple cameras that have been arranged using multiple views technique. 2D moments are commonly used for 2D pattern recognition. However, the current study proves that with some adaptation to multiple views technique, 2D moments are sufficient to model 3D objects. In addition, the simplicity of 2D momentýs calculation reduces the processing time for feature extraction, thus decreases the recognition time. The 2D moments were then fed into a neural network for classification of the 3D objects. In the current study, hybrid multi-layered perceptron (HMLP) network is proposed to perform the classification. Two distinct groups of objects that are polyhedral and free-form objects were used to access the performance of the proposed method. The recognition results show that the proposed method has successfully classified the 3D object with the accuracy of up to 100%.
Categories of fuzzy sets
Authors: C. L. Walker
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

In this paper we look at two categories, the category &#x2131; of fuzzy subsets and a quotient category &#x2131;/&#x2133; of fuzzy sets. The category &#x2131;/&#x2133; is an extension of the category of sets, and the standard constructions in fuzzy set theory arise naturally within this category.
A fast robust algorithm for the intersection of triangulated surfaces
Authors: H. Lo, X. Wang
Venue: Engineering with Computers (2004)

The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of triangulated surfaces. In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. An algorithm based on tracing the neighbours of intersecting triangles (TNOIT) is proposed to determine the intersection lines. Given the node numbers at the vertices of the triangles, the neighbour relationship is first established. A background grid is employed to limit the scope of searching for candidate triangles that may intersect. This will drastically reduce the time of geometrical checking for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. In the determination of intersection between two triangles, four fundamental cases are identified and treated systematically to enhance robustness and reliability. Tracing the neighbours for the determination of intersection lines not only greatly increases the efficiency of the process, it also improves the reliability as branching and degenerated cases can all be dealt with in a consistent manner on the intersecting surfaces concerned. Five examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm.
An Efficient Distributed Group Key Management Algorithm
Authors: S. Rahul, R. C. Hansdah
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

A key agreement protocol is an important part of asecure group communication system(SGCS) which providessecure message passing services to its members.Among the various distributed key agreement protocolsproposed in the literature, the tree-based group Diffie-Hellman(TGDH)protocol is the most efficient in termsof the number of keys that need to be maintained at eachmember and distribution of DH exponentiation operationsamong group members.In TGDH, on a groupchange, the group members need to perform betweenone and O(log¿n) exponentiation operations serially.Also, the messages that are passed during group keyagreement must be authenticated using digital signatures.In this paper, we propose a new key agreementprotocol which minimizes the number of exponentiationoperations at each member.The member join operationrequires only three members to perform one ortwo exponentiation operations each while the memberleave operation requires only two or five group membersto perform one or two exponentiation operationseach.This is achieved at the cost of O(log¿n) causalmessages per member leave operation.
Multiple Alignment of Rearranged Genomes
Authors: Aaron E. Darling, Bob Mau, Mark Craven, Nicole T. Perna
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The nature of large-scale evolutionary processes that shape genomes over time fundamentally differs from the forces governing local evolution within individual genes. Large-scale events such as horizontal transfer, genome rearrangements, gene duplication, and gene loss obscure the notion of orthology and have demanded new models of evolution. Whether or not explicitly designed to do so, multiple genome alignment tools must cope with such large-scale changes in addition to local changes such as nucleotide substitution and indels. Using simulated genomes containing both large and small-scale evolutionary changes, we present an alignment quality comparison of Mauve, a multiple genome aligner that considers large-scale evolutionary events, to alignments generated by other state-of-the-art genome alignment systems. Our results indicate that in the presence of large-scale rearrangement events, Mauve has superior accuracy.
Fast Robust Fingerprint Feature Extraction and Classification
Authors: H. O. Nyongesa, S. Al-Khayatt, S. M. Mohamed, M. Mahmoud
Venue: Journal of Intelligent and Robotic Systems (2004)

Automatic identification of humans based on their fingers is still one of the most reliable identification methods in criminal and forensic applications. Identification by fingerprint involves two processes: fingerprint feature extraction and feature classification. The basic idea of fingerprint feature extraction algorithms proposed is to locate the coarse features of fingerprints called singular-points using directional fields of the fingerprint image. The features are then classified by different types of neural networks. The &ldquo;five-class&rdquo; classification problem is addressed on the NIST-4 database of fingerprints. A maximum classification accuracy of 93.75% was achieved and the result shows a performance comparable to previous studies using either coarse features or the finer features called minutiae.
Stabilizing Explicit Methods in Spring-Mass Simulation
Authors: Mikio Shinya
Venue: Proceedings of the Computer Graphics International (2004)

Spring-mass simulations are widely used in the computeranimation of soft objects. Although such systems can be numericallysolved by either explicit or implicit methods, ithas been difficult to obtain stable results from the explicitmethods. This paper presents an easy way to stabilize explicitmethods in spring-mass simulations. The simulationprocedures are modeled as a linear digital system, and systemstability is mathematically defined. This allows us todevelop theories of simulation stability. The application ofthese theories to explicit methods allows them to become asstable as implicit methods.
Agent-Oriented Approach to DNA Computing
Authors: Grace Steele, Vojislav Stojkovic
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

DNA computing began in 1994 when Leonard Adleman [1], [2] showed that DNA computing was possible by solving the Traveling Salesman Problem on a DNA (molecule or chemical) computer. Since then, Adleman has demonstrated many times how to use the massive parallelism of billions of DNA strands to solve the toughest problems. Adlemanýs work has greatly influenced our work, however, our approach is different. Adlemanýs approach was chemical-oriented, while our approach is software agent-oriented based on modeling, simulation, visualization, and animation using the programming language Easel. We have tried to elevate Adlemanýs work by making it more applicable and all encompassing. The paper presents an agent-oriented approach to DNA computing using the Easel programming language. The Traveling Salesman Problem is used to demonstrate the idea and test the program.
Adaptive paging for a multifrontal solver
Authors: Olivier Cozette, Abdou Guermouche, Gil Utard
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

In this paper, we present a new way to improve performance of the factorization of large sparse linear systems which cannot fit in memory. Instead of rewriting a large part of the code to implement an out-of-core algorithm with explicit I/O, we modify the paging mechanisms in such a way that I/O are transparent. This approach will be helpful to study the key points for getting performance with large problems on under sized memory machines with an explicit out-of-core scheme. The modification is done thanks to the MMUM&MMUSSEL software tool which allows the management of the paging activity at the application level. We designed a first paging polic that is well adapted for the parallel multifrontal solver MUMPS We present here a study and we give our preliminary results.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Authors: Daniel A. Spielman, Shang-Hua Teng
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We present algorithms for solving symmetric, diagonally-dominant linear systems to accuracy ε in time linear in their number of non-zeros and log (κf (A) ε), where κf (A) is the condition number of the matrix defining the linear system. Our algorithm applies the preconditioned Chebyshev iteration with preconditioners designed using nearly-linear time algorithms for graph sparsification and graph partitioning.
Traps in Java
Authors: Jien-Tsai Chan, Wuu Yang, Jing-Wei Huang
Venue: Journal of Systems and Software (2004)

Though the Java programming language was designed with extreme care, there are still a few ambiguities and irregularities left in the language. The ambiguities are those issues that are not defined clearly in the Java language specification. The different results produced by different compilers on several example programs justify our observations. The irregularities are issues that often confuse programmers. It is hard for a confused programmer to write robust programs. Furthermore, a few issues of the Java language are left intentionally open to the compiler writers. Their effects on Java programs are discussed. The problems of ambiguity. irregularity, and dependence on implementations frequently trap an incautious Java programmer. Some suggestions and solutions for the problems are provided in this paper.
Implementing Pfairness on a Symmetric Multiprocessor
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

We consider the implementation of a Pfair scheduleron a symmetric multiprocessor (SMP). Simulations presented herein suggest that bus contention resulting from simultaneous scheduling decisions can substantially degrade performance. To correct this problem, we propose a staggered model for Pfair scheduling under which scheduling points are uniformly distributed over time.
A Java-Based Information Browsing System in a Remote Display Environment
Authors: Takuya Maekawa, Toshiaki Uemukai, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

In this paper, we describe our design and implementation of an information browsing system using Java-based cellular phones in a remote display environment which we have proposed. In this system, an application on a remote display displays various information for users, and a Java application on a cellular phone displays operational pages for users to operate the application on the remote display. Users can operate the application and browse information on the remote display by operating the corresponding operational pages on the cellular phone.
An Efficient Method for Human Face Recognition Using Wavelet Transform and Zernike Moments
Authors: Neo Han Foon, Ying-Han Pang, Andrew Teoh Beng Jin, David Ngo Chek Ling
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

This paper presents a novel method of combining Wavelet Transforms (WT) and Zernike Moments (ZM) as a feature vector for face recognition. Wavelet transform, with its approximate decomposition is used to reduce the noise and produce a representation in the low frequency domain, and hence making the facial images insensitive to facial expression and small occlusion. The Zernike Moments, on the other hand, is selected as feature extractor due to its robustness to image noise, geometrical invariants property and orthogonal property. The simulation results on Essex Database indicates that higher order degree of WT combine with ZM achieve better performance with respect to recognition rate rather than using WT or ZM alone. The optimum result is obtained for ZM of order 10 with Daubechies orthonormal wavelet filter of order 7 in the first decomposition level. It can achieve the verification of 94.26%.