ppxscal/embedding_network huggingface dataset:
Next Generation of Data Mining, 1 edition
Authors: Hillol Kargupta, Jiawei Han, Philip S. Yu, Rajeev Motwani, Vipin Kumar
Venue:  (2008)

Drawn from the US National Science Foundations Symposium on Next Generation of Data Mining and Cyber-Enabled Discovery for Innovation (NGDM 07), Next Generation of Data Mining explores emerging technologies and applications in data mining as well as potential challenges faced by the field. Gathering perspectives from top experts across different disciplines, the book debates upcoming challenges and outlines computational methods. The contributors look at how ecology, astronomy, social science, medicine, finance, and more can benefit from the next generation of data mining techniques. They examine the algorithms, middleware, infrastructure, and privacy policies associated with ubiquitous, distributed, and high performance data mining. They also discuss the impact of new technologies, such as the semantic web, on data mining and provide recommendations for privacy-preserving mechanisms. The dramatic increase in the availability of massive, complex data from various sources is creating computing, storage, communication, and human-computer interaction challenges for data mining. Providing a framework to better understand these fundamental issues, this volume surveys promising approaches to data mining problems that span an array of disciplines.
Efficient valid scope computation for location-dependent spatial queries in mobile and wireless environments
Authors: Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In mobile and wireless environments, mobile clients can access information with respect to their locations by submitting Location-Dependent Spatial Queries (LDSQs) to Location-Based Service (LBS) servers. Owing to scarce wireless channel bandwidth and limited client battery life, frequent LDSQ submission from clients must be avoided. Observing that LDSQs issued from similar client positions would normally return the same results, we explore the idea of valid scope, that represents a spatial area in which a set of LDSQs will retrieve exactly the same query results. With a valid scope derived and an LDSQ result cached at the client side, a client can assert whether the new LDSQs can be answered with the maintained LDSQ result, thus eliminating the LDSQs sent to the server. As such, contention on wireless channel and client energy consumed for data transmission can be considerably reduced. In this paper, we design efficient algorithms to compute the valid scope for common types of LDSQs, including nearest neighbor queries and range queries. Through an extensive set of experiments, our proposed valid scope computation algorithms are shown to significantly outperform existing approaches.
Configurable symbol synchronizers for software-defined radio applications
Authors: Y. Tachwali, W. J. Barnes, H. Refai
Venue: Journal of Network and Computer Applications (2009)

In many synchronous receivers, symbol timing synchronization is achieved through implementation of an analog phase locked loop (PLL). A phase detector and voltage-controlled oscillator drive a reference signal to be in phase with the received training sequence. Due to the quick phase convergence this option is attractive; however, limitations in pre-packaged hardware make this approach infeasible at times. Changes in the received symbol rate in software radio applications can further complicate the hardware implementation by requiring additional control signals to alter the frequency of the reference signal. This paper examines a configurable symbol synchronizer for software-defined radio (SDR) architecture with a predefined RF front end. In this scenario, we implement a typical method for digital phase locking and make it adaptable to different data rates. A pre-synchronization step is used to provide a reasonable initial estimate for the received symbol period for lower, over-sampled data rates. This decreases the synchronization time while maintaining a constant sampling period at the ADC. It also maintains the down-conversion stage at the receiver. The paper shows the feasibility of this architecture to support wide range of symbol rates.
Clustering Time-Series Gene Expression Data with Unequal Time Intervals
Authors: Luis Rueda, Ataul Bari, Alioune Ngom
Venue: Transactions on Computational Systems Biology X (2008)

Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not possible as it would deliver quite different results, and also it would lead to erroneous biological conclusions. We have focused on issues related to clustering gene expression temporal profiles, and devised a novel algorithm for clustering gene temporal expression profile microarray data. The proposed clustering method introduces the concept of profile alignment which is achieved by minimizing the area between two aligned profiles. The overall pattern of expression in the time-series context is accomplished by applying agglomerative clustering combined with profile alignment, and finding the optimal number of clusters by means of a variant of a clustering index, which can effectively decide upon the optimal number of clusters for a given dataset. The effectiveness of the proposed approach is demonstrated on two well-known datasets, yeast and serum, and corroborated with a set of pre-clustered yeast genes, which show a very high classification accuracy of the proposed method, though it is an unsupervised scheme.
Programs = Data + Algorithms + Architecture: Consequences for Interactive Software Engineering
Authors: Stéphane Chatty
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

This article analyses the relationships between software architecture, programming languages and interactive systems. It proposes to consider that languages, like user interface tools, implement architecture styles or patterns aimed at particular stakeholders and scenarios. It lists architecture issues in interactive software that would be best resolved at the language level, in that conflicting patterns are currently proposed by languages and user interface tools, because of differences in target scenarios. Among these issues are the contra-variance of reuse and control, new scenarios of software reuse, the architecture-induced concurrency, and the multiplicity of hierarchies. The article then proposes a research agenda to address that problem, including a requirement-and scenario-oriented deconstruction of programming languages to understand which of the original requirements still hold and which are not fully adapted to interactive systems. 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
Comparison of orientation-aware RSS-based localization algorithms
Authors: Marc Lihan, Hiroaki Sawano, Takeshi Tsuchiya, Keiichi Koyanagi
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

A large number of researches have been focused on indoor location tracking system over the past years. There are theoretical and empirical RSS-based algorithms proposed and many studies have been made by comparing the performance of these algorithms. However, there is a lack of theoretical basis and understanding on the orientation of the user. This paper presents a model for an orientation-aware indoor location tracking system using wireless sensors based on IEEE 802.15.4 standard protocol. For path loss model, our experiment shows a better prediction of RSS when attenuation factors for different orientations are considered in the model. On the other hand, orientation-aware fingerprint algorithm, which currently stands as one of the most accurate RSS-based localization algorithm, is also examined in our experiment to have a basis of comparison with an empirical algorithm.
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
Authors: Johannes Oetsch, Hans Tompits
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The study of various notions of equivalence between logic programs in the area of answer-set programming (ASP) gained increasing interest in recent years. The main reason for this undertaking is that ordinary equivalence between answer-set programs fails to yield a replacement property similar to the one of classical logic. Although many refined program correspondence notions have been introduced in the ASP literature so far, most of these notions were studied for propositional programs only, which limits their practical usability as concrete programming applications require the use of variables. In this paper, we address this issue and introduce a general framework for specifying parameterised notions of program equivalence for non-ground disjunctive logic programs under the answer-set semantics. Our framework is a generalisation of a similar one defined previously for the propositional case and allows the specification of several equivalence notions extending well-known ones studied for propositional programs. We provide semantic characterisations for instances of our framework generalising uniform equivalence, and we study decidability and complexity aspects. Furthermore, we consider axiomatisations of such correspondence problems by means of polynomial translations into second-order logic.
Multimodality Issues in Conversation Analysis of Greek TV Interviews
Authors: Maria Koutsombogera, Harris Papageorgiou
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

This paper presents a study on multimodal conversation analysis of Greek TV interviews. Specifically, we examine the type of facial, hand and body gestures and their respective communicative functions in terms of feedback and turn management. Taking into account previous work on the analysis of non-verbal interaction, we describe the tools and the coding scheme employed, we discuss the distribution of the features of interest and we investigate the effect of the situational and conversational interview setting on the interactional behavior of the participants. Finally, we conclude with comments on future work and exploitation of the resulting resource.
Efficiently indexing shortest paths by exploiting symmetry in graphs
Authors: Yanghua Xiao, Wentao Wu, Jian Pei, Wei Wang, Zhenying He
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Shortest path queries (SPQ) are essential in many graph analysis and mining tasks. However, answering shortest path queries on-the-fly on large graphs is costly. To online answer shortest path queries, we may materialize and index shortest paths. However, a straightforward index of all shortest paths in a graph of N vertices takes O(N2) space. In this paper, we tackle the problem of indexing shortest paths and online answering shortest path queries. As many large real graphs are shown richly symmetric, the central idea of our approach is to use graph symmetry to reduce the index size while retaining the correctness and the efficiency of shortest path query answering. Technically, we develop a framework to index a large graph at the orbit level instead of the vertex level so that the number of breadth-first search trees materialized is reduced from O(N) to O(|&Delta;|), where |&Delta;| &le; N is the number of orbits in the graph. We explore orbit adjacency and local symmetry to obtain compact breadth-first-search trees (compact BFS-trees). An extensive empirical study using both synthetic data and real data shows that compact BFS-trees can be built efficiently and the space cost can be reduced substantially. Moreover, online shortest path query answering can be achieved using compact BFS-trees.
The Application of Multiple Regression Analysis Forecast in Economical Forecast: The Demand Forecast of Our Country Industry Lavation Machinery in the Year of 2008 and 2009
Authors: Bin Xia, Cang Zhao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The regression analysis forecast is one quantitative analysis method in the commonly used economical forecast, it is in the observation and analysis of economy development history and in the present situation foundation, according to certain way to establish the mathematical model which reflected its relation, then will calculate and forecast the change of dependent variable according to the change of independent variable in the future, thus will carry on the forecast to the trend of future economy development. This article mainly elaborates the application of multivariate linear regression analysis in the forecast to the development trend of industry lavation machinery, has established the multivariate linear regression model of the forecast to industry lavation machinery development trend. In the discussion to the model, it uses the economic demand function and refines the explanatory variable. According to the massive investigation data, it has carried on the correlated analysis, the regression analysis and the statistical test using the SPSS statistics software. Finally, it utilizes the multivariate linear regression forecast model which is established in this article to carry on the demand forecast to our country industry lavation mechanical profession in the year of 2008 and 2009.
Worst Case Analysis for Pickup and Delivery Problems with Transfer
Authors: Yoshitaka Nakao, Hiroshi Nagamochi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The pickup and delivery problem (PDP) asks to find a set of vehicles that serve a given set of requests with the minimum travel cost, where each request consists of a pickup point, a delivery point and a load (the quantity to be delivered from the pickup point to the delivery point). In the pickup and delivery problem with transfer (PDPT), for each request, its load picked up at the pickup point is allowed to be dropped at a transshipment point before it is picked up again and delivered to the delivery point by another vehicle. This paper analyzes the maximum travel cost that can be saved by introducing a transshipment point to the pickup and delivery problem (PDP). We show that the bounds are in proportion to square root of the number of cycles in an optimal PDPT solution and also square root of the number of requests. We furthermore present an instance that the bound is the tight for a special case.
What's "this" you say?: the use of local references on distant displays
Authors: Patti Bao, Darren Gergle
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

This study explores how the design of visual display configurations relates to linguistic expressions. Twenty-five participants performed a series of object identification and narrative Description tasks on either a large wall-sized or small desktop display. Results revealed that during the Description tasks, large display users produced significantly greater rates of local deictic references than small display users, but in the identification tasks, the rates were similar for both large and small display users. Implications for the design of interactive technologies are discussed.
Approximate Sorting
Authors: Joachim Giesen, Eva Schuberth, Miloš Stojaković
Venue: Fundamenta Informaticae (2009)

We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n$^{2}$/&nu;(n) needs at least n (min{log &nu;(n), log n} &minus; 6) comparisons in the worst case. This bound is tight up to a constant factor since there exists a deterministic algorithm that shows that 6n log *(n) comparisons are always sufficient.
The Forecast of Power Demand Cycle Turning Points Based on ARMA
Authors: ShuXia Yang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

To make decision for power industry development, it is important to known changes of power demand cycle. Firstly ARMA model and its modeling process of time series were introduced, then according to autocorrelation and partial-autocorrelation coefficients of power demand growth rate from year 1980 to year 2005,AR (2) model was chosen to fit the time series of power demand in China. The maximum likelihood method was used to estimate the value of model parameter, the model and parameters were tested by significance test, and the fitting accuracy was analyzed by errors between actual and forecasting value. At last the growth rate of power demand and year 2006-2020 power demand cycle turning points in China were forecasted. The error average of the growth rate of power demand in China between actual and forecasting value is 0.1417, and the mean absolute error of the forecasting is 1.6253, the mean absolute error rate is 23.5%, year 2008 and year 2012 are power demand cycle turning points. The results show that it is a better method using ARMA model to forecast power demand cycle turning points, fitting model is remarkable, the method is reliable, the forecasting precision is high.
Sharing Online Advertising Revenue with Consumers
Authors: Yiling Chen, Arpita Ghosh, Randolph Preston Mcafee, David Pennock
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Online service providers generate much of their revenue by monetizing user attention through online advertising. In this paper, we investigate revenue sharing, where the user is rewarded with a portion of the surplus generated from the advertising transaction, in a cost-per-conversion advertising system. While revenue sharing can potentially lead to an increased user base, and correspondingly larger revenues in the long-term, we are interested in the effect of cashback in the short-term, in particular for a single auction. We capture the effect of cashback on the auction's outcome via price-dependent conversion probabilities, derived from a model of rational user behavior: this trades off the direct loss in per-conversion revenue against an increase in conversion rate. We analyze equilibrium behavior under two natural schemes for specifying cashback: as a fraction of the search engine's revenue per conversion, and as a fraction of the posted item price. This leads to some interesting conclusions: first, while there is an equivalence between the search engine and the advertiser providing the cashback specified as a fraction of search engine profit, this equivalence no longer holds when cashback is specified as a fraction of item price. Second, cashback can indeed lead to short-term increase in search engine revenue; however this depends strongly on the scheme used for implementing cashback as a function of the input. Specifically, given a particular set of input values (user parameters and advertiser posted prices), one scheme can lead to an increase in revenue for the search engine, while the others may not. Thus, an accurate model of the marketplace and the target user population is essential for implementing cashback.
Mobility-Aware RSVP: A framework for improving the performance of multimedia services over wireless IP-based mobile networks
Authors: Ahmad Belhoul, Y. Ahmet Şekercioğlu, Nallasamy Mani
Venue: Computer Communications (2009)

This paper proposes the Mobility-Aware Resource Reservation Protocol (MARSVP) in which mobility and QoS signaling are performed as a single functional block. The key concept of MARSVP is to convey mobility-specific information (binding updates and their associated acknowledgments) by using newly defined RSVP objects embedded in existing RSVP messages. An appealing feature of MARSVP is that it adheres to the current RSVP standard (RFC 2205) and thus requires minimal changes to end nodes without affecting any of the conventional RSVP routers in between. The proposed mechanism is evaluated using a simulation model for application-level performance and an analytical model for network-level signaling cost. Simulation results indicate a 27.9% improvement in QoS interruption when using Mobile IPv6 (MIPv6), 12.5% when using Hierarchical Mobile IPv6 (HMIPv6), and no improvement when using Fast Handovers for MIPv6 (FMIPv6). On the network-level, signaling cost savings of 9.4% and 11.9% are achieved for MIPv6 and HMIPv6, respectively, while FMIPv6 achieves savings of 17.9% when using Voice-over-IP traffic and 26.7% for Video-over-IP traffic. The results of the conducted studies indicate MARSVP's superiority to conventional RSVP when deployed over wireless networks.
Example-Based Regularization Deployed to Face Hallucination
Authors: Hong Zhao, Yao Lu, Zhengang Zhai, Gang Yang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Regularization plays a vital role in ill-posed problems. A properly chosen regularization can direct the solution toward a better quality outcome. An emerging powerful regularization is one that leans on image examples. In this paper, we propose a novel scheme for face hallucination. We target specially the quality of highly zoomed outputs. Our work bases on the pyramid framework and assigns several high-quality candidate patches for each location in the degraded image. We definite a global MAP penalty function to reject all the problematic examples, and then reconstruct the desired image using the patch which is left after pruning. Experimental results demonstrate that our approach can get better resolution.
A SIP Application Router for Presence-Driven Composition of IMS Services
Authors: Juan Miguel Espinosa Carlín, Dirk Thissen
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Due to the current needs of the mobile telecommunications market to deliver tailored experiences to its users, IMS operators must be able to manage the interoperability and cooperation between the deployed services, in order to provide a high level of customization to their subscribers. With this goal in mind, this paper presents the Presence Application Router (Presence AR), based on the Default AR (DAR) concept introduced in the Java SIP Servlet API v1.1. The Presence AR allows runtime changes in the precedence relationships and application subscriptions that build the composition chains, based on the Presence information of the users involved in the session.