A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Papers and discussions presented at the December 10-12, 1956, eastern joint computer conference: New developments in computers on - AIEE-IRE '56 (Eastern)
The Datafile System, which employs standard magnetic-tape and recording techniques, also provides an economical solution to many medium-speed random-access problems and avoids awkward and time consuming ... Synopsis: This paper discusses the design and application of an advanced magnetictape storage system with facilities for automatic access to files as large as 200 million characters with average access ... These quasi-random configurations generally combine large low-cost serial memories with smaller random-access devices, so that the average cost per unit of information storage is low. ...doi:10.1145/1455533.1455562 fatcat:33b4ttbl7jhpbl65yqxkval7fu
Unicorn exploits the random write characteristic of HBase to improve the performance of generalized iterative matrix-vector multiplication (GIM-V), a core graph mining routine. ... For the machine scalability, we show the relative throughput T4 T M with M machines for the Twitter graph, where T M is the running time with M machines. ... Random Write Cost (to HBase) -the cost C RW (U, s) of random write of s bytes to HBase using U machines is given by C RW (U, s) = s U * 1 B rw (2) Explanation. ...doi:10.1016/j.ins.2015.04.016 fatcat:vnjavtuq55gmjdkqkbgp42cytm
In this paper we analyze some weaknesses of existing models of com- putation, namely sequential access machine and random access machine, and propose a new cost model, called relative cost ran- dom access ... For almost all such operators we find bounds, exact with respect to order, for the average time of calculating their values.” 2000g:68040 68Q05 Penttonen, Martti Relative cost random access machines. ...
SN Applied Sciences
Prediction models were developed using several supervised machine learning algorithms, including logistic regression, support vector machine, random forest, and classification and regression tree. ... Gum health shows a significantly higher relative importance compared to other features. ... Accessing necessary care is not as simple as finding a dentist as many patients experience barriers to access  , including cost related barriers [13, 14] , anxiety related to dental procedures [ ...doi:10.1007/s42452-019-0795-7 fatcat:dmztjz7b6nfzdlqrfb7u6w5pqm
The results showed that the average completion time with a randomized keypad is longer than with a conventional keypad. ... This work, the usability of a randomized numeric keypad was examined and compared to the usability of a conventional numeric keypad. ... Using passwords that the user must remember is not perfect either, but is widely used because of the low cost and the relative ease of use  . ...doi:10.22214/ijraset.2018.3257 fatcat:igxwl3xk6zbpviiaqwhcrhga54
Here, the random bits may be multiply accessed by the machine. ... logspace machine can be accepted with zero error by a randomized logspace machine having multiple access to the random bits. ...
Our results suggest that the use of games-of-chance such as a slot machine that are enjoyable to play can be a cost-effective means of motivating desired behavior. ... ., the use of a virtual slot machine that employees can play to possibly win gift card rewards of up to $500. ... Finally, each play of a slot machine typically has a low-cost relative to the amount that might be won making it easier to justify continued play despite losses, because of the low opportunity cost for ...doi:10.2139/ssrn.3021841 fatcat:dbbm46dcmnbdpjyf2vt2mllgq4
The calculated net machine costs for the forwarding equipment and track mini-harvester were EUR 36.12 and 52.47 per PMH, respectively. ... trails (3.7 m) and insignificant on plots located along narrow access trails (2.5 m). ... Residual analysis indicates random distribution and absence of bias (average = 0) and random error (p > 0.05 for Shapiro-Wilk test). ...doi:10.3390/f12070870 doaj:3a3feb259d80494193d0bcc246a8b8f7 fatcat:zoptzqxvyvflrf6u246evsipbu
In this paper, we revisit the problem of performance prediction on SMP machines, motivated by the need for selecting parallelization strategy for random write reductions. ... Moreover, the model is quite accurate in predicting the relative performance of the three parallelization techniques. ... Finally, Fig. 20 shows the predicted relative costs of different factors, as the size of the reduction object is scaled. ...doi:10.1016/j.peva.2004.10.017 fatcat:byfqjbuihrgk3dmho6qrug64sm
Advances in Computers
into strided and random accesses. ... , the bandwidth of strided access to main memory and of random access to L1 cache. ...doi:10.1016/s0065-2458(08)00003-x fatcat:2d6l4pfuvngcxo5qrezg2xce5m
Costs were derived from a dataset of 2321 working time records for labour and machine hours from five German wine estates over three years. ... The costs for standard viticultural processes were compared across five site types with different mechanisation intensities by univariate analysis of variance with fixed and random effects. ... The "slope and access to vineyard sites" factor can be broken down into three levels: "no limitation", "limited access for machines" and "no access to machines" (Column 1 in Table 2 ). ...doi:10.20870/oeno-one.2021.55.1.4494 fatcat:i2ttszkymzbdfhmmqvcuyogbte
Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '02
In this paper, we revisit the problem of performance prediction on shared memory parallel machines, motivated by the need for selecting parallelization strategy for random write reductions. ... Moreover, the model is quite accurate in predicting the relative performance of the three parallelization techniques. ... accessed. ...doi:10.1145/511348.511350 fatcat:btfxqyu5wbdkrfiirsaxhktzpe
Lecture Notes in Computer Science
that is linear, has a highly random memory access pattern and where this memory access pattern completely dominates execution. ... Randomized Permutations Randomized generation of permutations is a problem with a linear time complexity but where the most costly operation is random memory access. ...doi:10.1007/3-540-44843-8_29 fatcat:gjldptbbjzdfpkxj2o2vbhx5si
In this paper, we revisit the problem of performance prediction on shared memory parallel machines, motivated by the need for selecting parallelization strategy for random write reductions. ... Moreover, the model is quite accurate in predicting the relative performance of the three parallelization techniques. ... accessed. ...doi:10.1145/511334.511350 dblp:conf/sigmetrics/JinA02 fatcat:rqdp72qtlzhcpb6flrzu7cbdie
In this paper, we revisit the problem of performance prediction on shared memory parallel machines, motivated by the need for selecting parallelization strategy for random write reductions. ... Moreover, the model is quite accurate in predicting the relative performance of the three parallelization techniques. ... accessed. ...doi:10.1145/511399.511350 fatcat:sujwkqbqyfh5xmuubnvo4hz6ru
« Previous Showing results 1 — 15 out of 239,244 results