ppxscal/embedding_network huggingface dataset:
Selection of Streets Based on Mesh Density for Digital Map Generalization
Authors: Yungang Hu, Jun Chen, Zhilin Li, Renliang Zhao
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper proposes a novel approach of selective omission for streets based on mesh density. For meshes with density over threshold, the largest density meshes are taken out by turns and one road segment of them is eliminated. Meanwhile the taken mesh is merged with the adjacent mesh at a time. Road segment to be eliminated is the most unimportant in all segments on the boundary of this mesh according to the parameters reflecting the importance of road segments. In this study, for the different type meshes, their thresholds are different, which can preserve the density difference. The process of eliminating road segments and merging meshes would ensure the network connectivity. This proposed approach considers topological, geometric and semantic properties of the street network. A street network is selectively eliminated employing this approach, and the results of selection achieve better effects.
Motion Estimation via Belief Propagation
Authors: Giuseppe Boccignone, Angelo Marcelli, Paolo Napoletano, Mario Ferraro
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We present a probabilistic model for motion estimation in which motion characteristics are inferred on the basis of a finite mixture of motion models. The model is graphically represented in the form of a pairwise Markov Random Field network upon which a Loopy Belief Propagation algorithm is exploited to perform inference. Experiments on different video clips are presented and discussed.
A technique for self-certifying tamper resistant software
Authors: Hongxia Jin, Ginger Myles
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

Until recently the use of software tamper resistance was rather limited. However, as the music and movie industries have increased their reliance on content protection systems, the importance placed on and the use of tamper resistance has also increased. Unfortunately, the nature of tamper resistance can make it difficult for developers to determine if a protection mechanism isactually robust and which attacks it can protect against. To address this issue we have designed a tool for self-certifying the strength of a tamper resistance implementation that is based on a hybrid attack-defense graph. This approachto tamper resistance evaluation is advantageous in that it enables certification without leaking confidential implementation details and it assists developers in designing more robust implementations.
Biomass Based Weed-Crop Competitiveness Classification Using Bayesian Networks
Authors: Glaucia M. Bressan, Vilma A. Oliveira, Estevan R. Hruschka, Maria C. Nicoletti
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper describes the modeling of a biomass based weed-crop competitiveness classification process, based on a Bayesian network classifier. The understandability of the model is improved by its automatic translation into a set of classification rules, which are easily understood by human beings. The Bayes approach is based on empirical data col- lected in a corn-crop and uses the concept of maximum a posteriori probability to extract a set of probabilistic rules from the induced Bayesian network classifier. The features used to build the Bayesian network classifier are the total density of weeds and the corresponding proportions of nar- row and broadleaf weeds and the class variable is the weeds biomass from which the weed-crop competitiveness is in- ferred. The paper presents a set of 27 rules extracted from the Bayesian network classifier which classify the biomass of weeds.
Test suite reduction and prioritization with call trees
Authors: Adam M. Smith, Joshua Geiger, Gregory M. Kapfhammer, Mary Lou Soffa
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

This paper presents a tool that (i) constructs tree-based models of a program's behavior during testing and (ii) employs these trees while reordering and reducing a test suite. Using either a dynamic call tree or a calling context tree, the test reduction component identifies a subset of the original tests that covers the same call tree paths. The prioritization technique reorders a test suite so that it covers the call tree paths more rapidly than the initial test ordering. In support of program and test suite understanding, the tool also visualizes the call trees and the coverage relationships. For a chosen case study application, the experimental results show that call tree construction only increases testing time by 13%. In comparison to the original test suite, the experiments show that (i) a prioritized suite achieves coverage much faster and (ii) a reduced test suite contains 45% fewer tests and consumes 82% less time
Refinement patterns for rapid development of dependable systems
Authors: Alexei Iliasov
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

Although, it is widely recognised that formal methods is the single most important technique for building complex dependable systems, formal methods struggle to gain wide acceptance outside their few traditional application areas. In this paper we investigate a method for mechanised transformation of formal models. We argue that, applied to the vast catalogue of architectural and design patterns for dependable systems, this method can greatly contribute to the applicability of formal methods in development of dependable systems. The discussion is supported by a detailed analysis of the Triple Modular Redundancy pattern and a prototype plugin to the RODIN platform which adds the refinement mechanisation support to the Event-B formal framework.
A Practical Calibration Method for Multiple Cameras
Authors: Liuxin Zhang, Bin Li, Yunde Jia
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we propose a practical factorization-and- position based method for multiple cameras calibration. The method yields a simple calibration means for an arbitrary number of linear projective cameras while maintaining the handiness and flexibility of the original method. A freely moving planar pattern as a calibration object at a few different orientations is only required. All the cameras do not have to see this pattern at all orientations, and only reasonable overlap between camera subgroups is necessary. We divide these cameras into groups according to their positions and orientations first, and then calibrate each camera in the world coordinate system of its own group via a factorization-based method. Common view fields of planar pattern are used to estimate the Euclidean transformation between these world coordinate systems and represent all cameras in a same world coordinate system. Both the intrinsic and extrinsic parameters of cameras can be obtained in a uniform world coordinate system of accuracy to within a pixel.
The effect of input mode on inactivity and interaction times of multimodal systems
Authors: Manolis Perakakis, Alexandros Potamianos
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

In this paper, the efficiency and usage patterns of input modes in multimodal dialogue systems is investigated for both desktop and personal digital assistant (PDA) working environments. For this purpose a form-filling travel reservation application is evaluated that combines the speech and visual modalities; three multimodal modes of interaction are implemented, namely: "Click-To-Talk", "Open-Mike" and "Modality-Selection". The three multimodal systems are evaluated and compared with the "GUI-Only" and "Speech-Only" unimodal systems. Mode and duration statistics are computed for each system, for each turn and for each attribute in the form. Turn time is decomposed in interaction and inactivity time and the statistics for each input modeare computed. Results show that multimodal and adaptive interfaces are superior in terms of interaction time, but not always in terms of inactivity time. Also users tend to use themost efficient input mode, although our experiments show abias towards the speech modality.
Intelligent scheduling and planning systems for telecommunications resource management
Authors: N. Azarmi, R. Smith
Venue: BT Technology Journal (2007)

This paper discusses the importance of resource management in the telecommunications industry. It argues for intelligent resource management systems (IRMSs) that are capable of providing flexible and dynamic resource management. It introduces the main requirements and benefits of an IRMS and describes the technical basis of current research activities which are leading towards the development of constraint technology based IRMS platforms.
Generation 3D: Living in Virtual Worlds
Authors: Mike Macedonia
Venue: Computer (2007)

Within decades, people could spend at least as much time in virtual worlds as in the real one.
Querying Graph-Structured Data
Authors: Jiefeng Cheng, Jeffrey Xu Yu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Graphs have great expressive power to describe the complex relationships among data objects, and there are large graph datasets available such as Web data, semi-structured data and XML data. In this paper, we describe our work on querying graph-structured data, including graph labeling methods, reachability joins, and graph pattern matching. We show that we can base on the graph labeling of complex XML and semi-structured data to process path queries and we devise join primitives for matching graph patterns. Novel aspects about using such join primitives for graph pattern matching are addressed.
Lifetime Optimized Methods of Correlated Data Gathering on Sensor Networks
Authors: Xun Zhou, Shengfei Shi, Jizhou Luo, Wei Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

This paper presented two methods of correlated data gathering on sensor networks, LOMFC and LOMSC, based on two types of correlation model, Foreign-Coding and Self-Coding. The goal of the methods is to maximize the lifetime of the network. They perform a series of adjustments over a built data gathering topology and improved the lifetime of the network. The methods in this paper overcame the energy consumption imbalance of some previous methods of correlated data gathering and are highly distributed. The stimulations proved that the two methods outperform previous algorithms in lifetime and are always reliable.
A partition bijection related to the Rogers--Selberg identities and Gordon's theorem
Authors: Andrew V. Sills
Venue: Journal of Combinatorial Theory Series A (2008)

We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon's combinatorial generalization of the Rogers-Ramanujan identities. The implications of applying the same map to a special case of David Bressoud's even modulus analog of Gordon's theorem are also explored.
Genre identification and goal-focused summarization
Authors: Jade Goldstein, Gary M. Ciany, Jaime G. Carbonell
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In this paper, we present a novel technique of first performing document genre identification, then utilizing the genre for producing tailored summaries based on a user's information seeking needs - genre oriented goal-focused summarization - such as a plot or opinion summary of a movie review. We create a test corpus to determine genre classification accuracy for 16 genres, and examine performance on various amounts of training data for machine learning algorithms - Random Forests, SVM light and Naïve Bayes. Results show that Random Forests outperforms SVM light and Naïve Bayes. The genre tag is used to inform a downstream summarization engine. We define types of summaries for 7 genres, create a ground truth corpus and analyze the results of genre oriented goal-focused summarization, showing that this type of user based summarization requires different algorithms than the leading sentence baseline which is known to perform well in the case of news articles.
Ground Control to Architect Tom...
Authors: Alex Bell
Venue: Queue (2007)

Project managers love him, recent software engineering graduates bow to him, and he inspires code warriors deep in the development trenches to wonder if a technology time warp may have passed them by. How can it be that no one else has ever proposed software development with the simplicity, innovation, and automation being trumpeted by Architect Tom? His ideas sound so space-age, so futuristic, but why should that be so surprising? After all, Tom is an architecture astronaut!
Gate sizing by Lagrangian relaxation revisited
Authors: Jia Wang, Debasish Das, Hai Zhou
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, we formulate the Generalized Convex Sizing (GCS) problem that unifies and generalizes the sizing problems. We revisit the approach to solve the sizing problem by Lagrangian relaxation, point out several misunderstandings in the previous works, and extend the approach to handle general convex delay functions in the GCS problems. We identify a class of proper GCS problems whose objective functions in the simplified dual problem are differentiable and show many practical sizing problems, including the simultaneous sizing and clock skew optimization problem, are proper. We design an algorithm based on the method of feasible directions to solve proper GCS problems. The algorithm will provide evidences for infeasible GCS problems according to a condition derived by us. Experimental results confirm the efficiency and the effectiveness of our algorithm when the Elmore delay model is used.
Context-Aware Migratory Services in Ad Hoc Networks
Authors: Oriana Riva, Tamer Nadeem, Cristian Borcea, Liviu Iftode
Venue: IEEE Transactions on Mobile Computing (2007)

Ad hoc networks can be used not only as data carriers for mobile devices, but also as providers of a new class of services specific to ubiquitous computing environments. Building services in ad hoc networks, however, is challenging due to the rapidly changing operating contexts, which often lead to situations where a node hosting a certain service becomes unsuitable for hosting any longer the service execution. We propose a novel model of service provisioning in ad hoc networks based on the concept of context-aware migratory services. Unlike a regular service that executes always on the same node, a migratory service can migrate to different nodes in the network in order to accomplish its task. The migration is triggered by changes of the operating context, and it occurs transparently to the client application. We designed and implemented a framework for developing migratory services. We built TJam, a proof-of-concept migratory service that predicts traffic jams in a given region of a highway by using only car-to-car shortrange wireless communication. The experimental results obtained over an ad hoc network of PDAs show the effectiveness of our approach in the presence of frequent disconnections. We also present simulation results that demonstrate the benefits of migratory services in large scale networks compared to a statically centralized approach.
Robust group key agreement using short broadcasts
Authors: Stanisław Jarecki, Jihye Kim, Gene Tsudik
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constant-round GKA's have been proposed. However, their performance degrades if some players fail during protocol execution. This is a problem in practice, e.g. for mobile nodes communicating over wireless media, which can loose connectivity during the protocol execution. Current constant-round GKA protocols are either efficient and non-robust or robust but not efficient: Assuming a reliable broadcast communication medium, the standard encryption-based group key agreement protocol can be robust against arbitrary number of node faults, but the size of the messages broadcast by every player is proportional to the number of players. In contrast, non-robust group key agreement can be achieved with each player broadcasting just constant-sized messages. We propose a novel 2-round group key agreement protocol which tolerates up to T node failures using O(T)-sized messages, for any T. To exemplify the usefulness of this flexible trade-off between message size and fault tolerance, we show that the new protocol implies a fully-robust group key agreement with O(log n)-sized messages and expected round complexity close to 2, assuming random node faults. The proposed protocol is secure under the (standard) Decisional Square Diffie-Hellman assumption.
Open Source Software: Is It Worth Converting?
Authors: Phillip Laplante, Anthony Gold, Thomas Costello
Venue: IT Professional (2007)

Open source software use is amassing a long list of benefits, among them higher software quality. Enterprises that are still discouraged by the task of converting existing software might find that modernization building blocks can make that task easier. Adapting or converting to OSS need not be overwhelming as this case study shows.
Advanced autonomous access control system for web-based server applications
Authors: Lubomir Cvrk, Vit Vrba, Karol Molnar
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The number of the server applications in the world is rapidly increasing. Many of them need to handle user access. A typical approach is to implement access control logic directly into an object which is responsible for storing and retrieving the data and performing required operations over the data. The object checks access to appropriate methods and permits or denies required operation. But the systems are usually constructed from many such objects which require similar access control system. This leads to a greater overhead because access control checking must be coded inside all those objects. More code brings more bugs into the system moreover if a programmer simply forgets to verify some of required rights in the code then the system may encounter a forbidden data access. This article deals with that problem area and designs a unified database layer operating over relation database management systems. Key benefits it brings are strong simplification of the access control system from the point of view of the application code and impossibility to access data without permissions.
Document Image Mosaicing with Mobile Phones
Authors: Jari Hannuksela, Pekka Sangi, Janne Heikkila, Xu Liu, David Doermann
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents a novel user interaction concept for document image scanning with mobile phones. A high res- olution mosaic image is constructed in two main stages. Firstly, online camera motion estimation is applied to the phone to assist the user to capture small image patches of the document page. Automatic image stitching process with the help of estimated device motion is carried out to recon- struct the full view of the document. Experiments on doc- ument images captured and processed with mosaicing soft- ware clearly show the feasibility of the approach.
Towards a Finer Assessment of Extraction Contexts Sparseness
Authors: Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

It is widely recognized that the performances of frequent closed itemset mining algorithms are closely dependent on the type of handled extraction contexts, i.e., sparse or dense. In this paper, we address an important question: how can we formally define the sparseness of a given extraction context and assess its value? As an answer, this paper presents a study in which we deal with the problem of assessment of an extraction context's sparseness. Indeed, using the framework of the Succinct System of Minimal Generators, we present a new sparseness measure which results from the aggregation of two complementary measures, namely the succinctness and compactness measures of each equivalence class, induced by the closure operator. Preliminary experiments mainly permit to rectify the classification of benchmark contexts and confirm our claim that the "dense" and "sparse" qualifications are not absolute ones.
Effective source-level debugging of wireless sensor networks
Authors: Jing Yang, Mary Lou Soffa, Kamin Whitehouse
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Sensor network debugging is notoriously difficult because many bugs manifest themselves only when they encounter the real world -- exactly when most powerful debugging tools can no longer be applied. There are currectly two common approaches to source level debugging in wireless sensor networks (WSNs), (i) simulation-based debugging [3], and (ii) wire-based debugging via logic analyzers or in-circuit emulators [1]. The former do not capture the true dynamics of a real deployment while the latter do not scale with the number of nodes and geographic size of the network. Thus, existing source-level debugging approaches for WSNs cannot be used in many real deployment environments.
Factors Influencing Cross-straits High-school Students' Intention to Participate in Future Web-based Distance Education
Authors: Ying-Chi Chen
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The goals of this study are to identify factors influencing the intention of high-school students across Taiwan Straits to participate in the Web-based Distance Education (DE). MISS (Multi-faceted Internet Survey System) has been adopted to collect data from 3,677 high-school students from both China and Taiwan. All indicators of this study, such as the availability of school online courses, home computer environment, high-school student computer skills and also their practical experiences in taking online courses, are re-constructed based on each indicator's own set of variables in order to evaluate their impacts on high-school students' willingness to take Web-based DE courses in the future. Estimations of logistic regression models of high-school students in China and Taiwan respectively are generated to predict factors influencing their intentions to take DE courses on the Web. Finally, policy oriented recommendations on how to enhance high-school students' intention to participate in the Web-based DE are suggested.