GSM BASED VEHICLE MONITORING &SECURITY SYSTEM PROJECT DOWNLOAD WITH SOURCE CODE

DEVELOPMENT OF A GSM BASED VEHICLE MONITORING &SECURITY SYSTEM|A GSM BASED VEHICLE MONITORING &SECURITY SYSTEM

 Aim 

Click here to view full download or contact us

The main aim of this project is to provide security to the vehicles. The system
automatically locks the vehicle as soon as it receives a predefined message from the user.

Applications Download 

using GPS tracking system we can detect the vehicle any where in the
global
automatic reduction of vehicle speed where an obstacle on the way to
present loss in an accident
diction of aichohol for a driver and limit the speed of the vechile not more
than 40km/hr

The GSM Modem supports popular "AT" command set so that users can develop

applications quickly

Uses GSM technology for following applications:

1. Access control devices: Access control devices can communicate with

servers and security staff through SMS messaging. Complete log of

transaction is available at the head-office Server instantly without any

wiring involved and device can instantly alert security personnel on their

mobile phone in case of any problem

2. Transaction terminals: EDC (Electronic Data Capturing) machines

can use SMS messaging to confirm transactions from central servers.

The main benefit is that central server can be anywhere in the world

3. Supply Chain Management: With a central server in your head office

with GSM capability, you can receive instant transaction data from

all your branch offices, warehouses and business associates with nil

downtime and low cost.

The control kit should be placed inside the vehicle far away from the temperature

Care should be taken such that all components in the control kit must be in

condition

Must and should specify the predefined messages in the source program

The gsm frequencys must be considered


The implementation of the project design can be divided in two parts.

− Hardware implementation

− Firmware implementation

Embedded Systems:

An embedded system can be defined as a computing device that does a specific focused job. Appliances such as the air-conditioner, VCD player, DVD player, printer, fax machine, mobile phone etc. are examples of embedded systems. Each of these appliances will have a processor and special hardware to meet the specific requirement of the application along with the embedded software that is executed by the processor for meeting that specific requirement. The embedded software is also called “firm ware”. The desktop/laptop computer is a general purpose computer. You can use it for a variety of applications such as playing games, word processing, accounting, software development and so on. In contrast, the software in the embedded systems is always fixed listed below:

· Embedded systems do a very specific task, they cannot be programmed to do different things. Embedded systems have very limited resources, particularly the memory. Generally, they do not have secondary storage devices such as the CDROM or the floppy disk. Embedded systems have to work against some deadlines. A specific job has to be completed within a specific time. In some embedded systems, called real-time systems, the deadlines are stringent. Missing a deadline may cause a catastrophe-loss of life or damage to property. Embedded systems are constrained for power. As many embedded systems operate through a battery, the power consumption has to be very low.

· Some embedded systems have to operate in extreme environmental conditions such as very high temperatures and humidity.

Following are the advantages of Embedded Systems:

1. They are designed to do a specific task and have real time performance constraints which must be met.
2. They allow the system hardware to be simplified so costs are reduced.
3. They are usually in the form of small computerized parts in larger devices which serve a general purpose.
4. The program instructions for embedded systems run with limited computer hardware resources, little memory and small or even non-existent keyboard or screen.

The Evolution of Mobile Telephone Systems

Cellular is one of the fastest growing and most demanding telecommunications applications. Today, it represents a continuously increasing percentage of all new telephone subscriptions around the world. Currently there are more than 45 million cellular subscribers worldwide, and nearly 50 percent of those subscribers are located in the United States.

The concept of cellular service is the use of low power transmitters where frequencies can be reused within a geographic area. The idea of cell based mobile radio service was formulated in the United States at Bell Labs in the early 1970s. Cellular systems began in the United States with the release of the advanced mobile phone service (AMPS) system in 1983. The AMPS standard was adopted by Asia, Latin America and Oceanic countries, creating the largest potential market in the world for cellular.

In the early 1980s, most mobile telephone systems were analog rather than digital, like today's newer systems. One challenge facing analog systems was the inability to handle the growing capacity needs in a cost efficient manner. As a result, digital technology was welcomed.

The advantages of digital systems over analog systems include ease of signaling, lower levels of interference, integration of transmission and switching and increased ability to meet capacity demands. The table below shows the worldwide development of mobile telephone systems.

The implementation of the project design can be divided in two parts.

-        Hardware implementation

-        Firmware implementation

Hardware implementation deals in drawing the schematic on the plane paper according to the application, testing the schematic design over the breadboard using the various IC’s to find if the design meets the objective, carrying out the PCB layout of the schematic tested on breadboard, finally preparing the board and testing the designed hardware.

The firmware part deals in programming the microcontroller so that it can control the operation of the IC’s used in the implementation. In the present work, we have used the Orcad design software for PCB circuit design, the Keil µv3 software development tool to write and compile the source code, which has been written in the C language. The Proload programmer has been used to write this compile code into the microcontroller. The firmware implementation is explained in the next chapter.

The project design and principle are explained in this chapter using the block diagram and circuit diagram. The block diagram discusses about the required components of the design and working condition is explained using circuit diagram and system wiring diagram.

Microcontrollers:

Microprocessors and microcontrollers are widely used in embedded systems products. Microcontroller is a programmable device. A microcontroller has a CPU in addition to a fixed amount of RAM, ROM, I/O ports and a timer embedded all on a single chip. The fixed amount of on-chip ROM, RAM and number of I/O ports in microcontrollers makes them ideal for many applications in which cost and space are critical.

The Intel 8051 is Harvard architecture, single chip microcontroller (µC) which was developed by Intel in 1980 for use in embedded systems. It was popular in the 1980s and early 1990s, but today it has largely been superseded by a vast range of enhanced devices with 8051-compatible processor cores that are manufactured by more than 20 independent manufacturers including Atmel, Infineon Technologies and Maxim Integrated Products.

8051 is an 8-bit processor, meaning that the CPU can work on only 8 bits of data at a time. Data larger than 8 bits has to be broken into 8-bit pieces to be processed by the CPU. 8051 is available in different memory types such as UV-EPROM, Flash and NV-RAM. 

Features of AT89S52:

·        8K Bytes of Re-programmable Flash Memory.

·        RAM is 256 bytes.

·        4.0V to 5.5V Operating Range.

·        Fully Static Operation: 0 Hz to 33 MHz’s

·        Three-level Program Memory Lock.

·        256 x 8-bit Internal RAM.

·        32 Programmable I/O Lines.

·        Three 16-bit Timer/Counters.

·        Eight Interrupt Sources.

·        Full Duplex UART Serial Channel.

·        Low-power Idle and Power-down Modes.

·        Interrupt recovery from power down mode.

·        Watchdog timer.

·        Dual data pointer.

·        Power-off flag.

·        Fast programming time.

·        Flexible ISP programming (byte and page mode).

                                                                                           

Description:

The AT89s52 is a low-voltage, high-performance CMOS 8-bit microcomputer with 8K bytes of Flash programmable memory. The device is manufactured using Atmel’s high density nonvolatile memory technology and is compatible with the industry-standard MCS-51 instruction set. The on chip flash allows the program memory to be reprogrammed in system or by a conventional non volatile memory programmer. By combining a versatile 8-bit CPU with Flash on a monolithic chip, the Atmel AT89s52 is a powerful microcomputer, which provides a highly flexible and cost-effective solution to many embedded control applications.

In addition, the AT89s52 is designed with static logic for operation down to zero frequency and supports two software selectable power saving modes. The Idle Mode stops the CPU while allowing the RAM, timer/counters, serial port and interrupt system to continue the functioning. The power-down mode saves the RAM contents but freezes the oscillator disabling all other chip functions until the next hardware reset.

Pin description

Vcc    Pin 40 provides supply voltage to the chip. The voltage source is +5V.

GND   Pin 20 is the ground.

Port 0

Port 0 is an 8-bit open drain bidirectional I/O port. As an output port, each pin can sink eight TTL inputs. When 1s are written to port 0 pins, the pins can be used as high impedance inputs. Port 0 can also be configured to be the multiplexed low-order

address/data bus during accesses to external program and data memory. In this mode, P0 has internal pull-ups.

Port 0 also receives the code bytes during Flash programming and outputs the code bytes during Program verification. External pull-ups are required during program verification     Port 1

Port 1 is an 8-bit bidirectional I/O port with internal pull-ups. The Port 1 output buffers can sink/source four TTL inputs. When 1s are written to Port 1 pins, they are pulled high by the internal pull-ups and can be used as inputs. As inputs, Port 1 pins that are externally being pulled low will source current (IIL) because of the internal pull-ups. In addition, P1.0 and P1.1 can be configured to be the timer/counter 2 external count input (P1.0/T2) and the timer/counter 2 trigger input (P1.1/T2EX), respectively, as shown in the following table.

Port 1 also receives the low-order address bytes during Flash programming and verification.

                               Port 2

Port 2 is an 8-bit bidirectional I/O port with internal pull-ups. The Port 2 output buffers can sink/source four TTL inputs. When 1s are written to Port 2 pins, they are pulled high by the internal pull-ups and can be used as inputs. As inputs, Port 2 pins that are externally being pulled low will source current (IIL) because of the internal pull-ups.

Port 2 emits the high-order address byte during fetches from external program memory and during accesses to external data memory that uses 16-bit addresses (MOVX @ DPTR). In this application, Port 2 uses strong internal pull-ups when emitting 1s. During accesses to external data memory that uses 8-bit addresses (MOVX @ RI), Port 2 emits the contents of the P2 Special Function Register. The port also receives the high-order address bits and some control signals during Flash programming and verification.

Port 3

Port 3 is an 8-bit bidirectional I/O port with internal pull-ups. The Port 3 output buffers      can sink/source four TTL inputs. When 1s are written to Port 3 pins, they are pulled high by the internal pull-ups and can be used as inputs. As inputs, Port 3 pins that are externally being pulled low will source current (IIL) because of the pull-ups. Port 3 receives some control signals for Flash programming and verification.

Port 3 also serves the functions of various special features of the AT89S52, as shown in the following table.

RST

Reset input A high on this pin for two machine cycles while the oscillator is running resets the device. This pin drives high for 98 oscillator periods after the Watchdog times out. The DISRTO bit in SFR AUXR (address 8EH) can be used to disable this feature. In the default state of bit DISRTO, the RESET HIGH out feature is enabled.

ALE/PROG

Address Latch Enable (ALE) is an output pulse for latching the low byte of the address during accesses to external memory. This pin is also the program pulse input (PROG) during Flash programming.

In normal operation, ALE is emitted at a constant rate of 1/6 the oscillator frequency and may be used for external timing or clocking purposes. Note, however, that one ALE pulse is skipped during each access to external data memory.

If desired, ALE operation can be disabled by setting bit 0 of SFR location 8EH. With the bit set, ALE is active only during a MOVX or MOVC instruction. Otherwise, the pin is weakly pulled high. Setting the ALE-disable bit has no effect if the microcontroller is in external execution mode.

PSEN

Program Store Enable (PSEN) is the read strobe to external program memory. When the AT89S52 is executing code from external program memory, PSEN is activated twice each machine cycle, except that two PSEN activations are skipped during each access to external data memory.

EA/VPP                                               

External Access Enable EA must be strapped to GND in order to enable the device to fetch code from external program memory locations starting at 0000H up to FFFFH. Note, however, that if lock bit 1 is programmed, EA will be internally latched on reset.

EA should be strapped to VCC for internal program executions. This pin also receives the 12-volt programming enable voltage (VPP) during Flash programming.

XTAL1

Input to the inverting oscillator amplifier and input to the internal clock operating circuit.

XTAL2

Output from the inverting oscillator amplifier.

XTAL1 and XTAL2 are the input and output, respectively, of an inverting amplifier that can be configured for use as an on-chip oscillator. Either a quartz crystal or ceramic resonator may be used. To drive the device from an external clock source, XTAL2 should be left unconnected while XTAL1 is driven. There are no requirements on the duty cycle of the external clock signal, since the input to the internal clocking circuitry is through a divide-by-two flip-flop, but minimum and maximum voltage high and low time specifications must be observed.

UART

The Atmel 8051 Microcontrollers implement three general purpose, 16-bit timers/ counters. They are identified as Timer 0, Timer 1 and Timer 2 and can be independently configured to operate in a variety of modes as a timer or as an event counter. When operating as a timer, the timer/counter runs for a programmed length of time and then issues an interrupt request. When operating as a counter, the timer/counter counts negative transitions on an external pin. After a preset number of counts, the counter issues an interrupt request. The various operating modes of each timer/counter are described in the following sections.

A basic operation consists of timer registers THx and TLx (x= 0, 1) connected in cascade to form a 16-bit timer. Setting the run control bit (TRx) in TCON register turns the timer on by allowing the selected input to increment TLx. When TLx overflows it increments THx; when THx overflows it sets the timer overflow flag (TFx) in TCON register. Setting the TRx does not clear the THx and TLx timer registers. Timer registers can be accessed to obtain the current count or to enter preset values. They can be read at any time but TRx bit must be cleared to preset their values, otherwise the behavior of the timer/counter is unpredictable.

The C/T control bit (in TCON register) selects timer operation or counter operation, by selecting the divided-down peripheral clock or external pin Tx as the source for the counted signal. TRx bit must be cleared when changing the mode of operation, otherwise the behavior of the timer/counter is unpredictable. For timer operation (C/Tx# = 0), the timer register counts the divided-down peripheral clock. The timer register is incremented once every peripheral cycle (6 peripheral clock periods). The timer clock rate is FPER / 6, i.e. FOSC / 12 mode. There are no restrictions on the duty cycle of the external input signal, but to ensure that a given level is sampled at least once before it changes, it should be held for at least one full peripheral cycle. In addition to the “timer” or “counter” selection, Timer 0 and Timer 1 have four operating modes from which to select which are selected by bit-pairs (M1, M0) in TMOD. Modes 0, 1and 2 are the same for both timer/counters. Mode 3 is different. 

Download This projects contact us Enter your valid details our team may contact you any time. 

NOTE :

USE SEARCH OPTION TO GET YOUR PROJECTS IN nS

tags: Free Download With full documentation and source code Vehicle Management System, GSM/GPRS PROJECTS, ECE, EEE, IEEE ECE PROJECTS, IEEE EEE PROJECTS, IEEE Electronics projects, ELECTRONICS PROJECT, IEEE PROJECTS, FINAL YEAR PROJECTS, OTHER PROJECTS, ALL DEPT, mca, mech, DOWNLOAD

5:18 PM - By Admin 1

Latest VLSI PROJECTS FREE DOWNLOAD WITH DOCUMENTATION

Latest VLSI PROJECTS FREE DOWNLOAD WITH DOCUMENTATION/VLSI PROJECTS 

1. A Novel Carry-Look ahead Approach to an Unified BCD and Binary Adder/ Subtractor
2. Speculative Carry Generation with Prefix Adder Using VHDL / Verilog
3. Improving Error Tolerance For Multithreaded Register Files
4. Higher Radix and Redundancy Factor for Floating Point Sort Division using VHDL/ Verilog
5. Area-Efficient Arithmetic Expression Evaluation using Deeply Pipelined Floating Point Cores using VHDL
6. Reconfigurable Architecture for Network Flow Analysis
7. The Reconfigurable Instruction Cell Array
8. System Architecture and Implementation of MIMO Sphere Decoders on FPGA
9. Applying Dynamic Reconfiguration for Fault Tolerance in Fine-Grained Logic Arrays
10. Register for Phase Difference Based Logic
11. Designing Efficient Online Testable Reversible Adder with New Reversible Gate
12. High Speed Recursion Architecture for Map- Based Turbo Decoders
13. Concurrent Error Detection in Reed Solomon Encoders and Decoders
14. LFSR-Reseeding Scheme Achieving Low-Power Dissipation during Test
15. FPGA Implementation of Low Power Parallel Multiplier
16. Low Power Multiplier with Superious Power Suppression Technique
17. Abstraction and Refinement Techniques in Automated Design Debugging
18. Concurrent Error Detection in Reed Solomon Encoders and Decoders
19. Implementation of AES on A Dynamically Reconfigurable Architecture
20. Designing Efficient Online Testable Reversible Adder with New Reversible Gate
21. FPGA Implementation of Low Power Parallel Multiplier
22. Compact Hardware Design of Whirlpool Hashing Core
23. A Combined Gate Replacement and Input Vector Control Approach for Leakage Current Reduction
24. A High Efficiency fully Digital Synchrouns Buck Converter Power Delivery System Based on Finite State Machine
25. X-Masking During Logic BIST and Its Impact on Defect Coverage
26. New techniques for untreatable fault identification in sequential circuits
27. New and Improved BIST Diagnosis Method from combinatorial group testing theory
28. Energy Management for battery powered Reconfigurable computing platforms
29. Design specific path delay testing in look up table based FPGA
30. Diagnosis of Logic Circuits Using Compressed Deterministic Data and On-Chip Response Comparison
31. Improving Linear Test Data Compression
32. Exact and Heuristic Approaches to Input Vector Control for Leakage Power Reduction
33. Extraction Error Modeling and Automated Model Debugging in High-Performance Custom Designs

Tags:

    Keywords:VLSI/VHDL PROJECTS, ECE, IEEE ECE PROJECTS, IEEE EEE PROJECTS, IEEE Electronics projects, IEEE PROJECTS, IEEE TIPS, Vehicle Management System, SYSTEM PROJECTS, ALL DEPT, HOW TO, OTHERS, 

5:16 PM - By Admin 0

Latest IEEE PROJECTS for avoiding accidents|Accident Prevention Using Eye Blink Sensor

Accidents avoiding  projects,Road/Vehicle accidents projects

Free major/mini/full projects  with source code/Documentation download


This project involves measure and controls the eye blink using IR sensor. The IR transmitter is used to transmit the infrared rays in our eye. The IR receiver is used to receive the reflected infrared rays of eye. If the eye is closed means the output of IR receiver is high otherwise the IR receiver output is low. This to know the eye is closing or opening position. This output is give to logic circuit to indicate the alarm. 

Accident Prevention Using Eye Blink Sensor

Click here to Download

5:08 PM - By Admin 0

stair climbing robot Full Project Download Free documentation and circuit diagram

stair climbing robot circuit diagram Full Project  and documentation Download Free
stair climbing robot circuit diagram Full Project  and documentation Download Free
stair climbing robot circuit diagram Full Project  and documentation Download Free
How to make a Robot in simple and easy way for symposium as well as final year project ? 

What is Stair Robot ? What is Stairbot ?

      StairBOT is a small robot for indoor environments. On even floor it drives like many other small robots with a differential-drive. In addition it can change its length with linear guides mechanism with a spindle-drive. By this mechanism it can – together with its omniwheels (with brakes) and a support – reliably climb up and down regular sized stairs. It was one of the objectives for the design to use as few actuators and sensors as possible.

CLICK HERE TO VIEW IEEE PAPER

OBJECTIVES :

Objectives

A robot, which

 1.      -  can reach every freely accessible place in a building;

 2.      -  is not longer than 50 cm;

 3.      -  needs as few actuators and sensors as possible;

 4.      -  can be controlled by simple controll-structures.

How To make Stair Robot or stairbot ?

What are the specification needed ?

Processors       2  BrainStem GP 1.0   (acroname, USA)

                        2  Brainstem Moto 1.0 (acroname, USA)

                        1  iPAQ

 

Sensors            1  CMUcam2

                        2  GP2D12   range finders  (front)

                        2  GP2D120 range finders (rear)

                        1  SRF08

                        2  micro switches (wheel-bumper)

                        2  micro switches  (linear guide bumper)

                        2  micro switches  (limiting switches for the spindle drive)

 

Power              11 SubC NiMH 3000Ah(13.2V) motor

                         5 SubC NiMH 3000Ah(6V) servos

                         5 SubC NiMH 3000Ah(6V) controllers

                         1 iPAQ LiIon-Battery

 

Drive Type          2 wheel differential drive (2 omniwheels with brakes as castors)

                         1 linear guides with leading screw

 

Actuators           2 DC-motors 6W, 84:1 geartrain, encoder   (differential drive)

                         1 DC-motor  11W, 4.8:1 geartrain, encoder (spindle drive)

                         1 servo (omniwheel-brake)

                         1 servo (support)

                         1 servo (sensor-head up and down)

Body                  fischertechnik construction kit parts, custom made aluminium, plastic and plywood parts

 

Seize                 depending on linear guides position

                          L x W x H:

                          short:  30cm x 36cm x 60cm

                          long:   65cm x 36cm x 27cm  

Weight               about 6kg  with batteries

CIRCUIT DIAGRAM  


MORE DETAILS  SCROLL DOWN

1:30 PM - By Admin 0

Vehicle Monitoring and Security System Download

Vehicle Monitoring and Security System

ABSTRACT:

In this modern, fast moving and insecure world, it is become a basic necessity to be aware of one’s safety. Maximum risks occur in situations wherein an employee travels for money transactions. Also the Company to which he belongs should be aware if there is some problem. What if the person traveling can be tracked and also secured in the case of an emergency?! Fantastic, isn’t it? Of course it is and here’s a system that functions as a tracking and a security system. It’s the VMSS. This system can deal with both pace and security.

The VMSS (Vehicle Monitoring and Security System) is a GPS based vehicle tracking system that is used for security applications as well. The project uses two main underlying concepts. These are GPS (Global Positioning System) and GSM (Global System for Mobile Communication). The main application of this system in this context is tracking the vehicle to which the GPS is connected, giving the information about its position whenever required and for the security of each person travelling by the vehicle. This is done with the help of the GPS satellite and the GPS module attached to the vehicle which needs to be tracked. The GPS antenna present in the GPS module receives the information from the GPS satellite in NMEA (National Marine Electronics Association) format and thus it reveals the position information. This information got from the GPS antenna has to be sent to the Base station wherein it is decoded. For this we use GSM module which has an antenna too. Thus we have at the Base station; the complete data about the vehicle.

Along with tracking the vehicle, the system is used for security applications as well. Each passenger/employee will have an ID of their own and will be using a remote containing key for Entry, Exit and Panic. The Panic button is used by the driver or the passenger so as to alert the concerned of emergency conditions. On pressing this button, an alarm will be activated which will help the passenger/employee in emergencies and keep them secure throughout the journey. The vehicle can also be immobilized remotely.

INTRODUCTION:

Of all the applications of GPS, Vehicle tracking and navigational systems have brought this technology to the day-to-day life of the common man. Today GPS fitted cars, ambulances, fleets and police vehicles are common sights on the roads of developed countries. Known by many names such as Automatic Vehicle Locating System (AVLS), Vehicle Tracking and Information System (VTIS), Mobile Asset Management System (MAMS), these systems offer an effective tool for improving the operational efficiency and utilization of the vehicles.

GPS is used in the vehicles for both tracking and navigation. Tracking systems enable a base station to keep track of the vehicles without the intervention of the driver whereas navigation system helps the driver to reach the destination. Whether navigation system or tracking system, the architecture is more or less similar. The navigation system will have convenient, usually a graphic display for the driver which is not needed for the tracking system. Vehicle tracking systems combine a number of well-developed technologies.

To design the VMSS system, we combined the GPS’s ability to pin-point location along with the ability of the Global System for Mobile Communications (GSM) to communicate with a control center in a wireless fashion. The system includes GPS-GSM modules and a base station called the control center.

Let us briefly explain how VMSS works. In order to monitor the vehicle, it is equipped with a GPS-GSM VMSS system. It receives GPS signals from satellites, computes the location information, and then sends it to the control center. With the vehicle location information, the control center displays all of the vehicle positions on an electronic map in order to easily monitor and control their routes. Besides tracking control, the control center can also maintain wireless communication with the GPS units to provide other services such as alarms, status control, and system updates.

The design takes into consideration important factors regarding both position and data communication. Thus, the project integrates location determination (GPS) and cellular (GSM) – two distinct and powerful technologies in a single system.

VMSS is based on a PIC microcontroller-based system equipped with a GPS receiver and a GSM Module operating in the 900 MHz band. We housed the parts in one small plastic unit, which was then mounted on the vehicle and connected to GPS and GSM antennas. The position, identity, heading, and speed are transmitted either automatically at user-defined time intervals or when a certain event occurs with an assigned message (e.g.; accident, alert, or leaving/entering an admissible geographical area).

The GPS Module outputs the vehicle location information such as longitude, latitude, direction, and Greenwich Time every five minutes. The GSM wireless communications function is based on a GSM network established in a valid region and with a valid service provider. Via the SMS provided by the GSM network, the location information and the status of the GPS-GSM VMSS are sent to the control center. Meanwhile, the VMSS receives the control information from the control center via the same SMS. Next, the GPS-GSM VMSS sends the information stored in the microcontroller via an RS-232 interface.

There are two ways to use the VMSS’ alarm function, which can be signified by either a buzzer

or presented on LCD. The first way is to receive the command from the control center; second way is to manually send the alarm information to the control center with the push of a button.

The base station consists of landline modem(s) and GIS workstation. The information about the vehicle is received at a base station and is then displayed on a PC based map. Vehicle information can be viewed on electronic maps via the Internet or specialized software. Geographic Information Systems (GIS) provides a current, spatial, visual representation of transit operations. It is a special type of computerized database management system in which geographic databases are related to one via a common set of location coordinates.

STAGES OF VMSS

STAGE 1: 
Driver starts his trip from the transport office.
VMSS transmits the Driver I.D and the Vehicle I.D along with the position of the vehicle to the base station.

STAGE 2:
Taxi picks up the employee/passenger from their residence.
VMSS transmits the Passenger I.D and the Vehicle I.D along with the position of the vehicle to the base station. Therefore base station will be able to keep a track of the vehicle and thus the employee/passenger.

STAGE 3:
Taxi drops the employee/passenger to the workplace.
VMSS transmits the Passenger I.D and the Vehicle I.D along with the position of the vehicle to the base station.

STAGE 4:
Taxi picks the employee/passenger from the workplace.
VMSS transmits the Passenger I.D and the Vehicle I.D along with the position of the vehicle to the base station. Therefore this enables the base station to estimate the time if required and also keep a track of the vehicle, passenger and the driver.

STAGE 5:
Taxi drops the employee/passenger to their residence.
VMSS transmits the Passenger I.D and the vehicle I.D along with the position of the vehicle to the base station and makes sure that the job is 100% complete.

7:48 PM - By Admin 0

PPT FRAMELET | what is Framelet Algorithms for De-Blurring Images Corrupted by Impulse Plus Gaussian Noise|image processing

1.PPT | what is Framelet Algorithms for De-Blurring Images Corrupted by Impulse Plus Gaussian Noise|image processing        

ABSTRACT:

This paper studies a problem of image restoration that observed images are contaminated by Gaussian and impulse noise. Existing methods for this problem in the literature are based on minimizing an objective functional having the l¹ fidelity term and the Mumford-Shah regularizer. We present an algorithm on this problem by minimizing a new objective functional. The proposed functional has a content-dependent fidelity term which assimilates the strength of fidelity terms measured by the l¹ and l² norms. The regularizer in the functional is formed by the l¹ norm of tight framelet coefficients of the underlying image. The selected tight framelet filters are able to extract geometric features of images. We then propose an iterative framelet-based approximation/sparsity deblurring algorithm (IFASDA) for the proposed functional. Parameters in IFASDA are adaptively varying at each iteration and are determined automatically. In this sense, IFASDA is a parameter-free algorithm. This advantage makes the algorithm more attractive and practical. The effectiveness of IFASDA is experimentally illustrated on problems of image deblurring with Gaussian and impulse noise. Improvements in both PSNR and visual quality of IFASDA over a typical existing method are demonstrated. In addition, Fast_IFASDA, an accelerated algorithm of IFASDA, is also developed.

2.FRAMELET ALGORITHM FOR ENHANCING VIDEO STILLS

Abstract.

 High-resolution image reconstruction refers to the problem of constructing a high resolution

image from low resolution images. One approach for the problem is the recent framelet

method in [4]. There the low resolution images are assumed to be small perturbation of a reference

image perturbed in di erent directions. Video clips are made of many still frames, usually about

30 frames per second. Thus most of the frames can be considered as small perturbations of their

nearby frames. In particular, frames close to a speci ed reference frame can be considered as small

perturbations of the reference frame. Hence the setting is similar to that in high-resolution image

reconstruction. In this paper, we propose a framelet algorithm similar to that in [4] to enhance the

resolution of any speci ed reference frames in video clips. Experiments on actual video clips show

that our method can provide information that are not discernable from the given clips.

CLICK HERE TO DOWNLAOD THIS PAPER

3.PPT FRAMELET ALGORITHM FOR IMAGE PROCESSING

• CLICK LINK PPT 1 TO DOWNLOAD
• CLICK PPT 2 LINK TO DOWNLOAD
•  CLICK LINK PPT 3 TO DOWNLOAD

 

9:45 PM - By Reetha 1

PROJECTS CHENNAI | TRICHY | INDIA IEEE 2011 / 2012 DOT NET PROJECT TITLES || IEEE TRANSACTION ON NETWORKING | IEEE TRANSACTION ON DATAMINING

EEE PROJECTS 2011 DOTNET | IEEE 2011 / 2012 PROJECTS CHENNAI | TRICHY | INDIA

IEEE 2011 / 2012 DOT NET PROJECT TITLES	IEEE YEAR
IEEE TRANSACTION ON NETWORKING
A Distributed Algorithm for the Replica Placement Problem	2011 / 2012
A Framework for Routing Performance Analysis in Delay Tolerant Networks with Application to Non Cooperative Networks.	2011 / 2012
A Generic Framework for Three-Factor Authentication: Preserving Security and Privacy in Distributed Systems	2011 / 2012
A Novel Approach for Failure Localization in All-Optical Mesh Networks	2011 / 2012
A Secure Communication Game with a Relay Helping the Eavesdropper.	2011 / 2012
A Simple Model for Chunk-Scheduling Strategies in P2P Streaming	2011 / 2012
A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows	2011 / 2012
Active Queue Management for Floqw Fairness and stable Queue Length.	2011 / 2012
Adjacent Link failure Localization With Monitoring Trails in All-Optical Mesh Network.	2011 / 2012
An Adaptive Network Coded Retransmission Scheme for Single-HopWireless Multicast Broadcast Services	2011 / 2012
An Optimal Algorithm for Relay Node Assignment in Cooperative Ad Hoc Networks	2011 / 2012
Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions	2011 / 2012
Approximation algorithms for the Multi-Organization Scheduling Problem.	2011 / 2012
Architecture and Abstractions for Environment and Traffic-Aware System-Level Coordination of Wireless Networks	2011 / 2012
BRICK: A Novel Exact Active Statistics Counter Architecture	2011 / 2012
Buffer Sizing for 802.11-Based Networks	2011 / 2012
Capacity of Large-Scale CSMA Wireless Networks	2011 / 2012
Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks	2011 / 2012
Coloring Spatial Point Processes With Applications to Peer Discovery in Large Wireless Networks	2011 / 2012
Component-Based Localization in Sparse Wireless Networks	2011 / 2012
Compressing Network Access Control Lists.	2011 / 2012
Compression of View on Anonymous Networks Folded View.	2011 / 2012
Consensus and Mutual Exclusion in a Multiple Access Channel	2011 / 2012
Continuous Neighbor Discovery in Asynchronous Sensor Networks.	2011 / 2012
Cross-Layer Jamming Detection and Mitigation in Wireless Broadcast Networks	2011 / 2012
Crosstalk-Preventing Scheduling in Singleand Two-Stage AWG-Based Cell Switches	2011 / 2012
Delay Analysis and Optimality of Scheduling Policies for Multihop Wireless Networks	2011 / 2012
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule	2011 / 2012
Differential Encoding of DFAs for Fast Regular Expression Matching	2011 / 2012
Efficient Multipath Communication for Time-Critical Applications in Underwater Acoustic Sensor Networks	2011 / 2012
Energy-Efficient Protocol for Cooperative Networks	2011 / 2012
Exploring Second Life	2011 / 2012
Fast and Cost-Effective Online Load-Balancing in Distributed Range-Queriable	2011 / 2012
Fast Simulation of Service Availability in Mesh Networks With Dynamic Path Restoration	2011 / 2012
FDAC: Toward Fine-Grained Distributed Data Access Control in Wireless Sensor	2011 / 2012
Flexible Robust Group Key Agreement	2011 / 2012
Forward Correction and Fountain Codes in Delay-Tolerant Networks	2011 / 2012
Generalized Probabilistic flooding in unstructured Peer-to-Peer Networks	2011 / 2012
Group Strategy proof Multicast in Wireless Networks	2011 / 2012
Impact of File Arrivals and Departures on Buffer Sizing in Core Routers	2011 / 2012
Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks	2011 / 2012
INVESTIGATION IN SPEED LIMIT OF INFORMATION PROPAGATION IN MULTIHOP WIRELESS NETWORKS.	2011 / 2012
Jamming Aware Traffic Allocation for Multiple Path Routing Using Portfolio Selection	2011 / 2012
Key Pre distribution Schemes for Establishing Pair wise Keys with a Mobile Sink in Sensor Networks	2011 / 2012
LARGE-SCALE MEASUREMENT STUDY OF ZATTOO.	2011 / 2012
LEAST-COST ANYPATH ROUTING ALGORITHM FOR WIRELESS COMMUNICATION.	2011 / 2012
Licklider Transmission Protocol (LTP) Based DTN for Cislunar Communications	2011 / 2012
Lifetime and Coverage Guarantees Through Distributed Coordinate-Free Sensor Activation	2011 / 2012
Live Streaming With Receiver Based Peer-Division Multiplexing	2011 / 2012
Local Restoration With Multiple Spanning Trees in Metro Ethernet Networks	2011 / 2012
Maelstrom: Transparent Error Correction for Communication Between Data Centers	2011 / 2012
Measuring Client-Perceived Page view Response Time of Internet Services.	2011 / 2012
Measuring Multipath Routing in the Internet	2011 / 2012
Mobile Sampling of Sensor Field Data Using Controlled Broadcast	2011 / 2012
Model-Based Identification of Dominant Congested Links	2011 / 2012
Network-Coding Multicast Networks With QoS Guarantees	2011 / 2012
Node Reclamation and Replacement for Long-Lived Sensor Networks	2011 / 2012
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks	2011 / 2012
On Cooperative Settlement Between Content, Transit, and Eyeball Internet Service Providers	2011 / 2012
On the Complexity of the Regenerator Placement Problem in Optical Networks	2011 / 2012
On the Cost of Network Inference Mechanisms.	2011 / 2012
On the Dimensioning of WDM Optical Networks With Impairment-Aware Regeneration	2011 / 2012
On the Levy-Walk Nature of Human Mobility	2011 / 2012
On the Price of Security in Large-Scale Wireless Ad Hoc Networks	2011 / 2012
Opportunity Cost Analysis for Dynamic Wavelength Routed Mesh Networks	2011 / 2012
Optical Layer Security in Fiber-Optic Networks.	2011 / 2012
Optimal Anycast Technique for Delay-Sensitive Energy-Constrained Asynchronous Sensor Networks	2011 / 2012
Parametric Methods for Anomaly Detection in Aggregate Traffic	2011 / 2012
Pareto Boundary of Utility Sets for Multiuser Wireless Systems	2011 / 2012
Peering Equilibrium Multipath Routing: A Game Theory Framework for Internet Peering Settlements	2011 / 2012
Practical Computation of Optimal Schedules in Multihop Wireless Networks	2011 / 2012
Practical Routing in a Cyclic MobiSpace	2011 / 2012
PRACTICAL THECNIQUE ALGORITHM FOR LOW-DIMENSIONAL OPTIMIZATION PROBLEM IN WIRELESS NETWORKS.	2011 / 2012
Predictive Resource Management of Multiple Monitoring Applications	2011 / 2012
Primary User Activity Modeling Using First-Difference Filter Clustering and Correlation in Cognitive Radio Network	2011 / 2012
Privacy in VoIP Networks: Flow Analysis Attacks and Defense	2011 / 2012
Privacy Preserving Collaborative Enforcement of Firewall Policies in Virtual Private Networks	2011 / 2012
ProgME: Towards Programmable Network Measurement	2011 / 2012
Quasi-Kautz Digraphs for Peer-to-Peer Networks.	2011 / 2012
Research on cloud computing application in the Peer-to-Peer based video-on -demand systems.	2011 / 2012
Risk-Aware Provisioning for Optical WDM Mesh Networks	2011 / 2012
Robust Network Codes for Unicast Connections: A Case Study	2011 / 2012
ROC Resilient Online Coverage for Surveillance Applications	2011 / 2012
Scalable and Cost-Effective Interconnection of Data-Center Servers Using Dual Server Ports	2011 / 2012
Scheduling Algorithms for Multicarrier Wireless Data Systems	2011 / 2012
SECURE-LINK-AUGMENTATION OPERATIONS ON WANET.	2011 / 2012
Self-Reconfigurable Wireless Mesh Networks	2011 / 2012
SPAF: Stateless FSA-Based Packet Filters	2011 / 2012
SRLG Failure Localization in Optical Networks	2011 / 2012
Star-Block Design in Two-Level Survivable Optical Networks	2011 / 2012
Stochastic Model and Connectivity Dynamics for VANETs in Signalized Road Systems	2011 / 2012
Survivable Multipath Provisioning With Differential Delay Constraint in Telecom Mesh Networks	2011 / 2012
SWARM: The Power of Structure in Community Wireless Mesh Networks	2011 / 2012
The Limit of Information Propagation Speed in Large-Scale Multihop Wireless Networks	2011 / 2012
The Small World of File Sharing.	2011 / 2012
TOFU: Semi-Truthful Online Frequency Allocation Mechanism for Wireless Networks	2011 / 2012
Topological Transformation Approaches to TCAM-Based Packet Classification	2011 / 2012
Towards Efficient and Simplified Distributed Data Intensive Computing.	2011 / 2012
Towards Realizable,Low-Cost Broadcast System for Dynamic Environments.	2011 / 2012
Towards Systematic Design of Enterprise Networks	2011 / 2012
Trace back of DDoS Attacks Using Entropy Variations.	2011 / 2012
Traffic-Oblivious Routing in the Hose Model	2011 / 2012
Using Link Gradients to Predict the Impact of Network Latency on Multitier Applications	2011 / 2012
Valuable Detours: Least-Cost Anypath Routing	2011 / 2012
Verifiable Privacy-Preserving Sensor Network Storage for Range Query	2011 / 2012
IEEE TRANSACTION ON NETWORK SECURITY
A New Chaos-Based Cryptosystem for Secure Transmitted Images.	2011 / 2012
A Policy Enforcing Mechanism for Trusted Ad Hoc Networks	2011 / 2012
An Obfuscation-Based Approach for Protecting Location Privacy.	2011 / 2012
Analysis of a Botnet Takeover.	2011 / 2012
CASTLE:Continuously Anonymizing Data Streams.	2011 / 2012
Coding for Cryptographic Security Enhancement Using Stopping Sets.	2011 / 2012
Comparative Evaluation of Spoofing Defenses.	2011 / 2012
Deadlock-Free Adaptive Routing in Meshes with Fault-Tolerance Ability Based on Channel Overlapping	2011 / 2012
Distributed Detection of Clone Attacks in Wireless Sensor Networks	2011 / 2012
Efficient Network Modification to Improve Qos Stability at Failures.	2011 / 2012
Improving Security and Efficiency in Attribute-Based Data Sharing.	2011 / 2012
Improving Security and Performance in the Tor Network through Tunable Path Selection	2011 / 2012
Modeling and Detection of Camouflaging Worm.	2011 / 2012
MULTIVARIANT EXECUTION TECHNIQUE IN DETECTING AND PREVENTING CODE INJECTION ATTACKS.	2011 / 2012
Nymble: Blocking Misbehaving Users in Anonymizing Networks.	2011 / 2012
Peering Equilibrium Multipath Routing: A Game Theory Framework for Internet Peering Settlements.	2011 / 2012
Privacy-Preserving Updates to Anonymous and Confidential Databases	2011 / 2012
PRIVACY-PRESERVING UPDATES TO GENERALIZATION-BASED K-ANONYMOUS AND CONFIDENIAL DATABASES.	2011 / 2012
Providing Transaction Guarantees in Asynchronous System with No Assumptions on the Accuracy of Failure Detection.	2011 / 2012
Reliability for Networked Storage Nodes.	2011 / 2012
Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables	2011 / 2012
Revisiting Defenses Against Large-Scale Online Password Guessing Attacks	2011 / 2012
SAT:A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks.	2011 / 2012
Traceback of DDoS Attacks Using Entropy  Variations.	2011 / 2012
IEEE TRANSACTION ON DATAMINING
A Dual Framework and Algorithms for Targeted Online Data Delivery	2011 / 2012
A Fast Multiple Longest Common Subsequence (MLCS) Algorithm	2011 / 2012
A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification	2011 / 2012
A Generic Multilevel Architecture for Time Series Prediction	2011 / 2012
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases.	2011 / 2012
A Machine Learning Approach for Identifying Disease-Treatment Relations in Short Texts	2011 / 2012
A Personalized Ontology Model for Web Information Gathering.	2011 / 2012
A Query Formulation Language for the Data Web.	2011 / 2012
Adaptive Cluster Distance Bounding for High-Dimensional Indexing	2011 / 2012
Adaptive Provisioning of Human Expertise in Service-oriented Systems.	2011 / 2012
Anonymous Publication of Sensitive Transactional Data	2011 / 2012
Answering Frequent Probabilistic Inference Queries in Databases	2011 / 2012
Authenticated Multistep Nearest Neighbor Search	2011 / 2012
Authenticated Multistep NN Nearest Neighbor Search.	2011 / 2012
Automatic Discovery of Personal Name Aliases from the Web	2011 / 2012
Automatic Enrichment of Semantic Relation Network and Its Application to Word Sense Disambiguation	2011 / 2012
Branch-and-Bound for Model Selection and Its Computational Complexity	2011 / 2012
Bridging Socially-Enhanced Virtual Communities.	2011 / 2012
Classification and Novel Class Detection in Concept-Drifting Data Streams under Time Constraints	2011 / 2012
Classification Using Streaming Random Forests	2011 / 2012
CoFiDS: A Belief-Theoretic Approach for Automated Collaborative Filtering	2011 / 2012
Collaborative Filtering with Personalized Skylines	2011 / 2012
Comprehensive Citation Index for Research Networks	2011 / 2012
Constrained Skyline Query Processing against Distributed Data Sites	2011 / 2012
Continuous Monitoring of Distance-Based Range Queries	2011 / 2012
Cosdes: A Collaborative Spam Detection System with a Novel E-Mail Abstraction Scheme	2011 / 2012
Coupling Logical Analysis of Data and Shadow Clustering for Partially Defined Positive Boolean FunctionReconstruction	2011 / 2012
Data integrity proofs in cloud storage.	2011 / 2012
Data Leakage Detection	2011 / 2012
Data mining for XML query-answering support.	2011 / 2012
Decision Trees for Uncertain Data	2011 / 2012
Design and Implementation of an Intrusion Response System for Relational Databases	2011 / 2012
Differential Privacy via Wavelet Transforms	2011 / 2012
Discovering Activities to Recognize and Track in a Smart Environment	2011 / 2012
Discovering Conditional Functional Dependencies	2011 / 2012
Effective Navigation of Query Results Based on Concept Hierarchies	2011 / 2012
Efficient and Accurate Discovery of Patterns in Sequence Data Sets	2011 / 2012
Efficient Computation of Range Aggregates against Uncertain Location Based Queries	2011 / 2012
Efficient Computing of Range Aggregates against Uncertain Location Based Collections.	2011 / 2012
Efficient Keyword-based Search for Top-K Cell in Text Cube.	2011 / 2012
Efficient Periodicity Mining in Time Series Databases Using Suffix Trees	2011 / 2012
Efficient Relevance Feedback for Content-Based Image Retrieval by Mining User Navigation Patterns.	2011 / 2012
Efficient Techniques for Online Record Linkage	2011 / 2012
Efficient Top-k Approximate Subtree Matching in Small Memory	2011 / 2012
Energy Time Series Forecasting Based on Pattern Sequence Similarity	2011 / 2012
Estimating and Enhancing Real-Time Data Service Delays: Control-Theoretic Approaches	2011 / 2012
Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems	2011 / 2012
Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud.	2011 / 2012
Exploring Application-Level Semantics for Data Compression.	2011 / 2012
Extended XML Tree Pattern Matching: Theories and Algorithms.	2011 / 2012
Finding Correlated Biclusters from Gene Expression Data	2011 / 2012
Frequent Item Computation on a Chip	2011 / 2012
Horizontal Aggregations in SQL to prepare Data Sets for Data Mining Analysis.	2011 / 2012
Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques.	2011 / 2012
Inconsistency-Tolerant Integrity Checking	2011 / 2012
Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks	2011 / 2012
Integration of Sound Signature in Graphical Password Authentication System.	2011 / 2012
Integration of the HL7 Standard in a Multiagent System to Support Personalized Access to e-Health Services	2011 / 2012
Inter temporal Discount Factors as a Measure of Trustworthiness in Electronic Commerce	2011 / 2012
IR-Tree: An Efficient Index for Geographic Document Search	2011 / 2012
Knowledge Discovery in Services (KDS):Aggregating Software Services to Discover Enterprise Mashups	2011 / 2012
Learning Semi-Riemannian Metrics for Semisupervised Feature Extraction	2011 / 2012
Load Shedding in Mobile Systems with MobiQual	2011 / 2012
Locally Consistent Concept Factorization for Document Clustering	2011 / 2012
Making Aggregation Work in Uncertain and Probabilistic Databases	2011 / 2012
MATCHING CROSS IN EXTENDED XML TREE PATTERNS.	2011 / 2012
MESH CONCEPT HIERARCHY FOR SEARCH QUERIES ON BIOMEDICAL DATABASES.	2011 / 2012
Mining Cluster-Based Temporal Mobile Sequential Patterns in Location-Based Service Environments	2011 / 2012
Mining Discriminative Patterns for Classifying Trajectories on Road Networks	2011 / 2012
Mining Group Movement Patterns for Tracking Moving Objects Efficiently	2011 / 2012
Mining Iterative Generators and Representative Rules for Software Specification Discovery	2011 / 2012
Mining Web Graphs for Recommendations.	2011 / 2012
Missing Value Estimation for Mixed-Attribute Data Sets	2011 / 2012
Monitoring Service Systems from a Language-Action Perspective.	2011 / 2012
Monochromatic and Biochromatic Reverse Top-k Queries	2011 / 2012
NAVIGATION-PATTERN-BASED RELEVANCE FEEDBACK FOR IMAGE RETRIVAL.	2011 / 2012
On Computing Farthest Dominated Locations	2011 / 2012
One Size Does Not Fit All Towards User and Query Dependent Ranking For Web Databases	2011 / 2012
Optimal Service Pricing for a Cloud Cache.	2011 / 2012
Optimizing Resource Conflicts in Workflow Management Systems	2011 / 2012
Pareto-Based Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries	2011 / 2012
Privacy-Preserving OLAP: An Information-Theoretic Approach	2011 / 2012
PROFICIENT PROGRESSIVE SKYLINE COMPUTATION COLLABORATIVE FILTERING.	2011 / 2012
Publishing Search Logs-A Comparative Study of Privacy Guarantees.	2011 / 2012
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators.	2011 / 2012
Ranking Spatial Data by Quality Preferences	2011 / 2012
RFID Data Processing in Supply Chain Management Using a Path Encoding Scheme	2011 / 2012
ROBUST MEASURE FOR DISCOUNT FACTORS IN ELECRONIC COMMERCE.	2011 / 2012
Scalable learning of collective behavior.	2011 / 2012
Scalable Scheduling of Updates in Streaming Data Warehouses.	2011 / 2012
Seeking Quality of Web Service Composition in a Semantic Dimension	2011 / 2012
Selecting Attributes for Sentiment Classification Using Feature Relation Networks	2011 / 2012
Semantic Knowledge-Based Framework to Improve the Situation Awareness of Autonomous Underwater Vehicles	2011 / 2012
SPARK2:Top-K Keyword Query in Relational Databases.	2011 / 2012
Straggler Identification in Round-Trip Data Streams via Newton’s Identities and Invertible Bloom Filters	2011 / 2012
SwiftRule: Mining Comprehensible Classification Rules for Time Series Analysis	2011 / 2012
Temporal Data Clustering via Weighted Clustering Ensemble with Different Representations	2011 / 2012
Text Clustering with Seeds Affinity Propagation	2011 / 2012
TEXT: Automatic Template Extraction from Heterogeneous Web Pages	2011 / 2012
The Awareness Network, To Whom Should I Display My Actions? And, Whose Actions Should I Monitor?.	2011 / 2012
The CoQUOS Approach to Continuous Queries in Unstructured Overlays	2011 / 2012
The World in a Nutshell Concise Range Queries.	2011 / 2012
Usher: Improving Data Quality with Dynamic Forms	2011 / 2012
WEB INFORMATION GATHRING USING ONTOLOGY MODEL	2011 / 2012
IEEE TRANSACTION ON MOBILE COMPUTING
A Control-Theoretic Approach to Distributed Optimal Configuration of 802.11 WLANs	2011 / 2012
A Cooperative Clustering Protocol for Energy Saving of Mobile Devices with WLAN and Bluetooth Interfaces	2011 / 2012
A Distributed and Scalable Time Slot Allocation Protocol for Wireless Sensor Networks	2011 / 2012
A Medium Access Control Scheme for Wireless LANs with Constant-Time Contention	2011 / 2012
A Policy Enforcing Mechanism for Trusted Ad Hoc Networks.	2011 / 2012
A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks	2011 / 2012
A Spectrum Decision Framework for Cognitive Radio Networks	2011 / 2012
An Adaptive Network Coded Retransmission Scheme for Single-Hop Wireless Multicast Broadcast Service.	2011 / 2012
An Improved Geocast for Mobile Ad Hoc Networks	2011 / 2012
An Optimal Algorithm for Relay Node Assignment in Cooperative Ad Hoe Networks.	2011 / 2012
Analysis of Best Channel Feedback and Its Adaptive Algorithms for Multicarrier Wireless Data Systems	2011 / 2012
Anticollision Protocols for Single-Reader RFID Systems: Temporal Analysis and Optimization	2011 / 2012
Autonomous Deployment of Heterogeneous Mobile Sensors	2011 / 2012
Breath: An Adaptive Protocol for Industrial Control Applications Using Wireless Sensor Networks	2011 / 2012
Call Admission Control Performance Analysis in Mobile Networks Using Stochastic Well-Fomed Petri Nets.	2011 / 2012
Channel-Aware Routing in MANETs with Route Handoff	2011 / 2012
Cognitive Medium Access: Exploration, Exploitation, and Competition	2011 / 2012
Compatibility between Three Well-Known Broadcast Tree Construction Algorithms and Various Metrics	2011 / 2012
Context-Based Network Estimation for Energy-Efficient Ubiquitous Wireless Connectivity	2011 / 2012
Cooperative Channelization in Wireless Networks with Network Coding.	2011 / 2012
Cross-Layer Optimization for Multimedia Transport over Multicode CDMA Networks	2011 / 2012
Data Delivery Properties of Human Contact Networks	2011 / 2012
DEPLOYMENT OF HETEROGENEOUS MOBILE SENSOR NETWORK.	2011 / 2012
Design and Performance Analysis of Mobility Management Schemes Based on Pointer Forwarding for Wireless Mesh Networks	2011 / 2012
Design and Performance of an Optimal Inertial Power Harvester for Human-Powered Devices	2011 / 2012
Discriminant Minimization Search for Large-Scale RF-Based Localization Systems	2011 / 2012
Distributed Fault-Tolerant Quality of Wireless Networks	2011 / 2012
Distributed Multi-Interface Multichannel Random Access Using Convex Optimization	2011 / 2012
Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries	2011 / 2012
Dynamic Time Slot Partitioning for Multimedia Transmission in Two-Hop Cellular Networks	2011 / 2012
Effective Scheduling in Infrastructure Based Cognitive Radio Networks	2011 / 2012
Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks	2011 / 2012
Efficient Location Training Protocols for Heterogeneous Sensor and Actor Networks	2011 / 2012
Endpoint-Based Call Admission Control and Resource Management for VoWLAN	2011 / 2012
Energy-Efficient Strategies for Cooperative Multi-Channel MAC Protocols.	2011 / 2012
ESIP: Secure Incentive Protocol with Limited Use of Public-Key Cryptography for Multihop Wireless Networks	2011 / 2012
Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing	2011 / 2012
Explicit Congestion Control Algorithms for Time Varying Capacity Media	2011 / 2012
Fast Detection of Mobile Replica Node Attacks in Wireless Sensor Networks Using Sequential Hypothesis Testing Jun- Won	2011 / 2012
Flexible Broadcasting of Scalable Video Streams to Heterogeneous Mobile Devices	2011 / 2012
FULLY DISTRIBUTED CLUSTER BASED FAULT-TOLERANT SERVICE.	2011 / 2012
GREEDY APPROXIMATION ALGORITHM FOR MULTI-HOP WIRELESS NETWORKS.	2011 / 2012
Impact of Limiting Number of Links on the Lifetime of Wireless Sensor Networks.	2011 / 2012
Integration Gain of Heterogeneous WiFi/WiMAX Networks	2011 / 2012
Localization of Mobile Nodes in Wireless Networks with Correlated in Time Measurement Noise.	2011 / 2012
LOCALIZED ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS.	2011 / 2012
MAC Layer Throughput Estimation in Impulse-Radio UWB Networks	2011 / 2012
MAP: Multiauctioneer Progressive Auction for Dynamic Spectrum Access	2011 / 2012
Minimum Bandwidth Reservations for Periodic Streams in Wireless Real-Time Systems	2011 / 2012
MOBILE REPLICA NODE DETECTION SCHEME IN WIRELESS SENSOR NETWORKS.	2011 / 2012
Mobile Sampling of Sensor Field Data Using Controlled Broadcast	2011 / 2012
Mobility Tracking Based on Autoregressive Models	2011 / 2012
Modeling and Improving TCP Performance over Cellular Link with Variable Bandwidth	2011 / 2012
Multicast Throughput for Hybrid Wireless Networks under Gaussian Channel Model	2011 / 2012
MULTI-FRWQUENCY SCHEDULING IN TREE-BASED WIRELESS SENSOR NETWORKS.	2011 / 2012
Network Coding Based Privacy Preservation against Traffic Analysis in Multi-Hop Wireless.	2011 / 2012
Network Connectivity with a Family of Group Mobility Models.	2011 / 2012
OFDM-Based Common Control Channel Design for Cognitive Radio Ad Hoc Networks	2011 / 2012
On the Design of Opportunistic MAC Protocols for Multihop Wireless Networks with Beamforming Antennas	2011 / 2012
On the Effectiveness of Monitoring for Intrusion Detection in Mobile Ad Hoc Networks	2011 / 2012
On the Information Flow Required for Tracking Control in Networks of Mobile Sensing Agents	2011 / 2012
Optimal and Efficient Graph-Based Resource Allocation Algorithms for Multiservice Frame-Based OFDMA Networks	2011 / 2012
Optimal Stochastic Location Updates in Mobile Ad Hoc Networks	2011 / 2012
Privacy-Preserving Universal Authentication Protocol for Wireless Communication.	2011 / 2012
Processing Continuous Range Queries with Spatiotemporal Tolerance	2011 / 2012
QoS-Aware Routing and Admission Control in Shadow-Fading Environments for Multirate MANETs	2011 / 2012
Rendezvous for Cognitive Radios	2011 / 2012
Scalable Localization with Mobility Prediction for Underwater Sensor Networks	2011 / 2012
Scalable Network Synchronization with Pulse-Coupled Oscillators	2011 / 2012
Secret Key Establishment Using Temporally and Spatially Correlated Wireless Channel Coefficients	2011 / 2012
Secure High-Throughput Multicast Routing in Wireless Mesh Networks	2011 / 2012
Secure Network Mobility (SeNEMO) for Real-Time Applications	2011 / 2012
Security Games for Vehicular Networks	2011 / 2012
See-Through Walls: Motion Tracking Using Variance-Based Radio Tomography Networks	2011 / 2012
Spatial-Temporal Coverage Optimization in Wireless Sensor Networks	2011 / 2012
Stealthy Attacks in Wireless Ad Hoc Networks: Detection and Countermeasure	2011 / 2012
Supporting Efficient and Scalable Multicasting over Mobile Ad Hoc Networks	2011 / 2012
Temporal Link Signature Measurements for Location Distinction	2011 / 2012
The HIDENETS Holistic Approach for the Analysis of Large Critical Mobile Systems	2011 / 2012
Throughput Optimization in Mobile Backbone Networks	2011 / 2012
Throughput-Lifetime Trade-Offs in Multihop Wireless Networks under an SINR-Based Interference Model	2011 / 2012
Towards Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks.	2011 / 2012
Towards Zero Retransmission Overhead: A Symbol Level Network Coding Approach to Retransmission	2011 / 2012
Traffic-Differentiation-Based Modular QoS Localized Routing for Wireless Sensor Networks	2011 / 2012
Type-Aware Error Control for Robust Interactive Video Services over Time-Varying Wireless Channels	2011 / 2012
IEEE TRANSACTION ON IMAGE PROCESSING
1-D Transforms for the Motion Compensation Residual	2011 / 2012
A Filtering Approach to Edge Preserving MAP Estimation of Images	2011 / 2012
A Generalized Unsharp Masking Algorithm.	2011 / 2012
A Geometric Method for Optimal Design of Color Filter Arrays	2011 / 2012
A Hybrid Approach to Detect and Localize Texts in Natural Scene Images	2011 / 2012
A Linear Programming Approach for Optimal Contrast-Tone Mapping	2011 / 2012
A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration	2011 / 2012
A Maximum Likelihood Approach to Joint Image Registration and Fusion	2011 / 2012
A New Chaos-Based Cryptosystem for Secure Teransmitted Images.	2011 / 2012
A New Hybrid Method for Image Approximation Using the Easy Path Wavelet Transform	2011 / 2012
A New Scheme for Robust Gradient Vector Estimation in Color Images	2011 / 2012
A Novel 3-D Color Histogram Equalization Method With Uniform 1-D Gray Scale Histogram	2011 / 2012
A Stratified Approach for Camera Calibration Using Spheres	2011 / 2012
A Uniform Framework for Estimating Illumination Chromaticity, Correspondence, and Specular Reflection	2011 / 2012
A Variational Model for Histogram Transfer of Color Images	2011 / 2012
A Variational Model for Segmentation of Overlapping Objects With Additive Intensity Value	2011 / 2012
Accelerating X-Ray Data Collection Using Pyramid Beam Ray Casting Geometries	2011 / 2012
Adaptive Multiwavelet-Based Watermarking Through JPW Masking	2011 / 2012
Adaptive Sequential Prediction of Multidimensional Signals With Applications to Lossless Image Coding	2011 / 2012
An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems	2011 / 2012
An Improved Image Compression Algorithm Using Binary Space Partition Scheme and Geometric Wavelets	2011 / 2012
An Iterative Shrinkage Approach to Total-Variation Image Restoration	2011 / 2012
An Optimal Data Hiding Scheme With Tree-Based Parity Check	2011 / 2012
An Optimum Land Cover Mapping Algorithm in the Presence of Shadows.	2011 / 2012
An Orientation Inference Framework for Surface Reconstruction From Unorganized Point Clouds	2011 / 2012
Anisotropic Morphological Filters With Spatially-Variant Structuring Elements Based on Image-Dependent Gradient Fields	2011 / 2012
Autofluorescence Removal by Non-Negative Matrix Factorization	2011 / 2012
Automatic Exact Histogram Specification for Contrast Enhancement and Visual System Based Quantitative Evaluation	2011 / 2012
Balanced Multifilter Banks for Multiple Description Coding	2011 / 2012
Balanced Multiwavelets With Interpolatory Property	2011 / 2012
Blind Deconvolution Using Generalized Cross-Validation Approach to Regularization Parameter Estimation	2011 / 2012
Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization	2011 / 2012
Boosting Color Feature Selection for Color Face Recognition	2011 / 2012
Characterization of Electrophotographic Print Artifacts: Banding, Jitter, and Ghosting	2011 / 2012
Classification-Based Adaptive Filtering for Multiframe Blind Image Restoration	2011 / 2012
Color Extended Visual Cryptography Using Error Diffusion	2011 / 2012
Combined Invariants to Similarity Transformation and to Blur Using Orthogonal Zernike Moments	2011 / 2012
Comments on “Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering”	2011 / 2012
Compressibility-Aware Media Retargeting With Structure Preserving	2011 / 2012
Computational Perceptual Features for Texture Representation and Retrieval	2011 / 2012
Constrained Acquisition of Ink Spreading Curves From Printed Color Images	2011 / 2012
Contactless and Pose Invariant Biometric Identification Using Hand Surface	2011 / 2012
Contextual Kernel and Spectral Methods for Learning the Semantics of Images	2011 / 2012
Contextual Object Localization With Multiple Kernel Nearest Neighbor	2011 / 2012
Convex Total Variation Denoising of Poisson Fluorescence Confocal Images With Anisotropic Filtering	2011 / 2012
Correspondence Lazy Sliding Window Implementation of the Bilateral Filter on Parallel Architectures	2011 / 2012
Dealing With Parallax in Shape-From-Focus	2011 / 2012
Denoising-Enhancing Images on Elastic Manifolds	2011 / 2012
Dictionary Learning for Stereo Image Representation	2011 / 2012
Diffuse Prior Monotonic Likelihood Ratio Test for Evaluation of Fused Image Quality Measures	2011 / 2012
Direct Intermode Selection for H.264 Video Coding Using Phase Correlation	2011 / 2012
Discretization Error Analysis and Adaptive Meshing Algorithms for Fluorescence Diffuse Optical Tomography in the Presence of Measurement	2011 / 2012
Distributed Multiple Description Video Coding on Packet Loss Channels	2011 / 2012
Efficiently Learning a Detection Cascade With Sparse Eigenvectors	2011 / 2012
Elastic Sequence Correlation for Human Action Analysis	2011 / 2012
Enhanced Shift and Scale Tolerance for Rotation Invariant Polar Matching With Dual-Tree Wavelets	2011 / 2012
Face Recognition by Exploring Information Jointly in Space, Scale and Orientation	2011 / 2012
Face Recognition System Using Multiple Face Model of Hybrid Fourier Feature Under Uncontrolled Illumination Variation	2011 / 2012
Fast Model-Based X-Ray CT Reconstruction Using Spatially Nonhomogeneous ICD Optimization	2011 / 2012
FAST Rate Allocation Through Steepest Descent for JPEG2000 Video Transmission	2011 / 2012
Fast Sparse Image Reconstruction Using Adaptive Nonlinear Filtering	2011 / 2012
Fine-Granularity and Spatially-Adaptive Regularization for Projection-Based Image Deblurring	2011 / 2012
Fractal Dimension of Color Fractal Images	2011 / 2012
From Local Pixel Structure to Global Image Super-Resolution: A New Face Hallucination Framework	2011 / 2012
From Point to Local Neighborhood: Polyp Detection in CT Colonography Using Geodesic Ring Neighborhoods	2011 / 2012
From Tiger to Panda: Animal Head Detection	2011 / 2012
Fuzzy Random Impulse Noise Removal From Color Image Sequences	2011 / 2012
Geodesic Active Fields—A Geometric Framework for Image Registration	2011 / 2012
Geometric Calibration of Lens and Filter Distortions for Multispectral Filter-Wheel Cameras	2011 / 2012
Geometrically Induced Force Interaction for Three-Dimensional Deformable Models	2011 / 2012
Goal-Oriented Rectification of Camera-Based Document Images	2011 / 2012
Gradient Profile Prior and Its Applications in Image Super-Resolution and Enhancement	2011 / 2012
Graph Cuts for Curvature Based Image Denoising	2011 / 2012
Graph Laplace for Occluded Face Completion and Recognition	2011 / 2012
Graph Regularized Sparse Coding for Image Representation	2011 / 2012
HAIRIS: A Method for Automatic Image Registration Through Histogram-Based Image Segmentation	2011 / 2012
HIGH CAPACITY COLOR BARCODES FOR DATA ENCODING.	2011 / 2012
High Capacity Color Barcodes: Per Channel Data Encoding via Orientation Modulation in Elliptical Dot Arrays	2011 / 2012
High Dynamic Range Image Display With Halo and Clipping Prevention	2011 / 2012
High-quality Reflection Separation using Polarized Images.	2011 / 2012
High-Resolution Imaging Via Moving Random Exposure and Its Simulation	2011 / 2012
Human Motion Tracking by Temporal-Spatial Local Gaussian Process Experts	2011 / 2012
Hybrid No-Reference Natural Image Quality Assessment of Noisy, Blurry, JPEG2000, and JPEG Images	2011 / 2012
Hyperspectral BSS Using GMCA With Spatio-Spectral Sparsity Constraints	2011 / 2012
Illumination Recovery From Image With Cast Shadows Via Sparse Representation	2011 / 2012
Image Denoising in Mixed Poisson–Gaussian Noise	2011 / 2012
IMAGE Resolution Enhancement by Using Discrete and Stationary Wavelet Decomposition	2011 / 2012
Image Segmentation Using Fuzzy Region Competition and Spatial/Frequency Information	2011 / 2012
In Search of Perceptually Salient Groupings	2011 / 2012
Incremental Training of a Detector Using Online Sparse Eigen decomposition	2011 / 2012
Information Content Weighting for Perceptual Image Quality Assessment	2011 / 2012
Interactive Streaming of Stored Multi view Video Using Redundant Frame Structures	2011 / 2012
Inverse Half toning Based on the Bayesian Theorem	2011 / 2012
Iterative Shrinkage Approach to Restoration of Optical Imagery	2011 / 2012
JPEG2000-Based Scalable Interactive Video (JSIV)	2011 / 2012
Kernel Maximum Autocorrelation Factor and Minimum Noise Fraction Transformations	2011 / 2012
Large Disparity Motion Layer Extraction via Topological Clustering	2011 / 2012
Light Field Analysis for Modeling Image Formation	2011 / 2012
Lightweight Detection of Additive Watermarking in the DWT-Domain	2011 / 2012
Measuring the Quality of Quality Measures	2011 / 2012
Missing Intensity Interpolation Using a Kernel PCA-Based POCS Algorithm and its Applications	2011 / 2012
MOTION DETECTION TECHNIQUE FRO VIDEO SEQUENCES.	2011 / 2012
Multidimensional Filter Bank Signal Reconstruction From Multichannel Acquisition	2011 / 2012
Multiple Player Tracking in Sports Video: A Dual-Mode Two-Way Bayesian Inference Approach With Progressive Observation Modeling	2011 / 2012
Multiregion Image Segmentation by Parametric Kernel Graph Cuts	2011 / 2012
Natural Image Segmentation Based on Tree Equipartition, Bayesian Flooding and Region Merging	2011 / 2012
Non rigid Registration of 2-D and 3-D Dynamic Cell Nuclei Images for Improved Classification of Sub-cellular Particle Motion	2011 / 2012
Nonlocal Mumford-Shah Regularizers for Color Image Restoration	2011 / 2012
Nonlocal PDEs-Based Morphology on Weighted Graphs for Image and Data Processing	2011 / 2012
Non-uniform Directional Filter Banks With Arbitrary Frequency Partitioning	2011 / 2012
No-Reference Blur Assessment of Digital Pictures Based on Multi-feature Classifiers	2011 / 2012
On a Derivative-Free Fan-Beam Reconstruction Formula	2011 / 2012
On the Selection of Optimal Feature Region Set for Robust Digital Image Watermarking	2011 / 2012
Online Sparse Gaussian Process Regression and Its Applications	2011 / 2012
Optimal Design of FIR Triplet Halfband Filter Bank and Application in Image Coding	2011 / 2012
Optimal Image Alignment With Random Projections of Manifolds: Algorithm and Geometric Analysis	2011 / 2012
Optimal Inversion of the Anscombe Transformation in Low-Count Poisson Image Denoising	2011 / 2012
Optimizing a Tone Curve for Backward-Compatible High Dynamic Range Image and Video Compression	2011 / 2012
Paramer Mismatch-Based Spectral Gamut Mapping	2011 / 2012
Passive Polarimetric Imagery-Based Material Classification Robust to Illumination Source Position and Viewpoint	2011 / 2012
Perceptual Segmentation: Combining Image Segmentation With Object Tagging	2011 / 2012
Performance Analysis of n-Channel Symmetric FEC-Based Multiple Description Coding for OFDM Networks	2011 / 2012
Practical Bounds on Image Denoising: From Estimation to Information	2011 / 2012
Proto-Object Based Rate Control for JPEG2000: An Approach to Content-Based Scalability	2011 / 2012
PSF Estimation via Gradient Domain Correlation.	2011 / 2012
Quality Assessment of Deblocked Images	2011 / 2012
Random N-Finder (N-FINDR) Endmember Extraction Algorithms for Hyperspectral Imagery	2011 / 2012
Random Phase Textures: Theory and Synthesis	2011 / 2012
Rate Control Scheme for Consistent Video Quality in Scalable Video Code	2011 / 2012
Real time artifact-free image up scaling.	2011 / 2012
Real-Time Discriminative Background Subtraction	2011 / 2012
Reference Sharing Mechanism for Watermark Self-Embedding	2011 / 2012
Regularized Background Adaptation: A Novel Learning Rate Control Scheme for Gaussian Mixture Modeling	2011 / 2012
Resolution Scalable Image Coding With Reversible Cellular Automata	2011 / 2012
Robust Principal Component Analysis Based on Maximum Correntropy Criterion	2011 / 2012
Salient Motion Features for Video Quality Assessment	2011 / 2012
Size-Controllable Region-of-Interest in Scalable Image Representation	2011 / 2012
Spatial Sparsity-Induced Prediction (SIP) for Images and Video: A Simple Way to Reject Structured Interference	2011 / 2012
Spatiotemporal Localization and Categorization of Human Actions in Unsegmented Image Sequences	2011 / 2012
Stationary Probability Model for Bitplane Image Coding Through Local Average of Wavelet Coefficients	2011 / 2012
Structured Max-Margin Learning for Inter-Related Classifier Training and Multilabel Image Annotation	2011 / 2012
Studentized Dynamical System for Robust Object Tracking	2011 / 2012
Sub-Hexagonal Phase Correlation for Motion Estimation	2011 / 2012
Subpixel Registration With Gradient Correlation	2011 / 2012
Text From Corners: A Novel Approach to Detect Text and Caption in Videos	2011 / 2012
The Roadmaker’s Algorithm for the Discrete Pulse Transform	2011 / 2012
The Sparse Matrix Transform for Covariance Estimation and Analysis of High Dimensional Signals	2011 / 2012
Tomographic Reconstruction of Gated Data Acquisition Using DFT Basis Functions	2011 / 2012
Topological Well-Composedness and Glamorous Glue: A Digital Gluing Algorithm for Topologically Constrained Front Propagation	2011 / 2012
Total Variation Projection With First Order Schemes	2011 / 2012
Transferring Boosted Detectors Towards Viewpoint and Scene Adaptiveness	2011 / 2012
Two Efficient Label-Equivalence-Based Connected-Component Labeling Algorithms for 3-D Binary Images	2011 / 2012
Unequal Protection of Video Data According to Slice Relevance	2011 / 2012
Uniform Motion Blur in Poissonian Noise: Blur/Noise Tradeoff	2011 / 2012
Variable Length Open Contour Tracking Using a Deformable Trellis	2011 / 2012
Variational Bayesian Super Resolution	2011 / 2012
ViBe: A Universal Background Subtraction Algorithm for Video Sequences	2011 / 2012
Video Tracking Based on Sequential Particle Filtering on Graphs	2011 / 2012
Window-Level Rate Control for Smooth Picture Quality and Smooth Buffer Occupancy	2011 / 2012
IEEE TRANSACTION ON CLOUD COMPUTING
A Assertion Based Parallel Debugging	2011 / 2012
A Data Throughput Prediction and Optimization Service for Widely Distributed Many-task Computing.	2011 / 2012
A Hybrid Shared-nothing/Shared-data Storage Architecture for Large Scale Databases	2011 / 2012
A performance goal oriented processor allocation technique for centralized heterogeneous multi-cluster environments	2011 / 2012
A Petri Net Approach to Analyzing Behavioral Compatibility and Similarity of Web Services	2011 / 2012
A Privacy Preserving Repository for Securing Data across the Cloud	2011 / 2012
A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public Verifiability.	2011 / 2012
A Scalable Method for Signalling Dynamic Reconfiguration Events with OpenSM	2011 / 2012
A Segment-Level Adaptive Data Layout Scheme for Improved Load Balance in Parallel File Systems	2011 / 2012
A Sketch-based Architecture for Mining Frequent Items and Itemsets from Distributed Data Streams	2011 / 2012
A Trustworthiness Fusion Model for Service Cloud Platform Based on D-S Evidence Theory	2011 / 2012
A Venture Perspective on Cloud Computing.	2011 / 2012
Addressing Resource Fragmentation in Grids Through Network–Aware Meta–Scheduling in Advance	2011 / 2012
APP: Minimizing Interference Using Aggressive Pipelined Prefetching In Multi-Level Buffer Caches	2011 / 2012
ASDF: An Autonomous and Scalable Distributed File System	2011 / 2012
Automatic and Unsupervised Snore Sound Extraction From Respiratory Sound Signals	2011 / 2012
Autonomic SLA-driven Provisioning for Cloud Applications	2011 / 2012
BAR: An Efficient Data Locality Driven Task Scheduling Algorithm for Cloud Computing	2011 / 2012
Building an online domain-specific computing service over non-dedicated grid and cloud resources: the Superlink-online experience	2011 / 2012
Cheetah: A Framework for Scalable Hierarchical Collective Operations	2011 / 2012
Classification and Composition of QoS Attributes in Distributed, Heterogeneous Systems	2011 / 2012
Cloud MapReduce: a MapReduce Implementation on top of a Cloud Operating System	2011 / 2012
Cloud Technologies for Bioinformatics Applications	2011 / 2012
CloudSpider: Combining Replication with Scheduling for Optimizing Live Migration of Virtual Machines Across Wide Area Networks	2011 / 2012
Data Integrity Proofs in Cloud Storage	2011 / 2012
Dealing with Grid-Computing Authorization using Identity-Based Certificateless Proxy Signature	2011 / 2012
Debunking Real-Time Pricing in Cloud Computing	2011 / 2012
DELMA: Dynamically ELastic MApReduce Framework for CPU-Intensive Applications	2011 / 2012
Detection and Protection against Distributed Denial of Service Attacks in Accountable Grid Computing Systems	2011 / 2012
Development Inferring Network Topologies in Infrastructure as a Service Cloud	2011 / 2012
DHTbd: A Reliable Block-based Storage System for High Performance Clusters	2011 / 2012
Diagnosing Anomalous Network Performance with Confidence	2011 / 2012
Directed Differential Connectivity Graph of Interictal Epileptiform Discharges	2011 / 2012
Driver Drowsiness Managing distributed files with RNS in heterogeneous Data Grids	2011 / 2012
Dynamic Brain Phantom for Intracranial Volume Measurements	2011 / 2012
EduCloud: Paas versus Iaas Cloud Usage for an Advanced Computer Science course.	2011 / 2012
Enabling Multi-Physics Coupled Simulations within the PGAS Programming Framework	2011 / 2012
Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing.	2011 / 2012
ENHANCEMENT OF PUBLIC AUDITABILITY AND POTENTIAL SECURITY IN CLOUD COMPUTING.	2011 / 2012
Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud	2011 / 2012
Failure Avoidance through Fault Prediction Based on Synthetic Transactions	2011 / 2012
Finite-Element-Based Discretization and Regularization Strategies for 3-D Inverse Electrocardiography	2011 / 2012
GeoServ: A Distributed Urban Sensing Platform	2011 / 2012
Going Back and Forth Efficient Multideployment and Multisnapshotting on Clouds	2011 / 2012
GPGPU-Accelerated Parallel and Fast Simulation of Thousand-core Platforms	2011 / 2012
Grid Global Behavior Prediction	2011 / 2012
High Performance Pipelined Process Migration with RDMA	2011 / 2012
Improving Utilization of Infrastructure Clouds	2011 / 2012
Independently Verifiable Decentralized Role-Based Delegation.	2011 / 2012
Modified Kinematic Technique for Measuring Pathological Hyperextension and Hypermobility of the Interphalangeal Joints	2011 / 2012
Multi-Cloud Deployment of Computing Clusters for Loosely-Coupled MTC Applications	2011 / 2012
Multiple Services Throughput Optimization in a Hierarchical Middleware	2011 / 2012
Network-Friendly One-Sided Communication Through Multinode Cooperation on Petascale Cray XT5 Systems	2011 / 2012
Neural Control of Posture During Small Magnitude Perturbations: Effects of Aging and Localized Muscle Fatigue	2011 / 2012
Non-Cooperative Scheduling Considered Harmful in Collaborative Volunteer Computing Environments	2011 / 2012
On the Performance Variability of Production Cloud Services	2011 / 2012
On the Relation Between Congestion Control, Switch Arbitration and Fairness	2011 / 2012
On the Scheduling of Checkpoints in Desktop Grids	2011 / 2012
Optimal service pricing for a cloud cache	2011 / 2012
Optimization of Resource Provisioning Cost in Cloud Computing.	2011 / 2012
Parameter Exploration in Science and Engineering Using Many-Task Computing	2011 / 2012
Performance Analysis of Cloud Computing Services for Many-Tasks Scientific Computing	2011 / 2012
Predictive Data Grouping and Placement for Cloud-based Elastic Server Infrastructures	2011 / 2012
Resource and Revenue Sharing with Coalition Formation of Cloud Providers: Game Theoretic Approach	2011 / 2012
Robust Execution of Service Workflows Using Redundancy and Advance Reservations	2011 / 2012
Role-Based Access-Control Using Reference Ontology in Clouds	2011 / 2012
Secure and Practical Outsourcing of Linear Programming in Cloud Computing	2011 / 2012
SLA-based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments	2011 / 2012
Small Discrete Fourier Transforms on GPUs	2011 / 2012
Supply Chain as a Service:A Cloud Perspective on Supply Chain Systems.	2011 / 2012
Techniques for fine-grained, multi-site computation offloading	2011 / 2012
The Benefits of Estimated Global Information in DHT Load Balancing	2011 / 2012
Towards Real-Time, Volunteer Distributed Computing	2011 / 2012
Towards Reliable, PerformantWorkflows for Streaming-Applications on Cloud Platforms	2011 / 2012
Towards Secure and Dependable Storage Services in Cloud Computing	2011 / 2012
Utilizing “Opaque” Resources for Revenue Enhancement on Clouds and Grids	2011 / 2012
IEEE TRANSACTION ON GRID COMPUTING
A Passive Solution to the CPU Resource Discovery Problem in Cluster Grid Networks.	2011 / 2012
ABACS:An Attribute-Based Access Control System for Emergency Services over Vehicular Ad Hoe Networks.	2011 / 2012
Collective Receiver-initiated Multicast for Grid Applications.	2011 / 2012
Data Replication in Data Intensive Scientific Applications with Performance Guarantee.	2011 / 2012
Demand Response Scheduling by Stochastic SCUC.	2011 / 2012
Efficient Bidding in Dynamic Grid Markets	2011 / 2012
Efficiently  Acquiring Communication Traces for Large-scale Parallel Applications.	2011 / 2012
Expanding Service Capacities and Increasing Service Reliabilities for the Grid-Based Utility Computing.	2011 / 2012
MANY-TASK COMPUTING FOR SCIENCE AND ENGINEERING DESIGN PROBLEMS.	2011 / 2012
online System for Grid Resource Monitoring and Machine learning based Prediction.	2011 / 2012
Reputation-Based Trust for a Coorperative Agent-Based Backup Protection Scheme.	2011 / 2012
Scheduling Grid Tasks in Face of Uncertain Communication Demands.	2011 / 2012
IEEE TRANSACTION ON SOFTWARE ENGINEERING
A Controlled Experiment for Program Comprehension through Trace Visualization	2011 / 2012
A General Software Defect-Proneness Prediction Framework	2011 / 2012
A Web Development Platform Comparison by an Exploratory Experiment Searching for Emergent Platform Properties	2011 / 2012
A WEB DEVELOPMENT PLATFORM COMPARISON FOR EMERGENT PLATFORM PROPARTIES.	2011 / 2012
An Attack Surface Metric	2011 / 2012
Assessing, Comparing, and Combining State Machine-Based Testing and Structural Testing: A Series of Experiments	2011 / 2012
Automatically detecting and tracking inconsistence in software design Model	2011 / 2012
Comparing the Defect Reduction Benefits of Code Inspection and Test-Driven Development.	2011 / 2012
Deriving a Slicing Algorithm via FermaT Transformations	2011 / 2012
Developing a Single Model and Test Prioritization Strategies for Event-Driven Software	2011 / 2012
Dynamic Qos Management and Optimization in Service-Based Systems	2011 / 2012
Efficient Consistency Measurement Based on Behavioral Profiles of process Model	2011 / 2012
EVALUTE THE QUALITY OF IDENTIFYERS AND COMMENTS OF THE SOURCE CODE.	2011 / 2012
Exploiting the Essential Assumptions of Analogy-based Effort Estimation.	2011 / 2012
Facilitating Trust in Privacy-Preserving E-leaning Environments.	2011 / 2012
From UML to Petri Nets: The PCM-Based Methodology	2011 / 2012
Genetic Algorithms for Randomized Unit Testing	2011 / 2012
Improving Source Code Lexicon via Traceability and Information Retrieval	2011 / 2012
Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens	2011 / 2012
Plat_forms:A Web Development Platform Comparison by an Exploratory Experiment Searching for Emergent Platform Properties.	2011 / 2012
Securing Cookies with a MAC Address Encrypted Key Ring	2011 / 2012
Self-Supervising BPEL Processes	2011 / 2012
Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging	2011 / 2012
Software Module Clustering as a Multi-Objective Search Problem	2011 / 2012
Systematic Review and Aggregation of Empirical Studies on Elicitation Techniques	2011 / 2012
The Awareness Network, To Whom Should I Display My Actions And, Whose Actions Should I Monitor	2011 / 2012
Verifying the Evolution of Probability Distributions Governed by a DTMC	2011 / 2012
IEEE TRANSACTION ON MULTIMEDIA
A Two-Channel Overlapped Block Transform for Image Compression.	2011 / 2012
A User-Oriented Image Retrival System Based on Interative Genetic Algorithm.	2011 / 2012
An Affine Symmetric Image.	2011 / 2012
Fine-Granularity and Spatially Adaptive Regularization for Projection-Based image Deblurring.	2011 / 2012
Improving Shape Retrieval by Spectral Matching and Meta Similarity.	2011 / 2012
Interactive Image Segmentation With Multiple Linear Reconstructions in Windows.	2011 / 2012
On the Selection of Optimal Feature Region Set for Robust Digital Image Watermarking.	2011 / 2012
OPTIMAL STRATEGIES FOR COLLUDERS IN MULTIMEDIA FINGER PRINTING SOCIAL NETWORKS.	2011 / 2012
Tag Tagging: Towards More Descriptive Keywords of Image content.	2011 / 2012
UNSUPERVISED SEGMENTATION ALGORITHM FOR EXTRACTING MOVING REGIONS FROM COMPRESSED VIDEO.	2011 / 2012
Video Streaming Distribution in VANETs	2011 / 2012
IEEE TRANSACTION ON WIRELESS COMMUNICATION
Network Coding Based Privacy Preservation against Traffic Analysis in Multi-hop Wireless Network	2011 / 2012
Throughput Optimization in High Speed Downlink Packet Access (HSDPA).	2011 / 2012
Distributed Adaptation of Quantized Feedback for Downlink Network MIMO Systems.	2011 / 2012
A Spatiotemporal Approach for Secure Range Queries in Tiered Sensor Networks.	2011 / 2012
IEEE TRANSACTION ON PARALLEL AND DISTRIBUTION SYSTEM
MAX-MIN FAIR QOS PROVISIONING UNDER INTERFERENCE CONSTRAINTS.	2011 / 2012
FLOODING SEARCH STRATEGY FOR DECENTRALIZED UNSTRUCTURED PEER-TO-PEER-NETWORKS.	2011 / 2012
NOVAL LOAD BALANCING ALGORITHM FOR PEER TO PEER NETWORK.	2011 / 2012
A Data Throughput Prediction and Optimization Service for Widely Distributed Many-Task Computing	2011 / 2012
Network Immunization with Distributed Autonomy-Oriented Entities	2011 / 2012
Performance Analysis of Cloud Computing Services for Many-Tasks Scientific Computing	2011 / 2012
A Distributed Algorithm for the Replica Placement Problem	2011 / 2012
Design and Analysis of a Reconfigurable Platform for Frequent Pattern Mining	2011 / 2012
Performance Analysis of Real-Time Detection in Fusion-Based Sensor Networks	2011 / 2012
Traffic-Aware Dynamic Routing to Alleviate Congestion in Wireless Sensor Networks	2011 / 2012
IEEE TRANSACTION ON INFORMATION FORENSICS
DETECTION OF DISTRIBUTED DENIAL OF SERVICE ATTACK USING INFORMATION METRICS.	2011 / 2012
CONSTRUCTION OF EXTENDED VISUAL CRYPTOGRAPHY SCHEME.	2011 / 2012
THE PROCESSING AND EX-PLORATORY ANALYSIS OF GENE EXPRESSION DATA.	2011 / 2012
IEEE TRANSACTION ON MEDICAL IMAGE PROCESSING
MAGNETIC RESONANCE IMAGES RECONSTRUCTION FROM K-SPACE DATA.	2011 / 2012
IEEE TRANSACTION ON NEURAL NETWORK	2011 / 2012
BRAIN WAVE MEASUREMENTS USING DIAGNOSTIC TECHNOLOGY FOR CONSCIOUS AWARENESS.	2011 / 2012
IEEE TRANSACTION ON SERVICE COMPUTING
STYLIZED BUSINESS CASE OUTLINES FOR EFFICIENT AND CONTINUOUS EXECUTION OF BUSINESS.	2011 / 2012
EXTENSIBLE ACCESS CONTROL LANGUAGE FOR WEB SERVICE.	2011 / 2012
BUSINESS PROCESS EXECUTION LANGUAGE FOR ATOMIC TRANSACTION AND BUSINESS ACTIVITY.	2011 / 2012
Vulnerability Analysis in SOA-based Business Processes.	2011 / 2012
Automated Certification for Compliant Cloud-based Business Processes.	2011 / 2012
Service-Centric Framework for a Digital Government Application.	2011 / 2012
Ontology-Based Business Process Customization for Composite Web Services.	2011 / 2012
OWLPath: An OWL Ontology-Guided Query Editor.	2011 / 2012
Monitoring Service Systems from a Language-Action Perspective	2011 / 2012
IEEE TRANSACTION ON SECURE COMPUTING
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree	2011 / 2012
A Policy Enforcing Mechanism for Trusted Ad Hoc Network.	2011 / 2012
Adaptive Fault Tolerant QoS Control Algorithms for Maximizing System Lifetime of Query-Based Wireless Sensor Networks.	2011 / 2012
Analyzing a Family of Key Protection Schemes against Modification Attacks	2011 / 2012
Anomaly Detection in Network Traffic Based on Statistical Inference and Stable Modeling	2011 / 2012
Chip Self-Organization and Fault-Tolerance in Massively Defective Multicore Arrays	2011 / 2012
Comparative Evaluation of Spooing Defense	2011 / 2012
Distributed Detection of Clone Attacks in Wireless Sensor Networks	2011 / 2012
Dynamics of Malware Spread in Decentralized Peer-to-Peer Networks	2011 / 2012
ELMO Energy Aware Local Monitoring in Sensor Networks	2011 / 2012
Improving Security and Performance in the Tor Network through Tunable Path Selection	2011 / 2012
Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET	2011 / 2012
Modeling and Detection of Camouaging Worm	2011 / 2012
Nymble Blocking Misbehaving Users in Anonymizing Networks	2011 / 2012
Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables	2011 / 2012
RITAS Services for Randomized Intrusion Tolerance	2011 / 2012
Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking	2011 / 2012
The Geometric Efficient Matching Algorithm for Firewalls.	2011 / 2012
IEEE TRANSACTION ON NETWORK AND SERVICE MANAGEMENT
A distributed and Dynamic System for Detecting Malware	2011 / 2012
A Flexible Data and Sensor Planning Service for Virtual Sensors Based on Web Service	2011 / 2012
A New Security Model Based on Fingerprint Recognition for Personal Learning	2011 / 2012
A Petri Net Approach to Analyzing Behavioral Compatibility and Similarity of Web Services	2011 / 2012
A Research of On-Line Static Security Analysis Based On WEB Services	2011 / 2012
A Web services and agents-based approach for a better interoperability of enterprises	2011 / 2012
Agent based Middleware for Private Data Mashup in IPTV Recommender Services	2011 / 2012
An Enterprise Ontology-Based Approach to Service Specification	2011 / 2012
An Integrated Approach to Automated Semantic Web Service Composition through Planning	2011 / 2012
An Intrusion-Detection Model Based on Fuzzy Class-Association-Rule Mining Using Genetic Network Programming	2011 / 2012
An Ontological Approach to Inter-operation of Mobile Services	2011 / 2012
Building Association Link Network for Semantic Link on Web Resources	2011 / 2012
Employing Collective Intelligence for User Driven Service Creation	2011 / 2012
Expert Discovery and Interactions in Mixed Service-Oriented Systems	2011 / 2012
Geospatial Web Service for Remote Sensing data visualization	2011 / 2012
IDMS: an Information Discovery and Monitoring System for Web Services on Grid	2011 / 2012
Integration Platform for Home and Building Automation Systems	2011 / 2012
Locating Ontologies for Web Services Annotation	2011 / 2012
Measuring Client-Perceived Pageview Response Time of Internet Services	2011 / 2012
Ontology-Based Business Process Customization for Composite Web Services	2011 / 2012
Reformulating user’s queries for Intentional Services Discovery using an Ontology-based Approach	2011 / 2012
Seeking Quality of Web Service Composition in a Semantic Dimension	2011 / 2012
Semantic information integration for electronic patient records using ontology and web services model	2011 / 2012
Semantic Service Discovery based on Parametric Dependency Relations	2011 / 2012
Separating Operational and Control Behaviors: A New Approach to Web Services Modeling	2011 / 2012
The Design and Implementation of Civil Aviation Electronic Government System Based on SOA	2011 / 2012
Towards a Self-Healing Approach to Sustain Web Services Reliability	2011 / 2012
Using Web – Developer Technologies for Building an Academic Service.	2011 / 2012
Achieving Bounded Matching Delay and Maximized Throughput in Information Dissemination Management	2011 / 2012
Locating Equivalent Servants over P2P Networks	2011 / 2012

3:32 PM - By Reetha 0