ppxscal/embedding_network huggingface dataset:
HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network
Authors: Jianping Wang, Eseosa Osagie, Parimala Thulasiraman, Ruppa K. Thulasiram
Venue: Ad Hoc Networks (2009)

Mobile ad hoc network (MANET) is a group of mobile nodes which communicates with each other without any supporting infrastructure. Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth and power energy. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MANETs. Swarm intelligence is a computational intelligence technique that involves collective behavior of autonomous agents that locally interact with each other in a distributed environment to solve a given problem in the hope of finding a global solution to the problem. In this paper, we propose a hybrid routing algorithm for MANETs based on ACO and zone routing framework of bordercasting. The algorithm, HOPNET, based on ants hopping from one zone to the next, consists of the local proactive route discovery within a node's neighborhood and reactive communication between the neighborhoods. The algorithm has features extracted from ZRP and DSR protocols and is simulated on GlomoSim and is compared to AODV routing protocol. The algorithm is also compared to the well known hybrid routing algorithm, AntHocNet, which is not based on zone routing framework. Results indicate that HOPNET is highly scalable for large networks compared to AntHocNet. The results also indicate that the selection of the zone radius has considerable impact on the delivery packet ratio and HOPNET performs significantly better than AntHocNet for high and low mobility. The algorithm has been compared to random way point model and random drunken model and the results show the efficiency and inefficiency of bordercasting. Finally, HOPNET is compared to ZRP and the strength of nature-inspired algorithm is shown.
Towards semantic maps for mobile robots
Authors: Andreas Nüchter, Joachim Hertzberg
Venue: Robotics and Autonomous Systems (2008)

Intelligent autonomous action in ordinary environments calls for maps. 3D geometry is generally required for avoiding collision with complex obstacles and to self-localize in six degrees of freedom (6 DoF) (x, y, z positions, roll, yaw, and pitch angles). Meaning, in addition to geometry, becomes inevitable if the robot is supposed to interact with its environment in a goal-directed way. A semantic stance enables the robot to reason about objects; it helps disambiguate or round off sensor data; and the robot knowledge becomes reviewable and communicable. The paper describes an approach and an integrated robot system for semantic mapping. The prime sensor is a 3D laser scanner. Individual scans are registered into a coherent 3D geometry map by 6D SLAM. Coarse scene features (e.g., walls, floors in a building) are determined by semantic labeling. More delicate objects are then detected by a trained classifier and localized. In the end, the semantic maps can be visualized for human inspection. We sketch the overall architecture of the approach, explain the respective steps and their underlying algorithms, give examples based on a working robot implementation, and discuss the findings.
Kick-Start Activation to Novice Programming --- A Visualization-Based Approach
Authors: Essi Lahtinen, Tuukka Ahoniemi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In the beginning of learning programming students have misconceptions of what programming is. We have used a kick-start activation in the beginning of an introductory programming course (CS1) to set the record straight. A kick-start activation means introducing the deep structure of programming before the surface structure by making the students solve a certain type of problem in the first lecture. The problem is related to a realistic computer program, simple enough for everyone to understand and allow students to participate in debugging. A visualization-based approach helps making the example more concrete for students. In this article we present the concept kick-start activation and one concrete example. To support the example, we have also developed a visualization using the visualization tool JHAVE. We got positive feedback on the example and suggest further development of kick-start activations in order to make the beginning of learning programming more motivating for students.
Combinatorial Groupoids, Cubical Complexes, and&#x00a0;the&#x00a0;Lov&#x00e1;sz&#x00a0;Conjecture
Authors: Rade T. &#x017d;ivaljevi&#x0107;
Venue: Discrete Computational Geometry (2009)

This paper lays the foundation for a theory of combinatorial groupoids that allows us to use concepts like &#x201c;holonomy&#x201d;, &#x201c;parallel transport&#x201d;, &#x201c;bundles&#x201d;, &#x201c;combinatorial curvature&#x201d;, etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. We introduce a new, holonomy-type invariant for cubical complexes, leading to a combinatorial &#x201c;Theorema Egregium&#x201d; for cubical complexes that are non-embeddable into cubical lattices. Parallel transport of Hom-complexes and maps is used as a tool to extend Babson&#x2013;Kozlov&#x2013;Lov&#x00e1;sz graph coloring results to more general statements about nondegenerate maps (colorings) of simplicial complexes and graphs.
Sheet 280-Fossombrone 3D: A study project for a new geological map of Italy in three dimensions
Authors: Mauro De Donatis, Francesco Borraccini, Sara Susini
Venue: Computers Geosciences (2009)

The goal of this project is to define and test a method for building a three-dimensional (3D) geological model of Italy based on maps at a 1:50,000 scale, using the new national geological mapping program (CARG project). A structural model of Sheet 280-Fossombrone (Northern Apennines, central Italy) was produced using recently developed 3D visualization techniques. This area is characterized by faulted anticlines and broad synclines, involving a Triassic-Palaeogene succession detached from its underlying basement. Exhaustive knowledge of the regional and local geology, combined with available subsurface (well and seismic) data, makes this area a good test site for developing a 3D geological modeling method. The model of Sheet 280-Fossombrone was built in two steps. In the first step, we built a 2.5D geological model using the digital elevation model combined with the new 1:50,000 scale geological map of the area. This 2.5D model shows relationships between topographic elements, geology and major structures much better than traditional 2D geological maps. In the second step, we constructed an in-depth model integrating a large amount of subsurface data with field data from the recent mapping project. The geological model of Sheet 280-Fossombrone clarifies structural geometries and kinematics of this external part of the Northern Apennines. Structural and geomorphic analyses were performed on the 3D model to evaluate how additional information can be obtained from 3D cartography in order to improve knowledge of the study area. We present results of these analyses as examples.
Modelling machine tool data in support of STEP-NC based manufacturing
Authors: W. Yang, X. Xu
Venue: International Journal of Computer Integrated Manufacturing (2008)

STEP-NC-based manufacturing is a promising approach for digital manufacturing applications. However, as STEP-NC data are machine tool independent, when implementing STEP-NC-based process planning and manufacturing, a comprehensive machine tool database is required to provide machine tool data for generating machine-tool-dependent process plans. A novel STEP-NC compliant machine tool data model named STEP-NCMtDm has been developed to realise STEP-NC based process planning and manufacturing. The goals of STEP-NCMtDm are to meet the data requirements for implementing STEP-NC data model in process planning and scheduling, and to support the distributed manufacturing environment. EXPRESS language is used for constructing the data model, and a web-based data model is also built to support distributed manufacturing scenarios by using the corresponding extensible markup language (XML) schema. A milling machine tool is used to evaluate the proposed data model. It has been demonstrated that STEP-NCMtDm can provide adequate information for STEP-NC programming.
Network analysis of massively collaborative creation of multimedia contents: case study of hatsune miku videos on nico nico douga
Authors: Masahiro Hamasaki, Hideaki Takeda, Takuichi Nishimura
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

The World Wide Web supports new styles of creative activities. For this study, we investigate massively collaborative creation via the Web, by which numerous people gather to evolve their works collaboratively. Nico Nico Douga is a video sharing website, where many videos are created collaboratively. We specifically examine Hatsune Miku, a version of singing synthesizer application software that has inspired not only song creation but also songwriting, illustration, and video editing. As described herein, different types of creators interact mutually to create new contents though their social network. Using tags, we classified videos and creators on Nico Nico Douga automatically into four basic categories. Thereby, we produced a social network from relationships among videos and creators by analyzing videos' descriptions. The social network reveals interesting features. Different categories of creators serve different roles in evolving the network, e.g., songwriters gather more links than other categories, implying that they are triggers to network evolution. We also extracted communities from the network and observed different community structures. One is a centralized network in which a single songwriter is central and others are peripheral. The other is a messier network, in which some illustrators are central, but the centrality is weak.
Cleaning uncertain data with quality guarantees
Authors: Reynold Cheng, Jinchuan Chen, Xike Xie
Venue: Proceedings of the VLDB Endowment (2008)

Uncertain or imprecise data are pervasive in applications like location-based services, sensor monitoring, and data collection and integration. For these applications, probabilistic databases can be used to store uncertain data, and querying facilities are provided to yield answers with statistical confidence. Given that a limited amount of resources is available to "clean" the database (e.g., by probing some sensor data values to get their latest values), we address the problem of choosing the set of uncertain objects to be cleaned, in order to achieve the best improvement in the quality of query answers. For this purpose, we present the PWS-quality metric, which is a universal measure that quantifies the ambiguity of query answers under the possible world semantics. We study how PWS-quality can be efficiently evaluated for two major query classes: (1) queries that examine the satisfiability of tuples independent of other tuples (e.g., range queries); and (2) queries that require the knowledge of the relative ranking of the tuples (e.g., MAX queries). We then propose a polynomial-time solution to achieve an optimal improvement in PWS-quality. Other fast heuristics are presented as well. Experiments, performed on both real and synthetic datasets, show that the PWS-quality metric can be evaluated quickly, and that our cleaning algorithm provides an optimal solution with high efficiency. To our best knowledge, this is the first work that develops a quality metric for a probabilistic database, and investigates how such a metric can be used for data cleaning purposes.
Alchemy: transmuting base alloy specifications into implementations
Authors: Shriram Krishnamurthi, Kathi Fisler, Daniel J. Dougherty, Daniel Yoo
Venue: Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering (2008)

Alloy specifications are used to define lightweight models of systems. We present Alchemy, which compiles Alloy specifications into implementations that execute against persistent databases. Alchemy translates a subset of Alloy predicates into imperative update operations, and it converts facts into database integrity constraints that it maintains automatically in the face of these imperative actions. In addition to presenting the semantics and an algorithm for this compilation, we present the tool and outline its application to a non-trivial specification. We also discuss lessons learned about the relationship between Alloy specifications and imperative implementations.
On-demand routing and channel assignment in multi-channel mobile ad hoc networks
Authors: Michelle X. Gong, Scott F. Midkiff, Shiwen Mao
Venue: Ad Hoc Networks (2009)

The capacity of mobile ad hoc networks is constrained by the intra-flow interference introduced by adjacent nodes on the same path, and inter-flow interference generated by nodes from neighboring paths. By assigning orthogonal channels to neighboring nodes, one can minimize both types of interferences and allow concurrent transmissions within the neighborhood, thus improving the throughput and delay performance of the ad hoc network. In this paper, we present three novel distributed channel assignment protocols for multi-channel mobile ad hoc networks. The proposed protocols combine channel assignment with distributed on-demand routing, and only assign channels to active nodes. They are shown to require fewer channels and exhibit lower communication, computation, and storage complexity, compared with existing approaches. Through simulation studies, we show that the proposed protocols can effectively increase throughput and reduce delay, as compared to several existing schemes, thus providing an effective solution to the low capacity problem in multi-hop wireless networks.
An Approach to Privacy Enhancement for Access Control Model in Web 3.0
Authors: Eun-Ae Cho, Chang-Joo Moon, Dae-Ha Park, Doo-Kwon Baik
Venue: Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 02 (2008)

The recent web technology has been developed by three mainsprings which include integration, virtualization, and socialization. The web technology provides the increment of the social networking ability. However it deepens the exposure of privacy about personal information as more complicating and difficult problems. Representatively, it is impossible to define and manage the specific relation, so the personal information and interest can be inferred from collecting and summarizing the contents. Also, there are some problems that it is hard to construct the information owner's own social network. Thus this paper proposes the new access control model which enhances the user privacy of the existing access control methods in web 2.0. This method prevents privacy such as personal inclination from being exposed and enables to define and manage the specific relation. By doing this the information owners can construct their social network. This social network can be applied and extended to web contents.
Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints
Authors: Shu-Chen Cheng, Der-Fang Shiau, Yueh-Min Huang, Yen-Ting Lin
Venue: Expert Systems with Applications: An International Journal (2009)

Most publications in shop scheduling area focus on the static scheduling problems and seldom take into account the dynamic disturbances such as machine breakdown or new job arrivals. Motivated by the computational complexity of the scheduling problems, genetic algorithms (GAs) have been applied to improve both the efficiency and the effectiveness for NP-hard optimization problems. However, a pure GA-based approach tends to generate illegal schedules due to the crossover and the mutation operators. It is often the case that the gene expression or the genetic operators need to be specially tailored to fit the problem domain or some other schemes may be combined to solve the scheduling problems. This study presents a GA-based approach combined with a feasible energy function for multiprocessor scheduling problems with resource and timing constraints in dynamic real-time scheduling. Moreover, an easy-understood genotype is designed to generate legal schedules. The results of the experiments demonstrate that the proposed approach performs rapid convergence to address its applicability and generate good-quality schedules.
Enabling a Meta-synthetic Discovery Workshop for Social Consensus Process
Authors: Xijin Tang
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03 (2008)

Knowledge growth is always achieved through a consensus process of debates and discussions for imaginations, inquiry, insight and integrity. Various academic conferences play vital roles during such a consensus process. Currently, digital revolutions are happening to scholarly communication. In this paper, we propose a concept of a meta-synthetic discovery workshop for the social consensus process during scientific knowledge change and delivery process. Supporting technologies such as conferencing mining are briefly discussed to enable that concept workable, especially to help push augmented information to actors during that process.
Google TV search: dual-wielding search and discovery in a large-scale product
Authors: Manish Patel, Rich Gossweiler, Mehran Sahami, John Blackburn, David Brown, Andrea Knight
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

In 2006 Google designed and implemented a TV Show search system which featured a dual-navigation control combining a powerful search system with an interactive, personalize-able TV listings grid. The dual-control system allowed users to move fluidly between explicit search and general discovery, obtain detailed information without leaving the global context and construct a personal channel for easy access and recommendations. As a complete system, TV Search integrated with Google's general search page through a mini-listings onebox and also exported information out to Google calendar, Gmail and TiVo. Building this TV Search system as a large-scale product meant addressing many technological, business and fine-grained user experience details. This paper describes the design process including the early designs, the user studies and the details of the final system including the mini-guide, main page dual-control and the integrated services on the detail pages.
Automatic mapping of soil texture through the integration of ground, satellite and ancillary data
Authors: F. Maselli, L. Gardin, L. Bottai
Venue: International Journal of Remote Sensing (2008)

Satellite images obtained in the optical domain can provide information on important soil properties, such as texture. The use of these images to automatically map soil texture is, however, complicated by the presence of vegetation cover, which can mask the soil spectral response. A multistep methodology based on the use of ground, satellite and ancillary data is proposed and tested to map soil texture in Grosseto, a province of Central Italy. The methodology first separated vegetated and nonvegetated pixels of Landsat Thematic Mapper (TM) images by the use of an appropriate spectral index, the Soil Adjusted Vegetation Index (SAVI). Next, different transforms (nonparametric and parametric) were tuned using ground samples and applied to the two pixel types to separately extract relevant spectral information. The outcomes of these transforms were then merged and subjected to further processing aimed at reducing noise and conveying spatial information to the mapping process. The stratification of the soil texture estimates obtained on different lithological units was finally tested to further improve map accuracy.
Subdivision schemes for the fair discretization of the spherical motion group
Authors: Georg Nawratil, Helmut Pottmann
Venue: Journal of Computational and Applied Mathematics (2008)

We present two subdivision schemes for the fair discretization of the spherical motion group. The first one is based on the subdivision of the 600-cell according to the tetrahedral/octahedral subdivision scheme in [S. Schaefer, J. Hakenberg, J. Warren, Smooth subdivision of tetrahedral meshes, in: R. Scopigno, D. Zorin (Eds.), Eurographics Symposium on Geometry Processing, 2004, pp. 151-158]. The second presented subdivision scheme is based on the spherical kinematic mapping. In the first step we discretize an elliptic linear congruence by the icosahedral discretization of the unit sphere. Then the resulting lines of the elliptic three-space are discretized such that the difference in the maximal and minimal elliptic distance between neighboring grid points becomes minimal.
A collaborative constraint-based meta-level recommender
Authors: Markus Zanker
Venue: Proceedings of the 2008 ACM conference on Recommender systems (2008)

Recommender Systems (RS) have become popular for their ability to make useful suggestions to online shoppers. Knowledge-based RS represent one branch of these types of applications that employ means-end knowledge to map abstract user requirements to product characteristics. Before setting up such a system, the knowledge has to be acquired from domain experts and formalized using constraints or a comparable representation mechanism. However, the initial acquisition of the knowledge base and its maintenance are effort intensive tasks. Here, we propose a system that learns rule-based preferences from successful interactions in historic transaction data. It is realized as a meta-level hybrid that employs collaborative filtering to derive preferences from a user's nearest neighbors that are processed by a knowledge-based RS to derive recommendations. An evaluation using a commercial dataset showed that this approach outperforms the prediction accuracy of a knowledge base provided by domain experts. In addition, the approach is applicable for supporting domain experts in the maintenance and validation tasks associated with providing personalization knowledge bases.
Rule sets based bilevel decision model and algorithm
Authors: Zheng Zheng, Jie Lu, Guangquan Zhang, Qing He
Venue: Expert Systems with Applications: An International Journal (2009)

Bilevel decision addresses the problem in which two levels of decision makers, each tries to optimize their individual objectives under certain constraints, act and react in an uncooperative, sequential manner. As bilevel decision making often involves many uncertain factors in real world problems, it is hard to formulate the objective functions and constraints of the leader and the follower in modelling a real bilevel decision problem. This study explores a new approach that uses rule sets to formulate a bilevel decision problem. It first develops related theories to prove the feasibility to model a bilevel decision problem by rule sets. It then proposes an algorithm to describe the modelling process. A case study is discussed to illustrate the functions and effectiveness of the proposed rule sets based bilevel decision modelling algorithm.
The Synergizer service for translating gene, protein and other biological identifiers
Authors: Gabriel F. Berriz, Frederick P. Roth
Venue: Bioinformatics (2008)

Summary: The Synergizer is a database and web service that provides translations of biological database identifiers. It is accessible both programmatically and interactively. Availability: The Synergizer is freely available to all users inter-actively via a web application ( http://llama.med.harvard.edu/synergizer/translate) and programmatically via a web service. Clients implementing the Synergizer application programming interface (API) are also freely available. Please visit http://llama.med.harvard.edu/synergizer/doc for details. Contact: fritz_roth@hms.harvard.edu