Movie Review: Sunny Leone alone can’t turn it on in Jism 2

 

 

There is a palpable buzz around Jism 2 given it stars a porn star in a leading role — Indo-Canadian Sunny Leone, a possible first in a film industry that is extremely male-star-driven and is just warming up to married actresses in leading parts of late.
Sunny of course, is not only an international porn star, but she is a married girl with, in her own words, bisexual leanings. And Google will tell you everything about her, inside-out quite literally. Mahesh Bhatt who has written the film and his daughter Pooja who has directed it, need to be lauded for signing Sunny and breaking the archaic rules Bollywood swears by. Just for that, I’d say Bollywood is making progressive strides in the real world, never mind its regressive plot lines in half the films that release all year round!

The excitement around Jism 2 is just that much more amongst men, as was proved by the women-men ratio at the theatre I watched the film in this morning – it was a full house with the men outnumbering the female audience at the screening.
Sunny Leone makes for an arresting and stunning opening sequence in the film — the whole porn star vibe consuming the length and breadth of the screen. She introduces herself as Izna, a porn star, in a voice dubbed to sound like her, but fails to match her spanking hot body and lacks the sexy drawl that would accompany a seductress. Izna goes on to ignite sexual warfare among men just by being her sexual self — Kabir Wilson (Randeep Hooda) a honest ex cop turned assassin on the loose in Galle, Sri Lanka and Ayaan Thakur (Arunoday Singh) an Indian Intelligence Officer.
It is unclear when Izna turned into a porn star – before she met Kabir or after. The film does not depict her filming any such pornographic activity though. Her sexual dalliance with Ayaan confuses the plot further as to whether she just enjoys casual sex with strangers in plush hotel rooms after a hard day’s work faking it for the porn cameras or she’s a hooker on the side.
The entire premise of the film is terribly loose — just showcasing a Penthouse Pet’s acting talent – it is as weak as the French kissing and simulated love-making sequences in the film. Every seductive scene is shot in a picturesque and artistic manner, but leaves you wanting nothing! And that, for a film titled Jism 2, starring a porn star, does not bode well! Katrina Kaif gyrating crazily on the item number, Chikni Chameli in Agneepath, is far sexier to watch than Izna wearing red lingerie, riding a fully clothed Kabir. Of course by Indian Censor board standards, Jism 2 has “bold” scenes, but by the audience standards, they are weak and tepid and fail to seduce. The plot line is so dated that you miss the villainy of Ajit and his loin and Mona moll acts.
The refined Urdu dialogues are verbose and are in sharp contrast to the modern aspects of the film, the porn star vocation of the heroine being the main one. Some of them hit home run though like “Har jism ki expiry date hoti hai” and “Jo aadmi ye sochta hai ki woh kal khush hoga, woh kabhi khush nahi ho sakta”. But this one “Jo aadmi apne mulk se wafadari nahin kar saka woh is jism ka wafadar hai” is a hoot. It makes no sense and warrants laughter, laced with sarcasm, at best.
The edit is a bit jumpy too and in some scenes the characters, namely between Ayaan and Guru (Arif Zakaria) from the Intelligence team and between Ayaan and Izna, go into hysterical screams and shouts for no apparent reason. The characters are not well-etched out and their graphs move at whim and fancy. There are many questions left unanswered in a screenplay that rides on the sexual presence of a famous porn star, but that’s simply not entertainment. The music though, is melodious.
Sunny Leone has a striking screen presence and a natural comfort with the camera, but only till she’s strutting her stuff and doing her thing. The minute she has to act — read express joy, anger and anguish or any such everyday human emotion, she is no actress. There are no dance routines in the film either so her dancing capabilities did not shine this time round. The film does justice to her endearing charm on screen, but it does not expose her real talents —and I am not talking about acting here because that simply is not her forte. But at least she tried and made a film in Bollywood and that’s not easy.
Randeep Hooda is fantastic in his role as the crazy patriot of the country and passionate lover of Izna. He tackles the part well, despite knowing the plot line was terribly askew. Arunoday Singh is easy on the eyes, but his sudden shrieks and volatile enactments in some scenes are jarring.
Jism 2 does not seduce you into its world at all and that is not Sunny Leone’s fault or the fact that she is no great actress, for she has already seduced the world at large.

 

Read more »

Saina Nehwal through to semis

 

Saina Nehwal on Thursday created history as she became the first Indian shuttler to reach the semifinals of the Olympics after notching up a hard-fought straight-game victory over Tine Baun of Denmark in the women’s singles quarterfinals at the London Games. 

Fourth seeded Saina edged past fifth seed Tine 21-15, 22-20 in a 39-minute match at the Wembley Areana to set up a clash with the current world No 1 and World champion Yihan Wang of China in the semifinals, whom she hasn’t beaten once in her last five encounters. 

With this win, Saina bettered her quarterfinal finish at the Beijing Games four years ago and also excorcised the demons of that painful defeat to Maria Kristin Yulianti of Indonesia. 

The world No 5 Indian had to toil hard against the two-time All England Champion Tine, who matched her strokes but was a tad erratic, which proved to be her bane in the quarterfinal match.

Saina was very precise with her strokes, while Tine was erratic initially and it allowed the Indian to lead 11-7 at the break. 

After the breather, Saina slowly mixed her strokes to move into the game point at 20-12 with a short smash but she committed some unforced errors and a few judgemental mistakes on her part allowed the Dane to save three game points. Saina finally pocketed the first game with a smash which Tine netted.

In the second game, Tine opened up a slender 3—0 lead and extended it to 10—7 but Saina reeled off four straight points to lead 11—10 at the break once again. 

Saina tried to exploit the length of the court and started combining lifts and clears with drops and net-shots but Tine was up for the job as she caught up with Saina at 15-15 and even managed to earn three game points at 20-17. 

But Super Saina was not the one to take it lying low as she executed a cross court smash to move to 18-20. 

She also pocketed the next point when her stroke was judged ‘in’ by the line-umpire, much to chagrin of Tine, who thought it was out and was celebrating her comeback by pumping her fists. 

After that, Tine committed to three unforced errors as Saina burst into celebration. 

Keywords: badminton, Saina Nehwal

 

Read more »

IMMAGE PROCESSING AVI MEDICAL IMAGE CONTROL

IMMAGE PROCESSING AVI MEDICAL IMAGE CONTROL

ABSTRACT

The various Medical images acquired directly from various instruments are in the AVI format, which reduces the easy control of image display without conversion to medical image standard, that is the DICOM format. The purpose of this project is to develop software to handle online data acquisition from medical equipments like Ultra Sound machine, control the display rate, convert the AVI image acquired from the Medical equipment directly to DICOM image with patient’s detail’s got from the user, freeze the AVI image frame of interest, convert the freezed AVI frame to Bitmap image, convert this Bitmap image to DICOM image with patient’s details. This software is highly reliable, efficiently handles memory and very user friendly.

Medical equipments like Ultra Sound, CT etc… have images at their output in the AVI file format, which are acquired with the respective probes. These AVI images acquired are stored. The software captures this AVI image, displays them frame-by-frame in succession and converts them to DICOM image with required patient’s details obtained from the Specialist during conversion. The frame of interest can be freezed and converted to Bitmap image, which can also be viewed on a separate window with options to brighten, darken, change the color combination, invert the image and restore the image.  The converted DICOM image can be viewed on any Standard DICOM viewer. Mostly all the DICOM viewer will have provision to view the patient’s details entered during conversion.

OBJECTIVE

To help the doctor view a particular frame of interest captured from a medical equipment which is usually an AVI image and to enable the doctor to manipulate the frame for correct diagnosis and  provide efficient treatment.

                                    

MEDICAL IMAGING

From Ophthalmology and radiology to orthodontics, image processing touches the medical field in many ways. The ability to visualize and interactively manipulate three-dimensional objects derived from sets of two-dimensional MRI and CAT scan (now shortened to CT scan) slices has changed the way we deal with medicine. MRI stands for nuclear magnetic resonance imaging.

     DISADVANTAGE OF EXISTING SYSTEM

      There is no AVI viewer that facilitates the doctors to manipulate the medical image captured from the equipment. All AVI viewers available just displays the frames in predetermined time intervals and time of display of each frame cannot be controls as per the physicians requirement. Frame at a particular given time can be displayed but, it wont help the doctor capture the exact frame that is required to find out the exact defect.

    PROPOSED SYSTEM

This system will prove to be user friendly as this captures the medical AVI image, grabs the required header information, converts them to DICOM file format and stores it along with the patient’s details, physicians details, etc… so that any physician can diagnose the patient without any other further details. Moreover there are many DICOM viewer available with many image processing provision.

Steps To Control Image

Ø  Capture the image from an medical equipment which will normally be in AVI (Audio/Video Interleaved) format.

Ø  Analyze the header details of the AVI image.

Ø  Copy the required header details into the DICOM header format.

Ø  If the length of the header is greater than zero it is considered to be valid.

Ø  Find the start of frame in the AVI file, check for its length, if data is valid copy the frame into DICOM file else skip the frame.

Ø  View the DICOM file in appropriate DICOM viewer.

IMAGE FILTERING        

It is used to extract great amounts of information from our images – information to which we don’t have access normally

Ø  Edge

enhancement and sharpening filters will bring out details in objects that we would not otherwise have noticed.

Ø Averaging filters will smoothen the rough and jagged edges in our images, making them more appealing to the eye.

Ø Basic Statistical filter will remove much of the noise found in our CCD scanned images.

Ø Gradient analysis will help us visualize your image in a whole new light, greatly enhancing edges – allowing us to create interesting embossed image effects.

Ø Special filters can help us identify certain objects within an image.

Ø Low Pass filter passes on lower frequency components of an image, while attenuating or rejecting the higher frequency components.

Ø High Pass Filter is used to amplify the high-frequency details found in an image, while the integrity of low-frequency detail of the image remains.

       IMAGE PROCESSING:

            Images are a vital and integral part of every day life. On an individual, or person-to-person basis, images are used to reason, interpret, illustrate, represent, memorize, educate, communicate, evaluate, navigate, survey, entertain, etc. We do this continuously and almost entirely without conscious effort. As man builds machines to facilitate his ever more complex lifestyle, the only reason for NOT providing them with the ability to exploit or transparently convey such images is a weakness of available technology.

            Applied Image Processing, in its broadest and most literal interpretation, aims to address the goal of providing practical, reliable and affordable means to allow machines to cope with images while assisting man in his general endeavors.

By contrast, the term ‘image processing’ itself has become firmly associated with the much more limited objective of modifying images such that they are either:

a.                   Corrected for errors introduced during acquisition or transmission (‘restoration’); or

b.                  Enhanced to overcome the weakness of human visual system (‘enhancement’)

As such, the discipline of ‘pure’ image processing may be succinctly summarized as being concerned with

‘ a process which takes an image input and generates a modified image output ’

Clearly then, other disciplines must be allied to pure image processing in order to allow the stated goal to be achieved. ‘Pattern classification’, which may be defined simply as

‘ a process which takes a feature vector input and generates a class number output’

Confers the ability to identify or recognize objects and perform sorting and some inspection tasks. ‘Artificial intelligence’, which may be defined as

‘ a process which takes primitive data input and generates a description, or understanding or a behavior as an output’

            Confers a wide range of capability from description, in the form of simple measurement of parameters for inspection purpose, to a form of autonomy borne out of an ability to interpret the world through a visual sense.

Theses disciplines have been evolving steadily and independently ever since computer first became available, but only when they are all effectively harnessed together do machines acquire anything like the ability to exploit images in the way that humans do.

In particular, the marriage of one, or both, of the first two disciplines with artificial intelligence has given birth to the new, image specific disciplines, namely ‘image analysis’, ‘scene analysis’ and ‘image understanding’.

Image analysis is normally satisfied with quantifying data about objects which are known to exist within a scene, or determining their orientation, or recognizing them as one of a limited set of possible prototypes. As such it is largely concerned with the development of the 2-D applications, there is an undoubted need to extend this activity to the description of 3-D relationships between objects within a 2-D view of the real-world scene.       

Scene analysis was the original term coined to describe this extension of image analysis into the third dimension. Such work flourished in the 1960s and was concerned with the rigorous visual analysis of three-dimensional polyhedra (the so-called ‘blocks-world’), on the mistaken premise that it would be a trivial matter to extend these concepts to the analysis of natural scenes. The work was finally abandoned in the late 1970s when it was realized that the exploitation of application-dependent constraints was no way to research general-purpose vision systems.

Consequently, the term scene analysis fell into disuse only to be replaced by that of image understanding, which is more fundamentally based upon the physics of image formation and the operation of human visual system. It aims to allow machines to operate with ease in complex natural environments, which feature partially occluded objects or, ultimately, previously unseen objects.

A broad overview of the literature in the field of machine perception of images suggests the existence of two distinct ‘camps’ whose followers, while sharing common roots, set out to achieve fundamentally different objectives. We have chosen to label these camps as ‘computer vision’ and ‘machine vision’, and feel that they are essentially distinguished by their different approaches to the use of artificial intelligence and the degree to which it is employed. (‘Robot vision’ was also a popular alternative at one time, although it appears to be slowly falling into disuse, perhaps because of rather unfortunate science-fiction connotations.)

‘Computer vision’ is ultimately concerned with the goal of enabling machines to understand the world that they see, in real-time and without any form of human assistance. Thus, application-specific constraints are rejected wherever possible as the world is ‘interpreted on-line’. The complexity of this task is easily under-estimated by those who take human vision for granted, but it is fraught with many immensely difficult problems, and seriously hampered by inadequate processing power.

‘Machine vision’ on the other hand, is concerned with utilizing existing technology in the most effective way to endow a degree of autonomy in specific applications. The universal nature of the computer vision approach is sacrificed by deliberately exploiting application-specific constraints. Thus knowledge about the world is ‘pre-complied’, or engineered, into machine vision applications in order to provide cost-effective solutions to real-world problems.

DIGITAL IMAGE ACQUISITION:

            The general goal for image acquisition and processing is to bring pictures into the computer domain of the computer, where they can be displayed and then manipulated and altered for enhancement. Four processes are involved in image acquisition:

Ø    Input

Ø    Display

Ø    Manipulation

Ø    Output

‘The transformation of optical image ata into an array of numerical data which may be manipulation by a computer, so overall aim of machine vision may be achieved’

In order to achieve this aim three major issues must be tackled they are:

Ø    Representation

Ø    Transduction (or sensing)

Ø    Digitizing

ARITHMETIC OPERATIONS ON IMAGES:

            The arithmetic operations are absolutely essential for calibration and flattening of the image in certain applications, particularly in those applications that have a low signal. They are helpful tools for enhancing an image. The basic arithmetic operations on images are:

Ø    Addition

Ø    Subtraction

Ø    Multiplication

Ø    Division

GEOMETRIC TRANSFORMATIONS:

Many times, to combine images taken at different times or by different sources, we have to translate, rescale, and rotate the images. It is usually important that the images match spatially. Without proper registration of images before combination passes, most techniques for image enhancement will actually degrade the images, losing important or interesting information. The basic geometric transformations are:

Ø    Translation

Ø    Scaling/Zooming

Ø    Resampling

Ø    Rotation

Ø    Flipping

ADVANCED GEOMETRIC TRANSFORMATIONS:

            Have you ever wondered how those interesting special effects that you see in movies and commercials were made? How in an image can one person transform into another person or even an animal or another entity? The two advanced geometric transformations are:

Ø    Warping

Ø    Morphing

Warping is a digital technique of distorting an image hence also called geometric distortion. It has been used to create sophisticated special effects I movies and television shows and in recent times in a plethora of television commercials. They all use exotic computers and custom software.

            Morphing is an extension of warping and it is the complete and smooth transformation from one image to another. This technology, which traditionally has been prohibitively expensive, with a little effort, can now be done on the desktop computer very cheaply. Essentially, morphing involves two steps of warping, with a spline interpolation between the initial images and the resultant image. Morphing has you match key features such as the eyes, nose, mouth and other details on both the exact same graphic space. Finally, a weighted average is made of each step of transformation of the two wraps. For instance, to morph a truck into a train, the train is first warped into the same shape as the truck so that certain specific points, the windshields, headlights and grills match as closely as possible.

IMAGE PREPOCESSING:

            Image preprocessing seeks to modify and prepare the pixel values of a digitized image to produce a form that is more suitable for subsequent operations within the generic model. There are two major branches of image preprocessing, namely

Ø    Image Enhancements

Ø    Image Restoration

Image enhancement attempts to improve the quality of image or to emphasize particular aspects within the image. Such an objective usually implies a degree of a degree of subjective judgment about the resulting quality and will depend on the operation and the application in question. The results may produce an image, which is quite different from the original, and some aspects may have to be deliberately sacrificed in order to improve others.

The aim of image restoration is to recover the original image after ‘known’ effects such as geometric distortion within a camera system have degraded it or blur caused by poor optics or movement. In all cases a mathematical or statistical model of the degradation is required so that restorative action can be taken.

Both types of operation take the acquired image array as input and produce a modified image array as output, and they are thus representative of pure ‘image processing’. Many of the common images processing operations are essentially concerned with the application of linear filtering to the original image ‘signal’.

REFERENCE:

Ø  Anil K. Jain (1989) ‘Fundamentals of Digital Image Processing’, Prentice-Hall, Englewood Cliffs, N.J.

Ø  Awcock G.W. & Thomas R. (1996) ‘Applied Image Processing’.

Ø  Sid Ahmed (1995) ‘Image Processing’.

Ø  William K. Pratt (1978) ‘Digital Image Processing’.

Ø  Christopher Watkins, Alberto Sadun, Stephen Marenka ‘Mordern Image Processing’.

Ø  Maher A. Sid-Ahmed ‘Image Processing’.

Ø  G.W.Awcock, R. Thomas ‘Applied Image Processing’.

Read more »

A sister’s guide on which rakhi to send on Raksha Bandhan

Chances are that your boss won’t give you a week’s leave for Raksha Bandhan and your home town isn’t a day’s journey away. Also, chances are that no matter how many times your brother had been a total jerk, tattled to your mother about you or made fun of your dress, glasses, friends or curls, you tend to miss him, especially at this time of the year when the shops at Crawford market are lined with colourful and various types of Rakhis.
You tend to recall all the bygone years when you were actually there to celebrate Raksha Bandhan with him and your family and remember many little anecdotes from the past when, he hadn’t been that annoying and pestering. And you feel like catching a train and going home right at this moment. Well, if you are good at making excuses call in sick and head towards the station. But if you aren’t that great at it and have a sneaky suspicion that your boss might find some uncanny association between your falling sick and Raksha Bandhan, it doesn’t mean you still can’t send him a Rakhi.

Infact, there are a host of websites that offer Rakhis online and will deliver it on your behalf. IndiaPlaza. com, RakhiGiftPortal.com, Jabong.com  are some sites which offer you plethora choices.  Websites such as  makemygitfz and archiesOnline.com are a good choice to pick out a rakhi gift for your brother.
Several courier services such as DTDC and DHL-Blue Dart have also launched various schemes especially for Raksha Bandhan. DTDC have introduced various rakhi boxes to deliver rakhis and Bluedart- DHL has come up with a unique ‘Rakhi Express’  which will allow you to send your Rakhis  in a special Rakhi envelope with a personalized greeting card.
Times of India reported that the postal department of Allahabad region had also organised designer water-proof envelope to send your Rakhis.
Now, that you know some how to send a Rakhi, here are some unique kind of Rakhis to chose from:
1. Batman Rakhis : If your brother is a The Dark Knight Rises fan, here is what, buy him a Batman Rakhi. It available for Rs 25 only.
2. Angry Bird Rakhis: These kind of rakhis are becoming increasingly popular.The price range is between 15-50.
3. Musical rakhis: If your brother likes Bollywood  music there are musical rakhis  which play tunes of popular Hindi songs.
4. Feng Shui rakhis :  Want your Rakhi to bring your brother good luck? Send him a Laughing Buddhas rakhi or a dragons rakhi.
5. Boutique Rakhis: Well, if you can spare a little more you can buy rakhis studded with pearls and crystals studded rakhis from boutiques.

Read more »

India Against Corruption supporters worry for Anna Hazare's health

NAGPUR: As anti-graft crusader Anna Hazare joined the fast in the national capital, his supporters in Nagpur raised concerns over his health. On Sunday, the biggest topic for discussion at RBI Square protest site was about the Gandhian's jumping into the thick of things, and the toll this current indefinite fast would take on his health.

City coordinator for IAC Ajay Sanghi said, "We were always worried about Anna's health and in fact even Arvind Kejriwal yesterday expressed a deep concern. Kejriwal said that after independence we lost Mahatma Gandhi and it took decades before Anna came on the scene. Now after Anna we do not know how long it will take to have a national icon."

The last agitation by Anna in December had to be cut short after his health took a turn for the worse. Also the dwindling crowd support for the agitation is said to have played a major role in IAC's decision to pull the plug back then. This time Arvind Kejriwal led from the front by sitting on an indefinite fast giving some breathing space to Anna. But as TOI had reported earlier the Gandhian was forced to join the fray after the government did not heed to his demands.

Even with Anna leading the agitation, now crowd support is still not reflecting at the ground level. Though there was a decent crowd turnout on Sunday, IAC Nagpur has decided to innovate in trying to spread Anna's message across. About a thousands posters will be put at tea stalls across the city so that when people come there, they will come to know about Anna's plans to tackle corruption. Sanghi said, "The poster will have details on how Anna will deal with graft, about our current problems in the country etc. The basic idea is to get people talking about the issue for a few minutes. We are also urging them to spare some time and join us at RBI Square and give support in writing."

IAC youth members have also planned to visit colleges, hostels and other educational institutes and talk to them about giving support to Anna's cause.

Read more »

the hot news

'Draft bill against manual scavenging with stricter provisions in monsoon session'

New Delhi : Even as actor-activist Aamir Khan Monday met Prime Minister Manmohan Singh to raise the age-old issue of manual scavenging the government said it is taking up the matter as "top priority" and a draft bill with stricter provisions on eradicating the dehumanising practise and rehabilitating the people involved is to be introduced in the monsoon session of parliament. According to Census 2011, there are around 700,000 manual scavengers in the country engaged in the task of removing and transporting night soil. Of these, 586,067 are in the rural areas and 2,08,323 in the urban areas. "Yes, we know it persists, and we are taking up this matter as top priority. The draft for the Prohibition of Employment as Manual Scavengers and Their Rehabilitation Bill, 2012 is under circulation to the concerned ministries and departments. We intend to introduce it in the monsoon session of parliament. Everything is in the process," Social Justice and Empowerment Minister Mukul Wasnik told IANS. "We are working out a survey of the manual scavengers in the country. Data on manual scavengers would be available soon," the minister added. Elaborating on the rehabilitation of scavengers, the minister said: "The rehabilitation scheme is being implemented through state channelizing agencies. Whenever a state government demands funds for rehabilitation programme, the amount will be sanctioned as per its proposal." According to Safai Karmachari Andolan (SKA), a voluntary organisation working for manual scavengers, the funds for rehabilitation have been almost tripled from Rs.1.36 crore (Rs.13.6 million) in 2007-08 to Rs.3.43 crore (Rs.34.3 mn) in 2010-11. Aamir Khan, who highlighted the issue in a recent episode of his popular television programme "Satyameva Jayate", met the prime minister and Wasnik over the issue Monday. Meanwhile, around 200 scavengers from across Maharashtra protested in Mumbai to demand an end to the pernicious practice. The protesters, led by a social group Campaign Against Manual Scavenging in Maharashtra, are demanding alternate and dignified jobs, decent housing and education. Highlighting their plight, Sumitra, a manual scavenger who hails from Nand Nagri, north Delhi, told IANS: "I don't have a choice. I'm at the absolute bottom of the society, the job came as a legacy. But I don't want my children to touch these baskets. During rains it is terrible doing this filthy job." According to the census, 23 lakh of the country's total population use dry or non-flush latrines and over a lakh defecate in open spaces. To government has enacted the Employment of Manual Scavengers and Construction of Dry Latrines (Prohibition) Act in 1993, according to which construction of dry latrines and employment of scavengers to clean it would invite imprisonment up to one year and a fine of Rs.2,000 or both. The Act has not been effectively implemented since its formulation 19 years ago. The National Advisory Council (NAC) headed by Congress president Sonia Gandhi had been stressing for years on the need to come up with a stricter law and Gandhi had also written to the prime minister in October 2010 to take immediate action. Stressing on the need for a stronger law, former NAC member Harsh Mander told IANS: "The 1993 law is weak, it needs to be replaced. The NAC has been stressing for a new law and a stronger bill to eradicate the inhuman practice, which persists in India despite being banned. We need a stronger law, as it is not just a sanitation issue, but a question of fundamental rights and dignity." The Delhi Commission for Safai Karmcharis says the proposed bill which is supposed to include emancipation of manual scavengers should include in its ambit all forms of sanitary workers such as sewage cleaners and septic tank cleaners. "Since sewer workers have to enter manholes filled with fermented faeces and are also at risk, they should be covered by the bill. This practice is still prevalent under official patronage at all levels. The new bill should emancipate sanitary workers of all levels," Harnam Singh, chairman of the Delhi Commission for Safai Karmcharis, told IANS. Accusing the government of not being serious about the issue, D. Raja, national secretary, Communist Party of India (CPI) told IANS: "Despite several legislations and an Act, manual scavenging continues in the country and is a national shame. This indicates the callousness of the government. Around 19 years ago, the government has created an Act and now it is saying they will introduce a bill. This is just a question of passing time." He also said the CPI had suggested that the government call a meeting of chief ministers of those states where manual scavenging is prevalent to work on measures to eradicate it. "A law, a new bill or giving money to the state governments will not eradicate the disgraceful practice. The central government must make sure that state governments have some accountability in eradicating the practise. They should rope in good NGOs and penetrate to the grass-root level," Bindeswar Pathak, founder, Sulabh International told IANS.

Read more »

LINK LIST IN DATA STRUCTURE

LINK LIST IN DATA STRUCTURE

Linked list is the most basic form of a data structure. A linked list is more or less similar to an array in that it can hold a list of values. But the similarity ceases here. The major difference between a linked list and array is that an array can hold values belonging to the same data type only whereas there is no such restriction on a linked list. For example, if an array is declared with type as int in C language, it can hold only integer values. Coming to a linked list, as it is a data structure, there is seldom any type associated with it. Apart from the above difference, there is one more difference that makes linked lists more versatile. It is not only possible to create linear linked lists but also circular linked lists i.e., the last element of the list can be made to point to the first. Another difference is that the memory to be allocated to a linked list can be specified dynamically i.e., we need not mention the number of elements in the linked list at the time of compilation. This facility may also be available for arrays in some languages but is not widely used. The most basic form of a linked list is created by creating a structure with one data element and a pointer to point to the next element in the data structure. The pointer of the last element is intialised to null to avoid it to point to some junk value if its a linear linked list. On the contrary, if it is a circular linked list, the pointer of the last element is made to point to the first element in the list. The above type of list allows traversing in only one direction. If we want bi-directional traversal, then we can create a structure with two pointers where one pointer is made to point to the previous element and the other point to the next element in the list. Modifications are made as stated above for a simple linked list to convert this to a circular list. Accordingly the above two types of lists are sometimes called single linked list and double linked list. Instead of using a single data element, we can use any number of data elements with several different data types within the structure. We may also use arrays as data elements of the linked list. An element in a linked list is often called a node. It is possible to add/delete nodes from any position within the linked list. According to the operation selected, the pointers need to be updated appropriately. Giving a C program to create a linked list would make this response too big as the programs to create linked lists often run more than hundred lines. Nevertheless, they are simple and can be easily understood once the concept is known. For further information and programs, you can refer to standard text books like Data

The link list in computer data structure program consists of sequence of data records with reference data field in each record in order to link each data record to the subsequent data field.
The link list grows when data is added and shrinks when data is deleted in the list. Hence link list is known as dynamic data structure in conjunction with dynamic memory management techniques.
Link list in data structure have flexibility in adding, deleting or rearranging data at run time permitting additional memory space and releasing unused memory space in order to optimum use of storage space.


Linked List is a complex dynamic data structure which contains of nodes having two parts data and next. Next is just a pointer pointing to the next node in the list. If the list is empty next just point ot NULL. There are different types of linked list namely Singly, Doubly and Circular. Singly Linked List is the list which can be traversed in one direction only and whose last last node of the list points to NULL. Doubly Linked list has two pointers PREV and NEXT.This list can be traversed in both the directions. PREV of the first node of doubly linked list always points to NULL and also the NEXT of last node points to NULL. Circular Linked List is the one whose last node points to the first instead of to the NULL. The different operations that can be performed on list are. INSERT:- We can dynamically insert any node at any desired position into the list. DELETE:- Similar to insertion, deletion can also be accomplished dynamically. TRAVERSE:- Traversing is just trvelling through the list visiting each node. As each thing has pros and cons, the only drawback of linked list is randomly accessing of element which can be achieved through array index in array but not in linked list.The good thing about linked list is its run­time expand­abil­ity which proves its flexibility.

Linked List is a Data storage mechanism in which list of data is stored in linear order. Linked list contains collection of nodes, each node contains data part and address part in which the next node address is stored. Each node in link list contains address of next node except the last node because last node contains the NULL pointer which indicates the end of list. Linked list has following types: 1. Singly Link List 2. Doubly Link List 3. Circular Link List
Link list data structure is created using the Structure of C as given below: struct list { int data; struct list *next; }; The dynamic node is created using malloc() and calloc() functions available in C language and new operator is used in case of C++. The following Operation can be performed on link list: 1.Insert element 2.Delete Element 3.Find Sum of All elements 4.Count number of node in list 5.Search any element 6.Reverse the list 7.Make copy of list 8.Merger two list 9.Update element Link list is widely used by various real life applications.

Linked List is basically a linear list of Elements which are linked to one another with some means of links, and hence it is known as linked list.

Each element in the list is known as Node.
And each node in the have at least two parts:-
1. Data Part
2. Link part

Data Part:- This part of every node of the list contains the information stored in that node of the list

Link Part:- This part of the node contains the memory address of the next node in the linked list.

For Example:Implementation of linked list node in C Language

Struct Node
{
int RollNo;//Data Part
int Marks;//Data Part
struct Node *link;//Address of the next Node
}; 

Note that the linked list contains a special node called the START which contains the address of the first node in the linked list.

if START == NULL
then it means that the linked list is Empty.


Linked List is a structure in data structures having a number of nodes that stores information as well as the pointer field that points to the next record to be processed. The pointer is basically a address that is used to access the next information part within a linked list. The last pointer field is filled using NULL character means there is no way further. So, it indicates the end of the linked list. Various algorithms are there to insert or delete nodes in a linked list.
It may be:

Insert element at the starting of linked list,
Insert element at the end of linked list,
Insert element at the middle of linked list,
Delete element at the starting of linked list,
Delete element at the end of linked list,
Delete element at the middle of linked list,


linked list a data structure which stores data in the form of nodes.It does not require linear memory as arrays. Each node contains a data part and a pointer part(a pointer to the next data in the list)

link or node is object of a class.there are so many types of linked list 1) single linked list
2)doubly linked list 
3)circular linked list.

single linked list:
here links contains pointer to first data and last data in the list.As said earlier a pointer to the next data.
example of a linked list:

class node{// all nodes will be the objects of this class
public int data;
public link next_node;//a pointer to next data
}
public node(int data){
this.data=data;
}//end of constructor
public void showdata(){
System.out.println("data= "+data);
}
}//end of class node

After defining class for each node we need to define a class for link list. Link list contains a pointer to the first node in the list,Which should be initialized to null in the beginning. All the operations to be performed on the link list is defined as functions in this class. For example insert first,Delete,insert search etc.

class linkedlist{
private node first_node;//pointer to the first node is defined
public linkedlist(){
first_node=null;
}
public void add_DAta(int data1){
//create newnode in the memory and store data
node newnode= new node(data1);
//initially first data is null 
//set the current first as the next node of the new node
newnode.next_node=first;
//set newnode as the first node
first_node=newnode;
}
}//end of class

Doubly link list:
This allows us to traverse backward and forward through the list . Here this a pointer to previous node i.e the class node in our example will have one more pointer to the previous node.
There is pointer to the last node in the list i.e class linkedlist contains pointer to last node in the list.
Circular linklist:
As the name indicate we can traversethe list i circular fashion that from first node to last node and back to firat node in the same direction. Last node will have a pointer to first node.

Read more »