Final list

Domain DIP IEEE/NON IEEE Project Titles IEEE Base Paper Link A spatial median filter for IEEE 2008 http://ieeexplore.ieee.org/search/fre noise removal in digital esearchresult.jsp?reload=true&news images earch=true&queryText=A+spatial+me dian+filter+for+noise+removal+in+dig ital+images&x=33&y=10 Sliced Ridgelet Transform IEEE 2006 http://ieeexplore.ieee.org/search/fre for Image Denoising esearchresult.jsp?newsearch=true&q ueryText=Sliced+Ridgelet+Transform +for+Image+Denoising&x=73&y=17 Description In this paper, six different image filtering algorithms are compared based on their ability to reconstruct noiseaffected images. The purpose of these algorithms is to remove noise from a signal that might occur through the transmission of an image. A new algorithm, the spatial median filter, is introduced and compared with current image smoothing techniques. Experimental results demonstrate that the proposed algorithm is comparable to these techniques. A modification to this algorithm is introduced to achieve more accurate reconstructions over other popular techniques. Image denoising based on curvelet transforms gives better results than image denoising based on the standard ridgelet transforms. This paper introduces an approach for image denoising that is based on ridgelets computed in a localized manner and that is computationally less intensive than curvelets, but with similar denoising performance. In this localized ridgelet transform, denoted sliced ridgelet transform, the ridge function is divided into several slices of constant length. The projection of each slice at a certain angle is computed and followed by a one-dimensional wavelet transform, to produce the ridgelet coefficients for each slice. The denoising operation corresponds to a simple thresholding of these ridgelet coefficients. Finally, inverse wavelet transform and inverse Radon transform are applied to the denoised ridgelet coefficients, to reconstruct a denoised version of the input image In this paper we present a blind low frequency watermarking scheme on gray level images, which is based on DCT transform and spread spectrum communications technique. We compute the DCT of non overlapping 8x8 blocks of the host image, then using the DC coefficients of each block we construct a low-resolution approximation image. We apply block based DCT on this approximation image, then a pseudo random noise sequence is added into its high frequencies Inner voice transmission development by ultrasound and microwave technique is reviewed as well as target tracking literature. References recognizing behavioral influence technologies are surveyed along with reported instances of the use of microwave and ultrasound energy forms on people. Many aspects of the considered literature directly contradict professional presumptions, particularly within the psychological and psychiatric communities. Speech recognition is the process of converting an acoustic signal, captured by a microphone or a telephone, to a set of words. The recognized words can be the final results, as for applications such as commands & control, data entry, and document preparation. They can also serve as the input to further linguistic processing in order to achieve speech understanding, a subject covered in section Speech recognition systems can be characterized by many parameters, some of the more important An isolated-word speech recognition system requires that the speaker pause briefly between words, whereas a continuous speech recognition system does not. Spontaneous, or extemporaneously generated, speech contains disfluencies, and is much more difficult to recognize than speech read from script. Some systems require speaker enrollment---a user must provide samples of his or her speech before using them, whereas other systems are said to be speaker-independent, in that no enrollment is necessary.

DIP

DIP

DIP

A Robust Image Water IEEE 2009 http://ieeexplore.ieee.org/search/fre marking using two level esearchresult.jsp?newsearch=true&q DCT ueryText=A+Robust+Image+Water+m arking+using+two+level+DCT&x=0&y =0 Implementation of target NON IEEE tracking using kalman filter.

DSP

Spoken digit recognition using MATLAB NON IEEE

Page 1

Final list
DSP Implementation of GMSK NON IEEE in radio communication. Demand of future wireless communication services will require an always-on connection according to the Quality of Service QoS and provider service. This QoS involve multiple Wireless standards that require intelligent and dynamic portable device. Wireless modems are key part of mobile devices in adequate transmissions according to QoS. In order to adapt different wireless standard, future radios will need to be implemented on software form, Thanks to DSP and wireless technologies; today software modem radios for 2 and 2.5 Generations have already been implemented . Here, we have analyzed and implemented a GMSK modem. A key feature of this modem is the design of an integer k sampling time a table bit rate independent. Initial proposals for OFDM were made in the 60s and the 70s. It has taken more than a quarter of a century for this technology to move from the research domain to the industry.The concept of OFDM is quite simple but the practicality of implementing it has many complexities.So, it is a fully software project. OFDM depends on Orthogonality principle. Orthogonality means, it allows the sub carriers, which are orthogonal to each other, meaning that cross talk between co-channels is eliminated and inter-carrier guard bands are not required. This greatly simplifies the design of both the transmitter and receiver, unlike conventional FDM; a separate filter for each sub channel is not required. Orthogonal Frequency Division Multiplexing (OFDM) is a digital multi carrier modulation scheme, which uses a large number of closely spaced orthogonal sub-carriers.

DSP

Channel estimation for NON IEEE wireless communication using OFDM systems

DIP

Image water using transforms.

DIP

VLSI

In this project, we use the DWT for embedding the watermark. The multi resolution wavelet transform of an image decomposes the image into bands of approximately equal bandwidth on a logarithmic scale. Similarly, the retina of the human eye splits the image into several components, each having a bandwidth of approximately one octave. Therefore, it is believed that the use of DWT for watermarking will produce an imperceptible watermark. The use of the DWT domain for image watermarking and denoising has been studied in detail. The DWT splits the signal into high and low frequency parts. The high frequency part contains information about the edge components, while the low frequency part is split again into high and low frequency parts. Eigen vector for face NON IEEE Face Recognition is the process of identification of a person by their facial image. This technique makes it recognition using possible to use the facial images of a person to authenticate him into a secure system, for criminal dimensionality reduction identification, for passport verification,... Face recognition approaches for still images can be broadly PCA. categorized into holistic methods and feature based methods. Holistic methods use the entire raw face image as an input, whereas feature based methods extract local facial features and use their geometric and appearance properties. Fault Secure Encoder and IEEE 2009 Memory cells have been protected from soft errors for more than a decade; due to the increase in soft error Decoder for http://ieeexplore.ieee.org/search/fre rate in logic circuits, the encoder and decoder circuitry around the memory blocks have become susceptible to NanoMemory esearchresult.jsp?newsearch=true&q soft errors as well and must also be protected.We introduce a new approach to design fault-secure encoder Applications ueryText=Fault+Secure+Encoder+and and decoder circuitry for memory designs. +Decoder+for+NanoMemory+Applica tions&x=0&y=0

marking NON IEEE wavelet

Page 2

Final list
VLSI Design of micro-program NON IEEE addresses sequencer. The major function performed by a micro-program sequencer is to determine the order in which the microinstructions are fetched from the control store. It is desirable to have features such that the total amount of control storage required is minimized for any given application consistent with speed and ease of use. A sequencer is proposed which is intended for use in high-speed microprocessor applications. This device is controlled by a 4-bit instruction, which would be supplied from one field of the micro-word format of the system. These four bits provide 16 basic instructions. In signal processing, a filter removes unwanted parts of the signal, such as random noise, or extracts the useful parts of the signal, such as the components lying within a certain frequency range. FIR, Finite Impulse Response, filters are one of the primary types of filters used in Digital Signal Processing. FIR filters are said to be finite because they do not have any feedback. Therefore, if you send an impulse through the system (a single spike) then the output will invariably become zero as soon as the impulse runs through the filter. FIR Filtering can be expressed as multiplication of vectors by scalars. This project presents high speed designs for FIR filters based on Wallace tree multiplier. The performance of the proposed implementation is compared with implementations based on conventional multiplier. It will be shown that the performance of the Wallace tree multiplier is better compared with the implementations based on conventional multiplier.

VLSI

Design of High Performance FIR filter using Wallace Tree Multiplier

NON IEEE

VLSI

Design and NON IEEE implementation of different multipliers using vhdl.

Low power consumption and smaller area are some of the most important criteria for the fabrication of DSP systems and high performance systems. Optimizing the speed and area of the multiplier is a major design issue. However, area and speed are usually conflicting constraints so that improving speed results mostly in larger areas. In our project we try to determine the best solution to this problem by comparing a few multipliers. This project presents an efficient implementation of high speed multiplier using the shift and add method, Radix_2, Radix_4 modified Booth multiplier algorithm. In this project we compare the working of the three multiplier by implementing each of them separately in FIR filter. In High-performance VLSI circuits, the on-chip power densities are playing dominant role in both static and dynamic conditions due to shrinking device features. The consumed power is usually dissipated heat, affecting the performance and reliability of the chip. Complex Multiplier is an arithmetic circuit that is extensively used in DSP and communication applications like, FFT, Digital Filters etc. For fast circuit implementation, parallel multiplier is preferred. For large bit-width multiplications, a large number of adders are required to perform the partial product addition. Compressors are used to compress partial product addition stages. Higher order compressors permit the reduction of the vertical critical paths in parallel multiplier resulting in better speed-power product for the multiplier circuit. Thesis presents a novel scheme for 16*16 bit multiplier using thirteen different types of compressors. The scheme is optimized for low power as well as high speed implementation over reported schemes. It represents low power multiplier design methodology, which counts only number of 1s in the partial products.

VLSI

Design of low power NON IEEE complex multiplier using compressors

Page 3

Final list
VLSI High performance left to NON IEEE right truncated parallel multiplier As the scale of integration keeps growing, more and more sophisticated signal processing systems are being implemented on a VLSI chip. These signal processing applications not only demand great computation capacity, but also consume considerable amounts of energy. While performance and area remain to be two major design goals, power consumption has become a critical concern in todays VLSI system design . The need for low-power VLSI systems arises from two main forces. First, with the steady growth of operating frequency and processing capacity per chip, large current has to be delivered and the heat due to large power consumption must be removed by proper cooling techniques. Second, battery life in portable electronic devices is limited. Low power design directly leads to prolonged operation time in these portable devices. Cryptographic algorithms can be divided into three several classes: public key algorithms, symmetric key algorithms, and hash functions. While the first two are used to encrypt and decrypt data, the hash functions are one-way functions that do not allow the processed data to be retrieved. This project focuses on hashing algorithms. Currently, the most commonly used hash functions are the MD5 and the Secure Hash Algorithm (SHA), with 128- to 512-bit output Digest Messages (DMs), respectively. While for MD5, collision attacks are computationally feasible on a standard desktop computer ,current SHA-1 attacks still require massive computational power ,(around hash operations), making attacks unfeasible for the time being. For applications that require additional levels of security, the SHA-2 has been introduced.

VLSI Implementation of CostEfficient SHA Hardware Accelerators

IEEE 2008 http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=45 60238&queryText%3DCostEfficient+SHA+Hardware+Accelerator s%26openedRefinements%3D*%26fil ter%3DAND%28NOT%284283010803 %29%29%26searchField%3DSearch+ All http://ieeexplore.ieee.org/Xplore/lo gin.jsp?url=http%3A%2F%2Fieeex plore.ieee.org%2Fiel5%2F543381 0%2F5440746%2F05440757.pdf %3Farnumber%3D5440757&auth Decision=-203

E-MATLAB

Simulation Inverter working as Active power IEEE 2010 filter and Auxilary power supply

E-MATLAB

Simulation of threephase four-wire shunt active power filter using IEEE 2011 novel switching technique

This paper presents the simulation of a three-phase-four legs inverter working as an active power filter while the source voltage feeds the load, and functions as an Auxiliary Power Supply (APS) during a power system failure. This work consists in introducing an energy storage element linked to the three-phase inverter by means of a dc/dc bidirectional converter. This dc/dc converter works as a buck converter while the battery is recharged or as a boost converter when the battery supplies the load. The aim of this configuration is to reduce the bulky and heavy of the batteries bank. The new system (inverter, dc/dc converter and battery) has to work then in one of the following two modes according to the availability of the electric system: as an active power filter and battery charger if the grid is available, or as an APS and boost if the grid is unavailable. http://ieeexplore.ieee.org/xpl/freea The control circuit of the active power filter used for power quality improvement has several basic functional bs_all.jsp?tp=&arnumber=571247 blocks, out of which the reference current generator and the switching pulses generator are considered as 3 most important blocks. This paper presents a novel switching technique for three phase four wire shunt active power filter. The switching pulses are derived by using the three dimensional space vector modulation technique with null vector eliminated. The switching algorithm presented here simplifies the switching strategy. The focus is on the implementation of a pulse width modulation scheme with less number of switch commutations per period and maximum DC bus voltage utilisation. A digital controller is used to provide dead beat current control. The combination of the digital controller and the modulation scheme gives the four leg active power filter the capability to independently track reference current waveforms in three phases. This four leg active power filter can be used for harmonic compensation, reactive power compensation, and load balancing and neutral current compensation. Simulation results are given to show the validity of the proposed switching control strategy.

Page 4

Final list
http://ieeexplore.ieee.org/Xplore/lo gin.jsp?url=http%3A%2F%2Fieeex plore.ieee.org%2Fiel5%2F573818 0%2F5739850%2F05740015.pdf %3Farnumber%3D5740015&auth Decision=-203 The need for solid-state ac-dc converters to improve power quality in terms of power-factor correction (PFC), reduced total harmonic distortion at input ac mains, and precisely regulated dc output have motivated the proposal of several topologies based on classical converters such as buck, boost, and buck-boost. Additionally, novel control techniques dedicated to PFC have also been introduced, motivating the manufacturing of commercial integrated circuits to impose sinusoidal currents in the front-end stage of switch-mode converters. Boost converters operating in continuous current mode (CCM) have become particularly popular because reduced electromagnetic interference (EMI) levels result from its utilization. Within this context, this work deals with a comprehensive review of some of the most relevant ac-dc single-phase boost converters for PFC applications. The evolution of the conventional boost converter is demonstrated in terms of improved characteristics achieved by other boost-based topologies. Besides, it seeks to establish a fast and concise guide on ac-dc boost converters to researchers and experts in power electronics by comparing the topologies.

E-MATLAB

A review of single-phase PFC topologies based on IEEE 2011 the boost converter

E-MATLAB

Analysis and design of a novel single-phase PFC AC-DC step-up/down converter

IEEE 2011

http://ieeexplore.ieee.org/xpl/freea A novel single-phase power-factor-correction AC-DC step-up/down converter is presented in this paper. This bs_all.jsp?arnumber=5744786 converter is operated in discontinuous conduction mode to achieve purely sinusoidal line current, almost unity power factor, low total harmonic distortion of line current, and step-up/down DC output voltage. The proposed converter employs a coupled-inductor with same winding-turn in the primary and secondary side, which is charged in series during the switch-on period and is discharged in parallel during the switch-off period. Therefore, the discharging time can be shortened. The proposed converter can be operated in larger duty-ratio range than the conventional single-phase PFC buck-boost converter for DCM operation. Thus, the proposed converter is suitable for universal line voltage (90-264 V) and wide output-power range. Moreover, the steady-state analyses of voltage gain and the boundary operating condition are discussed in detail. The selections of coupled-inductor and output capacitor are also presented. Finally, a prototype circuit is built in the laboratory to verify the performance. http://ieeexplore.ieee.org/xpl/freea This paper presents the modeling and simulation of a dynamic voltage restorer as a voltage sag/swell bs_all.jsp?arnumber=5760127 mitigation device in electrical power distribution networks. The dynamic voltage restorer, with its excellent dynamic capabilities, when installed between the supply and a critical load feeder, can compensate for voltage sags/swells, restoring line voltage to its nominal value within few milliseconds and hence avoiding any power disruption to the load. A new topology based on Z-source inverter is presented in order to enhance the voltage restoration property of dynamic voltage restorer. Z-source inverter would ensure a constant DC voltage across the DC-link during the process of voltage compensation. The modeling of Z-source based dynamic voltage restorer is carried out component wise and their performances are analyzed using MATLAB software. The simulation results shows that the control technique is very effective and yields excellent compensation for voltage sag/swell mitigation.

E-MATLAB

Voltage sag/swell compensation using ZIEEE 2011 Source inverter based dynamic voltage restorer

Page 5

Final list
Power quality improvement in low voltage distribution system using Dynamic Voltage Restorer (DVR) Simulation study on control strategy for a hybrid electric vehicle with battery and ultracapacitor http://ieeexplore.ieee.org/Xplore/lo gin.jsp?url=http%3A%2F%2Fieeex plore.ieee.org%2Fiel5%2F550819 6%2F5514667%2F05515734.pdf %3Farnumber%3D5515734&auth Decision=-203 http://ieeexplore.ieee.org/xpl/freea bs_all.jsp?arnumber=5776965 IEEE 2011 This paper discusses the mitigation of power quality disturbance in low voltage distribution system due to voltage swells using one of the powerful power custom devices namely Dynamic Voltage Restorer (DVR). The DVR normally installed between the source voltage and critical or sensitive load. The new configuration of DVR has been proposed using improved d-q-o controller technique.. The simulations are performed using Matlab/Simulink's SimPower Toolbox. The proposal is then implemented using 5KVA DVR experimental setup. The simulation and experimental results demonstrate the effective dynamic performance of the proposed configuration. A hybrid electric vehicle with battery pack and ultracapacitor is modeled because they are practicable to be energy storage units now. A control strategy is proposed to regulate output power of energy storage units. Simulation model for the hybrid electric vehicle is constructed in MATLAB/Simulink environment and simulation is performed. Simulation results show that the proposed control strategy is effective and vehicle performance is satisfied. Owing to large power surplus of the conventional tactical vehicles, the modular hybrid time-driven system was proposed. Modular hybrid drive tactical vehicle simulation model was created on the software ADVISOR2002, which realizes the simulation of the traditional power system and the hybrid power system. The simulation results show that the performance of the modular hybrid time-driven tactical vehicle is superior to the prototype tactical vehicle. The recently proposed power-synchronization control for grid-connected voltage-source converters (VSCs) has been shown to be a feasible solution for high-voltage direct-current (HVDC) transmission connected to highimpedance weak ac systems. In this paper, power-synchronization control is investigated for VSC-HVDC links connected to another type of weak ac system, i.e., low-inertia or island systems. As an example, a linear model of a typical island system feeding by a VSC-HVDC link, including a synchronous generator, an induction motor, and some passive loads, is developed for tuning the control parameters of the VSC-HVDC link. Time simulations in PSCAD/EMTDC demonstrate that VSC-HVDC systems using power-synchronization control are flexible for various network conditions, such as large-ac-system connection, island systems, or passive networks. The time simulations also show that power-synchronization control can seamlessly handle transitions between operation modes, as well as ride through ac-system faults in all network conditions.

E-MATLAB

IEEE 2010

E-MATLAB

E-MATLAB

Modeling and Simulation of Modular Hybrid IEEE 2011 Electric Tactical Vehicle

http://ieeexplore.ieee.org/xpl/freea bs_all.jsp?arnumber=5750642

E-MATLAB

Modeling and Control of VSC-HVDC Links IEEE 2011 ConPROJted to Island Systems

http://ieeexplore.ieee.org/search/fr eesrchabstract.jsp?tp=&arnumber =5575439&queryText%3DModelin g+and+Control+of+VSCHVDC+Links+ConPROJted+to+Isl and+Systems%26openedRefinem ents%3D*%26filter%3DAND%28N OT%284283010803%29%29%26s earchField%3DSearch+All

E-MATLAB

A hybrid voltage source converter arrangement for HVDC power IEEE 2010 transmission and reactive power compensation

http://ieeexplore.ieee.org/xpl/freea HVDC transmission systems are becoming an increasingly popular alternative to conventional AC transmission bs_all.jsp?arnumber=5523662 schemes. HVDC voltage source converters (VSC) can offer advantages over traditional HVDC current source converter topologies; as such, it is expected that HVDC-VSCs will be further exploited with the growth of HVDC transmission.

Page 6

Final list
In new configuration of electrical distribution network the distributed generation is connected directly to the medium voltage link. For achieving the total generation of DGs the distribution network radial configuration is changed to the loop or meshed configuration by using a power electronic device in the connection point to control the power flow. Distribution Static Synchronous Series Compensator (D-SSSC) is able to control the power flow between two feeders from different substations. Thanks to use the multilevel converter topology, D-SSSC is connected directly to the line, omitting bulky transformer. Cascaded H-bridge is the best option for this kind of realization. Controlling the power flow in new configuration of electrical distribution system is source of advantages. One of the great impacts of D-SSSC is balancing the power flows of connected feeders, avoiding congestion of feeders and cables damages. This system sometimes needs to reverse the power flow in the line despite of the phase angle between the feeders. The conventional SSSC control strategy uses current phase to inject a voltage in phase with the current to maintain the DC bus voltage at its reference value and a quadratic component to control the power flow. This control strategy is fail to operation while the http://ieeexplore.ieee.org/xpl/freea power reference is reversing due to loosingpower electronic transformer. andthe design process, this paper This paper presents a novel topology of the current phase track at low In zero line current. In the AC/DC, bs_all.jsp?arnumber=5742434 DC/AC, AC/AC converters and high frequency transformer have been used. One matrix converter operates as AC/AC converter in power electronic transformer. The proposed power electronic transformer performs typical functions and has advantages such as power factor correction, voltage sag and swell elimination, voltage flicker reduction and protection capability in fault situations. Power quality improvement with proposed power electronic transformer has been verified by the simulation results. http://ieeexplore.ieee.org/Xplore/lo gin.jsp?url=http%3A%2F%2Fieeex plore.ieee.org%2Fiel5%2F573965 1%2F5742396%2F05742415.pdf %3Farnumber%3D5742415&auth Decision=-203 http://ieeexplore.ieee.org/xpl/freea In this paper, various novel pulse width modulation techniques are analysed, which can enhances the output bs_all.jsp?arnumber=5685883 voltages from five level inverter to multilevel topologies. Multilevel inverters are important for power electronics applications such as flexible ac transmission systems, renewable energy sources, uninterruptible power supplies and active power filters. Three methodologies adopting the constant switching frequency, variable switching frequency multicarrier, phase shifted carrier pulse width modulation concepts are proposed in this paper. The above pulse width modulation techniques analyses by switching frequency optimal methodology. This methodology strategy enhances the output voltages for three phase cascaded multilevel inverter. Field programmable gate array has been chosen to implement the pulse width modulation due its fast proto typing, simple hardware and software design. Simulation and Experimental results are provided. http://ieeexplore.ieee.org/xpl/freea This paper presents a new current control method for three-phase pulse width modulation rectifiers with bs_all.jsp?arnumber=5559486 active power factor correction (PFC). Conventional three-phase PFC control requires sensing of at least two input phase currents. Since the input line must be isolated from the control circuitry, current transformers or Hall effects current sensors are required for sensing the phase currents, which are bulkier and more expensive than resistive current sensors. Such electromagnetic current sensors are also difficult to integrate with the rest of the control circuitry, representing a major barrier for low-cost integrated PFC control development. The proposed current control method solves these problems by using only the dc-rail current as the feedback signal. The dc-rail current can be easily sensed by a shunt resistor, and the sensed signal can be directly used by the control circuitry without isolation or level shifting. The control method is developed based on a nonlinear average current control principle and avoids the steady-state phase error of conventional linear PI control.

E-MATLAB

Reversing the power flow in the looped electrical distribution network by IEEE 2011 using a Cascaded Hbridge D-SSSC

E-MATLAB

Power quality improvement based on novel power electronic transformer

IEEE 2011

E-MATLAB

Control of three phase cascaded multilevel inverter using various novel multicarrier pulse width modulation techniques

IEEE 2010

E-MATLAB

Control of Three-Phase PWM Rectifiers Using A IEEE 2011 Single DC Current Sensor

Page 7

Final list
http://ieeexplore.ieee.org/xpl/freea A new reduced-switch-count converter topology is introduced and proposed for UPS applications in this paper. bs_all.jsp?arnumber=5742456 The modulation scheme of this novel converter is developed and a method is devised for calculating the optimal operating point of the converter based on the design specifications in order to maximize dc bus voltage utilization while minimizing the output voltage THD and switching loss. Moreover, a strategy is suggested for battery charging period which increases converter input power and hence accelerates battery charging process. The proposed converter possesses desirable characteristics of an ideal AC/AC converter such as low THD of input current and output voltage and unity power factor. The validity of theoretical issues is confirmed by simulation results. http://ieeexplore.ieee.org/xpl/freea A current bi-directional DC/DC converter applied in stand alone PV system was introduced. The converter bs_all.jsp?arnumber=5769088 circuit topology and operation principle of presented was analyzed, a control strategy based on PWM duty cycle and phase shifting technology was proposed. The ZVS realization condition of the MOSFET, output power characteristics was analyzed theoretically and the converter small signal model was established based on analyzing in state space average mode. Finally, the simulation results illustrate the theoretical analysis, and a 1.2 kW prototype was build, the experiments demonstrate the performance of the converter presented. http://ieeexplore.ieee.org/xpl/freea The proliferation of power electronics based equipment has produced a significant impact on the quality of bs_all.jsp?arnumber=5760159 electric power supply. Conventional power quality mitigation equipment is proving to be inadequate for an increasing number of applications, and this fact has attracted the attention of power engineers to develop dynamic and adjustable solutions to power quality problems. This has led to development of Custom Power Devices (CPD). One modern and very promising CPD that deals with both load current and supply voltage imperfections is the Unified Power Quality Conditioner (UPQC). This paper investigated the development of UPQC control schemes and algorithms for power quality improvement and implementation of a versatile control strategy to enhance the performance of UPQC. The proposed control scheme gives better steady-state and dynamic response. The validity of the proposed control method is verified by means of MATLAB/SIMULINK. http://ieeexplore.ieee.org/xpl/freea Static Compensator (STATCOM) has been widely proposed for power quality and network stability bs_all.jsp?arnumber=5779855 improvement. It is easily connected in parallel to the electric network and has many advantages for electrical grids. It can improve network stability; power factor, power transfer rating. It can also avoid disturbances such as voltage sag (dip) and swell which is the main concern of this paper. This paper uses a single phase multilevel inverter for STATCOM. It also implements a new current mode controller to control a STATCOM. In order to detect voltage sag, the STATCOM utilizes Goertzel algorithm which is more efficient and practical compared to available methods. Finally, simulations show the results of STATCOM operation for sag mitigation. The results show that the proposed controller can effectively mitigate voltage sag during disturbances.

E-MATLAB

A novel single-phase sixswitch AC/AC converter IEEE 2011 for UPS applications

E-MATLAB

Research on a bidirectional DC/DC converter applied in stand-alone PV system

IEEE 2011

E-MATLAB

A versatile control scheme for UPQC for Power Quality Improvement

IEEE 2011

E-MATLAB

Design and application of a novel current mode IEEE 2011 controller on a multilevel STATCOM

Page 8

Final list
http://ieeexplore.ieee.org/xpl/freea The Static Synchronous Compensator (STATCOM) is increasingly popular in power quality application. The bs_all.jsp?arnumber=5728110 Voltage Source Inverter (VSI) based STATCOM is used for eliminating current harmonics and compensating reactive power. This VSI draw or supply a compensating current from the utility such that it cancels current harmonics on the AC side. STATCOM generates a current wave such that it compensate by cancelling out the non-linear current waveform generated by load. In this paper hysteresis controller based STATCOM is proposed. The STATCOM modeled using Simulink of MATLAB. Simulation result of 6 pulse VSI based STATCOM validate current control strategy to prevent harmonics current and compensate reactive power. http://ieeexplore.ieee.org/xpl/freeab This paper presents a new control strategy for three-phase induction motor which includes independent speed s_all.jsp?arnumber=5138875 & torque control loops and the current regulation thereby overcoming the limitation (i.e. sluggish response) of volts per hertz controlled industrial drives. For close-loop control, the feedback signals including the rotor speed, flux and torque are not measured directly but are estimated by means of an algorithm. http://www.cired.be/CIRED07/pdfs/C A grid-connected hybrid distributed generation system, composed of PV (photovoltaic) array, wind turbine and IRED2007_0539_paper.pdf battery, is proposed for various power transfer functions to the distribution network. The proposed system has several operation modes which are normal operation, power dispatching, and power averaging, according to coordinate control of the BESS(Battery Energy Storage System) and grid inverter. http://ieeexplore.ieee.org/xpl/freeab This paper presents the control of a grid-interfacing inverter with integrated voltage unbalance correction. It is s_all.jsp?arnumber=4591947 proposed to add an additional function to the inverter to decrease the negative-sequence voltage at the point of connection with the utility grid. Based on a symmetric sequence voltage decomposition and using an improved multi-variable filter, the grid-interfacing inverter intentionally absorbs a small amount of negativesequence current from the grid, thereby helping to correct the negative-sequence voltage. http://ieeexplore.ieee.org/Xplore/log in.jsp?url=http%3A%2F%2Fieeexplore .ieee.org%2Fiel5%2F4082359%2F506 9866%2F05069870.pdf%3Farnumber %3D5069870&authDecision=-203 A dynamic voltage restorer (DVR) to compensate deep voltage sags and harmonics is proposed. The DVR consists of shunt and series converters connected back-to-back through a DC-to-DC step up converter. The presence of the DC-to-DC step converter permits the DVR to compensate deep voltage sags for long duration. The series converter is connected to the supply side whereas the shunt converter is connected to the load side. With this configuration, there is no need for large DC capacitors.

E-MATLAB

A novel hysteresis control technique of VSI IEEE 2011 based STATCOM

E-MATLAB

A variable spped sensor less induction motor drive using DC link measurements

IEEE 2009

E-MATLAB

Development of a grid connected wind/PV/BESS 2007 hybrid distributed generation system Control of grid interfacing inverters with IEEE 2008 integrated voltage unbalance correction

E-MATLAB

E-MATLAB

Design and analysis of dynamic voltage restorer IEEE 2009 for DEEP voltage sag and harmonic compensation Harmonic modelling and harmonic activity analysis of equipments with smps using MATLAB and simulink Study of HVDC light for its enhancement of IEEE 2008 AC/DC interconnected transmission system

E-MATLAB

E-MATLAB

http://ieeexplore.ieee.org/xpl/freeab Power quality problems are increasing with the widespread use of electronic equipments, which cause s_all.jsp?arnumber=4270692 harmonic distortion of voltages and currents. Individually, a low power single-phase nonlinear load may not pose many serious harmonic problems but large concentrations of these loads have the potential to raise harmonic voltages and currents to unacceptable levels and harmonic current "pollution" is a one of the major power quality problem in electrical power systems. http://ieeexplore.ieee.org/xpl/freeab This paper illustrates a study on HVDC light for its enhancement of AC/DC hybrid transmission system and s_all.jsp?arnumber=4596003 multi-infeed HVDC system. In the sense of the realizing independent controlling of active and reactive power, HVDC light is more effective compared to the conventional HVDC system. An AC/DC parallel transmission system and a three-infeed HVDC system are modeled using PSCAD/EMTDC.

Page 9

Final list
http://ieeexplore.ieee.org/xpl/freeab This paper proposes a new connection for a unified power quality conditioner (UPQC) to improve the power s_all.jsp?arnumber=4039439 quality of two feeders in a distribution system. A UPQC consists of a series voltage-source converter (VSC) and a shunt VSC both joined together by a common dc bus. It is demonstrated how this device is connected between two independent feeders to regulate the bus voltage of one of the feeders while regulating the voltage across a sensitive load in the other feeder. http://ieeexplore.ieee.org/xpl/freeab This paper deals with the simulation of a unified series-shunt compensator (USSC) aimed at examining its s_all.jsp?arnumber=1413438 capability in improving power quality in a power distribution systems. The USSC simulation model comprises of two 12-pulse inverters which are connected in series and in shunt to the system. A generalized sinusoidal pulse width modulation switching technique is developed in the proposed controller design for fast control action of the USSC. http://ieeexplore.ieee.org/xpl/freeab s_all.jsp?arnumber=1413438 This paper presents supercapacitors and battery association methodology for ECCE Hybrid vehicle. ECCE is an experimental Hybrid Vehicle developed at L2ES Laboratory in collaboration with the Research Center in Electrical Engineering and Electronics in Belfort (CREEBEL) and other French partners. This test bench has currently lead-acid batteries with a rated voltage of 540 V, two motors each one coupled with one alternator. http://ieeexplore.ieee.org/xpl/freeab This paper presents a control system based on a repetitive controller to compensate for key power-quality s_all.jsp?arnumber=4729817 disturbances, namely voltage sags, harmonic voltages, and voltage imbalances, using a dynamic voltage restorer (DVR). The control scheme deals with all three disturbances simultaneously within a bandwidth. The control structure is quite simple and yet very robust; it contains a feedforward term to improve the transient response and a feedback term to enable zero error in steady state. http://ieeexplore.ieee.org/xpl/freeab Voltage source inverters (VSI) have been widely used in uninterruptible power supplies, unified power flow s_all.jsp?tp=&arnumber=1677670 controllers or unified power quality conditioners, and distributed generation systems (DGS). VSIs are inherently efficient, compact, and economical devices used to control power flow and provide quality supply. VSIs can be classified as voltage-controlled VSIs (VCVSIs) and current-controlled VSIs (CCVSIs), depending on their control mechanism. In this paper, a detailed comparison of VCVSIs and CCVSIs for DGS applications is presented. http://www.infosys.tuwien.ac.at/staf Web-based collaborations have become essential in todays business environments. Due to the availability of f/skopik/2011_avatar_sspd.pdf various SOAframeworks, Webservices emerged as the defacto technology to realize flexible compositions of services. While most existing work focuses on the discovery and composition of software based services, we highlight concepts for a people-centric Web. Knowledge-intensive environments clearly demand for provisioning of human expertise along withsharingofcomputingresourcesorbusinessdatathrough softwarebased services. To address these challenges, we introduce an adaptive approach allowing humans to provide their expertise through services using SOA standards, such as WSDL and SOAP. The seamless integration of humans in the SOA loop triggers numerous social implications, such as evolving expertise and drifting interests of human service providers. Here we propose a framework that is based on interaction monitoring techniques enabling adaptations in SOA-based socio-technical systems.

E-MATLAB

Interline unified power quality conditioner PSCAD/EMTDC simulation of unified series-shunt compensator for power quality improvement

IEEE 2007

E-MATLAB

IEEE 2005

E-MATLAB

Super capacitors and battery power management for hybrid IEEE 2008 vehicle applications using multi boost and full bridge converters A versatile control scheme for a dynamic voltage restorer for power quality improvement

E-MATLAB

IEEE 2008

E-MATLAB

Application of voltage and current controlled voltage source inverter IEEE 2006 for distributed generaton systems

.Net

Adaptive Provisioning Of Human Expertise In IEEE 2011 Service-Oriented Systems

Page 10

Final list
http://www.techrepublic.com/white Interactions spanning multiple organizations have become an important aspect in today's collaboration papers/bridging-socially-enhanced- landscape. Organizations create alliances to fulfill strategic objectives. The dynamic nature of collaborations virtual-communities/2911983 increasingly demands for automated techniques and algorithms to support the creation of such alliances. The approach bases on the recommendation of potential alliances by discovery of currently relevant competence sources and the support of semi-automatic formation. The environment is service-oriented comprising humans and software services with distinct capabilities. To mediate between previously separated groups and organizations, the authors introduce the broker concept that bridges disconnected networks. http://ieeexplore.ieee.org/xpl/freeab Cloud computing has been envisioned as the de-facto solution to the rising storage costs of IT Enterprises. s_all.jsp?tp=&arnumber=5716422 With the high costs of data storage devices as well as the rapid rate at which data is being generated it proves costly for enterprises or individual users to frequently update their hardware. Apart from reduction in storage costs data outsourcing to the cloud also helps in reducing the maintenance. Cloud storage moves the user's data to large data centers, which are remotely located, on which user does not have any control. However, this unique feature of the cloud poses many new security challenges which need to be clearly understood and resolved. One of the important concerns that need to be addressed is to assure the customer of the integrity i.e. correctness of his data in the cloud. As the data is physically not accessible to the user the cloud should provide a way for the user to check if the integrity of his data is maintained or is compromised. In this paper we provide a scheme which gives a proof of data integrity in the cloud which the customer can employ to check the correctness of his data in the cloud. This proof can be agreed upon by both the cloud and the customer and can be incorporated in the Service level agreement (SLA). This scheme ensures that the storage http://ieeexplore.ieee.org/search/fre at many applications, including location based services, thin clients. not precise. In this paper, we study the In the client side is minimal which will be beneficial for queries are esrchabstract.jsp?tp=&arnumber=57 problem of efficiently computing range aggregates in a multi-dimensional space when the query location is 10931&queryText%3DEfficient+Comp uncertain. That is, for a set of data points P, an uncertain location based query Q with location described by a utation+Of+Range+Aggregates+Again probabilistic density function, we want to calculate the aggregate information (e.g., count, average} and sum) st+Uncertain+Location+Based+Querie of the data points within distance gamma to Q with probability at least theta. We propose novel, efficient s%26openedRefinements%3D*%26fil techniques to solve the problem based on a filtering-and-verification framework. In particular, two novel ter%3DAND%28NOT%284283010803 filtering techniques are proposed to effectively and efficiently remove data points from verification. Finally, we %29%29%26searchField%3DSearch+ show that our techniques can be immediately extended to solve the range query problem. Comprehensive All experiments conducted on both real and synthetic data demonstrate the efficiency and scalability of our techniques.

.NET

Bridging SociallyEnhanced Virtual Communities

IEEE 2011

.NET

Data Integrity Proofs In Cloud Storage

IEEE 2011

.NET

Efficient Computation Of Range Aggregates IEEE 2011 Against Uncertain Location Based Queries

Page 11

Final list
http://ieeexplore.ieee.org/Xplore/log in.jsp?url=http%3A%2F%2Fieeexplore .ieee.org%2Fiel5%2F69%2F4358933 %2F05416716.pdf%3Farnumber%3D 5416716&authDecision=-203 Natural phenomena show that many creatures form large social groups and move in regular patterns. However, previous works focus on finding the movement patterns of each single object or all objects. In this paper, we first propose an efficient distributed mining algorithm to jointly identify a group of moving objects and discover their movement patterns in wireless sensor networks. Afterward, we propose a compression algorithm, called 2P2D, which exploits the obtained group movement patterns to reduce the amount of delivered data. The compression algorithm includes a sequence merge and an entropy reduction phases. In the sequence merge phase, we propose a Merge algorithm to merge and compress the location data of a group of moving objects. In the entropy reduction phase, we formulate a Hit Item Replacement (HIR) problem and propose a Replace algorithm that obtains the optimal solution. Moreover, we devise three replacement rules and derive the maximum compression ratio. The experimental results show that the proposed compression algorithm leverages the group movement patterns to reduce the amount of delivered data effectively and efficiently. http://ieeexplore.ieee.org/xpl/freeab Cloud applications that offer data management services are emerging. Such clouds support caching of data in s_all.jsp?arnumber=5710920 order to provide quality query services. The users can query the cloud data, paying the price for the infrastructure they use. Cloud management necessitates an economy that manages the service of multiple users in an efficient, but also, resource-economic way that allows for cloud profit. Naturally, the maximization of cloud profit given some guarantees for user satisfaction presumes an appropriate price-demand model that enables optimal pricing of query services. The model should be plausible in that it reflects the correlation of cache structures involved in the queries. Optimal pricing is achieved based on a dynamic pricing scheme that adapts to time changes. This paper proposes a novel price-demand model designed for a cloud cache and a dynamic pricing scheme for queries executed in the cloud cache. The pricing solution employs a novel method that estimates the correlations of the cache services in an time-efficient manner. The experimental study shows the efficiency of the solution. http://ieeexplore.ieee.org/xpl/freeab This paper presents a digital image hiding technology by using the curvelet transform. Firstly, apply Arnold s_all.jsp?arnumber=5952895 transform to original image; Secondly, apply curvelet Transform to the original image and the open image, gaining their curvelet coefficients; Thirdly, interpolate their curvelet coefficients; Finally, reconstruct the image by using Inverse curvelet Transform, and thus get the result image. Simulation results show that this approach is easy to use and safety.P http://ieeexplore.ieee.org/search/fre Search engine companies collect the "database of intentions," the histories of their users' search queries. esrchabstract.jsp?tp=&arnumber=57 These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing 08146&queryText%3DPublishing+Sea search logs in order not to disclose sensitive information. In this paper we analyze algorithms for publishing rch+Logs+%E2%80%93+A+Comparati frequent keywords, queries and clicks of a search log. We first show how methods that achieve variants of kve+Study+Of+Privacy+Guarantees%2 anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by 6openedRefinements%3D*%26filter epsilon-differential privacy unfortunately does not provide any utility for this problem. We then propose a %3DAND%28NOT%284283010803%2 novel algorithm ZEALOUS and show how to set its parameters to achieve (epsilon, delta)-probabilistic privacy. 9%29%26searchField%3DSearch+All We also contrast our analysis of ZEALOUS with an analysis by Korolova et al. that achieves (epsilon', delta')indistinguishability. Our paper concludes with a large experimental study using real applications where we compare ZEALOUS and previous work that achieves k-anonymity in search log publishing. Our results show that ZEALOUS yields comparable utility to k-anonymity while at the same time achieving much stronger privacy guarantees.

.NET

Exploring ApplicationLevel Semantics For Data IEEE 2011 Compression

.NET

Optimal Service Pricing For A Cloud Cache

IEEE 2011

.NET

Digital Image hiding IEEE 2011 using curve let transform

.NET

Publishing Search Logs A Comparative Study Of IEEE 2011 Privacy Guarantees

Page 12

Final list
http://ieeexplore.ieee.org/xpl/freeab The concept of awareness plays a pivotal role in research in Computer-Supported Cooperative Work. Recently, s_all.jsp?arnumber=5710950 software engineering researchers interested in the collaborative nature of software development have explored the implications of this concept in the design of software development tools. A critical aspect of awareness is the associated coordinative work practices of displaying and monitoring actions. This aspect concerns how colleagues monitor one another's actions to understand how these actions impact their own work and how they display their actions in such a way that others can easily monitor them while doing their own work. In this paper, we focus on an additional aspect of awareness: the identification of the social actors who should be monitored and the actors to whom their actions should be displayed. We address this aspect by presenting software developers' work practices based on ethnographic data from three different software development teams. In addition, we illustrate how these work practices are influenced by different factors, including the organizational setting, the age of the project, and the software architecture. We discuss how our results are relevant for both CSCW and software engineering researchers. http://ieeexplore.ieee.org/xpl/freeab With the explosion in the amount of semi-structured data users access and store in personal information s_all.jsp?arnumber=5887334 management systems, there is a critical need for powerful search tools to retrieve often very heterogeneous data in a simple and efficient way. Existing tools typically support some IR-style ranking on the textual part of the query, but only consider structure (e.g., file directory) and metadata (e.g., date, file type) as filtering conditions. We propose a novel multi-dimensional search approach that allows users to perform fuzzy searches for structure and metadata conditions in addition to keyword conditions. Our techniques individually score each dimension and integrate the three dimension scores into a meaningful unified score. We also design indexes and algorithms to efficiently identify the most relevant files that match multi-dimensional queries. We perform a thorough experimental evaluation of our approach and show that our relaxation and scoring framework for fuzzy query conditions in non-content dimensions can significantly improve ranking accuracy. We also show that our query processing strategies perform and scale well, making our fuzzy search approach practical for every day usage. http://ieeexplore.ieee.org/xpl/freeab Recommender systems are becoming increasingly important to individual users and businesses for providing s_all.jsp?arnumber=5680904 personalized recommendations. However, while the majority of algorithms proposed in recommender systems literature have focused on improving recommendation accuracy (as exemplified by the recent Netflix Prize competition), other important aspects of recommendation quality, such as the diversity of recommendations, have often been overlooked. In this paper, we introduce and explore a number of item ranking techniques that can generate recommendations that have substantially higher aggregate diversity across all users while maintaining comparable levels of recommendation accuracy. Comprehensive empirical evaluation consistently shows the diversity gains of the proposed techniques using several real-world rating datasets and different rating prediction algorithms.

.NET

The Awareness Network, To Whom Should I IEEE 2011 Display My Actions And, Whose Actions

.NET

Efficient Multidimensional Fuzzy Search IEEE 2011 for Personal Information Management Systems

.NET

Improving Aggregate Recommendation IEEE 2011 Diversity Using RankingBased Techniques

Page 13

Final list
http://www.ijcaonline.org/volume12 Here a graphical password system with a supportive sound signature to increase the remembrance of the /number9/pxc3872295.pdf password is discussed. In proposed work a click-based graphical password scheme called Cued Click Points (CCP) is presented. In this system a password consists of sequence of some images in which user can select one click-point per image. In addition user is asked to select a sound signature corresponding to each click point this sound signature will be used to help the user in recalling the click point on an image. System showed very good Performance in terms of speed, accuracy, and ease of use. Users preferred CCP to Pass Points, saying that selecting and remembering only one point per image was easier and sound signature helps considerably in recalling the click points http://ieeexplore.ieee.org/xpl/freeab Business processes are increasingly distributed and open, making them prone to failure. Monitoring is, s_all.jsp?isnumber=5723065&arnum therefore, an important concern not only for the processes themselves but also for the services that comprise ber=5560636 these processes. We present a framework for multilevel monitoring of these service systems. It formalizes interaction protocols, policies, and commitments that account for standard and extended effects following the language-action perspective, and allows specification of goals and monitors at varied abstraction levels. We demonstrate how the framework can be implemented and evaluate it with multiple scenarios that include specifying and monitoring open-service policy commitments. http://ieeexplore.ieee.org/xpl/freeab With the emergence of the deep Web databases, searching in domains such as vehicles, real estate, etc. has s_all.jsp?arnumber=5710921 become a routine task. One of the problems in this context is ranking the results of a user query. Earlier approaches for addressing this problem have used frequencies of database values, query logs, and user profiles. A common thread in most of these approaches is that ranking is done in a user- and/or queryindependent manner. This paper proposes a novel query- and user-dependent approach for ranking the results of Web database queries. We present a ranking model, based on two complementary notions of user and query similarity, to derive a ranking function for a given user query. This function is acquired from a sparse workload comprising of several such ranking functions derived for various user-query pairs. The proposed model is based on the intuition that similar users display comparable ranking preferences over the results of similar queries. We define these similarities formally in alternative ways and discuss their effectiveness both analytically and experimentally over two distinct Web databases. http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=54 16721&queryText%3DThe+World+In +A+Nutshell%3A+Concise+Range+Qu eries%26openedRefinements%3D*% 26filter%3DAND%28NOT%28428301 0803%29%29%26searchField%3DSea rch+All With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PDAs. Range queries, as one of the most commonly used tools, are often posed by the users to retrieve needful information from a spatial database. However, due to the limits of communication bandwidth and hardware power of handheld devices, displaying all the results of a range query on a handheld device is neither communication-efficient nor informative to the users. This is simply because that there are often too many results returned from a range query. In view of this problem, we present a novel idea that a concise representation of a specified size for the range query results, while incurring minimal information loss, shall be computed and returned to the user. Such a concise range query not only reduces communication costs, but also offers better usability to the users, providing an opportunity for interactive exploration. The usefulness of the concise range queries is confirmed by comparing it with other possible alternatives, such as sampling and clustering. Unfortunately, we prove that finding the optimal representation with minimum information loss is an NP-hard problem. Therefore, we propose several effective and nontrivial algorithms to find a good approximate result. Extensive experiments

.NET

Integration Of Sound Signature In Graphical IEEE 2011 Password Authentication System

.NET

Monitoring Service Systems From A Language-Action Perspective

IEEE 2011

.NET

One Size Does Not Fit All: Towards User- And Query-Dependent IEEE 2011 Ranking For Web Databases

.NET

The World In A Nutshell: IEEE 2011 Concise Range Queries

Page 14

Final list
http://ieeexplore.ieee.org/xpl/freeab Intrusion detection plays an important role in the area of security in WSN. Detection of any type of intruder is s_all.jsp?tp=&arnumber=5760281 essential in case of WSN. WSN consumes a lot of energy to detect an intruder. Therefore we derive an algorithm for energy efficient external and internal intrusion detection. We also analyse the probability of detecting the intruder for heterogeneous WSN. This paper considers single sensing and multi sensing intruder detection models. It is found that our experimental results validate the theoretical results. http://ieeexplore.ieee.org/Xplore/log in.jsp?url=http%3A%2F%2Fieeexplore .ieee.org%2Fiel5%2F5326%2F435928 3%2F05551235.pdf%3Farnumber%3 D5551235&authDecision=-203 .NET NABS Novel Approaches IEEE 2011 for Biometric Systems Research on biometrics has noticeably increased. However, no single bodily or behavioral feature is able to satisfy acceptability, speed, and reliability constraints of authentication in real applications. The present trend is therefore toward multimodal systems. In this paper, we deal with some core issues related to the design of these systems and propose a novel modular framework, namely, novel approaches for biometric systems (NABS) that we have implemented to address them. NABS proposal encompasses two possible architectures based on the comparative speeds of the involved biometries. It also provides a novel solution for the data normalization problem, with the new quasi-linear sigmoid (QLS) normalization function. This function can overcome a number of common limitations, according to the presented experimental comparisons. A further contribution is the system response reliability (SRR) index to measure response confidence. Its theoretical definition allows to take into account the gallery composition at hand in assigning a system reliability measure on a single-response basis. The unified experimental setting aims at evaluating such aspects both separately and together, using face, ear, and fingerprint as test biometries. The results provide a positive feedback for the http://ieeexplore.ieee.org/xpl/freeab overall theoretical framework developed herein.of multiple strings is an NP-hard problem, with many of the Finding the longest common subsequence (LCS) Since NABS is designed to allow both a flexible choice s_all.jsp?arnumber=5530316 applications in the areas of bioinformatics and computational genomics. Although significant efforts have been made to address the problem and its special cases, the increasing complexity and size of biological data require more efficient methods applicable to an arbitrary number of strings. In this paper, we present a new algorithm for the general case of multiple LCS (or MLCS) problem, i.e., finding an LCS of any number of strings, and its parallel realization. The algorithm is based on the dominant point approach and employs a fast divideand-conquer technique to compute the dominant points. When applied to a case of three strings, our algorithm demonstrates the same performance as the fastest existing MLCS algorithm designed for that specific case. When applied to more than three strings, our algorithm is significantly faster than the best existing sequential methods, reaching up to 2-3 orders of magnitude faster speed on large-size problems. Finally, we present an efficient parallel implementation of the algorithm. Evaluating the parallel algorithm on a benchmark set of both random and biological sequences reveals a near-linear speedup with respect to the sequential algorithm.

.NET

Intrusion detection: An Energy efficient approach IEEE 2011 in heterogeneous WSN

.Net

A Fast Multiple Longest Common Subsequence (Mlcs) Algorithm

IEEE 2011

Page 15

Final list
http://ieeexplore.ieee.org/xpl/freeab Feature clustering is a powerful method to reduce the dimensionality of feature vectors for text classification. s_all.jsp?arnumber=5530315 In this paper, we propose a fuzzy similarity-based self-constructing algorithm for feature clustering. The words in the feature vector of a document set are grouped into clusters, based on similarity test. Words that are similar to each other are grouped into the same cluster. Each cluster is characterized by a membership function with statistical mean and deviation. When all the words have been fed in, a desired number of clusters are formed automatically. We then have one extracted feature for each cluster. The extracted feature, corresponding to a cluster, is a weighted combination of the words contained in the cluster. By this algorithm, the derived membership functions match closely with and describe properly the real distribution of the training data. Besides, the user need not specify the number of extracted features in advance, and trial-anderror for determining the appropriate number of extracted features can then be avoided. Experimental results show that our method can run faster and obtain better extracted features than other methods. http://ieeexplore.ieee.org/xpl/freeab We analyze the delay performance of a multihop wireless network with a fixed route between each sources_all.jsp?arnumber=5688207 destination pair. We develop a new queue grouping technique to handle the complex correlations of the service process resulting from the multihop nature of the flows. A general set-based interference model is assumed that imposes constraints on links that can be served simultaneously at any given time. These interference constraints are used to obtain a fundamental lower bound on the delay performance of any scheduling policy for the system. We present a systematic methodology to derive such lower bounds. For a special wireless system, namely the clique, we design a policy that is sample-path delay-optimal. For the tandem queue network, where the delay-optimal policy is known, the expected delay of the optimal policy numerically coincides with the lower bound. We conduct extensive numerical studies to suggest that the average delay of the back-pressure scheduling policy can be made close to the lower bound by using appropriate functions of queue length. http://ieeexplore.ieee.org/xpl/freeab In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed s_all.jsp?arnumber=5628294 wireless networks. The main system objective is correct reception of packets, and thus the analysis is performed in terms of outage probability. In our network model, packets belonging to specific transmitters arrive randomly in space and time according to a 3-D Poisson point process, and are then transmitted to their intended destinations using a fully-distributed MAC protocol. A packet transmission is considered successful if the received SINR is above a predefined threshold for the duration of the packet. Accurate bounds on the outage probabilities are derived as a function of the transmitter density, the number of backoffs and retransmissions, and in the case of CSMA, also the sensing threshold. The analytical expressions are validated with simulation results. For continuous-time transmissions, CSMA with receiver sensing (which involves adding a feedback channel to the conventional CSMA protocol) is shown to yield the best performance. Moreover, the sensing threshold of CSMA is optimized. It is shown that introducing sensing for lower densities (i.e., in sparse networks) is not beneficial, while for higher densities (i.e., in dense networks), using an optimized sensing threshold provides significant gain.

.Net

A Fuzzy Self-Constructing Feature Clustering IEEE 2011 Algorithm For Text Classification

.NET

Delay Analysis and Optimality of Scheduling IEEE 2011 Policies for Multi-Hop Wireless Networks

.NET

Improving the Performance of Wireless Ad Hoc Networks IEEE 2011 Through MAC Layer Design

Page 16

Final list
http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=55 08435&queryText%3DContinuous+N eighbor+Discovery+in+Asynchronous +Sensor+Networks%26openedRefine ments%3D*%26filter%3DAND%28NO T%284283010803%29%29%26search Field%3DSearch+All http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=55 12560&queryText%3DScalable+and+ CostEffective+Interconnection+of+DataCenter+Servers+Using+Dual+Server+ Ports%26openedRefinements%3D*% 26filter%3DAND%28NOT%28428301 0803%29%29%26searchField%3DSea rch+All In most sensor networks, the nodes are static. Nevertheless, node connectivity is subject to changes because of disruptions in wireless communication, transmission power changes, or loss of synchronization between neighboring nodes. Hence, even after a sensor is aware of its immediate neighbors, it must continuously maintain its view, a process we call continuous neighbor discovery. In this work, we distinguish between neighbor discovery during sensor network initialization and continuous neighbor discovery. We focus on the latter and view it as a joint task of all the nodes in every connected segment. Each sensor employs a simple protocol in a coordinate effort to reduce power consumption without increasing the time required to detect hidden sensors. The goal of data-center networking is to interconnect a large number of server machines with low equipment cost while providing high network capacity and high bisection width. It is well understood that the current practice where servers are connected by a tree hierarchy of network switches cannot meet these requirements. In this paper, we explore a new server-interconnection structure. We observe that the commodity server machines used in today's data centers usually come with two built-in Ethernet ports, one for network connection and the other left for backup purposes. We believe that if both ports are actively used in network connections, we can build a scalable, cost-effective interconnection structure without either the expensive higher-level large switches or any additional hardware on servers. We design such a networking structure called FiConn. Although the server node degree is only 2 in this structure, we have proven that FiConn is highly scalable to encompass hundreds of thousands of servers with low diameter and high bisection width. We have developed a low-overhead traffic-aware routing mechanism to improve effective link utilization based on dynamic traffic state. We have also proposed how to incrementally deploy FiConn. http://ieeexplore.ieee.org/Xplore/log A fast simulation technique based on importance sampling is developed for the analysis of path service in.jsp?url=http%3A%2F%2Fieeexplore availability in mesh networks with dynamic path restoration. The method combines the simulation of the path .ieee.org%2Fiel5%2F90%2F4359146 rerouting algorithm with a dynamic path failure importance sampling (DPFS) scheme to estimate path %2F05508436.pdf%3Farnumber%3D availabilities efficiently. In DPFS, the failure rates of network elements are biased at increased rates until path 5508436&authDecision=-203 failures are observed under rerouting. The simulated model uses failure equivalence groups, with finite/infinite sources of failure events and finite/infinite pools of repair personnel, to facilitate the modeling of bidirectional link failures, multiple in-series link cuts, optical amplifier failures along links, node failures, and more general geographically distributed failure scenarios. The analysis of a large mesh network example demonstrates the practicality of the technique.

Java

Continuous Neighbor Discovery in Asynchronous Sensor Networks

IEEE 2011

Java

Scalable and CostEffective Interconnection IEEE 2011 of Data-Center Servers Using Dual Server Ports

Java

Fast Simulation of Service Availability in Mesh IEEE 2011 Networks With Dynamic Path Restoration

Page 17

Final list
http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=55 24099&queryText%3DROC%3A+Resili ent+Online+Coverage+for+Surveillanc e+Applications%26openedRefinemen ts%3D*%26filter%3DAND%28NOT%2 84283010803%29%29%26searchFiel d%3DSearch+All We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor covers (subsets of nodes that cover the field) to efficiently exploit redundant node deployment and tolerate unexpected node failures. Little attention was given to studying the tradeoff between fault tolerance and energy efficiency in sensor coverage. In this work, our objectives are twofold. First, we aim at rapidly restoring field coverage under unexpected sensor failures in an energy-efficient manner. Second, we want to flexibly support different degrees of redundancy in the field without needing centralized control. To meet these objectives, we propose design guidelines for applications that employ distributed cover-selection algorithms to control the degree of redundancy at local regions in the field. In addition, we develop a new distributed technique to facilitate switching between active covers without the need for node synchronization. Distributed cover selection protocols can be integrated into our referred to as resilient online coverage (ROC) framework. A key novelty in ROC is that it allows every sensor to control the degree of redundancy and surveillance in its region according to current network conditions. We analyze the benefits of (P2P)in terms of energy efficiency and been introducedThrough years. A number of commercial peer-to-peer ROC systems for live streaming have fault tolerance. in recent The behavior of these popular systems has been extensively studied in several measurement papers. Due to the proprietary nature of these commercial systems, however, these studies have to rely on a black-box approach, where packet traces are collected from a single or a limited number of measurement points, to infer various properties of traffic on the control and data planes. Although such studies are useful to compare different systems from the end-user's perspective, it is difficult to intuitively understand the observed properties without fully reverse-engineering the underlying systems. In this paper, we describe the network architecture of Zattoo, one of the largest production live streaming providers in Europe at the time of writing, and present a large-scale measurement study of Zattoo using data collected by the provider. To highlight, we found that even when the Zattoo system was heavily loaded with as high as 20 000 concurrent users on a single overlay, the median channel join delay remained less than 2-5 s, and that, for a majority of users, the streamed signal lags over-the-air broadcast signal by no more than 3 s. Many wireless communication systems such as IS-54, enhanced data rates for the GSM evolution (EDGE), worldwide interoperability for microwave access (WiMAX) and long term evolution (LTE) have adopted lowdensity parity-check (LDPC), tail-biting convolutional, and turbo codes as the forward error correcting codes (FEC) scheme for data and overhead channels. Therefore, many efficient algorithms have been proposed for decoding these codes. However, the different decoding approaches for these two families of codes usually lead to different hardware architectures. Since these codes work side by side in these new wireless systems, it is a good idea to introduce a universal decoder to handle these two families of codes. The present work exploits the parity-check matrix (H) representation of tail-biting convolutional and turbo codes, thus enabling decoding via a unified belief propagation (BP) algorithm. Indeed, the BP algorithm provides a highly effective general methodology for devising low-complexity iterative decoding algorithms for all convolutional code classes as well as turbo codes. While a small performance loss is observed when decoding turbo codes with BP instead of MAP, this is offset by the lower complexity of the BP algorithm and the inherent advantage of a unified decoding architecture.

Java

ROC: Resilient Online Coverage for Surveillance IEEE 2011 Applications

Java

Live Streaming With Receiver-Based PeerDivision Multiplexing

IEEE 2011

http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=55 35226&queryText%3DLive+Streaming +With+Receiver-Based+PeerDivision+Multiplexing%26openedRefi nements%3D*%26filter%3DAND%28 NOT%284283010803%29%29%26sea rchField%3DSearch+All

http://ieeexplore.ieee.org/xpl/freeab s_all.jsp?arnumber=5872112

Java

A New Approach for FEC Decoding Based on the IEEE 2011 BP Algorithm in LTE and WiMAX Systems

Page 18

Final list
http://ieeexplore.ieee.org/xpl/freeab We develop a stochastic foundation for bandwidth estimation of networks with random service, where s_all.jsp?arnumber=5934981 bandwidth availability is expressed in terms of bounding functions with a defined violation probability. Exploiting properties of a stochastic max-plus algebra and system theory, the task of bandwidth estimation is formulated as inferring an unknown bounding function from measurements of probing traffic. We derive an estimation methodology that is based on iterative constant rate probes. Our solution provides evidence for the utility of packet trains for bandwidth estimation in the presence of variable cross traffic. Taking advantage of statistical methods, we show how our estimation method can be realized in practice, with adaptive train lengths of probe packets, probing rates, and replicated measurements required to achieve both high accuracy and confidence levels. We evaluate our method in a controlled testbed network, where we show the impact of cross traffic variability on the time-scales of service availability, and provide a comparison with existing bandwidth estimation tools. http://ieeexplore.ieee.org/xpl/freeab We address cooperative caching in wireless networks, where the nodes may be mobile and exchange s_all.jsp?arnumber=5741880 information in a peer-to-peer fashion. We consider both cases of nodes with large- and small-sized caches. For large-sized caches, we devise a strategy where nodes, independent of each other, decide whether to cache some content and for how long. In the case of small-sized caches, we aim to design a content replacement strategy that allows nodes to successfully store newly received information while maintaining the good performance of the content distribution system. Under both conditions, each node takes decisions according to its perception of what nearby users may store in their caches and with the aim of differentiating its own cache content from the other nodes'. The result is the creation of content diversity within the nodes neighborhood so that a requesting user likely finds the desired information nearby. We simulate our caching algorithms in different ad hoc network scenarios and compare them with other caching schemes, showing that our solution succeeds in creating the desired content diversity, thus leading to a resource-efficient information access. http://ieeexplore.ieee.org/xpl/freeab The fundamental characteristic which differentiates MANETs from other wireless or wired networks is s_all.jsp?arnumber=5949158 mobility. Therefore, MANET routing protocols are designed to adaptively cater for dynamic changes in topology while maximizing throughput and packet delivery ratio, and minimizing delay, routing load and energy consumption. A major design issue for an efficient and effective routing protocol for real MANETs is, therefore, to achieve optimum values of performance parameters under network scenarios where nodes are subjected to different types of mobility that dynamically change the network topology. Our simulative study on MANET routing protocols and mobility models aims to determine the performance of current MANET routing protocols with respect to various mobility models implemented in ns-2. We compare a number of reactive and proactive routing protocols including AODV, DSR, DSDV, OLSR and DYMO. The results of our extensive network simulations are tabulated along with a comprehensive analysis. The effort allows a fair comparison of the capabilities and limitations of different types of mobility patterns and their suitability for contemporary MANET routing protocols.

Java

A Foundation for Stochastic Bandwidth Estimation of Networks with Random Service

IEEE 2011

Java

Caching Strategies Based on Information Density IEEE 2011 Estimation in Wireless Ad Hoc Networks

Java

MANET Routing Protocols vs Mobility Models: A Performance Evaluation

IEEE 2011

Page 19

Final list
http://ieeexplore.ieee.org/xpl/freeab Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small s_all.jsp?arnumber=5551134 subset of which is relevant to the user. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem. Results categorization for biomedical databases is the focus of this work. A natural way to organize biomedical citations is according to their MeSH annotations. MeSH is a comprehensive concept hierarchy used by PubMed. In this paper, we present the BioNav system, a novel search interface that enables the user to navigate large number of query results by organizing them using the MeSH concept hierarchy. First, the query results are organized into a navigation tree. At each node expansion step, BioNav reveals only a small subset of the concept nodes, selected such that the expected user navigation cost is minimized. In contrast, previous works expand the hierarchy in a predefined static manner, without navigation cost modeling. We show that the problem of selecting the best concepts to reveal at each node expansion is NP-complete and propose an efficient heuristic as well as a feasible optimal algorithm for relatively small trees. We show experimentally that BioNav outperforms state-of-the-art categorization http://ieeexplore.ieee.org/xpl/freeab systemsevolving businesses generate massive respect to the user navigation cost. BioNavand the MEDLINE Rapidly by up to an order of magnitude, with amounts of time-stamped data sequences for cause a demand s_all.jsp?arnumber=5551136 for both univariate and multivariate time series forecasting. For such data, traditional predictive models based on autoregression are often not sufficient to capture complex nonlinear relationships between multidimensional features and the time series outputs. In order to exploit these relationships for improved time series forecasting while also better dealing with a wider variety of prediction scenarios, a forecasting system requires a flexible and generic architecture to accommodate and tune various individual predictors as well as combination methods. In reply to this challenge, an architecture for combined, multilevel time series prediction is proposed, which is suitable for many different universal regressors and combination methods. The key strength of this architecture is its ability to build a diversified ensemble of individual predictors that form an input to a multilevel selection and fusion process before the final optimized output is obtained. Excellent generalization ability is achieved due to the highly boosted complementarity of individual models further enforced through cross-validation-linked training on exclusive data subsets and ensemble output http://ieeexplore.ieee.org/xpl/freeab postprocessing. In a sample field has gained its momentum in almostpredictors and a mean combiner,recently The Machine Learning (ML) configuration with basic neural network any domain of research and just the s_all.jsp?arnumber=5560656 has become a reliable tool in the medical domain. The empirical domain of automatic learning is used in tasks such as medical decision support, medical imaging, protein-protein interaction, extraction of medical knowledge, and for overall patient management care. ML is envisioned as a tool by which computer-based systems can be integrated in the healthcare field in order to get a better, more efficient medical care. This paper describes a ML-based methodology for building an application that is capable of identifying and disseminating healthcare information. It extracts sentences from published medical papers that mention diseases and treatments, and identifies semantic relations that exist between diseases and treatments. Our evaluation results for these tasks show that the proposed methodology obtains reliable outcomes that could be integrated in an application to be used in the medical care domain. The potential value of this paper stands in the ML settings that we propose and in the fact that we outperform previous results on the same data set.

Java

Effective Navigation of Query Results Based on Concept Hierarchies

IEEE 2011

Java

A Generic Multilevel Architecture For Time Series Prediction

IEEE 2011

Java

A Machine Learning Approach For Identifying IEEE 2011 Disease-Treatment Relations In Short Texts

Page 20

Final list
http://ieeexplore.ieee.org/Xplore/log in.jsp?url=http%3A%2F%2Fieeexplore .ieee.org%2Fiel5%2F69%2F5715919 %2F05557876.pdf%3Farnumber%3D 5557876&authDecision=-203 This work introduces a link analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. It is based on a random walk model through the database defining a Markov chain having as many states as elements in the database. Suppose we are interested in analyzing the relationships between some elements (or records) contained in two different tables of the relational database. To this end, in a first step, a reduced, much smaller, Markov chain containing only the elements of interest and preserving the main characteristics of the initial chain, is extracted by stochastic complementation. This reduced chain is then analyzed by projecting jointly the elements of interest in the diffusion map subspace and visualizing the results. This two-step procedure reduces to simple correspondence analysis when only two tables are defined, and to multiple correspondence analysis when the database takes the form of a simple star-schema. On the other hand, a kernel version of the diffusion map distance, generalizing the basic diffusion map distance to directed graphs, is also introduced and the links with spectral clustering are discussed. Several data sets are analyzed by using the proposed methodology, showing the usefulness of the technique for extracting relationshipschallenge existing techniques for data delivery to A variety of emerging online data delivery applications in relational databases or graphs. human users, applications, or middleware that are accessing data from multiple autonomous servers. In this paper, we develop a framework for formalizing and comparing pull-based solutions and present dual optimization approaches. The first approach, most commonly used nowadays, maximizes user utility under the strict setting of meeting a priori constraints on the usage of system resources. We present an alternative and more flexible approach that maximizes user utility by satisfying all users. It does this while minimizing the usage of system resources. We discuss the benefits of this latter approach and develop an adaptive monitoring solution Satisfy User Profiles (SUPs). Through formal analysis, we identify sufficient optimality conditions for SUP. Using real (RSS feeds) and synthetic traces, we empirically analyze the behavior of SUP under varying conditions. Our experiments show that we can achieve a high degree of satisfaction of user utility when the estimations of SUP closely estimate the real event stream, and has the potential to save a significant amount of system resources. We further show that SUP can exploit feedback to improve user utility with only a moderate increase in resource utilization. We consider approaches for similarity search in correlated, high-dimensional data sets, which are derived within a clustering framework. We note that indexing by vector approximation (VA-File), which was proposed as a technique to combat the Curse of Dimensionality, employs scalar quantization, and hence necessarily ignores dependencies across dimensions, which represents a source of suboptimality. Clustering, on the other hand, exploits interdimensional correlations and is thus a more compact representation of the data set. However, existing methods to prune irrelevant clusters are based on bounding hyperspheres and/or bounding rectangles, whose lack of tightness compromises their efficiency in exact nearest neighbor search. We propose a new cluster-adaptive distance bound based on separating hyperplane boundaries of Voronoi clusters to complement our cluster based index. This bound enables efficient spatial filtering, with a relatively small preprocessing storage overhead and is applicable to euclidean and Mahalanobis similarity measures. Experiments in exact nearest-neighbor set retrieval, conducted on real data sets, show that our indexing method is scalable with data set size and data dimensionality and outperforms several recently proposed indexes. Relative to the VA-File, over a wide range of quantization resolutions, it is able to reduce random IO

Java

A Link Analysis Extension Of Correspondence IEEE 2011 Analysis For Mining Relational Databases

Java

A Dual Framework And Algorithms For Targeted IEEE 2011 Online Data Delivery

http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=53 83358&queryText%3DA+Dual+Frame work+And+Algorithms+For+Targeted +Online+Data+Delivery%26openedRe finements%3D*%26filter%3DAND%2 8NOT%284283010803%29%29%26se archField%3DSearch+All

http://ieeexplore.ieee.org/xpl/freeab s_all.jsp?arnumber=5438994

Java

Adaptive Cluster Distance Bounding For High-Dimensional Indexing

IEEE 2011

Page 21

Final list
http://ieeexplore.ieee.org/xpl/freeab In wireless Multicast Broadcast Service (MBS), the common channel is used to multicast the MBS content to s_all.jsp?arnumber=5935113 the Mobile Stations (MSs) on the MBS calls within the coverage area of a Base Station (BS), which causes interference to the dedicated channels serving the traditional calls, and degrades the system capacity. The MBS zone technology is proposed in Mobile Communications Network (MCN) standards to improve system capacity and reduce the handoff delay for the wireless MBS calls. In the MBS zone technology, a group of BSs form an MBS zone, where the macro diversity is applied in the MS, the BSs synchronize to transmit the MBS content on the same common channel, interference caused by the common channel is reduced, and the MBS MSs need not perform handoff while moving between the BSs in the same MBS zone. However, when there is no MBS MS in a BS with the MBS zone technology, the transmission on the common channel wastes the bandwidth of the BS. It is an important issue to determine the condition for the MBS Controller (MBSC) to enable the MBS zone technology by considering the QoS for traditional calls and MBS calls. In this paper, we propose two Dynamic Channel Allocation schemes: DCA and EDCA by considering the condition for enabling http://ieeexplore.ieee.org/xpl/freeab the MBS zonewe formulate an analytical model to characterize the spread of malware in decentralized, In this paper, technology. Analysis and simulation experiments are conducted to investigate the performance s_all.jsp?isnumber=5770295&arnum Gnutella type peer-to-peer (P2P) networks and study the dynamics associated with the spread of malware. ber=5654508 Using a compartmental model, we derive the system parameters or network conditions under which the P2P network may reach a malware free equilibrium. The model also evaluates the effect of control strategies like node quarantine on stifling the spread of malware. The model is then extended to consider the impact of P2P networks on the malware spread in networks of smart cell phones. http://ieeexplore.ieee.org/xpl/freeab All clustering methods have to assume some cluster relationship among the data objects that they are applied s_all.jsp?arnumber=5740893 on. Similarity between a pair of objects can be defined either explicitly or implicitly. In this paper, we introduce a novel multi-viewpoint based similarity measure and two related clustering methods. The major difference between a traditional dissimilarity/similarity measure and ours is that the former uses only a single viewpoint, which is the origin, while the latter utilizes many different viewpoints, which are objects assumed to not be in the same cluster with the two objects being measured. Using multiple viewpoints, more informative assessment of similarity could be achieved. Theoretical analysis and empirical study are conducted to support this claim. Two criterion functions for document clustering are proposed based on this new measure. We compare them with several well-known clustering algorithms that use other popular similarity measures on various document collections to verify the advantages of our proposal.

Java

Dynamic Channel Allocation for Wireless Zone-Based Multicast and Broadcast Service

IEEE 2011

Java

Dynamics of Malware Spread in Decentralized Peer-to-Peer Networks

IEEE 2011

Java

Clustering with MultiView Point Based Similarity Measure

IEEE 2011

Page 22

Final list
http://ieeexplore.ieee.org/xpl/freeab We address cooperative caching in wireless networks, where the nodes may be mobile and exchange s_all.jsp?arnumber=5741880 information in a peer-to-peer fashion. We consider both cases of nodes with large- and small-sized caches. For large-sized caches, we devise a strategy where nodes, independent of each other, decide whether to cache some content and for how long. In the case of small-sized caches, we aim to design a content replacement strategy that allows nodes to successfully store newly received information while maintaining the good performance of the content distribution system. Under both conditions, each node takes decisions according to its perception of what nearby users may store in their caches and with the aim of differentiating its own cache content from the other nodes'. The result is the creation of content diversity within the nodes neighborhood so that a requesting user likely finds the desired information nearby. We simulate our caching algorithms in different ad hoc network scenarios and compare them with other caching schemes, showing that our solution succeeds in creating the desired content diversity, thus leading to a resource-efficient information access. http://ieeexplore.ieee.org/xpl/freeab Cloud computing enables customers with limited computational resources to outsource large-scale s_all.jsp?arnumber=5935305 computational tasks to the cloud, where massive computational power can be easily utilized in a pay-per-use manner. However, security is the major concern that prevents the wide adoption of computation outsourcing in the cloud, especially when end-user's confidential data are processed and produced during the computation. Thus, secure outsourcing mechanisms are in great need to not only protect sensitive information by enabling computations with encrypted data, but also protect customers from malicious behaviors by validating the computation result. Such a mechanism of general secure computation outsourcing was recently shown to be feasible in theory, but to design mechanisms that are practically efficient remains a very challenging problem. Focusing on engineering computing and optimization tasks, this paper investigates secure outsourcing of widely applicable linear programming (LP) computations. In order to achieve practical efficiency, our mechanism design explicitly decomposes the LP computation outsourcing into public LP solvers running on the cloud and private LP parameters owned by the customer. The resulting flexibility allows us to http://ieeexplore.ieee.org/search/fre explore appropriate security/efficiency tradeoff via higher-level abstraction of LP computations than the Monitoring personal locations with a potentially untrusted server poses privacy threats to the monitored esrchabstract.jsp?tp=&arnumber=55 individuals. To this end, we propose a privacy-preserving location monitoring system for wireless sensor 39760&queryText%3DA+Privacynetworks. In our system, we design two in-network location anonymization algorithms, namely, resource and Preserving+Location+Monitoring+Syst quality-aware algorithms, that aim to enable the system to provide high-quality location monitoring services em+for+Wireless+Sensor+Networks% for system users, while preserving personal location privacy. Both algorithms rely on the well-established k26openedRefinements%3D*%26filter anonymity privacy concept, that is, a person is indistinguishable among k persons, to enable trusted sensor %3DAND%28NOT%284283010803%2 nodes to provide the aggregate location information of monitored persons for our system. Each aggregate 9%29%26searchField%3DSearch+All location is in a form of a monitored area A along with the number of monitored persons residing in A, where A contains at least k persons. The resource-aware algorithm aims to minimize communication and computational cost, while the quality-aware algorithm aims to maximize the accuracy of the aggregate locations by minimizing their monitored areas. To utilize the aggregate location information to provide location monitoring services, we use a spatial histogram approach that estimates the distribution of the monitored persons based on the gathered aggregate location information. Then, the estimated distribution is

Java

Caching Strategies Based on Information Density IEEE 2011 Estimation in Wireless Ad Hoc Networks

Java

Secure and Practical Outsourcing of Linear Programming in Cloud Computing

IEEE 2011

Java

A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks

IEEE 2011

Page 23

Final list
http://ieeexplore.ieee.org/xpl/freeab We study the optimal control of communication networks in the presence of heterogeneous traffic s_all.jsp?arnumber=5535245 requirements. Specifically, we distinguish the flows into two crucial classes: inelastic for modeling highpriority, delay-sensitive, and fixed-throughput applications; and elastic for modeling low-priority, delaytolerant, and throughput-greedy applications. We note that the coexistence of such diverse flows creates complex interactions at multiple levels (e.g., flow and packet levels), which prevent the use of earlier design approaches that dominantly assume homogeneous traffic. In this work, we develop the mathematical framework and novel design methodologies needed to support such heterogeneous requirements and propose provably optimal network algorithms that account for the multilevel interactions between the flows. To that end, we first formulate a network optimization problem that incorporates the above throughput and service prioritization requirements of the two traffic types. We, then develop a distributed joint load-balancing and congestion control algorithm that achieves the dual goal of maximizing the aggregate utility gained by the elastic flows while satisfying the fixed throughput and prioritization requirements of the inelastic flows. Next, http://ieeexplore.ieee.org/xpl/freeab we extend our joint algorithm in two ways to further improve its performance: in delay is an efficient method Group communications are important in Mobile Ad hoc Networks (MANETs). Multicast through a virtual s_all.jsp?arnumber=5582101 for implementing group communications. However, it is challenging to implement efficient and scalable multicast in MANET due to the difficulty in group membership management and multicast packet forwarding over a dynamic topology. We propose a novel Efficient Geographic Multicast Protocol (EGMP). EGMP uses a virtual-zone-based structure to implement scalable and efficient group membership management. A networkwide zone-based bidirectional tree is constructed to achieve more efficient membership management and multicast delivery. The position information is used to guide the zone structure building, multicast tree construction, and multicast packet forwarding, which efficiently reduces the overhead for route searching and tree structure maintenance. Several strategies have been proposed to further improve the efficiency of the protocol, for example, introducing the concept of zone depth for building an optimal tree structure and integrating the location search of group members with the hierarchical group membership management. Finally, we design a scheme to handle empty zone problem faced by most routing protocols using a zone http://ieeexplore.ieee.org/xpl/freeab structure. Thewe investigate single user throughput optimization inthrough simulations and quantitative In this paper, scalability and the efficiency of EGMP are evaluated High Speed Downlink Packet Access s_all.jsp?arnumber=5668486 (HSDPA). Specifically, we propose offline and online optimization algorithms which adjust the Channel Quality Indicator (CQI) used by the network for scheduling of data transmission. In the offline algorithm, a given target block error rate (BLER) is achieved by adjusting CQI based on ACK/NAK history. By sweeping through different target BLERs, we can find the throughput optimal BLER offline. This algorithm could be used not only to optimize throughput but also to enable fair resource allocation among multiple users in HSDPA. In the online algorithm, the CQI offset is adapted using an estimated short term throughput gradient without the need for a target BLER. An adaptive stepsize mechanism is proposed to track temporal variation of the environment. Convergence behavior of both algorithms is analyzed. The part of the analysis that deals with constant step size gradient algorithm may be applied to other stochastic optimization techniques. The convergence analysis is confirmed by our simulations. Simulation results also yield valuable insights on the value of optimal BLER target. Both offline and online algorithms are shown to yield up to 25% of throughput improvement over the conventional approach of targeting 10% BLER.

Java

A Unified Approach to Optimizing Performance IEEE 2011 in Networks Serving Heterogeneous Flows

Java

Supporting Efficient and Scalable Multicasting IEEE 2011 over Mobile Ad Hoc Networks

Java

Throughput Optimization in High Speed Downlink IEEE 2011 Packet Access

Page 24

Final list
http://ieeexplore.ieee.org/search/fre esrchabstract.jsp?tp=&arnumber=56 68515&queryText%3DForward+Corre ction+and+Fountain+Codes+in+Delay +Tolerant+Networks%26openedRefin ements%3D*%26filter%3DAND%28N OT%284283010803%29%29%26searc hField%3DSearch+All Delay-tolerant ad hoc networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information to be delivered is replicated in the network. Our objective in this paper is to study a class of replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations that validate the model.

Java

Forward Correction and Fountain Codes in Delay IEEE 2011 Tolerant Networks

Page 25