登录
首页 » 电子书 » J2ME in a Nutshell

J2ME in a Nutshell

于 2022-01-23 发布 文件大小:5.23 MB
0 182
下载积分: 2 下载次数: 1

代码说明:

J2ME in a Nutshell -J2ME in a Nutshell ......

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

发表评论

0 个回复

  • Wireless network applications to learn the books focus on practical application...
    学习无线网络应用的书籍着重实际操作适用初学者-Wireless network applications to learn the books focus on practical application of beginners
    2023-08-01 12:20:04下载
    积分:1
  • 最主要就是将c语言实现的各种算法,对要深入研究的很有帮助...
    最主要就是将c语言实现的各种算法,对要深入研究的很有帮助-The most important is to achieve a variety of c language algorithm, to in-depth study of the helpful
    2022-01-31 08:36:53下载
    积分:1
  • VC++MFC扩展编程实例源码
    VC++MFC扩展编程实例源码-VC MFC extension programming examples FOSS
    2022-07-02 08:16:43下载
    积分:1
  • 卫星通信工程(英文)卫星通信工程…
    卫星通信工程(英语)卫星通信工程(英语)卫星通信工程(英语)卫星通信工程(英语)
    2022-03-04 09:56:18下载
    积分:1
  • 籍包括所有无线通信系统中的数学模型,内容丰富。
    本书籍包括所有无线通信系统中的数学模型,内容丰富。-environmenet of wireless communication
    2022-06-12 11:35:59下载
    积分:1
  • 让3G手机显示MPEG
    让3G手机显示MPEG-4视频信息的ACM解决方案-for 3G mobile phone display MPEG-4 video information ACM solution
    2022-05-07 21:03:48下载
    积分:1
  • LDAP的入门籍,并详细讲解了如何使用openldap实现LDAP功能。
    LDAP的入门书籍,并详细讲解了如何使用openldap实现LDAP功能。-LDAP entry books, and explain in detail how to use LDAP feature openldap realize.
    2022-08-20 05:00:40下载
    积分:1
  • 图论中最小生成树Kruskal算法 及画图程序 M
    图论中最小生成树Kruskal算法 及画图程序 M-函数 格式 [Wt,Pp]=mintreek(n,W):n为图顶点数,W为图的带权邻接矩阵,不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图 例如 n=6 w=inf*ones(6) w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3] w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6 [a,b]=mintreek(n,w) -Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]
    2022-01-30 21:32:39下载
    积分:1
  • Real
    Real-Time Digtal Signal Processing, Implementations, Applications, and Experiments with the Tms320C55X 本书主要介绍了数字信号处理理论,以及在数字信号处理平台的实现。-Real-Time Digtal Signal Processing, Implementations, Applications, and Experiments with the Tms320C55X This book introduces the theory of digital signal processing, as well as the realization of digital signal processing platform.
    2022-04-01 11:01:06下载
    积分:1
  • 华为HCNE
    华为HCNE-网络工程师培训教程,适合考试和学习使用。-Huawei HCNE-Network Engineer Training Guide
    2022-08-12 16:04:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载