Location:
Search - N-body M
Search list
Description: 基于linux的n-body编程，利用mpi进行并行计算-Linux based on the n-body programming, the use of parallel computing mpi
Platform: |
Size: 174080 |
Author: 求是赤子 |
Hits:
Description: 质数存储体程序，n*n的二维数组，采用m个存储体实现无冲突访问-Prime number stored in body procedures, n* n the two-dimensional array, with m a memory bank conflict-free access
Platform: |
Size: 80896 |
Author: liuliu |
Hits:
Description: 熟悉Windows编程环境：
⑴ 编写一个Windows界面汇编程序，显示一个消息框，含标题与正文，要求标题是自己的姓名，正文是自己的学号。
⑵ 编写Windows 32位控制台程序，计算result=m*(n –x)的值。要求提示用户输入32位带符号整数m, n, x，并显示计算结果。
-Familiar Windows programming environment: ⑴ assembler to write a Windows interface that displays a message box with the title and body text, the title is requested their names, the text is their student ID. ⑵ write Windows 32-bit console program that calculates result = m* (n-x) value. Requires prompt the user to enter a 32-bit signed integer m, n, x, and displays the results.
Platform: |
Size: 686080 |
Author: |
Hits:
Description: Image Encryption based on the RGB PIXEL Transposition and Shuffling
Abstract — Privacy is one of the key issues information Security addresses. Through encryption one can prevent a third party from understanding raw data during signal transmission. The encryption methods for enhancing the security of digital contents has gained high significance in the current era of breach of security and misuse of the confidential information intercepted and misused by the unauthorized parties.
This paper sets out to contribute to the general body of knowledge in the area of cryptography application and by developing a cipher algorithm for image encryption of m*n size by shuffling the RGB pixel values. The algorithm ultimately makes it possible for encryption and decryption of the images based on the RGB pixel. The algorithm was implemented using MATLAB.
Index Terms — Cryptography, Encryption, algorithm, cipher image
Platform: |
Size: 2532352 |
Author: UTKARSH SHARMA |
Hits:
Description: acm题，纪念邮票邮局最近推出了一套纪念邮票，这套邮票共有N张，邮票面值各不相同，按编号顺序为1分，2分，……，N分。小明是个集邮爱好者，他很喜欢这套邮票，可惜现在他身上只有M分，并不够把全套都买下。他希望尽量买，最好刚好花光所有的钱。作为一个集邮爱好者，小明也不想买的邮票编号断断续续，所以小明打算买面值a分至b分的b-a+1张连续的邮票，且总价值刚好为M分。 我们用不同的算法求出所有符合要求的方案，以[a，b]的形式输出。-acm questions, post office recently launched a commemorative set of commemorative stamps, stamps are a total of N sheets, stamps face value varies in numerical order of 1 minute, 2 minutes, ......, N points. Xiao Ming is a stamp collector, he was very fond of the stamps, but now his body is only M points, and not enough to have bought a full set. He hoped that try to buy the best just spend all the money. As a philatelists, Xiao Ming not want to buy stamps numbers off, so Xiao Ming intend to buy a par value b min b-a+1 continuous sheets of stamps, and the total value of M points exactly. We use different algorithms to obtain all eligible programs to [a, b] in the form of output.
Platform: |
Size: 944128 |
Author: lai |
Hits: