检索结果-内蒙古大学图书馆

Infrastructure-Free Floor Localization Through Crowdsourcing

Journal of computer science & technology 2015年第6期30卷 1249-1273页

作者：叶海波顾涛陶先平吕建 State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210023 China Department of Computer Science Nanjing University Nanjing 210023 China School of Computer Science and Information Technology RMIT University Melbourne Victoria 3001 Australia

Mobile phone localization plays a key role in the fast-growing location-based applications domain. Most of the existing localization schemes rely on infrastructure support such as GSM, Wi-Fi or GPS. In this paper, we present FTrack, a novel floor localization system to identify the floor level in a multi-floor building on which a mobile user is located. FTrack uses the mobile phone＇s sensors only without any infrastructure support. It does not require any prior knowledge of the building such as floor height or floor levels. Through crowdsourcing, FTrack builds a mapping table which contains the magnetic field signature of users taking the elevator/escalator or walking on the stairs between any two floors. The table can then be used for mobile users to pinpoint their current floor levels. We conduct both simulation and field studies to demonstrate the eiTiciency, scalability and robustness of FTrack. Our field trial shows that FTrack achieves an accuracy of over 96% in three different buildings.

关键词： mobile phone localization floor localization crowdsourcing mobile phone sensing

来源：评论

学校读者我要写书评

暂无评论

Optimal stochastic strongly convex optimization with a logarithmic number of projections 32

Optimal stochastic strongly convex optimization with a logar...

引用

32nd Conference on Uncertainty in Artificial Intelligence 2016, UAI 2016

作者： Chen, Jianhui Yang, Tianbao Lin, Qihang Zhang, Lijun Chang, Yi Yahoo Research SunnyvaleCA94089 United States Department of Computer Science University of Iowa Iowa CityIA52242 United States Department of Management Sciences University of Iowa Iowa CityIA52242 United States Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

ISBN: (纸本)9781510827806

We consider stochastic strongly convex optimization with a complex inequality constraint. This complex inequality constraint may lead to computationally expensive projections in algorithmic iterations of the stochastic gradient descent (SGD) methods. To reduce the computation costs pertaining to the projections, we propose an Epoch-Projection Stochastic Gradient Descent (Epro-SGD) method. The proposed Epro-SGD method consists of a sequence of epochs;it applies SGD to an augmented objective function at each iteration within the epoch, and then performs a projection at the end of each epoch. Given a strongly convex optimization and for a total number of T iterations, Epro-SGD requires only log(T) projections, and meanwhile attains an optimal convergence rate of O(1/T ), both in expectation and with a high probability. To exploit the structure of the optimization problem, we propose a proximal variant of Epro-SGD, namely Epro-ORDA, based on the optimal regularized dual averaging method. We apply the proposed methods on real-world applications;the empirical results demonstrate the effectiveness of our methods.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Snapshot KNN Join Processing for Large Data Using MapReduce

Efficient Snapshot KNN Join Processing for Large Data Using ...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yupeng Hu Chong Yang Cun Ji Yang Xu Xueqing Li State Key Lab. for Novel Software Technology Nanjing University P.R. China School of Computer Science and Technology Shandong University P.R. China

ISBN: (纸本)9781509053827

The kNN join problem, denoted by R × KNN S, is to find the k nearest neighbors from a given dataset S for each point in the query set R. It is an operation required by many big data applications. As large volume of data are continuously generated in more and more real-life cases, we address the problem of monitoring kNN join results on data streams. Specifically, we are concerned with answering kNN join periodically at each snapshot which is called snapshot kNN join. Existing kNN join solutions mainly solve the problem on static datasets, or on a single centralized machine, which are difficult to scale to large data on data streams. In this paper, we propose to incrementally calculate the kNN join results of time t i from the results of snapshot t i-1 . Typically, for the data continuously generated on the data stream, we can get S i = S i-1 + ΔS i for the valid datasets of adjacent snapshots, where ΔS i denotes the updated points between time t i-1 and t i . Our basic idea is to first find the queries in R whose kNN results can be affected by the updated points in ΔS i , and then update the kNN results of these small part of queries respectively. In this way, we can avoid calculating the kNN join results on the whole dataset S i in time t i . We propose an implementation of searching for affected query points in MapReduce to scale to large volume of data. In brief, the mappers partition the datasets into groups, and the reducers search for affected queries separately on each group of points. Furthermore, we present the enhanced strategies of data partitioning and grouping to reduce the shuffling cost and computational cost. Extensive experiments on real-world datasets demonstrate that proposed methods are efficient, robust, and scalable.

关键词： Measurement Distributed databases Computational efficiency Robustness Servers Indexes Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Tactile Sequence Based Object Categorization: A Bag of Features Modeled by Linear Dynamic System with Symmetric Transition Matrix

Tactile Sequence Based Object Categorization: A Bag of Featu...

引用

International Joint Conference on Neural Networks

作者： Haolin Yang Fuchun Sun Wenbing Huang Lele Cao Bin Fang State Key Lab. of Intelligent Technology and Systems Tsinghua National Lab. for Information Science and Technology Department of Computer Science and Technology Tsinghua University

ISBN: (纸本)9781509006212

In this paper, we propose a novel categorization framework to recognize tactile sequences based on two particular properties of the tactile data. For the first one, tactile sequences are spatio-temporal data which is sequential and dynamic, depicting the process of grasping an object in different grasping stages;therefore, it is reasonable to discover the dynamical pattern by modeling tactile data as integral sequences rather than individual frames. For the second one, a tactile sequence contains various dynamical patterns in different stages of the grasping process;therefore, we decompose the whole sequence into multiple mini-sequences so as to enhance feature resolution. To address both properties in our framework, we take advantage of a Bag-of-System model using parameters of the Linear Dynamic System (LDS) as feature descriptors. Moreover, we employ the LDS with Symmetric Transition matrix (LDSST) rather than the original LDS as the building-block in order to obtain accurate codewords of the codebook of the Bag-of-System. The performance of our framework is evaluated on six real-world databases of three groups. Our experiments show that classification using LDSST is better than the original LDS, and the decomposition of tactile sequences does improve the accuracy of classification. The experiment results also show the superiority of our framework in comparison with other state-of-the-art sequence classifiers.

关键词： S matrix Local Digital Switch Touch Frameworks Building blocks Dynamic systems Grasp codebook

来源：评论

学校读者我要写书评

暂无评论

Fourier Coefficients for Fraud Handwritten Document Classification through Age Analysis

Fourier Coefficients for Fraud Handwritten Document Classifi...

引用

International Workshop on Frontiers in Handwriting Recognition

作者： K.S. Raghunandan Palaiahnakote Shivakumara B.J. Navya G. Pooja Navya Prakash G. Hemantha Kumar Umapada Pal Tong Lu Department of Studies in Computer Science University of Mysore Karnataka India Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India National Key Lab for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9781509009824

As new digital technologies emerge to improve living style, at the same time, it also lead to increase crimes. Unlike existing approaches that use content of handwriting for fraud/forged document identification, in this paper we propose a novel approach that explores the quality of handwritten documents by considering both foreground and background information to identify whether it is old or new. The proposed approach works based on the fact that if a fraud document is created with some gaps after the original one, the fraud document happened to be a new one and the original happened to be an old one in this work. To identify whether a given handwritten document is old or new with gaps, we propose to divide Fourier coefficients of the input image into positive and negative coefficient images, and then reconstruct respective images to conquer two reconstructed ones. The contrast of the reconstructed images obtained before and after divide-conquer is studied to analyze the ages of the document based on image quality. The proposed approach finds a unique relationship between reconstructed images, obtained before and after divide-conquer, to identify the input image as old or new. To evaluate the proposed approach, we conduct experiments on our own handwritten dataset and a standard database, namely, Google-LIFE magazine. Comparative studies with the existing approaches show that the proposed approach outperforms the existing approaches in terms of classification rate.

关键词： Image reconstruction Image edge detection Ink Printers Forgery Distortion Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Looking for an MR? Try METWiki Today

Looking for an MR? Try METWiki Today

引用

IEEE/ACM International Workshop on Metamorphic Testing (MET)

作者： Xiaoyuan Xie Jiahao Li Chen Wang Tsong Yueh Chen State Key Lab of Software Engineering Computer School Wuhan University China Department of Computer Science and Software Engineering Swinburne University of Technology Australia

ISBN: (纸本)9781509001309

Metamorphic Testing (MT) has been demonstrated to successfully alleviate oracle problems in many areas, including machine learning, compilers, bioinformatics, etc. However, given a new MT task, it is still very challenging to identify enough Metamorphic Relations (MRs) which are key components of MT. Aiming at this problem, we revisited previous MT applications and realized that they could form a very valuable database. Currently there is a lack of efficient link to get testers access these historical data. Therefore, in this paper, we propose to build METWiki, an MR repository, for collection and retrieval of these MRs. By providing exploration and search facilities, testers can find their desired MRs for reuse, reference, or inference. We also illustrate three sample usages of METWiki, which show important illuminations on how MRs can be obtained in practice.

关键词： Testing software Data mining Mathematics software engineering Bioinformatics Libraries

来源：评论

学校读者我要写书评

暂无评论

Simulation of feedforward-feedback control of Dissolved Oxygen (DO) of microbial repeated fed-batch culture

引用

International Journal of Simulation: Systems, science and technology 2016年第14期17卷 4.1-4.6页

作者： Gao, Ling Lin, Huibin Shandong Provincial Key Lab for Distributed Computer Software Novel Technology School of Information Science and Engineering Shandong Normal University Jinan China Shandong Academy of Chinese Medicine Jinan China

Fed-batch culture is often used in industry, and dissolved oxygen (DO) concentration control is important in fermentation process control. DO control is often applied by using feedback (FB) control strategy. But, feedforward-feedback (FF-FB) control has the advantage in dealing with the time-varying characteristics resulting from cell growth during the fermentation process. Mathematical modeling and computer simulation is a useful tool in the analysis of the control system. In this paper, we model and simulate the FF-FB DO control and FB substrate control of repeated fed-batch culture process. The results show the feasibility of the control strategy and are useful for control system development and process analyses and optimization. © 2016, UK Simulation Society. All rights reserved.

关键词： Dissolved oxygen

来源：评论

学校读者我要写书评

暂无评论

A sample weighted sparse representation approach to image classification

引用

ICIC Express Letters, Part B: Applications 2016年第11期7卷 2283-2290页

作者： Wang, Yongxin Zhang, Huaxiang Department of Computer Science Shandong Normal University China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology No. 88 Wenhua East Road Lixia District Jinan250014 China

Sparse representation for classification (SRC) has achieved a big success for face recognition. It utilizes a sparsely linear combination of the training samples to construct a test sample, and classifies the test sample based on the reconstruction error associated with each class. Since SRC weights each training sample equally important, which may not hold for real applications, we propose a novel sample weighted sparse representation classification approach (SWSRC) by weighting each training sample differently. We first employ the representation ability of each training sample to construct a weight matrix and then solve a weighted l1minimization problem to obtain the sparse reconstruction coefficients. Experimental results on AR, YaleB and USPS image datasets demonstrate its effectiveness. © 2016 ICIC International.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

A heuristic scheduling algorithm based on PSO in the cloud computing environment

引用

International Journal of Future Generation Communication and Networking 2016年第1期9卷 349-362页

作者： Xue, Shengjun Shi, Wenling Xu, Xiaolong School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

In the face of a large number of task requests submitted by users, the data center in the cloud need not only to finish these massive tasks but also to satisfy the user's service demand. How to dividethe resources of the system reasonably and schedule these tasks efficiently isa problem that need be solved in the cloud computing. The task scheduling of workflow is a kind of scheduling model for the most partresearched in cloud computing. The scheduling goal is alwaysdecided by user's QoS(Quality of Service)and the scheduling goal of existing scheduling algorithm is alwayssingle. Based on the price model a scheduling algorithm is proposed which can realize the multiple targets in this article, and the scheduling algorithm is Service Cost Optimizationbased on Particle Swarm Optimization(PSO-SC).PSO-SC algorithm can adapt to dynamic cloud environment, and it not only shortens the completion time of tasks but also minimizesuser's cost of task when schedule tasks. In this paper, experiment and analyze the task scheduling of workflow under the cloud computing environment, and the experimental results show that the algorithm proposed in this paper has very good scheduling performance and can reachthe goal of task scheduling of tasks. © 2016 SERSC.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Service-Oriented Resource Allocation in Clouds： Pursuing Flexibility and Efficiency

引用

Journal of computer science & technology 2015年第2期30卷 421-436页

作者：张胜钱柱中吴杰陆桑璐 State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210023 China Department of Computer Science and Technology Nanjing University Nanjing 210023 China Department of Computer and Information Sciences Temple University Philadelphia PA 19122 U.S.A

The networking-oblivious resource reservation model in today＇s public clouds cannot guarantee the performance of tenants＇ applications. Virtual networks that capture both computing and networking resource requirements of tenants have been proposed as better interfaces between cloud providers and tenants. In this paper, we propose a novel virtual network model that could specify not only absolute and relative location requirements but also time-varying resource demands. Building on top of our model, we study how to efficiently and flexibly place multiple virtual networks in a cloud, and we propose two algorithms, MIPA and SAPA, which focus on optimizing resource utilization and providing flexible placement, respectively. The mixed integer programming based MIPA transforms the placement problem into the multi-commodity flow problem through augmenting the physical network with shadow nodes and links. The simulated annealing-based SAPA achieves resource utilization efficiency through opportunistically sharing physical resources among multiple resource demands. Besides, SAPA allows cloud providers to control the trade-offs between performance guarantee and resource utilization, and between allocation optimality and running time, and allows tenants to control the trade-off between application performance and placement cost. Extensive simulation results confirm the efficiency of MIPA in resource utilization and the flexibility of SAPA in controlling trade-offs.

关键词： resource allocation virtual network embedding opportunistic resource sharing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：