ppxscal/embedding_network huggingface dataset:
Incremental nonlinear PCA for classification
Authors: Byung Joo Kim, Il Kon Kim
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The purpose of this study is to propose a new online and nonlinear PCA(OL-NPCA) method for feature extraction from the incremental data. Kernel PCA(KPCA) is widely used for nonlinear feature extraction, however, it has been pointed out that KPCA has the following problems. First, applying KPCA to patterns requires storing and finding the eigenvectors of a kernel matrix, which is infeasible for a large number of data N. Second problem is that in order to update the eigenvectors with an another data, the whole eigenspace should be recomputed. OL-NPCA overcomes these problems by incremental eigenspace update method with a feature mapping function. According to the experimental results, which comes from applying OL-NPCA to a toy and a large data problem, OL-NPCA shows following advantages. First, OL-NPCA is more efficient in memory requirement than KPCA. Second advantage is that OL-NPCA is comparable in performance to KPCA. Furthermore, performance of OL-NPCA can be easily improved by re-learning the data. For classification extracted features are used as input for least squares support vector machine. In our experiments we show that proposed feature extraction method is comparable in performance to a Kernel PCA and proposed classification system shows a high classification performance on UCI benchmarking data and NIST handwritten data set.
Executing Temporal Logic Programs by Ben Moszkowski
Venue: Issue 98 (October 1986) (1986)

The influence of Japanese culture seems to creep out of the yuppies community extending to the remaining AI fans. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Projective virtual reality as a basis for on-line control of complex systems-not only-over the internet
Authors: Eckhard Freund, Jürgen Rossmann
Venue: Journal of Robotic Systems (2005)

Already in 1994 the term Projective Virtual Reality was coined and a first implementation was used to control a complex multirobot system in Germany over the Internet from California. Building on this foundation, the general aim of the development of virtual reality technology for automation applications at the Institute of Robotics Research (IRF) today is to provide the framework for Projective Virtual Reality for a broad range of applications. The general idea of Projective Virtual Reality is to allow users to &ldquo;project&rdquo; actions carried out in the virtual world into the real world by means of robots or other means of automation. The framework is based on a task-oriented approach which builds on the &ldquo;task deduction&rdquo; capabilities of a newly developed virtual reality system and a task planning component. The advantage of this approach is that robots which work at great distances from the control station can be controlled as easily and intuitively as robots that work right next to the control station. Robot control technology now provides the user in the virtual world with a &ldquo;prolonged arm&rdquo; into the physical environment, thus paving the way for intuitive control of complex systems over the Internet&mdash;and in general for a new quality of user-friendly man-machine interfaces for automation applications. Lately, this work has been enhanced by a new structure that allows one to distribute the virtual reality application over multiple computers on a network. With this new feature, it is now possible for multiple users to share the same virtual room, although they may physically be thousands of miles apart. They only need an Internet connection to share this new experience. Lately, the network distribution techniques have been further developed to not just allow users to cooperate over networked PCs but also to be able to set up a panorama projection or a cave running of a networked cluster of PCs. This approach cuts down the costs for such a high-end visualization environment drastically and allows for a new range of applications. &copy; 2005 Wiley Periodicals, Inc.
MACSYMA, a resource for the Navy Laboratories
Authors: Elizabeth Cuthill, Kenton Meals
Venue: ACM SIGNUM Newsletter (1978)

A tool that would be a welcome resource to any numerical analyst is one that would provide a convenient way of performing the laborious symbolic and numerical mathematics needed in the development and testing of algorithms. MACSYMA (Project MAC's Symbolic Manipulation System) [1] at MIT is beginning to fulfill this role for the Navy Laboratory community as a result of the recently established Navy Laboratory Computer Network.
Adobe InDesign Revealed
Authors: Chris Botello
Venue:  (2005)

Coverage includes- Written for beginner-to-intermediate level students and professionals who want to learn how to use the latest version of InDesign, Adobe's increasingly popular design layout software. Illustrates concepts and skills clearly with visually-stimulating graphics and a unique tutorial-based pedagogy. Allows readers to build their portfolio with multiple projects throughout the text such creating advertisements, brochures, and flyers, putting skills and concepts learned into a real-world context. Offers instruction on how to work in the latest release of InDesign using either Mac or PC platforms.
Mining web site's topic hierarchy
Authors: Nan Liu, C. Yang
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Searching and navigating a Web site is a tedious task and the hierarchical models, such as site maps, are frequently used for organizing the Web site's content. In this work, we propose to model a Web site's content structure using the topic hierarchy, a directed tree rooted at a Web site's homepage in which the vertices and edges correspond to Web pages and hyperlinks. Our algorithm for mining a Web site's topic hierarchy utilizes three types of information associated with a Web site: link structure, directory structure and Web pages' content.
Investigation of effect of depressant additives on hydraulic resistance and heat exchange in oil mixture flow
Authors: T. K. Aldyarov, U. K. Zhapbasbayev, G. I. Ramazanova
Venue: Mathematics and Computers in Simulation (2004)

The results of investigation of the laws of hydrodynamic resistance and heat exchange by the data of experimental-industrial tests of depressant additives and heat hydraulic calculation of the linear Kumkol-Karakoin section of the Kumkol-Chymkent main pipeline are presented. The empirical relations for hydrodynamic resistance and heat exchange coefficients of turbulent oil-mixture pipe flow with additives are established in consequence of generalization of the test data.
An effective learning of neural network by using RFBP learning algorithm
Authors: Yu-Ju Chen, Tsung-Chuan Huang, Rey-Chue Hwang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

In this paper, an effective learning of neural network by using random fuzzy back-propagation (RFBP) learning algorithm is developed. Based on this new learning algorithm, neural network not only has an accurate learning capability, but also can increase the probability of escaping from the local minimum while neural network is training. For demonstrating the new algorithm we developed has its outperformance, the classifications of the non-convex in two dimensions (NC2) problem are simulated. For comparison, the same simulations by using conventional back-propagation (BP) learning algorithm with constant pairs of learning rate (α = 0.1-0.9) and momentum (ξ = 0.1-0.9) and stochastic BP learning are also performed.
Scalability of a scheduling scheme for energy aware sensor networks: Research Articles
Authors: Duminda Dewasurendra, Amitabh Mishra
Venue: Wireless Communications Mobile Computing (2004)

Scalability of algorithms used in wireless sensor networks is a critical issue due to the extremely high node numbers and relatively high node density. Few recent studies analyze the scalability of algorithms in wireless ad-hoc networks. Yet there is no significant research done on scalability of algorithms used in wireless sensor networks. In this paper, we present a brief survey of recent research on scalability of protocols for wireless ad-hoc networks followed by a scalability analysis of a typical cross-layer scheduling scheme used to improve energy efficiency in wireless sensor networks. Results show severe degradations of per-node and per-flow throughput indicating that such scheduling algorithms used in wireless sensor networks are far less scalable than the algorithms used in their ad-hoc counterparts. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A Practical Packet Reordering Mechanism with Flow Granularity for Parallelism Exploiting in Network Processors
Authors: Beibei Wu, Yang Xu, Hongbin Lu, Bin Liu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

Network processors (NP) are usually designed to exploit packet level parallelism where system throughput is aggregated by multiple CPU cores. A serious problem in such a system is Packet Disordering (PD), which may deteriorate network performance greatly. To address the PD problem, a practical reordering mechanism is put forward in this paper. Different from the traditional reordering methods such as in ATM networks, it uses a centralcontrolled chain-based mechanism to implement packet reordering with flow granularity. We verify it in FPGA and carry out a series of experiments, where the results show that system throughput can be influenced greatly by traffic patterns. We also demonstrate that the reordering with flow granularity is quite requisite in NP, which can increase the system throughput to a great extent compared to the conventional method with global granularity.
Validating key constraints over XML document using XPath and structure checking
Authors: Yunfeng Liu, Dongqing Yang, Shiwei Tang, Tengjiao Wang, Jun Gao
Venue: Future Generation Computer Systems (2005)

Although key definitions are adopted by XML Schema, validating hierarchical key constraints over XML document faces many difficult problems. The paper begins by proposing a systematic architecture for efficient XML key validation and incremental validation using XPath and structure checking. We propose a key value document generation algorithm and present how a key value document and its schema can be designed to check whether predefined key constraints are satisfied. Then we present a novel method that can support incremental validation of XML key constraints by incremental maintenance of key value document.
Robust Identification of Fuzzy Duplicates
Authors: Surajit Chaudhuri, Venkatesh Ganti, Rajeev Motwani
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Detecting and eliminating fuzzy duplicates is a critical data cleaning task that is required by many applications. Fuzzy duplicates are multiple seemingly distinct tuples which represent the same real-world entity. We propose two novel criteria that enable characterization of fuzzy duplicates more accurately than is possible with existing techniques. Using these criteria, we propose a novel framework for the fuzzy duplicate elimination problem. We show that solutions within the new framework result in better accuracy than earlier approaches. We present an efficient algorithm for solving instantiations within the framework. We evaluate it on real datasets to demonstrate the accuracy and scalability of our algorithm.
Building an information security education program
Authors: Rayford B. Vaughn, David A. Dampier, Merrill B. Warkentin
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

Information and computer security is a topic that has grown significantly in popularity in the last few years. With the increased level of funding for IT security research, and the support of information assurance education through the Information Assurance Scholarship Program (IASP) and the Scholarship for Service (SFS) program, information assurance education is enjoying a great period of growth in the U.S. Mississippi State University has embraced these programs and is responding with a slate of new information security courses designed to prepare students to serve as security engineers in either government service or in private industry.
Efficient Application of Modern Logic Synthesis in FPGA-Based Designing of Information and Signal Processing Systems
Authors: Henry Selvaraj, Pawel Tomaszewicz, Mariusz Rawski, Tadeusz Luba
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The goal of this paper is to promote application of logic synthesis methods and tools in different tasks of modern digital designing. The paper discusses functional decomposition methods, which are currently being investigated, with special attention to balanced decomposition. Since technological and computer experiments with application of these methods produce promising results, this kind of logic synthesis will probably dominate the development of digital circuits for FPGA structures. Many examples confirming effectiveness of decomposition method in technology mapping in digital circuits design for cryptography and DSP applications are presented.
Mapping the Gene Ontology into the Unified Medical Language System: Research Papers
Authors: Jane Lomax, Alexa T. McCray
Venue: Comparative and Functional Genomics (2004)

We have recently mapped the Gene Ontology (GO), developed by the Gene Ontology Consortium, into the National Library of Medicine's Unified Medical Language System (UMLS). GO has been developed for the purpose of annotating gene products in genome databases, and the UMLS has been developed as a framework for integrating large numbers of disparate terminologies, primarily for the purpose of providing better access to biomedical information sources. The mapping of GO to UMLS highlighted issues in both terminology systems. After some initial explorations and discussions between the UMLS and GO teams, the GO was integrated with the UMLS. Overall, a total of 23&percnt; of the GO terms either matched directly (3&percnt;) or linked (20&percnt;) to existing UMLS concepts. All GO terms now have a corresponding, official UMLS concept, and the entire vocabulary is available through the web-based UMLS Knowledge Source Server. The mapping of the Gene Ontology, with its focus on structures, processes and functions at the molecular level, to the existing broad coverage UMLS should contribute to linking the language and practices of clinical medicine to the language and practices of genomics. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Event-driven programming with Twisted and Python
Authors: Ken Kinder
Venue: Linux Journal (2005)

Develop scalable software quickly with this project that gets a handle on a high-performance programming technique.
American kestrel (Falco sparverius) GIS research project
Authors: Scott Morrison
Venue: Journal of Computing Sciences in Colleges (2004)

Nest box locations are sometimes difficult to locate, even if you know where to look. It's even harder if you only know the general vicinity to look in. My project will give precise locations, within 20 ft. sometimes, of 126 American kestrel (Falco sparverius) nest boxes in four counties in eastern Pennsylvania. This project is a joint one with Hawk Mountain Sanctuary (HMS) and Unity College and contains 10 years worth of individual nest box data from 1992 to 2001 received from HMS for Berks, Carbon, Lehigh, and Schuylkill counties.
Real Time Two-Step Inspection System for Assembled Valve Keys in Automobile Cylinder Heads
Authors: Faisal Shafait, Muhammad Saleem Pervez, Arish Asif Qazi, Jorg Wollnack, Thomas Trittin
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents a two-step vision-based approach for real time inspection of the assembled valve keys in automobile cylinder heads. In the first step a combination of Sobel edge detector with gradient pair vector method is used for the detection of circular shaped valve keys. This method is very fast but also highly sensitive to noise, resulting in a relatively high percentage of false negatives. The second inspection step employs Canny edge detector with circular Hough transform. The images of the valve keys rejected in the first step pass through the second inspection step. This procedure differentiates between the false negatives and the true negatives. The cylinder heads rejected in the second step are separated afterwards from the main stream of the transportation line. In the statistics obtained, the first inspection step successfully rejected all of the wrongly assembled valve keys. The false rejection rate was around 4.6% of the total number of the valve keys rejected. The second inspection step successfully differentiated between true negatives and false negatives, reducing false negatives to 0%.
Interfacial reactions and electrical properties of hafnium-based thin films in Cu/barrier/n+-p junction diodes
Authors: Keng-Liang Ou, Ming-Hung Tsai, Haw-Ming Huang, Shi-Yung Chiou, Che-Tong Lin, Sheng-Yang Lee
Venue: Microelectronic Engineering (2005)

In this study, the barrier properties of Hf and nitrogen incorporated Hf films were investigated by Cu/Hf-N/Si structure. Hafnium and hafnium nitride films were prepared by reactive rf-magnetron sputtering on blank silicon wafers. The barrier properties were evaluated by sheet resistance, X-ray diffraction, transmission electron microscopy, scanning electron microscopy, and X-ray photoelectron spectroscopy. The as-deposited Hf film has a hexagonal close packed structure and a low resistivity of 100.98 @m@W-cm. With increasing nitrogen concentration of Hf-N film, phase transformations are identified as hcp-Hf->fcc-HfN. The thermal stability of Cu/Hf/Si and Cu/HfN"0"."4"7/Si contact system is evaluated by thermal stressing at various annealing temperatures. Nitrogen incorporated Hf films possess better barrier performance than sputtered Hf films. For the Cu/Hf/Si contact system, the interfacial reaction between the Hf barrier layer and the Cu layer is observed after annealing at 550 ^oC for 30 min, and copper-hafnium compounds form. Highly resistive copper silicide forms after annealing at 600 ^oC for 30 min. The Hf barrier fails due to the reaction of Cu and the Hf barrier, in which Cu atoms penetrate into the Si substrate after annealing at high temperature. The Cu/HfN"0"."4"7/Si is fairly stable up to annealing at 650 ^oC for 30 min. In addition, no copper-hafnium and copper silicide compounds are found. Diffusion resistance of nitrogen-incorporated Hf barrier is more effective. The thermal stabilities of Cu/HfN"0"."4"7/n^+-p junction diodes are enhanced by nitrogen incorporation. The Cu/Hf/n^+-p junction diodes result in large reverse-biased junction leakage currents after annealing at 500 ^oC for 30 min. On the other hand, Nitrogen incorporated Hf diffusion barriers retained the integrity of junction diodes up to 550 ^oC with lower reverse current densities. Phase transformation of hafnium-based barrier films with nitrogen incorporation are believed to impede Cu diffusion into the Si substrate and hence improve the barrier performance. Nitrogen incorporated hafnium diffusion barrier can suppress the formation of copper-hafnium compounds and copper penetration, and thus improve the thermal stability of barrier layer.
Simple PCPs with poly-log rate and query complexity
Authors: Eli Ben-Sasson, Madhu Sudan
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We give constructions of probabilistically checkable proofs (PCPs) of length n . poly(log n) (to prove satisfiability of circuits of size n) that can verified by querying poly(log n) bits of the proof. We also give constructions of locally testable codes (LTCs) with similar parameters.Previous constructions of short PCPs (from [5]to [9]) relied extensively on properties of low degree multi-variate polynomials. In contrast, our constructions rely on new problems and techniques revolving around the properties of codes based on high degree polynomials in one variable (also known as Reed-Solomon codes). We show how to convert the problem of verifying the satisfaction of a circuit by a given assignment to the task of verifying that a given function is close to being a Reed-Solomon codeword, i.e., a univariate polynomial of specified degree. This reduction is simpler than the corresponding steps in previous reductions, and gives a new alternative to using the popular "sum-check protocol". We then give a new PCP for the special task of proving that a function is close to being a Reed-Solomon codeword. This step of the construction is by a self-contained recursion, and the only ingredient needed in the analysis is the bi-variate low-degree test of Polischuk and Spielman[27].Note that our constructions yield LTCs first, which are then converted to PCPs. In contrast, most recent constructions go in the opposite (and less natural) direction of getting LTCs from PCPs.
Concurrent Subspaces Analysis
Authors: Dong Xu, Shuicheng Yan, Lei Zhang, Hong-Jiang Zhang, Zhengkai Liu, Heung-Yeung Shum
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

A representative subspace is significant for image analysis, while the corresponding techniques often suffer from the curse of dimensionality dilemma. In this paper, we propose a new algorithm, called Concurrent Subspaces Analysis (CSA), to derive representative subspaces by encoding image objects as 2nd or even higher order tensors. In CSA, an original higher dimensional tensor is transformed into a lower dimensional one using multiple concurrent subspaces that characterize the most representative information of different dimensions, respectively. Moreover, an efficient procedure is provided to learn these subspaces in an iterative manner. As analyzed in this paper, each sub-step of CSA takes the column vectors of the matrices, which are acquired from the k-mode unfolding of the tensors, as the new objects to be analyzed, thus the curse of dimensionality dilemma can be effectively avoided. The extensive experiments on the 3rd order tensor data, simulated video sequences and Gabor filtered digital number image database show that CSA outperforms Principal Component Analysis in terms of both reconstruction and classification capability.