ppxscal/embedding_network huggingface dataset:
On Optimal Placement of the Monitoring Devices on Channels of Communication Network
Authors: Alexey Rodionov, Olga Sokolova, Anastasia Yurgenson, Hyunseung Choo
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Modern wireless networks assume the inclusion of effective monitoring systems in its structure. These monitoring systems trace parameters of a network condition for maintenance of the control and safety. The problem of tracing data flows between clients that belong to some special set is examined. This can be realized by placement of special devices on the network channels. We propose model and method for the cost-consuming placement of such devices. The hypernets are used for a network representation. The low bound for the percentage of covered flows is obtained.
Short Communication: Three-dimensional finite element models based on in vivo microfocus computed tomography: Elimination of metal artefacts in a small laboratory animal model by registration with artefact-free reference images
Authors: L. Muraru, C. Van Lierde, I. Naert, J. Vander Sloten, S. V. N. Jaecques
Venue: Advances in Engineering Software (2009)

A method is presented to generate metal-artefact-free finite element (FE) models based on in vivo micro-CT images of bone-implant structures in the case of the Guinea Pig's tibiae. A bone-implant composite FE model was constructed based on both pre- (just before implant insertion) and post-operative (4days after implant insertion) sets of micro-CT scans. Definition of bone geometry and attribution of material properties to the volumetric elements was based on pre-operative images while post-operative scans were mainly used for registration. Standard Triangulation Language (STL) representations of implant and bone were generated after segmentation of CT images in MIMICS^(R) (Materialise). Registration was performed in 3-matic^(R) (Materialise). By taking two sets of scans at a 4days interval, undisturbed bone geometry before implant insertion and implant position after insertion were recorded. After adequate validation, FE models constructed with this method can be used to study bone adaptive response to controlled mechanical loading.
TCP Throughput Estimation by Lightweight Variable Packet Size Probing in CDMA2000 1x EV-DO Network
Authors: Takayuki Goto, Atsushi Tagami, Teruyuki Hasegawa, Shigehiro Ano
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

TCP throughput is one of the major communication quality metrics. In order to grasp this metric by active measurement while imposing a lower load, various estimation techniques have been proposed. These techniques are categorized as either equation-based or history-based; here we focus on the latter. Conventional history-based estimation techniques target a wired environment and estimate temporally. By contrast, we target a wireless environment and estimate spatially. For TCP throughput estimation using lightweight probing, we propose a new modeling whereby TCP throughput is determined by capacity and delay fluctuation. We evaluate our proposed modeling by conducting experiments in a commercial CDMA2000 1x EV-DO network. This evaluation empirically verified the validity of our model to estimate TCP throughput in a wireless environment with lightweight probing.
A Novel Approach for Automatic Number of Clusters Detection in Microarray Data Based on Consensus Clustering
Authors: Nguyen Xuan Vinh, Julien Epps
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Estimating the true number of clusters in a data set is one of the major challenges in cluster analysis. Yet in certain domains,knowing the true number of clusters is of high importance. For example, in medical research, detecting the true number of groups and sub-groups of cancer would be of utmost importance for their effective treatment. In this paper we propose a novel method to estimate the number of clusters in a micro array data set based on the consensus clustering approach. Although the main objective of consensus clustering is to discover a robust and high quality cluster structure in a data set, closer inspection of the set of clusterings obtained can often give valuable information about the appropriate number of clusters present. More specifically, the set off clusterings obtained when the specified number of clusters coincides with the true number of clusters tends to be less diverse.To quantify this diversitywe develop a novel index, namely the Consensus Index (CI), which is built upon a suitable clustering similarity measure such as the well known Adjusted Rand Index (ARI)or our recently developed, information theoretic based index, namely the Adjusted Mutual Information (AMI). Our experiments on both synthetic and real microarray data sets indicate that the CI is a useful indicator for determining the appropriate number of clusters.
Mining Musical Patterns: Identification of Transposed Motives
Authors: Fernando Berzal, Waldo Fajardo, Aída Jiménez, Miguel Molina-Solana
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Automatic extraction of frequent repeated patterns in music material is an interesting problem. This paper presents an effective approach of unsupervised frequent pattern discovery method from symbolic music sources. Patterns are discovered even if they are transposed. Experiments on some songs suggest that our approach is promising, specially when dealing with songs that include non-exact repetitions.
Formal Modular Modelling of Context-Awareness
Authors: Mats Neovius, Kaisa Sere
Venue: Formal Methods for Components and Objects: 7th International Symposium, FMCO 2008, Sophia Antipolis, France, October 21-23, 2008, Revised Lectures (2009)

Characterising for a context-aware software is its ability to adjust to the prevailing situation. Such software reacts and bases the context-aware decisions upon inputs describing its operating conditions, i.e. on context(s). In this paper, we will seek the roots of context(s) and reason on the methods for deducing information by processing contexts; that is, present a methodology to enhance the relevance from raw data to knowledge. Thus, this paper will point out the relationship between introducing, constructing, serving, gluing and utilising context. Moreover, we show how to in a structured manner construct a context-service that satisfies given requirements and supplement the context-aware utiliser. For the sake of reuse and scalability, we will separate an application's specification from context reasoning and consider them as systems in their own rights. The findings will be motivated on a general level, with an easily conceivable example and formalised with the action system formalism.
Abductive Authorization Credential Gathering
Authors: Moritz Y. Becker, Jason F. Mackay, Blair Dillaway
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

A central task in the context of logic-based decentralized authorization languages is that of gathering credentials from credential providers, required by the resource guard’s policy to grant a user’s access request. This paper presents an abduction-based algorithm that computes a specification of missing credentials without communicating with remote credential providers. The specification is used to gather credentials from credential providers in a single pass, without involving any communication with the resource guard. The credentials gathered thus are pushed to the resource guard at authorization time. This approach decouples authorization from credential gathering, and, in comparison to server-side pull methods, reduces the number of messages sent between participants, and allows for environments in which some credential providers are unknown or unavailable to the resource guard at authorization time.
Impact of linguistic analysis on the semantic graph coverage and learning of document extracts
Authors: Jure Leskovec, Natasa Milic-Frayling, Marko Grobelnik
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Automatic document summarization is a problem of creating a document surrogate that adequately represents the full document content. We aim at a summarization system that can replicate the quality of summaries created by humans. In this paper we investigate the machine learning method for extracting full sentences from documents based on the document semantic graph structure. In particular, we explore how the Support Vector Machines (SVM) learning method is affected by the quality of linguistic analyses and the corresponding semantic graph representations. We apply two types of linguistic analysis: (1) a simple part-of-speech tagging of noun phrases and verbs and (2) full logical form analysis which identifies Subject-Predicate-Object triples, and then build the semantic graphs. We train the SVM classifier to identify summary nodes and use these nodes to extract sentences. Experiments with the DUC 2002 and CAST datasets show that the SVM based extraction of sentences does not differ significantly for the simple and the sophisticated syntactic analysis. In both cases the graph attributes used in learning are essential for the classifier performance and the quality of extracted summaries.
Towards Parallel Processing of RDF Queries in DHTs
Authors: Björn Lohrmann, Dominic Battré, Odej Kao
Venue: Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems (2009)

Efficient RDF query evaluation is a requirement if the vision of a Semantic Web is to come true one day. Peer-to-peer (P2P) networks, specifically distributed hash tables (DHTs), could be one of the enabling technologies for the Semantic Web. Several DHT based RDF triple stores have been proposed but despite their differences they all process queries sequentially and hence leave an untapped potential for parallelism. This paper proposes and analyzes a scheme for parallel processing of RDF queries in DHTs. We describe a planning algorithm that attempts to reduce the response time of a query by considering parallel query plans prior to query execution. We provide an experimental evaluation of our approach and compare its results to an already existing scheme, i.e. the one of the BabelPeers project.
Enhanced turning point displays facilitate drivers' interaction with navigation devices
Authors: Myounghoon Jeon, Junho Park, Ubeom Heo, Jongmin Yun
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

Recently, the use of in-vehicle navigation devices, such as PNDs (Personal or Portable Navigation Devices) has become pervasive, and the device functions have been rapidly expanded and updated. Unfortunately, drivers often have considerable difficulty using these complex technologies. To improve and optimize PND user interfaces, the present study suggested several display improvements for the turning point, which is one of the critical usability issues. Advanced Turn-By-Turn Display and Spatial Turning Sound were suggested to facilitate the preparation of the next turns. Leading Tones for Turning was also presented to help drivers tune the timing of their turns. We evaluated these new concepts with domain experts in three countries, and improved the details of the functions. We are currently implementing those features and looking forward to demonstrating new displays on the real product in our presentation at the Automotive User Interface conference.
A Pragmatic-Context Usage Pattern for Services
Authors: Xianghong Zheng, Yuanchun Li, Zengzhi Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

The Pragmatic Web is a significant improvement of the original World Wide Web. The use of context is important in interactive services and become the focus of research on Pragmatic Web where the user’s context is changing rapidly. We are interested in the content, type and role of pragmatic-context, as swell how to use it in Pragmatic Web services. We propose an overview of the pragmatic-context definition, description and, in particular, a generic model that deal with pragmatic-context in order to provide users with more tailored composite services.
Induction of a simple morphology for highly-inflecting languages
Authors: Mathias Creutz, Krista Lagus
Venue: Proceedings of the 7th Meeting of the ACL Special Interest Group in Computational Phonology: Current Themes in Computational Phonology and Morphology (2004)

This paper presents an algorithm for the unsupervised learning of a simple morphology of a natural language from raw text. A generative probabilistic model is applied to segment word forms into morphs. The morphs are assumed to be generated by one of three categories, namely prefix, suffix, or stem, and we make use of some observed asymmetries between these categories. The model learns a word structure, where words are allowed to consist of lengthy sequences of alternating stems and affixes, which makes the model suitable for highly-inflecting languages. The ability of the algorithm to find real morpheme boundaries is evaluated against a gold standard for both Finnish and English. In comparison with a state-of-the-art algorithm the new algorithm performs best on the Finnish data, and on roughly equal level on the English data.
A distributed event architecture for space system comps
Authors: Scott Bell, David Kortenkamp, Jack Zaientz
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

Modern space systems such as satellites, human spacecraft, planetary probes and space robots are highly sensored and generate large amounts of data. For this data to be useful to humans monitoring these systems and to automated algorithms controlling these systems, it will need to be converted into more abstract data [1] [2] [3]. NASA has created software processes called comps (short for "computations") to manage these data abstractions. Comps are used in a variety of applications at NASA, from the execution of procedures to monitoring. Currently the comp creation process is manual, ad hoc, and intermingled with data displays. It is manual in the sense that comps are hand-coded computer programs for each data item. It is ad hoc in the sense that each comp is developed on its own with no representation of how it relates to the tasks being performed or to other comps. It is intermingled with the data displays in that comps are irreducible, difficult for other programs, like controllers, to access or understand, and often compiled into the data display. In this paper we present an architecture that allows engineers to design comps in an efficient, flexible, and canonical manner.
A vision-based system for a UGV to handle a road intersection
Authors: Javed Ahmed, Mubarak Shah, Andrew Miller, Don Harper, M. N. Jafri
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We propose a real-time computer vision system that enables a UGV to safely cross urban road-intersections. Specifically, when the UGV approaches the stop sign at a 4-way intersection, it must be aware of the vehicles at the other three roads and adhere to traffic rules by waiting for its turn to proceed. The proposed solution consists of three main components: a vehicle detector, a tracker, and a finite-state-machine to model the traffic. We use an OT-MACH filter to detect the leading vehicle in each of three camera-views of the corresponding roads. Then, we track the vehicles using an edge-enhanced dynamic correlation tracker, which estimates the current and next positions, velocities, and accelerations of the vehicles. Finally, the finite-state-machine describes the traffic in each road with one of four possible states (i.e. No Vehicle Waiting, Arriving, Waiting, and Passing), and signals an autopilot system when it is safe to pass the intersection. We provide the results from an actual intersection with real traffic to demonstrate that the UGV is able to automatically navigate the intersection using the proposed system.
Constraint Answer Set Solving
Authors: Martin Gebser, Max Ostrowski, Torsten Schaub
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithmic framework for conflict-driven ASP solving that exploits CP solving capacities. A significant technical issue concerns the combination of conflict information from different solver types. We have implemented our approach, combining ASP solver clingo with the generic CP solver gecode, and we empirically investigate its computational impact.
The New Algorithm Based on Grid Service Exception Handling
Authors: Jian-jun Liu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

A grid service is a Web service that provides a group of well-defined connections and follows certain standards. Grid service exceptions refer to all kinds of questions that may occur in the request, response and implementation of a grid service. The research of grid service exceptions relies on the grid system structure. This paper discusses the related concepts and theorems in grid service exceptions, proposes the Ant/Bee-Back algorithm used in the grid service exception handling, and confirms the validity of this algorithm with examples. The processing of returning to old route is similar to the method by which ant goes home; The method by which wrong message is sent to GC when exception service occurs is similar to the method by which a honeybee returns to the honeycomb. Finally analog experiment is given to confirm this method.
On Relocation of Hopping Sensors for Balanced Migration Distribution of Sensors
Authors: Moonseong Kim, Matt W. Mutka
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

When some sensors in Wireless Sensor Networks (WSNs) fail or become energy-exhausted, redundant mobile sensors might be moved to cover the sensing holes created by the failed sensors. Within rugged terrains where wheeled sensors are unsuitable, other types of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. The recently studied tendency for this problem considered the shortest path to relocate the sensors; however, even when multiple suppliers are considered, the previous works merely use the shortest path algorithm repeatedly. As a result, the migration distribution is imbalanced, since specific clusters on the obtained paths could be used repeatedly. In this paper, we first analyze the impact of using multiple suppliers to relocate the hopping sensors, and propose a Relocation Algorithm using the Most Disjointed Paths (RAMDiP). Simulation results show that the proposed RAMDiP guarantees a balanced movement of hopping sensors and higher movement success ratio of requested sensors than those of the representative relocation scheme, MinHopExt.
Study on Urban Land Information System Based on GIS
Authors: Zhang He-bing, Zhao Su-xia
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Urban land utilization plays an important role in city development, We establish the "Urban Land Information System based on GIS" in order to inspect urban land structure and utilize a model automatically, A series of codes abstracted from urban land sustainable utilization significance are used as measures in land inspection, GIS tools combined with "Urban Land Information System" make visible codes calculations and statistical results possible, Useful mathematic methods are cited to analyze the degree urban land sustainable and optimize land structure. By scientific system analysis, relationships among modules and system structure are illustrated c1early. As a result this study has drawn out the "Urban Land Information System" mode1.
Bidding for Complex Projects: Evidence from Italian Government's Acquisitions of IT Services
Authors: Gian Luigi Albano, Federico Dini, Roberto Zampino
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

Public buyers are often mandated by law to adopt competitive procedures to ensure transparency and promote full competition. Recent economic literature, however, suggests that open competition can perform poorly in allocating complex projects. In exploring the determinants of bidding behavior in tenders for complex IT services, we find results that appear consistent with theory. Our analysis shows that price and quality are linked in a puzzling way: high quality is associated with low prices. We also find that quality proposals are mainly explained by suppliers' experience. Results suggest that scoring rules at the basis of the tendering process might fail to appropriately incorporate buyers' complex price/quality preferences.
Face Tracking with Occlusion
Authors: Jianxiong Tang, Jianxin Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

The Camshift algorithm fails to track face easily while it is occluded, so a new face tracking method is proposed in this paper. This method combines the Camshift algorithm and the GM(1,1) model with optimized background values. By using moving vector information, this method can effectively track face even occluded by other static objects. The GM(1,1) prediction model will reduce the searching region of the Camshift algorithm and enhance real-time performance. Furthermore this model is not only suitable for modeling of low increase exponential sequence but also suitable for high increase exponential sequence, so it adapts to the characteristic of human’s free motion. With occlusion, this method can improve accuracy of human face tracking and enhance robustness of the tracking algorithm by replacing the real values with the prediction values containing prediction errors.
Analyses of Knowledge Creation Processes Based on Different Types of Monitored Data
Authors: Ján Paralič, František Babič, Jozef Wagner, Ekaterina Simonenko, Nicolas Spyratos, Tsuyoshi Sugibuchi
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

This paper presents specialized methods for analyzing knowledge creation processes and knowledge practices that are (at least partially) projected in work within a virtual collaborative environment. Support for such analysis and evaluation of knowledge creation processes is provided by historical data stored in a virtual working environment, and describes various aspects of the monitored processes (e.g. semantic information, content, log of activities, etc.). The proposed analytical methods cover different types of analysis, such as (a) statistic analysis, that provides information about processes, and the possibility to visualize such information based on user-selected presentation modes; (b) time-line based analysis that supports visualization of the real process execution with all relevant information, including the possibility to identify and further analyze working patterns in knowledge creation processes (projection of knowledge practices). Experimental evaluation of the proposed methods is carried out within the IST EU project called KP-Lab.