i try to understand this algorithm but i cann't. [URL] I encounter problem understand the algorithm of fixed base windowing exponentiation algorithm ? What is fixed base in the first place ? How this algorithm works ?
View 5 Repliescan we find logarithm to base 10 instead of base 2 on shell script??i can do it with bc..like 'l(1000)/l(10)' | bc -l
View 1 Replies View RelatedCan I know the implemention of RSA(Encryption and decryption) algorithm in C / C++.
View 1 Replies View RelatedI have a copy of the MD5 algorithm and I'm taking a look at the source. It's pretty interesting but there are a few things that I'm curious about and I was wondering if anyone a bit more intuitive than I could help me out.The function declarations in the MD5 files are a bit unfamiliar to me. There is a macro used called PROTO_LIST, which I'm still not sure as to what this thing is doing exactly, but it's littered everywhere throughout the source.The signature here isn't too unfamiliar to me with the exception of the position of the PROTO_LIST macro. So here is a function with an unnamed argument of type MD5_CTX*.To me, this resembles an initializer list found in C++ with constructors but I certainly don't think that is the case here. So my questions about this are (1) how is this legal code in C and (2) what functionality has the PROTO_LIST macro provided for the function?
View 3 Replies View RelatedI have a timer thread, and when it expires, it sets a flag. The only problem is, if any higher priority thread comes in between, then the timer is not expired in real time.Thus i want to set a highest priority to my thread. Now, i know 2 algos, which can make my thread in real time are: SCHED_FIFO and SCHED_RR.
So, here are my queries: 1) Which scheduling algo is best suited for this purpose? 2) Is it guaranted to work in real time if i use that algo (you suggest in 1) and set the max_priority by getting the maximum settable priority for that particular algorithm using, int sched_get_priority_max(int policy);
I've got a bit of an obscure question for you to test your brains a wee bit. I'm trying to implement a search program to find areas of high density in a binary string.
E.g.
Code:
[0001001010
0001110001
0000001000
1001000010
0101100100]
Where density is the number of 1's / number of digits with a maximum number of digits being the current number in a buffer (in this example 50). So for the example the density for the whole buffer is 15/50. But the density of Buffer[14..20]=[1110001]=4/7. So if looking for areas of density = 1/3 it would find the longest sequences of density over 1/3.So in the example. Buffer[4..9]=[100101]=3/6=1/2 which is above 1/3 but it is within the Buffer[4..48]=[100101000011100010000001000100100001001011001]=15/45=1/3
I have an algorithm guys called "Self Configurable Diagnosis Algorithm" but i don't have program for this.help me regarding that program and which type of Tcl script will be better suitable for that.
View 3 Replies View RelatedI have two functions:
Quote:
void func1(std::string &s)
{
s.clear();
}
[code]....
Is there a way to create one template function for both vector and string that would clear them?
I need to simulate dijsktra's algorithm using network animator of ns2. how to write a tcl script for my code. This tcl script runs the dijsktra code and simulates its running on network animator.
View 1 Replies View RelatedAStar works on the basis of straight lines, AFAIK. In my case, we have geocoordinates and I can get the straight line distance between the waypoints. But I am wondering how approximate will the route calculated on this basis be? The actual distance "by road", which actually matters can be different.
Example. Assuming A and B are on the same plane, and will be equidistant from the goal point, if we consider a straight line between A and the goal point and, B and the goal point. The distance "by road" between A and the goal point may be greater or lesser than B. But because the AStar works on the basis of straight lines, it will return both the routes as the shortest. If yes, then which algo should be considered , if we want the results on the basis of actual distance in Km/m?
i need a program for Encryption and Decryption using RSA algorithm in JAVA ..
View 9 Replies View Relatedalgorithm:breada
input: file system block number for immediate read
file system block number for asynchronous read
output:buffer containing data for immediate read {
if(first block not in cache) {
get buffer for first block
if(buffer data not valid)
initiate disk read }
if(second block not in cache) {
get buffer for second block)
if(buffer data valid) //line 1
release buffer else
initiate disk read //line 2 }
if(first block was originally in cache) //line 3 {
read first block
return buffer }
sleep (event first buffer contains valid data)
return buffer }
Here is an algorithm for block read algorithm. I have problem in
line 1: If buffer data is valid why is it releasing the buffer?
line 2: If buffer data valid why is it initiating disk read. It should have read directly from buffer?
line 3: It should be the first condition as if it is there in cache then it should return it without delay?
Does anyone know of a C Language Data Structure Tutorial? I have not been able to find anything much to speak of myself.
View 4 Replies View RelatedThe algorithm for reading and writing disk blocks use the algorithm getblk to allocate buffers from the pool. In the algorithm getblk, if the kernel removes a buffer from the free list, it must raise the processor priority level to block out interrupts before checking the free list. Why ?Where can i find the C implementation of the above algorithm for buffer allocation in the linux source code ?
View 1 Replies View RelatedI want to simulate a serial protocol in user space program to test reception algorithm. The protocol is similar to UART protocol but frame format is different. The duration of 1 bit is 114,46 us. In my main function I'm creating two threads. Tx for simulating transmitting data and Rx for reception data. For measure time I use create_timer() function and signals. Each thread has its own timer and signal handler. Tx timer uses SIGUSR1 and Rx timer uses SIGUSR2. Tx thread sets the global variable and Rx reads it.
The timers are set to sample with 114,46 us period. When they reach this value signal handler should set the flag. Flag is check in thread and some operation are made. When I set the timers period for longer time (100 ms) everything works fine but when I change it to default value (114,46 us) the Rx thread doesn't receive the proper data. I am wondering if the 114,46 timer period is possible to simulate in user space? Whether the time will give me the proper resolution ? Theoretically it should provide 1 ns resolution.
I understand that GNOME uses GTK+. So what KDE is using?
View 1 Replies View RelatedI'm struggling with a C# program to read binary records from a database. The records were created with Borland Delphi. Error: You cannot use fixed size buffers contained in unfixed expressions. Try using the fixed statement.
View 1 Replies View RelatedI want to declare an array with fixed size and initialize all the elements to zero. i want all elements of x to be zero and i dont know how to specify the size of array. also i have problem in comparing values in loops. my script is as follows:
i=0
let k=0
declare -a x
for U in ${S[@]}
do
for (( T=1276082023 ; $T -le 1276082139 ; (( T++ )) ))
[Code]...
I just installed fedora12 with seLinux active and OpenOffice:
Code:
# rpm -qa | grep openoffice
openoffice.org3-base-3.1.1-9420.i586
[code]....
I have a problem. This class is a base class for a basic enum handler:
Code:
#define ENUMOBJECT_BEGIN_ELEMENTS enum Element {
#define ENUMOBJECT_END_ELEMENTS ElementCount, DefaultElement, NoElement };
[code]...
If I have an array which its size is based on the user input, from some material, I need to use malloc function to allocate memory for that array what is known dynamic array. Don't forget to free it.hat's fine, however, I like to try things out even I know the program will crash.I have written some test program on my Mac using C language like this:int width = 0;//get user input, and assign the input value to width, for example, 3char * array_var[width];and width is an int, its value will be assigned by the user input. The point is, this program work as expected, for example, in command line, I input 3, then array_var length is 3, its size is 3 * sizeof(char *).
View 1 Replies View RelatedI am trying to understand working of pci_resource_start function So I browsed code via cscope and searched for string pci_resource_start and got following in pci.h
Code:
#define pci_resource_start(dev, bar) ((dev)->resource[(bar)].start)
I am not able to understand how does this above macro works. How does it above macro gets appropriate base address register in configuration space?
We all know linux kernel base layer is made up of structures, in which every object of kernel is well defined. Structure members correspond to object properties required to define object behavior.
For example if we take case of File system.It composed of four objects , superblock objects, inode objects, file objects and dentry object.Each having well defined structure which is being operated by system call handler and by system call service routine in the kernel mode.
Now my question is even in kernel mode we do not have some mechanism by which we can get access to pointer of these structures.We have some macro.
If I want to manipulate structure on my on way, or performing some more operation defined by me.For example after the crash of Hard Disk Drive, having ext2/3 file system, If i want to know all the inode pointers, and block details.
Can I have some way out to do desired operation ??
mechanism to operate on these base label structures, even in kernel mode ..
I have a router that is 1000 Base T and two computers each with ethernet cards that support 1000 Base T. All are equipped with Cat 5e cable. Before I had a router that only went up to 100 Base T and I would setup one box with linux running proftpd. On the other box,I would use win xp pro and use firefox to ftp into the other box and download a file. Download speeds went up to 11.2 MB/sec. Now when I switched routers, I expected something like 120 MB/sec but I'm only getting 5.3 MB/sec. What do I need to change?
View 12 Replies View RelatedCode:
#include <iostream>
using namespace std;
[code]...
I'm just messing around trying to create a script that will give me a menu driven method of selecting a file from a directory. After doing some searching around on the web, I found that the "dialog" command might be able to provide what I need, but I'm not sure exactly if what I want is possible.
I was messing around with the --menu option and am getting pretty close, but not exactly what I want. Here's a snip of what I've been working with:
Code:
This gets me the results I want for the first option in the list, but the rest comes out a bit weird, as it's taking the directory contents and applying to the "tag" field as well. In fact, if there wasn't a need for the tag field, it would probably be working exactly as I want it to.
I plan on messing around a bit more to see if there is a workaround, but figured I'd post this just in case someone else had accomplished something similar. Essentially, this will be embedded in a script where each file in my $DIR variable will show in the menu and the selected file will end up in a variable for later use.
My script.
This is may script:
Code:
Problem: Output file doest not exclude the values in grep -av
I'm using gmake (v3.81) to build some c executables. As the first step in the process I run the files through a preprocessor (for embedded SQL). The preprocessor completes successfully, but the gmake reports an error and discontinues buiding the remaining dependencies...
make *** [myfile.c] Error 4
which (according to /usr/include/asm-generic/errno-base.h) means "interrupted System Call". My preprocessor doesn't raise any signals, so I'm not sure what's causing this error.
I want to change linux scheduling algorithm for some of my processes but when I click on processes in ksysguard and click renice project, all of the processes use normal level cpu scheduling. Why is it such a thing and there is no priority?
View 2 Replies View Relatedis linux kernel is priority preemptive kernel?if it is. where it is using round robin scheduling algorithm?when processes are scheduled for the processor process will be allocated as which sechudling alogorithm?
View 1 Replies View Related