登录
首页 » PDF » map-based-mobile-services-theories-methods-and-im

map-based-mobile-services-theories-methods-and-im

于 2010-08-16 发布 文件大小:4069KB
0 260
下载积分: 1 下载次数: 2

代码说明:

  The book is divided into three parts: theory, method and implementation. Starting with a summary of the state-of-the-art in mobile technologies, the first part analyses their impacts on cartography and pinpoints the missing theories concerned with the development of map-based mobile services. A conceptual framework of mobile cartography is then introduced with the emphasis on mobile usage context. The second part is devoted to the design methodology under the constraints defined in the theoretical framework. A core issue deals with personalised mobile map services. The final part demonstrates the feasibility of the methods by using application scenarios.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • nan_wang_dan_xiang
    南网单相表招标技术规范 南网单相表招标技术规范(South Network tender technical specifications of single-phase form)
    2009-12-28 11:41:48下载
    积分:1
  • noisble-nikai.tar
    rare aac encoder developed by japanees guy
    2010-12-21 21:07:57下载
    积分:1
  • Matlab_zuixiaofeiyong
    最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:55:22下载
    积分:1
  • pegasis_bo
    该协议是LEACH的改进,思想是:为了延长网络的生命周期,节点只需要和她们最近的邻居之间进行通信。节点与汇聚点间的通信过程是轮流进行的,当所有节点都与汇聚点通信后,节点间再进行新一回合的轮流进行的。由于这种轮流通信机制使得能量消耗能够统一的分布到每个节点上,因此降低了整个传输所需要消耗的能量。(The agreement is LEACH improvement idea is: To prolong the network lifetime, and between nodes only need to communicate with their nearest neighbors. Communication process between the node and the focal point is in turn carried out when all the nodes are associated with the convergence point communication between nodes then turns a new round of. Due to this rotation so that the energy consumption of the communication system on each node to the uniform distribution, thus reducing the energy consumption required for the transmission.)
    2014-05-05 13:48:39下载
    积分:1
  • pca_2d
    MATLAB自已编的二维DLA,基于ORL人脸数据库,效果不错。(MATLAB own series of two-dimensional DLA, based on the ORL face database, good results.)
    2008-06-19 09:41:08下载
    积分:1
  • tut1
    signals and systems basics
    2011-02-04 23:34:35下载
    积分:1
  • 因子分析
    调用factoran函数根据相关系数矩阵作因子分析(Factor analysis based on correlation coefficient matrix by calling factoran function)
    2021-03-18 20:29:20下载
    积分:1
  • shipinxinhaofenbu
    利用matlab对信号进行时频分析,信号重排处理,不妨看一看(using Matlab to signal time-frequency analysis, signal processing rearrangement, we might look at the)
    2007-06-26 11:24:43下载
    积分:1
  • TwoLinkManipulator
    code of two link manipulator,it is for forward kinematics
    2013-05-20 17:23:12下载
    积分:1
  • chap10
    这是有关MATLAB学习的一些编程技巧和使用的一个程序示例(MATLAB STUDY)
    2009-05-10 09:09:01下载
    积分:1
  • 696516资源总数
  • 106627会员总数
  • 16今日下载