ppxscal/embedding_network huggingface dataset:
HERMES: aggregative LBS via a trajectory DB engine
Authors: Nikos Pelekis, Elias Frentzos, Nikos Giatrakos, Yannis Theodoridis
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We present HERMES, a prototype system based on a powerful query language for trajectory databases, which enables the support of aggregative Location-Based Services (LBS). The key observation that motivates HERMES is that the more the knowledge in hand about the trajectory of a mobile user, the better the exploitation of the advances in spatio-temporal query processing for providing intelligent LBS. HERMES is fully incorporated into a state-of-the-art Object-Relational DBMS, and its demonstration illustrates its flexibility and usefulness for delivering custom-defined LBS.
Designing for geometrical symmetry exploitation
Authors: André Yamba Yamba, Krister Ålander, Malin Ljungberg
Venue: Scientific Programming (2006)

Symmetry-exploiting software based on the generalized Fourier transform (GFT) is presented from a practical design point of view. The algorithms and data structures map closely to the relevant mathematical abstractions, which primarily are based upon representation theory for groups. Particular care has been taken in the design of the data layout of the performance-sensitive numerical data structures. The use of a vanilla strategy is advocated for the design of flexible mathematical software libraries: An efficient general-purpose routine should be supplied, to obtain a practical and useful system, while the possibility to extend the library and replace the default routine with a special-purpose - even more optimized - routine should be supported. Compared with a direct approach, the performance results show the superiority of the GFT-based approach for so-called dense equivariant systems. The GFT application is found to be well suited for parallelism.
Neighbor-Aware Clusterhead for SNET
Authors: Tarek R. Sheltami
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

A wireless mobile sensor network is a collection of wireless mobile hosts forming nodes that are arbitrarily and randomly changing their locations and communicating without the aid of any centralized administration or standard support services. Nodes are classified as sensor nodes and router. Some nodes act both as sensors and routers. In this paper, we propose a novel cluster-based infrastructure creation protocol, namely: the Neighbor-Aware Clusterhead (NAC). NAC establishes a dynamic wireless mobile infrastructure. We study the characteristics and performance of the NAC protocol by means of simulation. In NAC protocol nodes are synchronized with their clusterheads and are allowed to go sleep mode in order to conserve their energy without degrading the performance of the network. The network is divided into clusters managed by a clusterhead. The simulation results show that NAC protocol has a good potential to be a good candidate protocol for SNET.
An FPGA implementation of a snoop cache with synchronization for a multiprocessor system-on-chip
Authors: Akira Yamawaki, Masahiko Iwane
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

FPGA based multiprocessor SoC (MPSoC) is an on-chip multiprocessor with fully programmable feature which can reduce development cost and achieve performance requirement. In order to provide an MPSoC with the low-overhead communication and synchronization methods, this paper attempts to introduce the TSVM (Tagged Shared Variable Memory) cache to a snooping cache on the MPSoC. The TSVM cache can improve a performance by combining communication and synchronization with the coherence maintenance. Using an FPGA, we evaluate how extending a conventional snooping cache affects circuitries and clock speed. As a result, the growth of hardware amount and the degradation of clock speed are only 5% and 2% respectively. It is also confirmed that the TSVM cache improves significantly performance and energy efficiency by stalling in synchronization.
A Semantic Web Primer, 2nd Edition (Cooperative Information Systems), 2 edition
Authors: Grigoris Antoniou, Frank van Harmelen
Venue:  (2008)

The development of the Semantic Web, with machine-readable content, has the potential to revolutionize the World Wide Web and its uses. A Semantic Web Primer provides an introduction and guide to this still emerging field, describing its key ideas, languages, and technologies. Suitable for use as a textbook or for self-study by professionals, it concentrates on undergraduate-level fundamental concepts and techniques that will enable readers to proceed with building applications on their own and includes exercises, project descriptions, and annotated references to relevant online materials. A Semantic Web Primer provides a systematic treatment of the different languages (XML, RDF, OWL, and rules) and technologies (explicit metadata, ontologies, and logic and inference) that are central to Semantic Web development as well as such crucial related topics as ontology engineering and application scenarios. This substantially revised and updated second edition reflects recent developments in the field, covering new application areas and tools. The new material includes a discussion of such topics as SPARQL as the RDF query language; OWL DLP and its interesting practical and theoretical properties; the SWRL language (in the chapter on rules); OWL-S (on which the discussion of Web services is now based). The new final chapter considers the state of the art of the field today, captures ongoing discussions, and outlines the most challenging issues facing the Semantic Web in the future. Supplementary materials, including slides, online versions of many of the code fragments in the book, and links to further reading, can be found at www.semanticwebprimer.org.
Random graphs on surfaces
Authors: Colin McDiarmid
Venue: Journal of Combinatorial Theory Series B (2008)

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1,...,n}, then with probability tending to 1 as n->~, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.
Autotagging to improve text search for 3d models
Authors: Corey Goldfeder, Peter Allen
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Text search on libraries of 3D models has traditionally worked poorly, as text annotations on 3D models are often unreliable or incomplete. We attempt to improve the recall of text search by automatically assigning appropriate tags to models. Our algorithm finds relevant tags by appealing to a large corpus of partially labeled example models, which does not have to be preclassified or otherwise prepared. For this purpose we use a copy of Google 3DWarehouse, a library of user contributed models which is publicly available on the Internet. Given a model to tag, we find geometrically similar models in the corpus, based on distances in a reduced dimensional space derived from Zernike descriptors. The labels of these neighbors are used as tag candidates for the model with probabilities proportional to the degree of geometric similarity. We show experimentally that text based search for 3D models using our computed tags can approach the quality of geometry based search. Finally, we describe our 3D model search engine that uses this algorithm.
Classification of injective mappings and number sequences
Authors: Alexander M. Sukhotin, Tatijana A. Sukhotina
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

New concepts are entered in the theory of injective mappings and in the theory of numerical sequences such as: a precise pair of variables, a divergent sequence, a convergent in itself sequence etc. The new methodological approach has allowed to classify injective mappings and numerical sequences and to prove some paradoxical from the classical point of view the statements on the analysis: the existence of infinity large Cauchy's sequences has made possible and necessary the introduction of infinity large numbers.
A practical automatic polyhedral parallelizer and locality optimizer
Authors: Uday Bondhugula, Albert Hartono, J. Ramanujam, P. Sadayappan
Venue: ACM SIGPLAN Notices (2008)

We present the design and implementation of an automatic polyhedral source-to-source transformation framework that can optimize regular programs (sequences of possibly imperfectly nested loops) for parallelism and locality simultaneously. Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model -- far beyond what is possible by current production compilers. Unlike previous works, our approach is an end-to-end fully automatic one driven by an integer linear optimization framework that takes an explicit view of finding good ways of tiling for parallelism and locality using affine transformations. The framework has been implemented into a tool to automatically generate OpenMP parallel code from C program sections. Experimental results from the tool show very high speedups for local and parallel execution on multi-cores over state-of-the-art compiler frameworks from the research community as well as the best native production compilers. The system also enables the easy use of powerful empirical/iterative optimization for general arbitrarily nested loop sequences.
A Multi-Issue Negotiation Mechanism for Bounded Rational Negotiators
Authors: Hamed Janzadeh, Ahmad Kardan
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

So far, taking computational limitations into account just has been applied to single-issue negotiations while multiple-issue negotiations are more interesting because of further compatibility with the real world mechanisms. In this paper, we propose a mechanism for multiple-issue negotiations, where the agents have time limits to find the best contract. Every negotiation consists of several independent issues where finding the best-value for each of these issues becomes an intricate problem. The agents use an optimization algorithm to optimize their proposed contract. At every time step, computations are done by the agents to improve one of these negotiation issues. Since every negotiation has to be ended before a deadline, the negotiators might have no enough time to find the best contract. As a result, finding the best result requires precise management of time allocation in order to improve each issue of the negotiation. To solve this problem, our mechanism presents a deliberation control method to allocate a suitable computation time for each issue, thus causes the agents to find the best possible contract in allotted time. We consider two different types of the agent’s knowledge about negotiation deadline. In the first type, agents are aware of each other's deadline, but in the second scenario every agent has a private deadline.
On the convexity of one coding-theory function
Authors: V. M. Blinovsky
Venue: Problems of Information Transmission (2008)

The paper completes the proof of an upper bound for multiple packings in a q-ary Hamming space.
The effects of menu parallelism on visual search and selection
Authors: Philip Quinn, Andy Cockburn
Venue: Proceedings of the ninth conference on Australasian user interface - Volume 76 (2008)

Menus and toolbars are the primary controls for issuing commands in modern interfaces. As software systems continue to support increasingly large command sets, the user's task of locating the desired command control is progressively time consuming. Many factors influence a user's ability to visually search for and select a target in a set of menus or toolbars, one of which is the degree of parallelism in the display arrangement. A fully parallel layout will show all commands at once, allowing the user to visually scan all items without needing to manipulate the interface, but there is a risk that this will harm performance due to excessive visual clutter. At the other extreme, a fully serial display minimises visual clutter by displaying only one item at a time, but separate interface manipulations are necessary to display each item. This paper examines the effects of increasing the number of items displayed to users in menus through parallelism---displaying multiple menus simultaneously, spanning both horizontally and vertically---and compares it to traditional menus and pure serial display menus. We found that moving from serial to a partially parallel (traditional) menu significantly improved user performance, but moving from a partially parallel to a fully parallel menu design had more ambiguous results. The results have direct design implications for the layout of command interfaces.
Microsoft Excel 2007 Advanced & Macros Quick Reference Guide
Authors: Beezix Inc.
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use advanced features and macros in Microsoft Office Excel 2007. The following topics are covered: Range Names - Naming a Range, Creating Several Names at Once, Limiting the Scope of a Named Range, Selecting a Named Range, Using a Range Name in a Formula, Managing Named Ranges, Structured References for Excel Tables; Mixed Reference; More Functions; Goal Seek; Saving Views; Defining Scenarios; Hiding Columns, Rows, or Sheets; Data Consolidation; Restricting Cell Entry with Data Validation; Highlighting Invalid Data; Conditional Formatting; Conditional Formatting Rules Manager; Protecting/Unprotecting Worksheets; Password Protecting Specific Cells. Macros: Showing the Developer Tab; Recording & Running a Macro; Naming a Macro; Relative vs. Absolute Recording; Documenting Macros; Assigning a Macro to the Quick Access Toolbar; Automatic Macro Execution; Creating a Macro without Recording; Calling another Macro, Setting Macro Security; Getting Help on Visual Basic; Creating a Function Procedure. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Leveraging popular destinations to enhance Web search interaction
Authors: Ryen W. White, Mikhail Bilenko, Silviu Cucerzan
Venue: ACM Transactions on the Web (TWEB) (2008)

This article presents a novel Web search interaction feature that for a given query provides links to Web sites frequently visited by other users with similar information needs. These popular destinations complement traditional search results, allowing direct navigation to authoritative resources for the query topic. Destinations are identified using the history of the search and browsing behavior of many users over an extended time period, and their collective behavior provides a basis for computing source authority. They are drawn from the end of users' postquery browse trails where users may cease searching once they find relevant information. We describe a user study that compared the suggestion of destinations with the previously proposed suggestion of related queries as well as with traditional, unaided Web search. Results show that search enhanced by query suggestions outperforms other systems in terms of subject perceptions and search effectiveness for fact-finding search tasks. However, search enhanced by destination suggestions performs best for exploratory tasks with its best performance obtained from mining past user behavior at query-level granularity. We discuss the implications of these and other findings from our study for the design of search systems that utilize user behavior, in particular, user browse trails and popular destinations.
Meshfree Thinning of 3D&#x00a0;Point Clouds
Authors: Nira Dyn, Armin Iske, Holger Wendland
Venue: Foundations of Computational Mathematics (2008)

An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D&#x00a0;point-samples is proposed. The data reduction relies on a recursive point removal algorithm, termed thinning, which outputs a data hierarchy of point-samples for multiresolution surface approximation. The thinning algorithm works with a point removal criterion, which measures the significances of the points in their local neighbourhoods, and which removes a least significant point at each step. For any point&#x00a0;x in the current point set Y&#x2282;X, its significance reflects the approximation quality of a local surface reconstructed from neighbouring points in&#x00a0;Y. The local surface reconstruction is done over an estimated tangent plane at x by using radial basis functions. The approximation quality of the surface reconstruction around x is measured by using its maximal deviation from the given point-samples X in a local neighbourhood of x. The resulting thinning algorithm is meshfree, i.e., its performance is solely based upon the geometry of the input 3D&#x00a0;surface point-samples, and so it does not require any further topological information, such as point connectivities. Computational details of the thinning algorithm and the required data structures for efficient implementation are explained and its complexity is discussed. Two examples are presented for illustration.
A Peer-to-Peer Architecture Based on Scalable Video Coding
Authors: Xuguang Lan, Nanning Zheng, Jianru Xue, Weike Chen, Bin Wang, Wen Ma, Songlin Zhao
Venue: Proceedings of the Data Compression Conference (2008)

Combining the advantages of the centralized P2P structure and the data-driven structure with scalable video coding, we propose an adaptive P2P architecture for live video based on scalable wavelet video coding over internet. The core operations are simple: every peer periodically exchanges data availability and bandwidth information with the central server, acting as the centralized index, which selects and sends a set of partners that have expected data to the demanding node. And the central server classifies one peer to a certain level according to the peer’s downloading bandwidth which coordinates with the layer level of the video data encoded using scalable wavelet coding. The peer retrieves correspondingly unavailable data from partners according to availability information.
Practical use of defect detection and prediction in the development and maintenance of software
Authors: Christopher W. Beal
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

Large complex software products inevitably contain software defects. Some of these are identified before the product ships. In the likely case where the number of defects exceeds the engineering resource required to fix them, it is important to identify the most important ones to fix. This talk will look at one Software Project (The OS/Net portion of Solaris) and describe the methods employed in the development of Solaris and how we identify, and prioritize defects. It will also look at other data driven methods that have been attempted and describe the the problems in implementing them.
Medical Image Segmentation Based on Topology Correlation of Regions
Authors: Jianmin Dong, Mingquan Zhou
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Medical image segmentation plays a very key role in medical image processing.A segmentation algorithm that based on the topology correlation of regions which mainly depend on the adjacent regions and their degrees of discrimination,is presented in the paper.The algorithm is designed by three parts:image iso-level regions marking,degrees of topology correlation discriminations calculation on these regions,marking homogeneous regions according with thedegrees.Also,comparison with other region-based segmentation,numerical experiments are implemented and the results are proved the algorithm is better than others at visible perception.
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Authors: J. Kohlas, N. Wilson
Venue: Artificial Intelligence (2008)

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.
Performance portable optimizations for loops containing communication operations
Authors: Costin Iancu, Wei Chen, Katherine Yelick
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the promise of performance and programmer productivity. Studies of well-tuned programs have suggested that PGAS languages are effective at utilizing modern networks because their one-sided communication is a good match to the underlying network hardware. An open question is whether the manual optimizations required to achieve good performance can be performed automatically by the compiler in a performance portable manner. In this paper we present a compiler and runtime optimization framework for loops containing communication operations. Our framework performs compile time message vectorization and strip-mining and defers until runtime the selection of the actual communication operations. At runtime, the communication requirements of the program are analyzed, and communication is instantiated and scheduled based on highly tuned network and application performance models. The runtime analysis takes into account network flow control and quality-of-service restrictions, and it is able to select from a large class of available communication primitives the communication schedule best suited for the dynamic combination of input size and system parameters. The results indicate that our framework produces code that scales and performs better than that of manually optimized implementations. Our approach not only improves performance, but increases programmer productivity as well.