Question about Microsoft Computers & Internet

This is done automatically by the OS. If you need to save space you can compress files, or off load to cheaper storage.

Apr 28, 2014 | Computers & Internet

Two algorithms were discovered in 1995 that
opened up new avenues of research into pi. They are called spigot algorithms
because, like water dripping from a spigot,
they produce single digits of pi that are not reused after they are
calculated. This is in contrast to infinite series or iterative algorithms,
which retain and use all intermediate digits until the final result is
produced.

American mathematicians Stan Wagon and Stanley Rabinowitz produced a simple spigot algorithm in 1995. Its speed is comparable to arctan algorithms, but not as fast as iterative algorithms. Another spigot algorithm, the BBP digit extraction algorithm, was discovered in 1995 by Simon Plouffe:

American mathematicians Stan Wagon and Stanley Rabinowitz produced a simple spigot algorithm in 1995. Its speed is comparable to arctan algorithms, but not as fast as iterative algorithms. Another spigot algorithm, the BBP digit extraction algorithm, was discovered in 1995 by Simon Plouffe:

Nov 04, 2013 | Office Equipment & Supplies

Here are some papers, code and blog posts (this is nice one too) on how to algorithmically search for solutions to squzzles/scramble square puzzles. You might have received one of these puzzles as a holiday gift over the last few years, they were quite popular.

C and Perl Implemenations

General Backtracking Approach

The algorithm is straightforward - just one that searches through solutions.

What's interesting is that I've seen people solve these puzzles, even brand new ones (no prior knowledge), very quickly. There's something that happens with a persons vision or something that's helping them not have to exhaustively search the full solution space. If I'd seen someone do this once or twice, I'd think it was just lucky picks. (these puzzles have enormous solution spaces (4^8 x 9! = 23,781,703,680 puzzle configurations) )

Is there something in this puzzle that "hints" to a human early in the solution testing that a solution is viable or not. That is, after 1 or 2 pieces placed, can the human see a promising solution "faster" than the basic algorithm that searches quickly through all piece placements and orientations. If so, what is that data ("hint") the human sees and how can we factor it into the algorithm?

Possible hint data:

Rules of thumb on how all these puzzles are printed and cut (do the puzzles all get made with same orientations so exposure to one puzzle provides data on other puzzles?)

Humans can see the whole pattern in parallel even when pieces aren't lined up so they don't have to check each piece systematically

Are combinations of pieces eliminated as the humans solve it thus taking them out of future solution attempts, reducing solution space the more the human works on the puzzle.

Thank You

C and Perl Implemenations

General Backtracking Approach

The algorithm is straightforward - just one that searches through solutions.

What's interesting is that I've seen people solve these puzzles, even brand new ones (no prior knowledge), very quickly. There's something that happens with a persons vision or something that's helping them not have to exhaustively search the full solution space. If I'd seen someone do this once or twice, I'd think it was just lucky picks. (these puzzles have enormous solution spaces (4^8 x 9! = 23,781,703,680 puzzle configurations) )

Is there something in this puzzle that "hints" to a human early in the solution testing that a solution is viable or not. That is, after 1 or 2 pieces placed, can the human see a promising solution "faster" than the basic algorithm that searches quickly through all piece placements and orientations. If so, what is that data ("hint") the human sees and how can we factor it into the algorithm?

Possible hint data:

Rules of thumb on how all these puzzles are printed and cut (do the puzzles all get made with same orientations so exposure to one puzzle provides data on other puzzles?)

Humans can see the whole pattern in parallel even when pieces aren't lined up so they don't have to check each piece systematically

Are combinations of pieces eliminated as the humans solve it thus taking them out of future solution attempts, reducing solution space the more the human works on the puzzle.

Thank You

May 30, 2011 | Google Computers & Internet

The FX-991ES offers simple matrix operations like basic arithmetic, plus the slightly more complex operations determinant and inversion. Furthermore, it is limited to matrices with a maximum size of three rows and three columns.

The rank of a matrix is defined as the number of linearly independent row or column vectors. You can perform a simple partial test for square matrices by calculating the determinant of the matrix:

Unfortunately, this is all support the calculator offers. For small matrices (i.e. 4x4 or smaller), you should familiarize yourself with the Gau? Elimination Method algorithm for solving linear equation systems. It is a two-step procedure where a matrix first is converted to its row echelon form, and second to row canonical form to solve the LES.

You need to follow the algorithm only through the first part, the number of non-zero rows after this step equals the rank of the matrix. With a little exercise you will be able to do it faster on paper than trying to do it with your calculator only.

For larger matrices I suggest to use a PC with more powerful math software (Maple, Mathematica, ...) or, if you know some basic computer programming, just write the necessary program yourself, which is also a very good exercise both in programming and understanding the algorithm.

The rank of a matrix is defined as the number of linearly independent row or column vectors. You can perform a simple partial test for square matrices by calculating the determinant of the matrix:

- Enter the matrix into matrix variable MatA.
- Press [SHIFT] [4] [7] [SHIFT] [4] [3] [)] [=]

Unfortunately, this is all support the calculator offers. For small matrices (i.e. 4x4 or smaller), you should familiarize yourself with the Gau? Elimination Method algorithm for solving linear equation systems. It is a two-step procedure where a matrix first is converted to its row echelon form, and second to row canonical form to solve the LES.

You need to follow the algorithm only through the first part, the number of non-zero rows after this step equals the rank of the matrix. With a little exercise you will be able to do it faster on paper than trying to do it with your calculator only.

For larger matrices I suggest to use a PC with more powerful math software (Maple, Mathematica, ...) or, if you know some basic computer programming, just write the necessary program yourself, which is also a very good exercise both in programming and understanding the algorithm.

Jan 16, 2011 | Casio FX-115ES Scientific Calculator

That posses a problem. They know there is a problem with the algorithm but don't plan to fix it. Wonderful. The problem is this, you would have to know what the algorithm was to be able to do anything about it and I doubt very seriously they are going to release that. That leaves you with the option of hiring a hacker to break the code or paying a specialty company to break the code and they are not cheap or well advertised. I can't think of any companies that do that work anymore. You are going to have to identify a Security company or the company that originally developed the Algorithm and see if you can work out a deal to get the corrected algorithm. The problem you have is your algorithm was designed for files smaller than 4gb and there is a permutation error that occurs on files that are larger. In a lot of cases this is a random fault that makes it very difficult to identify if not impossible depending on what level of encryption the algorithm actually represents. 32 or 64 bit encryption isn't so bad but 128 or higher is a real pain and expensive. There are some software packages available out there if you search the web for them, "Decryption Software", but again it is expensive and hard to find.

Dec 16, 2010 | Seagate FreeAgent Go 320 GB USB 20 Hard...

Hello,

Let us assume you have two simultaneous linear equations :

**a_1*x+ b_1*y+c_1=0**

a_2*x +b_2*y+c_2=0

where a_1, a_2, b_1, b_2, c_1,c_2 are coefficients (numerical or algebraic).

The problem is to obtain the particular values of the unknowns x and y for which the two equations are both satisfied: If you substitute the particular values of x and y you find in any of the two equations you discover that both equalities are true.

A small system of equations like the one above can be solved by some very simple algorithms (elimination, substitution, combination) which can be carried out by hand.

The solution of large systems of linear equations can be sought by making use of the concepts of matrices (plural of matrix), determinants, and certain rules called Cramer's rules.

Due to its repetitive nature, the algorithm ( a well defined, limited sequence of steps) is suitable for a calculating machine (computer or calculator).

Certain calculators have, embedded in their ROM, a program that solves linear systems of simultaneous equations. Usually you are asked to enter the values of the coefficients a_1, etc. in a set order, then you press ENTER or EXE (Casio) . If a solution exits (not all linear systems have solutions) the calculator displays it.

Hope that satisfies your curiosity.

Let us assume you have two simultaneous linear equations :

a_2*x +b_2*y+c_2=0

where a_1, a_2, b_1, b_2, c_1,c_2 are coefficients (numerical or algebraic).

The problem is to obtain the particular values of the unknowns x and y for which the two equations are both satisfied: If you substitute the particular values of x and y you find in any of the two equations you discover that both equalities are true.

A small system of equations like the one above can be solved by some very simple algorithms (elimination, substitution, combination) which can be carried out by hand.

The solution of large systems of linear equations can be sought by making use of the concepts of matrices (plural of matrix), determinants, and certain rules called Cramer's rules.

Due to its repetitive nature, the algorithm ( a well defined, limited sequence of steps) is suitable for a calculating machine (computer or calculator).

Certain calculators have, embedded in their ROM, a program that solves linear systems of simultaneous equations. Usually you are asked to enter the values of the coefficients a_1, etc. in a set order, then you press ENTER or EXE (Casio) . If a solution exits (not all linear systems have solutions) the calculator displays it.

Hope that satisfies your curiosity.

Aug 12, 2009 | Sharp EL-531VB Calculator

check this out buddy...

http://cpsourcecodes.com/?tag=booths-algorithm

u may need to modify it a little, but you are a programmer so it shouldn't be any trouble... :)

http://cpsourcecodes.com/?tag=booths-algorithm

u may need to modify it a little, but you are a programmer so it shouldn't be any trouble... :)

Mar 24, 2009 | Computers & Internet

Hi

Go to this link , you will find the source code of Elgamel algorthm and please rate me if your problem is solved

http://books.google.co.in/books?id=WLLAD2FKH3IC&pg=PA116&lpg=PA116&dq=java+code+for+Elgamal+algorithm&source=bl&ots=O9FqiKj5xy&sig=UbQEXMWgymP-poxmmyLe49CPucA&hl=en&ei=dgbLSYbKKMTvnQfVrc3HCQ&sa=X&oi=book_result&resnum=4&ct=result#PPA116,M1

Thanks!

Go to this link , you will find the source code of Elgamel algorthm and please rate me if your problem is solved

http://books.google.co.in/books?id=WLLAD2FKH3IC&pg=PA116&lpg=PA116&dq=java+code+for+Elgamal+algorithm&source=bl&ots=O9FqiKj5xy&sig=UbQEXMWgymP-poxmmyLe49CPucA&hl=en&ei=dgbLSYbKKMTvnQfVrc3HCQ&sa=X&oi=book_result&resnum=4&ct=result#PPA116,M1

Thanks!

Mar 21, 2009 | Computers & Internet

Register the program. When the license is requested, the key algorithm will be submitted to the program or vendor.

Jan 04, 2009 | Microsoft Windows XP Professional

Hello, you can find the best open-source implementation of data-mining algorithms here:

http://www.cs.waikato.ac.nz/ml/weka/

You can use the built-in application or embed it in your own code.

Of course it implements several naive bayes algorithms

http://www.cs.waikato.ac.nz/ml/weka/

You can use the built-in application or embed it in your own code.

Of course it implements several naive bayes algorithms

Mar 20, 2008 | Computers & Internet

Sep 13, 2017 | Microsoft Computers & Internet

84 people viewed this question

Usually answered in minutes!

×