<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet href="/rss.css" type="text/css"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
    xmlns:cc="http://web.resource.org/cc/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:extra="http://www.w3.org/1999/xhtml"
    xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
    <channel rdf:about="http://www.springeropen.com/feeds/latestarticles/portal?portalId=9014&amp;quantity=&amp;format=rss&amp;version=">
        <title>Springer Open - Latest Articles</title>
        <link>http://www.springeropen.com/</link>
        <description>The latest research articles published by Springer Open</description>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <items>
            <rdf:Seq>
                                <rdf:li rdf:resource="http://www.fixedpointtheoryandapplications.com/content/2012/1/21" />
                                <rdf:li rdf:resource="http://www.fixedpointtheoryandapplications.com/content/2012/1/22" />
                                <rdf:li rdf:resource="http://www.nanoscalereslett.com/content/7/1/150" />
                                <rdf:li rdf:resource="http://jwcn.eurasipjournals.com/content/2012/1/56" />
                                <rdf:li rdf:resource="http://www.fixedpointtheoryandapplications.com/content/2012/1/24" />
                                <rdf:li rdf:resource="http://www.fixedpointtheoryandapplications.com/content/2012/1/23" />
                                <rdf:li rdf:resource="http://asp.eurasipjournals.com/content/2012/1/44" />
                                <rdf:li rdf:resource="http://asp.eurasipjournals.com/content/2012/1/43" />
                                <rdf:li rdf:resource="http://jwcn.eurasipjournals.com/content/2012/1/57" />
                                <rdf:li rdf:resource="http://asp.eurasipjournals.com/content/2012/1/41" />
                            </rdf:Seq>
        </items>
                 <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </channel>
        <item rdf:about="http://www.fixedpointtheoryandapplications.com/content/2012/1/21">
        <title>Iterative algorithms for common elements in fixed point sets and zero point sets with applications</title>
        <description>In this study, Mann-type iterative process is considered for finding a common element in the fixed point set of strict pseudocontractions and in the zero point set of the operator which is the sum of inverse strongly-monotone operators and maximal monotone operators. Weak convergence theorems of common elements are established in the framework of Hilbert spaces. Some applications of main results are also provided.</description>
        <link>http://www.fixedpointtheoryandapplications.com/content/2012/1/21</link>
                <dc:creator>Mingliang Zhang</dc:creator>
                <dc:source>Fixed Point Theory and Applications 2012, 2012:21</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-1812-2012-21-toc.gif</prism:require>
                <prism:publicationName>Fixed Point Theory and Applications</prism:publicationName>
        <prism:issn>1687-1812</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>21</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.fixedpointtheoryandapplications.com/content/2012/1/22">
        <title>Hybrid iteration method for common fixed points of an infinite family of nonexpansive mappings in Banach spaces</title>
        <description>Let E be a real uniformly convex Banach space and, and let K be anonempty closed convex subset of E. Let \{T_i\}_{i=1}^{\infty}  be a sequence of nonexpansive mappings from K to itself with F:=\{x\in K:T_ix=x,\forall i\geq1\}\neq\emptyset. For an arbitrary initial point x_1\in K, the modified hybrid iteration scheme \{x_n\}is defined as follows:x_{n+1}=\alpha_nx_n+(1-\alpha_n)(T^*_nx_n-\lambda_{n+1}\mu A(T^*_nx_n)), n\geq1,where A:K\rightarrow K is an L-Lipschitzian mapping, T^*_n=T_i with i satisfying:n=[(k-i+1)(i+k)/2]+[1+(i-1)(i+2)/2],k\geq i-1(i = 1, 2, \ldots),\{\lambda_n\}\subset[0, 1), and \{\alpha_n\} is a sequence in [a, 1-a] for some a \in (0, 1). Under some suitable conditions, the strong and weak convergence theorems of \{x_n\} to a common fixed point of the nonexpansive mappings \{T_i\}_{i=1}^{\infty} are obtained. The results in this article extend those of the authors whose related researches are restricted to the situation of finite families of nonexpansive mappings.Keywordsinfinite family of nonexpansive mappings; strong and weak convergence; common fixed point; hybrid iteration.</description>
        <link>http://www.fixedpointtheoryandapplications.com/content/2012/1/22</link>
                <dc:creator>Wei-Qi Deng</dc:creator>
                <dc:source>Fixed Point Theory and Applications 2012, 2012:22</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-1812-2012-22-toc.gif</prism:require>
                <prism:publicationName>Fixed Point Theory and Applications</prism:publicationName>
        <prism:issn>1687-1812</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>22</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.nanoscalereslett.com/content/7/1/150">
        <title>Nanoscale anisotropic plastic deformation in single crystal GaN
</title>
        <description>Elasto-plastic mechanical deformation behaviors of c-plane (0001) and nonpolar GaN single crystals are studied using nanoindentation, cathodoluminescence, and transmission electron microscopy. Nanoindentation tests show that c-plane GaN is less susceptible to plastic deformation and has higher hardness and Young&apos;s modulus than the nonpolar GaN. Cathodoluminescence and transmission electron microscopy characterizations of indent-induced plastic deformation reveal that there are two primary slip systems for the c-plane GaN, while there is only one most favorable slip system for the nonplane GaN. We suggest that the anisotropic elasto-plastic mechanical properties of GaN are relative to its anisotropic plastic deformation behavior.</description>
        <link>http://www.nanoscalereslett.com/content/7/1/150</link>
                <dc:creator>Jun Huang</dc:creator>
                <dc:creator>Ke Xu</dc:creator>
                <dc:creator>Ying Min Fan</dc:creator>
                <dc:creator>Mu Tong Niu</dc:creator>
                <dc:creator>Xiong Hui Zeng</dc:creator>
                <dc:creator>Jian Feng Wang</dc:creator>
                <dc:creator>Hui Yang</dc:creator>
                <dc:source>Nanoscale Research Letters 2012, 7:150</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1556-276X-7-150-toc.gif</prism:require>
                <prism:publicationName>Nanoscale Research Letters</prism:publicationName>
        <prism:issn>1556-276X</prism:issn>
        <prism:volume>7</prism:volume>
        <prism:startingPage>150</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://jwcn.eurasipjournals.com/content/2012/1/56">
        <title>Evaluation of topological planarity and reliability for interference reduction in radio sensor networks</title>
        <description>One of the key factors in distributed sensor networks is their reliability in packets delivery even in the event of failure of one or a few nodes. Another factor - often underestimated - is the intra-network interference experienced by individual nodes from other transmitting counterparts. Common network spanning algorithms, however, neither posses the reliability feature nor keep the interference at minimum. It can be demonstrated that by enforcing a planar network topology combined with the requirement of minimum-pathloss between connections, one can achieve a gain in SNIR by a few decibels with respect to standards spanning methods. The use of directional antennas and controlled duty cycle improves the situation even further - by carefully controlling the beamwidth, one may adjust the SNIR to a desired level at a high range of dynamics.</description>
        <link>http://jwcn.eurasipjournals.com/content/2012/1/56</link>
                <dc:creator>Kamil Staniec</dc:creator>
                <dc:creator>Grzegorz Debita</dc:creator>
                <dc:source>EURASIP Journal on Wireless Communications and Networking 2012, 2012:56</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-1499-2012-56-toc.gif</prism:require>
                <prism:publicationName>EURASIP Journal on Wireless Communications and Networking</prism:publicationName>
        <prism:issn>1687-1499</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>56</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.fixedpointtheoryandapplications.com/content/2012/1/24">
        <title>Large strong convergence theorems for total asymptotically strict pseudocontractive semigroup in banach spaces</title>
        <description>The purpose of this is to introduce and study total asymptotically strict pseudocontractive semigroup, asymptotically strict pseudocontractive semigroup etc. the strong convergence theorems of the explicit iteration process for the new semigroups in arbitrary Banach spaces are established. The results presented in the paper extend and improve some recent results announced by many authors.</description>
        <link>http://www.fixedpointtheoryandapplications.com/content/2012/1/24</link>
                <dc:creator>Li Yang</dc:creator>
                <dc:creator>Fu Hai Zhao</dc:creator>
                <dc:source>Fixed Point Theory and Applications 2012, 2012:24</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-1812-2012-24-toc.gif</prism:require>
                <prism:publicationName>Fixed Point Theory and Applications</prism:publicationName>
        <prism:issn>1687-1812</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>24</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://www.fixedpointtheoryandapplications.com/content/2012/1/23">
        <title>The multi-valued domination of metric spaces</title>
        <description>In this article, we introduce the notion of multi-valued domination of metric spaces, which is a generalization of domination in the sense of Borsuk and which encompasses previous generalizations.</description>
        <link>http://www.fixedpointtheoryandapplications.com/content/2012/1/23</link>
                <dc:creator>Miroslaw Slosarski</dc:creator>
                <dc:source>Fixed Point Theory and Applications 2012, 2012:23</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-1812-2012-23-toc.gif</prism:require>
                <prism:publicationName>Fixed Point Theory and Applications</prism:publicationName>
        <prism:issn>1687-1812</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>23</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://asp.eurasipjournals.com/content/2012/1/44">
        <title>A unified approach to sparse signal processing</title>
        <description>A unified view of the area of sparse signal processing is presented in tutorial form by bringing together various fields in which the property of sparsity has been successfully exploited. For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly. The common potential benefits of significant reduction in sampling rate and processing manipulations through sparse signal processing are revealed. The key application domains of sparse signal processing are sampling, coding, spectral estimation, array processing, component analysis, and multipath channel estimation. In terms of the sampling process and reconstruction algorithms, linkages are made with random sampling, compressed sensing, and rate of innovation. The redundancy introduced by channel coding in finite and real Galois fields is then related to over-sampling with similar reconstruction algorithms. The error locator polynomial (ELP) and iterative methods are shown to work quite effectively for both sampling and coding applications. The methods of Prony, Pisarenko, and MUltiple SIgnal Classification (MUSIC) are next shown to be targeted at analyzing signals with sparse frequency domain representations. Specifically, the relations of the approach of Prony to an annihilating filter in rate of innovation and ELP in coding are emphasized; the Pisarenko and MUSIC methods are further improvements of the Prony method under noisy environments. The iterative methods developed for sampling and coding applications are shown to be powerful tools in spectral estimation. Such narrowband spectral estimation is then related to multi-source location and direction of arrival estimation in array processing. Sparsity in unobservable source signals is also shown to facilitate source separation in sparse component analysis; the algorithms developed in this area such as linear programming and matching pursuit are also widely used in compressed sensing. Finally, the multipath channel estimation problem is shown to have a sparse formulation; algorithms similar to sampling and coding are used to estimate typical multicarrier communication channels.</description>
        <link>http://asp.eurasipjournals.com/content/2012/1/44</link>
                <dc:creator>Farokh Marvasti</dc:creator>
                <dc:creator>Arash Amini</dc:creator>
                <dc:creator>Farzan Haddadi</dc:creator>
                <dc:creator>Mehdi Soltanolkotabi</dc:creator>
                <dc:creator>Babak Khalaj</dc:creator>
                <dc:creator>Akram Aldroubi</dc:creator>
                <dc:creator>Saeid Sanei</dc:creator>
                <dc:creator>Jonathon Chambers</dc:creator>
                <dc:source>EURASIP Journal on Advances in Signal Processing 2012, 2012:44</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-6180-2012-44-toc.gif</prism:require>
                <prism:publicationName>EURASIP Journal on Advances in Signal Processing</prism:publicationName>
        <prism:issn>1687-6180</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>44</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://asp.eurasipjournals.com/content/2012/1/43">
        <title>An efficient joint estimation of wideband polynomial-phase signal parameters and direction-of-arrival in sensor array</title>
        <description>We consider the joint estimation of the direction-of-arrival (DOA) and parameters of wideband polynomial-phase signals (PPSs) in sensor array. Unlike concurrent methods that require multidimensional searches, the proposed method requires 1D searches for all the parameters of interest. In this way, we can efficiently estimate the considered parameters in applications where large antenna arrays, containing tens or hundreds of sensors, are used. As special cases, we consider in detail the estimation of the second- and third-order PPSs. The former are estimated using the high-order ambiguity function (HAF), while the latter are estimated using the cubic phase function (CPF), known to outperform the HAF in terms of both accuracy and signal-to-noise ratio (SNR) threshold. In both cases, the estimation of the highest order parameter reaches the Cramer-Rao lower bound (CRLB), while the DOA estimation is above the CRLB for around 1 dB (second-order PPS) and around 6 dB (third-order PPS).</description>
        <link>http://asp.eurasipjournals.com/content/2012/1/43</link>
                <dc:creator>Igor Djurovic</dc:creator>
                <dc:creator>Slobodan Djukanovic</dc:creator>
                <dc:creator>Marko Simeunovic</dc:creator>
                <dc:creator>Predrag Rakovic</dc:creator>
                <dc:creator>Braham Barkat</dc:creator>
                <dc:source>EURASIP Journal on Advances in Signal Processing 2012, 2012:43</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-6180-2012-43-toc.gif</prism:require>
                <prism:publicationName>EURASIP Journal on Advances in Signal Processing</prism:publicationName>
        <prism:issn>1687-6180</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>43</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://jwcn.eurasipjournals.com/content/2012/1/57">
        <title>A formally verified AKA protocol for vertical handover in heterogeneous environments using Casper/FDR</title>
        <description>Next Generation Networks will comprise dif-ferent wireless networks including cellular technologies,WLAN and indoor technologies. To support these het-erogeneous environments, there is a need to considera new design of the network infrastructure, where cur-rently closed systems such as 3G will have to operatein an open environment. Furthermore, this open en-vironment implies that future mobile devices need toroam between different networks using vertical han-dover techniques. When a mobile user moves into anew foreign network, data confidentiality and mutualauthentication between the user and the network arevital issues in this heterogeneous environment. This pa-per deals with these issues by first examining the im-plication of moving towards an open architecture, andthen looking at how current approaches such as the 3GPP, HOKEY and Mobile Ethernet respond to thenew environment while trying to address the securityissue. The results indicate that a new Authenticationand Key Agreement protocol is required to secure han-dover in this environment. Casper/FDR, is used in theanalysis and development of the protocol. The proposedprotocol has been proven to be successful in this het-erogeneous environment.</description>
        <link>http://jwcn.eurasipjournals.com/content/2012/1/57</link>
                <dc:creator>Mahdi Aiash</dc:creator>
                <dc:creator>Glenford Mapp</dc:creator>
                <dc:creator>Aboubaker Lasebae</dc:creator>
                <dc:creator>Raphael Phan</dc:creator>
                <dc:creator>Jonathan Loo</dc:creator>
                <dc:source>EURASIP Journal on Wireless Communications and Networking 2012, 2012:57</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-1499-2012-57-toc.gif</prism:require>
                <prism:publicationName>EURASIP Journal on Wireless Communications and Networking</prism:publicationName>
        <prism:issn>1687-1499</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>57</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <item rdf:about="http://asp.eurasipjournals.com/content/2012/1/41">
        <title>Cooperative MIMO multicell networks</title>
        <description>(no abstract)</description>
        <link>http://asp.eurasipjournals.com/content/2012/1/41</link>
                <dc:creator>Francesco Verde</dc:creator>
                <dc:creator>Yao-Win Peter Hong</dc:creator>
                <dc:creator>Dragan Samardzija</dc:creator>
                <dc:creator>Robert Schober</dc:creator>
                <dc:creator>Zhifeng Tao</dc:creator>
                <dc:source>EURASIP Journal on Advances in Signal Processing 2012, 2012:41</dc:source>
        <dc:date>2012-02-22T00:00:00Z</dc:date>
        <dc:identifier>${item.identifier}</dc:identifier>
                                <prism:require>/content/figures/1687-6180-2012-41-toc.gif</prism:require>
                <prism:publicationName>EURASIP Journal on Advances in Signal Processing</prism:publicationName>
        <prism:issn>1687-6180</prism:issn>
        <prism:volume>2012</prism:volume>
        <prism:startingPage>41</prism:startingPage>
        <prism:publicationDate>2012-02-22T00:00:00Z</prism:publicationDate>
                <prism:versionidentifier>PDF</prism:versionidentifier>
                <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
    </item>
        <cc:License rdf:about="http://creativecommons.org/licenses/by/2.0/">
        <cc:permits rdf:resource="http://creativecommons.org/ns#Reproduction" />
        <cc:permits rdf:resource="http://creativecommons.org/ns#Distribution" />
        <cc:permits rdf:resource="http://creativecommons.org/ns#DerivativeWorks" />
    </cc:License>
</rdf:RDF>

