ppxscal/embedding_network huggingface dataset:
Distance--Based Classification with Lipschitz Functions
Authors: Ulrike von Luxburg, Olivier Bousquet
Venue: The Journal of Machine Learning Research (2004)

The goal of this article is to develop a framework for large margin classification in metric spaces. We want to find a generalization of linear decision functions for metric spaces and define a corresponding notion of margin such that the decision function separates the training points with a large margin. It will turn out that using Lipschitz functions as decision functions, the inverse of the Lipschitz constant can be interpreted as the size of a margin. In order to construct a clean mathematical setup we isometrically embed the given metric space into a Banach space and the space of Lipschitz functions into its dual space. To analyze the resulting algorithm, we prove several representer theorems. They state that there always exist solutions of the Lipschitz classifier which can be expressed in terms of distance functions to training points. We provide generalization bounds for Lipschitz classifiers in terms of the Rademacher complexities of some Lipschitz function classes. The generality of our approach can be seen from the fact that several well-known algorithms are special cases of the Lipschitz classifier, among them the support vector machine, the linear programming machine, and the 1-nearest neighbor classifier.
A Framework for Protecting Web Sevices with IPsec
Authors: Cassio Ditzel Kropiwiec, Edgard Jamhour, Carlos Maziero
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This paper proposes a WSDL security extension for describing IPsec policies in Web Services negotiations. The proposed extension is based on the policy model proposed by IETF for describing IPsec policies. Besides the model, the paper presents a framework for embedding IPsec negotiations in Web Services applications. The paper also presents the results of the overhead evaluation introduced by the use IPsec to protect Web Services applications under different configurations.
Diagnostic fidelity of the Z-buffer segmentation algorithm: preliminary assessment based on intracranial aneurysm detection
Authors: Brian E. Chapman, Dennis L. Parker, Janet O. Stapelton, Jay S. Tsuruda, Claudia Mello-Thoms, Bronwin Hamilton, Gregory L. Katzman, Kevin Moore
Venue: Journal of Biomedical Informatics (2004)

We have developed an algorithm known as the Z-buffer segmentation (ZBS) algorithm for segmenting vascular structures from 3D MRA images. Previously we evaluated the accuracy of the ZBS algorithm on a voxel level in terms of inclusion and exclusion of vascular and background voxels. In this paper we evaluate the diagnostic fidelity of the ZBS algorithm. By diagnostic fidelity we mean that the data preserves the structural information necessary for diagnostic evaluation. This evaluation is necessary to establish the potential usefulness of the segmentation for improved image display, or whether the segmented data could form the basis of a computerized analysis tool. We assessed diagnostic fidelity by measuring how well human observers could detect aneurysms in the segmented data sets. ZBS segmentation of 30 MRA cases containing 29 aneurysms was performed. Image display used densitometric reprojections with shaded surface highlighting that were generated from the segmented data. Three neuroradiologists independently reviewed the generated ZBS images for aneurysms. The observers had 80% sensitivity (90% for aneurysms larger than 2 mm) with 0.13 false positives per image. Good agreement with the gold standard for describing aneurysm size and orientation was shown. These preliminary results suggest that the segmentation has diagnostic fidelity with the original data and may be useful for improved visualization or automated analysis of the vasculature.
Efficient Rapid Prototyping of Image and Video Processing Algorithms
Authors: S. Vitabile, A. Gentile, S. M. Siniscalchi, F. Sorbello
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Image and video processing tasks are often confined for real-time execution on large size workstations or expensively custom designed hardware. The current availability of mature reconfigurable hardware, like Field Programmable Gate Arrays (FPGAs), coupled with the usage of hardware programming languages offers a good path for porting such applications on portable devices. This paper explores the rapid prototyping of a real-time road sign recognition system on a FPGA, using an algorithmic-like hardware programming language: the Handel-C language. We investigate the relationship between efficient Handel-C data, structures, constructs and the related high level C data, structures, constructs. Programming guidelines are proposed for the development of real-time image and video processing, starting from a better organized high level C code that can be then easily ported in Handel-C. Results are illustrated showing the effectiveness of employing Handel-C to turn an entirely software based system into a fully functional field deployable device.
A Faster Method for Modeling Virtual Colony
Authors: Tianlu Mao, He Huang, Zhaoqi Wang
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

A virtual colony composed by vivid personal characterswith different facial texture and body size, will stronglyenhance the reality of the whole virtual environment. Thispaper describes a fast, economic but realistic method formodeling virtual colony. The system has two majorcomponents: photographs based human modelreconstruction and anthropometry based automatichuman model edit, both of them were advanced to achievemore practical and realistic purpose. To demonstrate thepower of this approach, the method was applied togenerate some virtual colonies.
A Non-intrusive Infrastructure for the Integration of Business Processes
Authors: Marcelo Trannin Machado, Marcos R. S. Borges, Renata Mendes Araujo
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This work presents the development of an infrastructure for supporting the definition and enactment of integrated business processes in virtual enterprises. The proposed interaction adopts the concept of service as an abstraction of a process that needs to flow between enterprises. The infrastructure consists of software components that allow the monitoring and the coordination of services and virtual processes, besides the tools required for the process modeling and enactment.
Aperiodic Linearly Repetitive Delone Sets Are Densely Repetitive
Authors: Daniel Lenz
Venue: Discrete Computational Geometry (2004)

We show that aperiodic linearly repetitive Delone sets are densely repetitive. This confirms a conjecture of Lagarias and Pleasants.
Finite Precision Analysis of Support Vector Machine Classification in Logarithmic Number Systems
Authors: Faisal M. Khan, Mark G. Arnold, William M. Pottenger
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In this paper we present an analysis of the minimal hardware precision required to implement Support Vector Machine (SVM) classification within a Logarithmic Number System architecture. Support Vector Machines are fast emerging as a powerful machine-learning tool for patternrecognition, decision-making and classification. Logarithmic Number Systems (LNS) utilize the property of logarithmic compression for numerical operations. Within the logarithmic domain, multiplication and division can be treated simply as addition or subtraction. Hardware computation of these operations is significantly faster with reduced complexity. Leveraging the inherent properties of LNS, we are able to achieve significant savings over double-precision floating point in an implementation of a SVM classification algorithm.
A Formal Approach to Frequent Energy Adaptations for Multimedia Applications
Authors: Christopher J. Hughes, Sarita V. Adve
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

Much research has recently been done on adapting architecturalresources of general-purpose processors to saveenergy at the cost of increased execution time. This workexamines adaptation control algorithms for such processorsrunning real-time multimedia applications. The best previousalgorithms are mostly heuristics-based and ad hoc, requiringan impractically large amount of application- andresource-specific tuning.We take a more formal approach that does not require thelarge tuning effort of previous approaches, and yet obtainsaverage energy savings comparable to the best previous approach.We pose control algorithm design as a constrainedoptimization problem: what configuration should be used ateach point in the program to minimize energy for a targetedperformance given that each configuration has a differentenergy-performance tradeoff at each point? We solve thiswith the method of Lagrange multipliers, which assumesknowledge of the energy-performance tradeoffs. We developa technique to estimate these tradeoffs using properties ofmultimedia applications. Our technique is likely extendibleto other application domains.We compare our algorithm to the best previous algorithmfor real-time multimedia applications, which is heuristics-based.We demonstrate the practical difficulty of the tuningprocess for the previous algorithm. Compared to apainstakingly hand-tuned version of that algorithm, ournew algorithm provides similar energy savings through amore formal approach that does not need such heroic tuning,making it practical to implement.
What really makes students like a web site? What are the implications for designing web-based language learning sites?
Authors: Jane Hughes, Claire McAvinia, Terry King
Venue: ReCALL (2004)

Faced with reduced numbers choosing to study foreign languages (as in England and Wales), strategies to create and maintain student interest need to be explored. One such strategy is to create &lsquo;taster&rsquo; courses in languages, for potential university applicants. The findings presented arise from exploratory research, undertaken to inform the design of a selection of web-based taster courses for less widely taught languages. 687 school students, aged 14-18, were asked to identify a web site that they liked and to state their main reason for liking it. They were invited to include recreational sites and told that their answers could help with web design for the taster courses. To explore the reasons, two focus groups were conducted and student feedback on the developing taster course site was collected. Students nominated search engines and academic sites, sites dedicated to hobbies, enthusiasms, youth culture and shopping. They liked them for their visual attributes, usability, interactivity, support for schoolwork and for their cultural and heritage associations, as well as their content and functionality. They emerged as sensitive readers of web content, visually aware and with clear views on how text should be presented. These findings informed design of the taster course site. They are broadly in line with existing design guidelines but add to our knowledge about school students&rsquo; use of the web and about designing web-based learning materials. They may also be relevant to web design at other levels, for example for undergraduates.
Correlation Structure of Landscapes of NP-Complete Optimization Problems at Finite Temperatures
Authors: Wolfgang Gehring, Peter Salamon, Roger E. Whitney, Paolo Sibani
Venue: Open Systems Information Dynamics (2004)

We analyze the autocorrelation function of a time series of energy values sampled in the energy landscapes of four different combinatorial optimization problems by a Metropolis random walk. The temperature of the walk and the size of the investigated problems are systematically varied. We find that, in a suitably defined high temperature region the autocorrelation decays in an exponential fashion. We extract the temperature and system size dependence of the corresponding correlation time, which turns out to be of the Arrhenius form. Energetic and entropic contributions to the correlation time (barriers) are identified and shown to be asymptotically independent of system size.
Investigations in Applying Metrics to Multi-View Architecture Models
Authors: Johan Muskens, Michel Chaudron, Christian Lange
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The goal of our research is to develop industry-proof software architecture and design metrics. We identify a number of problems that arise in computing software architecture and design metrics in industrial settings that were not encountered in computing source-code metrics. These problems include the absence of a single, unifying representation for architectures and they arise from the fact that architecture diagrams are used in an informal manner. In this paper we describe our approach towards defining metrics for architectures and designs which are represented in the 4+1 views paradigm using UML. We report our experiences with architectural metrics in industrial settings.
Efficient and flexible parallel retrieval using priority encoded transmission
Authors: Ramaprabhu Janakiraman, Lihao Xu
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Many applications, including web transfers, software distribution, video-on-demand, and peer-to-peer data downloads, require the retrieval of structured documents consisting of multiple components like images, video, and text. Large systems using these applications may be made more scalable by using efficient data distribution techniques like multicast, and by enabling clients to retrieve data from multiple servers in parallel.In this paper we propose a new technique for parallel retrieval of structured documents from multiple servers using priority encoded transmission, which allows some subsets of a transmission to be reconstructed before others. We discuss the application of this technique to bulk and streaming media distribution, and provide performance results from trace-based simulations.
Automated Synthesis of Multitolerance
Authors: Sandeep S. Kulkarni, Ali Ebnenasir
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

We concentrate on automated synthesis of multitolerant programs,i.e., programs that tolerate multiple classes of faultsand provide a (possibly) different level of fault-tolerance toeach class. We consider three levels of fault-tolerance: (1)failsafe, where in the presence of faults, the synthesized programguarantees safety, (2) nonmasking, where in the presenceof faults, the synthesized program recovers to states fromwhere its safety and liveness are satisfied, and (3) maskingwhere in the presence of faults the synthesized program satisfiessafety and recovers to states from where its safety andliveness are satisfied.We focus on the automated synthesis of finite-state multitolerantprograms in high atomicity model where the programcan read and write all its variables in an atomic step. Weshow that if one needs to add failsafe (respectively, nonmasking)fault-tolerance to one class of faults and masking fault-toleranceto another class of faults then such addition canbe done in polynomial time in the state space of the fault-intolerantprogram. However, if one needs to add failsafefault-tolerance to one class of faults and nonmasking fault-toleranceto another class of faults then the resulting problemis NP-complete. We find this result to be counterintuitivesince adding failsafe and nonmasking fault-tolerance to thesame class of faults (which is equivalent to adding maskingfault-tolerance to that class of faults) can be done in polynomialtime, whereas adding failsafe fault-tolerance to oneclass of faults and nonmasking fault-tolerance to a differentclass of faults is NP-complete.
C2P2: A Peer-to-Peer Network for On-Demand Automobile Information Services
Authors: Shahram Ghandeharizadeh, Bhaskar Krishnamachari
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This short paper outlines challenges of delivering continuous media and traffic information to mobile Car-to-Car Peer-to-Peer (C2P2) network of devices. We analyze network connectivity of a C2P2 cloud as a function of radio range of each device. A novel concept introduced by C2P2 is on-demand delivery of continuous media, audio and video clips, to moving vehicles.
Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks
Authors: Abderezak Touzene
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

The need for collective communication procedures such as One-to-All broadcast, All-to-All broadcast arises in many parallel or distributed applications. Many of these communication procedures have been studied for many topologies of interconnection networks such as hypercubes, meshes, De Bruijn, star graphs and butterflies. In this paper we propose a construction of multiple edge-disjoint spanning trees for the k-ary n-cube which can be used to derive an optimal and fault tolerant broadcasting algorithm. We propose also an optimal All-to-All broadcasting algorithm. We consider the k-ary n-cube as a point-to-point interconnection, using store-and-forward, all-port assumption and a linear communication model.
Impulse Gauss curvatures: 2002 SSHE-MA conference
Authors: Howard Iseri
Venue: Smarandache Notions Journal (2004)

In Riemannian (differential) geometry, the differences between Euclidean geometry, elliptic geometry, and hyperbolic geometry are understood in terms of curvature. I think Gauss and Riemann captured the essence of geometry in their studies of surfaces and manifolds, and their point of view is spectacularly illuminating. Unfortunately, curvature is highly non-trivial to work with. I will talk about a more accessible version of curvature that dates back to Descartes.
A Complexity-Effective Approach to ALU Bandwidth Enhancement for Instruction-Level Temporal Redundancy
Authors: Angshuman Parashar, Sudhanva Gurumurthi, Anand Sivasubramaniam
Venue: ACM SIGARCH Computer Architecture News (2004)

Previous proposals for implementing instruction-level temporalredundancy in out-of-order cores have reported a performancedegradation of upto 45% in certain applications compared to anexecution which does not have any temporal redundancy. An importantcontributor to this problem is the insufficient number ofALUs for handling the amplified load injected into the core. At thesame time, increasing the number of ALUs can increase the complexityof the issue logic, which has been pointed out to be oneof the most timing critical components of the processor. This paperproposes a novel extension of a prior idea on instruction reuseto ease ALU bandwidth requirements in a complexity-effective wayby exploiting certain interesting properties of a dual (temporallyredundant) instruction stream. We present microarchitectural extensionsnecessary for implementing an instruction reuse buffer(IRB) and integrating this with the issue logic of a dual instructionstream superscalar core, and conduct extensive evaluationsto demonstrate how well it can alleviate the ALU bandwidth problem.We show that on the average we can gain back nearly 50%of the IPC loss that occurred due to ALU bandwidth limitationsfor an instruction-level temporally redundant superscalar execution,and 23% of the overall IPC loss.
A CAVE-like environment as a tool for full-size train design
Authors: J. Seron, Diego Gutierrez, A. Magallon, J. Sobreviela, A. Gutierrez
Venue: Virtual Reality (2004)

Simulations of models, in all different areas, is an expanding, attractive line of work. More and more applications are taking advantage of the improvements in technology and knowledge in this field, thus achieving results that would have been impossible to achieve with a real model, or foreseeing facts that otherwise would have been encountered too late in the production process. The rail industry is one possible beneficiary of this approach. Usually, before commencing the fabrication process of a new train, the construction of a full-size model is mandatory. Instead of building this full-size real model, which leaves little room for later, last-minute modifications, a virtual model can be built in the digital realm, thus offering a new platform for easier interaction with it. In this article, a simulation of a train is presented in order to tackle visual, aesthetic and ergonomic issues. The simulation runs on a PC-based CAVE-like architecture, offering a certain degree of interaction to the user, and combines static and dynamic computer-generated imagery, both with and without stereoscopy for 3D visualisation, as well as augmented virtuality techniques for the integration of the train with its environment.
Adapting the Communication of Web Services to the Language of Their User Community
Authors: Kurt Englmeier, Fionn Murtagh, Josiane Mothe, Maximilian Stempfhuber
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

This paper presents the WS-Talk interface layer, aconcept for a structured natural language interfacewhich virtualizes the composition of Web services atthe end-user's side. As the number of available Webservices grows, the representation of the context inwhich they are used becomes more and more an issuefor both service providers and service consumers.While providers concentrate more on the technicallevels of activation and communication within aservice network, the users, i.e. the service consumers,want to form ad-hoc collaborations between Webservices. To shield users of Web services from thetechnical details of finding and combining them, asemantic level has to be found that suits their specificneeds and expertise. Through a semantic layer, WS-Talktries to create a level of abstraction that enablesviews on services expressed in natural language. Toreduce the complexity of natural language, domain-specificlanguages are defined and their semantics aremapped onto Web services and their attributes. Thedomain of economics is currently used for testingarchitecture and usage aspects of the WS-Talkinterface layer.
A decentralized algorithm for spectral analysis
Authors: David Kempe, Frank McSherry
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

In many large network settings, such as computer networks, social networks, or hyperlinked text documents, much information can be obtained from the network's spectral properties. However, traditional centralized approaches for computing eigenvectors struggle with at least two obstacles: the data may be difficult to obtain (both due to technical reasons and because of privacy concerns), and the sheer size of the networks makes the computation expensive. A decentralized, distributed algorithm addresses both of these obstacles: it utilizes the computational power of all nodes in the network and their ability to communicate, thus speeding up the computation with the network size. And as each node knows its incident edges, the data collection problem is avoided as well.Our main result is a simple decentralized algorithm for computing the top k eigenvectors of a symmetric weighted adjacency matrix, and a proof that it converges essentially in O(τMIXlog2 n) rounds of communication and computation, where τMIX is the mixing time of a random walk on the network. An additional contribution of our work is a decentralized way of actually detecting convergence, and diagnosing the current error. Our protocol scales well, in that the amount of computation performed at any node in any one round, and the sizes of messages sent, depend polynomially on k, but not on the (typically much larger) number n of nodes.