ppxscal/embedding_network huggingface dataset:
Hypercube subgraphs with local detours
Authors: Peter Hamburger, Alexandr V. Kostochka, Alexander Sidorenko
Venue: Journal of Graph Theory (1999)

A minimal detour subgraph of the n-dimensional cube is a spanning subgraph G of Qn having the property that, for vertices x, y of Qn, distances are related by dG(x, y) &le; dQn(x, y) + 2. For a spanning subgraph G of Qn to be a local detour subgraph, we require only that the above inequality be satisfied whenever x and y are adjacent in Qn. Let f(n) (respectively, fl(n)) denote the minimum number of edges in any minimal detour (respectively, local detour) subgraph of Qn (cf. Erd&ouml;s et al. [1]). In this article, we find the asymptotics of fl(n) by showing that 3 &middot; 2n(1 - 풪(n-1/2)) < fl(n) < 3 &middot; 2n(1 + o(1)). We also show that f(n) > 3.00001 &middot; 2n (for n > n0), thus eventually fl(n) < f(n), answering a question of [1] in the negative. We find the order of magnitude of Fl(n), the minimum possible maximum degree in a local detour subgraph of Qn: $\sqrt{2n + 0.25} - 0.5 \leq F_{l}(n) \leq 1.5\sqrt{2n} - 1.$ &copy; 1999 John Wiley Sons, Inc. J Graph Theory 30: 101111, 1999 Dedicated to the memory of Paul Erd&ouml;s.
Directional Lapped Transforms for Image Coding
Authors: Jizheng Xu, Feng Wu, Jie Liang, Wenjun Zhang
Venue: Proceedings of the Data Compression Conference (2008)

This paper presents a scheme to design directional lapped transforms. Lapped transforms can be factorized into lifting steps. By introducing directional operator into each lifting step, the directional lapped transform is constructed. The directional lapped transform proposed not only preserves the advantages of lapped transforms, it also can represent directional signals more efficiently. An image coding scheme using the directional lapped transform is also described. Compared to the state-of-the-art image coding using lapped transform, HD Photo, the proposed scheme shows more than 20dB’s gain for artificial images with strong directional correlations. And for natural images, up to 1.5dB’s gain can also be observed.
Simulation of an Electrical Substation Using the Bond Graph Technique
Authors: Gregorio Romero, Jesus Felez, Joaquin Maroto, Jose Manuel Mera
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Simulation and especially computer simulation, is a basic tool since it enables engineers to understand how systems work without actually needing to see them. They can learn how they work in different circumstances and optimize their design with considerably less cost in terms of time and money than if they had to carry out tests on a physical system. There is a wide range of commercial brands on the market offering products for electrical simulation. These are powerful tools, but require the engineer to have a perfect knowledge of the electrical field. This work will firstly develop the simulation models of different elements that characterise an electrical substation in isolation; they will then be put together to model the full system, all of this using the Bond Graph technique. Finally, the system thus developed will be compared with the one developed in a specific electrical simulation program.
The Hidden Difficulties of Watching and Rebuilding Networks
Authors: Michael E. Locasto, Angelos Stavrou
Venue: IEEE Security and Privacy (2008)

Network protection can be difficult even for experienced IT staff and security researchers. In this installment of Secure Systems, the authors focus on two areas of network defense that are particularly troublesome to manage: network intrusion recovery and ubiquitous network monitoring.
Visions for application development on hybrid computing systems
Authors: Roger D. Chamberlain, Joseph M. Lancaster, Ron K. Cytron
Venue: Parallel Computing (2008)

Hybrid computing systems (incorporating FPGAs, GPUs, etc.) have received considerable attention recently as an approach to significant performance gains in many problem domains. Deploying applications on these systems, however, has proven to be difficult and very labor intensive. In this paper we review the current state of practice for application development on hybrid systems. We also present our vision of the application development languages and tools that we believe would greatly benefit the process of designing, implementing, and deploying applications on hybrid systems.
A multiresolution information measure approach to speech recognition
Authors: María E. Torres, Hugo L. Rufiner, Diego H. Milone, Analía S. Cherniz
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

When automatic speech recognition systems trained with clean signals are tested with noisy signals, deterioration in their performance have been observed. Continuous multiresolution entropy have shown to be robust to additive noise in applications to different physiological signals and, in particular, in some speech signal contexts. In this paper we present its extension to different divergences and we propose them as new dimensions at the pre-processing stage of a speech recognizer. Methods proposed here are tested with speech signals corrupted with babble and white noise. Their performance are compared with the classical mel cepstra parametrization. Results suggest that continuous multiresolution entropy related measures provide valuable information that could be considered as an extra component in a pre-processing stage.
Student life in computing: a variety of conflicting moral requirements
Authors: Tero Vartiainen
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

Moral conflicts are inherent in human life and we try to arrange our societies to avoid the most dilemmatic decision-making situations. Few studies on ethical issues in computing education exist, and this one takes a step forward in filling this gap in knowledge. The study concerns moral conflicts in student life as perceived by information systems (IS) students in a Finnish university. Their perceptions were collected from a given discussion task and a phenomenographical approach was taken in the data analysis. Nine categories were found along two dimensions. On the first dimension the moral conflicts related to choosing the study line, carrying out the study tasks and engaging in extra-mural activities, and the pressures associated with student life. The second dimension revealed the intentions behind the conflicts: moral conflicts were reflected through self-concern, maintaining relations, and upholding society. Implications for research and practice are suggested.
Color-Space CAD: Direct Gamut Editing in 3D
Authors: Neophytos Neophytou, Klaus Mueller
Venue: IEEE Computer Graphics and Applications (2008)

Color-Space CAD is an interactive image-processing framework that lets users manipulate colors directly in 3D perceptual color space. Unlike traditional 2D color-manipulation tools, which often require multiple iterations, Color-Space CAD allows direct 3D navigation of the solution space. The framework uses graphics hardware to accelerate the computation-intensive mapping operations.
Ultimate Learning Guide to Microsoft Office Project 2007
Authors: Dale A. Howard, Gary L. Chefetz
Venue:  (2007)

Welcome to the Ultimate Learning Guide to Microsoft Office Project 2007. You selected the right book if you seek a complete learning experience and reference manual for managing projects using the Microsoft Office Project 2007 desktop application. Our goal in writing this book is to teach you how to use the software effectively. We take a systematic approach to the topical ordering which follows the Project Management Institute (PMI) standard. The first 12 modules teach you foundational skills by following the project life cycle. In these modules, you learn how to define a new project, plan your project with tasks, resources, and assignments, analyze the Critical Path, baseline your project, enter actual progress, analyze variance, revise your project, report project progress, and then close out the project. The next 10 modules teach you advanced techniques for using Microsoft Office Project 2007. You learn in-depth knowledge about standard and custom Fields, Calendars, scheduling, costing, Critical Path analysis, managing risks, and exchanging project data with other applications. You learn how to locate and level overallocated resources, how to create and use a shared Resource Pool file and a master project, and how to record and write macros in VBA. Throughout each module, we provide a generous amount of Notes, Warnings, and Best Practices. Notes call your attention to important additional information about a subject. Warnings help you to avoid the most common problems experienced by others and Best Practices provide tips for using the tool based on our field experience. After reading this book, we believe that you will be much more effective using Microsoft Office Project 2007. Download the sample files from the official book site and work your way through the hands-on lessons in each module. By the time you complete the lessons, you'll be an expert too!
Implementation of Collaborative Control in Supply Chain Management by Using DA and Workflow Technology
Authors: Tianyang Wang, Zhiyi Fang, Lianyu Zhao, Dan Zhao, Peng Xu, Jin Liu
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The traditional Workflow technology has many disadvantages when applied in the inter-enterprise supply chain management systems. To overcome these disadvantages we design a cooperative control framework based on both integrated-distributed Agent and Workflow technology. we implemented the cooperating process between the Collaborative originating Agent and Collaborative participation Agent taking advantage of the MSA Collaborative model; Based on the RAWF (Roled-driven Agent Workflow, RAWF) distributed transaction processing model , we described the dependence between different tasks. Finally we implemented the supply chain management system on the JADE platform and J2EE development frameworks.
Integration of dynamic AOP into the OSGi service platform
Authors: Florian Irmert, Frank Lauterwald, Matthias Bott, Thomas Fischer, Klaus Meyer-Wegener
Venue: Proceedings of the 2nd workshop on Middleware-application interaction: affiliated with the DisCoTec federated conferences 2008 (2008)

The ability to adapt to different computing environments or external changes is an important requirement for both stationary and mobile computing. Without this ability, all requirements have to be foreseen, which is often not possible in practice. Classical software engineering approaches often lead to redeployment or even software migration. Therefore loosely coupled software design and a dynamic adaptation model are required. Dynamic aspect-oriented programming (d-AOP) in conjunction with service oriented programming is well suited to face this demand. One well known approach providing a service-oriented component model is the OSGi Service Platform. This paper introduces our approach to combine an OSGi Framework with d-AOP to establish dynamic adaptation of core concerns as well as crosscutting concerns. Seamless integration of current d-AOP frameworks is managed by mapping aspect deployment and undeployment to OSGi bundle lifecycle operations without affecting the deployment model. Unlike former proposals, this approach retains the strict separation of bundles as mandated by OSGi.
Innovative Control System for Industrial Environment
Authors: Maxim Foursa, David d'Angelo, Rejin Narayanan
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

In this paper we present preliminary results of the ongoing research of a new industrial control system with a special stress on user interfaces and data representation. The main focus of our research is the combination of traditional control interfaces for manufacturing machines with new ubiquitous services, handheld computers and Virtual Reality installations. Our system can support both industrial operators and managers by providing them with a new powerful tool, which can help them monitoring their environment and supervise production processes in a very convenient way. We also describe a miniature simulation model produced for development purposes. The research has been performed within the framework of EU-supported project INT-MANUS.
Using B+-trees for processing of line segments in large spatial databases
Authors: Hung-Yi Lin
Venue: Journal of Intelligent Information Systems (2008)

Points, lines, and regions are the three basic entities for constituting vector-based objects in spatial databases. Many indexing methods (G-tree, K-D-B tree, Quad-tree, PMR-tree, Grid-file, R-tree, and so on) have been widely discussed for handling point or region data. These traditional methods can efficiently organize point or region objects in a space into a hashing or hierarchical directory. They provide efficient access methods to meet the requirement of accurate retrievals. However, two problems are encountered when their techniques are applied to deal with line segments. The first is that representing line segments by means of point or region objects cannot exactly and properly preserve the spatial information about the proximities of line segments. The second problem is derived from the large dead space and overlapping areas in external and internal nodes of the hierarchical directory caused by the use of rectangles to enclose line objects. In this paper, we propose an indexing structure for line segments based on B + -tree to remedy these two problems. Through the experimental results, we demonstrate that our approach has significant improvement over the storage efficiency. In addition, the retrieval efficiency has also been significantly prompted as compared to the method using R-tree index scheme. These improvements derive mainly from the proposed data processing techniques and the new indexing method.
Linear time invariant system order reduction using multipoint step response matching
Authors: S. Mukherjee, R. C. Mittal
Venue: International Journal of Systems Science (2007)

The proposed method of linear time invariant system order reduction is based on multipoint step response matching for both pole and zero evaluation of the reduced order system (ROS). Depending on the number of zeros and poles of the ROS, the number of points is selected on the time axis of the unit step response such that the unknown poles and zeros can be determined by solving a set of non-linear equations using Newton's method. Numerous examples have been solved using the proposed technique and the results are encouraging.
Risk management for distributed authorization
Authors: Christian Skalka, X. Sean Wang Peter Chapin
Venue: Journal of Computer Security (2007)

Distributed authorization takes into account several elements, including certificates that may be provided by non-local actors. While most trust management systems treat all assertions as equally valid up to certificate authentication, realistic considerations may associate risk with some of these elements, for example some actors may be less trusted than others. Furthermore, practical online authorization may require certain levels of risk to be tolerated. In this paper, we introduce a trust management logic based on the system RT that incorporates formal risk assessment. This formalization allows risk levels to be associated with authorization, and authorization risk thresholds to be precisely specified and enforced. We also develop an algorithm for automatic authorization in a distributed environment, that is directed by risk considerations. A variety of practical applications are discussed.
Availability-based noncontiguous processor allocation policies for 2D mesh-connected multicomputers
Authors: Ismail Ababneh
Venue: Journal of Systems and Software (2008)

Various contiguous and noncontiguous processor allocation policies have been proposed for mesh-connected multicomputers. Contiguous allocation suffers from high external processor fragmentation because it requires that the processors allocated to a parallel job be contiguous and have the same topology as the multicomputer. The goal of lifting the contiguity condition in noncontiguous allocation is reducing processor fragmentation. However, this can increase the communication overhead because the distances traversed by messages can be longer, and messages from different jobs can interfere with each other by competing for communication resources. The extra communication overhead depends on how the allocation request is partitioned and mapped to free processors. In this paper, we investigate a new class of noncontiguous allocation schemes for two-dimensional mesh-connected multicomputers. These schemes are different from previous ones in that request partitioning is based on the submeshes available for allocation. The available submeshes selected for allocation to a job are such that a high degree of contiguity among their processors is achieved. The proposed policies are compared to previous noncontiguous policies using detailed simulations, where several common communication patterns are considered. The results show that the proposed policies can reduce the communication overhead and improve performance substantially.
Unequal group variances in microarray data analyses
Authors: Meaza Demissie, Barbara Mascialino, Stefano Calza, Yudi Pawitan
Venue: Bioinformatics (2008)

Motivation: In searching for differentially expressed (DE) genes in microarray data, we often observe a fraction of the genes to have unequal variability between groups. This is not an issue in large samples, where a valid test exists that uses individual variances separately. The problem arises in the small-sample setting, where the approximately valid Welch test lacks sensitivity, while the more sensitive moderated t-test assumes equal variance. Methods: We introduce a moderated Welch test (MWT) that allows unequal variance between groups. It is based on (i) weighting of pooled and unpooled standard errors and (ii) improved estimation of the gene-level variance that exploits the information from across the genes. Results: When a non-trivial proportion of genes has unequal variability, false discovery rate (FDR) estimates based on the standard t and moderated t-tests are often too optimistic, while the standard Welch test has low sensitivity. The MWT is shown to (i) perform better than the standard t, the standard Welch and the moderated t-tests when the variances are unequal between groups and (ii) perform similarly to the moderated t, and better than the standard t and Welch tests when the group variances are equal. These results mean that MWT is more reliable than other existing tests over wider range of data conditions. Availability: R package to perform MWT is available at http://www.meb.ki.se/~yudpaw Contact: yudi.pawitan@ki.se Supplementary information: Supplementary data are available at Bioinformatics online.
DEFECTS 2008: international workshop on defects in large software systems
Authors: Premkumar Devanbu, Brendan Murphy, Nachiappan Nagappan, Thomas Zimmermann, Valentin Dallmeier
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

Bugs are everywhere in today's software and because of the huge economic damage they are actively studied. The goal of this one-day workshop is to connect the different research communities with each other and with industry.
On Distributional Assumptions and Whitened Cosine Similarities
Authors: Marco Loog
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Recently, an interpretation of the whitened cosine similarity measure as a Bayes decision rule was proposed (C. Liu, "The Bayes Decision Rule Induced Similarity Measures,'' IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 6, pp. 1086-1090, June 2007. This communication makes the observation that some of the distributional assumptions made to derive this measure are very restrictive and, considered simultaneously, even inconsistent.
Approximate solution of Abel integral equation
Authors: Li Huang, Yong Huang, Xian-Fang Li
Venue: Computers Mathematics with Applications (2008)

This paper presents a new, stable, approximate inversion of Abel integral equation. By using the Taylor expansion of the unknown function, Abel equation is approximately transformed to a system of linear equations for the unknown function together with its derivatives. A desired solution can be determined by solving the resulting system according to Cramer's rule. This method gives a simple and closed form of approximate Abel inversion, which can be performed by symbolic computation. The nth-order approximation is exact for a polynomial of degree up to n. Abel integral equation is approximately expressed in terms of integrals of input data; so the suggested approach is stable for experimental data with random noise. An error analysis of this approach is given. Finally, several numerical examples are given to illustrate the accuracy and stability of this method.
Zero-knowledge proofs of knowledge without interaction
Authors: A. De Santis, G. Persiano
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

A zero-knowledge proof system of knowledge is a protocol between two parties called the prover and the verifier. The prover wants to convince the verifier that he 'knows' the proof of a given theorem without revealing any additional information. This is different from a zero-knowledge proof system of membership where the prover convinces the verifier only of the veridicity of the statement. Zero-knowledge proofs of knowledge are very useful tools in the design of secure protocols. Though, the concept of a proof of knowledge is a very subtle one and great care is needed to obtain a satisfying formalization. The authors investigate the concept of a zero-knowledge proof of knowledge with a non-interactive model. Here, the prover and the verifier share a short random string and the only communication allowed is from the prover to the verifier. Although this is a simpler model than the interactive one, still formalizing zero-knowledge proofs of knowledge is a delicate task.
Efficient lineage tracking for scientific workflows
Authors: Thomas Heinis, Gustavo Alonso
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often renders the data set useless from a scientific point of view. On the positive side, capturing provenance information is facilitated by the widespread use of workflow tools for processing scientific data. The workflow process describes all the steps involved in producing a given data set and, hence, captures its lineage. On the negative side, efficiently storing and querying workflow based data lineage is not trivial. All existing solutions use recursive queries and even recursive tables to represent the workflows. Such solutions do not scale and are rather inefficient. In this paper we propose an alternative approach to storing lineage information captured as a workflow process. We use a space and query efficient interval representation for dependency graphs and show how to transform arbitrary workflow processes into graphs that can be stored using such representation. We also characterize the problem in terms of its overall complexity and provide a comprehensive performance evaluation of the approach.