<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><title>RSS for CEE</title><link>http://academic.research.microsoft.com/Rss.aspx?id=814&amp;cata=6</link><description>Search RSS feed for Microsoft Academic Search</description><generator>MSRA Libra RSS Burner</generator><copyright>(c)2008 Microsoft Corpration, All right reserved.</copyright><pubDate>Thu, 23 May 2013 23:56:34 GMT</pubDate><lastBuildDate>Thu, 23 May 2013 23:56:34 GMT</lastBuildDate><category /><item><title>Fast and efficient processor allocation algorithm for torus-based chip multiprocessors</title><link>http://academic.research.microsoft.com/Publication/39333105</link><pubDate>Thu, 23 May 2013 23:56:34 GMT</pubDate><guid isPermaLink="false">39333105</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3570348">Dawid Zydek</a>, <a href="http://academic.research.microsoft.com/Author/571232">Henry Selvaraj</a><span style="margin-left:20px">(Citations:4)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000960">view publication</a></span></p><p>Processor Allocator (PA) is a crucial factor in modern Chip MultiProcessors (CMPs). A modern CMP uses Network on Chip (NoC) as communication technique between cores. Thus, the topology of the implemented NoC has also significant impact on the CMP’s performance. A good processor allocation technique needs to be fast and ensure the highest possible system utilization. In this paper, we ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 91-105, 2011</cite>]]></description></item><item><title>Region based QIM digital watermarking scheme for image database in DCT domain</title><link>http://academic.research.microsoft.com/Publication/39333123</link><pubDate>Thu, 23 May 2013 23:56:33 GMT</pubDate><guid isPermaLink="false">39333123</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3832522">Amit Phadikar</a>, <a href="http://academic.research.microsoft.com/Author/251577">Santi P. Maity</a>, <a href="http://academic.research.microsoft.com/Author/55183961">Bhupendra Verma</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S004579061100022X">view publication</a></span></p><p>This paper proposes a region based digital watermarking scheme to serve the purpose of copyright protection and integrity verification of image database using discrete cosine transform (DCT). The objective is achieved by embedding watermark into visually significant regions of the image(s) using quantization index modulation (QIM). The main contributions of this work are, (1) the use of quad tree ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 339-355, 2011</cite>]]></description></item><item><title>An efficient identity-based blind signature scheme without bilinear pairings</title><link>http://academic.research.microsoft.com/Publication/49153701</link><pubDate>Thu, 23 May 2013 23:56:32 GMT</pubDate><guid isPermaLink="false">49153701</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/8238136">Debiao He</a>, <a href="http://academic.research.microsoft.com/Author/56805976">Jianhua Chen</a>, <a href="http://academic.research.microsoft.com/Author/772816">Rui Zhang</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000784">view publication</a></span></p><p>The blind signature schemes are useful in some applications where the anonymity is a big issue. Examples include the online voting systems and the electronic cash systems. Since the first identity-based blind signature scheme was proposed by Zhang et al., many identity-based blind signature schemes using bilinear pairings have been proposed. But the relative computation cost of the ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 444-450, 2011</cite>]]></description></item><item><title>Key management systems for sensor networks in the context of the Internet of Things</title><link>http://academic.research.microsoft.com/Publication/39333134</link><pubDate>Thu, 23 May 2013 23:56:31 GMT</pubDate><guid isPermaLink="false">39333134</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/320558">Rodrigo Roman</a>, <a href="http://academic.research.microsoft.com/Author/3585700">Cristina Alcaraz</a>, <a href="http://academic.research.microsoft.com/Author/33658">Javier Lopez</a>, <a href="http://academic.research.microsoft.com/Author/3375135">Nicolas Sklavos</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000176">view publication</a></span></p><p>If a wireless sensor network (WSN) is to be completely integrated into the Internet as part of the Internet of Things (IoT), it is necessary to consider various security challenges, such as the creation of a secure channel between an Internet host and a sensor node. In order to create such a channel, it is necessary to provide key management ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 147-159, 2011</cite>]]></description></item><item><title>Analysis and improvement of an authenticated multiple key exchange protocol</title><link>http://academic.research.microsoft.com/Publication/39333129</link><pubDate>Thu, 23 May 2013 23:56:30 GMT</pubDate><guid isPermaLink="false">39333129</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3847514">Qingfeng Cheng</a>, <a href="http://academic.research.microsoft.com/Author/3614619">Chuangui Ma</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000255">view publication</a></span></p><p>In 2010, Vo et al. (2010) [7] proposed an enhancement of authenticated multiple key exchange protocol based on Lee et al.’s protocol. In this paper, we will show that Vo et al.’s multiple key exchange protocol cannot resist reflection attack. It means that their protocol fails to provide mutual authentication. Furthermore, we propose an improvement of Vo et ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 187-190, 2011</cite>]]></description></item><item><title>Multiple layers block overlapped histogram equalization for local content emphasis</title><link>http://academic.research.microsoft.com/Publication/49153706</link><pubDate>Thu, 23 May 2013 23:56:29 GMT</pubDate><guid isPermaLink="false">49153706</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/2516965">Nicholas Sia Pik Kong</a>, <a href="http://academic.research.microsoft.com/Author/22357084">Haidi Ibrahim</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610001011">view publication</a></span></p><p>Although local histogram equalization (LHE) can be used to emphasize local content in an image, several problems are associated with it. First, LHE tends to amplify speckle noise. Second, this method is not able to preserve the shape of the input histogram, which means the lost of information. Previous literatures also do not give any suggestion on selecting a proper ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 631-643, 2011</cite>]]></description></item><item><title>Enhanced short signature scheme with hybrid problems</title><link>http://academic.research.microsoft.com/Publication/39333131</link><pubDate>Thu, 23 May 2013 23:56:28 GMT</pubDate><guid isPermaLink="false">39333131</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3853376">Pin-Chang Su</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000231">view publication</a></span></p><p>Short digital signatures are always desirable; for instance, when a human is asked to key in the signature manually or it is necessary to work effectively in low-bandwidth communication, low-storage and low-computation environments. We propose a short signature scheme based on knapsack and Gap Diffie–Hellman (GDH) groups whose security is closely related to the discrete logarithm ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 174-179, 2011</cite>]]></description></item><item><title>Virtual workflow system for distributed collaborative scientific applications on Grids</title><link>http://academic.research.microsoft.com/Publication/39333117</link><pubDate>Thu, 23 May 2013 23:56:27 GMT</pubDate><guid isPermaLink="false">39333117</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3345185">Lizhe Wang</a>, <a href="http://academic.research.microsoft.com/Author/98382">Dan Chen</a>, <a href="http://academic.research.microsoft.com/Author/17922267">Fang Huang</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000127">view publication</a></span></p><p>Grid computing has become an effective computing technique in recent years. This paper develops a virtual workflow system to construct distributed collaborative applications for Grid users. The virtual workflow system consists three levels: abstract workflow system, translator and concrete workflow system. The research highlight of the implementation is that this workflow system is developed based on CORBA and Unicore Grid ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 300-310, 2011</cite>]]></description></item><item><title>Short designated verifier proxy signatures</title><link>http://academic.research.microsoft.com/Publication/39333133</link><pubDate>Thu, 23 May 2013 23:56:26 GMT</pubDate><guid isPermaLink="false">39333133</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1559784">Kyung-Ah Shim</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000243">view publication</a></span></p><p>A proxy signature enables an original signer to delegate its signing capability to a proxy signer and the proxy signer can sign a message on behalf of the original signer. Later, anyone can verify the validity of proxy signatures. The “public-verifiable” property of the proxy signature is not suitable in some applications in which a proxy signed message may ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 180-186, 2011</cite>]]></description></item><item><title>An educational tool for artificial neural networks</title><link>http://academic.research.microsoft.com/Publication/39333118</link><pubDate>Thu, 23 May 2013 23:56:25 GMT</pubDate><guid isPermaLink="false">39333118</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/5213634">Omer Deperlioglu</a>, <a href="http://academic.research.microsoft.com/Author/56101196">Utku Kose</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000371">view publication</a></span></p><p>Artificial neural networks are some kind of data processing systems, which try to simulate features of the human brain and its learning process. So, they are widely used by researchers to solve different problems in optimization, classification, pattern recognition, associative memory and control. In this paper, an educational tool, which can be used to work on different kinds of neural ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 392-402, 2011</cite>]]></description></item><item><title>Multi-focus image fusion for visual sensor networks in DCT domain</title><link>http://academic.research.microsoft.com/Publication/49153709</link><pubDate>Thu, 23 May 2013 23:56:24 GMT</pubDate><guid isPermaLink="false">49153709</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/56465470">Mohammad Bagher Akbari Haghighat</a>, <a href="http://academic.research.microsoft.com/Author/3512782">Ali Aghagolzadeh</a>, <a href="http://academic.research.microsoft.com/Author/3512781">Hadi Seyedarabi</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000619">view publication</a></span></p><p>The objective of image fusion is to combine relevant information from multiple images into a single image. The discrete cosine transform (DCT) based methods of image fusion are more efficient and time-saving in real-time systems using DCT based standards of still image or video. Existing DCT based methods are suffering from some undesirable side effects like blurring or ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 789-797, 2011</cite>]]></description></item><item><title>Comparison of the impact of some Minkowski metrics on VQ/GMM based speaker recognition</title><link>http://academic.research.microsoft.com/Publication/39333106</link><pubDate>Thu, 23 May 2013 23:56:23 GMT</pubDate><guid isPermaLink="false">39333106</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/29204332">Cemal Hanilçi</a>, <a href="http://academic.research.microsoft.com/Author/29204333">Figen Ertas</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000832">view publication</a></span></p><p>This paper evaluates the impact of three special forms of the Minkowski metric (Euclidean, City Block, and Chebychev distances) on the performance of the conventional vector quantization (VQ) and Gaussian mixture model (GMM) based closed-set text-independent speaker recognition systems, in terms of recognition rate and confidence on decisions. For the VQ based system, evaluations are carried out using ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 41-56, 2011</cite>]]></description></item><item><title>Visual impact enhancement via image histogram smoothing and continuous intensity relocation</title><link>http://academic.research.microsoft.com/Publication/49153718</link><pubDate>Thu, 23 May 2013 23:56:22 GMT</pubDate><guid isPermaLink="false">49153718</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3571527">N. M. Kwok</a>, <a href="http://academic.research.microsoft.com/Author/2434006">Xiuping Jia</a>, <a href="http://academic.research.microsoft.com/Author/11350679">D. Wang</a>, <a href="http://academic.research.microsoft.com/Author/56311877">S. Y. Chen</a>, <a href="http://academic.research.microsoft.com/Author/50377775">Gu Fang</a>, <a href="http://academic.research.microsoft.com/Author/10992357">Q. P. Ha</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001170">view publication</a></span></p><p>Image contrast enhancement is a fundamental pre-processing stage in applications requiring image processing operations. Among revenues of available approaches, histogram equalization is a popular and attractive candidate method to produce resultant images of increased contrast. However, images obtained from canonical histogram equalization frequently suffer from the accompanying artefacts and give rises to uncomfortable viewing particularly in homogeneous regions. In ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 681-694, 2011</cite>]]></description></item><item><title>An efficient scheduling algorithm for radio resource reuse in IEEE 802.16j multi-hop relay networks</title><link>http://academic.research.microsoft.com/Publication/49153695</link><pubDate>Thu, 23 May 2013 23:56:21 GMT</pubDate><guid isPermaLink="false">49153695</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1170435">Wen-Hwa Liao</a>, <a href="http://academic.research.microsoft.com/Author/724514">Kuei-Ping Shih</a>, <a href="http://academic.research.microsoft.com/Author/17992256">Chen Liu</a>, <a href="http://academic.research.microsoft.com/Author/6146222">Avinash Kumar Dubey</a>, <a href="http://academic.research.microsoft.com/Author/3844712">Sagar Arora</a>, <a href="http://academic.research.microsoft.com/Author/11699900">Sital Prasad Kedia</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000711">view publication</a></span></p><p>The IEEE 802.16j standard for WiMAX introduced the concept of relay station in order to increase the service area and decrease the deployment cost of the network. In this paper, we have proposed an efficient scheduling scheme for IEEE 802.16j networks, which maximizes the number of connections that are scheduled in a particular time slot. The proposed scheme ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 511-525, 2011</cite>]]></description></item><item><title>Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even</title><link>http://academic.research.microsoft.com/Publication/39333109</link><pubDate>Thu, 23 May 2013 23:56:20 GMT</pubDate><guid isPermaLink="false">39333109</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/29204336">Hsun Su</a>, <a href="http://academic.research.microsoft.com/Author/29204337">Jing-Ling Pan</a>, <a href="http://academic.research.microsoft.com/Author/3419953">Shin-Shin Kao</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000164">view publication</a></span></p><p>The k-ary n-cube has been used as the underlying topology for many practical multicomputers, and has been extensively studied in the past. In this article, we will prove that any k-ary n-cube Qnk, where n⩾2 is an integer and k⩾4 is an even integer, contains 2n mutually independent Hamiltonian cycles. More specifically, let N=|V(Qnk)|,...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 319-331, 2011</cite>]]></description></item><item><title>Comparative analysis of power variables in high performance embedded and x86 architectures using GNU/Linux</title><link>http://academic.research.microsoft.com/Publication/49153692</link><pubDate>Thu, 23 May 2013 23:56:19 GMT</pubDate><guid isPermaLink="false">49153692</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3357138">F. G. Montoya</a>, <a href="http://academic.research.microsoft.com/Author/47537265">A. Alcayde</a>, <a href="http://academic.research.microsoft.com/Author/6173818">P. Sánchez</a>, <a href="http://academic.research.microsoft.com/Author/3357137">C. Gil</a>, <a href="http://academic.research.microsoft.com/Author/3368761">M. G. Montoya</a>, <a href="http://academic.research.microsoft.com/Author/18511286">J. Gómez</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000577">view publication</a></span></p><p>In this work a comparative analysis of typical power variables is made using several hardware architectures and GNU/Linux software. Voltage and current data are simulated for an industrial device, comparing the performance of x86 and ARM in order to demonstrate the technical feasibility of using embedded hardware to manage high volumes of interesting data in the study of power ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 541-549, 2011</cite>]]></description></item><item><title>Vulnerability of two multiple-key agreement protocols</title><link>http://academic.research.microsoft.com/Publication/39333132</link><pubDate>Thu, 23 May 2013 23:56:18 GMT</pubDate><guid isPermaLink="false">39333132</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/29204964">Mohammad Sabzinejad Farash</a>, <a href="http://academic.research.microsoft.com/Author/29204965">Majid Bayat</a>, <a href="http://academic.research.microsoft.com/Author/11559820">Mahmoud Ahmadian-Attari</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000279">view publication</a></span></p><p>In 2008, Lee et al. proposed two multiple-key agreement protocols, first one based on elliptic curve cryptography (ECC) and the other one, based on bilinear pairings. Shortly after publication, Vo et al. showed that the Lee–Wu–Wang’s pairing-based protocol is vulnerable to impersonation attack then for removing the problem, they proposed an improved protocol. In this paper, ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 199-204, 2011</cite>]]></description></item><item><title>Image denoising using bilateral filter and Gaussian scale mixtures in shiftable complex directional pyramid domain</title><link>http://academic.research.microsoft.com/Publication/49153705</link><pubDate>Thu, 23 May 2013 23:56:17 GMT</pubDate><guid isPermaLink="false">49153705</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/53662787">Hong-Ying Yang</a>, <a href="http://academic.research.microsoft.com/Author/3461463">Xiang-Yang Wang</a>, <a href="http://academic.research.microsoft.com/Author/56622904">Tian-Xiang Qu</a>, <a href="http://academic.research.microsoft.com/Author/11828138">Zhong-Kai Fu</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S004579061000100X">view publication</a></span></p><p>For image denoising, the main challenge is how to preserve the information-bearing structures such as edges and textures to get satisfactory visual quality when improving the signal-to-noise-ratio (SNR). Edge-preserving image denoising has become a very intensive research topic. In this paper, we describe a method for removing noise from digital images, based on bilateral filter ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 656-668, 2011</cite>]]></description></item><item><title>Performance evaluation for on-demand routing protocols based on OPNET modules in wireless mesh networks</title><link>http://academic.research.microsoft.com/Publication/39333108</link><pubDate>Thu, 23 May 2013 23:56:16 GMT</pubDate><guid isPermaLink="false">39333108</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/680998">Lei Guo</a>, <a href="http://academic.research.microsoft.com/Author/29204334">Yuhuai Peng</a>, <a href="http://academic.research.microsoft.com/Author/18491378">Xingwei Wang</a>, <a href="http://academic.research.microsoft.com/Author/3669108">Dingde Jiang</a>, <a href="http://academic.research.microsoft.com/Author/29204335">Yinpeng Yu</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000972">view publication</a></span></p><p>In wireless networks, users expect to get access to the network securely and seamlessly to share the data flow of access points anytime and anywhere. However, either point-to-point or point-to-multipoint methods in traditional wireless networks make the network bandwidth decrease rapidly, which cannot meet the requirements of users. Recently, a new wireless broadband access network, wireless ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 106-114, 2011</cite>]]></description></item><item><title>A lossless ECG data compression technique using ASCII character encoding</title><link>http://academic.research.microsoft.com/Publication/49153697</link><pubDate>Thu, 23 May 2013 23:56:15 GMT</pubDate><guid isPermaLink="false">49153697</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/10554833">S. K. Mukhopadhyay</a>, <a href="http://academic.research.microsoft.com/Author/53584654">S. Mitra</a>, <a href="http://academic.research.microsoft.com/Author/529701">M. Mitra</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000735">view publication</a></span></p><p>A software based lossless ECG compression algorithm is developed here. The algorithm is written in the C-platform. The algorithm has applied to various ECG data of all the 12 leads taken from PTB diagnostic ECG database (PTB-DB). Here, a difference array has been generated from the corresponding input ECG data and this is multiplied by a large number ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 486-497, 2011</cite>]]></description></item><item><title>Discrete logarithm based chameleon hashing and signatures without key exposure</title><link>http://academic.research.microsoft.com/Publication/49153685</link><pubDate>Thu, 23 May 2013 23:56:14 GMT</pubDate><guid isPermaLink="false">49153685</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/412996">Xiaofeng Chen</a>, <a href="http://academic.research.microsoft.com/Author/43489190">Fangguo Zhang</a>, <a href="http://academic.research.microsoft.com/Author/1707544">Haibo Tian</a>, <a href="http://academic.research.microsoft.com/Author/425971">Baodian Wei</a>, <a href="http://academic.research.microsoft.com/Author/5782360">Kwangjo Kim</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000383">view publication</a></span></p><p>Chameleon signatures simultaneously provide the properties of non-repudiation and non-transferability for the signed message. However, the initial constructions of chameleon signatures suffer from the key exposure problem of chameleon hashing. This creates a strong disincentive for the recipient to compute hash collisions, partially undermining the concept of non-transferability. Recently, some constructions of discrete logarithm based chameleon hashing ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 614-623, 2011</cite>]]></description></item><item><title>Two-dimensional minimum local cross-entropy thresholding based on co-occurrence matrix</title><link>http://academic.research.microsoft.com/Publication/49153712</link><pubDate>Thu, 23 May 2013 23:56:13 GMT</pubDate><guid isPermaLink="false">49153712</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/51822484">Fangyan Nie</a>, <a href="http://academic.research.microsoft.com/Author/225235">Chao Gao</a>, <a href="http://academic.research.microsoft.com/Author/53320097">Yongcai Guo</a>, <a href="http://academic.research.microsoft.com/Author/10698052">Min Gan</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000905">view publication</a></span></p><p>This paper introduces a novel image segmentation method that performs histogram thresholding on an image with consideration to spatial information. The spatial information is the joint gray level values of the pixel to be segmented and its neighboring pixels that are based on the gray level co-occurrence matrix (GLCM). The new method was obtained by extending the one-dimensional (...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 757-767, 2011</cite>]]></description></item><item><title>On the performance analysis of SIR-based SSC diversity over correlated α-μ fading channels</title><link>http://academic.research.microsoft.com/Publication/39333125</link><pubDate>Thu, 23 May 2013 23:56:12 GMT</pubDate><guid isPermaLink="false">39333125</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/11002611">Stefan R. Panić</a>, <a href="http://academic.research.microsoft.com/Author/29204341">Petar C. Spalevic</a>, <a href="http://academic.research.microsoft.com/Author/5543757">Jelena A. Anastasov</a>, <a href="http://academic.research.microsoft.com/Author/4123545">Mihajlo C. Stefanovic</a>, <a href="http://academic.research.microsoft.com/Author/50883965">Mile Petrovic</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000206">view publication</a></span></p><p>In this paper, an approach to the performance analysis of dual-branch switch-and-stay combining (SSC) diversity receiver, operating over correlated α–μ fading channels in the presence of co-channel interference (CCI), is presented. Very useful novel infinite series expressions are obtained for the probability density function (PDF) and cumulative distribution function (CDF) of the SSC output signal-...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 332-338, 2011</cite>]]></description></item><item><title>Robust transmission of scalable video stream using modified LT codes</title><link>http://academic.research.microsoft.com/Publication/49153708</link><pubDate>Thu, 23 May 2013 23:56:11 GMT</pubDate><guid isPermaLink="false">49153708</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/49592219">Ehsan Namjoo</a>, <a href="http://academic.research.microsoft.com/Author/3512782">Ali Aghagolzadeh</a>, <a href="http://academic.research.microsoft.com/Author/55321012">Javad Museviniya</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000565">view publication</a></span></p><p>LT codes are convenient and popular kind of rateless codes that could easily tolerate different patterns of loss in erasure channels. In this paper an LT code with unequal packet protection (UPP) property is proposed. The proposed code could provide unequal packet recovery to any importance-sorted data packets. Simulation results indicate the enhanced performance of the suggested scheme and ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 768-781, 2011</cite>]]></description></item><item><title>A fast parallel (23, 12, 7) QR decoder based on syndrome-weight determination</title><link>http://academic.research.microsoft.com/Publication/14575529</link><pubDate>Thu, 23 May 2013 23:56:10 GMT</pubDate><guid isPermaLink="false">14575529</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/51464290">Yih-Ching Su</a>, <a href="http://academic.research.microsoft.com/Author/3575785">Ming-Haw Jing</a>, <a href="http://academic.research.microsoft.com/Author/54998782">Yaotsu Chang</a>, <a href="http://academic.research.microsoft.com/Author/53681540">Jian-Hong Chen</a>, <a href="http://academic.research.microsoft.com/Author/3575784">Zih-Heng Chen</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000741">view publication</a></span></p><p>In this paper, a time-area efficient hardware decoder of the (23, 12, 7) quadratic residue code, or Golay code, is presented. The key feature of this proposed algorithm lies in fast determination of error positions through the analysis on the weight of syndromes without large operations in finite fields. Comparing with the algorithm using one syndrome, the proposed algorithm ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 24-29, 2011</cite>]]></description></item><item><title>Periodic timers revisited: The real-time embedded system perspective</title><link>http://academic.research.microsoft.com/Publication/39333113</link><pubDate>Thu, 23 May 2013 23:56:09 GMT</pubDate><guid isPermaLink="false">39333113</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3320487">Antônio Augusto Fröhlich</a>, <a href="http://academic.research.microsoft.com/Author/3836666">Giovani Gracioli</a>, <a href="http://academic.research.microsoft.com/Author/3634497">João Felipe Santos</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000309">view publication</a></span></p><p>Common sense dictates that single-shot timer mechanisms are more suitable for real-time applications than periodic ones, specially in what concerns precision and jitter. Nevertheless, real-time embedded systems are inherently periodic, with tasks whose periods are almost always known at design-time. Therefore a carefully designed periodic timer should be able to incorporate much of the advantages of ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 365-375, 2011</cite>]]></description></item><item><title>A real-time scheduling framework for embedded systems with environmental energy harvesting</title><link>http://academic.research.microsoft.com/Publication/49153696</link><pubDate>Thu, 23 May 2013 23:56:08 GMT</pubDate><guid isPermaLink="false">49153696</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/55321477">Hussein EL Ghor</a>, <a href="http://academic.research.microsoft.com/Author/3420135">Maryline Chetto</a>, <a href="http://academic.research.microsoft.com/Author/51326862">Rafic Hage Chehade</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000723">view publication</a></span></p><p>Real-time scheduling refers to the problem in which there is a deadline associated with the execution of a task. In this paper, we address the scheduling problem for a uniprocessor platform that is powered by a renewable energy storage unit and uses a recharging system such as photovoltaic cells. First, we describe our model where two constraints need to ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 498-510, 2011</cite>]]></description></item><item><title>Parallelization methods for implementation of discharge simulation along resin insulator surfaces</title><link>http://academic.research.microsoft.com/Publication/14575530</link><pubDate>Thu, 23 May 2013 23:56:07 GMT</pubDate><guid isPermaLink="false">14575530</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3392067">Kenli Li</a>, <a href="http://academic.research.microsoft.com/Author/5210119">Tianfang Tan</a>, <a href="http://academic.research.microsoft.com/Author/49202">Xiaoyong Tang</a>, <a href="http://academic.research.microsoft.com/Author/1436127">Feng Wang</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000777">view publication</a></span></p><p>In this paper, we will investigate the implementation of the parallelization approaches used in the program of discharge simulation along resin insulator surfaces in SF6/N2 gas mixture which initially consumes a great deal of computational time. In a general way, this simulation program spent 10 days of execution to achieve satisfactory research results. For this reason, the goal of ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 30-40, 2011</cite>]]></description></item><item><title>Robust copyright marking using Weibull distribution</title><link>http://academic.research.microsoft.com/Publication/49153707</link><pubDate>Thu, 23 May 2013 23:56:06 GMT</pubDate><guid isPermaLink="false">49153707</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/18529968">Harsh V. Singh</a>, <a href="http://academic.research.microsoft.com/Author/1149323">Suresh Rai</a>, <a href="http://academic.research.microsoft.com/Author/2611661">Anand Mohan</a>, <a href="http://academic.research.microsoft.com/Author/449934">Surya P. Singh</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000449">view publication</a></span></p><p>For multimedia document, watermarking provides many advantages; however, its vulnerability due to attacks using signal processing methods offers challenge in designing robust techniques. This paper presents a novel method for enhancing robustness in copyright marking into mid-frequency discrete cosine transform (DCT) coefficients of an image. We establish that Weibull distribution suitably models mid-frequency coefficients well and use it ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 714-728, 2011</cite>]]></description></item><item><title>Modeling the effects of hot-spot traffic load on the performance of wormhole-switched hypermeshes</title><link>http://academic.research.microsoft.com/Publication/14575526</link><pubDate>Thu, 23 May 2013 23:56:05 GMT</pubDate><guid isPermaLink="false">14575526</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3608977">Reza Moraveji</a>, <a href="http://academic.research.microsoft.com/Author/3347589">Hamid Sarbazi-Azad</a>, <a href="http://academic.research.microsoft.com/Author/3560285">Abbas Nayebi</a>, <a href="http://academic.research.microsoft.com/Author/3317671">Keivan Navi</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000571">view publication</a></span></p><p>Hypermesh is a promising network topology and is suitable for a range of network-based computing systems. Although there are few models reported for hypermeshes with uniform traffic pattern, no analytical model has been reported to deal with hot-spot traffic. Since many parallel applications exhibit non-uniform traffic patterns such as hot-spots, uniform traffic assumption is not always ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 1-23, 2011</cite>]]></description></item><item><title>Reconstruction of compressed samples in shift-invariant space base on matrix factorization</title><link>http://academic.research.microsoft.com/Publication/39333110</link><pubDate>Thu, 23 May 2013 23:56:04 GMT</pubDate><guid isPermaLink="false">39333110</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/22160698">Zhaoxuan Zhu</a>, <a href="http://academic.research.microsoft.com/Author/21797605">Houjun Wang</a>, <a href="http://academic.research.microsoft.com/Author/10654472">Zhigang Wang</a>, <a href="http://academic.research.microsoft.com/Author/275634">Hao Zhang</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000139">view publication</a></span></p><p>According to the model of compressed sampling in shift-invariant space, the over-complete dictionary is usually a function matrix, which increases the complexity of reconstructing samples. In order to reduce the complexity of reconstructing samples, this paper proposes a reconstruction method based on matrix factorization. The method transforms over-complete dictionary into the multiplication of a reversible function matrix ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 311-318, 2011</cite>]]></description></item><item><title>QoS guaranteed integration methodology for a WLAN-WiMAX heterogeneous network</title><link>http://academic.research.microsoft.com/Publication/39333124</link><pubDate>Thu, 23 May 2013 23:56:03 GMT</pubDate><guid isPermaLink="false">39333124</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/22112372">J. Jackson Juliet Roy</a>, <a href="http://academic.research.microsoft.com/Author/1030675">V. Vaidehi</a>, <a href="http://academic.research.microsoft.com/Author/3646249">M. S. Sricharan</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000024">view publication</a></span></p><p>Wireless technologies which serve multimedia applications have to guarantee the Quality of Service (QoS) demands along with seamless connectivity. The complexity in attaining such demands increases if the network is heterogeneous in nature. This paper proposes a QoS guaranteed integration methodology for a heterogeneous wireless local area network (WLAN) – worldwide interoperability for microwave access (WiMAX) network. An integrated protocol stack ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 261-274, 2011</cite>]]></description></item><item><title>Strongly secure identity-based authenticated key agreement protocols</title><link>http://academic.research.microsoft.com/Publication/39333115</link><pubDate>Thu, 23 May 2013 23:56:02 GMT</pubDate><guid isPermaLink="false">39333115</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/28980402">Liang Ni</a>, <a href="http://academic.research.microsoft.com/Author/3479681">Gongliang Chen</a>, <a href="http://academic.research.microsoft.com/Author/1106686">Jianhua Li</a>, <a href="http://academic.research.microsoft.com/Author/3992993">Yanyan Hao</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000280">view publication</a></span></p><p>In this paper, we present a strongly secure identity-based (ID-based) two-party authenticated key agreement (AKA) protocol, which captures all basic desirable security properties including master key forward secrecy, ephemeral secrets reveal resistance and so on, and is provably secure in the extended Canetti–Krawczyk (eCK) model. The security of the protocol can be reduced to the standard ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 205-217, 2011</cite>]]></description></item><item><title>Crypt analysis of two time pads in case of compressed speech</title><link>http://academic.research.microsoft.com/Publication/49153689</link><pubDate>Thu, 23 May 2013 23:56:01 GMT</pubDate><guid isPermaLink="false">49153689</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/13037848">L. A. Khan</a>, <a href="http://academic.research.microsoft.com/Author/10248889">M. S. Baig</a>, <a href="http://academic.research.microsoft.com/Author/23379715">Ali Hassan</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000462">view publication</a></span></p><p>Keystream reuse, also known as the two time pad problem, is a well known weakness in stream ciphers. The implementers of the cryptographic algorithms are still underestimating this threat. The keystream reuse exploitation techniques presented so far assume the underlying plaintext to be textual data and all the heuristics presented previously are based on the language characteristics of the underlying ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 559-569, 2011</cite>]]></description></item><item><title>Development process for clusters on a reconfigurable chip</title><link>http://academic.research.microsoft.com/Publication/48872063</link><pubDate>Thu, 23 May 2013 23:56:00 GMT</pubDate><guid isPermaLink="false">48872063</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/49933318">Eduard Fernandez-Alonso</a>, <a href="http://academic.research.microsoft.com/Author/3640175">David Castells-Rufas</a>, <a href="http://academic.research.microsoft.com/Author/2686443">Jaume Joven</a>, <a href="http://academic.research.microsoft.com/Author/10659894">Jordi Carrabina</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001315">view publication</a></span></p><p>Reconfigurable MPSoCs (Multiprocessor System-on-Chip) could be viable for certain applications niche where the flexibility of FPGAs (Field-Programmable Gate Array) and software is needed, and a small number of units dismiss other silicon options. However, their design complexity is very high, and raises additional problems, i.e. the definition of a suitable programming model, an efficient memory organization, ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, 2011</cite>]]></description></item><item><title>Attribution of attack trees</title><link>http://academic.research.microsoft.com/Publication/49153691</link><pubDate>Thu, 23 May 2013 23:55:59 GMT</pubDate><guid isPermaLink="false">49153691</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/12133694">John N. Whitley</a>, <a href="http://academic.research.microsoft.com/Author/71048">Raphael C.-W. Phan</a>, <a href="http://academic.research.microsoft.com/Author/22955709">Jie Wang</a>, <a href="http://academic.research.microsoft.com/Author/453140">David J. Parish</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000553">view publication</a></span></p><p>An attack tree is a useful analytical technique to model security threats and/or risks, and hence model attacks as actual realizations of the former. Research on attack trees have focused either on applying such trees to model various ranges of security systems, or on advancements to this technique in itself. In this paper, we revisit the notion of attack ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 624-628, 2011</cite>]]></description></item><item><title>Fault diagnosis in reversible circuits under missing-gate fault model</title><link>http://academic.research.microsoft.com/Publication/49153698</link><pubDate>Thu, 23 May 2013 23:55:58 GMT</pubDate><guid isPermaLink="false">49153698</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/11604533">Hafizur Rahaman</a>, <a href="http://academic.research.microsoft.com/Author/3645226">Dipak K. Kole</a>, <a href="http://academic.research.microsoft.com/Author/3086269">Debesh K. Das</a>, <a href="http://academic.research.microsoft.com/Author/3317958">Bhargab B. Bhattacharya</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000747">view publication</a></span></p><p>This article presents a novel technique for fault detection as well as fault location in a reversible combinational circuit under the missing gate fault model. It is shown that in an (n×n) reversible circuit implemented with k-CNOT gates, addition of only one extra control line along with duplication each k-CNOT gate, yields an easily testable design, which admits ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 475-485, 2011</cite>]]></description></item><item><title>Architecture design of variable block size motion estimation for full and fast search algorithms in H.264/AVC</title><link>http://academic.research.microsoft.com/Publication/39333114</link><pubDate>Thu, 23 May 2013 23:55:57 GMT</pubDate><guid isPermaLink="false">39333114</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/9497980">Xuanxing Xiong</a>, <a href="http://academic.research.microsoft.com/Author/1702983">Yang Song</a>, <a href="http://academic.research.microsoft.com/Author/3356960">Ali Akoglu</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000115">view publication</a></span></p><p>Fast search algorithms (FSA) used for variable block size motion estimation follow irregular search (data access) patterns. This poses as the main challenge in designing hardware architectures for them. In this study, we build a baseline architecture for fast search algorithms using state-of-the-art components available in academia. We improve its performance by introducing: (1) a super 2-...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 285-299, 2011</cite>]]></description></item><item><title>A fast implementation algorithm of TV inpainting model based on operator splitting method</title><link>http://academic.research.microsoft.com/Publication/49153710</link><pubDate>Thu, 23 May 2013 23:55:56 GMT</pubDate><guid isPermaLink="false">49153710</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/36987560">Fang Li</a>, <a href="http://academic.research.microsoft.com/Author/3673442">Chaomin Shen</a>, <a href="http://academic.research.microsoft.com/Author/5732596">Ruihua Liu</a>, <a href="http://academic.research.microsoft.com/Author/3656109">Jinsong Fan</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000838">view publication</a></span></p><p>In this paper, we propose a fast algorithm to solve the well known total variation (TV) inpainting model. Classically, the Euler–Lagrange equation deduced from TV inpainting model is solved by the gradient descent method and discretized by an explicit scheme, which produces a slow inpainting process. Sometimes an implicit scheme is also used to tackle the problem. Although the ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 782-788, 2011</cite>]]></description></item><item><title>Guest Editors' Introduction to the Special Issue on "Modern trends in applied security: Architectures, implementations and applications"</title><link>http://academic.research.microsoft.com/Publication/39333111</link><pubDate>Thu, 23 May 2013 23:55:55 GMT</pubDate><guid isPermaLink="false">39333111</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3375135">Nicolas Sklavos</a>, <a href="http://academic.research.microsoft.com/Author/455609">Sherali Zeadally</a>, <a href="http://academic.research.microsoft.com/Author/3585700">Cristina Alcaraz</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000310">view publication</a></span></p><p /><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 127-128, 2011</cite>]]></description></item><item><title>Test data compression based on geometric shapes</title><link>http://academic.research.microsoft.com/Publication/39333112</link><pubDate>Thu, 23 May 2013 23:55:54 GMT</pubDate><guid isPermaLink="false">39333112</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/2611301">Aiman El-Maleh</a>, <a href="http://academic.research.microsoft.com/Author/1701736">Saif al Zahir</a>, <a href="http://academic.research.microsoft.com/Author/3522802">Esam Khan</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000358">view publication</a></span></p><p>The increasing complexity of systems-on-a-chip with the accompanied increase in their test data size has made the need for test data reduction imperative. In this paper, we introduce a novel and efficient test-independent compression technique based on geometric shapes. The technique exploits reordering of test vectors to minimize the number of shapes needed to encode the ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 376-391, 2011</cite>]]></description></item><item><title>A user friendly authentication scheme with anonymity for wireless communications</title><link>http://academic.research.microsoft.com/Publication/39333130</link><pubDate>Thu, 23 May 2013 23:55:53 GMT</pubDate><guid isPermaLink="false">39333130</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1670769">Eun-Jun Yoon</a>, <a href="http://academic.research.microsoft.com/Author/1297164">Kee-Young Yoo</a>, <a href="http://academic.research.microsoft.com/Author/3044517">Keum-Sook Ha</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000292">view publication</a></span></p><p>Secure user authentication is an important issue for wireless environment such as GSM, CDPD, and 3G and 4G wireless systems. Especially, anonymity of the mobile users should be guaranteed to protect the privacy of the mobile users. This paper proposes a user friendly authentication scheme with anonymity for wireless communications that not only can overcome the weaknesses of the previous ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 356-364, 2011</cite>]]></description></item><item><title>An ID-based digital watermarking protocol for copyright protection</title><link>http://academic.research.microsoft.com/Publication/49153694</link><pubDate>Thu, 23 May 2013 23:55:52 GMT</pubDate><guid isPermaLink="false">49153694</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/12985138">Peng Zeng</a>, <a href="http://academic.research.microsoft.com/Author/1144020">Zhenfu Cao</a>, <a href="http://academic.research.microsoft.com/Author/3461514">Kim-Kwang Raymond Choo</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000590">view publication</a></span></p><p>Digital watermarking techniques are a means of protecting the copyrights of digital contents. In this paper, we propose an identity-based (ID-based) digital watermarking protocol and point out several previously unpublished flaws in Hwang et al. (2005)’s scheme. We hope that by identifying the design flaws, similar structural mistakes can be avoided in future designs. We also claim ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 526-531, 2011</cite>]]></description></item><item><title>A pseudo-Zernike moment based audio watermarking scheme robust against desynchronization attacks</title><link>http://academic.research.microsoft.com/Publication/49153703</link><pubDate>Thu, 23 May 2013 23:55:51 GMT</pubDate><guid isPermaLink="false">49153703</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3461463">Xiang-Yang Wang</a>, <a href="http://academic.research.microsoft.com/Author/9425281">Tian-Xiao Ma</a>, <a href="http://academic.research.microsoft.com/Author/3688089">Pan-Pan Niu</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000802">view publication</a></span></p><p>Desynchronization attack is known as one of the most difficult attacks to resist, for it can desynchronize the location of the watermark and hence causes incorrect watermark detection. It is a challenging work to design a robust audio watermarking scheme against desynchronization attacks. Based on pseudo-Zernike moment and synchronization code, we propose a new digital audio watermarking algorithm with ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 425-443, 2011</cite>]]></description></item><item><title>Efficient contention-based MAC protocol using adaptive fuzzy controlled sliding backoff interval for wireless networks</title><link>http://academic.research.microsoft.com/Publication/39333102</link><pubDate>Thu, 23 May 2013 23:55:50 GMT</pubDate><guid isPermaLink="false">39333102</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1138152">Mohammed Abd-Elnaby</a>, <a href="http://academic.research.microsoft.com/Author/54904168">Mohamed R. M. Rizk</a>, <a href="http://academic.research.microsoft.com/Author/3599449">Moawad I. Dessouky</a>, <a href="http://academic.research.microsoft.com/Author/22668">Sami A. El-Dolil</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000996">view publication</a></span></p><p>Efficient medium access control (MAC) protocol should be able to provide high throughput performance and efficient share of the medium. In this paper, a new contention-based MAC protocol based on adaptive fuzzy controlled sliding backoff interval is proposed to maximize the channel throughput and improve the fairness of random access channels. In the proposed protocol, every node that experiences ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 115-125, 2011</cite>]]></description></item><item><title>Countering jamming attacks against an authentication and key agreement protocol for mobile satellite communications</title><link>http://academic.research.microsoft.com/Publication/39333119</link><pubDate>Thu, 23 May 2013 23:55:49 GMT</pubDate><guid isPermaLink="false">39333119</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/4219981">Ioana Lasc</a>, <a href="http://academic.research.microsoft.com/Author/3376835">Reiner Dojen</a>, <a href="http://academic.research.microsoft.com/Author/3033448">Tom Coffey</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S004579061100019X">view publication</a></span></p><p>The radio-based medium of satellite communication systems is vulnerable to interference on physical channels: unintentional interferences occur frequently and jamming attacks can be achieved using low-grade technology. While application layer security protocols cannot defend against denial of service (DoS) attacks where the attacker jams continuously, effective security protocols ensure that communication can continue after such interference has stopped....</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 160-168, 2011</cite>]]></description></item><item><title>Classification of 3-D objects and faces employing view-based clusters</title><link>http://academic.research.microsoft.com/Publication/49153719</link><pubDate>Thu, 23 May 2013 23:55:48 GMT</pubDate><guid isPermaLink="false">49153719</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/49642263">M. Alarmel Mangai</a>, <a href="http://academic.research.microsoft.com/Author/12408722">N. Ammasai Gounden</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001224">view publication</a></span></p><p>This paper presents the design of a new clustering algorithm for images having wide range of variations in appearances and shape. The major chore of the clustering process involves in creating the partitions, reassigning the elements of the partitions and identifying the compact cluster obtained. The clusters are created from various low-dimensional spaces of the data set. Hierarchically related ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 824-833, 2011</cite>]]></description></item><item><title>A high performance ROM-based structure for modular exponentiation</title><link>http://academic.research.microsoft.com/Publication/39333120</link><pubDate>Thu, 23 May 2013 23:55:47 GMT</pubDate><guid isPermaLink="false">39333120</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1572709">Giuseppe Alia</a>, <a href="http://academic.research.microsoft.com/Author/3328327">Enrico Martinelli</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000036">view publication</a></span></p><p>Modular processing of large numbers requires high speed computing resources. In particular an operation slowing the whole computing process heavily is modular exponentiation.A previous method reduces the computation of |xe|m to n simpler modular exponentiations |xiηi|mi at most, where mi is an element of the factorization of m, xi=|x|mi and ηimi. A technique speeding up |...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 275-284, 2011</cite>]]></description></item><item><title>Reducing PAPR by selecting optimal wavelet tree structure in WOFDM</title><link>http://academic.research.microsoft.com/Publication/39333127</link><pubDate>Thu, 23 May 2013 23:55:46 GMT</pubDate><guid isPermaLink="false">39333127</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3120404">Miao Liu</a>, <a href="http://academic.research.microsoft.com/Author/55979">Ke Wang</a>, <a href="http://academic.research.microsoft.com/Author/23482202">Yue Huang</a>, <a href="http://academic.research.microsoft.com/Author/53593498">Xiangling Li</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610001035">view publication</a></span></p><p>The major disadvantage of wavelet based Orthogonal Frequency Division Multiplexing (WOFDM) system is high peak-to-average power ratio (PAPR) of the transmit signal. A new method is presented to obtain a set of optimal wavelet packet basis by constructing the PAPR optimization model and the optimal PAPR of system can be obtain by modulating the signal with the optimal ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 253-260, 2011</cite>]]></description></item><item><title>Large scale distributed visualization on computational Grids: A review</title><link>http://academic.research.microsoft.com/Publication/49153702</link><pubDate>Thu, 23 May 2013 23:55:45 GMT</pubDate><guid isPermaLink="false">49153702</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3345185">Lizhe Wang</a>, <a href="http://academic.research.microsoft.com/Author/12245918">Dan Chen</a>, <a href="http://academic.research.microsoft.com/Author/3585294">Ze Deng</a>, <a href="http://academic.research.microsoft.com/Author/17922267">Fang Huang</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000796">view publication</a></span></p><p>Advances in science and engineering have put high demands on tools for high performance large-scale data exploration and analysis. Visualization is a powerful technology for analyzing data and presenting results. Todays science and engineering have benefited from state-of-the-art of Grid technologies and modern visualization systems. To visualize the large amount of data, rendering technologies are widely ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 403-416, 2011</cite>]]></description></item><item><title>Adaptive image compression technique for wireless sensor networks</title><link>http://academic.research.microsoft.com/Publication/49153717</link><pubDate>Thu, 23 May 2013 23:55:44 GMT</pubDate><guid isPermaLink="false">49153717</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/29181797">Mohsen Nasri</a>, <a href="http://academic.research.microsoft.com/Author/3859374">Abdelhamid Helali</a>, <a href="http://academic.research.microsoft.com/Author/29181798">Halim Sghaier</a>, <a href="http://academic.research.microsoft.com/Author/1691577">Hassen Maaref</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001169">view publication</a></span></p><p>When using wireless sensor networks for real-time image transmission, some critical points should be considered. These points are limited computational power, storage capability, narrow bandwidth and required energy. Therefore, efficient compression and transmission of images in wireless sensor network is considered. To address the above mentioned concerns, an efficient adaptive compression scheme that ensures a significant computational and energy ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 798-810, 2011</cite>]]></description></item><item><title>Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors</title><link>http://academic.research.microsoft.com/Publication/49153700</link><pubDate>Thu, 23 May 2013 23:55:43 GMT</pubDate><guid isPermaLink="false">49153700</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/47666934">Sandra Roger</a>, <a href="http://academic.research.microsoft.com/Author/42357893">Alberto Gonzalez</a>, <a href="http://academic.research.microsoft.com/Author/3844442">Vicenc Almenar</a>, <a href="http://academic.research.microsoft.com/Author/665181">Antonio M. Vidal</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000760">view publication</a></span></p><p>It has been shown in several works that some preprocessing techniques can improve data detection performance when they are applied to the channel matrix of MIMO wireless systems. In particular, these techniques can be used previously to K-Best tree search algorithms, and they are known to achieve successful results. Throughout this work, the performance and complexity of two preprocessing ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 451-460, 2011</cite>]]></description></item><item><title>A non-reference image fusion metric based on mutual information of image features</title><link>http://academic.research.microsoft.com/Publication/49153716</link><pubDate>Thu, 23 May 2013 23:55:42 GMT</pubDate><guid isPermaLink="false">49153716</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/56465470">Mohammad Bagher Akbari Haghighat</a>, <a href="http://academic.research.microsoft.com/Author/3512782">Ali Aghagolzadeh</a>, <a href="http://academic.research.microsoft.com/Author/3512781">Hadi Seyedarabi</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001145">view publication</a></span></p><p>The widespread usage of image fusion causes an increase in the importance of assessing the performance of different fusion algorithms. The problem of introducing a suitable quality measure for image fusion lies in the difficulty of defining an ideal fused image. In this paper, we propose a non-reference objective image fusion metric based on mutual information which calculates the ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 744-756, 2011</cite>]]></description></item><item><title>Effective macroblock layer rate control algorithm for H.264/AVC</title><link>http://academic.research.microsoft.com/Publication/49153690</link><pubDate>Thu, 23 May 2013 23:55:41 GMT</pubDate><guid isPermaLink="false">49153690</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/21672779">Dandan Zhao</a>, <a href="http://academic.research.microsoft.com/Author/3562339">Yujie Zhou</a>, <a href="http://academic.research.microsoft.com/Author/22680586">Dayong Wang</a>, <a href="http://academic.research.microsoft.com/Author/384484">Junfa Mao</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000541">view publication</a></span></p><p>Rate control plays a critical role in the video encoder. In this paper, an effective macroblock (MB) layer rate control algorithm is proposed for H.264/AVC to improve video quality and reduce the computational complexity. By thoroughly analyzing the temporal–spatial correlation and object direction, the mean absolute difference (MAD) value of current MB is a weighted combination of ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 550-558, 2011</cite>]]></description></item><item><title>Fuzzy identity based signature with applications to biometric authentication</title><link>http://academic.research.microsoft.com/Publication/49153693</link><pubDate>Thu, 23 May 2013 23:55:40 GMT</pubDate><guid isPermaLink="false">49153693</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3705793">Piyi Yang</a>, <a href="http://academic.research.microsoft.com/Author/1144020">Zhenfu Cao</a>, <a href="http://academic.research.microsoft.com/Author/3555725">Xiaolei Dong</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000589">view publication</a></span></p><p>We introduce a new cryptographic primitive which is the signature analog of fuzzy identity based encryption (FIBE). We call it fuzzy identity based signature (FIBS). It possesses similar error-tolerance property as FIBE that allows a user with the private key for identity ω to decrypt a ciphertext encrypted for identity ω′ if and only if ω and ω′ are ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 532-540, 2011</cite>]]></description></item><item><title>Enhanced Certificate-Based Encryption from pairings</title><link>http://academic.research.microsoft.com/Publication/39333126</link><pubDate>Thu, 23 May 2013 23:55:39 GMT</pubDate><guid isPermaLink="false">39333126</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1077500">Zuhua Shao</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000152">view publication</a></span></p><p>In Certificate-Based Encryption, introduced by Gentry, a certificate, -or, more generally, a signature-acts not only as a certificate but also as a decryption key. However, the security model of Gentry’s scheme relies on an unrealistic assumption, where the adversary must reveal its partial private key to the challenger in attack games. In this paper, we propose an enhanced ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 136-146, 2011</cite>]]></description></item><item><title>On the security of an identity based multi-proxy signature scheme</title><link>http://academic.research.microsoft.com/Publication/39333128</link><pubDate>Thu, 23 May 2013 23:55:38 GMT</pubDate><guid isPermaLink="false">39333128</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1583905">Hu Xiong</a>, <a href="http://academic.research.microsoft.com/Author/3508711">Jian-bin Hu</a>, <a href="http://academic.research.microsoft.com/Author/6867881">Zhong Chen</a>, <a href="http://academic.research.microsoft.com/Author/3536617">Fagen Li</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000140">view publication</a></span></p><p>In a multi-proxy signature scheme, an original signer could authorize a proxy group as his proxy agent. Then only the cooperation of all the signers in the proxy group can generate the proxy signatures on behalf of the original signer. Recently, Cao and Cao gave the first formal definition and security model of an identity-based multi-proxy signature ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 129-135, 2011</cite>]]></description></item><item><title>Comments on the security of Chen's authenticated encryption scheme</title><link>http://academic.research.microsoft.com/Publication/39333103</link><pubDate>Thu, 23 May 2013 23:55:37 GMT</pubDate><guid isPermaLink="false">39333103</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/5221477">Mohamed M. Nasreldin Rasslan</a>, <a href="http://academic.research.microsoft.com/Author/3008524">Amr Youssef</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000856">view publication</a></span></p><p>Chen (Computers and Electrical Engineering, vol. 30, 2004) illustrated that Tseng et al.’s authenticated encryption schemes, with message linkages for message flows, do not achieve their claimed integrity and authenticity properties. Furthermore, Chen presented some modified schemes to repair these flaws. In this paper, we show that the modified schemes proposed by Chen are not secure. In particular, we ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 71-74, 2011</cite>]]></description></item><item><title>Learning automata based dynamic guard channel algorithms</title><link>http://academic.research.microsoft.com/Publication/49153686</link><pubDate>Thu, 23 May 2013 23:55:36 GMT</pubDate><guid isPermaLink="false">49153686</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3368035">Hamid Beigy</a>, <a href="http://academic.research.microsoft.com/Author/3364687">M. R. Meybodi</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000413">view publication</a></span></p><p>In this paper, we first propose two learning automata based decentralized dynamic guard channel algorithms for cellular mobile networks. These algorithms use learning automata to adjust the number of guard channels to be assigned to cells of network. Then, we introduce a new model for nonstationary environments under which the proposed algorithms work and study their steady state behavior when ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 601-613, 2011</cite>]]></description></item><item><title>Combining pulse-based features for rejecting far-field speech in a HMM-based Voice Activity Detector</title><link>http://academic.research.microsoft.com/Publication/49153687</link><pubDate>Thu, 23 May 2013 23:55:35 GMT</pubDate><guid isPermaLink="false">49153687</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/51140467">Óscar Varela</a>, <a href="http://academic.research.microsoft.com/Author/53636755">Rubén San-Segundo</a>, <a href="http://academic.research.microsoft.com/Author/49015362">Luís A. Hernández</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000437">view publication</a></span></p><p>Nowadays, several computational techniques for speech recognition have been proposed. These techniques suppose an important improvement in real time applications where speaker interacts with speech recognition systems. Although researchers proposed many methods, none of them solve the high false alarm problem when far-field speakers interfere in a human-machine conversation. This paper presents a two-class (speech and non-...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 589-600, 2011</cite>]]></description></item><item><title>Additive noise removal using a novel fuzzy-based filter</title><link>http://academic.research.microsoft.com/Publication/49153711</link><pubDate>Thu, 23 May 2013 23:55:34 GMT</pubDate><guid isPermaLink="false">49153711</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3626441">Madhu S. Nair</a>, <a href="http://academic.research.microsoft.com/Author/2515879">G. Raju</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000851">view publication</a></span></p><p>The paper proposes a new fuzzy-based two-step filter for restoring images corrupted with additive noise. The goal of the first step is to compute the difference between the central pixel and its neighborhood in a selected window and to compute a fuzzy membership degree for each difference value using a Gaussian membership function. Computed fuzzy membership values are ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 644-655, 2011</cite>]]></description></item><item><title>Contract signature in e-commerce</title><link>http://academic.research.microsoft.com/Publication/39333116</link><pubDate>Thu, 23 May 2013 23:55:33 GMT</pubDate><guid isPermaLink="false">39333116</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/53510526">Lein Harn</a>, <a href="http://academic.research.microsoft.com/Author/3346733">Chu-Hsing Lin</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000218">view publication</a></span></p><p>In this paper, we propose a notion of contract signature used in e-commerce applications. We propose a contract signature scheme based on the discrete logarithm assumption. The contract signature scheme adopts a digital multi-signature scheme in public-key cryptography to facilitate fair signature exchange over network. This proposed solution allows multiple signers of a contract signature to exchange ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 169-173, 2011</cite>]]></description></item><item><title>LLACA: An adaptive localized clustering algorithm for wireless ad hoc networks</title><link>http://academic.research.microsoft.com/Publication/49153699</link><pubDate>Thu, 23 May 2013 23:55:32 GMT</pubDate><guid isPermaLink="false">49153699</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3642775">Javad Akbari Torkestani</a>, <a href="http://academic.research.microsoft.com/Author/3364687">Mohammad Reza Meybodi</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000759">view publication</a></span></p><p>Performance of ad hoc networks dramatically declines as network grows. Cluster formation in which the network hosts are hierarchically partitioned into several autonomous non-overlapping groups, based on proximity, is a promising approach to alleviate the scalability problem of ad hoc networks. In this paper, we propose a localized learning automata-based clustering algorithm for wireless ad hoc networks. The ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 461-474, 2011</cite>]]></description></item><item><title>A new non-symmetry and anti-packing model and its application to image contrast enhancement</title><link>http://academic.research.microsoft.com/Publication/49153715</link><pubDate>Thu, 23 May 2013 23:55:31 GMT</pubDate><guid isPermaLink="false">49153715</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/135411">Chuanbo Chen</a>, <a href="http://academic.research.microsoft.com/Author/10219921">Guangwei Wang</a>, <a href="http://academic.research.microsoft.com/Author/3378666">Mudar Sarem</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S004579061100108X">view publication</a></span></p><p>In this paper, a non-symmetry and anti-packing image representation model (NAM) has been proposed. NAM is a hierarchical image representation method and it aims to provide faster operations and less storage requirement. By taking a rectangle sub-pattern, for example, we describe the idea of NAM and its encoding algorithm.In addition, an approach for adaptive area histogram ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 669-680, 2011</cite>]]></description></item><item><title>Bandwidth allocation for video transmission with differentiated quality of experience over wireless networks</title><link>http://academic.research.microsoft.com/Publication/39333107</link><pubDate>Thu, 23 May 2013 23:55:30 GMT</pubDate><guid isPermaLink="false">39333107</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3506034">Pejman Goudarzi</a>, <a href="http://academic.research.microsoft.com/Author/3679857">Mohammad R. Nezami Ranjbar</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000947">view publication</a></span></p><p>Delivering digital video content with enhanced quality of experience to the end users over error-prone multi-hop wireless networks is a challenging issue. In video transmission over such wireless networks, many network-based (packet loss, delay, etc.) and source-based (encoding quantization level etc.) parameters can impose some levels of impairment on the perceived video quality. In a video ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 75-90, 2011</cite>]]></description></item><item><title>Geometrically invariant image watermarking using SVR correction in NSCT domain</title><link>http://academic.research.microsoft.com/Publication/49153714</link><pubDate>Thu, 23 May 2013 23:55:29 GMT</pubDate><guid isPermaLink="false">49153714</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/53662787">Hong-ying Yang</a>, <a href="http://academic.research.microsoft.com/Author/3461463">Xiang-yang Wang</a>, <a href="http://academic.research.microsoft.com/Author/23517104">Li-li Chen</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001042">view publication</a></span></p><p>Based on the support vector regression (SVR) geometric distortions correction, we propose a robust image watermarking algorithm in nonsubsampled contourlet transform (NSCT) domain with good visual quality and reasonable resistance toward geometric attacks in this paper. Firstly, the NSCT is performed on original host image, and corresponding low-pass subband is selected for embedding watermark. Then, the selected low-pass ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 695-713, 2011</cite>]]></description></item><item><title>A novel group key agreement protocol for wireless mesh network</title><link>http://academic.research.microsoft.com/Publication/39333121</link><pubDate>Thu, 23 May 2013 23:55:28 GMT</pubDate><guid isPermaLink="false">39333121</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/29204340">Ziyi You</a>, <a href="http://academic.research.microsoft.com/Author/3844277">Xiaoyao Xie</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000322">view publication</a></span></p><p>Group key agreement is the core of secure group communication. In wireless networks, the privacy problem becomes more crucial and urgent for mobile users due to the open nature of radio media. In this paper, we proposed a novel group key agreement protocol based on trusted third Party, applied in collaboration between mobile users for wireless Mesh network. The security ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 218-239, 2011</cite>]]></description></item><item><title>Multiscale texture classification and retrieval based on magnitude and phase features of complex wavelet subbands</title><link>http://academic.research.microsoft.com/Publication/49153713</link><pubDate>Thu, 23 May 2013 23:55:27 GMT</pubDate><guid isPermaLink="false">49153713</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/17995178">Turgay Çelik</a>, <a href="http://academic.research.microsoft.com/Author/260221">Tardi Tjahjadi</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001017">view publication</a></span></p><p>This paper proposes a multiscale texture classifier which uses features extracted from both magnitude and phase responses of subbands at different resolutions of the dual-tree complex wavelet transform decomposition of a texture image. The mean and entropy in the transform domain are used to form a feature vector. The proposed method can achieve a high texture classification rate even ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 729-743, 2011</cite>]]></description></item><item><title>Three-dimensional modular discriminant analysis (3DMDA): A new feature extraction approach for face recognition</title><link>http://academic.research.microsoft.com/Publication/49153720</link><pubDate>Thu, 23 May 2013 23:55:26 GMT</pubDate><guid isPermaLink="false">49153720</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/9435399">Mehran Safayani</a>, <a href="http://academic.research.microsoft.com/Author/1497540">Mohammad Taghi Manzuri Shalmani</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611001248">view publication</a></span></p><p>In this paper, we present a novel multilinear algebra based feature extraction approach for face recognition which preserves some implicit structural or locally-spatial information among elements of the original images. We call this method three-dimensional modular discriminant analysis (3DMDA). Our approach uses a new data model called third-order tensor model (3TM) for representing the face images. In ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 5, pp. 811-823, 2011</cite>]]></description></item><item><title>Efficient identity-based authenticated multiple key exchange protocol</title><link>http://academic.research.microsoft.com/Publication/39333101</link><pubDate>Thu, 23 May 2013 23:55:25 GMT</pubDate><guid isPermaLink="false">39333101</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1052689">Zuowen Tan</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000267">view publication</a></span></p><p /><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 2, pp. 191-198, 2011</cite>]]></description></item><item><title>Generalized reconstruction algorithm for compressed sensing</title><link>http://academic.research.microsoft.com/Publication/49153688</link><pubDate>Thu, 23 May 2013 23:55:24 GMT</pubDate><guid isPermaLink="false">49153688</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/53468425">J. Lei</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000450">view publication</a></span></p><p>Compressed sensing (CS) is considered as a promising signal processing technique, and successful applications of the CS theory depend mainly on the accuracy and speed of the reconstruction algorithms. In this paper, a generalized objective functional, which has been developed using the combinational estimation and an extended stabilizing functional, is proposed. An efficient iterative scheme, which integrates the beneficial advantages ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 570-588, 2011</cite>]]></description></item><item><title>Using evolutionary computation technique for trade-off between performance peak-to average power ration reduction and computational complexity in OFDM systems</title><link>http://academic.research.microsoft.com/Publication/39333104</link><pubDate>Thu, 23 May 2013 23:55:23 GMT</pubDate><guid isPermaLink="false">39333104</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3475713">Ho-Lung Hung</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000844">view publication</a></span></p><p>A low-complexity partial transmit sequence (PTS) technique for reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) system is presented. However, PTS technique requires an exhaustive search over all combinations of allowed phase weighting factors, and the search complexity increases exponentially with the number of sub-blocks in OFDM system. Hence, there has ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 1, pp. 57-70, 2011</cite>]]></description></item><item><title>Modified Generalized Autocorrelation based Estimator for time delays in multipath environment - A tradeoff in estimator performance and number of multipath</title><link>http://academic.research.microsoft.com/Publication/39333122</link><pubDate>Thu, 23 May 2013 23:55:22 GMT</pubDate><guid isPermaLink="false">39333122</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/26545">Ravinder Nath</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610001023">view publication</a></span></p><p>In this paper, the existing Generalized Autocorrelation based Estimator (GAE) has been modified for estimation of time delays in multipath environment in the presence of uncorrelated noise. Here the multipath propagation output signal is modeled as a superposition of the delayed, attenuated, and filtered versions of the stationary Gaussian stochastic input signal. Accuracy Percentage (AP) performance measure has been used ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 3, pp. 241-252, 2011</cite>]]></description></item><item><title>Optimal control of preemptive systems with loss</title><link>http://academic.research.microsoft.com/Publication/49153704</link><pubDate>Thu, 23 May 2013 23:55:21 GMT</pubDate><guid isPermaLink="false">49153704</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3528305">Glaucio H. S. Carvalho</a><span style="margin-left:20px" /><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790611000826">view publication</a></span></p><p>We consider the problem of optimal preemption control in preemptive systems with loss. Based on a designed cost function composed by the following criteria: blocking cost function, preemption cost function, degradation cost function, and processing and signaling load cost function; we use the semi-Markov decision process framework as well as the value iteration algorithm to get the optimal policies. ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 37, no. 4, pp. 417-424, 2011</cite>]]></description></item><item><title>Block-matching-based motion field generation utilizing directional edge displacement</title><link>http://academic.research.microsoft.com/Publication/4944696</link><pubDate>Thu, 23 May 2013 23:55:20 GMT</pubDate><guid isPermaLink="false">4944696</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/9146139">Hitoshi Hayakawa</a>, <a href="http://academic.research.microsoft.com/Author/221391">Tadashi Shibata</a><span style="margin-left:20px">(Citations:9)</span><span style="margin-left:20px"><a href="http://linkinghub.elsevier.com/retrieve/pii/S0045790608001146">view publication</a></span></p><p>Abstract—A motion field generation algorithm using block matching of edge-flag histograms has been developed aiming at its application to motion recognition systems. Use of edge flags instead of pixel intensities has made the algorithm robust against illumination changes. In order to detect local motions ofinterest effectively, a new adaptive frame interval adjustment scheme has been introduced in which ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 4, pp. 617-625, 2010</cite>]]></description></item><item><title>A network-based mobility management scheme for future Internet</title><link>http://academic.research.microsoft.com/Publication/13265783</link><pubDate>Thu, 23 May 2013 23:55:19 GMT</pubDate><guid isPermaLink="false">13265783</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/12800112">Ping Dong</a>, <a href="http://academic.research.microsoft.com/Author/3595620">Hongke Zhang</a>, <a href="http://academic.research.microsoft.com/Author/3624817">Hongbin Luo</a>, <a href="http://academic.research.microsoft.com/Author/50617126">Ting-Yun Chi</a>, <a href="http://academic.research.microsoft.com/Author/510847">Sy-Yen Kuo</a><span style="margin-left:20px">(Citations:8)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.03.007">view publication</a></span></p><p>The current Internet was originally designed for “fixed” terminals and can hardly support mobility. It is necessary to develop new mobility management schemes for the future Internet. This paper proposes an Identifiers Separating and Mapping Scheme (ISMS), which is a candidate for the future Internet mobility management, and discusses the basic principles and detailed message flow. ISMS is a network-...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 2, pp. 291-302, 2010</cite>]]></description></item><item><title>Enhancements of authenticated multiple key exchange protocol based on bilinear pairings</title><link>http://academic.research.microsoft.com/Publication/13265892</link><pubDate>Thu, 23 May 2013 23:55:18 GMT</pubDate><guid isPermaLink="false">13265892</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3512155">Duc-Liem Vo</a>, <a href="http://academic.research.microsoft.com/Author/1232057">Hyunrok Lee</a>, <a href="http://academic.research.microsoft.com/Author/12494771">Chan-Yeob Yeun</a>, <a href="http://academic.research.microsoft.com/Author/5782360">Kwangjo Kim</a><span style="margin-left:20px">(Citations:5)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.08.001">view publication</a></span></p><p>Lee et al. [4] proposed two new authenticated multiple key exchange protocols based on Elliptic Curve Cryptography (ECC) and bilinear pairings. In this paper, we show an impersonation attack on their pairing-based authenticated key exchange protocol. We demonstrate that any attacker can impersonate an entity to share multiple session keys with another entity of his/her choice by using ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 1, pp. 155-159, 2010</cite>]]></description></item><item><title>DMP-tree: A dynamic M-way prefix tree data structure for strings matching</title><link>http://academic.research.microsoft.com/Publication/14086998</link><pubDate>Thu, 23 May 2013 23:55:17 GMT</pubDate><guid isPermaLink="false">14086998</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1483333">Nasser Yazdani</a>, <a href="http://academic.research.microsoft.com/Author/394845">Hossein Mohammadi</a><span style="margin-left:20px">(Citations:4)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790608000414">view publication</a></span></p><p>We propose DMP-tree, a dynamic M-way prefix tree, data structure for the string matching problem in general and prefix matching in particular. DMP-tree has been initially devised for fast and efficiently handling prefix matching which constitutes the building block of some applications in the computer realm and related area. It is assumed there are strings of an ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 5, pp. 818-834, 2010</cite>]]></description></item><item><title>Routing with adaptive path and limited flooding for mobile ad hoc networks</title><link>http://academic.research.microsoft.com/Publication/13265695</link><pubDate>Thu, 23 May 2013 23:55:16 GMT</pubDate><guid isPermaLink="false">13265695</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/10639586">Yun-Sheng Yen</a>, <a href="http://academic.research.microsoft.com/Author/3480333">Hung-Chieh Chang</a>, <a href="http://academic.research.microsoft.com/Author/34537">Ruay-Shiung Chang</a>, <a href="http://academic.research.microsoft.com/Author/776545">Han-Chieh Chao</a><span style="margin-left:20px">(Citations:5)</span><span style="margin-left:20px"><a href="http://www.informatik.uni-trier.de/~ley/db/journals/cee/cee36.html#YenCCC10">view publication</a></span></p><p>In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this packet until it reaches the destination. It will have large flooding overhead, poor network performance and undesirable battery power consumption. ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 2, pp. 280-290, 2010</cite>]]></description></item><item><title>Spectrum sensing algorithms for primary detection based on reliability in cognitive radio systems</title><link>http://academic.research.microsoft.com/Publication/13265911</link><pubDate>Thu, 23 May 2013 23:55:15 GMT</pubDate><guid isPermaLink="false">13265911</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/7404013">Wenjing Yue</a>, <a href="http://academic.research.microsoft.com/Author/53698003">Baoyu Zheng</a><span style="margin-left:20px">(Citations:5)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.12.001">view publication</a></span></p><p>One of the main requirements of cognitive radio systems is the ability to detect the presence of the primary user with fast speed and high accuracy. To achieve that, in this paper, we propose a spectrum sensing scheme by considering the reliability of spectrum sensing. Only the user with no reliable information will perform spectrum sensing again using one-order ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 3, pp. 469-479, 2010</cite>]]></description></item><item><title>A distributed energy-efficient clustering protocol for wireless sensor networks</title><link>http://academic.research.microsoft.com/Publication/13265812</link><pubDate>Thu, 23 May 2013 23:55:14 GMT</pubDate><guid isPermaLink="false">13265812</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3683066">Ali Chamam</a>, <a href="http://academic.research.microsoft.com/Author/2537571">Samuel Pierre</a><span style="margin-left:20px">(Citations:5)</span><span style="margin-left:20px"><a href="http://www.informatik.uni-trier.de/~ley/db/journals/cee/cee36.html#ChamamP10">view publication</a></span></p><p>Minimizing energy dissipation and maximizing network lifetime are among the central concerns when designing applications and protocols for sensor networks. Clustering has been proven to be energy-efficient in sensor networks since data routing and relaying are only operated by cluster heads. Besides, cluster heads can process, filter and aggregate data sent by cluster members, thus reducing network load and ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 2, pp. 303-312, 2010</cite>]]></description></item><item><title>A grid-based dynamic load balancing approach for data-centric storage in wireless sensor networks</title><link>http://academic.research.microsoft.com/Publication/13265718</link><pubDate>Thu, 23 May 2013 23:55:13 GMT</pubDate><guid isPermaLink="false">13265718</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/1170435">Wen-Hwa Liao</a>, <a href="http://academic.research.microsoft.com/Author/724514">Kuei-Ping Shih</a>, <a href="http://academic.research.microsoft.com/Author/3630000">Wan-Chi Wu</a><span style="margin-left:20px">(Citations:4)</span><span style="margin-left:20px"><a href="http://www.informatik.uni-trier.de/~ley/db/journals/cee/cee36.html#LiaoSW10">view publication</a></span></p><p>In many data-centric storage techniques, each event corresponds to a hashing location by event type. However, most of them fail to deal with storage memory space due to high percentage of the load is assigned to a relatively small portion of the sensor nodes. Hence, these nodes may fail to deal with the storage of the sensor nodes effectively. ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 1, pp. 19-30, 2010</cite>]]></description></item><item><title>An analytical evaluation of mobility management in integrated WLAN-UMTS networks</title><link>http://academic.research.microsoft.com/Publication/14087150</link><pubDate>Thu, 23 May 2013 23:55:12 GMT</pubDate><guid isPermaLink="false">14087150</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3570158">Kumudu S. Munasinghe</a>, <a href="http://academic.research.microsoft.com/Author/1949782">Abbas Jamalipour</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790608001195">view publication</a></span></p><p>Ensuring uninterrupted service continuity for handoff calls in an all-IP inter-networked heterogeneous environment requires successful session management among participating access networks. As such, a mobility-aware novel interworking architecture is presented in this article that facilitates session management including session establishment and seamless session handoff across different networks. This framework conveniently enables any 3G cellular technology such as ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 4, pp. 735-751, 2010</cite>]]></description></item><item><title>Infrared small target enhancement and detection based on modified top-hat transformations</title><link>http://academic.research.microsoft.com/Publication/14086995</link><pubDate>Thu, 23 May 2013 23:55:11 GMT</pubDate><guid isPermaLink="false">14086995</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/10248825">Xiangzhi Bai</a>, <a href="http://academic.research.microsoft.com/Author/3568994">Fugen Zhou</a><span style="margin-left:20px">(Citations:4)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S004579061000056X">view publication</a></span></p><p>To simply and efficiently enhance and detect infrared small target, a new algorithm through target enhancement by using modified top-hat transformations is proposed. Firstly, the modified top-hat transformations following the property of small target region are discussed, which could efficiently extract the possible target and dark regions. Secondly, the potential target regions are enhanced by using a target ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 6, pp. 1193-1201, 2010</cite>]]></description></item><item><title>A PSO-based weighting method for linear combination of neural networks</title><link>http://academic.research.microsoft.com/Publication/14087009</link><pubDate>Thu, 23 May 2013 23:55:10 GMT</pubDate><guid isPermaLink="false">14087009</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/11828090">S. H. Nabavi-Kerizi</a>, <a href="http://academic.research.microsoft.com/Author/3659504">Mohammad Shams Esfand Abadi</a>, <a href="http://academic.research.microsoft.com/Author/3520184">Ehsanollah Kabir</a><span style="margin-left:20px">(Citations:5)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790608000463">view publication</a></span></p><p>This paper presents a new way of computing the weights for combining multiple neural network classifiers based on particle swarm optimization, PSO. The weights are obtained so that they minimize the total classification error rate of the ensemble system. In order to evaluate the effectiveness of the proposed method, we have carried out some experiments on three data sets: 2-...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 5, pp. 886-894, 2010</cite>]]></description></item><item><title>Invariant image watermarking using multi-scale Harris detector and wavelet moments</title><link>http://academic.research.microsoft.com/Publication/13265919</link><pubDate>Thu, 23 May 2013 23:55:09 GMT</pubDate><guid isPermaLink="false">13265919</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3461463">Xiang-Yang Wang</a>, <a href="http://academic.research.microsoft.com/Author/3382803">Yi-Ping Yang</a>, <a href="http://academic.research.microsoft.com/Author/53662787">Hong-Ying Yang</a><span style="margin-left:20px">(Citations:4)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.04.005">view publication</a></span></p><p>Desynchronization attack is known as one of the most difficult attacks to resist, which can desynchronize the location of the watermark and hence causes incorrect watermark detection. It is a challenging work to design a robust image watermarking scheme against desynchronization attacks. Based on multi-scale Harris detector and wavelet moment theory, we propose a new content based image watermarking ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 1, pp. 31-44, 2010</cite>]]></description></item><item><title>FPGA and ASIC implementations of the etaT pairing in characteristic three</title><link>http://academic.research.microsoft.com/Publication/13265747</link><pubDate>Thu, 23 May 2013 23:55:08 GMT</pubDate><guid isPermaLink="false">13265747</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/101590">Jean-Luc Beuchat</a>, <a href="http://academic.research.microsoft.com/Author/37157948">Hiroshi Doi</a>, <a href="http://academic.research.microsoft.com/Author/55962442">Kaoru Fujita</a>, <a href="http://academic.research.microsoft.com/Author/775682">Atsuo Inomata</a>, <a href="http://academic.research.microsoft.com/Author/4477962">Piseth Ith</a>, <a href="http://academic.research.microsoft.com/Author/3378708">Akira Kanaoka</a>, <a href="http://academic.research.microsoft.com/Author/4477963">Masayoshi Katouno</a>, <a href="http://academic.research.microsoft.com/Author/7020">Masahiro Mambo</a>, <a href="http://academic.research.microsoft.com/Author/100553">Eiji Okamoto</a>, <a href="http://academic.research.microsoft.com/Author/47397083">Takeshi Okamoto</a>, <a href="http://academic.research.microsoft.com/Author/4477964">Takaaki Shiga</a>, <a href="http://academic.research.microsoft.com/Author/543738">Masaaki Shirase</a>, <a href="http://academic.research.microsoft.com/Author/4477965">Ryuji Soga</a>, <a href="http://academic.research.microsoft.com/Author/1866867">Tsuyoshi Takagi</a>, <a href="http://academic.research.microsoft.com/Author/9266920">Ananda Vithanage</a>, <a href="http://academic.research.microsoft.com/Author/18187349">Hiroyasu Yamamoto</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S004579060900069X">view publication</a></span></p><p>Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. As they rely critically on efficient implementations of pairing primitives, the study of hardware accelerators has become an active research area.In this paper, we propose two coprocessors for the reduced ηT pairing introduced by Barreto et ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 1, pp. 73-87, 2010</cite>]]></description></item><item><title>A novel terminal-controlled handover scheme in heterogeneous wireless networks</title><link>http://academic.research.microsoft.com/Publication/13265727</link><pubDate>Thu, 23 May 2013 23:55:07 GMT</pubDate><guid isPermaLink="false">13265727</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/24362475">Haibo Xu</a>, <a href="http://academic.research.microsoft.com/Author/564441">Hui Tian</a>, <a href="http://academic.research.microsoft.com/Author/50090242">Ping Zhang</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://www.informatik.uni-trier.de/~ley/db/journals/cee/cee36.html#XuTZ10">view publication</a></span></p><p>In the next generation heterogeneous wireless networks, a mobile terminal (MT) with a multi-interface may have network access from different service providers using various technologies. In spite of this heterogeneity, seamless intersystem mobility is a mandatory requirement. One of the major challenges for seamless mobility is the creation of a vertical handover scheme, which is for users that move ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 2, pp. 269-279, 2010</cite>]]></description></item><item><title>Scalability of MANET routing protocols for heterogeneous and homogenous networks</title><link>http://academic.research.microsoft.com/Publication/4946191</link><pubDate>Thu, 23 May 2013 23:55:06 GMT</pubDate><guid isPermaLink="false">4946191</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/6203463">Huda AlAmri</a>, <a href="http://academic.research.microsoft.com/Author/3342517">Mehran Abolhasan</a>, <a href="http://academic.research.microsoft.com/Author/190364">Tadeusz A. Wysocki</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://users.rsise.anu.edu.au/~ramtin/ICSPCS/ICSPCS%2707/papers/204.pdf">view publication</a></span></p><p>In Mobile Ad hoc Network (MANET), mobility, traffic and node density are main network conditions that significantly affect the performance of routing protocols. Much of the previous researches in MANET routing have focused on developing strategies, which suit one specific networking scenario. Therefore, there is no existing protocol that can work well in all different networking scenarios. This paper reviews ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 4, pp. 752-765, 2010</cite>]]></description></item><item><title>Enhancement of two-factor authenticated key exchange protocols in public wireless LANs</title><link>http://academic.research.microsoft.com/Publication/13265715</link><pubDate>Thu, 23 May 2013 23:55:05 GMT</pubDate><guid isPermaLink="false">13265715</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3401450">Yunho Lee</a>, <a href="http://academic.research.microsoft.com/Author/636453">Seungjoo Kim</a>, <a href="http://academic.research.microsoft.com/Author/918501">Dongho Won</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.08.007">view publication</a></span></p><p>In 2008, Juang and Wu proposed two authenticated key exchange protocols by improving Park and Park’s two-factor authenticated key exchange protocol in public wireless LANs. They pointed out that Park’s protocol was vulnerable to the dictionary attack on the identity protection. The improved protocols requires fewer exchanged messages and provided more secure protection for the client’s identity. In this ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 1, pp. 213-223, 2010</cite>]]></description></item><item><title>Semantic web service composition testbed</title><link>http://academic.research.microsoft.com/Publication/14087137</link><pubDate>Thu, 23 May 2013 23:55:04 GMT</pubDate><guid isPermaLink="false">14087137</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3587155">Soheil Hassas Yeganeh</a>, <a href="http://academic.research.microsoft.com/Author/116912">Jafar Habibi</a>, <a href="http://academic.research.microsoft.com/Author/3511105">Habib Rostami</a>, <a href="http://academic.research.microsoft.com/Author/3377482">Hassan Abolhassani</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790608000402">view publication</a></span></p><p>A huge amount of web services are deployed on the Web, nowadays. These services can be used to fulfill online requests. Requests are getting more and more complicated over time. So, there exists a lot of frequent request that cannot be fulfilled using just one web service. For using web services, composing individual services to create the added-value composite ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 5, pp. 805-817, 2010</cite>]]></description></item><item><title>Feature based robust watermarking using image normalization</title><link>http://academic.research.microsoft.com/Publication/13265899</link><pubDate>Thu, 23 May 2013 23:55:03 GMT</pubDate><guid isPermaLink="false">13265899</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/47555415">Wei Lu</a>, <a href="http://academic.research.microsoft.com/Author/165695">Hongtao Lu</a>, <a href="http://academic.research.microsoft.com/Author/146651">Fu-Lai Chung</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.04.002">view publication</a></span></p><p>This paper presents a robust watermarking scheme based on feature point detection and image normalization. Firstly some stable feature points are detected from the original image using the proposed multiresolution feature point detection filter. Then, image normalization is applied to the disks centered at these feature points. The watermark is embedded in the subband coefficients of DFT domain of each ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 1, pp. 2-18, 2010</cite>]]></description></item><item><title>Forgery attacks on Kang et al.'s identity-based strong designated verifier signature scheme and its improvement with security proof</title><link>http://academic.research.microsoft.com/Publication/14087143</link><pubDate>Thu, 23 May 2013 23:55:02 GMT</pubDate><guid isPermaLink="false">14087143</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3577743">Ji-Seon Lee</a>, <a href="http://academic.research.microsoft.com/Author/55000849">Jik Hyun Chang</a>, <a href="http://academic.research.microsoft.com/Author/1663125">Dong Hoon Lee</a><span style="margin-left:20px">(Citations:2)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000145">view publication</a></span></p><p>Recently, Kang et al. proposed a new identity-based strong designated verifier signature scheme (ID-SDVS) and identity-based designated verifier proxy signature scheme (ID-DVPS). They claimed that their schemes are unforgeable. However, we found out that their schemes are universally forgeable in the sense that anyone can forge valid ID-SDVS and ID-DVPS on an arbitrary message ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 5, pp. 948-954, 2010</cite>]]></description></item><item><title>Efficient hardware architecture for the AES-CCM protocol of the IEEE 802.11i standard</title><link>http://academic.research.microsoft.com/Publication/13265914</link><pubDate>Thu, 23 May 2013 23:55:01 GMT</pubDate><guid isPermaLink="false">13265914</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3552970">Ignacio Algredo-Badillo</a>, <a href="http://academic.research.microsoft.com/Author/53659044">Claudia Feregrino-Uribe</a>, <a href="http://academic.research.microsoft.com/Author/3496210">René Cumplido</a>, <a href="http://academic.research.microsoft.com/Author/3522625">Miguel Morales-Sandoval</a><span style="margin-left:20px">(Citations:2)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.12.011">view publication</a></span></p><p>Applications of wireless communications networks are emerging continuously. To offer a good level of security in these applications, new standards for wireless communications propose solutions based on cryptographic algorithms working on special modes of operation. This work presents a custom hardware architecture for the AES-CCM Protocol (AES-CCMP) which is the basis for the security architecture of the IEEE ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 3, pp. 565-577, 2010</cite>]]></description></item><item><title>Emerging cognitive radio technology: Principles, challenges and opportunities</title><link>http://academic.research.microsoft.com/Publication/13265780</link><pubDate>Thu, 23 May 2013 23:55:00 GMT</pubDate><guid isPermaLink="false">13265780</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3648729">Lamiaa Khalid</a>, <a href="http://academic.research.microsoft.com/Author/1730001">Alagan Anpalagan</a><span style="margin-left:20px">(Citations:3)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.03.004">view publication</a></span></p><p>Due to the increasing demand for new wireless services and applications as well as the increasing number of wireless users, the available spectrum is becoming increasingly scarce. As a result, the federal communications commission (FCC) has been investigating new ways to manage the radio frequency resources. Cognitive radio (CR) technology is an innovative radio design philosophy which aims to increase ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 2, pp. 358-366, 2010</cite>]]></description></item><item><title>Using honeynodes for defense against jamming attacks in wireless infrastructure-based networks</title><link>http://academic.research.microsoft.com/Publication/13265711</link><pubDate>Thu, 23 May 2013 23:54:59 GMT</pubDate><guid isPermaLink="false">13265711</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3200149">Sudip Misra</a>, <a href="http://academic.research.microsoft.com/Author/3506749">Sanjay Kumar Dhurandher</a>, <a href="http://academic.research.microsoft.com/Author/9421427">Avanish Rayankula</a>, <a href="http://academic.research.microsoft.com/Author/55300249">Deepansh Agrawal</a><span style="margin-left:20px">(Citations:2)</span><span style="margin-left:20px"><a href="http://www.informatik.uni-trier.de/~ley/db/journals/cee/cee36.html#MisraDRA10">view publication</a></span></p><p>The advent of wireless networks has brought a new set of security issues with it. One of the most feared of these is the jamming-based attacks. In this paper, we propose a pre-emptive detection strategy using honeynodes and a response mechanism based on the existing Channel Surfing Algorithm [Xu W, Trappe W, Zhang Y, Wood T. Channel surfing ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 2, pp. 367-382, 2010</cite>]]></description></item><item><title>Small target detection using cross product based on temporal profile in infrared image sequences</title><link>http://academic.research.microsoft.com/Publication/14087135</link><pubDate>Thu, 23 May 2013 23:54:58 GMT</pubDate><guid isPermaLink="false">14087135</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3510055">Tae-Wuk Bae</a>, <a href="http://academic.research.microsoft.com/Author/3838691">Byoung-Ik Kim</a>, <a href="http://academic.research.microsoft.com/Author/2571876">Young-Choon Kim</a>, <a href="http://academic.research.microsoft.com/Author/3378168">Kyu-Ik Sohng</a><span style="margin-left:20px">(Citations:1)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000522">view publication</a></span></p><p>This paper presents a new small target detection method using cross product of temporal pixels based on temporal profiles in infrared (IR) image sequences. Temporal characteristics of small targets and various backgrounds are different. A new algorithm classifies target pixels and background pixels through hypothesis testing using the cross product of pixels on temporal profile and predicts the temporal backgrounds ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 6, pp. 1156-1164, 2010</cite>]]></description></item><item><title>Efficient bit-parallel multipliers over finite fields GF(2m)</title><link>http://academic.research.microsoft.com/Publication/14087007</link><pubDate>Thu, 23 May 2013 23:54:57 GMT</pubDate><guid isPermaLink="false">14087007</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/3413683">Chiou-Yng Lee</a>, <a href="http://academic.research.microsoft.com/Author/3369855">Pramod Kumar Meher</a><span style="margin-left:20px">(Citations:2)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790610000157">view publication</a></span></p><p>Hardware implementation of multiplication in finite field GF(2m) based on sparse polynomials is found to be advantageous in terms of space-complexity as well as the time-complexity. In this paper, we present a new permutation method to construct the irreducible like-trinomials of the form (x+1)m+(x+1)n+1 for the implementation of efficient bit-parallel multipliers. For ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 5, pp. 955-968, 2010</cite>]]></description></item><item><title>An improved semantically-secure identity-based signcryption scheme in the standard model</title><link>http://academic.research.microsoft.com/Publication/13265804</link><pubDate>Thu, 23 May 2013 23:54:56 GMT</pubDate><guid isPermaLink="false">13265804</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/6153955">Zhengping Jin</a>, <a href="http://academic.research.microsoft.com/Author/8825088">Qiaoyan Wen</a>, <a href="http://academic.research.microsoft.com/Author/3824001">Hongzhen Du</a><span style="margin-left:20px">(Citations:2)</span><span style="margin-left:20px"><a href="http://dx.doi.org/10.1016/j.compeleceng.2009.12.009">view publication</a></span></p><p>Recently, Yu et al. proposed the first identity-based signcryption scheme without random oracles and proved it was semantically secure in the standard model. However, in this paper we find that their scheme actually does not reach the semantic security as they claimed. To make up for this defect, we propose a rescue scheme and show our improvement is really ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 3, pp. 545-552, 2010</cite>]]></description></item><item><title>Resource-aware and quality-fair video-streaming using multiple adaptive TCP connections</title><link>http://academic.research.microsoft.com/Publication/14086997</link><pubDate>Thu, 23 May 2013 23:54:55 GMT</pubDate><guid isPermaLink="false">14086997</guid><description><![CDATA[<p><a href="http://academic.research.microsoft.com/Author/10516069">Young H. Jung</a>, <a href="http://academic.research.microsoft.com/Author/2171179">Yoonsik Choe</a><span style="margin-left:20px">(Citations:2)</span><span style="margin-left:20px"><a href="http://www.sciencedirect.com/science/article/pii/S0045790608001201">view publication</a></span></p><p>In this paper, we present a resource-aware and quality-fair video content sharing system. When a video sharing server has insufficient uplink bandwidth and needs to serve multiple video content sharing services via streaming or downloading to other client peers using TCP transport, each service shares the limited uplink bandwidth equitably, due to the fair sharing characteristics inherent in ...</p><cite></cite><cite>Journal: <a href="http://academic.research.microsoft.com/Journal/814">Computers & Electrical Engineering - CEE</a>, vol. 36, no. 4, pp. 702-717, 2010</cite>]]></description></item></channel></rss>