ppxscal/embedding_network huggingface dataset:
A preliminary study on common radio resource management in heterogeneous wireless networks
Authors: Choongyong Shin, Jinsung Cho
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Users equipped with multiple wireless interfaces can get seamless services across heterogeneous wireless networks. If radio resources in heterogeneous wireless networks are managed in integrated fashion, we can handle scarce resources efficiently. In this paper, we present a preliminary study on common radio resource management in heterogeneous wireless networks. First, we propose an integrated network selection algorithm which chooses a target network for newly coming users. Second, an integrated vertical handover algorithm is proposed. When the capacity of a specific network becomes full, some users being serviced in the network are forced to move to another candidate network through our integrated vertical handover. The decision of two algorithms can be made based on the given objective functions which consider various factors such as signal strength, capacity, cost, and current load. The preliminary simulation result shows that the proposed algorithms reduce the blocking probability significantly.
Cross-calibration of MSG1-SEVIRI infrared channels with Terra-MODIS channels
Authors: G. -M. Jiang, Z. -L. Li
Venue: International Journal of Remote Sensing (2009)

This paper addresses the cross-calibration of the infrared channels 4 (3.9 µm), 9 (10.8 µm) and 10 (12.0 µm) of the Spinning Enhanced Visible and Infra-Red Imager (SEVIRI) onboard the Meteosat Second Generation 1 (MSG1) satellite with the channels of the MODerate resolution Imaging Spectroradiometer (MODIS) onboard Terra. The cross-calibrations, including the Ray-Matching (RM) method and the Radiative Transfer Modelling (RTM) method, were developed and implemented over a tropical area using SEVIRI and MODIS measurements of July 2005 and July 2006 with absolute view zenith angle differences (|ΔVZA|)
Energy aware efficient geographic routing in lossy wireless sensor networks with environmental energy supply
Authors: Kai Zeng, Kui Ren, Wenjing Lou, Patrick J. Moran
Venue: Wireless Networks (2009)

Wireless sensor networks are characterized by multihop wireless lossy links and resource constrained nodes. Energy efficiency is a major concern in such networks. In this paper, we study Geographic Routing with Environmental Energy Supply (GREES) and propose two protocols, GREES-L and GREES-M, which combine geographic routing and energy efficient routing techniques and take into account the realistic lossy wireless channel condition and the renewal capability of environmental energy supply when making routing decisions. Simulation results show that GREESs are more energy efficient than the corresponding residual energy based protocols and geographic routing protocols without energy awareness. GREESs can maintain higher mean residual energy on nodes, and achieve better load balancing in terms of having smaller standard deviation of residual energy on nodes. Both GREES-L and GREES-M exhibit graceful degradation on end-to-end delay, but do not compromise the end-to-end throughput performance.
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Authors: Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau
Venue: Discrete Applied Mathematics (2009)

Let (QP) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate (QP) into an equivalent 0-1 program with a convex quadratic objective function. The reformulated problem can then be efficiently solved by a classical branch-and-bound algorithm, based on continuous relaxation. This idea is already present in the literature and used in standard solvers such as CPLEX. Our objective in this work was to find a convex reformulation whose continuous relaxation bound is, moreover, as tight as possible. From this point of view, we show that QCR is optimal in a certain sense. State-of-the-art reformulation methods mainly operate a perturbation of the diagonal terms and are valid for any {0,1} vector. The innovation of QCR comes from the fact that the reformulation also uses the equality constraints and is valid on the feasible solution domain only. Hence, the superiority of QCR holds by construction. However, reformulation by QCR requires the solution of a semidefinite program which can be costly from the running time point of view. We carry out a computational experience on three different combinatorial optimization problems showing that the costly computational time of reformulation by QCR can however result in a drastically more efficient branch-and-bound phase. Moreover, our new approach is competitive with very specific methods applied to particular optimization problems.
A native iPhone packbot OCU
Authors: Rodrigo Gutierrez, Jeff Craighead
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This video abstract discusses the details of the implementation of a Packbot operator control unit (OCU) using Apple's official iPhone SDK.
A UML profile for the conceptual modelling of data-mining with time-series in data warehouses
Authors: Jose Zubcoff, Jesús Pardillo, Juan Trujillo
Venue: Information and Software Technology (2009)

Time-series analysis is a powerful technique to discover patterns and trends in temporal data. However, the lack of a conceptual model for this data-mining technique forces analysts to deal with unstructured data. These data are represented at a low-level of abstraction and their management is expensive. Most analysts face up to two main problems: (i) the cleansing of the huge amount of potentially-analysable data and (ii) the correct definition of the data-mining algorithms to be employed. Owing to the fact that analysts' interests are also hidden in this scenario, it is not only difficult to prepare data, but also to discover which data is the most promising. Since their appearance, data warehouses have, therefore, proved to be a powerful repository of historical data for data-mining purposes. Moreover, their foundational modelling paradigm, such as, multidimensional modelling, is very similar to the problem domain. In this article, we propose a unified modelling language (UML) extension through UML profiles for data-mining. Specifically, the UML profile presented allows us to specify time-series analysis on top of the multidimensional models of data warehouses. Our extension provides analysts with an intuitive notation for time-series analysis which is independent of any specific data-mining tool or algorithm. In order to show its feasibility and ease of use, we apply it to the analysis of fish-captures in Alicante. We believe that a coherent conceptual modelling framework for data-mining assures a better and easier knowledge-discovery process on top of data warehouses.
Developing a fuzzy TOPSIS approach based on subjective weights and objective weights
Authors: Tien-Chin Wang, Hsien-Da Lee
Venue: Expert Systems with Applications: An International Journal (2009)

Multiple criteria decision making (MCDM) is widely used in ranking one or more alternatives from a set of available alternatives with respect to multiple criteria. Inspired by MCDM to systematically evaluate alternatives under various criteria, we propose a new fuzzy TOPSIS for evaluating alternatives by integrating using subjective and objective weights. Most MCDM approaches consider only decision maker's subjective weights. However, the end-user attitude can be a key factor. We propose a novel approach that involves end-user into the whole decision making process. In this proposed approach, the subjective weights assigned by decision makers (DM) are normalized into a comparable scale. In addition, we also adopt end-user ratings as an objective weight based on Shannon's entropy theory. A closeness coefficient is defined to determine the ranking order of alternatives by calculating the distances to both ideal and negative-ideal solutions. A case study is performed showing how the propose method can be used for a software outsourcing problem. With our method, we provide decision makers more information to make more subtle decisions.
Note: A note on the lower bound of centralized radio broadcasting for planar reachability graphs
Authors: F. Galčík
Venue: Discrete Applied Mathematics (2009)

We consider deterministic radio broadcasting in radio networks whose nodes have full topological information about the network. We focus on radio networks having an underlying reachability graph planar. We show that there are reachability graphs such that it is impossible to complete broadcasting in less than 2.ecc(s,G) rounds, where ecc(s,G) is the eccentricity of a distinguished source s of a graph G. They provide a negative answer to the open problem stated by Manne, Wanq, and Xin in [F. Manne, S. Wanq, Q. Xin, Faster radio broadcasting in planar graphs, in: Proceedings of the 4th Annual Conference on Wireless on Demand Network Systems and Services, WONS'2007, IEEE Press, 2007, pp. 9-13] and show that it is impossible to complete the broadcasting task in D+O(1) rounds for each planar reachability graph. Particularly, we propose 3/2.D lower bound with respect to the parameter D - the diameter of a reachability graph. It is a nontrivial lower bound of time of centralized radio broadcasting in the case that an underlying reachability graph is planar. Moreover, we describe a generalized construction which can potentially improve the presented lower bound.
A proposal for extensible AspectJ
Authors: Vladimir Oliveira Di Iorio, Leonardo Vieira dos Santos Reis, Roberto da Silva Bigonha, Mariza Andrade da Silva Bigonha
Venue: Proceedings of the 4th workshop on Domain-specific aspect languages (2009)

This article presents the preliminary results achieved while working with a language to define extensions to the concrete syntax of AspectJ. The language uses the concept of syntax classes, units that extend classes with syntax definitions, building modular specifications for extensions. A syntax class can define a new construct with cross-cutting features either by translating it into pure AspectJ code or by modifying the behaviour of elements in different parts of the program, acting like an aspect weaver. The definition of new pointcut designators is also possible, with clear separation between run-time and weave-time processing. The language can be used as a tool to create domain-specific extensions to AspectJ, and domain-specific aspect languages embedded into AspectJ.
Networks in Biology --- From Identification, Analysis to Interpretation
Authors: Jesper Tegnér
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

Over the last decade networks has become a unifying language in biology. Yet we are only in the beginning of understanding their significance for biology and their medical applications. I will talk about the diversity of biological networks composed either of genes, proteins, metabolites, or cells and the associated methods for finding these graphs in the data. Next I will provide an overview of different methods of analysis and what kind of insights that have been obtained. During the talk I will highlight current challenging problems requiring computational skills with respect to identification, analysis, algorithms, visualization and software. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Towards Slovak Broadcast News Automatic Recording and Transcribing Service
Authors: Matúš Pleva, Anton Čižmár, Jozef Juhár, Stanislav Ondáš, Michal Mirilovič
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

The information is one of the most valuable commodities nowadays. The information retrieval mechanisms from broadcast news recordings is then becoming the one of the most requested services from the end-users. The planned Slovak automatic broadcast news (BN) processing service provides automatic transcribing and metadata extracting abilities, enabling users to obtain information from the processed recordings using a web interface and the search engine. The resulted information is then provided trough multimodal interface, which allows users to see not only recorded audio-visual material, but also all automatically extracted metadata (verbal and nonverbal), and also to select incorrectly automatically identified data. The architecture of the present system is linear, which means every module starts after the previous has finished the data processing.
Search-Based Automatic Web Image Annotation Using Latent Visual and Semantic Analysis
Authors: Dingyin Xia, Fei Wu, Yueting Zhuang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Automatic web image annotation is a practical and effective way for both web image retrieval and image understanding. In this paper, we proposed a search-based automatic web image annotation using latent visual and semantic analysis. At first, the semantic content of web images and visibility of the words are combined to compute the probability that the initial annotations are present in the images. And then, it is extended by using latent visual and semantic analysis to find the synonyms of initial annotations. The final rankings are estimated by using commercial image search engines by mining content-based correlation. Experiments conducted on real-world web images demonstrate the effectiveness of the proposed approach.
An architecture-centric software maintainability assessment using information theory
Authors: Muhammad Anan, Hossein Saiedian, Jungwoo Ryoo
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2009)

Architecture-based metrics can provide valuable information on whether or not one can localize the effects of modification (such as adjusting data flows or control flows) in software and can therefore be used to prevent the changes from adversely affecting other software components. This paper proposes an architecture-centric metric using entropy for assessing structural dependencies among software components. The proposed metric is based on a mathematical model representing the maintainability snapshot of a system. The introduced architectural-level metric includes measures for coupling and cohesion. From this model, the relative maintainability of a component, referred to as a maintainability profile, can be developed to identify architectural decisions that are detrimental to the maintainability of a system. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Finding Frequent Item Sets from Sparse Matrix
Authors: Xiao-Yan Zheng, Ji-Zhou Sun
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

According to the features of sparse data source while mining association rules, the paper designs a special linked-list unit and two strategies to store data in matrix. A novel algorithm, called SMM (Sparse-Matrix Mining), is proposed to find large item sets from sparse matrix. SMM maps database into a binary sparse matrix and stores compressed data into a linked-list, from which to find large item sets. It uses less I/O and computational time in mining. Experiments show that SMM finds large item sets efficiently and is well scalable.
To reinforce or to mobilize?: tracing the impact of internet use on civic engagement in Taiwan
Authors: Don-Yun Chen, Chung-Pin Lee
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Since the 1990s, Information and Communication Technologies (ICTs) have become popular instruments for delivering government services, encouraging citizen participation, and improving public trust. However, although governments around the globe have made enormous investments in e-Government initiatives, whether these efforts do indeed promote greater civic engagement is still under fierce debate between those optimistic and those pessimistic about technology's potential to change the way governments interact with the populace. This paper attempts to figure out whether the Internet can encourage civic engagement and whether its effect is "reinforcing" or "mobilizing" by analyzing Taiwanese national survey data. The findings show that ICTs appear to have a reinforcing, rather than mobilizing effect. These technologies encourage only those people who are already active in so-called real-world civic engagements to interact with their governments online. At the end of this paper, four policy recommendations are proposed, namely: (1) keeping spending resources that could engage people in ways other than technology; (2) allocating more resources to address the digital divide; (3) focusing future e-Government initiatives in Taiwan more strongly on users; and (4) including a synchronized reform in these initiatives between the online interface and offline back-office.
Providing Near Real-Time Traffic Information within Spatial Data Infrastructures
Authors: Christian Mayer, Beate Stollberg, Alexander Zipf
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Current routing or navigation applications can be improved by including up-to-date traffic information such as traffic volume, congestions, construction, and so on. In order to make such near real-time data readily available, there is still a very important need for standards and associated technologies within Spatial Data Infrastructures (SDIs). This need was addressed within the Open Geospatial Consortium (OGC) by the development of several standards within the Sensor Web Enablement (SWE) initiative. These emerging SWE standards coupled with other new specifications for Location Services (OpenLS) and the Web Processing Service (WPS) interface can help reach a new level of complexity for Geographic Information (GI) applications and thus requires new questions on architectures to be answered and best practices made available. This paper presents how we integrated near realtime traffic data into SDIs based on current standards to improve an existing routing application.
Construction of an image knowledge database on www image retrieval systems
Authors: Masami Shishibori, Kenji Kita
Venue: International Journal of Computer Applications in Technology (2009)

This paper proposes a method to construction an image knowledge database to store feedback information on WWW image retrieval systems. When the query has not yet been registered in the database, the image features of the true images selected by the user are registered in the database. On registration, the similarity of the features is considered, and only representative features are registered. On retrieval, this database is used as the supervisor data for the query, and images closer to the supervisor data are presented with priority. The experimental results using 130 queries show that an accuracy improvement of 11.6% was achieved.
QoS experiences in native IPv6 networks
Authors: Athanassios Liakopoulos, Dimitrios Kalogeras, Vasilis Maglaris, Dimitris Primpas, Christos Bouras
Venue: International Journal of Network Management (2009)

Deployment of IPv6 technology in research and commercial networks has accelerated in the last few years. Inevitably, as more advanced services take advantage of the new technology, IPv6 traffic gradually increases. Today, there is limited experience in the deployment of Quality of Service (QoS) for IPv6 traffic in backbone networks that support the Differentiated Services framework. As available software and hardware are designed to handle IPv4 packets, there is a need to accurately measure and validate performance of QoS mechanisms in an IPv6 environment. This paper discusses tests and technical challenges in the deployment of IPv6 QoS in core networks, namely the production dual stack gigabit-speed Greek Research and Education Network (GRNET) and the IPv6-only 6NET European test network, using both hardware and software platforms. In either case, we succeeded in delivering advanced transport services to IPv6 traffic and provided different performance guarantees to portions of traffic. The deployed QoS schema was common to IPv6 and IPv4; in most cases both v4 and v6 traffic exhibited comparable performance per class, while imposing no significantly different overhead on network elements. A major conclusion of our tests is that the IPv6 QoS mechanisms are efficiently supported with state-of-the-art router cards at gigabit speeds.
Gesture Control of Sound Spatialization for Live Musical Performance
Authors: Mark T. Marshall, Joseph Malloch, Marcelo M. Wanderley
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

This paper presents the development of methods for gesture control of sound spatialization. It provides a comparison of seven popular software spatialization systems from a control point of view, and examines human-factors issues relevant to gesture control. An effort is made to reconcile these two design- and parameter-spaces, and draw useful conclusions regarding likely successful mapping strategies. Lastly, examples are given using several different gesture-tracking and motion capture systems controlling various parameters of the spatialization system.
Design and Implementation of iATA on Windows CE Platform: An ATA-Based Virtual Storage System
Authors: Chee-Min Yeoh, Yu-Shu They, Hoon-Jae Lee, Hyotaek Lim
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The storage limitation in mobile appliance has become a significant problem due to the rapid growth of datacentric application. To alleviate the above problem, we developed a new block-level storage network protocol, iATA (Internet Advanced Technology Attachment) as a transport for carrying ATA block-level access protocol over the ubiquitous TCP/IP network. With iATA, mobile user is able to access their valuable data natively through the network from anywhere and at anytime as if the storage device is attached locally. In this paper, we describe concepts, design, and operations of iATA protocol. We also demonstrate the feasibility experiment by implementing iATA protocol on Windows based mobile operating platform. The result of our implementation shows that the iATA protocol is feasible to be applied on Windows CE platform device.