Sequential random integer generator
| Main Author: | CPC, Mendeley |
|---|---|
| Other Authors: | Kuo, C.T.K., Cadman, T.W., Arsenault, R.J. |
| Format: | Dataset |
| Terbitan: |
Mendeley
, 1976
|
| Subjects: | |
| Online Access: |
https:/data.mendeley.com/datasets/xwcgrnbm22 |
| ctrlnum |
0.17632-xwcgrnbm22.1 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc><creator>CPC, Mendeley</creator><title>Sequential random integer generator </title><publisher>Mendeley</publisher><description>Title of program: SRNG
Catalogue Id: ACIE_v1_0
Nature of problem
An algorithm to generate a subset of random integers from a larger set of integers has been developed to minimize both the computing time and the memory space. The algorithm deals with the whole array at the same time, generates a subset of random integers for a given percentage of the range, and the generated subset of random integers is obtained as sequentially increasing numbers. Such random integers are used to specify thepositions of randomly dispersed impurity atoms or solute atoms in many ...
Versions of this program held in the CPC repository in Mendeley Data
ACIE_v1_0; SRNG; 10.1016/0010-4655(76)90065-5
This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)</description><subject>Computational Physics</subject><subject>Computational Method</subject><contributor>Kuo, C.T.K.</contributor><contributor>Cadman, T.W.</contributor><contributor>Arsenault, R.J.</contributor><type>Other:Dataset</type><identifier>10.17632/xwcgrnbm22.1</identifier><rights>Computer Physics Communications Journal Licence</rights><rights>https://www.elsevier.com/about/policies/open-access-licenses/elsevier-user-license/cpc-license/</rights><relation>https:/data.mendeley.com/datasets/xwcgrnbm22</relation><date>1976-01-01T12:00:00Z</date><recordID>0.17632-xwcgrnbm22.1</recordID></dc>
|
| format |
Other:Dataset Other |
| author |
CPC, Mendeley |
| author2 |
Kuo, C.T.K. Cadman, T.W. Arsenault, R.J. |
| title |
Sequential random integer generator |
| publisher |
Mendeley |
| publishDate |
1976 |
| topic |
Computational Physics Computational Method |
| url |
https:/data.mendeley.com/datasets/xwcgrnbm22 |
| contents |
Title of program: SRNG
Catalogue Id: ACIE_v1_0
Nature of problem
An algorithm to generate a subset of random integers from a larger set of integers has been developed to minimize both the computing time and the memory space. The algorithm deals with the whole array at the same time, generates a subset of random integers for a given percentage of the range, and the generated subset of random integers is obtained as sequentially increasing numbers. Such random integers are used to specify thepositions of randomly dispersed impurity atoms or solute atoms in many ...
Versions of this program held in the CPC repository in Mendeley Data
ACIE_v1_0; SRNG; 10.1016/0010-4655(76)90065-5
This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019) |
| id |
IOS7969.0.17632-xwcgrnbm22.1 |
| institution |
Universitas Islam Indragiri |
| affiliation |
onesearch.perpusnas.go.id |
| institution_id |
804 |
| institution_type |
library:university library |
| library |
Teknologi Pangan UNISI |
| library_id |
2816 |
| collection |
Artikel mulono |
| repository_id |
7969 |
| city |
INDRAGIRI HILIR |
| province |
RIAU |
| shared_to_ipusnas_str |
1 |
| repoId |
IOS7969 |
| first_indexed |
2020-04-08T08:12:13Z |
| last_indexed |
2020-04-08T08:12:13Z |
| recordtype |
dc |
| _version_ |
1686587392217055232 |
| score |
17.538404 |