13%
14.03.2013
details as well [3]. The files in the Linux /proc directory also have a pleasingly hackable penchant for being directly readable as plain text, as opposed to more binary-centric proc implementations
13%
21.08.2012
just two nodes: test1, which is the master node, and n0001, which is the first compute node):
[laytonjb@test1 ~]$ pdsh -w test1,n0001 uptime
test1: 18:57:17 up 2:40, 5 users, load average: 0.00, 0.00
13%
17.02.2015
reports – with the help of web technologies such as HTML, JavaScript, jQuery [3], and CSS3, which Python creates in combination with R and the MongoDB [4] database.
Comet Rising
Figure 1 shows how
13%
02.08.2021
---------------- -------------------- ---------------------------------------- --------- -------------------------- ---------------- --------
/dev/nvme0n1 S3ESNX0JA48075E Samsung SSD 960 EVO 250GB 1 22.41 GB / 250.06 GB 512 B + 0 B 2B7QCXE7
/dev/nvme1n1 07b4753784e26c18 Linux
13%
30.11.2025
, your scaling options are virtually unlimited, and you can add Content Delivery Networks (CDN). As an example, SlideShare [1] integrates document downloads and Flash file hosting with Amazon S3 and Cloud
13%
07.01.2025
SC24 took place in Atlanta, GA, November 17-22. As I'm writing this, 17,959 attendees – that’s 3,000+ more than last year – registered. More than 500 companies filled the exhibition floor, which
13%
10.04.2015
organization Electronic Frontier Foundation (EFF). This involves encrypting communications in the data center and between email servers using HTTPS and HSTS [3] and Perfect Forward Secrecy (PFS) [4].
Posteo
13%
30.11.2025
the 4,000,000,000 inhabitants of this continent who are affected by the scarcity of IPv4 addresses – and who are thus the earliest adopters of IPv6. This situation will mainly relate to your web offerings
13%
18.07.2013
resource requirements. Although Apache is still king of the hill, approximately 30 percent of the top 10,000 websites already benefit from Nginx [2] (Figure 1
13%
17.06.2017
-1) = 0.25 * (a(1:n-2,2:n) + a(3:n,2:n) + a(2:n,1:n-2) + a(2:n,3:n))
Using forall, the same can be written as:
forall (i=2:n-1, j=2:n-1) a(i,j) = 0.25*(a(i-1,j) + a(i+1,j) + a(i,j-1) + a(i,j+1
