ppxscal/embedding_network huggingface dataset:
WReX: a scalable middleware architecture to enable XML caching for web-services
Authors: Junichi Tatemura, Oliver Po, Arsany Sawires, Divyakant Agrawal, K. Selçuk Candan
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Web service caching, i.e., caching the responses of XML web service requests, is needed for designing scalable web service architectures. Such caching of dynamic content requires maintaining the caches appropriately to reflect dynamic updates to the back-end data source. In the database, especially relational, context, extensive research has addressed the problem of incremental view maintenance. However, only a few attempts have been made to address the cache maintenance problem for XML web service messages. We propose a middleware solution that bridges the gap between the cached web service responses and the backend dynamic data source. We assume, for generality, that the back-end source has a general XML logical data model. Since the RDBMS technology is widely used for storing and querying XML data, we show how our solution can be implemented when the XML data source is implemented on top of an RDBMS. Such implementation exploits the well-known maturity of the RDBMS technology. The middleware solution described in this paper has the following features that distinguish it from the existing technology in this area: (1) It provides declarative description of Web Services based on rich and standards-based view specification language (XQuery/XPath); (2) No knowledge of the source XML schema is assumed, instead the source can be any general well-formed XML data; (3) The solution can be easily deployed on RDBMS, and (4) The size of the auxiliary data needed for the cache maintenance does not depend on the source data size, therefore, the solution is highly scalable. Experimental evaluation is conducted to assess the performance benefits of the proposed approach.
On the asymptotic minimum transporting energy and its implication on the wireless network capacity
Authors: Honghai Zhang, Jennifer C. Hou
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In this paper we study the asymptotic minimum energy (which is defined as the minimum transporting energy) required to transport (via multiple hops) data packets from a source to a destination. Under the assumptions that nodes are distributed according to a Poisson point process with node density n in a unit-area square and the distance between a source and a destination is of constant order, we prove that the minimum transporting energy is Θ (n(1-α)/2) with probability approaching one as the node density goes to infinity, where α is the path loss exponent. We demonstrate use of the derived results to obtain the bounds of the capacity of wireless networks that operate in UWB. In particular, we prove the transport capacity of UWB-operated networks is Θ (n(α-1)/2) with high probability. We also carry out simulations to validate the derived results and to estimate the constant factor associated with the bounds on the minimum energy. The simulation results indicate that the constant associated with the minimum energy converges to the source-destination distance.
Planar packing of trees and spider trees
Authors: Fabrizio Frati, Markus Geyer, Michael Kaufmann
Venue: Information Processing Letters (2009)

In [A. Garcia, C. Hernando, F. Hurtado, M. Noy, J. Tejel, Packing trees into planar graphs, J. Graph Theory (2002) 172-181] Garcia et al. conjectured that for every two non-star trees there exists a planar graph containing them as edge-disjoint subgraphs. In this paper we prove the conjecture in the case in which one of the trees is a spider tree.
Computing and mathematics in society
Authors: Donald L. Thomsen,  Jr., Warren J. Ewens, James S. Coleman, John J. Donovan, Warren E. Walker
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The Panel will address selected areas of current interest where computing and mathematics have been successfully applied to societal problems. Those societal fields which have been chosen are biological systems, sociology, energy, and urban emergency services. Although interrelated each area has quite different characteristics. In biology we examine long term evolutionary phenomena; in sociology we review through the techniques of simulation and surveys those human relations which are of concern day by day, month by month, and year by year; in energy we discuss problems both short and long range having to do with basic sources and distribution; and in emergency urban services we address very immediate activity related to what happens when that fire alarm box is pulled down the street. In these four areas the Panel will present examples of noteworthy past successes and conjectures as to where future progress very likely will be made.
Physics and Theoretical Computer Science: From Numbers and Languages to (Quantum) Cryptography
Authors: J. Gazeau, J. Nesetril, B. Rovan
Venue: Nato Security Through Science Series (2007)

The goal of this publication is to reinforce the interface between physical sciences, theoretical computer science, and discrete mathematics. The intersection of combinatorics and statistical physics has been an area of great activity over the past few years, fertilized by an exchange not only of techniques but of objectives as well. Some of the topics of particular interest are: percolation, random coloring, mixing, homomorphisms from and to fixed graph, phase transitions, threshold phenomena. This book is aimed to assemble theoretical physicists and specialists of theoretical informatics and discrete mathematics in order to learn more about recent developments in cryptography, algorithmics, symbolic calculus, non-standard numeration systems, algebraic combinatorics, automata etc., which could reveal themselves to be of crucial interest in natural sciences. This volume is organized along the following rough thematic division: Physics; Chaos and Fractals; Quasi-Crystals and Tilings; Numeration, Automata, and Languages; Algebraic Combinatorics; and Graphs and Networks.
Secure Web Service Workflow Execution
Authors: Carsten Rudolph, Nicolai Kuntze, Zaharina Velikova
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper we identify specific security requirements for distributed workflows and provide a decentralized workflow execution mechanism that ensures their satisfaction. With our composition concept we ensure that each web service can access only the information which is needed for the correct execution of the invoked operations and we provide an execution proof of the fulfilled assignments. Our approach relies on a data structure, called process slip, which is passed among the web services participating in the composition.
Digital Art, Second Edition, 2 edition
Authors: Christiane Paul
Venue:  (2008)

"A terrific summary of the intertwined history of art and technology."ARTnews. "Infused with the spirit of innovation."Publishers WeeklyDigital technology has revolutionized the way we produce and experience art today. Not only have traditional forms of art such as printing, painting, photography, and sculpture been transformed by digital techniques and media, but entirely new forms such as net art, software art, digital installation, and virtual reality have emerged as recognized artistic practices, collected by major museums, institutions, and private collectors the world over.This book surveys the developments in digital art from its appearance in the 1980s up to the present day, and looks ahead to what the future may hold. It explores themes addressed and raised by the art, such as viewer interaction, artificial life and intelligence, political and social activism, networks and telepresence, as well as issues such as the collection, presentation, and preservation of digital art. 323 illustrations, 253 in color.
Efficient resource management in OFDMA Femto cells
Authors: Karthikeyan Sundaresan, Sampath Rangarajan
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Femto cells are a cost-effective means of providing ubiquitous connectivity in future broadband wireless networks. While their primary purpose has been to improve coverage in current solutions, their decreased cell sizes in turn also provide improved cell capacity through increased spatial reuse. The demand for bandwidth-intensive IP services will soon necessitate the need to tap into this improved capacity. However, the lack of direct coordination between the macro and femto cells, and the completely distributed nature of femto cells make this an extremely challenging task. In this work, we address this challenge by providing efficient resource management solutions for OFDMA-based femto cells along with performance guarantees. In the process, we consider two models that tradeoff performance and overhead. We also propose a novel location-based resource management solution for leveraging maximal spatial reuse from femto cells. Our comprehensive evaluations indicate that in addition to providing improved coverage indoors, with carefully designed resource management solutions that leverage spatial reuse, femto cells have a great potential to increase the system performance by two folds.
Combining Cognitive with Computational Trust Reasoning
Authors: Eugen Staab, Thomas Engel
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

We propose a concept that combines the cognitive with the computational approaches to experience-based trust reasoning. We emphasize that a cognitive component is vital for computationally modeling trust. At the same time, we recognize the predictive nature of trust. This suggests a combination of the different approaches. The idea is to introduce a cognitive component that produces factual positive and factual negative experiences. These experiences can then be used in a predictive component to estimate the future behavior of an agent. The components are combined in a modular way which allows the replacement of them independently. It further facilitates the integration of already existing trust update algorithms. In this work, we analyze the chain of trust processing for the concept step by step. This results in a concise survey on challenges for experience-based trust models.
Fast algorithms for compositing multi-way compressed video
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: This paper presents fast algorithms for compositing two or more videos which have been compressed using the JPEG (Joint Picture Experts Group) compression standard. Their performance is improved over traditional methods by processing compressed video data in the frequency domain, avoiding the DCT (discrete cosine transform) and IDCT (inverse DCT). Since the algorithms are built on a new theoretical basis, the computational speedup and memory usage efficiency are further improved over existing fast algorithms.
An algorithm for analyzing personalized online commercial intention
Authors: Derek Hao Hu, Qiang Yang, Ying Li
Venue: Proceedings of the 2nd International Workshop on Data Mining and Audience Intelligence for Advertising (2008)

With more and more commercial activities moving onto the Internet, people tend to purchase what they need through Internet or conduct some online research before the actual deals happen. For many Web users, their online commercial activities start from submitting a search query to search engines. Just like the common Web search queries, the queries with commercial intention are usually very short. Recognizing the queries with commercial intention against the common queries will help search engines provide proper search results and advertisements; help Web users obtain the right information they desire and help the advertisers benefit from the potential transactions. The only existing research work, as far as we know, has been done to automatically detect online commercial intention purely based on the issued queries, without considering the Web user's information. However, the intentions behind a query vary a lot for users with different background and interest. The intentions can even be different for the same user, when the query is issued in different contexts. In this paper, we present a novel algorithm, which we name as POINT, for the Personalized Online-commercial INTention detection based on a skip-chain conditional random field model. To accurately detect the commercial intentions of a query, our method comprehensively considers the evidences from the target query, the profile of the user issuing the query, which is inferred from his search history, as well as the similarity of different queries in a personal query log. Our proposed method is validated through extensive experiments on a real search engine query log data set. The experimental results show that our algorithm can clearly improve the performance by more than 10% of personalized online-commercial intention detection.
Automated process planning method to machine A B-Spline free-form feature on a mill-turn center
Authors: Nikhil Date, Prakash Krishnaswami, V.V. Satish K. Motipalli
Venue: Computers and Industrial Engineering (2009)

In this paper, we present a methodology for automating the process planning and NC code generation for a widely encountered class of free-form features that can be machined on a 3-axis mill-turn center. The free-form feature family that is considered is that of extruded protrusions whose cross-section is a closed, periodic B-Spline curve. In this methodology, for machining a part with B-Spline protrusion located at the free end, the part is first rough turned to the maximum profile diameter of the B-Spline, followed by rough profile cutting and finish profiling with axially mounted end mill tools. The identification and sequencing of machining volumes is completely automated, as is the generation of actual NC code. The approach supports both convex and non-convex profiles. In the case of non-convex profiles, the process planning algorithm ensures that there is no gouging of the work piece by the tool. The algorithm also identifies when sections of the tool path lie outside the work piece and utilizes rapid traverses in these regions to reduce cutting time. This methodology presents an integrated turn-mill process planning where by making the process fully automated from design with no user intervention making the overall process planning efficient. The algorithm was tested on several examples and test parts using the unmodified NC code obtained from the implementation were run on a Moriseiki mill-turn center. The parts that were produced met the dimensional specifications of the desired part.
Direct boolean intersection between acquired and designed geometry
Authors: Pinghai Yang, Xiaoping Qian
Venue: Computer-Aided Design (2009)

In this paper, a new shape modeling approach that can enable direct Boolean intersection between acquired and designed geometry without model conversion is presented. At its core is a new method that enables direct intersection and Boolean operations between designed geometry (objects bounded by NURBS and polygonal surfaces) and scanned geometry (objects represented by point cloud data). We use the moving least-squares (MLS) surface as the underlying surface representation for acquired point-sampled geometry. Based on the MLS surface definition, we derive closed formula for computing curvature of planar curves on the MLS surface. A set of intersection algorithms including line and MLS surface intersection, curvature-adaptive plane and MLS surface intersection, and polygonal mesh and MLS surface intersection are successively developed. Further, an algorithm for NURBS and MLS surface intersection is then developed. It first adaptively subdivides NURBS surfaces into polygonal mesh, and then intersects the mesh with the MLS surface. The intersection points are mapped to the NURBS surface through the Gauss-Newton method. Based on the above algorithms, a prototype system has been implemented. Through various examples from the system, we demonstrate that direct Boolean intersection between designed geometry and acquired geometry offers a useful and effective means for the shape modeling applications where point-cloud data is involved.
An incentive-based electronic payment scheme for digital content transactions over the Internet
Authors: Shi-Jen Lin, Ding-Chyu Liu
Venue: Journal of Network and Computer Applications (2009)

Digital content transactions through e-commerce will grow tremendous in the coming years. Well-designed electronic payment schemes and high-quality digital contents are two critical successful factors. This paper proposes an incentive-based electronic payment scheme, which can ensure both important properties of fair exchange and customer anonymity in e-commerce transactions and enhance authors' motivation to create digital contents. The proposed payment scheme is based on cryptographic techniques. Besides, it adopts a mechanism called ''the apportionment contract of sales revenue'', which records payees' apportionment amount. The bank can immediately apportion the sales revenue according to this contract when customers complete payments. By scrupulous analyses, the proposed payment scheme can achieve fair exchange, customer anonymity, and payment security. This paper also compares the proposed payment scheme to related schemes. The comparison result shows that the proposed payment scheme has the best characteristics on the following viewpoints: incentive-based payment, fair exchange, customer anonymity, the denomination of payment token, and the number of payment token for a transaction.
Moodle: our steps in his utilizations at University of Defence
Authors: Marketa Mazalkova, Robert Drmola
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

These days is the word "e-learning" pronounced very often, and it seems that e-learning or the learning management systems are very modern and progressive method, how to increase or optimize quality of teaching at all of schools over the world. At the University of Defence in Brno were also installed learning management systems called Moodle and Barborka. This article is specialized to the first one. The goal of this paper is to show possibilities of on-line course at Communication and Information Systems Department. It involves experiences and effects of pilot course Net-Trainers, differences between e-learning and classic type of education and few words about new creating modules. The courses which are creating in our department are for students of the bachelor degree study programme of Communication and Information Systems Department.
Reducing the variance of likelihood ratio greeks in Monte Carlo
Authors: Luca Capriotti
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We investigate the use of Antithetic Variables, Control Variates and Importance Sampling to reduce the statistical errors of option sensitivities calculated with the Likelihood Ratio Method in Monte Carlo. We show how Antithetic Variables solve the well-known problem of the divergence of the variance of Delta for short maturities and small volatilities. With numerical examples within a Gaussian Copula framework, we show how simple Control Variates and Importance Sampling strategies provide computational savings up to several orders of magnitude.
Complying with Law for RE in the Automotive Domain
Authors: Birgit Penzenstadler, Jöorg Leuser
Venue: Proceedings of the 2008 Requirements Engineering and Law (2008)

The automotive industry is concerned with developing large and complex embedded systems. The original equipment manufacturers (OEMs) are responsible for the safety of their systems, enforced by law in terms of liability. At the same time, there is a number of laws, for example the Automobile Safety Act, that has to be obeyed by the specication. We give insights into the current state of practice about how the automotive industry performs requirements engineering in order to comply with government laws and regulations. We analyse the challenges, and give ideas from research work in progress for tackling them.
A Robust Sound Source Localization Approach for Microphone Array with Model Errors
Authors: Hua Xiao, Huai-Zong Shao, Qi-Cong Peng
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, a robust sound source localization approach is proposed. The approach retains good performance even when model errors exist. Compared with previous work in this field, the contributions of this paper are as follows. First, an improved broad-band and near-field array model is proposed. It takes array gain, phase perturbations into account and is based on the actual positions of the elements. It can be used in arbitrary planar geometry arrays. Second, a subspace model errors estimation algorithm and a Weighted 2-Dimension Multiple Signal Classification (W2D-MUSIC) algorithm are proposed. The subspace model errors estimation algorithm estimates unknown parameters of the array model, i.e., gain, phase perturbations, and positions of the elements, with high accuracy. The performance of this algorithm is improved with the increasing of SNR or number of snapshots. The W2D-MUSIC algorithm based on the improved array model is implemented to locate sound sources. These two algorithms compose the robust sound source approach. The more accurate steering vectors can be provided for further processing such as adaptive beamforming algorithm. Numerical examples confirm effectiveness of this proposed approach.
Bernoulli polynomials and Pascal matrices in the context of Clifford analysis
Authors: H. R. Malonek, G. Tomaz
Venue: Discrete Applied Mathematics (2009)

This paper describes an approach to generalized Bernoulli polynomials in higher dimensions by using Clifford algebras. Due to the fact that the obtained Bernoulli polynomials are special hypercomplex holomorphic (monogenic) functions in the sense of Clifford Analysis, they have properties very similar to those of the classical polynomials. Hypercomplex Pascal and Bernoulli matrices are defined and studied, thereby generalizing results recently obtained by Zhang and Wang (Z. Zhang, J. Wang, Bernoulli matrix and its algebraic properties, Discrete Appl. Math. 154 (11) (2006) 1622-1632).
Wireless sensor networks scheduling for full angle coverage
Authors: Kit-Yee Chow, King-Shan Lui, Edmund Y. Lam
Venue: Multidimensional Systems and Signal Processing (2009)

Many current studies in tracking and surveillance assume that a target can be monitored by a single sensor. However, there are situations where a sensor can only monitor a certain portion of the object. Examples include image capturing and coastline monitoring. In our previous work, we develop the Minimum Cost Cover algorithm to identify a set of sensors which preserve 360° coverage of a target with minimum cost, such that when different cost functions for the sensors are used, covers with different optimization objectives can be identified. In this work, we study the scheduling problem to monitor a target continuously with full angle coverage. To increase network lifetime, we develop several algorithms by adopting different cost functions in selecting the sensors. We evaluate the performance of our schemes through extensive simulations. The simulation results show that our proposed Conditional Scheduling metric can help to improve the network lifetime as well as the time to the first node failure.