17%
30.05.2021
_file | ACTIVE |
+--------------+---------------+
1 row in set (0.00 sec)
Finally, confirm data encryption at rest with the strings command to view the encrypted output:
$ strings /var
17%
23.03.2016
is just about one error per gigabit of memory per hour. The lower number indicates roughly one error every 1,000 years per gigabit of memory.
A Linux kernel module called EDAC, which stands for error
17%
07.10.2014
] indicates that 31 percent of more than 9,000 respondents see their position as a DevOps Engineer. According to the survey, 16 percent work in a DevOps department.
The report, with 46 percent of respondents
17%
18.02.2018
, consider the possibility of checking for an update and downloading it directly – not a good option for 1,000 individual users.
If you want to use LibreOffice in your company on a comprehensive
17%
03.04.2019
code by writing parallel code as much as possible. Why run 100,000+ serial jobs on an Exascale machine? You can accomplish this with cloud computing. OpenMP is one of the programming technologies
17%
12.09.2013
Thorsten Scherf
52 - initial version
Running
rpmbuild -ba custom-selinux-policy
finally gives you the source and binary RPMs. You need the appropriate development tools in place
17%
03.02.2022
is made possible because cron only checks for a date format and not that the date of the task is legitimate. The crontab date specification for CronRAT is 52 23 31 2 3, which would generate a runtime error
17%
05.12.2019
field:
sudo ausearch -k watch-passwd
time->Tue May 28 19:52:15 2019
type=CONFIG_CHANGE msg=audit (1559065935.923:2447): auid=1000 ses=2 subj=unconfined_u:unconfined_r:unconfined_t:s0-s0:c0.c1023 op
17%
11.06.2014
on the Rex host and then copy the public key over to the client (Listing 3). After that, a test login on the client without password should work.
Listing 3
Key-Based Authentication
01 root
17%
08.05.2019
. For example, the code in Listing 3 illustrates how to reduce a series of loops into a single fork/join structure.
Listing 3: Single Fork and Join
Fortran
C
!$omp parallel
!$omp for
do i=1,n
