ppxscal/embedding_network huggingface dataset:
Gauss-Bonnet Formula, Finiteness Condition, and Characterizations of Graphs Embedded in Surfaces
Authors: Beifang Chen, Guantao Chen
Venue: Graphs and Combinatorics (2008)

Let G be an infinite graph embedded in a closed 2-manifold, such that each open face of the embedding is homeomorphic to an open disk and is bounded by finite number of edges. For each vertex x of G, define the combinatorial curvature $$\Phi_G(x) = 1 - \frac{d(x)}{2} + \sum_{\sigma \in F(x)} \frac{1}{|\sigma|}$$ as that of [8], where d(x) is the degree of x, F(x) is the multiset of all open faces &#x03c3; in the embedding such that the closure $$\bar\sigma$$ contains x (the multiplicity of &#x03c3; is the number of times that x is visited along &#x2202;&#x03c3;), and |&#x03c3;| is the number of sides of edges bounding the face &#x03c3;. In this paper, we first show that if the absolute total curvature &#x2211; x&#x2208;V(G) |&#x03a6; G (x)| is finite, then G has only finite number of vertices of non-vanishing curvature. Next we present a Gauss-Bonnet formula for embedded infinite graphs with finite number of accumulation points. At last, for a finite simple graph G with 3&#x00a0;&#x2264;&#x00a0;d G (x)&#x00a0;<&#x00a0;&#x221e; and &#x03a6; G (x)&#x00a0;>&#x00a0;0 for every x &#x2208; V(G), we have (i) if G is embedded in a projective plane and #(V(G))&#x00a0;=&#x00a0;n&#x00a0;&#x2265;&#x00a0;1722, then G is isomorphic to the projective wheel P n ; (ii) if G is embedded in a sphere and #(V(G))&#x00a0;=&#x00a0;n&#x00a0;&#x2265;&#x00a0;3444, then G is isomorphic to the sphere annulus either A n or B n ; and (iii) if d G (x)&#x00a0;=&#x00a0;5 for all x &#x2208; V(G), then there are only 49 possible embedded plane graphs and 16 possible embedded projective plane graphs.
Letter to the Editor: A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues
Authors: Shu-Qian Shen, Ting-Zhu Huang, Guang-Hui Cheng
Venue: Journal of Computational and Applied Mathematics (2008)

This paper discusses the spectral properties of the nonsymmetric saddle point matrices of the form A=[AB^T;-BC] with A symmetric positive definite, B full rank, and C symmetric positive semidefinite. A new sufficient condition is obtained so that A is diagonalizable with all its eigenvalues real and positive. This condition is weaker than that stated in the recent paper [J. Liesen, A note on the eigenvalues of saddle point matrices, Technical Report 10-2006, Institute of Mathematics, TU Berlin, 2006].
Behind the low-end Linux box that sold out at Wal-mart
Authors: Doc Searls
Venue: Linux Journal (2008)

Doc Searls interviews Dave Liu of gOS.
Algorithmic Results In List Decoding
Authors: Venkatesan Guruswami
Venue: Foundations And Trends In Theoretical Computer Science (2007)

Algorithmic Results in List Decoding introduces and motivates the problem of list decoding, and discusses the central algorithmic results of the subject, culminating with the recent results on achieving "list decoding capacity." The main technical focus is on giving a complete presentation of the recent algebraic results achieving list decoding capacity, while pointers or brief descriptions are provided for other works on list decoding. Algorithmic Results in List Decoding is intended for scholars and graduate students in the fields of theoretical computer science and information theory. The author concludes by posing some interesting open questions and suggests directions for future work.
Shared memories: a trail-based coordination server for robot teams
Authors: G. Roussos, D. Papadogkonas, J. Taylor, D. Airantzis, M. Levene, M. Zoumboulakis
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Robust, dependable and concise coordination between members of a robot team is a critical ingredient of any such collective activity. Depending on the availability and the characteristics of the particular communication infrastructure, coordination mechanisms can take varied forms, leading to distinct system behaviors. In this paper, we consider the case of robot teams operating within relatively sparse wireless sensor network deployments. We introduce Shared Memories, a trail-based coordination engine, that analyzes interaction patterns between participating team members and sensor network nodes capable to discover significant aggregate patterns, which are made available to the team. To this end, we propose a model for the representation of captured interactions and their sensory context developed as a probabilistic grammar, as well as associated metrics used to rank trails and quantify their significance. Such trails are used as the basis for coordinated operation in team tasks and are made available by the engine to all team members. Our implementation deploys ad-hoc wireless local networking capability available through surrogate devices to commodity robots and RFID proximity sensors. We report on the performance of this system in experiments conducted in a laboratory environment, which highlight the advantages and limitations of our approach.
A Collaborative Service-Oriented Simulation Framework with Microsoft Robotic Studio®
Authors: W. T. Tsai, Qian Huang, Xin Sun
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Service-Oriented Architecture (SOA) had received significant attention recently. The concepts that service can be discovered at runtime and application can be composed via service discovery bring great flexibility to application development. SOA can be incorporated into embedded system design, thus improve thereusability and extensibility of embedded applications. Microsoft Robotics Studio (MSRS) is a significant initiative in applying SOA to embedded systems and SOA simulation can play an important role in the robotics application development and verification. SOA simulation differs from traditional simulation as it emphasizes on reusability, collaborative behaviors and its unique model-driven development, this paper proposes a collaborative SOA simulation framework with MSRS environment.
An implementation of an FPGA-based embedded gesture recognizer using a data glove
Authors: In-Kwon Park, Jung-Hyun Kim, Kwang-Seok Hong
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

A gesture recognizer based on a desktop PC, which uses existing wire/wireless communication modules, has several restrictions such as space limitations, movement limitations, and change in recognition capacity depending on the change in the background lighting conditions when obtaining a user's meaningful gesture data from images. This paper proposes an embedded gesture recognizer that uses a data glove in order to solve these problems. The proposed embedded FPGA (field-programmable gate array)-based gesture recognizer comprises an input module, a recognition module, and a display module. The input module receives the data that is transmitted from a data glove through a UART. The recognition module determines whether one set of data is accurate by performing data calculations with a checksum function after receiving the input data and comparing it to the header byte. This module also analyzes the data from 17 distinct gestures and constructs recognition models, and then it extracts the hand gesture data and compares it to the recognition models to see if the gestures match any of the 17 models. The recognition module then transmits the recognition result to the display module. The display module displays the recognition result on an LCD screen. A data glove manufactured by 5DT was used to obtain the gesture inputs. The FPGA was the XC3S1000FG676 (Xilinx Inc.) and it was designed using VHDL. The experimental results showed a 94% average recognition rate when using the FPGA-based embedded gesture recognizer and the data glove.
Multimedia data modelling: moving up the ladder
Authors: Qing Li
Venue: Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79 (2008)

Multimedia data modelling is radically different from the traditional data modelling due to the special requirements imposed by multimedia data. One fundamental issue of concern is the notorious "semantic gap" between what were stored in the database, and what the end-users understand and expect. Due to the ambiguous, subjective, and transient (AST) semantic problems of multimedia data, necessary context information needs to be made available and provided in order to conduct meaningful and effective query processing of different paradigms and at various levels of abstraction. Unfortunately, traditional and conventional data models were not designed with such objectives in mind. More specifically, when people realized that relational databases fall short in supporting advanced applications including multimedia data management due to the limited modelling power of the relational data model, researchers went ahead with devising semantic, object-oriented (OO) data models in the 80's (until early 90's). While the later commercial development of database systems has led to the so-called object-relational (OR) databases since late 90's, such a marriage of the two does not actually solve the problems encountered by multimedia data management. In particular, it does not solve the basic issue of bridging the semantic gap by addressing the AST problems. In this talk, we present a new approach to multimedia data modelling by extending the traditional ANSI/SPARC architecture, attempting to cater for the unique requirements of multimedia data management. In addition to the traditional three level schemas, an additional semantic view mechanism called MediaView is added as a new layer between the external schema and end-user applications, moving up the ladder of semantic abstraction. Various facilities of this MediaView are described and discussed. Among other interesting capabilities, MediaView supports two important properties termed as context dependence and modality independence which are important to meaningful and effective query processing with different paradigms and at various levels of abstraction. A number of applications have been developed based on this MediaView, and in this talk we shall describe some of these including Web-based recipe data management and cross-media retrieval.
Efficient storage scheme and query processing for supply chain management using RFID
Authors: Chun-Hee Lee, Chin-Wan Chung
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

As the size of an RFID tag becomes smaller and the price of the tag gets lower, RFID technology has been applied to a wide range of areas. Recently, RFID has been adopted in the business area such as supply chain management. Since companies can get movement information for products easily using the RFID technology, it is expected to revolutionize supply chain management. However, the amount of RFID data in supply chain management is huge. Therefore, it requires much time to extract valuable information from RFID data for supply chain management. In this paper, we define query templates for tracking queries and path oriented queries to analyze the supply chain. We then propose an effective path encoding scheme to encode the flow information for products. To retrieve the time information for products efficiently, we utilize a numbering scheme used in the XML area. Based on the path encoding scheme and the numbering scheme, we devise a storage scheme to process tracking queries and path oriented queries efficiently. Finally, we propose a method which translates the queries to SQL queries. Experimental results show that our approach can process the queries efficiently. On the average, our approach is about 680 times better than a recent technique in terms of query performance.
A multiestimation adaptive control scheme which incorporates model reduction issues
Authors: A. Bilbao-Guillerna, M. De la Sen, S. Alonso-Quesada, A. Ibeas
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

A multiestimation-based adaptive control scheme is presented for a plant with known poles and unknown zeros. The plant is decomposed in several first order filters with unknown scalar numerators. The scheme chooses in real time the estimator/controller pair possessing the best performance according to an identification performance index by implementing a switching rule between estimators. Each reduced model is obtained by using a different combination of the first order filters. The switching rule is subject to a minimum residence time at each identifier/adaptive controller parameterization for closed-loop stabilization purposes.
An Integrated Method for Web Resource Categorization
Authors: Minghua Pei, Kotaro Nakayama, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Since Semantic Web is increasing in size and variety of resources, it is difficult for users to find the information that they really need. In this paper, we propose a new approach of integrating four processes for Web resource categorization which can promote the efficiency of information retrieval. The processes can extract both the explicit relations extracted directly from the ontologies in a traditional way and the potential relations inferred from existing ontologies by focusing on some new challenges such as extracting important class names, using WordNet relations and detecting the methods of describing the Web resources. Our proposed method can achieve a notable improvement in categorizing the valuable Web resources based on incomplete ontologies for a Semantic Web search system.
Building federation of digital libraries basing on concept of atomic services
Authors: Cezary Mazurek, Tomasz Parkola, Marcin Werla
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Our poster presents recent results from an ongoing research project entitled "Mechanisms of atomic services for distributed digital libraries".
Hungarian wordnet and representation of verbal event structure
Authors: Judit Kuti, Károly Varasdi, Ágnes Gyarmati, Péter Vajda
Venue: Acta Cybernetica (2007)

During the development of the Hungarian WordNet we found that the primarily hierarchical structure of the Princeton WordNet (PWN) had to be expanded in order that it could be used for a more accurate representation of relations among verbal meanings in Hungarian, as well. Treating verbs as eventualities we made some aspectual information explicitly available in the representation of verbs. Using the notion of nucleus introduced by Moens&Steedman we added new relations to the WordNet and classified verbal synsets according to aspectual characteristics. This enabled the representation of some psycholinguistically relevant pieces of information and a wider possible usage of the thus extended Hungarian verbal WordNet in the field of computational linguistics.
Parallax: virtual disks for virtual machines
Authors: Dutch T. Meyer, Gitika Aggarwal, Brendan Cully, Geoffrey Lefebvre, Michael J. Feeley, Norman C. Hutchinson, Andrew Warfield
Venue: ACM SIGOPS Operating Systems Review (2008)

Parallax is a distributed storage system that uses virtualization to provide storage facilities specifically for virtual environments. The system employs a novel architecture in which storage features that have traditionally been implemented directly on high-end storage arrays and switches are relocated into a federation of storage VMs, sharing the same physical hosts as the VMs that they serve. This architecture retains the single administrative domain and OS agnosticism achieved by array- and switch-based approaches, while lowering the bar on hardware requirements and facilitating the development of new features. Parallax offers a comprehensive set of storage features including frequent, low-overhead snapshot of virtual disks, the 'gold-mastering' of template images, and the ability to use local disks as a persistent cache to dampen burst demand on networked storage.
A Polynomial Solution For Potato-Peeling And Other Polygon Inclusion And Enclosure Problems
Authors: J. S. Chang
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We give a finiteness criteria for the potato-peeling problem that asks for the largest convex Polygon ('Potato') contained inside a given simple polygon, answering a question of J. Goodman. This leads to a polynomial-time, solution of O(n/sup 9/log n). The techniques used turn out to be useful for other cases of what we call the polygon inclusion and enclosure problem. For instance, the largest perimeter potato can be found in O(n/sup 6/) time and finding the smallest k-gon enclosing a given polygon can be done in O(n/sup 3/log k) steps.
Group interaction with smart phones at work place
Authors: Sanjay Tripathi
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this demonstration paper, I am putting forward the Human, Technology and Organization concept on the ever-increasing use of mobile communication in our personal as well as professional life. It also reflects the interdisciplinary perspectives of mobile communication. It was our research objective to see the effect of particular technological tool i.e. mobile communication used by human being in a specific work and organizational setting. This paper addresses how the new promising paradigm of mobile technology can apply to the provisioning of service based on the concepts of the virtual organization Environment being developed for third generation mobile communication.
Bounded oscillation criteria for second-order nonlinear delay difference equations of unstable type
Authors: L. Debnath, J. C. Jiang
Venue: Computers Mathematics with Applications (2008)

This paper deals with some sufficient conditions for the bounded oscillation criteria for the second-order nonlinear delay difference equation @D^2x"n=@?i=1mp"ix"n"-"k"""i+f(n,x"n"-"l"""1,...,x"n"-"l"""s),n=0,1,2,.... In addition, we generalize and improve the existing results, and then give some examples of applications.
The Seller Ledger: An Auction Organizer for Selling on eBay, Coil Bound edition
Authors: Hillary DePiano, Priced Nostalgia
Venue:  (2007)

Set up like a traditional ledger, The Seller Ledger allows sellers to keep track of fees, profits, feedback, addresses, tracking information, shipping and handling costs and much more all in one place. Item information about your sales and auctions is only kept on eBay for 90 days so millions of sellers have found the value of keeping a hard copy of their records to minimize mistakes and for running a more efficient business in the online marketplace. Whether you are a Power Seller or just someone looking to sell enough to clean out their attic, the value of organizing all your eBay information in one place is immeasurable. Specifically designed for the online marketplace, it also contains the most recent fees for both eBay and PayPal on a handy "cheat sheet" while including ways to keep track of Non-Paying bidder alerts, returns, and other eBay procedures. With room for over 1,500 auctions!
On Signature Invariants for Effective Motion Trajectory Recognition
Authors: Shandong Wu, Y.F. Li
Venue: International Journal of Robotics Research (2008)

Motion trajectory can be an informative and descriptive clue that is suitable for the characterization of motion. Studying motion trajectory for effective motion description and recognition is important in many applications. For instance, motion trajectory can play an important role in the representation, recognition and learning of most long-term human or robot actions, behaviors and activities. However, effective trajectory descriptors are lacking and most reported work just uses motion trajectory in its raw data form. In this paper, we propose a novel motion trajectory signature descriptor and study its rich descriptive invariants which benefit effective motion trajectory recognition. These invariants are key measures of the flexibility and effectiveness of a descriptor. Substantial descriptive invariants can be deduced from the proposed trajectory signature, which is attributed to the computational locality of the signature components. We first present the signature definition and its robust implementation. Then the signature's invariants are elaborated. A non-linear inter-signature matching algorithm is developed to measure the signature's similarity for trajectory recognition. Experiments are conducted to recognize human sign language, in which both synthetic and real data are used to verify the signature's invariants, and to illustrate the effectiveness in the signature recognition.
Multilevel approaches for large-scale proteomic networks
Authors: S. Oliveira, S. -C. Seok
Venue: International Journal of Computer Mathematics (2007)

Our multilevel algorithms aim to improve existing graph clustering algorithms which predict protein complexes in large-scale proteomic networks, which are represented as unweighted graphs. Current matching based multilevel algorithms are hampered by low-quality of grouping (coarsening) even though they dramatically reduce computational time. We present a multilevel algorithm with structured analysis of unweighted networks which constructs high-quality groups of nodes merged before applying a clustering algorithm. A 2-core network of a proteomic network is constructed by removing all nodes which have degree less than two recursively. Our multilevel algorithm builds a series of smaller (or coarser) networks from the 2-core network by searching highly dense subgraphs in each level and then a clustering algorithm is applied. The clustering results are passed to the original network with additional fine tuning. All leftover nodes outside the 2-core network are added back after the multilevel algorithm. Compared to existing multilevel algorithm, our multilevel algorithm on 2-core networks shows that nodes in coarser networks have higher accuracy in all supernodes, and clustering results show up to 15% (mostly around 10%) improvements. Moreover, our clustering algorithm uses only one or two levels, so it is free from deciding the number of levels to expect best results.
Derivative reproducing properties for kernel methods in learning theory
Authors: Ding-Xuan Zhou
Venue: Journal of Computational and Applied Mathematics (2008)

The regularity of functions from reproducing kernel Hilbert spaces (RKHSs) is studied in the setting of learning theory. We provide a reproducing property for partial derivatives up to order s when the Mercer kernel is C^2^s. For such a kernel on a general domain we show that the RKHS can be embedded into the function space C^s. These observations yield a representer theorem for regularized learning algorithms involving data for function values and gradients. Examples of Hermite learning and semi-supervised learning penalized by gradients on data are considered.
Explicit design of FPGA-based coprocessors for short-range force computations in molecular dynamics simulations
Authors: Yongfeng Gu, Tom VanCourt, Martin C. Herbordt
Venue: Parallel Computing (2008)

FPGA-based acceleration of molecular dynamics simulations (MD) has been the subject of several recent studies. The short-range force computation, which dominates the execution time, is the primary focus. Here we combine: a high level of FPGA-specific design including cell-lists, systematically determined interpolation and precision, handling of exclusion, and support for MD simulations of up to 256K particles. The target system consists of a standard PC with a 2004-era COTS FPGA board. There are several innovations: new microarchitectures for several major components, including the cell-list processor and the off-chip memory controller; and a novel arithmetic mode. Extensive experimentation was required to optimize precision, interpolation order, interpolation mode, table sizes, and simulation quality. We obtain a substantial speed-up over a highly tuned production MD code.