ppxscal/embedding_network huggingface dataset:
The VPN conjecture is true
Authors: Navin Goyal, Neil Olver, F B. Shepherd
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We consider the following network design problem. We are given an undirected graph G=(V,E) with edges costs c(e) and a set of terminal nodes W. A hose demand matrix for W is any symmetric matrix [Dij] such that for each i, ∑ j ≠ i Dij ≤ 1. We must compute the minimum cost edge capacities that are able to support the oblivious routing of every hose matrix in the network. An oblivious routing template, in this context, is a simple path Pij for each pair i,j ∈ W. Given such a template, if we are to route a demand matrix D, then for each i,j we send Dij units of flow along each Pij. Fingerhut et al. and Gupta et al. obtained a 2-approximation for this problem, using a solution template in the form of a tree. It has been widely asked and subsequently conjectured [Italiano 2006] that this solution actually results in the optimal capacity for the single path VPN design problem; this has become known as the VPN conjecture. The conjecture has previously been proven for some restricted classes of graphs [Hurkens 2005, Grandoni 2007, Fiorini 2007]. Our main theorem establishes that this conjecture is true in general graphs. This also gives the first polynomial time algorithm for the single path VPN problem. We also show that the multipath version of the conjecture is false.
Towards an integrated system for planning and assisting maxillofacial orthognathic surgery
Authors: Raphael Olszewski, Marta B. Villamil, Daniela G. Trevisan, Luciana P. Nedel, Carla M. D. S. Freitas, Hervé Reychler, Benoit Macq
Venue: Computer Methods and Programs in Biomedicine (2008)

Computer-assisted maxillofacial orthognathic surgery is an emerging and interdisciplinary field linking orthognathic surgery, remote signal engineering and three-dimensional (3D) medical imaging. Most of the computational solutions already developed make use of different specialized systems which introduce difficulties both in the information transfer from one stage to the others and in the use of such systems by surgeons. Trying to address such issue, in this work we present a common computer-based system that integrates proposed modules for planning and assisting the maxillofacial surgery. With that we propose to replace the current standard orthognathic preoperative planning, and to bring information from a virtual planning to the real operative field. The system prototype, including three-dimensional cephalometric analysis, static and dynamic virtual orthognathic planning, and mixed reality transfer of information to the operation room, is described and the first results obtained are presented.
Efficient algorithms for exact ranked twig-pattern matching over graphs
Authors: Gang Gou, Rada Chirkova
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Querying large-scale graph-structured data with twig patterns is attracting growing interest. Generally, a twig pattern could have an extremely large, potentially exponential, number of matches in a graph. Retrieving and returning to the user this many answers may both incur high computational overhead and overwhelm the user. In this paper we propose two efficient algorithms, DP-B and DP-P, for retrieving top-ranked twig-pattern matches from large graphs. Our first algorithm, DP-B, is able to retrieve exact top-ranked answer matches from potentially exponentially many matches in time and space linear in the size of our data inputs even in the worst case. Further, beyond the linear-cost result of DP-B, our second algorithm, DP-P, could take far less than linear time and space cost in practice. To the best of our knowledge, our algorithms are the first to have these performance properties. Our experimental results demonstrate the high performance of both algorithms on large datasets. We also analyze and compare the performance trade-off between DP-B and DP-P from the theoretical and practical viewpoints.
Bayesian multiple instance learning: automatic feature selection and inductive transfer
Authors: Vikas C. Raykar, Balaji Krishnapuram, Jinbo Bi, Murat Dundar, R. Bharat Rao
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We propose a novel Bayesian multiple instance learning (MIL) algorithm. This algorithm automatically identifies the relevant feature subset, and utilizes inductive transfer when learning multiple (conceptually related) classifiers. Experimental results indicate that the proposed MIL method is more accurate than previous MIL algorithms and selects a much smaller set of useful features. Inductive transfer further improves the accuracy of the classifier as compared to learning each task individually.
Ligand discovery on massively parallel systems
Authors: S. R. Shave, P. Taylor, M. Walkinshaw, L. Smith, J. Hardy, A. Trew
Venue: IBM Journal of Research and Development (2008)

Virtual screening is an approach for identifying promising leads for drugs and is used in the pharmaceutical industry. We present the parallelization of LIDAEUS (LIgand Discovery At Edinburgh UniverSity), creating a massively parallel high-throughput virtual-screening code. This program is being used to predict the binding modes involved in the docking of small ligands to proteins. Parallelization efforts have focused on achieving maximum parallel efficiency and developing a memory-efficient parallel sorting routine. Using an IBM Blue Gene/L™ supercomputer, runtimes have been reduced from 8 days on a modest seven-node cluster to 62 minutes on 1,024 processors using a standard dataset of 1.67 million small molecules and FKBP12, a protein target of interest in immunosuppressive therapies. Using more-complex datasets, the code scales upward to make use for the full processor set of 2,048. The code has been successfully used for the task of gathering data on approximately 1.67 million small molecules binding to approximately 400 high-quality crystallographically determined ligand-bound protein structures, generating data on more than 646 million protein-ligand complexes. A number of novel ligands have already been discovered and validated experimentally.
Inventor and Its Applications, 1st Ed. 2008 edition
Authors: David P. Madsen
Venue:  (2007)

Inventor and Its Applications describes in detail the steps for creating sketches, models, and drawings using Autodesk Inventor 11. The text teaches students how to develop and control sketches with constraints, dimensions, and tables. Once these skills are mastered, the students use the sketches to build models of various complexities, then add features, create assemblies, and develop drawings. The text gives students an opportunity to show off their designs in the form of orthographic drawings, static and dynamic presentations, and photorealistic renderings. Inventor and Its Applications contains over 800 illustrations to reinforce the descriptions and methods covered in the chapters. This text not only teaches how to use Autodesk Inventor, but provides skills that will help learners excel in a career in drafting, design, or engineering.
Domain decomposition with characteristic finite difference method for two-phase displacement problems
Authors: Changfeng Li, Yirang Yuan
Venue: Applied Numerical Mathematics (2008)

Domain decomposition difference schemes modified with characteristic method are presented for two-phase displacement. The pressure equation is discretized by a five-point difference procedure. To compute in parallel, the saturation equation is treated by domain decomposition difference schemes with characteristic approximation, which rely on implicit procedures in subdomains and one-dimensional calculation on the inter-domain boundaries. Error analysis in discrete l^2-norm is discussed. Finally, numerical examples illustrating the theoretical accuracy ant parallelism are shown.
Modelling of Muscle Extension and Flexion for FES-Assisted Indoor Rowing Exercise
Authors: Zakaria Hussain, M. O. Tokhi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents the development of physiological and mathematical model of muscle extension and flexion induced by functional electrical stimulation (FES) for indoor rowing exercise. Three segmental models with nine mono-articular and bi-articular muscle groups are developed to drive hip, knee and ankle extension and flexion. The developed muscle models are evaluated under the dynamic simulation of FES-assisted indoor rowing exercise. The muscle forces and active joint moments generated by each muscle group during rowing manoeuvres are recorded and analysed. In view of good results obtained, it is suggested that the muscle models developed can be used as artificially activated muscle models for future development of FES-assisted indoor rowing exercise.
Crystal Reports (v.8 or v.8.5) Quick Reference Guide
Authors: Beezix Software Services; Inc.
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use Crystal Reports v8.5. The following topics are covered: Creating, Opening, Saving Reports, Using Report Experts, Inserting Fields from a Database, Inserting Text Fields, Moving/Resizing Objects, Using Guides, Formatting Objects, Sorting, Grouping, Editing Groups, Subtotals, Grand Totals, Summary Fields, Record Selection and Criteria, Creating Formulas, Using a Formula to Provide Value to a Control, Syntax Considerations, Inserting Fields in Text Objects, The Visual Linking Expert, PC/SQl/ODBC Links, Removing a Table, Section Formatting, and Exporting Reports. Also includes lists of Shortcuts and Selection Methods. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
The myth of find: user behaviour and attitudes towards the basic search feature
Authors: Fernando Loizides, George R. Buchanan
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

The ubiquitous within-document text search feature (Ctrl-F) is considered by users to be a key advantage in electronic information seeking [1]. However what people say they do and what they actually do are not always consistent. It is necessary to understand, acknowledge and identify the cause of this inconsistency. We must identify the physical and cognitive factors to develop better methods and tools, assisting with the search process. This paper discusses the limitations and myths of Ctrl-f in information seeking. A prototype system for within-document search is introduced. Three user studies portray shared behaviour and attitudes, common between participants regarding within-document searching.
Service-Aware Multi-Constrained Routing Protocol with QoS Guarantee Based on Fuzzy Logic
Authors: Zuo Jing, Chi Xuefen, Lin Guan, Li Hongxia
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Single-constrained QoS (Quality of Service) routing protocols have inherent shortcomings when they are applied to ad hoc networks. Only considering a single constraint parameter can’t always cope with the problems aroused by the uncertainty of ad hoc networks well. This paper proposes a multi-constrained QoS routing protocol based on fuzzy logic. The protocol is service-aware. It considers the QoS requirements asked by different kinds of services and takes different network state parameters as the constraint conditions. New route informing mechanism is proposed to support route update; speed of packets sending is adjusted in terms of the output of fuzzy system; and routing algorithm for real time traffic is optimized to assure that data are always transmitted through the route with the lowest delay. The simulation results show that the improved protocol has better features on delay, delay variation, packet loss rate and throughput compared to single-constrained QoS routing protocol.
Approximate analysis of LRU in the case of short term correlations
Authors: Antonis Panagakis, Athanasios Vaios, Ioannis Stavrakakis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

One of the most widely considered cache replacement policies is least recently used (LRU) based on which many other policies have been developed. LRU has been studied analytically in the literature under the assumption that the object requests are independent. However, such an assumption does not seem to be in agreement with recent studies of Web-traces, which indicate the existence of short term correlations among the requests. This paper introduces an approximate analysis that fairly accurately predicts the hit ratio of the LRU policy in the case of short term correlations. The approximation approach is based on the relation between the working set model and LRU, while the request generation process is assumed to follow a recently proposed model for Web-traces, which captures short term correlations among the requests. The accuracy of the introduced approximate analysis is validated for synthetic as well as real Web-traces.
Pileus: umbrella for mobile augmented reality
Authors: Sho Hashimoto, Takashi Matsumoto, Naohito Okude
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Pileus is the Internet umbrella which augments experience in rainy days. It was designed to couple embodied interaction and social function on the web. It has a built-in camera, a GPS and a large screen under surface of an umbrella to cooperate with photo-sharing service on the internet (Flickr) and 3d-map navigation (Google Earth) in a city. In this paper, we describe that; Pileus is a medium with walking activity to interact with information embedded in a city by metadata.
Rapid manufactured textiles
Authors: G. A. Bingham, R. J. M. Hague, C. J. Tuck, A. C. Long, J. J. Crookston, M. N. Sherburn
Venue: International Journal of Computer Integrated Manufacturing (2007)

Rapid Manufacturing (RM) is increasingly becoming a viable manufacturing process due to dramatic advantages that are achievable in the area of design complexity. Through the exploration of the design freedom afforded by RM, this paper introduces the concept and novel research area of RM textiles. The paper highlights the design and manufacturing possibilities applied to textiles when considering additive manufacturing techniques, the current limitations of conventional Computer Aided Design (CAD) software when creating RM textile three-dimensional (3D) data and the potential use of dedicated 'textile CAD'. A methodology for the generation of 3D conformal RM textile articles is presented in addition to the initial investigation of 'efficient manufacture' by the collapsing of RM textile structures into their lowest potential energy state. The work concludes that through the utilization of RM it is entirely possible to manufacture a structure that incorporates drape and free movement properties directly comparable with conventional textiles.
Multiple models switching control based on recurrent neural networks
Authors: Jun-Yong Zhai, Shu-Min Fei, Xiao-Hui Mo
Venue: Neural Computing and Applications (2008)

This paper presents a novel approach in designing adaptive controller to improve the transient performance for a class of nonlinear discrete-time systems under different operating modes. The proposed scheme consists of generalized minimum variance (GMV) controllers and a compensating controller. GMV controllers are based on the known nominal linear multiple models, while the compensating controller is based upon a recurrent neural network. The adaptation law of network weight is derived from Lyapunov stability theory. A suitable switching control strategy is applied to choose the best controller by the performance indices at every sampling instant. Simulations are discussed in order to illustrate the merits of the proposed method.
Creating hierarchical categories using cell assemblies
Authors: Christian R. Huyck
Venue: Connection Science (2007)

Highly recurrent neural networks can learn reverberating circuits called Cell Assemblies (CAs). These networks can be used to categorize input, and this paper explores the ability of CAs to learn hierarchical categories. A simulator, based on spiking fatiguing leaky integrators, is presented with instances of base categories. Learning is done using a compensatory Hebbian learning rule. The model takes advantage of overlapping CAs where neurons may participate in more than one CA. Using the unsupervised compensatory learning rule, the networks learn a hierarchy of categories that correctly categorize 97% of the basic level presentations of the input in our test. It categorizes 100% of the super-categories correctly. A larger hierarchy is learned that correctly categorizes 100% of base categories, and 89% of super-categories. It is also shown how novel subcategories gain default information from their super-category. These simulations show that networks containing CAs can be used to learn hierarchical categories. The network then can successfully categorize novel inputs.
Simple construction of almost k-wise independent random variables
Authors: N. Alon
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The authors present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is O(log log n+k+log 1/ epsilon ), where epsilon is the statistical difference between the distribution induced on any k-bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by J. Naor and M. Naor (1990). An advantage of the present constructions is their simplicity. Two of the constructions are based on bit sequences that are widely believed to possess randomness properties, and the results can be viewed as an explanation and establishment of these beliefs.
User-centric PKI
Authors: Radia Perlman, Charlie Kaufman
Venue: Proceedings of the 7th symposium on Identity and trust on the Internet (2008)

The goal of supporting Single Sign-On to the Web has proven elusive. A number of solutions have been proposed -- and some have even been deployed -- but the capability remains unavailable to most users and the solutions deployed raise concerns for both convenience and security. In this paper, we enumerate desirable attributes in a scheme for authenticating from an Internet browser to a web site and the authorization that follows. We categorize the currently deployed or advocated approaches, describing their benefits and issues, and we suggest incremental improvements to such schemes. We then outline a design for public-key based authentication particularly suited to what we believe to be the common case: users, acting on their own behalf (as opposed to as an employee of an organization), performing actions on the web such as making a purchase or maintaining an account at a service provider. We contrast the usability/privacy/security properties of our design with other identity management/authentication schemes deployed or being proposed today. Our design is truly user-centric, in the sense that the user acts as his own CA, and as a decision point for authorizing release of user information to web sites, rather than having an Identity Provider be the center of trust.
Precomputed radiance transfer for X3D based mixed reality applications
Authors: Tobias Franke, Yvonne Jung
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

We present a lightweight framework composed of two extensions to introduce precomputed radiance transfer (PRT) to X3D. Depending on the basis function, PRT is used to simulate shading, complex light transfer and effects like subsurface scattering and caustics in real time by projecting incident light and transfer functions into frequency space, which allows the solution of the integration of the rendering equation through a simple dot product. Light transfer from incident to transferred radiance thus becomes a matter of solving dot products of coefficient vectors, which can be easily evaluated on the GPU. In this paper, we identify the minimal set of components needed for an X3D application to use spherical harmonic based PRT, and discuss how further enhancements to PRT can be implemented, like new basis functions and other features.
Secure E-cheques for Joint Accounts with Collective Signing Using Forward-Secure Multi-signature Scheme
Authors: N. R. Sunitha, B. B. Amberker, Prashant Koulgi
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

With the modern world going on-line for all businesses, we need to transact with various business organisations all over the world using different modes of payment obtained through various Financial Institutions. We propose a scheme for Joint Account Holders with collective signing agreement to issue e-cheques. Our scheme is based on multi-signatures. When an e-cheque belonging to a Joint Account is submitted by a bank for clearance, the bank clearing the e-cheque can verify that it is signed by all the Joint Account Holders using a single verification equation. Also, the bank can maintain just a single public key for one joint account though multiple signers are involved. We have augmented the multi-signature scheme to provide forward-security. This guarantees the security of cheques signed in the past even if the signer's secret key is exposed today.
East China power market development and trial operation
Authors: Wei Xuehao, Zhu Feng, Jiang Chuanwen, Houzhijian Houzhijian
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The monthly market of East China Power Market (ECPM) started trial operation on May 18, 2004. This paper outlines the profile of the East China Power Grid and summarizes the development of ECPM. In particular, the paper describes the market structure that ECPM has selected, and analyzes the results of ECPM trial operation. The underlining rationale that determines the market behavior is explored, and recommendations for further improvement are provided.
Best Video Stream Variation Selection in Wireless Networks
Authors: A. Kamoun, F. Zarai, L. Kamoun
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper, we propose an algorithm of video transmission adaptation by automatic selection of variation based on the calculation of the score value that depends closely on the preferences user, networks conditions, and applications requirements (in terms of image quality and fidelity). This function of score value reflects the quality of satisfaction of the user preference and network condition with the adapted strategy. Numeric some results prove the efficiency of the solution proposed well.
Education: Teaching 3D modelling and visualization using VTK
Authors: Paulo Dias, Joaquim Madeira, Beatriz Sousa Santos
Venue: Computers and Graphics (2008)

In the last two years, we have been using the Visualization Toolkit (VTK) as a tool for teaching ''3D Modelling and Visualization'', an elective course offered to Computer Engineering students. Students start by using OpenGL and, afterwards, use VTK in half of their lab classes, in order to accomplish some tasks and acquire knowledge on its features and functionalities. They are also required to develop a visualization application based on VTK. We first present the motivation for using VTK and the main features of the ''3D Modelling and Visualization'' course. Afterwards, we describe some of the most successful projects developed by our students. Then, we globally analyse the effectiveness of using VTK, and present the results of a questionnaire handed out to the students who attended the course in the last semester.