搜索结果
找到约 108 项符合
NUMBERS 的查询结果
按分类筛选
- 全部分类
- Java编程 (12)
- 技术资料 (10)
- 数学计算 (9)
- 数值算法/人工智能 (8)
- matlab例程 (8)
- 加密解密 (7)
- 其他 (6)
- 书籍 (5)
- 单片机编程 (4)
- 数据结构 (4)
- 汇编语言 (3)
- VHDL/FPGA/Verilog (3)
- 书籍源码 (2)
- 通信网络 (2)
- 电子书籍 (2)
- 单片机开发 (2)
- 软件设计/软件工程 (2)
- 接口技术 (1)
- 数据库系统 (1)
- 其他书籍 (1)
- 压缩解压 (1)
- 编辑器/阅读器 (1)
- *行业应用 (1)
- 多国语言处理 (1)
- CA认证 (1)
- 技术管理 (1)
- 人工智能/神经网络 (1)
- 文章/文档 (1)
- 微处理器开发 (1)
- J2ME (1)
- Delphi/CppBuilder (1)
- 家庭/个人应用 (1)
- Windows CE (1)
- VC书籍 (1)
- 其他嵌入式/单片机内容 (1)
- VIP专区 (1)
Java编程 This article describes how to consume Web services in Java 1.5.0 using the new JAX-WS 2.0 API (JSR 2
This article describes how to consume Web services in Java 1.5.0 using the new JAX-WS 2.0 API (JSR 228).
Developers around the world, including me, have always complained about the hard ways to work in Java to consume even a Web service as simple as adding two numbers.
However, with JAX-WS 2.0 A ...
其他 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 ...
单片机编程 MPC7400 Part Number Speci&THOR
MPC7400 Part Number SpeciÞcationThis document describes part number speciÞc changes to recommended operating conditions and revised electrical speciÞcations,as applicable, from those described in the generalMPC7400 Hardware SpeciÞcations.SpeciÞcations provided in this P ...
数据结构 HDOJ 1047 One of the first users of BIT s new supercomputer was Chip Diller. He extended his explor
HDOJ 1047
One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers.
``This supercomputer is great, remarked Chip. ``I only wish Timothy were here to see these results. (Chip ...
Windows CE WareSeeker periodically updates pricing and software information of Embedded Windows CE SAPI 5.0 Fre
WareSeeker periodically updates pricing and software information of Embedded Windows CE SAPI 5.0 Free Download from the publisher, so some information may be slightly out-of-date. You should confirm all information before relying on it. Software piracy is theft, Using Embedded Windows CE SAPI 5.0 Fr ...
多国语言处理 Implement a phone book system for employees of a company. Your program will output the following me
Implement a phone book system for employees of a company.
Your program will output the following menu
(1) Enter an employee and a phone pair to the system
(2) Lookup an employee s phone number
(3) Find out who is/are the person(s) of a given number
(4) How many people are currently in the system
(5) ...
数学计算 program which uses hashing techniques for storing and retrieving the data. Input to the program:
program which uses hashing techniques for storing and retrieving the data.
Input to the program: Some random numbers. Input will be from a file.
Output: First the program reads all the input and store it properly using some hash techniques.
Once your program reads the complete input,it waits for ...
书籍 Mobile+Technology+Consumption+Opportunities
The growth of mobile technologies is remarkable. At a recent Mobile World Congress Conference, Eric
Schmidt, CEO of Google predicted that within three years, smart phones will surpass Personal Com-
puter sales. The number of mobile phones used worldwide has exceeded 4.6 billion with continued
growth ...
书籍 Coordinated+Multi-Point
Mobile communication has gained significant importance in today’s society. As
of 2010, the number of mobile phone subscribers has surpassed 5 billion [ABI10],
and the global annual mobile revenue is soon expected to top $1 trillion [Inf10].
While these numbers appear promising for mobile operators ...
数据结构 2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input
2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1.
Input
One positive integer on each line, the value of n.
Output
If the minimum x exists, print a line with 2^x mod n = 1.
Print 2^? mod n = 1 otherwise.
You should replace x and n with specific numbers. ...