ppxscal/embedding_network huggingface dataset:
Ensembles of biased classifiers
Authors: Rinat Khoussainov, Andreas Heß, Nicholas Kushmerick
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We propose a novel ensemble learning algorithm called Triskel, which has two interesting features. First, Triskel learns an ensemble of classifiers, each biased to have high precision on instances from a single class (as opposed to, for example, boosting, where the ensemble members are biased to maximise accuracy over a subset of instances from all classes). Second, the ensemble members' voting weights are assigned so that certain pairs of biased classifiers outweigh the rest of the ensemble, if their predictions agree. Our experiments demonstrate that Triskel often outperforms boosting, in terms of both accuracy and training time. We also present an ROC analysis, which shows that Triskel's iterative structure corresponds to a sequence of nested ROC spaces. The analysis predicts that Triskel works best when there are concavities in the ROC curves; this prediction agrees with our empirical results.
Texture Classification Using Ridgelet Transform
Authors: S. Arivazhagan, L. Ganesan, T. G. Subash Kumar
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Texture classification has long been an important research topic in image processing. Now a days classification based on wavelet transform is being very popular. Wavelets are very effective in representing objects with isolated point singularities, but failed to represent line singularities. Recently, ridgelet transform which deal effectively with line singularities in 2-D is introduced. It allows representing edges and other singularities along lines in a more efficient way. In this paper, the issue of texture classification based on ridgelet transform has been analyzed. Features are derived from the sub-bands of the ridgelet decomposition and are used for classification for a data set containing 20 texture images. Experimental results show that this approach allows obtaining high degree of success rate in classification.
Application deployment using catallactic Grid middleware
Authors: Liviu Joita, Omer F. Rana, Pablo Chacín, Isaac Chao, Felix Freitag, Leandro Navarro, Oscar Ardaiz
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

In this paper we describe an application deployment using a Catallactic Grid-enabled middleware, which is based on the Catallaxy "free market" self-organisation approach described by von Hayek [7], who understood the market as a decentralised coordination mechanism opposite to a centralised command economy. The implementation makes use of Globus Toolkit, JXTA and WSRF. The paper envisages the resource virtualization in the WSRF context as the main driver for a proper connection middleware-base platform (on the broad scenario of grid applications).
One-click lattice extraction from near-regular texture
Authors: Kevin Sookocheff, David Mould
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present a method for extracting a lattice from near-regular texture. Our method demands minimal user intervention, needing a single mouse click to select a typical texton. The algorithm follows a four-step approach. First, an estimate of texton size is obtained by considering the spacing of peaks in the auto-correlation of the texture. Second, a sample of the image around the user-selected texton is correlated with the image. Third, the resulting correlation surface is converted to a map of potential texton centres using non-maximal suppression. Finally, the maxima are formed into a graph by connecting potential texton centres. We have found the method robust in the face of significant changes in pixel intensity and geometric structure between textons.
Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning
Authors: Xiaojin Zhu, John Lafferty
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference for graph-based methods often does not scale well to very large data sets, since it requires inversion of a large matrix or solution of a large linear program. Moreover, such approaches are inherently transductive, giving predictions for only those points in the unlabeled set, and not for an arbitrary test point. In this paper a new approach is presented that preserves the strengths of graph-based semi-supervised learning while overcoming the limitations of scalability and non-inductive inference, through a combination of generative mixture models and discriminative regularization using the graph Laplacian. Experimental results show that this approach preserves the accuracy of purely graph-based transductive methods when the data has "manifold structure," and at the same time achieves inductive learning with significantly reduced computational cost.
Kolmogorov Probability Spaces Describing Accardi Models of Quantum Correlations
Authors: Andrei Khrennikov, O. G. Smolyanov, A. Truman
Venue: Open Systems Information Dynamics (2005)

In this paper we consider several Kolmogorov type models describing some quantum correlations. The main ideas beyond most of these models comes back to pioneering works of Accardi (see [1, 10, 15] and references therein); because of that we call some of them the Accardi models. Namely we discuss, in our frame, the Kolmogorov type Accardi model of the Aspect version [2] of the Einstein-Podolsky-Rosen (EPR) experiment [3].
Distance-Regular (0,α)-Reguli
Authors: Frank Clerck, Stefaan Winter, Elisabeth Kuijken, Cristina Tonesi
Venue: Designs, Codes and Cryptography (2006)

We introduce distance-regular (0,¿)-reguli and show that they give rise to (0,¿)-geometries with a distance-regular point graph. This generalises the SPG-reguli of Thas [14] and the strongly regular (¿,β)-reguli of Hamilton and Mathon [9], which yield semipartial geometries and strongly regular (¿,β)-geometries, respectively. We describe two infinite classes of examples, one of which is a generalisation of the well-known semipartial geometry Tn*(B) arising from a Baer subspace PG(n, q) in PG(n, q2).
Exploring Three-dimensional Visualization for Intrusion Detection
Authors: Adam Oline, Dirk Reiners
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

Intrusion detection systems have been popular tools in the battle against adversaries who, for whatever reason, desire to break into networks, compromise hosts, and steal valuable information. One problem with current implementations, however, is the sheer number of alerts they can generate, many of which tend to be false alarms. This drawback makes effective use of such systems a challenging task. In this paper we explore three-dimensional approaches to visualizing network intrusion detection system alerts and aggregated network statistics in order to provide the system administrator with a better picture of the events occurring on his or her network. While some research has been done using twodimensional concepts, 3D approaches have not received much attention with regard to detecting network intrusions. Evaluation of our visualizations using the 1999 DARPA Intrusion Detection Evaluation data set demonstrates the potential benefit of utilizing the third dimension. We show how a number of attack types in the data set generate visual evidence of abnormal activity that a security administrator might use as motivation for further investigation.
Proposals for the standardization of status description
Authors: Harry M. Markowitz
Venue: ACM SIGSIM Simulation Digest (1984)

This paper is to be presented at the Workshop for International Standardization of Simulation Languages to be held in Sorrento, Italy, September 20-21, 1979. It proposes (a) that the instantaneous status of a simulated system be described in terms of its entities, attributes and sets, and (b) that a standard notation be adopted for describing the EAS (entity, attribute and set) structure of a given system. The nature and track record of the EAS view is discussed in the body of the paper. An appendix considers possible variations in basic EAS conventions.
Specifying Urgency in Timed I/O Automata
Authors: Biniam Gebremichael, Frits Vaandrager
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Tools and techniques based on timed automata (such as Uppaal and the timed I/O automata framework) have proven to be extremely useful for the analysis of protocols and control software for real-time systems. However, a significant limitation of these approaches is that, due to the expressiveness of the modeling languages, timelocks - degenerate states in which time is unable to pass - can freely arise and cannot, in the general case, be detected. As a remedy to this problem Sifakis et al. advocate the use of deadline predicates for the specification of progress properties of Alur-Dill style timed automata. In this article, we extend these ideas to a more general setting, which may serve as a basis for deductive verification techniques. More specifically, we extend the TIOA framework of Lynch et al with urgency predicates. We identify a suitable language to describe the resulting timed I/O automata with urgency and show that for this language time reactivity holds by construction. We also establish that the class of timed I/O automata with urgency is closed under composition. The use of urgency predicates is compared with three alternative approaches to specifying progress properties that have been advocated in the literature: invariants, stopping conditions and deadline predicates. We argue that in practice the use of urgency predicates leads to shorter and more natural specifications than any of the other approaches. Some preliminary results on proving invariant properties of timed (I/O) automata with urgency are presented.
The Supplier Model for Legacy Applications in a Grid
Authors: Jonathan Giddy, Ian Grimstead, Jason Jones
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The use of web services as the basis for grid middleware has allowed scientists to wrap legacy applications as services in order to provide their capabilities to grid users. However, this "wrapper" model can be poor at satisfying the requirement for software and data to be efficiently positioned on processing resources around the grid as part of larger coordinated computations. We argue that some aspects of the earlier more exposed grid model, where the client coordinates the use of resources, support these issues better and allow more efficient grid solutions. We propose a model to take advantage of both systems.
Online data migration for autonomic provisioning of databases in dynamic content web servers
Authors: Gokul Soundararajan, Cristiana Amza
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

This paper introduces an efficient data migration technique for provisioning new databases to workloads in dynamic content servers. Although many solutions for database replication exist, an efficient method for joining new replicas to a running system has not been implemented. We propose and implement a data migration algorithm that allows quick addition of replicas with minimal disruption of transaction processing. Furthermore, we show that our approach can also be used for fault management and re-integrating failed databases. We investigate our algorithm for transparent provisioning in the database tier using the TPC-W e-commerce benchmark and the RUBIS online auction benchmark. We demonstrate that our technique provides quality of service under different load and failure scenarios.
Exploration of Memory-Aware Dynamic Voltage Scheduling for Soft Real-Time Applications
Authors: Young-Jin Kim, Jihong Kim
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Dynamic voltage scaling (DVS) and dynamic power management (DPM) are widely-used techniques to reduce energy consumption in modern computing systems. Although combining these techniques can save more energy, there has not been much work focused on energy-optimal combination of these techniques under variable memory clock frequencies. In this paper, we explore system-wide energy-optimal frequency space for a memory-aware DVS technique based on a stochastic memory access model for systems with frequency-variable memory devices. In addition, we propose a simple but practical DVS method, which can be applied to an actual platform.
Pcoord: a decentralized network coordinate system for internet distance prediction
Authors: Li-Wei H. Lehman
Venue:  (2005)

Several recently emerged Internet services make use of application-level or overlay networks. Examples of such services include overlay multicast, structured peer-to-peer lookup services, and peer-to-peer file sharing. Many of these services could benefit from enabling participating end hosts to estimate their relative network locations within the overlay. In this thesis, we present PCoord, a peer-to-peer network coordinate system for overlay topology discovery and distance prediction. The goal of PCoord is to allow participating peer nodes in an overlay network to collaboratively construct an accurate geometric model of the overlay network topology in a completely decentralized peer-to-peer fashion. We evaluate the PCoord approach through extensive simulations using both real network measurements and simulated topologies. Our simulation results indicate that PCoord can embed hosts in a low dimensional Euclidean model with a small median prediction error. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
A cost-benefit flow control for reliable multicast and unicast in overlay networks
Authors: Yair Amir, Baruch Awerbuch, Claudiu Danilov, Jonathan Stanton
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

When many parties share network resources on an overlay network, mechanisms must exist to allocate the resources and protect the network from overload. Compared to large physical networks such as the Internet, in overlay networks the dimensions of the task are smaller, so new and possibly more effective techniques can be used. In this work we take a fresh look at the problem of flow control in multisender multigroup reliable multicast and unicast and explore a cost-benefit approach that works in conjunction with Internet standard protocols such as TCP.In contrast to existing window-based flow control schemes, we avoid end-to-end per sender or per group feedback by looking only at the state of the virtual links between participating nodes. This produces control traffic proportional only to the number of overlay network links and independent of the number of groups, senders, or receivers. We show the effectiveness of the resulting protocol through simulations and validate the simulations with live Internet experiments. We demonstrate near-optimal utilization of network resources, fair sharing of individual congested links, and quick adaptation to network changes.
DfM for SoC, invited
Authors: A. Balasinski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

DfM (Design-for-Manufacturability) for efficient generation of mask data, optimization of manufacturing process, cost reduction, and best circuit performance of Systems-on-Chip are discussed. Beyond 100 nm technology node, layout pattern has to comply to many new requirements pertaining to database structure and complexity, suitability for image enhancement by the optical proximity correction, and mask data pattern density and distribution over the image field. A number of macro-, meso-, and microscopic effects such as reticle macroloading, planarization dishing, and pattern bridging or breaking would compromise fab yield, device performance, or both. This, given the already extremely high (and growing) process complexity, design cycle time and manufacturing cost, requires simulations to ensure that the first silicon out of the fab would yield. This work discusses the fundamentals of DfM in the area of layout best practices, mask data preparation, printability, and uniformization and the cost reduction.
Evaluation of method for multiple path distribution based on delay-jitter
Authors: Yuki Kawashima, Hiroshi Mineno, Susumu Ishihara, Tadanori Mizuno
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

This paper describes the implementation and evaluation of a method of multiple path distribution of traffic based on delay-jitter. Multiple path communication is designed to conform to the speed and reliability of wireless communication through the simultaneous use of multiple Internet link mobile hosts and by dispersing the traffic between mobile hosts and a correspondent host. The performance of the SHAring multiple path procedure for a cluster networK Environment (SHAKE) decreases due to out-of-order packets caused by delay-jitter. We implemented the mechanism to avoid decreasing performance by not using paths with large amounts of delay-jitter.
Capturing and Using Software Architecture Knowledge for Architecture-Based Software Development
Authors: Muhammad Ali Babar, Ian Ian Gorton, Ross Jeffery
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Management of architecture knowledge is vital for improving an organization's architectural capabilities. Despite the recognition of the importance of capturing and reusing architecture knowledge, there is no suitable support mechanism. We have developed a conceptual framework to provide appropriate guidance and tool support for making tacit or informally described architecture knowledge explicit. This framework identifies different approaches to capturing implicit architecture knowledge. We discuss different usages of the captured knowledge to improve the effectiveness of architecture processes. This paper also presents a prototype of a web-based architecture knowledge management tool to support the storage and retrieval of the captured knowledge. The paper concludes with open issues that we plan to address in order to successfully transfer this support mechanism for capturing and using architecture knowledge to the industry.
A Robust Testing Framework for Verifying Web Services by Completeness and Consistency Analysis
Authors: W. T. Tsai, X. Wei, Y. Chen, R. Paul
Venue: Proceedings of the IEEE International Workshop (2005)

This paper presents a specification-based robust testing framework for Web services. Web services testing is done by 1) extracting condition and event combinations from the Web service specification, 2) ensuring that these combinations are consistent with each other; 3) performing completeness analysis to identify all the missing condition and event combinations; 4) Identifying the locations where updates are needed to maintain the completeness and consistency.; 5) emphasizing on robustness testing by generating positive as well as negative test cases. An efficient algorithm called Covering Scenario Generation is proposed to identify the locations where incompleteness and inconsistency exist. The algorithm is based on the min-terms of Boolean expressions that combine multiple conditions into a single checkable item. The proposed algorithm has been experimented with several large industrial applications and the results indicated that the proposed algorithm is robust and scalable to large applications. A case study is designed to illustrate the design and testing process.
Object correspondence as a machine learning problem
Authors: Bernhard Schölkopf, Florian Steinke, Volker Blanz
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We propose machine learning methods for the estimation of deformation fields that transform two given objects into each other, thereby establishing a dense point to point correspondence. The fields are computed using a modified support vector machine containing a penalty enforcing that points of one object will be mapped to "similar" points on the other one. Our system, which contains little engineering or domain knowledge, delivers state of the art performance. We present application results including close to photorealistic morphs of 3D head models.
The Bimode++ Branch Predictor
Authors: Kenji Kise, Takahiro Katagiri, Hiroki Honda, Toshitsugu Yuba
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Modern wide-issue superscalar processors tend to adopt deeper pipelines in order to attain high clock rates. This trend increases the number of on-the-fly instructions in processors and a mispredicted branch can result in substantial amounts of wasted work. In order to mitigate these wasted works, an accurate branch prediction is required for the high performance processors. In order to improve the prediction accuracy, we propose the bimode++ branch predictor. It is an enhanced version of the bimode branch predictor. Throughout execution from the start to the end of a program, some branch instructions have the same result at all times. These branches are definedas extremely biased branches. The bimode++ branch predictor is unique in predicting the output of an extremely biased branch with a simple hardware structure. In addition, the bimode++ branch predictor improves the accuracy using the refined indexing and a fusion function. Our experimental results with benchmarks from SpecFP, SpecINT, multi-media and server area show that the bimode++ branch predictor can reduce the mispredict rate by 13.2% to the bimode and by 32.5% to the gshare.
Global Dynamics of Nucleosome Arrays: Influence of Variant Histone H2A.Z
Authors: Li Wang, Amutha Ramaswamy, Ilya Ioshikhes
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Nucleosomal arrays are one of the fundamental levels of chromatin organization. They often occur in the gene promoter areas, thus being important for transcription regulation. Investigating the effect of variant histone H2A.Z over the dynamic structure of single nucleosomes and their arrays is important for understanding the transcription within chromatin. Recently we highlighted the influence of histone variants over the functional dynamics of single nucleosome [1]. The present work further analyzes the higher order structures of the nucleosome arrays (dimer, trimer and tetramer) with regular histones as well as with H2A.Z variant. The analysis reveals that the modeled nucleosome dimer with both histone types exhibits a completely relaxed motion with respect to the linker DNA. The dimer also possesses the symmetric dynamics as of the monomeric nucleosome more pronounced in the dimer of variant histones. The trimer expresses larger amplitude of dynamics either by keeping the central nucleosome as a rigid one or the edged nucleosome as a rigid domain in the global modes. The tetramer expresses a symmetric coupled dynamics between the two non-adjacent nucleosomes, consistent with the collective motion of the trimer in the second slowest mode. Like those of the dimer, the dynamics of the trimer and tetramer are considerably enhanced by the presence of variant histone H2A.Z as follows from the larger fluctuations in the respective conformations.