| Title | Posted By | Posted Date |
| Simple Home Security Monitoring Project | Vishnu | 23 Nov 2009 |
This project is a standalone simple home security monitoring
project that will trigger a buzzer when the magnetic contact is opened. Magnetic contacts are usually NC (Normally Closed) and are used on doors and windows. They consists of two parts namely a magnet and a reed switch. When the reed switch is in close proximity to the magnet, the switch will close and vice versa. Usually the magnet is fitted to the door and the reed switch is fitted to the door frame in close proximity to one another such that w
|
| Melody Music Generation Project | Vishnu | 23 Nov 2009 |
The M348X series is a mask-ROM-programmed multi-instrument melody generator , implemented by CMOS technology. It is designed to play the melody according to the previously programmed information. The device also includes a pre-amplifier which provides a simple interface to the driver circuit. The M348X series is intended for applications such as toys, door bells, music box
, melody clock/timers and telephones.
This project based on the M348X IC is the electronic equivalent of a mechanical music box. It
|
| OIL ZAPPER – AN ECO-FRIENDLY TECHNOLOGY | Raghavendra | 23 Nov 2009 |
Oil emancipation intimidate public health, safety
and taint ingestion water, causes fire and explosion peril, diminishes water quality, conciliate agriculture and obliterate recreational areas. Oil spills impairs the environment by killing biota, wild and aquatic life, annihilating habitat and food, and producing toxic effects in organisms and ecosystems. If single-handed, habitually the effects can persist for years and even decades. As a result, need provokes for more cost-effective alternatives to conve
|
| digital clock using PIC16F84A | anup | 23 Nov 2009 |
i want to make a desk clock that would show both the time and date. I have a preference for LED displays as they are bright and give a large display. The requirements are:
? Use LED 7 segment displays.
? Display both the time and date at the same time.
? Buttons to set the time and date.
? Take care of leap years.
? fit in a small red translucent box.
A digital clock is a type of clock that displays the time digitally, as opposed to an analog clock, where the time is displayed by hands. Digita
|
| railway crossing light using 555 timer | anup | 23 Nov 2009 |
This project shows how to make a working railway crossing which is activated by the train, making the amber light come on first followed by the flashing red lights. The train then cancels the lights.
A magnet under the train operates reed switches positioned on the track. The trigger reed switch starts the sequence by switching on the amber light, a few seconds later the two red lights start to flash. When the train has passed the level crossing it operates the cancel reed switch which switches off the lig
|
| Red/Black Trees Java | Jackson Joseraj | 21 Nov 2009 |
These are Red/Black Trees: with the following properties.
1)Every node has a value.
2)The value of any node is greater than the value of its left child and less than the value of its right child.
3)Every node is colored either red or black.
4)Every red node that is not a leaf has only black children.
5)Every path from the root to a leaf contains the same number of black nodes.
6)The root node is black.
An n node red/black tree has the property that its height is O(lg(n)). Another important propert
|
| Splay trees | Jackson Joseraj | 21 Nov 2009 |
Splay trees, or self-adjusting search trees are a simple and efficient data structure for storing an ordered set. The data structure consists of a binary tree, with no additional fields. It allows searching, insertion, deletion, deletemin, deletemax, splitting, joining, and many other operations, all with amortized logarithmic performance. Since the trees adapt to the sequence of requests, their performance on real access patterns is typically even better. Splay trees are described in dozens of text books a
|
| Greedy algorithms | Jackson Joseraj | 21 Nov 2009 |
"Greedy algorithms work in phases. In each phase, a decision is made that appears to be good, without regard for future consequences. Generally, this means that some local optimum is chosen. This 'take what you can get now' strategy is the source of the name for this class of algorithms. When the algorithm terminates, we hope that the local optimum is equal to the global optimum. If this is the case, then the algorithm is correct; otherwise, the algorithm has produced a suboptimal solution. If the best answ
|
| Kruskal Algorithm Java | Jackson Joseraj | 21 Nov 2009 |
The Kruskal Algorithm starts with a forest which consists of n trees.Each and everyone tree,consists only by one node and nothing else.In every step of the algorithm,two different trees of this forest are connected to a bigger tree.Therefore ,we keep having less and bigger trees in our forest until we end up in a tree which is the minimum genetic tree (m.g.t.) .In every step we choose the side with the least cost,which means that we are still under greedy policy.If the chosen side connects nodes which belon
|
| The Prim Algorithm Java | Jackson Joseraj | 21 Nov 2009 |
INPUT :n,c[e(ij)],i,j belonging to {1,...,n}.
OUTPUT :p(j) j=2,...,n (pointer of peaks j father in the T tree).
STEPS
1):(initializations).
O={1} (V(1) root of the T tree).
P={2,...,n}
For every j belonging to P :e(j):=c[e(j1)] , p(j)=1
( all peaks connected to the root.By definition of the cost function:e(j)=infinite when V(j) does not connect to V(1).).
2)Choose a k for which e(k)<=e(j) for every j belonging to P.In case of tight choose the smaller one.
Exchange the O set with the set pr
|
| Floyd's algorithm | Jackson Joseraj | 21 Nov 2009 |
Our next algorithm for computing the shortest distances of a graph is based on an algorithm design technique called dynamic programming. This is where smaller, less difficult subproblems are first solved before the full problem is solved.
Floyd's algorithm computes a distance matrix from a cost matrix in time . Thus the running time is comparable to Dijkstra's algorithm since we would have to run Dijkstra's algorithm times to calculate all entries of the distance matrix. However, as can be seen, the
|
| Dijkstras Algorithm | Jackson Joseraj | 21 Nov 2009 |
This algorithm finds the routes,by cost precedence.Let's assume that every cost is a positive number,and assume the same in the cost function c as in 5.4 paragraph.G may be a graph,a digraph,or even a combined one,which means that only some of its sides are directed.If we consider G as digraph,then every other case is fully covered as well since a no directed side can be considered a 2 directed sides of equal cost for every direction.
The idea for this algorithm is based on the fact that every m.r contai
|
| Automatic TCP buffer tuning | cool | 21 Nov 2009 |
It is Tuning of buffers to simultaneous connections.
|
| steel making | saikumar | 21 Nov 2009 |
gives details about the process of steel making
|
| Estimation of D.O. in water sample | Shivaprasad shetty M | 21 Nov 2009 |
DETERMINATION OF DISSOLVED OXYGEN PRESENT IN A
GIVEN SAMPLE OF WATER
|
| ESTIMATION OF SODIUM IN A GIVEN SAMPLE OF WATER | Shivaprasad shetty M | 21 Nov 2009 |
FLAME PHOTOMETRIC ESTIMATION OF SODIUM IN A GIVEN
SAMPLE OF WATER
|
| IFSS | C.Meenakshi sundaram | 21 Nov 2009 |
IFSS
|
| Dijkstra's algorithm Java | Jackson Joseraj | 21 Nov 2009 |
Dijkstra's algorithm, when applied to a graph, quickly finds the shortest path from a chosen source to a given destination. (The question "how quickly" is answered later in this article.) In fact, the algorithm is so powerful that it finds all shortest paths from the source to all destinations! This is known as the single-source shortest paths problem. In the process of finding all shortest paths to all destinations, Dijkstra's algorithm will also compute, as a side-effect if you will, a spanning tree for t
|
| Heap Sort Java | Jackson Joseraj | 21 Nov 2009 |
Many applications require that we process records with keys in order, but not necessarily in full sorted order and not necessarily all at once. Often, we collect a set of records, then process the one with the largest key, then perhaps collect more records, then process the one with the current largest key, and so forth. An appropriate data structure in such an environment supports the operations of inserting a new element and deleting the largest element. Such a data structure is called a priority queue. U
|
| Queue Implementation Java | Jackson Joseraj | 21 Nov 2009 |
In terms of how thread pools are actually implemented, the term "thread pool" is somewhat misleading, in that the "obvious" implementation of a thread pool doesn't exactly yield the result we want in most cases. The term "thread pool" predates the Java platform, and is probably an artifact from a less object-oriented approach. Still, the term continues to be widely used.
While we could easily implement a thread pool class in which a client class would wait for an available thread, pass the task to that thr
|
| Radix Sort | Jackson Joseraj | 21 Nov 2009 |
This section presents a sorting algorithm known as least-significant-digit-first radix sorting . Radix sorting is based on the bucket sorting algorithm discussed in the preceding section. However, radix sorting is practical for much larger universal sets than it is practical to handle with a bucket sort.
Radix sorting can be used when each element of the universal set can be viewed as a sequences of digits (or letters or any other symbols). For example, we can represent each integer between 0 and 99 as
|
| Breadth First tree Traversal | Jackson Joseraj | 21 Nov 2009 |
This is a type of tree traversal which is used in most of the areas
|
| Doubly Linked List | Jackson Joseraj | 21 Nov 2009 |
Linked list is a data structure that allows sequential access to the elements. A list lays out the sequence in a row, starting at the first element (called front) and proceeding in successive order to the last element (called back). Each element in a list contains Links that identify both the next and the preceding item in the sequence. We focused on the fact that the Linked list provides efficient operations tot insert and delete an element at any position in the sequence. This was very important, beca
|
| Generic tree | Jackson Joseraj | 21 Nov 2009 |
Binary Trees are quite complex, and most of the time, we'd be writing a unique implementation for every specific program. One thing that almost never changes though is the general layout of a binary tree. We will first implement that general layout as an abstract class (a class that can't be used directly), and later write another class which extends our layout class.
Trees have many different algorithms associated with them. The most basic ones are the traversal algorithms. Traversals algorithms are d
|
| Schedulin Algorithm | Jackson Joseraj | 21 Nov 2009 |
It is one of the oldest, simplest, fairest and most widely used scheduling algorithms, designed especially for time-sharing systems. A small unit of time, called timeslice or quantum, is defined. All runnable processes are kept in a circular queue. The CPU scheduler goes around this queue, allocating the CPU to each process for a time interval of one quantum. New processes are added to the tail of the queue.
The CPU scheduler picks the first process from the queue, sets a timer to interrupt after one qua
|
| Bubble Sort Java | Jackson Joseraj | 21 Nov 2009 |
Bubble sort is an inefficient but very simple - perhaps even the simplest - sorting algorithm, which uses one straightforward rule for its work: while there remains an ith element that is greater than the (i+1)th element, swap them.
Thus, elements with greater values will 'float' to the end of the array, like bubbles.
|
| data mining | bobb | 20 Nov 2009 |
an approach on data mining
|
| Magic remover cloth. | Surya Kiran | 20 Nov 2009 |
Make the magic remover cloth which will remove all the scratches on your favorite CDs and LCD displays.
|
| How to make a hollow penny. | Surya Kiran | 20 Nov 2009 |
Using only one common chemical, completely remove the zinc core from a modern US penny, leaving just a thin copper shell! An amazingly simple, cheap, and stunning experiment
|
| Instant Hot Ice! | Surya Kiran | 20 Nov 2009 |
This is a simple experiment turning a liquid to a solid with just a touch. Just find some sodium acetate and water to start. Boil it, then chill it, then touch it! And in an instant you have ice! If you want to be creative (or you're just bored on a Sunday afternoon) you can pour some ice sculptures to amaze children of all ages.
|
| mobile healthcare | naveen | 20 Nov 2009 |
Abstract on Mobile Health Care.
|
| Predictive Job Scheduling in a Connection Limited System using Parallel Genetic Algorithm | Jackson Joseraj | 20 Nov 2009 |
Job scheduling is the key feature of any computing environment and the efficiency of computing depends largely on the scheduling technique used. Intelligence is the key factor which is lacking in the job scheduling techniques of today. Genetic algorithms are powerful search techniques based on the mechanisms of natural selection and natural genetics.
Multiple jobs are handled by the scheduler and the resource the job needs are in remote locations. Here we assume that the resource a job needs are in a
|
| Distributed Database Architecture for Global Roaming in MANETs: | Jackson Joseraj | 20 Nov 2009 |
The next-generation mobile network will support terminal
mobility, personal mobility, and service provider portability,
making global roaming seamless. A location-independent personal
telecommunication number (PTN) scheme is conducive to implementing
such a global mobile system. However, the nongeographic
PTNs coupled with the anticipated large number of mobile users
in future mobile networks may introduce very large centralized
databases. This necessitates research into the design and performance
o
|
| Mobile Agent | naveen | 20 Nov 2009 |
Abstract regarding Data mining in nobile
|
| Bulk Billing System | Jackson Joseraj | 20 Nov 2009 |
The Software System being proposed will cater to the functional requirements of Bulk Billing System for North Delhi Power Limited. The software will play an “essential role in smooth handling of activities like Connection Management, Billing & Payments, Grievances and Theft Handling”. This will ensure smooth operations and benefits such as increased efficiency of Personnel, Better Response for the Consumers, Accuracy and Transparency of Data, Quick Retrieval and Better Management Decisions.
BBS will hav
|
| Nicro Protocol based Development of Mobile Ad Hoc Networks | naveen | 20 Nov 2009 |
As Communication are an integral part of large Distributed systems they form the basis for operating systems and applications.So this revolution has made the study in communication techniques resulting more effective an advanced.So this results in customization of communication systems.
|
| Tree Map Java | Jackson Joseraj | 20 Nov 2009 |
This program clearly defines the operation in ht tree map
|
| Stack Implementation Java | Jackson Joseraj | 20 Nov 2009 |
Stack Implementation this program performs the stack datastructure operations
|
| Queue Implementation | Jackson Joseraj | 20 Nov 2009 |
This program simply demonstrates the queue datastructure operation
|
| Predictive Job Scheduling Using Parallel Genetic Algorithm | Jackson Joseraj | 20 Nov 2009 |
Predictive Job Scheduling Using Parallel Genetic Algorithm
This project simply demonstrates the comparison between FCFS and Genetic Algorithm
|
| Search engine in java | ankur | 20 Nov 2009 |
search engine in java v1.0
|
| Snake Game Using C language | Sree.... | 18 Nov 2009 |
Its a game a snake is moving you have to use it to eat some food. As you eat food your tail becomes longer and point count.
|
| working | nitin | 14 Nov 2009 |
starting with the paper work and got it complete on fine ENTER.
|
| cable account management In .Net Technologies | Syam.S | 13 Nov 2009 |
This software is developed in .Net technologies .
Aim:- TO manage all account need of a cable operator.
|
| BIOTECHNOLOGY PROJECT ON CANCER | Jestin Francis | 13 Nov 2009 |
Aberrant genetic elements have a crucial role in the induction and promotion of malignant neoplasia. The present study targeted the identification of significant molecular alterations which led to carcinogenesis in the oral cavity.
The study comprised the comparison of gene expression of both the matched normal and the tumor tissue. The differentially expressing genes were identified by differential display developed by Peng Liang and Arthur Pardee. One of the cDNAs showed homology to a gene that encodes
|
| Sum of Sinusoidal Signals | karthik | 13 Nov 2009 |
To verify Sum of Sinusoidal Signals using MATLAB
|
| Determination of Dissolved Oxygen in water sample | Prabha Kishore | 12 Nov 2009 |
To determine the DO present in a given sample of water
|
| mobile charger | hemant kumar salvi | 12 Nov 2009 |
circuit diagram of mobile charger
|
| Estimation of Cu in Brass -Iodometric method | Prabha Kishore | 12 Nov 2009 |
To estimate percentage of copper in the given sample of brass , using a standard sodium thiosulphate solution.
|
| Estimation of CaO in cement solution | Prabha Kishore | 12 Nov 2009 |
Aim:
To determine calcium oxide, CaO in the given cement solution, by EDTA method.
|