ppxscal/embedding_network huggingface dataset:
A novel approach for efficient supergraph query processing on graph databases
Authors: Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted a lot of research attentions. Supergraph query is a kind of new and important queries in practice. A supergraph query, q, on a graph database D is to retrieve all graphs in D such that q is a supergraph of them. Because the number of graphs in databases is large and subgraph isomorphism testing is NP-complete, efficiently processing such queries is a big challenge. This paper first proposes an optimal compact method for organizing graph databases. Common subgraphs of the graphs in a database are stored only once in the compact organization of the database, in order to reduce the overall cost of subgraph isomorphism testings from stored graphs to queries during query processing. Then, an exact algorithm and an approximate algorithm for generating significant feature set with optimal order are proposed to construct indices on graph databases. The optimal order on the feature set is to reduce the number of subgraph isomorphism testings during query processing. Based on the compact organization of graph databases, a novel algorithm of testing subgraph isomorphisms from multiple graphs to one graph is presented. Finally, based on all these techniques, a query processing method is proposed. Analytical and experimental results show that the proposed algorithms outper-form the existing similar algorithms by one to two orders of magnitude.
Characteristics of the Group Interest Network
Authors: Ning Zhang
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

By studying the behavior characteristics visiting world wide web of the specifically campus group, this paper constructed dynamic group interest network, which was a para-bipartite graph. The time features that the group user visited world-wide-web had been observed, the topological structure had been discussed. The degree exponents had been drafted for the one week data. Although the users' visiting time is random and their surfing pages were different but the interests of a majority of the campus group were accordant. The results indicate that the incoming degree distribution of the group interest network follows power law. And the group interest spectrum was basically steady. The visiting behavior of the campus group had their special disciplinarian. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On the existence of a class of invertible FIR filters for spectral shaping
Authors: Issa M. S. Panahi
Venue: Signal Processing (2009)

This paper presents a proof for the existence of a class of LTI causal IFIRF converting spectrum of an arbitrary stationary input process to an output with prescribed set of normalized autocorrelation samples. The input is an MA, AR, or ARMA process of finite order, with or without additive white noise, whose stable model may or may not be minimum phase. The prescribed values of finite number of output autocorrelation lags (except lag zero) may or may not all be equal to zero. The FIR filter is minimum phase and of finite order. It is derived from the predefined input and output autocorrelation samples directly using no intermediate filtering stage or minimization of a cost function. The filters' output autocorrelation lags match the prescribed values precisely. Such a filter provides an alternative solution to the problem of finding a causal IFIRF for spectral shaping in statistical signal processing applications.
A Numerical Algorithm for Finding Solution of Cross-Coupled Algebraic Riccati Equations
Authors: Hiroaki Mukaidani, Seiji Yamamoto, Toru Yamamoto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, a computational approach for solving cross-coupled algebraic Riccati equations (CAREs) is investigated. The main purpose of this letter is to propose a new algorithm that combines Newton's method with a gradient-based iterative (GI) algorithm for solving CAREs. In particular, it is noteworthy that both a quadratic convergence under an appropriate initial condition and reduction in dimensions for matrix computation are both achieved. A numerical example is provided to demonstrate the efficiency of this proposed algorithm.
Software management
Authors: Donald Reifer
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Much has been written about establishing an acceptable engineering discipline within organizations that develop and maintain software. Papers proliferate on how different engineering methods can be applied and about other tools available to help apply them. Yet, the technical discipline established using these methods cannot work unless a solid management foundation is created upon which they can operate.
Note: A theorem on the cores of partitions
Authors: Jørn B. Olsson
Venue: Journal of Combinatorial Theory Series A (2009)

If s and t are relatively prime positive integers we show that the s-core of a t-core partition is again a t-core partition. A similar result is proved for bar partitions under the additional assumption that s and t are both odd.
The network is a database
Authors: Serge Fdida, Mohamed Diallo
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

Past development of the Internet shows that its evolution is powered by technology but mostly driven by applications. As a consequence, it is of utmost importance to carefully monitor the driving forces enforced by applications and services to forecast some possible futures for the current Internet. We support, with some examples, the claim that the network is going to provide a service similar as the one provided by a (Distributed) Database, thus, enabling an efficient "Publish and Subscribe" (PubSub) service model. The search activity will provide a mean for competition and architecture for participation where various types of content can be disseminated at different scales. In this paper, we first support our claim with a simple review of the relevant state of the art illustrated from areas such as Information Retrieval (IR), Information Filtering (IF) and Content-based Networking (CBN), to highlight similar concerns and contributions. The problem space being very broad, we then formalize the problem in order to emphasize the main challenges to be addressed and provide a preliminary insight into potential solutions. One original contribution of this work is to take advantage of the large information en route in the network to support the PubSub service. The design and evaluation of this architecture being in progress, we conclude the paper with a list of important open issues to address.
A local approach for Bayesian fusion: Mathematical analysis and agent based conception
Authors: Jennifer Sander, Jürgen Beyerer
Venue: Robotics and Autonomous Systems (2009)

An agent based architecture that is modelled on a successfully operating process of the real world-criminal investigation-circumvents high computational costs caused by Bayesian fusion by realising a distributed local Bayesian fusion approach. The idea underlying local Bayesian fusion approaches is to perform Bayesian fusion at least not in detail on the whole space that is spanned by the Properties-of-Interest. Local Bayesian fusion is mainly based on coarsening and restriction techniques. Here, we focus on coarsening. We give an overview over the agent based conception and translate the proposed ideas in a formal mathematical framework.
A Belated Tribute to Rosario Candela
Authors: Louis Kruh,  Esq.
Venue: Cryptologia (2009)

How William F. Friedman, unbeknownst to Candela, persuaded Columbia University Press not to Publish his book, The Military Cipher of Commandant Bazeries, their subsequent correspondence, and much more.
The process mediation framework for semantic web services
Authors: Roman Vaculin, Roman Neruda, Katia Sycara
Venue: International Journal of Agent-Oriented Software Engineering (2009)

The ability to deal with the incompatibilities of service requesters and providers is a critical factor for achieving interoperability in dynamic open environments. We focus on the problem of process mediation of the semantically annotated process models of the service requester and service provider. We propose an Abstract Process Mediation Framework (APMF) identifying the key functional areas that need to be addressed by process mediation components. Next, we present algorithms for solving the process mediation problem in two scenarios: (1) when the mediation process has complete visibility of the process model of the service provider and service requester (complete visibility scenario) and (2) when the mediation process has visibility only of the process model of the service provider, but not the service requester (asymmetric scenario). The algorithms combine planning and semantic reasoning with the discovery of appropriate external services such as data mediators. Finally, the Process Mediation Agent (PMA) is introduced, which realises an execution infrastructure for runtime mediation.
Retrieval of online handwriting by synthesis and matching
Authors: C. V. Jawahar, A. Balasubramanian, Million Meshesha, Anoop M. Namboodiri
Venue: Pattern Recognition (2009)

Search and retrieval is gaining importance in the ink domain due to the increase in the availability of online handwritten data. However, the problem is challenging due to variations in handwriting between various writers, digitizers and writing conditions. In this paper, we propose a retrieval mechanism for online handwriting, which can handle different writing styles, specifically for Indian languages. The proposed approach provides a keyboard-based search interface that enables to search handwritten data from any platform, in addition to pen-based and example-based queries. One of the major advantages of this framework is that information retrieval techniques such as ranking relevance, detecting stopwords and controlling word forms can be extended to work with search and retrieval in the ink domain. The framework also allows cross-lingual document retrieval across Indian languages.
End-to-End Frame-Rate Adaptive Streaming of Video Data
Authors: Soung C. Liew, Chi-woon Fung
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We propose a best-effort video delivery scheme that can be deployed on networks in use today, including Ethernet LAN's or the Internet. This scheme detects congestion by measuring the buffer occupancy and loss rate and estimate available channel bandwidth by measuring the incoming data rate at the client receiver. Frame request rate is adjusted accordingly when congestion is detected. No extra support (such as priority control or resource reservation) is required from the underlying network. The scheme is designed for the delivery of MPEG-1/MPEG-2 video streams. Various experimental settings have demonstrated the effectiveness of this scheme.
Measurement and evaluating frameworks in electronic government quality management
Authors: Seyed Kamal Vaezi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This paper deals with the key factors that would impact upon the implementation of e-government towards achieving quality services based on measurement and evaluation systems strategies. There are different views on the concept of e-government. However, the adoption of ICT by the public sector will almost consistently affect: Public service delivery; Structure and organizational settings; Ethical, social and political systems; Social needs in the Information era, considering the term "Citizen-centered approach to governing" (e-Governance); Converting the government into a competitive entity through innovation using ICT; Reinventing relations with citizens and the private sector and Team working and collaboration towards Good Government. The paper considers how access to quality measurement and evaluation systems in the public sector can be achieved through the combination of right technology based on social, cultural values and ethical consideration. Finally, it discusses how to build a sustainable evaluation model for Electronic Government quality management.
A Color Video Watermarking Algorithm Based on DTCWT and Motion Estimation
Authors: Xianghong Tang, Liping Chen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In this paper, we unify the characteristic that motion region is retained in MPEG encoding and human visual system (HVS), propose a color video watermarking algorithm based on dual tree complex wavelet transform (DTCWT) and motion estimation. The watermark is embedded in motion block with highly texture, which analyzed by DTCWT with its attractive properties of shift invariance and good directional selectivity. The simulation results show that the algorithm is robust to AWGN, MPEG coding at high compression ratio, frame drop, frame average and frame swap.
Real-Time Complex Object 3D Measurement
Authors: Zhongwei Li, Yusheng Shi, Congjun Wang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Real-Time complex object 3D measurement based on digital fringe projection has a huge potential for applications in many areas, including reverse engineering, inspection, entertainment and social security. We describe a real-time complex object 3D shape measurement technique based on viewpoint-coded structured light technique andphase-shifting technique. Previously, unambiguousreconstruction codes could only be encoded spatially ortemporally. The viewpoint coding, in contrast, allows for depth reconstruction without making any spatial or temporalcontinuity assumptions about the scene. With k camerapositions, the viewpoint-coded structured light method candistinguish between 2k depths. For complex object 3Dmeasurement, it is still limited. So, in this work, we combine the three-step phase-shifting method and the viewpoint-coded method to reconstruct 3D points of the complex object in realtime. By choosing three appropriate camera positions, three different frequencies fringe images can be captured. Thereby, a famous multifrequency heterodyne principle can be used for unwrapping the phase value obtained from the three-step phase-shifting method. A prototype system is developed to demonstrate this novel hybrid method. The experimental results show that this method can reconstruct the 3D shape of complex object in real-time.
A note on “The super connectivity of augmented cubes”
Authors: Meijie Ma, Xuegong Tan, Jun-Ming Xu, Guizhen Liu
Venue: Information Processing Letters (2009)

The aim of this note is to mend a flaw in the proof of Theorem 2 in our paper [M. Ma, G. Liu, J.-M. Xu, The super connectivity of augmented cubes, Information Processing Letters 106 (2008) 59-63].
Rank and Select for Succinct Data Structures
Authors: Antonio Fariòa, Susana Ladra, Oscar Pedreira, Ángeles S. Places
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper, we study different approaches for rank and select on sequences of bytes and propose new implementation strategies. Extensive experimental evaluation comparing the efficiency of the different alternatives are provided. Given a sequence of bits, a rank query counts the number of occurrences of the bit 1 up to a given position, and a select query returns the position of the ith occurrence of the bit 1. These operations are widely used in information retrieval and management, being the base of several data structures and algorithms for text collections, graphs, etc. There exist solutions for computing these operations on sequences of bits in constant time using additional information. However, new applications require rank and select to be computed on sequences of bytes instead of bits. The solutions for the binary case are not directly applicable to sequences of bytes. The existing solutions for the byte case vary in their space-time trade-off which can still be improved.
A formal model of design-patterns based design
Authors: Pushpendra B. Singh, Banshi D. Chaudhary
Venue: Proceedings of the 2nd India software engineering conference (2009)

In this paper we present a formal model to represents pattern-based design of an application. We represent Design-patterns in form of their Structural, Behavioral and Contractual aspect. We have modeled design in terms of Design-patterns, their Instances, Glue: additional code required to bind patterns together in the design, Operators: instantiation, evolution and composition and their required Parameter-Sets.
Kerr-like nonlinearity induced via terahertz generation in periodically poled LiNbO3
Authors: H. Su, M. Zhang, J. F. Ding, H. Zhou, L. Z. Xia, S. C. Ruan
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Based on terahertz generation and optoelectronic effect, Kerr-like nonlinearity in a thin periodically poled lithium niobate crystal is induced by heterodyne optical Kerr effect setup of femtosecond pulse. The noninstantaneous response charater is reported. Its competition with a third-order optical Kerr effect is demonstrated.
Introduction to Part 3
Authors: Sally A. Mckee
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

I am very pleased to welcome you to this special section highlighting the embedded-systems oriented papers from Computing Frontiers 2006. The papers in this section of the volume demonstrate current topics in embedded computing, attempting to strike a balance between design and use. The authors are from both industry and academia. We strove to provide a panorama of some of the most interesting, novel systems in recent study or development. I hope you find these papers interesting in their insights, and informative in the details provided.
Extracting lines of curvature from noisy point clouds
Authors: Evangelos Kalogerakis, Derek Nowrouzezahrai, Patricio Simari, Karan Singh
Venue: Computer-Aided Design (2009)

We present a robust framework for extracting lines of curvature from point clouds. First, we show a novel approach to denoising the input point cloud using robust statistical estimates of surface normal and curvature which automatically rejects outliers and corrects points by energy minimization. Then the lines of curvature are constructed on the point cloud with controllable density. Our approach is applicable to surfaces of arbitrary genus, with or without boundaries, and is statistically robust to noise and outliers while preserving sharp surface features. We show our approach to be effective over a range of synthetic and real-world input datasets with varying amounts of noise and outliers. The extraction of curvature information can benefit many applications in CAD, computer vision and graphics for point cloud shape analysis, recognition and segmentation. Here, we show the possibility of using the lines of curvature for feature-preserving mesh construction directly from noisy point clouds.
A Strict Priority Based QoS-Aware MAC Protocol for Mobile Ad Hoc Networks
Authors: Nityananda Sarma, Aditya Singh, Sukumar Nandi
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

To provide Quality of Service (QoS) at MAC layer in mobile ad hoc networks (MANETs), it requires that a real-time (or high priority) data frame gets a higher channel access priority to that of a best-effort (or low priority) data frame. In this paper, we propose a scheme for resolving MAC layer contention in the form of a strict priority based variant of the IEEE 802.11 DCF. The channel access priorities for different classes of traffic are realized by proper backoff timer selection method which assigns non-overlapping contention windows to traffic of different priorities irrespective of their backoff stage values. To avoid overlapping of backoff timers during countdown period, freezing of backoff timer in low priority is replaced with a resetting of backoff timer mechanism. Besides introducing channel access priorities at MAC layer, a priority-based queuing discipline is implemented in the interface queue to improve the intra-node QoS support. The performance enhancement of the proposed scheme is demonstrated for single hop scenarios using a Markov Chain model, and the accuracy of the model is validated through a detailed simulation study. Further, simulation results in a multihop scenario show suitability of our approach to provide a strict service differentiation, especially in terms of end-to-end delay and throughput provided to real-time traffic as compared to DCF.
Treewidth and logical definability of graph products
Authors: Selma Djelloul
Venue: Theoretical Computer Science (2009)

In this paper we describe an algorithm that, given a tree-decomposition of a graph G and a tree-decomposition of a graph H, provides a tree-decomposition of the cartesian product of G and H. Using this algorithm, we derive upper bounds on the treewidth (resp. on the pathwidth) of the cartesian product of two graphs, expressed in terms of the treewidth (resp. pathwidth) and the size of the factor graphs. In the context of graph grammars and graph logic, we prove that the cartesian product of a class of graphs by a finite set of graphs preserves the property of being a context-free set, and that the cartesian product by a finite set of connected graphs preserves MS"1-definability and MS"2-definability. We also prove that the cartesian product of two MS"2-definable classes of connected graphs is MS"2-definable.
Consumer Protection and Global Trade in the Digital Environment
Authors: MARIOS KOUTSIAS
Venue:  (2008)

The advent of internet as a means of conducting trade has created new challenges. It is not the first time that technology challenges the efficiency of the current legal framework but the extent of the threat to privacy renders a new approach imperative. In the light of this realisation the different approaches towards data protection in the EU and US are thoroughly analysed. The divergence in the approach is flowing from different historical developments and experiences and hence different legal traditions. The adoption of the EU Directive on Data Protection has been the milestone which reset the debate on a wholly different basis. It revealed the cultural and legal differences between the two sides of the Atlantic and underlined the difficulties in agreeing upon a common solution. The paper focuses on the analysis of the relevant historical and legal framework in the EU and US and concludes with certain proposals of legal and technological nature to deal with the problem. Its central thesis is that the challenges that internet poses on privacy should be dealt within the context of Europes established legal and humanistic traditions.