pi pi and pi
i dunno how to put by formula...
in matlab and actually the formula is like alternating series
i have to get
and so until the infinite decimal places
this my solution but still give different answer
There is no need for a double loop. Examine these two loops, then put them together into one loop.
for ii = 1:10
for jj = 1:10
"Matt Fig" <email@example.com> wrote in message <firstname.lastname@example.org...Performance: BITMAP index vs. Non-Bitmap Index
in the explain plan of an sql-statement I have the following part:
BITMAP CONVERSION TO ROWIDS
and then a Bitmap-Index is used.
Now, I deleted the Bitmap-Option from this index and the sql-statements
are performing much better. They only need 20% of the time, when using
a Bitmaped index.
What could be the reason for this? The conversion?
Thanks for your help,
> in the explain plan of an sql-statement I have the following part:
> BITMAP CONVERSION TO ROWIDS
> and then a Bitmap-Index is used.
> Now, I...Indexed calculations
I'm having a problem that an indexed calculation field which
references a custom function is not updated when one of it's parameter
fields is changed? Anyone care to pass on a workaround or help me
figure out why this is happening?
Thanks for any help,
> Hi all,
> I'm having a problem that an indexed calculation field which
> references a custom function is not updated when one of it's parameter
> fields is changed? Anyone care to pass on a workaround or help me
> figure out why this is happening?
> Thanks for any help,
Does anyone have code that can calculate pi to an arbitrary
precision? This is purely an academic endeavour.
Actually that's a lie. This is just so that I can show others up.
On 1 Apr, 18:07, "Braedley" <mike.braed...@gmail.com> wrote:
> Does anyone have code that can calculate pi to an arbitrary
> precision? This is purely an academic endeavour.
> Actually that's a lie. This is just so that I can show others up.
I remembered that there was a Monte Carlo mehtod to do this and the
following came up after a quick search. This is probably not ver...how to calculate pi
actually im new in mathlab....i get an assignment to calculate pi from infinite series..
from the the question its probably using loop
but i dunno how to make a repetition for the formula in mathlab
display ('loop no: ')
"atiqa eiqa" <email@example.com> wrote in message <firstname.lastname@example.org>...
> actually im new in mathlab....i get an assignment to calculate pi from infinite series..
> from the the question its probably using loop
> but i dunno how to ma...pi calculation
Ok here we go. I downloaded a pre compiled version of The GNU Multiple
Precision Arithmetic Library. Now I have created a program with it,
that I think should work. I have gotten it down to one error. But being
a noob, I have no idea what it means. Here it is.
Error E2277 main2.cpp 33: Lvalue required in function picalc(int)
Here is my sourcecode.
using namespace std;
void picalc (int a)
mpf_t x, y;
unsigned long int f;
long int e...PERFORM and performance
Just as a follow-up on another thread.
I would be VERY interested in any current documentatin indicating that the
PERFORM statement (with any compiler) has "bad performance".
I can certainly imagine that GO TO might (probably would) haave better
performance (at least in some cases), but that is like saying that you CAN
create better performing "good" Assembler than "comparable good" COBOL.
True, but not very useful in practice as a GENERAL rule.
In article <k_odo.95442$Bh.email@example.com>,
Bill Klein <firstname.lastname@example.org....Index Performance
I have the following table with indexes
CREATE TABLE dbo.Scratch (
ItemID int IDENTITY (1, 1) NOT NULL ,
Login varchar (12) NOT NULL ,
StartDate datetime NULL ,
PayDate datetime NULL ,
LastDisconnect datetime NULL
CREATE INDEX idxPayDate ON dbo.Scratch(PayDate)
CREATE INDEX idxStartDate ON dbo.Scratch(StartDate)
The index distribution stats show a very poor average row hits (whatever
that means) for these two indexes
e.g for idxPaydate its 61160 (11.89% very poor )
and there are many nulls in the distribution steps.
Also I have many queries with conditions like (...calculate index
i have list of index
L123456M01S01.RJM L123456M01S02.RJM L123456M01S03.RJM
L123456M01S04.RJM L123456M01S05.RJM L123456M01S06.RJM
L123456M01S07.RJM L123456M01S08.RJM L123456M01S09.RJM
may i know how to use tcl to calculate how many of this index??
On Feb 16, 4:27=A0pm, muhammaddzulkarn...@gmail.com wrote:
> Hello everyone..
> i have list ofindex
> L123456M01S01.RJM L123456M01S02.RJM L123456M01S03.RJM
> L123456M01S04.RJM L123456M01S05.RJM L123456M01S06.RJM
> L123456M01S07.RJM L123456M01S08.RJM L123456M01S09.RJM
> may i know how to use tcl tocalcul...Select performance issue vs local index and global index
We do have a performance problem with a simple select running against as simple table.
The table is physically partition on a daily basis base on a date in the table. We do have 365 physical partitions (each partition contain millions of rows).
The table contain 1 year of data. We are running under db2 9.7.8.
We do have a single global index on person_no column in this table.
The select look like this : select ... from person where person_no = 3345;
Every time, we run the select with a specific person_no, we always get less than 100 records return.
When we run the selec...calculating PI
Following on from something we discussed a few days ago, does anyone
know an efficient way to calculate an approximation to PI, starting with
integers and the operations addition, subtraction, multiplication and
The only way I know uses the series:
PI = 4/1 - 4/3 + 4/5 - 4/7 + 4/9....
The terms have alternating signs, and the denominators are the
ascending sequence of odd numbers. There is no end to the series, of
course, so it can never calculate PI exactly, but it will eventually
get it to any desired precision.
It's easy to code it into a li...Calculating PI
Wanting to do a PI calculator in Forth, I figured it would be easier to
start with existing program source, even if written in a different language.
My first surprise was not finding anything on the CP/M CD-ROM.
I eventually settled on a 32-bit C program found on the internet which I
converted to 16-bit operation and then to Forth.
The second surprise was finding the DX-Forth version ran twice as fast
as the HITECH-C version. I was expecting the opposite as HITECH-C
compiles native code (?). OTOH I'm running MYZ80 - not a real Z80,
and DX-Forth uses only 8080 instructions whi...Oracle 8.1.7 - Performance
I have a table (Table1) with around 250 million records in Oracle 8.1.7., of which 2 columns (column1 and column2) based on values : A, B, C, D & W, X, Y, Z respectively.
Can someone please clarify my doubts :
1. I have 3 scenarios for column1. Creating a Partition alone (or) Partition-ed index (or) Non-Partitioned Index on column1 :
a. how will the data be accessed for the above 3 scenarios
b. which is better with respect to performance
2. I am planning to create a complex partition on column1 and column2, since the queries on table1 is based on column1 and column2 :
a....FIRST...add number in cell but cannot run when i set calculation in button calculate in action performe
public class Details extends JFrame implements ActionListener
private JFrame f1, f2, f3;
private JLabel lblTitle, lblName, lblIC, lblDsh1, lblDsh2, lblAddress, lblPostalCode, lblCity, lblTel, lblHome, lblHP, lblOffice, lblFax, lblEmail;
private JLabel lblReference, lblDate, lblCashier, lblSalesman, lblTotal;
private JTextField txtName...Index merge is not performed
I have a simple table:
CREATE TABLE `cache_articles` (
cache_article_id int(10) unsigned NOT NULL auto_increment,
de_waregroup_1 varchar(60) NOT NULL,
de_waregroup_2 varchar(60) NOT NULL,
de_waregroup_3 varchar(60) NOT NULL,
de_waregroup_4 varchar(60) NOT NULL,
PRIMARY KEY (cache_article_id),
KEY de_waregroup_1 (de_waregroup_1),
KEY de_waregroup_2 (de_waregroup_2),
KEY de_waregroup_3 (de_waregroup_3),
KEY de_waregroup_4 (de_waregroup_4),
and a simple query:
EXPLAIN SELECT *
WHERE de_waregroup_1 =3D ''
AND de_waregrou...Performing a Substring Calculation
I hope I'm in the right group for this.
I'm using Google's Picasa program to create formatted webpages of
my images. Picasa acts on html and tpl files as it creates the final
I have found one variable that I would like to chop. The variable is
referred to as <%itemName%>.
I think the operation that I would like to perform is
"substring(<%itemName%>, 1, 8)."
Is it okay to include an operation like this in one of the html files
that gets "included?"
How do I get the substring operation to be executed by the program that
is assemblying ...Perform calculations in a pdf ?
is there a way to have some fields to fill in in a pdf file and have
calculations made using their contents ?
Project is we have a pdf file used a reference for management. Some
operations we use need user input to perform calculations in order to get a
parameter back orienting management.
How can I have for example on a page say two empty fields, have the user
fill them in, and when done click a "Calculate" button to show teh result in
a third field.
Is this possible or should I turn away from pdf ( that I mostlly use because
not modifiable by users) and use html ( but forma...Storage Performance Calculator
I saw some screenshots of a tool called:" IO RAID Calculator"
It looks like a Excel spreadsheet.
When applying a Raid Level, no of disks, IOPS per disk, Read% it results
with graphs and some I/O calculations.
Do You know this tool ? Is it free?
...Index performance question
I've got a relatively large file (4.3 million obs - 50 variables) with a
on 13 of the variables. I've noticed that the first time a query is made the
performs ok. If I make exactly the same query (or a very similar query) in a
later data step the index performs "lightning fast." It's almost as if the
index "remembers" the previous invocation and uses this information to it's
Does this make sense?
I'm almost at the point where I'm going to perform a query in a throw-a-way
data _null_ step just to get be...how to calculate value of pi
Hi, I'm pretty new to the programming world. I got stuck in the
following problem. Please guide me about it.
Well I'm trying to get the value of
I've used long double type but to no avail.
I even can't get the value of
How this problem can be solved?
Similarly, I was trying to develoop a program in hich we can calculate
the value of PI to our desired decimal point, but i got stuck in it.
How these sort of problems can be solved in C?
What tools C provides us to calculate such values?
> Hi, I'm pretty new to the programming world. I got...performance impact of index
I have a schema which is highly denormalized and purely read-only. For the
purpose of fast data access, is there any reason not to create a bitmap
index on every field for every table?
On Fri, 21 May 2004 10:48:07 -0400, "Gordon" <email@example.com>
>I have a schema which is highly denormalized and purely read-only. For the
>purpose of fast data access, is there any reason not to create a bitmap
>index on every field for every table?
There is every reason NOT to do this, as the optimizer will likely n...CRC calculation performance
Can anyone tell me how fast a TI C6202 can perform a CRC 16 calculation?
How many cycles would it take it to calculate the CRC on 1KB?
Based on a LUT or doing all the funky shifts and XOR's ?
"Gilad Cohen" <firstname.lastname@example.org> wrote in message
> Can anyone tell me how fast a TI C6202 can perform a CRC 16 calculation?
> How many cycles would it take it to calculate the CRC on 1KB?
"Gary Pace" <___@___.com> wrote in message new...SQL performance on index?
We found an expensive SQL on our SAP R/3 system:
"AUFPL" , "OBJNR" , "APLFL"
"MANDT" = :A0 AND "ARBID" IN ( :A1 , :A2 )#
AUFPL is key for table AFVC. ARBID is defined as an index already.
OBJNR & APLFL are not defined in any index. Field MANDY & ARBID are
low-cardinality, but AUFPL is high-cardinality.
If I create a new index which include all those fields (MANDT, ARBID,
AUFPL, OBJNR, APLFL), will it improve the performance?
B-Tree index or bitmap index is better?
Or, any other g...How to calculate the size of an index?
To calculate the size of a table, I usually use num_rows *
avg_row_len. But how to I calculate the size of an index? Do I use
avg_data_blocks_per_key * distinct_key * db_block_size of the
Please advice. Thank you.
> To calculate the size of a table, I usually use num_rows *
> avg_row_len. But how to I calculate the size of an index? Do I use
> avg_data_blocks_per_key * distinct_key * db_block_size of the
> Please advice. Thank you.
Imho, avg_row_len * num_rows gives you quite a meaningless figure if you