ppxscal/embedding_network huggingface dataset:
Abel's method on summation by parts and theta hypergeometric series
Authors: Wenchang Chu, Cangzhi Jia
Venue: Journal of Combinatorial Theory Series A (2008)

Abel's lemma on summation by parts is reformulated to investigate systematically terminating theta hypergeometric series. Most of the known identities are reviewed and several new transformation and summation formulae are established. The authors are convinced by the exhibited examples that the iterating machinery based on the modified Abel lemma is powerful and a natural choice for dealing with terminating theta hypergeometric series.
Propagation of engineering changes to multiple product data views using history of product structure changes
Authors: N. Do, I. J. Choi, M. Song
Venue: International Journal of Computer Integrated Manufacturing (2008)

The present paper proposes a comprehensive procedure for engineering change propagation in order to maintain consistency between various product data views. A product data model is also proposed for the propagation procedure, which integrates base product definitions for product design, and product data views for other manufacturing or customer support. The product data view in the proposed model enables manufacturing or customer support engineers to define their own product data views, without copying the existing product definition. Integrated with other components, the engineering changes in the data model provide structure-oriented change history, effectivity management for production, and integration with product configurations. Based on the integrated product data model, the proposed procedure propagates engineering changes to product data views using the history of product structure changes. The propagation procedure maintains consistency of product data during collaboration between various design, manufacturing and customer support departments, who have different product data views. Prototype database applications together with an example of illustrative change propagation are also presented.
Microsoft Groove 2007 Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use Microsoft Office Groove 2007. The following topics are covered: The Groove Notification Icon, Creating an Account, Opening the Groove Launchbar, Logging On/Off, Resetting your Groove Password, Creating a Standard Workspace, Adding People to a Workspace, Accepting Workspace Invitations, Opening a Workspace, Working with Workspace Tools, Unread/Read Show/Hide the Workspace Members Panel, Chatting with Workspace Members, Navigating Together, Using the Files Tool, Using the Discussion Tool, Creating a New Topic, Creating a Response, Editing a Topic/Response, expanding/Collapsing Topics, Changing How Topics are Listed, Using the Calendar Tool, Deleting a Workspace, Adding a Contact, Organizing Contacts and Workspaces in the Launchbar, Sending a Message, and Viewing Message History. Also includes a list of keyboard shortcuts and indicators.
Image authentication and recovery scheme based on watermarking technique
Authors: Kenji Sumitomo, Mariko Nakano, Hector Perez
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

Actually digital images are used to show some important evidences, however once they are propagated through an open channel such as Internet, these images are easy targets of malicious modification. In this paper, we propose a watermarking based image authentication scheme, in which owner's blocks of interest are authenticated using embedded watermark. If the scheme determined that these blocks were modified intentionally, the resume of the original version of these blocks is recovered without any additional information. Also the embedded watermarks are enough robust to no-intentional attacks, such as JPEG compression and noise contamination. In the watermark embedding process, watermark sequence is extracted from the blocks of interest of the image and it is embedded into the corresponding DCT blocks indicated by a previously generated mapping list. In the authentication and recovery process, the watermark sequence is extracted from the corresponding DCT blocks and then it is compared with the sequence extracted from the blocks of interest to determine its authenticity. The proposed system use only a secret key to generate the mapping list to map owner's blocks of interest and other blocks. The evaluation results show efficient authentication and recovery capacity of the proposed scheme.
Robot localisation and mapping with stereo vision
Authors: A. Cumani, S. Denasi, A. Guiducci, G. Quaglia
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

This paper presents an approach to Simultaneous Localization and Mapping (SLAM) based on stereo vision. Standard stereo techniques are used to estimate 3D scene structure (point clouds). Point clouds at subsequent times are registered to estimate robot motion, and used to build a global environment map. Preliminary experimental results are also presented and discussed.
Coloring kk-free intersection graphs of geometric objects in the plane
Authors: Jacob Fox, János Pach
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

The intersection graph of a collection C of sets is a graph on the vertex set C, in which C1,C2 ∈ C are joined by an edge if and only if C1 ∩ C2 ≠ Ø. Erdös conjectured that the chromatic number of triangle-free intersection graphs of n segments in the plane is bounded from above by a constant. Here we show that it is bounded by a polylogarithmic function of n, which is the first nontrivial bound for this problem. More generally, we prove that for any t and k, the chromatic number of every Kk-free intersection graph of n curves in the plane, every pair of which have at most t points in common, is at most (ct log n/log k)c log k, where c is an absolute constant and ct only depends on t. We establish analogous results for intersection graphs of convex sets, x-monotone curves, semialgebraic sets of constant description complexity, and sets that can be obtained as the union of a bounded number of sets homeomorphic to a disk. Using a mix of results on partially ordered sets and planar separators, for large k we improve the best known upper bound on the number of edges of a k-quasi-planar topological graph with n vertices, that is, a graph drawn in the plane with curvilinear edges, no k of which are pairwise crossing. As another application, we show that for every ε > 0 and for every positive integer t, there exist δ > 0 and a positive integer n0 such that every topological graph with n ≥ n0 vertices, at least n1+ε edges, and no pair of edges intersecting in more than t points, has at least nδ pairwise intersecting edges.
Rewriting calculi, higher-order reductions and patterns: Introduction
Authors: Horatiu Cirstea, Maribel FernÁndez
Venue: Mathematical Structures in Computer Science (2008)

The integration of first-order and higher-order paradigms has been one of the main challenges in the design of both declarative programming languages and proof environments. It has led to the development of new computation models and new logical frameworks, which have been obtained by enriching first-order rewriting with higher-order capabilities or by adding algebraic features to the λ-calculus.
A decomposition theorem and bounds for randomized server problems
Authors: A. Blum
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors prove a lower bound of Omega ( square root logk/loglogk) for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (of at least k+1 points) and provides a new lower bound for the metrical task system problem as well. This improves the previous best lower bound of Omega (loglogk) for arbitrary metric spaces, more closely approaching the conjectured lower bound of Omega (logk). They also prove a lower bound of Omega (/sup logk///sub loglogk/) for the server problem on k+1 equally-spaced points on a line, which corresponds to some natural motion-planning problems.
Secure wireless communication channel by the combination of sphere packing, channel code and space time
Authors: Claudio Valencia, Ismael Soto, Rolando Carrasco, Leszek Szczecinski
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This paper shows a new communication system oriented to the future mobile communications, using concepts of security, sphere packing and channel gain. This system accomplishes the compression using sphere packing with support of Cab curves. At the same time, providing security and encrypting the information. Also with the use of code algorithms a high consistency is achieved. Finally, the performance of the system is shown as a function of SER (Symbol Error Rate) and SNR (Signal Noise Rate). In the first results, sphere packing modulation obtains a gain of 3.5 dB's compared with QPSK modulation with a. SER= 10-6.
Some physical structures for the (2+1) -dimensional Boussinesq water equation with positive and negative exponents
Authors: Shaoyong Lai, YongHong Wu, Yuan Zhou
Venue: Computers Mathematics with Applications (2008)

In this paper, a mathematical method is constructed to study two variants of the two-dimensional Boussinesq water equation with positive and negative exponents. In terms of travelling wave solutions, the partial differential equations are transformed to nonlinear ordinary differential equations. Exact solutions are then derived for various cases to describe the different physical structures such as compactons, solitons, solitary patterns and periodic solutions. The exponent of the wave function u and the ratio of the two coefficients a and b in the Boussinesq equation are shown to qualitatively determine the physical structures of the solutions.
Uniform memory hierarchies
Authors: B. Alpern, L. Carter, E. Feig
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The authors introduce a model, called the uniform memory hierarchy (UMH) model, which reflects the hierarchical nature of computer memory more accurately than the RAM (random-access-machine) model, which assumes that any item in memory can be accessed with unit cost. In the model memory occurs as a sequence of increasingly large levels. Data are transferred between levels in fixed-size blocks (the size is level dependent). Within a level blocks are random access. The model is easily extended to handle parallelism. The UMH model is really a family of models parameterized by the rate at which the bandwidth decays as one travels up the hierarchy. A program is parsimonious on a UMH if the leading terms of the program's (time) complexity on the UMH and on a RAM are identical. If these terms differ by more than a constant factor, then the program is inefficient. The authors analyze two standard FFT programs with the same RAM complexity. One is efficient; the other is not.
Web Programming Interview Questions with HTML, DHTML, and CSS: HTML, DHTML, CSS Interview and Certification Review
Authors: Terry,  Sanchez-Clark
Venue:  (2007)

Book Description: The Ultimate Reference & Learning Guide to HTML, DHTML, and CSS Extensive and in-depth coverage of common questions, answers, and explanations In order to stay current and competitive in today's market, web programmers must have a comprehensive understanding of HTML, DHTML, and CSS. Use this book to guide you through your learning process. From helping you to asses your skills, to preparing for an interview, to merely brushing up on old skills, Web Programming Interview Questions: HTML, DHTML, CSS FAQ will help you understand what you really need to know. Each section includes everything you need to know in an easy-to-understand format for the advanced web programmer. Key topics include: . Debugging DHTML . The creation of dynamic web pages . Structural, presentational, and hypertext markups . Stylization and design . Security and maintenance
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
Authors: Mario Strasser, Christina Pöpper, Srdjan Capkun, Mario Cagalj
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

We consider the following problem: how can two devices that do not share any secrets establish a shared secret key over a wireless radio channel in the presence of a communication jammer? An inherent challenge in solving this problem is that known anti-jamming techniques (e.g.,frequency hopping or direct-sequence spread spectrum) which should support device communication during the key establishment require that the devices share a secret spreading key (or code) prior to the start of their communication. This requirement creates a circular dependency between anti-jamming spread-spectrum communication and key establishment, which has so far not been addressed. In this work, we propose an Uncoordinated Frequency Hopping (UFH) scheme that breaks this dependencyand enables key establishment in the presence of a communication jammer. We perform a detailed analysis of our UFH scheme and show its feasibility, both in terms of execution time and resource requirements.
An efficient parallel algorithm for hexagonal-based fractal image compression
Authors: Ghim-Hwee Ong, Lixin Fan
Venue: International Journal of Computer Mathematics (2007)

A two-level fast search algorithm to reduce the encoding time for hexagonal-based fractal image compression is presented. The design of the sequential algorithm is based on the distribution of matched domains in a given image. The first search level previews various portions of the image and identifies promising domains among all possible domains. The second search level picks out domain blocks in the image portion where the first level gives positive results, and compares them with a given range block for encoding. The algorithm is parallelized by a dynamic range distribution scheme to achieve load balancing. Experimental results show that by running the parallelized encoding algorithm on multiple processors, the encoding time is drastically reduced while the quality of image reconstruction is retained. A speed-up of about 9 can be obtained by using 13 processors.
Parabolic target space and primal-dual interior-point methods
Authors: Yu. Nesterov
Venue: Discrete Applied Mathematics (2008)

In this paper we develop new primal-dual interior-point methods for linear programming problems, which are based on the concept of parabolic target space. We show that such schemes work in the infinity-neighborhood of the primal-dual central path. Nevertheless, these methods possess the best known complexity estimate. We demonstrate that the adaptive-step path-following strategies can be naturally incorporated in such schemes.
Timed Specification For Web Services Compatibility Analysis
Authors: Nawal Guermouche, Olivier Perrin, Christophe Ringeissen
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Web services are becoming one of the main technologies for designing and building complex inter-enterprise business applications. Usually, a business application cannot be fulfilled by one Web service but by coordinating a set of them. In particular, to perform a coordination, one of the important investigations is the compatibility analysis. Two Web services are said compatible if they can interact correctly. In the literature, the proposed frameworks for the services compatibility checking rely on the supported sequences of messages. The interaction of services depends also on other properties, such that the exchanged data flow. Thus, considering only supported sequences of messages seems to be insufficient. Other properties on which the services interaction can rely on, are the temporal constraints. In this paper, we focus our interest on the compatibility analysis of Web services regarding their (1) supported sequences of messages, (2) the exchanged data flow, (3) constraints related to the exchanged data flow and (4) the temporal requirements. Based on these properties, we study three compatibility classes: (i) absolute compatibility, (ii) likely compatibility and (iii) absolute incompatibility.
The Design of Optimal Period Interleaver
Authors: Ying Wang, Xinjun Du, Hui Li, Yumin Wang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The optimal period interleaver can break the divisibility of the input sequence with N0 as the period of the feedback polynomial. But how to find the optimal period interleaver is still in consideration. Based on the divisibility of polynomial, we give a method to find the optimal period interleaver. The simulation results prove this method a good BER performance in the decoding process.
The Root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial, Part I: Correction methods
Authors: M. N. O. Ikhile
Venue: Computers Mathematics with Applications (2008)

In this paper we consider the error propagation of the Root and Bell's disk iteration methods enhanced by incorporating a correction term and a choice of a disk inversion formula in the methods, for the simultaneous computation of the zeros of a polynomial. The asymptotic error propagation is proved to be the same in both methods. This result is important considering the fact that these methods are in popular usage in the simultaneous computation of the zeros of a polynomial. The proof of the results herein follows the ideas of [M.S. Petkovic, C. Carstensen, Some improved inclusion methods for polynomial roots with Weierstrass corrections, Comput. Math. Appl. 25 (3) (1993) 59-67]. When the refinement process of correction is efficient, it is this mode of correction we have desired to propose.
Auxiliary state machines + context-triggered properties in verification
Authors: Ansuman Banerjee, Pallab Dasgupta, P. P. Chakrabarti
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

Formal specifications of interface protocols between a design-under-test and its environment mostly consist of two types of correctness requirements, namely (a) a set of invariants that applies throughout the protocol execution and (b) a set of context-triggered properties that applies only when the protocol state belongs to a specific set of contexts. To model such requirements, an increasingly popular design choice in the assertion IP design community has been the use of abstract context state machines and state-oriented properties. In this paper, we formalize this modeling style and present algorithms for verifying such specifications. Specifically, we present a purely formal approach and a semi-formal approach for verifying such specifications. We demonstrate the use of this design style in modeling some of the industry standard protocol descriptions and present encouraging results.
Drawing graphs in the plane with high resolution
Authors: M. Formann
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The problem of drawing a graph in the plane so that edges appear as straight lines and the minimum angle formed by any pair of incident edges is maximized is studied. The resolution of a layout is defined to be the size of the minimum angle formed by incident edges of the graph, and the resolution of a graph is defined to be the maximum resolution of any layout of the graph. The resolution R of a graph is characterized in terms of the maximum node degree d of the graph by proving that Omega (1/d/sup 2/)
A Care Communication System with Space Sharing Function
Authors: Akio Koyama, Yosuke Takenaka, Junpei Arai, Leonard Barolli
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Recently, there are a lot research works for multimedia communication systems. Especially, the space sharing communication is one of research trends for multimedia communication. By using the space sharing technology, the users feel as they are in the same space, even if they are in different locations. This can be done taking each video image of two remote points into one space. In this paper, we propose a care communication system with space sharing function. The implemented care communication system supports the communication and information sharing among in-patients, family members, doctors and helpers. In the proposed system, we have developed not only integration of two video images but also a warmth transmission function. By using this function, two persons in different locations can transmit their feelings as they are in the same space. We verified the proposed system effectiveness by conducting some experiments.
Managing the Learning Dynamics within the Projects Based Organization A Novel Approach through Modelling and Simulation
Authors: Lewlyn L. R. Rodrigues, Dharmaraj N., B. Gopalkrishna, Shrinivasa Rao B.R.
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Organizational Learning and Development (OLD) is the strategic competitiveness weapon for sustainability. A lot of research has been carried out to study both the Endogenous and Exogenous factors, which influence the learning within the project based organizations. A tool to study the dynamics of learning within the projects would help the managers to a great deal for a better and effective OLD. Therefore, this Paper is on building a System Dynamics (SD) tool to depict the dynamics of Learning and Development in Service Projects. The Research was carried out at a Ship building and Repairing Company located in Middle East. The Project Learning and Development Dynamic Model (PLDDM) has been developed to analyze the Learning Dynamics. Dynamics of learning within the project-based organizations indicate that there is a need to minimize the 'competence gain training time' to the least value possible, and to develop the ability to quantify the 'degree of change', so as to manage change and competency towards strategic competitiveness.
Implementing ERP in SMEs: Towards an Ontology Supporting Managerial Decisions
Authors: Hamid Nach, Albert Lejeune
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

The purpose of this research project is to consolidate and formalize as ontology, on the basis of an extensive literature review, the key processes and skills required for successful implementation of ERP in an SME. Using the Protégé software program, the research identified and formalized 395 terms, each of which has its own definition. Exploitation of this ontology could take multiple and varied forms, including creation of a learning system, an on-line cooperation platform, or a project management process mapping tool contributing to successful use of ERP in SMEs.