虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

Rele<b>AS</b>e

  • This document provides guidelines and describes how to easily port S60 2nd Edition C++ application

    This document provides guidelines and describes how to easily port S60 2nd Edition C++ applications to S60 3rd Edition. The document has been written based on experiences of porting regular S60 2nd Edition applications, such as the S60 Platform: POP/IMAP Example [4] that can be downloaded from Forum Nokia. Code snippets from the example are shown in Chapter 8, “Application build changes,” and in Appendix A, “Code example." In addition, Appendix B, "Commonly used functions that require capabilities," and Appendix C, "Commonly used interfaces that have been changed or removed," provide useful information on some frequently used functions and interfaces in third-party applications.

    标签: application guidelines describes document

    上传时间: 2017-01-29

    上传用户:wang5829

  • 报时小闹钟 本程序是一个用汇编编的精致的图形时钟

    报时小闹钟 本程序是一个用汇编编的精致的图形时钟,运行时双击clock图标即可, 钟表显示的时间为本机系统的时间。   按b键可扩大画面 ;按s键可缩小画面;按c键可改变颜色;按e键可听音乐; 按q键退出本程序.

    标签: 闹钟 程序 汇编 图形

    上传时间: 2013-12-20

    上传用户:lyy1234

  • .NET平台下专题地图实现的C#代码 private void 点密度图ToolStripMenuItem_Click(object sender, EventArgs e) {

    .NET平台下专题地图实现的C#代码 private void 点密度图ToolStripMenuItem_Click(object sender, EventArgs e) { //获取当前图层 ,并把它设置成IGeoFeatureLayer的实例 IMap pMap = axMapControl1.Map ILayer pLayer = pMap.get_Layer(0) as IFeatureLayer IFeatureLayer pFeatureLayer = pLayer as IFeatureLayer IGeoFeatureLayer pGeoFeatureLayer = pLayer as IGeoFeatureLayer //获取图层上的feature IFeatureClass pFeatureClass = pFeatureLayer.FeatureClass IFeatureCursor pFeatureCursor = pFeatureClass.Search(null, false) IFeature pFeature = pFeatureCursor.NextFeature()

    标签: ToolStripMenuItem_Click EventArgs private object

    上传时间: 2013-11-27

    上传用户:xlcky

  • 加密的步骤 1) 计算N的有效位数tn(以字节数计)

    加密的步骤 1) 计算N的有效位数tn(以字节数计),将最高位的零忽略掉,令tn1=tn-1。比如N=0x012A05,其有效位数tn=5,tn1=4。 2) 将明文数据A分割成tn1位(以字节数计)的块,每块看成一个大数,块数记为bn。从而,保证了每块都小于N。 3) 对A的每一块Ai进行Bi=Ai^E MOD N运算。Bi就是密文数据的一块,将所有密文块合并起来,就得到了密文数据B。

    标签: 加密 计算 字节

    上传时间: 2014-12-05

    上传用户:caozhizhi

  • tensor   向量的推广。在一个坐标系下

    tensor   向量的推广。在一个坐标系下,由若干个数(称为分量)来表示,而在不同坐标系下的分量之间应满足一定的变换规则,如矩阵、多变量线性形式等。一些物理量如弹性体的应力、应变以及运动物体的能量动量等都需用张量来表示。在微分几何的发展中,C.F.高斯、B.黎曼、E.B.克里斯托费尔等人在19世纪就导入了张量的概念,随后由G.里奇及其学生T.列维齐维塔发展成张量分析,A.爱因斯坦在其广义相对论中广泛地利用了张量。

    标签: tensor 向量 坐标系

    上传时间: 2014-01-20

    上传用户:silenthink

  • 复接入

    复接入,B/W双用户使用直接扩频序列 % >>>multiple access b/w 2 users using DS CDMA % >>>format is : cdmamodem(user1,user2,snr_in_dbs) % >>>user1 and user2 are vectors and they should be of equal length % >>>e.g. user1=[1 0 1 0 1 0 1] , user2=[1 1 0 0 0 1 1],snr_in_dbs=-50 % >>>or snr_in_dbs=50 just any number wud do % Waqas Mansoor % NUST , Pakistan

    标签:

    上传时间: 2014-11-22

    上传用户:zl5712176

  • We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder f

    We analyze, both analytically and numerically, the effectiveness of cloaking an infinite cylinder from observations by electromagnetic waves in three dimensions. We show that, as truncated approximations of the ideal permittivity and permeability tensors tend towards the singular ideal cloaking fields, so that the anisotropy ratio tends to infinity, the D and B fields blow up near the cloaking surface. Since the metamaterials used to implement cloaking are based on effective medium theory, the resulting large variation in D and B will pose a challenge to the suitability of the field averaged characterization of " and 碌. We also consider cloaking with and without the SHS (softand- hard surface) lining, shown in [6] to be theoretically necessary for cloaking in the cylindrical geometry. We demonstrate numerically that cloaking is significantly improved by the SHS lining, with both the far field of the scattered wave significantly reduced and the blow up of D and B prevented.

    标签: effectiveness analytically numerically cloaking

    上传时间: 2017-03-30

    上传用户:zxc23456789

  • Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a

    Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.

    标签: Multiplicative undirected Shortest measured

    上传时间: 2017-04-08

    上传用户:邶刖

  • 为 了提高用户身份认证和授权管理的灵活性

    为 了提高用户身份认证和授权管理的灵活性,从We b 应用系统的安全性角度出发,讨论了 一 种在. N E T F r a me w o r k下保证应用程序安全性的身份验证和授权模型,并给出了模型的具体实现方法。 该模型利用 F o r ms身份验证方法对用户的身份进行鉴别。在授权处理上,模型结合统一资源定位( u . J f o r m R e s o u r c e L o c a t o r , U R L ) 授权模式和用户所具有的系统角色,分别从页面级和页面操作级对用户的访问进行 控制。该模型在企业局域网环境内能够提供比较灵活的身份认证和基于角色的授权服务。实际应用表明, 基于该模型的We b应用系统能够对用户的访问进行有效的控制,从而保证了系统的安全性

    标签: 用户 授权 身份认证

    上传时间: 2013-12-31

    上传用户:VRMMO

  • A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is

    A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.

    标签: polygon S. the contains

    上传时间: 2013-12-23

    上传用户:it男一枚