02-20-2020
Toshiba’s Optimization Algorithm Sets Speed Record for Solving Combinatorial Problems.
Enjoy...
'https://spectrum.ieee.org/tech-talk/computing/software/toshiba--optimization-algorithm-speed-record-combinatorial-problems'
Copy and paste URL less single quotes...
These 2 Users Gave Thanks to wisecracker For This Post:
8 More Discussions You Might Find Interesting
1. HP-UX
Hi There,
We've been creating a little program that collects all the performance data available about the processes on a HP-UX system. (running HP-UX 11.11).
And everything works fine apart from 4 fields in the middle of the pst_status record.
Input Blocks (pst_inblock)
Output Blocks... (0 Replies)
Discussion started by: cpiuk
0 Replies
2. Filesystems, Disks and Memory
Hello,
I have a Supermicro server with a P4SCI mother board running Debian Sarge 3.1. This is the "dmidecode" output related to RAM info:
RAM speed information is incomplete.. "Current Speed: Unknown", is there anyway/soft to get the speed of installed RAM modules? thanks!!
Regards :)... (0 Replies)
Discussion started by: Santi
0 Replies
3. UNIX for Advanced & Expert Users
Hi,
Anyone can u give me an idea to clear the network collisions in the unix box(Solaris and Linux)? NIC performance is very low, and it shows collisions, when issuing the command ifconfig -a in the production server. How can i rectify the network collisions in the box. Using netstat and lsof... (4 Replies)
Discussion started by: muthulingaraja
4 Replies
4. Virtualization and Cloud Computing
timbass
Sat, 28 Jul 2007 10:07:53 +0000
Originally posted in Yahoo! CEP-Interest
Here is my follow-up note on posets (partially ordered sets) and tosets (totally or linearly ordered sets) as background set theory for event processing, and in particular CEP and ESP.
In my last note, we... (0 Replies)
Discussion started by: Linux Bot
0 Replies
5. UNIX for Advanced & Expert Users
Hi all. I was able to set up an IBM Ultrium LTO 4 tape drive to use iSCSI (using open-iscsi drivers) to communicate with Red Hat, but it's going really slow, maxing out in tar and dd tests at like 16 MB/s (using a block size of 128k). The thing is rated for 30MB/s. I feel like even though I have... (1 Reply)
Discussion started by: jeriryan87
1 Replies
6. Shell Programming and Scripting
Hi guys,
I have been making a simple script for looking for anagram solutions in a word list (a file of 22k or so words).
At the moment it funtions like so:
User enters an 8 character string (whatever letters you want to find anagrams of, or solve rather)
The script moves all the words... (2 Replies)
Discussion started by: Donthommo
2 Replies
7. Filesystems, Disks and Memory
I analysed disk performance with blktrace and get some data:
read:
8,3 4 2141 2.882115217 3342 Q R 195732187 + 32
8,3 4 2142 2.882116411 3342 G R 195732187 + 32
8,3 4 2144 2.882117647 3342 I R 195732187 + 32
8,3 4 2145 ... (1 Reply)
Discussion started by: W.C.C
1 Replies
8. UNIX for Advanced & Expert Users
I'm trying to compress a directory structure on an external hard drive, connected by eSATA cable to my linux (Ubuntu 10.04) desktop. The total volume is 500Gb with half a million files, ranging from Kb to Mb in size. The drive is 2Tb, with 0.8Tb free space before compression.
running "tar -pcf... (10 Replies)
Discussion started by: omnisppot
10 Replies
ieee(3m) ieee(3m)
Name
copysign, drem, finite, logb, scalb - copysign, remainder, exponent manipulations
Syntax
#include <math.h>
double copysign(x,y)
double x,y;
double drem(x,y)
double x,y;
int finite(x)
double x;
double logb(x)
double x;
double scalb(x,n)
double x;
int n;
Description
These functions are required, or recommended by the IEEE standard 754 for floating-point arithmetic.
The function returns x with its sign changed to y's.
The function returns the remainder r := x - n*y where n is the integer nearest the exact value of x/y. Additionally if |n-x/y|=1/2, then n
is even. Consequently the remainder is computed exactly and |r| <= |y|/2. Note that is the exception (see Diagnostics).
Finite(x) = 1 just when -infinity < x < +infinity,
= 0 otherwise (when |x| = infinity or x is NaN)
The a signed integer converted to double-precision floating-point and so chosen that 1 <= |x|/2**n < 2 unless x = 0 or |x| = infinity or x
lies between 0 and the Underflow Threshold.
Scalb(x,n) = x*(2**n) computed, for integer n, without first computing 2**N.
Diagnostics
IEEE 754 defines drem(x,0) and drem(infinity,y) to be invalid operations that produce a NaN.
IEEE 754 defines logb(+-infinity) = +infinity and logb(0) = -infinity, requires the latter to signal Division-by-Zero.
Restrictions
IEEE 754 currently specifies that logb(denormalized no.) = logb(tiniest normalized no. > 0) but the consensus has changed to the specifica-
tion in the new proposed IEEE standard p854, namely that logb(x) satisfy
1 <= scalb(|x|,-logb(x)) < Radix ... = 2 for IEEE 754
for every x except 0, infinity and NaN. Almost every program that assumes 754's specification will work correctly if logb follows 854's
specification instead.
IEEE 754 requires copysign(x,NaN) = +-x but says nothing else about the sign of a NaN.
See Also
floor(3M), fp_class(3), math(3M)
RISC ieee(3m)