<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Dependable and Secure Computing, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 8858 </description>
		<year>2012</year>
		<month>February </month>
		<day>10</day>
		<item>
			<title><![CDATA[Cover1]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134782]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134782]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>c1</startPage>
			<endPage>c1</endPage>
			<fileSize>101</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Cover2]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134783]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134783]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>c2</startPage>
			<endPage>c2</endPage>
			<fileSize>151</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Automatic Reconfiguration for Large-Scale Reliable Storage Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5593239]]></link>
			<description><![CDATA[Byzantine-fault-tolerant replication enhances the availability and reliability of Internet services that store critical state and preserve it despite attacks or software errors. However, existing Byzantine-fault-tolerant storage systems either assume a static set of replicas, or have limitations in how they handle reconfigurations (e.g., in terms of the scalability of the solutions or the consistency levels they provide). This can be problematic in long-lived, large-scale systems where system membership is likely to change during the system lifetime. In this paper, we present a complete solution for dynamically changing system membership in a large-scale Byzantine-fault-tolerant system. We present a service that tracks system membership and periodically notifies other system nodes of membership changes. The membership service runs mostly automatically, to avoid human configuration errors; is itself Byzantine-fault-tolerant and reconfigurable; and provides applications with a sequence of consistent views of the system membership. We demonstrate the utility of this membership service by using it in a novel distributed hash table called dBQS that provides atomic semantics even across changes in replica sets. dBQS is interesting in its own right because its storage algorithms extend existing Byzantine quorum protocols to handle changes in the replica set, and because it differs from previous DHTs by providing Byzantine fault tolerance and offering strong semantics. We implemented the membership service and dBQS. Our results show that the approach works well, in practice: the membership service is able to manage a large system and the cost to change the system membership is low.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5593239]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>145</startPage>
			<endPage>158</endPage>
			<fileSize>1025</fileSize>
			<authors><![CDATA[Rodrigues, Rodrigo;Liskov, Barbara;Chen, Kathryn;Liskov, Moses;Schultz, David;]]></authors>
		</item>
		<item>
			<title><![CDATA[Compiler-Directed Soft Error Mitigation for Embedded Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6065735]]></link>
			<description><![CDATA[The protection of processor-based systems to mitigate the harmful effect of transient faults (soft errors) is gaining importance as technology shrinks. At the same time, for large segments of embedded markets, parameters like cost and performance continue to be as important as reliability. This paper presents a compiler-based methodology for facilitating the design of fault-tolerant embedded systems. The methodology is supported by an infrastructure that permits to easily combine hardware/software soft errors mitigation techniques in order to best satisfy both usual design constraints and dependability requirements. It is based on a generic microprocessor architecture that facilitates the implementation of software-based techniques, providing a uniform isolated-from-target hardening core that allows the automatic generation of protected source code (hardened code). Two case studies are presented. In the first one, several software-based mitigation techniques are implemented and evaluated showing the flexibility of the infrastructure. In the second one, a customized fault tolerant embedded system is designed by combining selective protection on both hardware and software. Several trade-offs among performance, code size, reliability, and hardware costs have been explored. Results show the applicability of the approach. Among the developed software-based mitigation techniques, a novel selective version of the well known SWIFT-R is presented.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6065735]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>159</startPage>
			<endPage>172</endPage>
			<fileSize>3227</fileSize>
			<authors><![CDATA[Martinez-Alvarez, Antonio;Cuenca-Asensi, Sergio;Restrepo-Calle, Felipe;Palomo, Francisco R.;Guzman-Miranda, Hipolito;Aguirre, Miguel A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Data-Provenance Verification For Secure Hosts]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6035722]]></link>
			<description><![CDATA[Malicious software typically resides stealthily on a user's computer and interacts with the user's computing resources. Our goal in this work is to improve the trustworthiness of a host and its system data. Specifically, we provide a new mechanism that ensures the correct origin or provenance of critical system information and prevents adversaries from utilizing host resources. We define data-provenance integrity as the security property stating that the source where a piece of data is generated cannot be spoofed or tampered with. We describe a cryptographic provenance verification approach for ensuring system properties and system-data integrity at kernel-level. Its two concrete applications are demonstrated in the keystroke integrity verification and malicious traffic detection. Specifically, we first design and implement an efficient cryptographic protocol that enforces keystroke integrity by utilizing on-chip Trusted Computing Platform (TPM). The protocol prevents the forgery of fake key events by malware under reasonable assumptions. Then, we demonstrate our provenance verification approach by realizing a lightweight framework for restricting outbound malware traffic. This traffic-monitoring framework helps identify network activities of stealthy malware, and lends itself to a powerful personal firewall for examining all outbound traffic of a host that cannot be bypassed.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6035722]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>173</startPage>
			<endPage>183</endPage>
			<fileSize>494</fileSize>
			<authors><![CDATA[Xu, Kui;Xiong, Huijun;Wu, Chehai;Stefan, Deian;Yao, Danfeng;]]></authors>
		</item>
		<item>
			<title><![CDATA[Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6081880]]></link>
			<description><![CDATA[The multihop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks, and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an antidetection mechanism.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6081880]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>184</startPage>
			<endPage>197</endPage>
			<fileSize>1701</fileSize>
			<authors><![CDATA[Guoxing Zhan;Weisong Shi;Deng, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Detecting Spam Zombies by Monitoring Outgoing Messages]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6042885]]></link>
			<description><![CDATA[Compromised machines are one of the key security threats on the Internet; they are often used to launch various security attacks such as spamming and spreading malware, DDoS, and identity theft. Given that spamming provides a key economic incentive for attackers to recruit the large number of compromised machines, we focus on the detection of the compromised machines in a network that are involved in the spamming activities, commonly known as spam zombies. We develop an effective spam zombie detection system named SPOT by monitoring outgoing messages of a network. SPOT is designed based on a powerful statistical tool called Sequential Probability Ratio Test, which has bounded false positive and false negative error rates. In addition, we also evaluate the performance of the developed SPOT system using a two-month e-mail trace collected in a large US campus network. Our evaluation studies show that SPOT is an effective and efficient system in automatically detecting compromised machines in a network. For example, among the 440 internal IP addresses observed in the e-mail trace, SPOT identifies 132 of them as being associated with compromised machines. Out of the 132 IP addresses identified by SPOT, 126 can be either independently confirmed (110) or highly likely (16) to be compromised. Moreover, only seven internal IP addresses associated with compromised machines in the trace are missed by SPOT. In addition, we also compare the performance of SPOT with two other spam zombie detection algorithms based on the number and percentage of spam messages originated or forwarded by internal machines, respectively, and show that SPOT outperforms these two detection algorithms.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6042885]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>198</startPage>
			<endPage>210</endPage>
			<fileSize>621</fileSize>
			<authors><![CDATA[Duan, Zhenhai;Chen, Peng;Sanchez, Fernando;Dong, Yingfei;Stephenson, Mary;Barker, James Michael;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the Security and Efficiency of Content Distribution via Network Coding]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5887350]]></link>
			<description><![CDATA[Content distribution via network coding has received a lot of attention lately. However, direct application of network coding may be insecure. In particular, attackers can inject "bogus&#x0201D; data to corrupt the content distribution process so as to hinder the information dispersal or even deplete the network resource. Therefore, content verification is an important and practical issue when network coding is employed. When random linear network coding is used, it is infeasible for the source of the content to sign all the data, and hence, the traditional "hash-and-sign&#x0201D; methods are no longer applicable. Recently, a new on-the-fly verification technique has been proposed by Krohn et al. (IEEE S&amp;P '04), which employs a classical homomorphic hash function. However, this technique is difficult to be applied to network coding because of high computational and communication overhead. We explore this issue further by carefully analyzing different types of overhead, and propose methods to help reducing both the computational and communication cost, and provide provable security at the same time.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5887350]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>211</startPage>
			<endPage>221</endPage>
			<fileSize>433</fileSize>
			<authors><![CDATA[Li, Qiming;Lui, John C.S.;Chiu, Dah-Ming;]]></authors>
		</item>
		<item>
			<title><![CDATA[Persuasive Cued Click-Points: Design, Implementation, and Evaluation of a Knowledge-Based Authentication Mechanism]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6065736]]></link>
			<description><![CDATA[This paper presents an integrated evaluation of the Persuasive Cued Click-Points graphical password scheme, including usability and security evaluations, and implementation considerations. An important usability goal for knowledge-based authentication systems is to support users in selecting passwords of higher security, in the sense of being from an expanded effective security space. We use persuasion to influence user choice in click-based graphical passwords, encouraging users to select more random, and hence more difficult to guess, click-points.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6065736]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>222</startPage>
			<endPage>235</endPage>
			<fileSize>912</fileSize>
			<authors><![CDATA[Chiasson, Sonia;Stobert, Elizabeth;Forget, Alain;Biddle, Robert;Van Oorschot, Paul C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Quantitative Analysis of Consensus Algorithms]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6035721]]></link>
			<description><![CDATA[Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address this question for round-based consensus algorithms using communication predicates, on top of a partial synchronous system that alternates between good and bad periods (synchronous and nonsynchronous periods). Communication predicates together with the detailed timing information of the underlying partially synchronous system provide a convenient and powerful framework for comparing different consensus algorithms and their implementations. This approach allows us to quantify the required length of a good period to solve a given number of consensus instances. With our results, we can observe several interesting issues, such as the number of rounds of an algorithm is not necessarily a good metric for its performance.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6035721]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>236</startPage>
			<endPage>249</endPage>
			<fileSize>1156</fileSize>
			<authors><![CDATA[Borran, Fatemeh;Hutle, Martin;Santos, Nuno;Schiper, Andre;]]></authors>
		</item>
		<item>
			<title><![CDATA[Risk-Aware Mitigation for MANET Routing Attacks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6035723]]></link>
			<description><![CDATA[Mobile Ad hoc Networks (MANET) have been highly vulnerable to attacks due to the dynamic nature of its network infrastructure. Among these attacks, routing attacks have received considerable attention since it could cause the most devastating damage to MANET. Even though there exist several intrusion response techniques to mitigate such critical attacks, existing solutions typically attempt to isolate malicious nodes based on binary or nai&#x0308;ve fuzzy response decisions. However, binary responses may result in the unexpected network partition, causing additional damages to the network infrastructure, and nai&#x0308;ve fuzzy responses could lead to uncertainty in countering routing attacks in MANET. In this paper, we propose a risk-aware response mechanism to systematically cope with the identified routing attacks. Our risk-aware approach is based on an extended Dempster-Shafer mathematical theory of evidence introducing a notion of importance factors. In addition, our experiments demonstrate the effectiveness of our approach with the consideration of several performance metrics.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6035723]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>250</startPage>
			<endPage>260</endPage>
			<fileSize>642</fileSize>
			<authors><![CDATA[Ziming Zhao;Hongxin Hu;Gail-Joon Ahn;Ruoyu Wu;]]></authors>
		</item>
		<item>
			<title><![CDATA[SecuredTrust: A Dynamic Trust Computation Model for Secured Communication in Multiagent Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6081879]]></link>
			<description><![CDATA[Security and privacy issues have become critically important with the fast expansion of multiagent systems. Most network applications such as pervasive computing, grid computing, and P2P networks can be viewed as multiagent systems which are open, anonymous, and dynamic in nature. Such characteristics of multiagent systems introduce vulnerabilities and threats to providing secured communication. One feasible way to minimize the threats is to evaluate the trust and reputation of the interacting agents. Many trust/reputation models have done so, but they fail to properly evaluate trust when malicious agents start to behave in an unpredictable way. Moreover, these models are ineffective in providing quick response to a malicious agent's oscillating behavior. Another aspect of multiagent systems which is becoming critical for sustaining good service quality is the even distribution of workload among service providing agents. Most trust/reputation models have not yet addressed this issue. So, to cope with the strategically altering behavior of malicious agents and to distribute workload as evenly as possible among service providers; we present in this paper a dynamic trust computation model called "SecuredTrust.&#x0201D; In this paper, we first analyze the different factors related to evaluating the trust of an agent and then propose a comprehensive quantitative model for measuring such trust. We also propose a novel load-balancing algorithm based on the different factors defined in our model. Simulation results indicate that our model compared to other existing models can effectively cope with strategic behavioral change of malicious agents and at the same time efficiently distribute workload among the service providing agents under stable condition.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6081879]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>261</startPage>
			<endPage>274</endPage>
			<fileSize>3097</fileSize>
			<authors><![CDATA[Das, Anupam;Islam, Mohammad Mahfuzul;]]></authors>
		</item>
		<item>
			<title><![CDATA[Stabilization Enabling Technology]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6095569]]></link>
			<description><![CDATA[In this work, we suggest hardware and software components that enable the creation of a self-stabilizing os/vmm on top of an off-the-shelf, nonself-stabilizing processor. A simple "watchdog&#x0201D; hardware that is called a periodic reset monitor (prm) provides a basic solution. The solution is extended to stabilization enabling hardware (seh) which removes any real time requirement from the os/vmm. A stabilization enabling system that extends the seh with software components provides the user (an os/vmm designer) with a self-stabilizing processor abstraction. The method uses only a modest addition of hardware, which is external to the microprocessor. We demonstrate our approach on the XScale core by Intel. Moreover, we suggest methods for the adaptation of existing system code (e.g., code for operating systems) to be self-stabilizing. One method allows capturing and enforcing the configuration used by the program, thus reducing the work of the self-stabilizing algorithm designer to considering only the dynamic (nonconfigurational) parts of the state. Another method is suggested for ensuring that, eventually, addresses of branch commands are examined using a sanity check segment. This method is then used to ensure that a sanity check is performed before critical operations. One application of the latter method is for enforcing a full separation of components in the system]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6095569]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>275</startPage>
			<endPage>288</endPage>
			<fileSize>874</fileSize>
			<authors><![CDATA[Dolev, Shlomi;Haviv, Yinnon;]]></authors>
		</item>
		<item>
			<title><![CDATA[Survivability Experiment and Attack Characterization for RFID]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5871653]]></link>
			<description><![CDATA[Radio Frequency Identification (RFID) has been developed as an important technique for many high security and high integrity settings. In this paper, we study survivability issues for RFID. We first present an RFID survivability experiment to define a foundation to measure the degree of survivability of an RFID system under varying attacks. Then we model a series of malicious scenarios using stochastic process algebras and study the different effects of those attacks on the ability of the RFID system to provide critical services even when parts of the system have been damaged. Our simulation model relates its statistic to the attack strategies and security recovery. The model helps system designers and security specialists to identify the most devastating attacks given the attacker's capacities and the system's recovery abilities. The goal is to improve the system survivability given possible attacks. Our model is the first of its kind to formally represent and simulate attacks on RFID systems and to quantitatively measure the degree of survivability of an RFID system under those attacks.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5871653]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>289</startPage>
			<endPage>302</endPage>
			<fileSize>1890</fileSize>
			<authors><![CDATA[Yanjun Zuo;]]></authors>
		</item>
		<item>
			<title><![CDATA[Security of Bertino-Shang-Wagstaff Time-Bound Hierarchical Key Management Scheme for Secure Broadcasting]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5560677]]></link>
			<description><![CDATA[Recently, Bertino, Shang and Wagstaff proposed a time-bound hierarchical key management scheme for secure broadcasting. Their scheme is built on elliptic curve cryptography and implemented with tamper-resistant devices. In this paper, we present two collusion attacks on Bertino-Shang-Wagstaff scheme. The first attack does not need to compromise any decryption device, while the second attack requires to compromise single decryption device only. Both attacks are feasible and effective.]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=5560677]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>303</startPage>
			<endPage>304</endPage>
			<fileSize>70</fileSize>
			<authors><![CDATA[Yi, Xun;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cover3]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134784]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134784]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>c3</startPage>
			<endPage>c3</endPage>
			<fileSize>151</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Cover4]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134785]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[March-April  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=6134781&arnumber=6134785]]></guid>
			<volume>9</volume>
			<issue>2</issue>
			<startPage>c4</startPage>
			<endPage>c4</endPage>
			<fileSize>101</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>
