03-31-2016
Hi Scrutinizer...
Thanks that is what I needed...
I hadn't researched that yet as it was unimportant at this point in time... :-)
8 More Discussions You Might Find Interesting
1. Programming
IKHz_SW_OSX.py
A DEMO mono _pure_ sinewave generator using standard text mode Python 2.6.7 to at least 2.7.3.
This code is EASILY modifyable to Python version 3.x.x...
This DEMO kids level 1KHz generator is mainly for a MacBook Pro, (13 inch in my case), OSX 10.7.5 and above. See below...... (0 Replies)
Discussion started by: wisecracker
0 Replies
2. Shell Programming and Scripting
A very simple crude sinewave generator.
The file required is generated inside the code, is linear interpolated and requires /dev/audio to work. Ensure you have this device, if not the download oss-compat from your OS's repository...
It lasts for about 8 seconds before exiting and saves a... (5 Replies)
Discussion started by: wisecracker
5 Replies
3. Shell Programming and Scripting
Thanks Guys
This really helped (5 Replies)
Discussion started by: robert89
5 Replies
4. Slackware
I'm trying to record audio using Audacity 2.0.5 installed from SlackBuilds. My system is 64-bit Slackware 14.1 and a sound card is Intel HD Audio. I didn't change my sound system to OSS. (Default sound system in Slackware 14.1 is ALSA, isn't it?) First, I set Internal Microphone slider in KMix... (2 Replies)
Discussion started by: qzxcvbnm
2 Replies
5. OS X (Apple)
This is a small program as a tester for a basic sweep generator for bandwidth testing of AudioScope.sh.
This DEMO is only capable of 4KHz down to about 85Hz and back due to the low bit rate, but it is proof of concept for a much wider variant using a much higher bit rate.
The file generated... (4 Replies)
Discussion started by: wisecracker
4 Replies
6. OS X (Apple)
Hi all...
I intend to do an Audio Function Generator using Awk, (already started thanks to Don), but the biggest thing I have struggled with was variable frequency.
I was going to generate differing sized waveforms on the fly but that would that would mean the frequencies are dependent on any... (2 Replies)
Discussion started by: wisecracker
2 Replies
7. OS X (Apple)
Hi all...
Well I have not been inactive but working out how to make OSX 10.14.x command line audio player have a variable sample rate.
This is a back door as afplay does not have a sample rate flag unlike aplay for ALSA, in Linux flavours.
This is a DEMO only but a derivative of it will... (2 Replies)
Discussion started by: wisecracker
2 Replies
8. Shell Programming and Scripting
Hello
I use a bash script to creating the hosts file /etc/hosts
But there is a bug inside my output and I want to fix this.
My Array looks like this:
205,IP 111.122.133.20
205,HOST2 unas
205,HOST1 unas15533
205,COMMENT # UNAS
775,IP ... (9 Replies)
Discussion started by: Marti95
9 Replies
LEARN ABOUT NETBSD
moduli
MODULI(5) BSD File Formats Manual MODULI(5)
NAME
moduli -- system moduli file
DESCRIPTION
The /etc/moduli file contains the system-wide Diffie-Hellman prime moduli for sshd(8).
Each line in this file contains the following fields: Time, Type, Tests, Tries, Size, Generator, Modulus. The fields are separated by white
space (tab or blank).
Time: yyyymmddhhmmss. Specifies the system time that the line was appended to the file. The value 00000000000000 means unknown (historic).
Type: decimal. Specifies the internal structure of the prime modulus.
0: unknown; often learned from peer during protocol operation, and saved for later analysis.
1: unstructured; a common large number.
2: safe (p = 2q + 1); meets basic structural requirements.
3: Schnorr.
4: Sophie-Germaine (q = (p-1)/2); usually generated in the process of testing safe or strong primes.
5: strong; useful for RSA public key generation.
Tests: decimal (bit field). Specifies the methods used in checking for primality. Usually, more than one test is used.
0: not tested; often learned from peer during protocol operation, and saved for later analysis.
1: composite; failed one or more tests. In this case, the highest bit specifies the test that failed.
2: sieve; checked for division by a range of smaller primes.
4: Miller-Rabin.
8: Jacobi.
16: Elliptic Curve.
Tries: decimal. Depends on the value of the highest valid Test bit, where the method specified is:
0: not tested (always zero).
1: composite (irrelevant).
2: sieve; number of primes sieved. Commonly on the order of 32,000,000.
4: Miller-Rabin; number of M-R iterations. Commonly on the order of 32 to 64.
8: Jacobi; unknown (always zero).
16: Elliptic Curve; unused (always zero).
Size: decimal. Specifies the number of the most significant bit (0 to M).
Generator: hex string. Specifies the best generator for a Diffie-Hellman exchange. 0 = unknown or variable, 2, 3, 5, etc.
Modulus: hex string. The prime modulus.
The file should be searched for moduli that meet the appropriate Time, Size and Generator criteria. When more than one meet the criteria,
the selection should be weighted toward newer moduli, without completely disqualifying older moduli.
Note that sshd(8) uses only the Size criteria and then selects a modulus at random if more than one meet the Size criteria.
FILES
/etc/moduli
SEE ALSO
qsieve(1), sshd(8)
HISTORY
The moduli file appeared in OpenBSD 2.8 and NetBSD 1.6.
BSD
February 7, 2005 BSD