ppxscal/embedding_network huggingface dataset:
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
Authors: Martin H. C. Law, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Understanding the structure of multidimensional patterns, especially in unsupervised cases, is of fundamental importance in data mining, pattern recognition, and machine learning. Several algorithms have been proposed to analyze the structure of high-dimensional data based on the notion of manifold learning. These algorithms have been used to extract the intrinsic characteristics of different types of high-dimensional data by performing nonlinear dimensionality reduction. Most of these algorithms operate in a "batch” mode and cannot be efficiently applied when data are collected sequentially. In this paper, we describe an incremental version of ISOMAP, one of the key manifold learning algorithms. Our experiments on synthetic data as well as real world images demonstrate that our modified algorithm can maintain an accurate low-dimensional representation of the data in an efficient manner.
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers
Authors: François Laviolette, Mario Marchand
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We extend the PAC-Bayes theorem to the sample-compression setting where each classifier is represented by two independent sources of information: a compression set which consists of a small subset of the training data, and a message string of the additional information needed to obtain a classifier. The new bound is obtained by using a prior over a data-independent set of objects where each object gives a classifier only when the training data is provided. The new PAC-Bayes theorem states that a Gibbs classifier defined on a posterior over sample-compressed classifiers can have a smaller risk bound than any such (deterministic) sample-compressed classifier.
An Active Space Recycling Mechanism for Flash Storage Systems in Real-Time Application Environment
Authors: Sheng-Jie Syu, Jing Chen
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Most of the flash storage systems reclaim the space occupied by invalid data only when the available free space is low and a data writing request is being processed thereby may intermittently increase the time of carrying out a writing operation and decrease the system performance. For real-time applications, such passive space recycling not only results in tasks suffering long blocking time but also imposes great impact on the predictability of their timing behaviors. This paper presents an active mechanism to recycle invalidated space in flash storage system which, by periodically launching tasks to reclaim data space containing invalid data, can reduce the blocking incurred from space recycling as well as provide a more analyzable recycling operation. The active space recycling mechanism can work well with the wear-leveling mechanism commonly required in flash storage management. In addition, the implementation requires no changes of its host file system. Simulation results show that the proposed space recycling mechanism has significant improvement on the worst case timing behaviors of write operations.
Hierarchical traffic grooming in large-scale wdm networks
Authors: Bensong Chen
Venue:  (2005)

The advances in fiber optics and wavelength division multiplexing (WDM) technology are viewed as the key to satisfying the data-driven bandwidth demand of today's Internet. The mismatch of bandwidths between user needs and wavelength capacity makes it clear that some multiplexing should be done to use the wavelength capacity efficiently, which will result in reduction on the cost of line terminating equipment (LTE). The technique is referred to as traffic grooming. Previous studies have concentrated on different objectives, or on some special network topologies such as rings. In our study, we aim at minimizing the LTE cost to directly target on minimizing the network cost. We look into the grooming problem in elemental topologies as a starting point. First, we conduct proofs to show that traffic grooming in path, ring and star topology networks with the cost function we consider is NP-Complete. We also show the same complexity results for a Min-Max objective that has not been considered before, on the two elementary topologies. We then design polynomial-time heuristic algorithms for the grooming problem in rings (thus implicitly paths) and stars for networks of larger size. Experiments on various network sizes and traffic patterns show the effectiveness of our algorithms. For general topology networks, we design a hierarchical approach which first partitions a large network into several clusters, then applies the method we use in star networks to each cluster, by selecting a hub node to groom traffic within the cluster. At the second hierarchy, we apply the star grooming method again only on the hub nodes. The polynomial-time hierarchical approach scales well and can cope with large networks of general topology efficiently, both for minimizing LTE cost and for lowering wavelength requirements. We also design a clustering algorithm that can generate good results for subsequent steps in the hierarchical grooming method. Numerical results from experiments show that both the hierarchical grooming approach and our clustering algorithm generate satisfying results for the grooming on various network topologies and traffic demand patterns.
Ordering and Finding the Best of K>2 Supervised Learning Algorithms
Authors: Olcay Taner Yildiz Ethem Alpaydin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Given a data set and a number of supervised learning algorithms, we would like to find the algorithm with the smallest expected error. Existing pairwise tests allow a comparison of two algorithms only; range tests and ANOVA check whether multiple algorithms have the same expected error and cannot be used for finding the smallest. We propose a methodology, the MultiTest algorithm, whereby we order supervised learning algorithms taking into account 1) the result of pairwise statistical tests on expected error (what the data tells us), and 2) our prior preferences, e.g., due to complexity. We define the problem in graph-theoretic terms and propose an algorithm to find the "best” learning algorithm in terms of these two criteria, or in the more general case, order learning algorithms in terms of their "goodness.” Simulation results using five classification algorithms on 30 data sets indicate the utility of the method. Our proposed method can be generalized to regression and other loss functions by using a suitable pairwise test.
Improving Genome Rearrangement Phylogeny Using Sequence-Style Parsimony
Authors: Jijun Tang, Li-San Wang
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

The study of genome rearrangements, the evolutionary events that change the order and strandedness of genes within genomes, presents new opportunities for discoveries about deep evolutionary events. The best software so far, GRAPPA, solves breakpoint and inversion phylogenies by scoring each tree topology through iterative improvements of internal node gene orders. We find that the greedy hill-climbing approach means the accuracy is limited because of multiple local optima. To address this problem, we propose integration GRAPPA with MPME, a string encoding of gene adjacency relationships whose optimal internal node assignments can be determined globally in polynomial time, to provide better initializations for GRAPPA. In simulation studies, the new algorithm yields shorter tree lengths and better accuracy in phylogeny reconstruction.
Supporting Web Application Evolution by Dynamic Analysis
Authors: Giuseppe Antonio Di Lucca, Massimiliano Di Penta, Anna Rita Fasolino, Porfirio Tramontana
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

The evolution of Web Applications needs to be supported by the availability of proper analysis and design documents. UML use case diagrams are certainly useful to identify features to evolve, as well as to study the Web Application evolution in terms of features added/removed or changed. Unfortunately, very often the only source of documentation available is constituted by the Web Application source code. This paper proposes an approach to abstract use case diagrams from execution traces of a Web Application. The approach is mainly based on the analysis of a graph modelling the transitions between the pages navigated along user sessions and the clustering of the navigated pages. A case study carried out to validate the proposed approach and showing its feasibility is reported in the paper.
Seven mile boots: implications of an everyday interface
Authors: Martin Pichlmair
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

With seven-league boots through the Internet - when you take a stroll through the physical world in this wireless LAN footwear, you might meet people who happen to be spending some time in a chat-room. Their virtual conversations are made audible as spoken text coming out of the boots. The piece Seven Mile Boots augments reality by introducing a new layer of communication to an everyday task: spoken chat. Virtual crowds are met equipped with an intentionally basic interface.
Linear Decision Fusions in Multilayer Perceptrons for Breast Cancer Diagnosis
Authors: Yunfeng Wu, Jinming Zhang, Cong Wang, Sin Chun Ng
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We introduce a non-parametric linear decision fusion called Perceptron Average (PA) for breast cancer diagnosis. We concretely compare the accuracy between both two fusion strategies for breast cancer diagnosis. The PA fusion demonstrates a higher overall diagnostic accuracy versus the Weighted Average fusion, and the PA fusion method also exhibits a better capability of generalization when a casualty of training data sizes. Moreover, the PA fusion gains a larger area covered by its Receiver Operating Characteristic curve.
A Ringing Metric to Evaluate the Quality of Images Restored Using Iterative Deconvolution Algorithms
Authors: M. Balasubramanian, S. S. Iyengar, J. Reynaud, R. W. Beuerman
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Iterative deconvolution algorithms exhibit increased ringing artifacts at higher number of iterations. Quantitative image analysis techniques such as optical flow algorithms are sensitive to these artifacts. We propose to use an image quality metric to identify the terminal step of iterative restoration algorithms. Frequency based metrics have difficulties in distinguishing the ringing artifacts from the image features. Spatial analysis techniques require extensive processing making them unsuitable for real-time image quality measurement as needed in iterative image restoration. We propose a novel ringing metric using binary morphological operators and demonstrate the method on the images of random cotton fibers acquired using white light confocal microscope.
A Novel Clock Recovery Scheme with Improved Jitter Tolerance for PAM4 Signaling
Authors: Hyoungsoo Kim, Youngsik Hur, Moonkyun Maeng, Franklin Bien, Soumya Chandramouli, Edward Gebara, Joy Laskar
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper introduces a novel clock recovery scheme for multilevel high speed serial data transmission. The system extracts the clock from a 10 Gb/s pulse amplitude modulated (PAM)-4 input signal. The output is non-return-to-zero (NRZ) data synchronized with the clock. Conventional methods recover the clock by over-sampling the received signal, which requires complicated circuit to implement. In contrast, the proposed method aligns the data with clock using three different transition levels of PAM4 signal. It is implemented with only a few additional blocks. We propose the scheme phase-loop-lock based CDR block with jitter reduction block in which the PAM4 signal is detected by each transition and converted to a binary signal. The proposed jitter reduction block consists of a differentiator, three comparators, monostable multivibrators and a decision block, while CDR part incorporates a phase and frequency detector, a loop filter and a voltage controlled oscillator (VCO). Due to the acquisition of each transition data, jitter is reduced and locking time for CDR is also reduced. We evaluate the system level architecture with PAM4 10 Gb/s signal and behavioral simulation.
New Directions for CACM?
Authors: David A. Patterson
Venue: Communications of the ACM (2006)

Much has changed since the 1980s when the current format of Communications of the ACM was cast. What should be the mission of ACM's flagship publication in the 21st century?
Designing a Material Analysis Collaboratory for the Process Industry
Authors: Henny de Vos, Rene van Buuren, Wil Janssen, Andrew Tokmakoff
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Cost and efficiency are important incentives for academic oriented collaboratories, where researchers and analysts can work and experiment with advanced remote equipment. Such collaboratories are not suitable for industrial use, because they include experimental instruments instead of of-the-shelf instruments, and because industry requires other security and reliability implementation. This paper presents an industrial collaboratory that aims to support the daily work of material analysts. It supports natural collaboration between analysts and with customers and supports remote control of sophisticated of-the-shelf instruments. The paper includes a sketch of the technical architecture and elaborates on business models for commercial exploitation of the collaboratory.
Non-blocking Disk-Tape Join Algorithm for Data on Tertiary Storage Systems
Authors: Baoliang Liu, Jianzhong Li, Lei Nie, Yanqiu Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Massive data accumulated by business or scientific applications have reached such a great amount that they can be accommodated only on tapes. In order to make full use of these data, tools of data analysis and data mining should be developed. In such applications, disk resident data are needed to join with tape resident data. Many disk-tape join methods have been proposed, examples are CDT-NB and CDT-GH. But all these algorithms have blocking behaviour that user must wait quite a while before the first result can be seen. Since disk-tape join operation often takes a long time to finish, it is desirable to produce the join result as early as possible while the join performance doesn't deteriorate too much. The Non-blocking Disk-Tape join (NDT) presented in this paper is the first disk-tape join algorithm designed with this goal in mind. It has three phases: the hashing phase, the merging phase and the probing phase. Join results can be produced in each phase. Tuples of disk resident relation and tape resident relation are read simultaneously into memory and be joined in the hashing phase. The merging phase joins those tuples that flushed onto disk during the hashing phase. After the first two phases, disk resident relation has been partitioned and is joined with remaining tape resident relation in the probing phase. Experimental results show that NDT can produce join results much earlier than the-state-of-art CDT-GH and the performance of NDT is about the same with that of CDT-GH.
Error Control Coding for Semiconductor Memory Systems in the Space Radiation Environment
Authors: Haruhiko Kaneko
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

Error control coding is essential for semiconductor memory systems used in the space radiation environment because memory chips in this environment often suffer from single event upsets (SEUs). This paper presents the development of encoders and decoders of error control codes suitable for the space radiation environment. To select suitable error control codes, we analyze error patterns and error counts in in-flight data of a solid state recorder installed in the Mission Demonstration test Satellite-1 (MDS-1). Based on this analysis, six classes of linear error control codes are selected, and encoders and decoders of these codes are designed and implemented using an FPGA. To reduce the decoding delay, the decoders are designed based on a parallel decoding method. Evaluation of the implemented FPGA shows that the decoders have 45K to 300K gates with decoding delay of about 20 ns.
Automatic semantic platform-dependent redesign
Authors: Giulio Mori, Fabio Paternò
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Nowadays, many devices provide access to Web pages: desktops, mobile phones, PDAs, etc.. Often desktop user interfaces need to be redesigned for mobile devices in order to support nomadic access. The problem of adapting the interface to different platforms can be addressed in many ways. Low-level syntactical transcoding or just resizing elements do not seem able to provide general solutions: they often generate poor results in terms of usability because they follow rigid rules and mainly try to fit the same design into different devices. This paper presents our solution, which is based on platform-dependent semantic redesign. Semantic redesign means that transformation from one platform to another is based on the use of semantic information and not only on the analysis of the low-level implementation. In our case, such semantic information is contained in logical descriptions of the user interfaces that also capture the possible tasks users intend to accomplish.
An Optimized Message-Oriented Middleware Solution for Extending Enterprise Services to the Mobile Domain
Authors: Pekka Paakkonen, Daniel Pakkala, Markus Sihvonen
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The extension of services from the Enterprise domain to the Mobile infrastructure offers many attractive business cases for software companies. However, accomplishing this task poses many problems, which mainly stem from the differences of the environments and limited resources of the mobile terminals. One of the problems is application middleware frameworks applied in the Enterprise systems, which are difficult to be extended to the mobile domain. This paper presents a binary-based Message- Oriented Middleware (MOM) solution to bridge the gap between the Enterprise and Mobile domains. Requirements for the proposal have been gathered from a mobile business case to be realized. The main advantage of the solution is the minimization of overhead compared to text-based approaches. Also reusability aspects of the solution have been discussed. The proposal can be seen as an alternative to the compressing the payload, when low cost access to mobile services with mobile devices with limited capabilities is considered as a requirement.
Consciousness, Agents and the Knowledge Game
Authors: Luciano Floridi
Venue: Minds and Machines (2005)

This paper has three goals. The first is to introduce the "knowledge game", a new, simple and yet powerful tool for analysing some intriguing philosophical questions. The second is to apply the knowledge game as an informative test to discriminate between conscious (human) and conscious-less agents (zombies and robots), depending on which version of the game they can win. And the third is to use a version of the knowledge game to provide an answer to Dretske's question "how do you know you are not a zombie?".
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
Authors: Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu
Venue: Journal of Cryptology (2006)

We know that trapdoor permutations can be used to construct all kinds of basic cryptographic primitives, including trapdoor functions, public-key encryption, private information retrieval, oblivious transfer, key agreement, and those known to be equivalent to one-way functions such as digital signature, private-key encryption, bit commitment, pseudo-random generator and pseudo-random functions. On the other hand, trapdoor functions are not as powerful as trapdoor permutations, so the structural property of permutations seems to be something special that deserves a more careful study. In this paper we investigate the relationships between one-way permutations and all these basic cryptographic primitives. Following previous works, we focus on an important type of reductions called black-box reductions. We prove that no such reductions exist from one-way permutations to either trapdoor functions or private information retrieval. Together with previous results, all the relationships with one-way permutations have now been established, and we know that no such reductions exist from one-way permutations to any of these primitives except trapdoor permutations. This may have the following meaning, with respect to black-box reductions. We know that one-way permutations imply none of the primitives in "public cryptography," where additional properties are required on top of "one-wayness" \cite{IR89}, so permutations cannot be traded for any of these additional properties. On the other hand, we now know that none of these additional properties can be traded for permutations either. Thus, being a permutation seems to be something orthogonal to those additional properties on top of one-wayness. Like previous non-reducibility results, our proofs follow the oracle separation paradigm of Impagliazzo and Rudich.
Prototype Learning Methods for Online Handwriting Recognition
Authors: B. S. Raghavendra, C. K. Narayanan, G. Sita, A. G. Ramakrishnan, M Sriganesh
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of the training samples of a given class are used to select prototypes. In the second method, cumulative distance to allographs of different orientation is used as a criterion to decide if the sample is representative of the group. The latter method is presumed to offset the possible orientation effect. This method still uses fixed number of prototypes for each of the classes. Finally, a prototype set growing algorithm is proposed, with a view to better model the differences in complexity of different character classes. The proposed algorithms are tested and compared for both writer independent and writer adaptation scenarios.