<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://onlinelibrary.wiley.com/rss/journal/10.1111/(ISSN)1468-0394" xmlns="http://purl.org/rss/1.0/"><title>Expert Systems</title><description> Wiley Online Library : Expert Systems</description><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2F%28ISSN%291468-0394</link><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc</dc:publisher><dc:language xmlns:dc="http://purl.org/dc/elements/1.1/">en</dc:language><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/">© Blackwell Publishing Ltd</dc:rights><prism:issn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">0266-4720</prism:issn><prism:eIssn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">1468-0394</prism:eIssn><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-01T00:00:00-05:00</dc:date><prism:coverDisplayDate xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">May 2013</prism:coverDisplayDate><prism:volume xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">30</prism:volume><prism:number xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">2</prism:number><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">99</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">182</prism:endingPage><image rdf:resource="http://onlinelibrary.wiley.com/store/10.1111/exsy.2013.30.issue-2/asset/cover.gif?v=1&amp;s=fabe81ddfdf38abe1f25e52f17af680161ea6583"/><items><rdf:Seq><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12027"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12029"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12022"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12026"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12030"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12023"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12028"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12017"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12020"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12021"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12018"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12014"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12019"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12015"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12011"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12013"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12009"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12006"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12008"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12005"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12004"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12003"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00634.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12002"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00652.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00640.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00648.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12000"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00651.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00649.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00654.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00645.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00631.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00641.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00642.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00653.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00650.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00647.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00643.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00644.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00646.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00632.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00635.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00639.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00636.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00637.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00638.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00629.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00608.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00592.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2010.00578.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12010"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00610.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00622.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12025"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00625.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00626.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00627.x"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00630.x"/></rdf:Seq></items></channel><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12027" xmlns="http://purl.org/rss/1.0/"><title>Laplacian normalization for deriving thematic fuzzy clusters with an additive spectral approach</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12027</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Laplacian normalization for deriving thematic fuzzy clusters with an additive spectral approach</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Susana Nascimento, Rui Felizardo, Boris Mirkin</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-21T02:49:00.509996-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12027</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12027</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12027</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a further investigation into computational properties of a novel fuzzy additive spectral clustering method, Fuzzy Additive Spectral clustering (FADDIS), recently introduced by authors. Specifically, we extend our analysis to ‘difficult’ data structures from the recent literature and develop two synthetic data generators simulating affinity data of Gaussian clusters and genuine additive similarity data, with a controlled level of noise. The FADDIS is experimentally verified on these data in comparison with two state-of-the-art fuzzy clustering methods. The claimed ability of FADDIS to help in determining the right number of clusters is experimentally tested, and the role of the pseudo-inverse Laplacian data transformation in this is highlighted. A potentially useful extension of the method to biclustering is introduced.</p></div>]]></content:encoded><description>

This paper presents a further investigation into computational properties of a novel fuzzy additive spectral clustering method, Fuzzy Additive Spectral clustering (FADDIS), recently introduced by authors. Specifically, we extend our analysis to ‘difficult’ data structures from the recent literature and develop two synthetic data generators simulating affinity data of Gaussian clusters and genuine additive similarity data, with a controlled level of noise. The FADDIS is experimentally verified on these data in comparison with two state-of-the-art fuzzy clustering methods. The claimed ability of FADDIS to help in determining the right number of clusters is experimentally tested, and the role of the pseudo-inverse Laplacian data transformation in this is highlighted. A potentially useful extension of the method to biclustering is introduced.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12029" xmlns="http://purl.org/rss/1.0/"><title>Towards the automatic enrichment of a thesaurus with information in dictionaries</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12029</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Towards the automatic enrichment of a thesaurus with information in dictionaries</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hugo Gonçalo Oliveira, Paulo Gomes</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-07T23:06:56.177183-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12029</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12029</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12029</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Regarding that information in broad-coverage knowledge bases, such as thesauri, is usually incomplete, merging information from different sources is an alternative to amplify coverage. We propose a method for the enrichment of a thesaurus with information acquired automatically from dictionaries. First, synonymy pairs are extracted. Then, these pairs are assigned to the most similar candidate synsets. Finally, the remaining pairs are the target of clustering to identify new synsets. After selecting the adequate experimentation settings, this method was applied to enrich a Portuguese thesaurus with synonyms extracted from three dictionaries, which resulted in TRIP, a larger and broader thesaurus with new words and concepts. The steps towards the creation of this new thesaurus and its evaluation are described here.</p></div>]]></content:encoded><description>

Regarding that information in broad-coverage knowledge bases, such as thesauri, is usually incomplete, merging information from different sources is an alternative to amplify coverage. We propose a method for the enrichment of a thesaurus with information acquired automatically from dictionaries. First, synonymy pairs are extracted. Then, these pairs are assigned to the most similar candidate synsets. Finally, the remaining pairs are the target of clustering to identify new synsets. After selecting the adequate experimentation settings, this method was applied to enrich a Portuguese thesaurus with synonyms extracted from three dictionaries, which resulted in TRIP, a larger and broader thesaurus with new words and concepts. The steps towards the creation of this new thesaurus and its evaluation are described here.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12022" xmlns="http://purl.org/rss/1.0/"><title>Dominance-based rough set theory over interval-valued information systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12022</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Dominance-based rough set theory over interval-valued information systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bingzhen Sun, Weimin Ma, Zengtai Gong</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-07T21:07:13.04188-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12022</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12022</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12022</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposes a new generalization of classical real-valued information systems, that is, interval-valued information systems. By defining an interval-valued dominance relation on a condition attribute, a rough set model and attribute reduction are established over interval-valued information systems. Moreover, several interesting properties are investigated by constructive approach. Furthermore, knowledge reductions of consistent and inconsistent interval-valued dominance decision information systems are studied, respectively. Subsequently, some descriptive theorems of knowledge reduction are presented for interval-valued dominance decision information systems. Finally, the validity of the model and conclusions is verified by numerical example.</p></div>]]></content:encoded><description>

This paper proposes a new generalization of classical real-valued information systems, that is, interval-valued information systems. By defining an interval-valued dominance relation on a condition attribute, a rough set model and attribute reduction are established over interval-valued information systems. Moreover, several interesting properties are investigated by constructive approach. Furthermore, knowledge reductions of consistent and inconsistent interval-valued dominance decision information systems are studied, respectively. Subsequently, some descriptive theorems of knowledge reduction are presented for interval-valued dominance decision information systems. Finally, the validity of the model and conclusions is verified by numerical example.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12026" xmlns="http://purl.org/rss/1.0/"><title>WiMAX traffic analysis and base stations classification in terms of LRD</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12026</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">WiMAX traffic analysis and base stations classification in terms of LRD</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Cristina Stolojescu-Crisan, Alexandru Isar, Sorin Moga, Philippe Lenca</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-06T22:31:53.079597-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12026</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12026</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12026</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Invited Review</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The goal of this paper is to highlight the particularities of Worldwide Interoperability for Microwave Access (WiMAX) traffic from a long-range dependence perspective. The application presented in this paper consists in the estimation of the quality of base stations (BS) positioning in the architecture of a WiMAX network. Analysing the traffic of the considered WiMAX network, with an original data mining methodology based on long-range dependence, we determine which BS have a correct position in the topology of the network and which BS have an incorrect position. These BS must be repositioned when the next session of the network maintenance will take place.</p></div>]]></content:encoded><description>

The goal of this paper is to highlight the particularities of Worldwide Interoperability for Microwave Access (WiMAX) traffic from a long-range dependence perspective. The application presented in this paper consists in the estimation of the quality of base stations (BS) positioning in the architecture of a WiMAX network. Analysing the traffic of the considered WiMAX network, with an original data mining methodology based on long-range dependence, we determine which BS have a correct position in the topology of the network and which BS have an incorrect position. These BS must be repositioned when the next session of the network maintenance will take place.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12030" xmlns="http://purl.org/rss/1.0/"><title>Speaker verification using heterogeneous neural network architecture with linear correlation speech activity detection</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12030</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Speaker verification using heterogeneous neural network architecture with linear correlation speech activity detection</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tariq Tashan, Tony Allen, Lars Nolle</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-06T22:10:31.064458-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12030</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12030</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12030</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a multi-level speaker verification system that uses 64 discrete Fourier transform spectrum components as input feature vectors. A speech activity detection technique is used as a pre-processing stage to identify vowel phoneme boundaries within a speech sample. A modified self-organising map (SOM) is then used to filter the speech data by using cluster information extracted from three vowels for a claimed speaker. This SOM filtering stage also provides coarse speaker verification. Finally, a second speaker verification level of three multi-layer perceptron networks classifies the filtered frames provided by the SOMs. These multi-layer perceptrons work as fine-grained vowel-based speaker verifiers. The proposed verification algorithm shows a performance of 94.54% when evaluated using 50 speakers from the Centre for Spoken Language Understanding speaker verification database. In addition, it is shown that the novel discrete Fourier transform spectrum-based linear correlation pre-processing technique, presented here, provides the system with greater robustness against changes in speech volume levels when compared with an equivalent energy frame analysis.</p></div>]]></content:encoded><description>

This paper presents a multi-level speaker verification system that uses 64 discrete Fourier transform spectrum components as input feature vectors. A speech activity detection technique is used as a pre-processing stage to identify vowel phoneme boundaries within a speech sample. A modified self-organising map (SOM) is then used to filter the speech data by using cluster information extracted from three vowels for a claimed speaker. This SOM filtering stage also provides coarse speaker verification. Finally, a second speaker verification level of three multi-layer perceptron networks classifies the filtered frames provided by the SOMs. These multi-layer perceptrons work as fine-grained vowel-based speaker verifiers. The proposed verification algorithm shows a performance of 94.54% when evaluated using 50 speakers from the Centre for Spoken Language Understanding speaker verification database. In addition, it is shown that the novel discrete Fourier transform spectrum-based linear correlation pre-processing technique, presented here, provides the system with greater robustness against changes in speech volume levels when compared with an equivalent energy frame analysis.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12023" xmlns="http://purl.org/rss/1.0/"><title>Model-to-model and model-to-text: looking for the automation of VigilAgent</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12023</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Model-to-model and model-to-text: looking for the automation of VigilAgent</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">José Manuel Gascueña, Elena Navarro, Antonio Fernández-Caballero, Rafael Martínez-Tomás</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-06T21:56:16.341409-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12023</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12023</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12023</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>VigilAgent is a methodology for the development of agent-oriented monitoring applications that uses agents as the key abstraction elements of the involved models. It has not been developed from scratch, but it reuses fragments from Prometheus and INGENIAS methodologies for modelling tasks and the ICARO framework for implementation purposes. As VigilAgent intends to automate as much as possible the development process, it exploits.</p></div>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Model transformation techniques are one of the key aspects of the model-driven development approach. A model-to-model transformation is used to facilitate the interoperability between Prometheus and INGENIAS methodologies. Also, a model-to-text transformation is performed to generate ICARO code from the INGENIAS model. A case study based on access control is used to illustrate the fundamentals of the model-to-model and model-to-text transformations implemented in VigilAgent.</p></div>]]></content:encoded><description>

VigilAgent is a methodology for the development of agent-oriented monitoring applications that uses agents as the key abstraction elements of the involved models. It has not been developed from scratch, but it reuses fragments from Prometheus and INGENIAS methodologies for modelling tasks and the ICARO framework for implementation purposes. As VigilAgent intends to automate as much as possible the development process, it exploits.
Model transformation techniques are one of the key aspects of the model-driven development approach. A model-to-model transformation is used to facilitate the interoperability between Prometheus and INGENIAS methodologies. Also, a model-to-text transformation is performed to generate ICARO code from the INGENIAS model. A case study based on access control is used to illustrate the fundamentals of the model-to-model and model-to-text transformations implemented in VigilAgent.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12028" xmlns="http://purl.org/rss/1.0/"><title>Visualization of evolving social networks using actor-level and community-level trajectories</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12028</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Visualization of evolving social networks using actor-level and community-level trajectories</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Márcia Oliveira, João Gama</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-06T21:33:59.78385-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12028</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12028</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12028</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Visualization of static social networks is a mature research field in information visualization. Conventional approaches rely on node-link diagrams that provide a representation of the network topology by representing nodes as points and links between them as lines. However, the increasing availability of longitudinal network data has spurred interest in visualization techniques that go beyond the static node-link representation of a network. In temporal settings, the focus is on the network dynamics at different levels of analysis (e.g. node, communities and whole network). Yet, the development of visualizations that are able to provide actionable insights into different types of changes occurring in the network and their impact on both the neighbourhood and the overall network structure is a challenging task. In such settings, traditional node-link representations can prove to be limited (Yi et al., 2010). Alternative methods, such as matrix graph representations, fail in tasks involving path finding (Ghoniem et al., 2005). This work attempts to overcome these issues by proposing a methodology for tracking the evolution of dynamic social networks, at both the node-level and the community-level, based on the concept of temporal trajectory. We resort to three-order tensors to represent evolving social networks, and we further decompose them using a Tucker3 model. The two most representative components of this model define the 2D space where the trajectories of social entities are projected. To illustrate the proposed methodology, we conduct a case study using a set of temporal self-reported friendship networks.</p></div>]]></content:encoded><description>

Visualization of static social networks is a mature research field in information visualization. Conventional approaches rely on node-link diagrams that provide a representation of the network topology by representing nodes as points and links between them as lines. However, the increasing availability of longitudinal network data has spurred interest in visualization techniques that go beyond the static node-link representation of a network. In temporal settings, the focus is on the network dynamics at different levels of analysis (e.g. node, communities and whole network). Yet, the development of visualizations that are able to provide actionable insights into different types of changes occurring in the network and their impact on both the neighbourhood and the overall network structure is a challenging task. In such settings, traditional node-link representations can prove to be limited (Yi et al., 2010). Alternative methods, such as matrix graph representations, fail in tasks involving path finding (Ghoniem et al., 2005). This work attempts to overcome these issues by proposing a methodology for tracking the evolution of dynamic social networks, at both the node-level and the community-level, based on the concept of temporal trajectory. We resort to three-order tensors to represent evolving social networks, and we further decompose them using a Tucker3 model. The two most representative components of this model define the 2D space where the trajectories of social entities are projected. To illustrate the proposed methodology, we conduct a case study using a set of temporal self-reported friendship networks.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12017" xmlns="http://purl.org/rss/1.0/"><title>A novel two-stage model for cloud service trustworthiness evaluation</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12017</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A novel two-stage model for cloud service trustworthiness evaluation</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Wenjuan Fan, Shanlin Yang, Jun Pei</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-17T06:25:45.709978-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12017</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12017</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12017</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we address the cloud service trustworthiness evaluation problem, which in essence is a multi-attribute decision-making problem, by proposing a novel evaluation model based on the fuzzy gap measurement and the evidential reasoning approach. There are many sources of uncertainties in the process of cloud service trustworthiness evaluation. In addition to the intrinsic uncertainties, cloud service providers face the problem of discrepant evaluation information given by different users from different perspectives. To address these problems, we develop a novel fuzzy gap evaluation approach to assess cloud service trustworthiness and to provide evaluation values from different perspectives. From the evaluation values, the perception–importance, delivery–importance, and perception–delivery gaps are generated. These three gaps reflect the discrepancy evaluation of cloud service trustworthiness in terms of perception utility, delivery utility, and importance utility, respectively. Finally, the gap measurement of each perspective is represented by a belief structure and aggregated using the evidential reasoning approach to generate final evaluation results for informative and robust decision making. From this hybrid two-stage evaluation process, cloud service providers can get improvement suggestions from intermediate information derived from the gap measurement, which is the main advantage of this evaluation process.</p></div>]]></content:encoded><description>

In this paper, we address the cloud service trustworthiness evaluation problem, which in essence is a multi-attribute decision-making problem, by proposing a novel evaluation model based on the fuzzy gap measurement and the evidential reasoning approach. There are many sources of uncertainties in the process of cloud service trustworthiness evaluation. In addition to the intrinsic uncertainties, cloud service providers face the problem of discrepant evaluation information given by different users from different perspectives. To address these problems, we develop a novel fuzzy gap evaluation approach to assess cloud service trustworthiness and to provide evaluation values from different perspectives. From the evaluation values, the perception–importance, delivery–importance, and perception–delivery gaps are generated. These three gaps reflect the discrepancy evaluation of cloud service trustworthiness in terms of perception utility, delivery utility, and importance utility, respectively. Finally, the gap measurement of each perspective is represented by a belief structure and aggregated using the evidential reasoning approach to generate final evaluation results for informative and robust decision making. From this hybrid two-stage evaluation process, cloud service providers can get improvement suggestions from intermediate information derived from the gap measurement, which is the main advantage of this evaluation process.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12020" xmlns="http://purl.org/rss/1.0/"><title>Evaluating the performance of banking under risk regulations: a slacks-based Data Envelopment Analysis assessment framework</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12020</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Evaluating the performance of banking under risk regulations: a slacks-based Data Envelopment Analysis assessment framework</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chih-Ching Yang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-27T03:46:10.638445-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12020</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12020</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12020</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Despite increasing deregulation and globalization in financial markets worldwide, banking is still one of the most regulated industries in many countries. The contribution of the present article is to introduce a slacks-based Data Envelopment Analysis assessment framework for assessing bank efficiency and soundness in a risk regulation setting, which is missing from the banking performance literature. Two main sub-processes within the service flow of a typical bank are considered – the primary banking business for making profit and dealing with the compliance requirements of risk regulations. A Data Envelopment Analysis model is applied to measure the performance of the two sub-processes, that is, profit-making efficiency and risk-controlling efficiency. The research framework and models are applied to an empirical study of the banking sector in Taiwan covering the period 2007 – 2010. We demonstrate how to use the empirical results to monitor the efficiency status for individual banks from 1 year to another, providing an early warning for those with low efficiency. Our empirical results show that there is considerable potential for efficiency improvement in Taiwan's banking industry, and the room for risk-controlling efficiency improvement is even larger. The two efficiency estimates are positively correlated with each other, and both have been improved year by year. However, an economic recession can lower efficiency estimates.</p></div>]]></content:encoded><description>

Despite increasing deregulation and globalization in financial markets worldwide, banking is still one of the most regulated industries in many countries. The contribution of the present article is to introduce a slacks-based Data Envelopment Analysis assessment framework for assessing bank efficiency and soundness in a risk regulation setting, which is missing from the banking performance literature. Two main sub-processes within the service flow of a typical bank are considered – the primary banking business for making profit and dealing with the compliance requirements of risk regulations. A Data Envelopment Analysis model is applied to measure the performance of the two sub-processes, that is, profit-making efficiency and risk-controlling efficiency. The research framework and models are applied to an empirical study of the banking sector in Taiwan covering the period 2007 – 2010. We demonstrate how to use the empirical results to monitor the efficiency status for individual banks from 1 year to another, providing an early warning for those with low efficiency. Our empirical results show that there is considerable potential for efficiency improvement in Taiwan's banking industry, and the room for risk-controlling efficiency improvement is even larger. The two efficiency estimates are positively correlated with each other, and both have been improved year by year. However, an economic recession can lower efficiency estimates.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12021" xmlns="http://purl.org/rss/1.0/"><title>Ambient assisted living system with capacitive occupancy sensor</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12021</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Ambient assisted living system with capacitive occupancy sensor</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Francisco J. Fernandez-Luque, Félix L. Martínez, Ginés Domènech, Juan Zapata, Ramón Ruiz</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-21T21:26:41.727203-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12021</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12021</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12021</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Alert intelligent device is an ambient assisted living (AAL) system that allows the evaluation of potentially dangerous situations for elderly people living alone at home. This evaluation is obtained by an ad hoc network of sensor nodes, working in conjunction with an ambient intelligence layer embedded in a personal computer that learns from user behaviour patterns and warns when a detected pattern differs significantly from previously acquired normal patterns. Each new datum read from sensors is processed in the ambient intelligence layer through three processing levels: shallow, intermediate and deep. The shallow processing level focuses on physical data and sensory features. The intermediate level covers information interpretation and its translation into the form required by the third level: the reasoning processing or deep level.</p></div>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In alert intelligent device, energy is a critical issue, so that sensor devices need to be properly designed and managed to achieve significant energy saving. The use of bed/chair occupancy sensors is mandatory for this kind of ubiquitous computing system. A first way to approach this problem relied on the use of pressure mats, but several environmental drawbacks showed them inappropriate as an efficient and reliable solution for large volume deployments. Moreover, solutions based on force-to-resistor transducers entail power consumption budgets that keep them from being integrated on wireless sensor nodes. In this paper, a force-capacitive transducer based sensor has been proposed, implemented and tested. This sensor is based on electromechanical film (EMFi) transducers, which are able to detect force variations in a quasi-passive way. This kind of transducer behaves as capacitors with variable capacitance depending on the force exerted on its surface. We have developed a new technique to carry out the characterization of these transducers, where the detection of a force change is used to trigger an active mechanism that allows us to measure the weight by means of a novel modelling approach. A low-power wireless sensor node prototype that includes this new transducer has been assembled and tested on a wide range of weights. Occupancy detection achieved by this technology has proven to be successful, increasing the total power consumption of the node by less than 15%, which makes it suitable for implementation.</p></div>]]></content:encoded><description>

Alert intelligent device is an ambient assisted living (AAL) system that allows the evaluation of potentially dangerous situations for elderly people living alone at home. This evaluation is obtained by an ad hoc network of sensor nodes, working in conjunction with an ambient intelligence layer embedded in a personal computer that learns from user behaviour patterns and warns when a detected pattern differs significantly from previously acquired normal patterns. Each new datum read from sensors is processed in the ambient intelligence layer through three processing levels: shallow, intermediate and deep. The shallow processing level focuses on physical data and sensory features. The intermediate level covers information interpretation and its translation into the form required by the third level: the reasoning processing or deep level.
In alert intelligent device, energy is a critical issue, so that sensor devices need to be properly designed and managed to achieve significant energy saving. The use of bed/chair occupancy sensors is mandatory for this kind of ubiquitous computing system. A first way to approach this problem relied on the use of pressure mats, but several environmental drawbacks showed them inappropriate as an efficient and reliable solution for large volume deployments. Moreover, solutions based on force-to-resistor transducers entail power consumption budgets that keep them from being integrated on wireless sensor nodes. In this paper, a force-capacitive transducer based sensor has been proposed, implemented and tested. This sensor is based on electromechanical film (EMFi) transducers, which are able to detect force variations in a quasi-passive way. This kind of transducer behaves as capacitors with variable capacitance depending on the force exerted on its surface. We have developed a new technique to carry out the characterization of these transducers, where the detection of a force change is used to trigger an active mechanism that allows us to measure the weight by means of a novel modelling approach. A low-power wireless sensor node prototype that includes this new transducer has been assembled and tested on a wide range of weights. Occupancy detection achieved by this technology has proven to be successful, increasing the total power consumption of the node by less than 15%, which makes it suitable for implementation.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12018" xmlns="http://purl.org/rss/1.0/"><title>On reactive routing protocols in ZigBee wireless sensor networks</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12018</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">On reactive routing protocols in ZigBee wireless sensor networks</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Antonio M. Ortiz, Fernando Royo, Teresa Olivares, Jose Carlos Castillo, Luis Orozco-Barbosa</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-14T06:48:29.341035-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12018</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12018</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12018</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>ZigBee is the primary standard solution for wireless sensor networks, implementing the Ad hoc On-Demand Distance Vector (AODV) protocol in the network layer and supported by the standard IEEE 802.15.4. This study is focused on mesh topologies and the critical problems encountered when AODV is executed in conjunction with the Carrier Sense Multiple Access with Collision Avoidance protocol. These problems are mainly related to the packet overhead required to carry out route creation. To perform preliminary experiments to be able to implement AODV in a real network, a new metric is proposed herein. This metric uses fuzzy logic to help in the decision-making process. The objective of the fuzzy routine is to determine, during the route-discovery process, the best node to forward request/reply packets, with the aim of reducing packet overhead and energy consumption. Moreover, minor changes are also added to the discovery procedure of AODV to improve the performance of the route-creation process. This intelligent version of AODV has provided promising experimental results, greatly reducing the number of packets required, with the consequent energy saving while selecting the best nodes to be part of the routes.</p></div>]]></content:encoded><description>

ZigBee is the primary standard solution for wireless sensor networks, implementing the Ad hoc On-Demand Distance Vector (AODV) protocol in the network layer and supported by the standard IEEE 802.15.4. This study is focused on mesh topologies and the critical problems encountered when AODV is executed in conjunction with the Carrier Sense Multiple Access with Collision Avoidance protocol. These problems are mainly related to the packet overhead required to carry out route creation. To perform preliminary experiments to be able to implement AODV in a real network, a new metric is proposed herein. This metric uses fuzzy logic to help in the decision-making process. The objective of the fuzzy routine is to determine, during the route-discovery process, the best node to forward request/reply packets, with the aim of reducing packet overhead and energy consumption. Moreover, minor changes are also added to the discovery procedure of AODV to improve the performance of the route-creation process. This intelligent version of AODV has provided promising experimental results, greatly reducing the number of packets required, with the consequent energy saving while selecting the best nodes to be part of the routes.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12014" xmlns="http://purl.org/rss/1.0/"><title>Electrocardiogram-based emotion recognition system using empirical mode decomposition and discrete Fourier transform</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12014</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Electrocardiogram-based emotion recognition system using empirical mode decomposition and discrete Fourier transform</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">S Jerritta, M Murugappan, Wan Khairunizam, Yaacob Sazali</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-13T04:34:02.141575-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12014</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12014</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12014</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Emotion recognition using physiological signals has gained momentum in the field of human computer–interaction. This work focuses on developing a user-independent emotion recognition system that would classify five emotions (happiness, sadness, fear, surprise and disgust) and neutral state. The various stages such as design of emotion elicitation protocol, data acquisition, pre-processing, feature extraction and classification are discussed. Emotional data were obtained from 30 undergraduate students by using emotional video clips. Power and entropy features were obtained in three ways – by decomposing and reconstructing the signal using empirical mode decomposition, by using a Hilbert–Huang transform and by applying a discrete Fourier transform to the intrinsic mode functions (IMFs). Statistical analysis using analysis of variance indicates significant differences among the six emotional states (p &lt; 0.001). Classification results indicate that applying the discrete Fourier transform instead of the Hilbert transform to the IMFs provides comparatively better accuracy for all the six classes with an overall accuracy of 52%. Although the accuracy is less, it reveals the possibility of developing a system that could identify the six emotional states in a user-independent manner using electrocardiogram signals. The accuracy of the system can be improved by investigating the power and entropy of the individual IMFs.</p></div>]]></content:encoded><description>

Emotion recognition using physiological signals has gained momentum in the field of human computer–interaction. This work focuses on developing a user-independent emotion recognition system that would classify five emotions (happiness, sadness, fear, surprise and disgust) and neutral state. The various stages such as design of emotion elicitation protocol, data acquisition, pre-processing, feature extraction and classification are discussed. Emotional data were obtained from 30 undergraduate students by using emotional video clips. Power and entropy features were obtained in three ways – by decomposing and reconstructing the signal using empirical mode decomposition, by using a Hilbert–Huang transform and by applying a discrete Fourier transform to the intrinsic mode functions (IMFs). Statistical analysis using analysis of variance indicates significant differences among the six emotional states (p &lt; 0.001). Classification results indicate that applying the discrete Fourier transform instead of the Hilbert transform to the IMFs provides comparatively better accuracy for all the six classes with an overall accuracy of 52%. Although the accuracy is less, it reveals the possibility of developing a system that could identify the six emotional states in a user-independent manner using electrocardiogram signals. The accuracy of the system can be improved by investigating the power and entropy of the individual IMFs.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12019" xmlns="http://purl.org/rss/1.0/"><title>Combining domain knowledge and machine learning for robust fall detection</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12019</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Combining domain knowledge and machine learning for robust fall detection</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Violeta Mirchevska, Mitja Luštrek, Matjaž Gams</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-06T06:47:37.292761-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12019</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12019</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12019</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a method for combining domain knowledge and machine learning (CDKML) for classifier generation and online adaptation. The method exploits advantages in domain knowledge and machine learning as complementary information sources. Whereas machine learning may discover patterns in interest domains that are too subtle for humans to detect, domain knowledge may contain information on a domain not present in the available domain dataset. CDKML has three steps. First, prior domain knowledge is enriched with relevant patterns obtained by machine learning to create an initial classifier. Second, genetic algorithms refine the classifier. Third, the classifier is adapted online on the basis of user feedback using the Markov decision process. CDKML was applied in fall detection. Tests showed that the classifiers developed by CDKML have better performance than machine-learning classifiers generated on a training dataset that does not adequately represent all real-life cases of the learned concept. The accuracy of the initial classifier was 10 percentage points higher than the best machine-learning classifier and the refinement added 3 percentage points. The online adaptation improved the accuracy of the refined classifier by an additional 15 percentage points.</p></div>]]></content:encoded><description>

This paper presents a method for combining domain knowledge and machine learning (CDKML) for classifier generation and online adaptation. The method exploits advantages in domain knowledge and machine learning as complementary information sources. Whereas machine learning may discover patterns in interest domains that are too subtle for humans to detect, domain knowledge may contain information on a domain not present in the available domain dataset. CDKML has three steps. First, prior domain knowledge is enriched with relevant patterns obtained by machine learning to create an initial classifier. Second, genetic algorithms refine the classifier. Third, the classifier is adapted online on the basis of user feedback using the Markov decision process. CDKML was applied in fall detection. Tests showed that the classifiers developed by CDKML have better performance than machine-learning classifiers generated on a training dataset that does not adequately represent all real-life cases of the learned concept. The accuracy of the initial classifier was 10 percentage points higher than the best machine-learning classifier and the refinement added 3 percentage points. The online adaptation improved the accuracy of the refined classifier by an additional 15 percentage points.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12015" xmlns="http://purl.org/rss/1.0/"><title>The strongest does not attract all but it does attract the most – evaluating the criminal attractiveness of shopping malls using fuzzy logic</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12015</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">The strongest does not attract all but it does attract the most – evaluating the criminal attractiveness of shopping malls using fuzzy logic</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Vijay K. Mago, Richard Frank, Andrew Reid, Vahid Dabbaghian</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-06T06:12:26.995878-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12015</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12015</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12015</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Crime attractors are locations (e.g. shopping malls) that attract criminally motivated offenders because of the presence of known criminal opportunities. Although there have been many studies that explore the patterns of crime in and around these locations, there are still many questions that linger. In recent years, there has been a growing interest to develop mathematical models in attempts to help answer questions about various criminological phenomena. In this paper, we are interested in applying a formal methodology to model the relative attractiveness of crime attractor locations based on characteristics of offenders and the crime they committed. To accomplish this task, we adopt fuzzy logic techniques to calculate the attractiveness of crime attractors in three suburban cities in the Metro Vancouver region of British Columbia, Canada. The fuzzy logic techniques provide results comparable with our real-life expectations that offenders do not necessarily commit significant crimes in the immediate neighbourhood of the attractors, but travel towards it, and commit crimes on the way. The results of this study could lead to a variety of crime prevention benefits and urban planning strategies.</p></div>]]></content:encoded><description>

Crime attractors are locations (e.g. shopping malls) that attract criminally motivated offenders because of the presence of known criminal opportunities. Although there have been many studies that explore the patterns of crime in and around these locations, there are still many questions that linger. In recent years, there has been a growing interest to develop mathematical models in attempts to help answer questions about various criminological phenomena. In this paper, we are interested in applying a formal methodology to model the relative attractiveness of crime attractor locations based on characteristics of offenders and the crime they committed. To accomplish this task, we adopt fuzzy logic techniques to calculate the attractiveness of crime attractors in three suburban cities in the Metro Vancouver region of British Columbia, Canada. The fuzzy logic techniques provide results comparable with our real-life expectations that offenders do not necessarily commit significant crimes in the immediate neighbourhood of the attractors, but travel towards it, and commit crimes on the way. The results of this study could lead to a variety of crime prevention benefits and urban planning strategies.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12011" xmlns="http://purl.org/rss/1.0/"><title>Optimal direct mailing modelling based on data envelopment analysis</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12011</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimal direct mailing modelling based on data envelopment analysis</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Mahdi Mahdiloo, Abdollah Noorizadeh, Reza FarzipoorSaen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-02-27T05:27:37.037171-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12011</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12011</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12011</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Original Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Data envelopment analysis (DEA) is a mathematical programming technique that is frequently used for measuring and benchmarking efficiency of the homogenous decision-making units (DMUs). This paper proposes a new use of DEA for customers scoring and particularly their direct mailing modelling. Moreover, because DEA models suffer from some weaknesses, that is, unrealistic weighting scheme of the inputs and outputs and incomplete ranking among efficient DMUs, the present paper compares different ways of solving these problems and concludes that common set of weights method, as a result of some advantages, outperforms other procedures.</p></div>]]></content:encoded><description>

Data envelopment analysis (DEA) is a mathematical programming technique that is frequently used for measuring and benchmarking efficiency of the homogenous decision-making units (DMUs). This paper proposes a new use of DEA for customers scoring and particularly their direct mailing modelling. Moreover, because DEA models suffer from some weaknesses, that is, unrealistic weighting scheme of the inputs and outputs and incomplete ranking among efficient DMUs, the present paper compares different ways of solving these problems and concludes that common set of weights method, as a result of some advantages, outperforms other procedures.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12013" xmlns="http://purl.org/rss/1.0/"><title>Human activity recognition based on kinematic features</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12013</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Human activity recognition based on kinematic features</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">J. Hernández, R. Cabido, A. S. Montemayor, J.J. Pantrigo</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-02-26T07:28:29.586047-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12013</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12013</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12013</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposes a new approach to recognize human actions in 2D sequences, based on real-time visual tracking and simple feature extraction of human activities in video sequences. The proposed method emphasizes the simplicity of the strategies used, in an attempt to describe human actions as precisely as other more sophisticated (and more computationally demanding) methods in the literature. Specifically, we propose three complementary modules for the following: (a) tracking; (b) feature extraction; and (c) action recognition. The first module is based on the hybridization of a particle filter and a local search procedure and makes use of a reduced integral image to speed up the weight computation. The feature extraction module characterizes the silhouette of the tracked person by dividing it into rectangular boxes. Then, the system computes statistics on the evolution of these rectangular boxes over time. Finally, the action recognition module passes these statistics to a support vector machine to classify the actions. Experimental results show that the proposed method works in real-time, and its performance is competitive against other state-of-the-art methods.</p></div>]]></content:encoded><description>

This paper proposes a new approach to recognize human actions in 2D sequences, based on real-time visual tracking and simple feature extraction of human activities in video sequences. The proposed method emphasizes the simplicity of the strategies used, in an attempt to describe human actions as precisely as other more sophisticated (and more computationally demanding) methods in the literature. Specifically, we propose three complementary modules for the following: (a) tracking; (b) feature extraction; and (c) action recognition. The first module is based on the hybridization of a particle filter and a local search procedure and makes use of a reduced integral image to speed up the weight computation. The feature extraction module characterizes the silhouette of the tracked person by dividing it into rectangular boxes. Then, the system computes statistics on the evolution of these rectangular boxes over time. Finally, the action recognition module passes these statistics to a support vector machine to classify the actions. Experimental results show that the proposed method works in real-time, and its performance is competitive against other state-of-the-art methods.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12009" xmlns="http://purl.org/rss/1.0/"><title>Effect of Southern Oscillation Index and spatially distributed climate data on improving the accuracy of Artificial Neural Network, Adaptive Neuro-Fuzzy Inference System and K-Nearest Neighbour streamflow forecasting models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12009</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Effect of Southern Oscillation Index and spatially distributed climate data on improving the accuracy of Artificial Neural Network, Adaptive Neuro-Fuzzy Inference System and K-Nearest Neighbour streamflow forecasting models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bahram Saghafian, Sedigheh Anvari, Saeed Morid</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-01-04T06:23:51.770132-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12009</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12009</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12009</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Streamflow forecast models are essential ingredients for water resources management. Due to nonlinear nature of streamflow generation, Artificial Neural Networks (ANNs), Adaptive Neuro-Fuzzy Inference System (ANFIS) and K-Nearest Neighbour (K-NN) have turned into popular forecast models. The main objective of this paper was to study the effect of various non-commonly used data, including spatially distributed climatic data, as well as Southern Oscillation Index (SOI), on the improvement of one- to three-month ahead flow forecasts in the Karun basin, Iran. Temperature maps were produced via elevation–temperature relationships, while inverse distance-weighted interpolation was applied to generate precipitation maps. In addition, three different input architectures were constructed for ANNs and ANFIS models using cross-correlation and principal component analysis techniques. Next, the most accurate models with input point data were identified based on the root mean squared error and mean absolute error. Finally, the effect of using spatial climatic data and SOI on the performance of the most accurate models was investigated. Results showed that distributed precipitation data improved the performance of ANN and ANFIS models, while K-NN model accuracy was only marginally affected. Adding SOI as an additional input improved the forecast performance slightly in all lead times.</p></div>]]></content:encoded><description>

Streamflow forecast models are essential ingredients for water resources management. Due to nonlinear nature of streamflow generation, Artificial Neural Networks (ANNs), Adaptive Neuro-Fuzzy Inference System (ANFIS) and K-Nearest Neighbour (K-NN) have turned into popular forecast models. The main objective of this paper was to study the effect of various non-commonly used data, including spatially distributed climatic data, as well as Southern Oscillation Index (SOI), on the improvement of one- to three-month ahead flow forecasts in the Karun basin, Iran. Temperature maps were produced via elevation–temperature relationships, while inverse distance-weighted interpolation was applied to generate precipitation maps. In addition, three different input architectures were constructed for ANNs and ANFIS models using cross-correlation and principal component analysis techniques. Next, the most accurate models with input point data were identified based on the root mean squared error and mean absolute error. Finally, the effect of using spatial climatic data and SOI on the performance of the most accurate models was investigated. Results showed that distributed precipitation data improved the performance of ANN and ANFIS models, while K-NN model accuracy was only marginally affected. Adding SOI as an additional input improved the forecast performance slightly in all lead times.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12006" xmlns="http://purl.org/rss/1.0/"><title>Data mining based storage assignment heuristics for travel distance reduction</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12006</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Data mining based storage assignment heuristics for travel distance reduction</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">David Ming-Huang Chiang, Chia-Ping Lin, Mu-Chen Chen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-12-26T06:40:28.46693-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12006</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12006</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12006</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Among the warehousing activities in distribution centres, order picking is the most time-consuming and labour-intensive. As a result, order picking may become a bottleneck preventing distribution centres from maximizing the effectiveness of their warehousing activities. Although storage location assignment (or product allocation) is a tactical decision, it is especially influential on the effectiveness of order picking. In previous studies, most storage assignment approaches considered the order frequency of individual products rather than that of product groups, which often are purchased together. This paper proposes a new association measure, weighted support count (WSC), based on association rule mining, to represent both the intensity and nature of the relationships between products in a distribution centre. This paper presents two storage assignment heuristics, the modified class-based heuristic (MCBH) and the association seed based heuristic (ASBH), designed to facilitate efficient order picking by applying WSC. The real-world data set of a grocery distribution centre is used to verify the effectiveness of the proposed approaches. From the computational results, MCBH cuts at most 4% from the travel distance for order picking per month, as compared with the traditional class-based approach. Meanwhile, ASBH achieves at most a 13% reduction in travel distance.</p></div>]]></content:encoded><description>

Among the warehousing activities in distribution centres, order picking is the most time-consuming and labour-intensive. As a result, order picking may become a bottleneck preventing distribution centres from maximizing the effectiveness of their warehousing activities. Although storage location assignment (or product allocation) is a tactical decision, it is especially influential on the effectiveness of order picking. In previous studies, most storage assignment approaches considered the order frequency of individual products rather than that of product groups, which often are purchased together. This paper proposes a new association measure, weighted support count (WSC), based on association rule mining, to represent both the intensity and nature of the relationships between products in a distribution centre. This paper presents two storage assignment heuristics, the modified class-based heuristic (MCBH) and the association seed based heuristic (ASBH), designed to facilitate efficient order picking by applying WSC. The real-world data set of a grocery distribution centre is used to verify the effectiveness of the proposed approaches. From the computational results, MCBH cuts at most 4% from the travel distance for order picking per month, as compared with the traditional class-based approach. Meanwhile, ASBH achieves at most a 13% reduction in travel distance.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12008" xmlns="http://purl.org/rss/1.0/"><title>Signal processing evaluation of myoelectric sensor placement in low-level gestures: sensitivity analysis using independent component analysis</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12008</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Signal processing evaluation of myoelectric sensor placement in low-level gestures: sensitivity analysis using independent component analysis</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Ganesh R. Naik, Dinesh K. Kumar, Marimuthu Palaniswami</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-23T05:44:39.194253-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12008</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12008</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12008</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Surface electromyogram (sEMG) is a technique in which electrodes are placed on the skin overlying a muscle to detect the electrical activity. Multiple electrical sensors are essential for extracting intrinsic physiological and contextual information from the corresponding sEMG signals. The reason, why more than just one sEMG signal capture has to be used, is as follows: Due to signal propagation inside the human body in terms of an electrical conductor, there cannot be a one-to-one mapping of activities between muscle fibre groups and corresponding sEMG sensing electrodes. Each of such electrodes rather records a composition of many, and widely activity-independent signals, and such kind of raw signal capture cannot be efficiently used for pattern matching due to its linear dependency. On the other hand, Independent component analysis (ICA) provides the perfect answer of separating skin surface recordings into a set of independent muscle actions. Hence, there is a need for a method that indicates the quality of the sensor placements in sEMG. The purpose of this paper is to describe the use of source separation for sEMG using ICA. The actual use in practical sEMG experiments is demonstrated, when the number of recording channels for electrical muscle activities is varied.</p></div>]]></content:encoded><description>

Surface electromyogram (sEMG) is a technique in which electrodes are placed on the skin overlying a muscle to detect the electrical activity. Multiple electrical sensors are essential for extracting intrinsic physiological and contextual information from the corresponding sEMG signals. The reason, why more than just one sEMG signal capture has to be used, is as follows: Due to signal propagation inside the human body in terms of an electrical conductor, there cannot be a one-to-one mapping of activities between muscle fibre groups and corresponding sEMG sensing electrodes. Each of such electrodes rather records a composition of many, and widely activity-independent signals, and such kind of raw signal capture cannot be efficiently used for pattern matching due to its linear dependency. On the other hand, Independent component analysis (ICA) provides the perfect answer of separating skin surface recordings into a set of independent muscle actions. Hence, there is a need for a method that indicates the quality of the sensor placements in sEMG. The purpose of this paper is to describe the use of source separation for sEMG using ICA. The actual use in practical sEMG experiments is demonstrated, when the number of recording channels for electrical muscle activities is varied.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12005" xmlns="http://purl.org/rss/1.0/"><title>Knowledge transfer in offshore outsourcing software development projects: an analysis of the challenges and solutions from German clients</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12005</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Knowledge transfer in offshore outsourcing software development projects: an analysis of the challenges and solutions from German clients</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Stefanie Betz, Andreas Oberweis, Rolf Stephan</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-22T06:13:02.493009-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12005</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12005</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12005</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Knowledge transfer is a critical factor in ensuring the success of offshore outsourcing software development projects and is, in many cases, neglected. Compared to in-house or co-located projects, however, such globally distributed projects feature far greater complexity. In addition to language barriers, factors such as cultural differences, time zone variance, distinct methods and practices, as well as unique equipment and infrastructure can all lead to problems that negatively impact knowledge transfer, and as a result, a project's overall success. In order to help minimise such risks to knowledge transfer, we conducted a research study based on expert interviews in six projects. Our study used German clients and focused on offshore outsourcing software development projects. We first identified known problems in knowledge transfer that can occur with offshore outsourcing projects. Then we collected best-practice solutions proven to overcome the types of problems described. Afterward, we conducted a follow-up study to evaluate our findings. In this subsequent stage, we presented our findings to a different group of experts in five projects and asked them to evaluate these solutions and recommendations in terms of our original goal, namely to find ways to minimise knowledge-transfer problems in offshore outsourcing software development projects. Thus, the result of our study is a catalog of evaluated solutions and associated recommendations mapped to the identified problem areas.</p></div>]]></content:encoded><description>

Knowledge transfer is a critical factor in ensuring the success of offshore outsourcing software development projects and is, in many cases, neglected. Compared to in-house or co-located projects, however, such globally distributed projects feature far greater complexity. In addition to language barriers, factors such as cultural differences, time zone variance, distinct methods and practices, as well as unique equipment and infrastructure can all lead to problems that negatively impact knowledge transfer, and as a result, a project's overall success. In order to help minimise such risks to knowledge transfer, we conducted a research study based on expert interviews in six projects. Our study used German clients and focused on offshore outsourcing software development projects. We first identified known problems in knowledge transfer that can occur with offshore outsourcing projects. Then we collected best-practice solutions proven to overcome the types of problems described. Afterward, we conducted a follow-up study to evaluate our findings. In this subsequent stage, we presented our findings to a different group of experts in five projects and asked them to evaluate these solutions and recommendations in terms of our original goal, namely to find ways to minimise knowledge-transfer problems in offshore outsourcing software development projects. Thus, the result of our study is a catalog of evaluated solutions and associated recommendations mapped to the identified problem areas.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12004" xmlns="http://purl.org/rss/1.0/"><title>Identification of transcription factor binding sites using Gaussian mixture models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12004</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Identification of transcription factor binding sites using Gaussian mixture models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Mustafa Karabulut, Turgay Ibrikci</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-22T06:11:43.49978-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12004</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12004</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12004</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p><em>Identification of transcription factor binding sites still remains a challenging problem even though many computational tools have been proposed in the literature for this specific task. In this study, a method to discover such DNA subsequences, that is, motifs, is proposed. The method uses</em> <em>G</em><em>aussian mixture models with expectation-maximization algorithm. In order to show the potential of the proposed method, experiments are conducted by use of data sets extracted from the</em> <em>DNA</em> <em>sequences of various organisms. The proposed method is also compared with four other methods</em>: <em>MEME</em><em>,</em> <em>MDS</em><em>can,</em> <em>SOMBRERO</em> <em>and the fuzzy</em> <em>C</em><em>-means based motif finder. As a result, the proposed method proves itself as a promising tool in identifying over-represented</em> <em>DNA</em> <em>motifs</em>.</p></div>]]></content:encoded><description>

Identification of transcription factor binding sites still remains a challenging problem even though many computational tools have been proposed in the literature for this specific task. In this study, a method to discover such DNA subsequences, that is, motifs, is proposed. The method uses Gaussian mixture models with expectation-maximization algorithm. In order to show the potential of the proposed method, experiments are conducted by use of data sets extracted from the DNA sequences of various organisms. The proposed method is also compared with four other methods: MEME, MDScan, SOMBRERO and the fuzzy C-means based motif finder. As a result, the proposed method proves itself as a promising tool in identifying over-represented DNA motifs.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12003" xmlns="http://purl.org/rss/1.0/"><title>Case-based approach for supporting strategy decision making</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12003</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Case-based approach for supporting strategy decision making</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jerzy Surma</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-10-25T12:49:22.782431-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12003</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12003</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12003</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The practice of strategy decision making proves that when the management board is strongly limited in its capacity to take rational actions, specifically in the context of great decision complexity and uncertainty, it is considered good practice to refer to experience through reasoning by analogy. In this paper, we would like to concentrate on supporting strategic decisions in small and medium enterprises (SMEs). The complexity of analogy-based reasoning has its roots in an attempt to solve new problems based on past cases from a different domain, while we will focus on case-based approach for a single domain. Additionally, we have chosen case-based reasoning as a suitable decision-making paradigm because it is corresponds to managers’ decision-making behaviour. We present the STRATEGOS case-based reasoning system for supporting strategic decision making by SMEs management boards and then the system evaluation by the dozens of chief executive officers (CEOs) from SMEs is presented. The results of the survey are promising and show the remarkable correspondence of the proposed solution with expectations and strategic behaviour of CEOs.</p></div>]]></content:encoded><description>

The practice of strategy decision making proves that when the management board is strongly limited in its capacity to take rational actions, specifically in the context of great decision complexity and uncertainty, it is considered good practice to refer to experience through reasoning by analogy. In this paper, we would like to concentrate on supporting strategic decisions in small and medium enterprises (SMEs). The complexity of analogy-based reasoning has its roots in an attempt to solve new problems based on past cases from a different domain, while we will focus on case-based approach for a single domain. Additionally, we have chosen case-based reasoning as a suitable decision-making paradigm because it is corresponds to managers’ decision-making behaviour. We present the STRATEGOS case-based reasoning system for supporting strategic decision making by SMEs management boards and then the system evaluation by the dozens of chief executive officers (CEOs) from SMEs is presented. The results of the survey are promising and show the remarkable correspondence of the proposed solution with expectations and strategic behaviour of CEOs.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00634.x" xmlns="http://purl.org/rss/1.0/"><title>Security-level classification for confidential documents by using adaptive neuro-fuzzy inference systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00634.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Security-level classification for confidential documents by using adaptive neuro-fuzzy inference systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Erdem Alparslan, Adem Karahoca, Hayretdin Bahşi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-10-11T08:57:22.388625-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00634.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00634.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00634.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The security-level detection of a confidential document is a vital task for organizations to protect their confidential information. Diverse classification rules and techniques are being applied by human experts. Increasing number of confidential information in organizations is making difficult to classify all the documents carefully with human effort. The recommended frameworks in this study classify the internal documents of TUBITAK UEKAE (National Research Institute of Electronics and Cryptology of Turkey) by using classification algorithms naïve Bayes, support vector machines (SVMs) and adaptive neuro-fuzzy inference systems (ANFISs). A hybrid approach involving support vector classifiers and adaptive neuro-fuzzy classifiers exposes the most successful accuracy rates of expert system classification. This study also states preprocessing tasks required for document classification with natural language processing. To represent term–document relations, a recommended metric TF-IDF was chosen to construct a weight matrix. Agglutinative nature of Turkish documents is handled by Turkish stemming algorithms. At the end of the article, some experimental results and success metrics are projected with accuracy rates and receiver operating characteristic (ROC) curves.</p></div>]]></content:encoded><description>

The security-level detection of a confidential document is a vital task for organizations to protect their confidential information. Diverse classification rules and techniques are being applied by human experts. Increasing number of confidential information in organizations is making difficult to classify all the documents carefully with human effort. The recommended frameworks in this study classify the internal documents of TUBITAK UEKAE (National Research Institute of Electronics and Cryptology of Turkey) by using classification algorithms naïve Bayes, support vector machines (SVMs) and adaptive neuro-fuzzy inference systems (ANFISs). A hybrid approach involving support vector classifiers and adaptive neuro-fuzzy classifiers exposes the most successful accuracy rates of expert system classification. This study also states preprocessing tasks required for document classification with natural language processing. To represent term–document relations, a recommended metric TF-IDF was chosen to construct a weight matrix. Agglutinative nature of Turkish documents is handled by Turkish stemming algorithms. At the end of the article, some experimental results and success metrics are projected with accuracy rates and receiver operating characteristic (ROC) curves.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12002" xmlns="http://purl.org/rss/1.0/"><title>Development of a fuzzy decision support framework for complex multi-attribute decision problems: A case study for the selection of skilful basketball players</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12002</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Development of a fuzzy decision support framework for complex multi-attribute decision problems: A case study for the selection of skilful basketball players</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Serkan Ballı, Serdar Korukoğlu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-10-04T21:30:43.262425-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12002</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12002</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12002</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>The selection of skilful players is a complicated process due to the problem criteria consisting of both qualitative and quantitative attributes as well as vague linguistic terms. This study seeks to develop a decision support framework for the selection of candidates eligible to become basketball players through the use of a fuzzy multi-attribute decision making (MADM) algorithm. The proposed model is based on fuzzy analytic hierarchy process (FAHP) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) methods. The model was employed in the Youth and Sports Center of Mugla, Turkey, with the participation of seven junior basketball players aged between 7 and 14. In the present study, physical fitness measurement values and observation values of technical skills were utilized. FAHP was used to determine the weights of the criteria and the observation values of technical skills by decision makers. Physical fitness measurement values were converted to fuzzy values by using a fuzzy set approach. Subsequently, the overall ranking of the candidate players was determined by the TOPSIS method. Results were compared with human experts’ opinions. It is observed that the developed model is more reliable to be used in decision making. The model architecture and experimental results along with illustrative examples are further demonstrated in the study.</p></div>]]></content:encoded><description>

The selection of skilful players is a complicated process due to the problem criteria consisting of both qualitative and quantitative attributes as well as vague linguistic terms. This study seeks to develop a decision support framework for the selection of candidates eligible to become basketball players through the use of a fuzzy multi-attribute decision making (MADM) algorithm. The proposed model is based on fuzzy analytic hierarchy process (FAHP) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) methods. The model was employed in the Youth and Sports Center of Mugla, Turkey, with the participation of seven junior basketball players aged between 7 and 14. In the present study, physical fitness measurement values and observation values of technical skills were utilized. FAHP was used to determine the weights of the criteria and the observation values of technical skills by decision makers. Physical fitness measurement values were converted to fuzzy values by using a fuzzy set approach. Subsequently, the overall ranking of the candidate players was determined by the TOPSIS method. Results were compared with human experts’ opinions. It is observed that the developed model is more reliable to be used in decision making. The model architecture and experimental results along with illustrative examples are further demonstrated in the study.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00652.x" xmlns="http://purl.org/rss/1.0/"><title>A genetic tango attack against the David–Prasad RFID ultra-lightweight authentication protocol</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00652.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A genetic tango attack against the David–Prasad RFID ultra-lightweight authentication protocol</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">David F. Barrero, Julio César Hernández-Castro, Pedro Peris-Lopez, David Camacho, María D. R-Moreno</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-17T20:08:42.779085-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00652.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00652.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00652.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p><em>Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra-lightweight) RFID environments. One of these proposals is the David–Prasad ultra-lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack</em>.</p></div>]]></content:encoded><description>

Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra-lightweight) RFID environments. One of these proposals is the David–Prasad ultra-lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00640.x" xmlns="http://purl.org/rss/1.0/"><title>Integration by communication: knowledge exchange in global outsourcing of product software development</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00640.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Integration by communication: knowledge exchange in global outsourcing of product software development</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Baldur Kristjánsson, Remko Helms, Sjaak Brinkkemper</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-17T20:05:32.969675-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00640.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00640.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00640.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Global outsourcing is a growing trend among independent software vendors. In these projects like other distributed work, distances have negative effects on communication and coordination, directly impacting performance. We present a normative model designed to address this issue by improving communication and knowledge exchange. The model consists of six distinct practices and a tool blueprint, each coming with practical guidelines. It is based in part on two case studies of Dutch software vendors who have successfully outsourced part of their activities to an Eastern European outsourcing vendor, and validated by a panel of six experts from industry and the scientific community. It is concluded that knowledge exchange in global software outsourcing is a by-product of efforts to enhance communication and coordination, rather than specific technical solutions. By committing to sharing knowledge, emphasizing transparency and integrating the outsourcing team into their organizations, customers from the product software business can realize the benefits of global outsourcing.</p></div>]]></content:encoded><description>

Global outsourcing is a growing trend among independent software vendors. In these projects like other distributed work, distances have negative effects on communication and coordination, directly impacting performance. We present a normative model designed to address this issue by improving communication and knowledge exchange. The model consists of six distinct practices and a tool blueprint, each coming with practical guidelines. It is based in part on two case studies of Dutch software vendors who have successfully outsourced part of their activities to an Eastern European outsourcing vendor, and validated by a panel of six experts from industry and the scientific community. It is concluded that knowledge exchange in global software outsourcing is a by-product of efforts to enhance communication and coordination, rather than specific technical solutions. By committing to sharing knowledge, emphasizing transparency and integrating the outsourcing team into their organizations, customers from the product software business can realize the benefits of global outsourcing.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00648.x" xmlns="http://purl.org/rss/1.0/"><title>Business goals, user needs, and requirements: A problem frame-based view</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00648.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Business goals, user needs, and requirements: A problem frame-based view</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Luigi Lavazza</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-17T19:27:20.965843-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00648.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00648.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00648.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>It is well known that the analysis of requirements involves several stakeholders and perspectives. Very often several points of view at different abstraction levels have to be taken into account: all these features make requirements analysis a complex task. Such intrinsic complexity makes it difficult to understand several of the basic concepts that underlie requirements engineering. Actually, there is some confusion – especially in industry – about what really a user requirement is, what are the differences between user requirements and user needs, and what are their relationships with business processes. The paper aims at clarifying the aforementioned issues, by providing a systematic and clear method for establishing requirements hierarchies. The problem of describing requirements hierarchies is tackled using the problem frames concepts and notation. A case study is used throughout the paper to illustrate the proposed approach. The description of requirements at different levels of abstractions and requirements hierarchies are illustrated. The resulting models are coherent with the reference model for requirements specifications and the problem frames. An analysis process that is aware of the differences between user needs and requirements is also provided, to illustrate the process of refining high-level goals into requirements that can be satisfied by a hardware/software machine. The proposed method appears promising to model, study, and evaluate the relationships between business processes and the strategies for achieving business goals based on the usage of information technology.</p></div>
]]></content:encoded><description>

It is well known that the analysis of requirements involves several stakeholders and perspectives. Very often several points of view at different abstraction levels have to be taken into account: all these features make requirements analysis a complex task. Such intrinsic complexity makes it difficult to understand several of the basic concepts that underlie requirements engineering. Actually, there is some confusion – especially in industry – about what really a user requirement is, what are the differences between user requirements and user needs, and what are their relationships with business processes. The paper aims at clarifying the aforementioned issues, by providing a systematic and clear method for establishing requirements hierarchies. The problem of describing requirements hierarchies is tackled using the problem frames concepts and notation. A case study is used throughout the paper to illustrate the proposed approach. The description of requirements at different levels of abstractions and requirements hierarchies are illustrated. The resulting models are coherent with the reference model for requirements specifications and the problem frames. An analysis process that is aware of the differences between user needs and requirements is also provided, to illustrate the process of refining high-level goals into requirements that can be satisfied by a hardware/software machine. The proposed method appears promising to model, study, and evaluate the relationships between business processes and the strategies for achieving business goals based on the usage of information technology.
</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12000" xmlns="http://purl.org/rss/1.0/"><title>Neurofuzzy models to automate the grading of old-age depression</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12000</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Neurofuzzy models to automate the grading of old-age depression</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Subhagata Chattopadhyay</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-17T19:25:26.692889-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12000</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12000</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12000</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p><em>Manual grading of depression is sometimes difficult due to the subjective signs-symptoms. The aim of this paper is to automate the process of depression grading using a neurofuzzy model (NFM)</em>. <em>Two hundred and seventy real-world depression cases are considered in this work. Each case has seven symptoms, which are obtained according to DSM-IV-TR. Each case is graded as ‘mild’ or ‘moderate’. However, in practice, the boundaries of ‘mild’ and ‘moderate’ grading are fuzzy in nature. The paper attempts to solve this fuzzy overlapping zone of these grades. To reduce the number of symptoms, significantly correlated symptoms are mined using a paired t-test. Then, two NFMs have been developed</em>.<em>NFM-1 has been developed with all seven symptoms, while only significantly correlated symptoms have been used to construct the NFM-2 model. Two fuzzy membership functions, such as triangular membership function (TRMF) and Gaussian membership function (GMF) have been considered to note with which better fuzzification could be achieved. The paper concludes that NFM-1 with GMF is the best model with average predicting accuracy of 94.4% and robustness</em>.</p></div>]]></content:encoded><description>

Manual grading of depression is sometimes difficult due to the subjective signs-symptoms. The aim of this paper is to automate the process of depression grading using a neurofuzzy model (NFM). Two hundred and seventy real-world depression cases are considered in this work. Each case has seven symptoms, which are obtained according to DSM-IV-TR. Each case is graded as ‘mild’ or ‘moderate’. However, in practice, the boundaries of ‘mild’ and ‘moderate’ grading are fuzzy in nature. The paper attempts to solve this fuzzy overlapping zone of these grades. To reduce the number of symptoms, significantly correlated symptoms are mined using a paired t-test. Then, two NFMs have been developed.NFM-1 has been developed with all seven symptoms, while only significantly correlated symptoms have been used to construct the NFM-2 model. Two fuzzy membership functions, such as triangular membership function (TRMF) and Gaussian membership function (GMF) have been considered to note with which better fuzzification could be achieved. The paper concludes that NFM-1 with GMF is the best model with average predicting accuracy of 94.4% and robustness.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00651.x" xmlns="http://purl.org/rss/1.0/"><title>The data warehouse virtualization framework for operational business intelligence</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00651.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">The data warehouse virtualization framework for operational business intelligence</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Farrah Farooq</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-07T06:24:29.624377-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00651.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00651.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00651.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In order to explore the most current information and react faster to changing business conditions, organizations consider real-time data warehousing a powerful technique to achieve operational business intelligence (BI). We propose in this paper a novel real-time data warehouse (RTDW) framework based on the virtualization concept. Our approach introduces a conceptual modelling technique, known as ring modelling, for real-time data management and multidimensional analysis. This technique produces a flexible semi-structured data model that accommodates unknown business process data and relationships as they evolve, handles schema changes and aggregate-management efficiently, and scales well with the large size of increasing data volumes. With the help of a telecommunication business example, We evaluated our proposed approach in an extensive experimental study where we compared our approach Ring Model with existing structured multidimensional conceptual models (MCMs), i.e. relational OLAP and multidimensional OLAP, and with semi-structured MCM, i.e. XML Cubes, in terms of scalability, data storage estimations, data updates loading time, and query response times. Our performance results show that encouraging speedups are achieved.</p></div>]]></content:encoded><description>

In order to explore the most current information and react faster to changing business conditions, organizations consider real-time data warehousing a powerful technique to achieve operational business intelligence (BI). We propose in this paper a novel real-time data warehouse (RTDW) framework based on the virtualization concept. Our approach introduces a conceptual modelling technique, known as ring modelling, for real-time data management and multidimensional analysis. This technique produces a flexible semi-structured data model that accommodates unknown business process data and relationships as they evolve, handles schema changes and aggregate-management efficiently, and scales well with the large size of increasing data volumes. With the help of a telecommunication business example, We evaluated our proposed approach in an extensive experimental study where we compared our approach Ring Model with existing structured multidimensional conceptual models (MCMs), i.e. relational OLAP and multidimensional OLAP, and with semi-structured MCM, i.e. XML Cubes, in terms of scalability, data storage estimations, data updates loading time, and query response times. Our performance results show that encouraging speedups are achieved.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00649.x" xmlns="http://purl.org/rss/1.0/"><title>Managing knowledge on communication and information flow in global software projects</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00649.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Managing knowledge on communication and information flow in global software projects</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Kai Stapel, Kurt Schneider</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-07T06:23:26.988808-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00649.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00649.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00649.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Aricle</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p><em>Communication is a key success factor of distributed software projects. Poor communication has been identified as a main obstacle to successful collaboration. Global projects are especially endangered by information gaps between collaborating sites. Different communication styles, technical equipment, and missing awareness of each other can cause severe problems. Knowledge about actual and desired channels, paths, and modes of communication is required for improving communication in a globally distributed project. However, many project participants know little about communication and information flow in their projects. In this contribution, we focus on knowledge about communication and information flow. It is acquired by modelling on-going and desired flows of information, including documented and non-documented channels of information flow. We analyzed a distributed software project from the information flow perspective. Based on the findings, we developed specific techniques to improve information flow in distributed software development according to the FLOW Method. In a second distributed project, we evaluated one of the techniques. We found the FLOW mapping technique to be suitable for effectively spreading knowledge about communication and information flow in global software projects</em>.</p></div>]]></content:encoded><description>

Communication is a key success factor of distributed software projects. Poor communication has been identified as a main obstacle to successful collaboration. Global projects are especially endangered by information gaps between collaborating sites. Different communication styles, technical equipment, and missing awareness of each other can cause severe problems. Knowledge about actual and desired channels, paths, and modes of communication is required for improving communication in a globally distributed project. However, many project participants know little about communication and information flow in their projects. In this contribution, we focus on knowledge about communication and information flow. It is acquired by modelling on-going and desired flows of information, including documented and non-documented channels of information flow. We analyzed a distributed software project from the information flow perspective. Based on the findings, we developed specific techniques to improve information flow in distributed software development according to the FLOW Method. In a second distributed project, we evaluated one of the techniques. We found the FLOW mapping technique to be suitable for effectively spreading knowledge about communication and information flow in global software projects.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00654.x" xmlns="http://purl.org/rss/1.0/"><title>Higher order spectra analysis of breast thermograms for the automated identification of breast cancer</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00654.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Higher order spectra analysis of breast thermograms for the automated identification of breast cancer</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">U. Rajendra Acharya, E.Y.K. Ng, S. Vinitha Sree, Chua Kuang Chua, Subhagata Chattopadhyay</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-07T06:23:13.015195-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00654.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00654.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00654.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Breast cancer is a leading cancer affecting women worldwide. Mammography is a scanning procedure involvingX-rays of the breast. It causes discomfort and may cause high incidence of false negatives. Breast thermography is a new screening method of breast that helps in the early detection of cancer. It is a non-invasive imaging procedure that captures the infrared heat radiating off from the breast surface using an infrared camera. The main objective of this work is to evaluate the use of higher order spectral features extracted from thermograms in classifying normal and abnormal thermograms. For this purpose, we extracted five higher order spectral features and used them in a feed-forward artificial neural network (ANN) classifier and a support vector machine (SVM). Fifty thermograms (25 each of normal and abnormal) were used for analysis.SVM presented a good sensitivity of 76% and specificity of 84%, and theANN classifier demonstrated higher values of sensitivity (92%) and specificity (88%). The proposed system, therefore, shows great promise in automatic classification of normal and abnormal breast thermograms without the need for subjective interpretation.</p></div>]]></content:encoded><description>

Breast cancer is a leading cancer affecting women worldwide. Mammography is a scanning procedure involvingX-rays of the breast. It causes discomfort and may cause high incidence of false negatives. Breast thermography is a new screening method of breast that helps in the early detection of cancer. It is a non-invasive imaging procedure that captures the infrared heat radiating off from the breast surface using an infrared camera. The main objective of this work is to evaluate the use of higher order spectral features extracted from thermograms in classifying normal and abnormal thermograms. For this purpose, we extracted five higher order spectral features and used them in a feed-forward artificial neural network (ANN) classifier and a support vector machine (SVM). Fifty thermograms (25 each of normal and abnormal) were used for analysis.SVM presented a good sensitivity of 76% and specificity of 84%, and theANN classifier demonstrated higher values of sensitivity (92%) and specificity (88%). The proposed system, therefore, shows great promise in automatic classification of normal and abnormal breast thermograms without the need for subjective interpretation.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00645.x" xmlns="http://purl.org/rss/1.0/"><title>Classification of fuzzy data based on the support vector machines</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00645.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Classification of fuzzy data based on the support vector machines</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yahya Forghani, Hadi Sadoghi Yazdi, Sohrab Effati</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-07T06:22:54.215404-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00645.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00645.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00645.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p><em>Data may be afflicted with uncertainty. Uncertain data may be shown by an interval value or in general by a fuzzy set. A number of classification methods have considered uncertainty in features of samples. Some of these classification methods are extended version of the support vector machines (SVMs), such as the Interval-SVM (ISVM), Holder-ISVM and Distance-ISVM, which are used to obtain a classifier for separating samples whose features are interval values</em>. <em>In this paper, we extend the SVM for robust classification of linear/non-linear separable data whose features are fuzzy numbers. The support of such training data is shown by a hypercube. Our proposed method tries to obtain a hyperplane (in the input space or in a high-dimensional feature space) such that the nearest point of the hypercube of each training sample to the hyperplane is separated with the widest symmetric margin. This strategy can reduce the misclassification probability of our proposed method</em>. <em>Our experimental results on six real data sets show that the classification rate of our novel method is better than or equal to the classification rate of the well-known SVM, ISVM, Holder-ISVM and Distance-ISVM for all of these data sets</em>.</p></div>]]></content:encoded><description>

Data may be afflicted with uncertainty. Uncertain data may be shown by an interval value or in general by a fuzzy set. A number of classification methods have considered uncertainty in features of samples. Some of these classification methods are extended version of the support vector machines (SVMs), such as the Interval-SVM (ISVM), Holder-ISVM and Distance-ISVM, which are used to obtain a classifier for separating samples whose features are interval values. In this paper, we extend the SVM for robust classification of linear/non-linear separable data whose features are fuzzy numbers. The support of such training data is shown by a hypercube. Our proposed method tries to obtain a hyperplane (in the input space or in a high-dimensional feature space) such that the nearest point of the hypercube of each training sample to the hyperplane is separated with the widest symmetric margin. This strategy can reduce the misclassification probability of our proposed method. Our experimental results on six real data sets show that the classification rate of our novel method is better than or equal to the classification rate of the well-known SVM, ISVM, Holder-ISVM and Distance-ISVM for all of these data sets.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00631.x" xmlns="http://purl.org/rss/1.0/"><title>Reusing knowledge in embedded systems modelling</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00631.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Reusing knowledge in embedded systems modelling</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jelena Marincic, Angelika Mader, Roel Wieringa, Yan Lucas</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-30T21:03:32.340375-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00631.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00631.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00631.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Model-based design is a promising technique to improve the quality of software and the efficiency of the software development process. We are investigating how to efficiently model embedded software and its environment to verify the requirements for the system controlled by the software. The software environment consists of mechanical, electrical and other parts; modelling it involves learning how these parts work, deciding what is relevant to model and how to model it. It is not possible to fully automate these steps. There are general guidelines, but given that every modelling problem differs, much is left to the modeller's own preference, background and experience. Still, when the next generation of a system is designed, the new system will have common elements with its previous version. Therefore, lessons learned from the current model could inform future models. We propose a framework for identifying the non-formal elements of knowledge, insights and a model itself, which can support modelling of the next system generation. We will present the application of our framework on an action research case – modelling mechanical parts of a paper-inserting machine.</p></div>]]></content:encoded><description>

Model-based design is a promising technique to improve the quality of software and the efficiency of the software development process. We are investigating how to efficiently model embedded software and its environment to verify the requirements for the system controlled by the software. The software environment consists of mechanical, electrical and other parts; modelling it involves learning how these parts work, deciding what is relevant to model and how to model it. It is not possible to fully automate these steps. There are general guidelines, but given that every modelling problem differs, much is left to the modeller's own preference, background and experience. Still, when the next generation of a system is designed, the new system will have common elements with its previous version. Therefore, lessons learned from the current model could inform future models. We propose a framework for identifying the non-formal elements of knowledge, insights and a model itself, which can support modelling of the next system generation. We will present the application of our framework on an action research case – modelling mechanical parts of a paper-inserting machine.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00641.x" xmlns="http://purl.org/rss/1.0/"><title>Fuzzy machine vision based clip detection</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00641.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Fuzzy machine vision based clip detection</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Pejman Mehran, Kudret Demirli, Brian Surgenor</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-30T20:52:26.194996-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00641.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00641.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00641.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper describes the use of an objective fuzzy approach for fast and accurate vision-based inspection. An inspection problem faced by a Canadian automotive parts manufacturer is being used as a case study. The problem is related to a vision system that is being operated to confirm the placement of metal fastening clips on a structural member that supports a truck dash panel. The manufacturer was interested in identifying the presence or absence of metal clips inserted by a robot arm. It took the manufacturer over 8 months to tune its commercial machine vision system to detect missing clips and yet the accuracy and efficiency of the system are being questioned. Five different universities across Canada have been working in parallel on this problem over a time span of 2 years. To this end, we developed an efficient fuzzy model after trying various statistical approaches. The proposed model properly identifies all the images in a database containing 1910 images. The robustness of the fuzzy model is confirmed by its strong performance on the entire database.</p></div>]]></content:encoded><description>

This paper describes the use of an objective fuzzy approach for fast and accurate vision-based inspection. An inspection problem faced by a Canadian automotive parts manufacturer is being used as a case study. The problem is related to a vision system that is being operated to confirm the placement of metal fastening clips on a structural member that supports a truck dash panel. The manufacturer was interested in identifying the presence or absence of metal clips inserted by a robot arm. It took the manufacturer over 8 months to tune its commercial machine vision system to detect missing clips and yet the accuracy and efficiency of the system are being questioned. Five different universities across Canada have been working in parallel on this problem over a time span of 2 years. To this end, we developed an efficient fuzzy model after trying various statistical approaches. The proposed model properly identifies all the images in a database containing 1910 images. The robustness of the fuzzy model is confirmed by its strong performance on the entire database.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00642.x" xmlns="http://purl.org/rss/1.0/"><title>Forecasting business failure using two-stage ensemble of multivariate discriminant analysis and logistic regression</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00642.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Forecasting business failure using two-stage ensemble of multivariate discriminant analysis and logistic regression</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hui Li, Jie Sun, Ji-Cai Li, Xiu-Ying Yan</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-30T20:39:34.10042-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00642.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00642.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00642.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>A major drawback associated with the use of classical statistical methods for business failure prediction on top of financial distress is their lack of high accuracy rate. This work analyses the use of the two-stage ensemble of multivariate discriminant analysis (MDA) and logit to improve predictive performance of classical statistical methods. All possible ratios are firstly built from the quantities involved and then the three common filters, that is stepwise MDA, stepwise logit, and t-test, are used to choose another three convenient subsets of ratios. Four principal components spaces (PCSs) are, respectively, produced on the four different feature spaces by using principal components analysis. MDA and logit are used to produce predictions on the four PCSs. After that, two levels of ensemble are implemented: one based on predictions inside each of the same type of model (i.e. MDA or logit) and another based on the former two ensembles and one best model. Each of the eight models is weighted on the base of ranking order information of its predictive accuracy in ensemble by majority voting. MDA and logit and the new challenge model of support vector machine respectively in their best standalone modes are used for comparisons. Empirical results indicate that the two-stage ensemble of MDA and logit compares favourably with the three comparative models and all its component models.</p></div>]]></content:encoded><description>

A major drawback associated with the use of classical statistical methods for business failure prediction on top of financial distress is their lack of high accuracy rate. This work analyses the use of the two-stage ensemble of multivariate discriminant analysis (MDA) and logit to improve predictive performance of classical statistical methods. All possible ratios are firstly built from the quantities involved and then the three common filters, that is stepwise MDA, stepwise logit, and t-test, are used to choose another three convenient subsets of ratios. Four principal components spaces (PCSs) are, respectively, produced on the four different feature spaces by using principal components analysis. MDA and logit are used to produce predictions on the four PCSs. After that, two levels of ensemble are implemented: one based on predictions inside each of the same type of model (i.e. MDA or logit) and another based on the former two ensembles and one best model. Each of the eight models is weighted on the base of ranking order information of its predictive accuracy in ensemble by majority voting. MDA and logit and the new challenge model of support vector machine respectively in their best standalone modes are used for comparisons. Empirical results indicate that the two-stage ensemble of MDA and logit compares favourably with the three comparative models and all its component models.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00653.x" xmlns="http://purl.org/rss/1.0/"><title>Towards a framework for multiple artificial neural network topologies validation by means of statistics</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00653.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Towards a framework for multiple artificial neural network topologies validation by means of statistics</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Israel Gonzalez-Carrasco, Angel Garcia-Crespo, Belen Ruiz-Mezcua, Jose Luis Lopez-Cuadrado, Ricardo Colomo-Palacios</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-30T08:08:59.861056-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00653.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00653.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00653.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Artificial neural networks (ANNs) are flexible computing tools that have been applied to a wide range of domains with a notable level of accuracy. However, there are multiple choices of ANNs classifiers in the literature that produce dissimilar results. As a consequence of this, the selection of this classifier is crucial for the overall performance of the system. In this work, an integral framework is proposed for the optimization of different ANN classifiers based on statistical hypothesis testing. The framework is tested in a real ballistic scenario. The new quality measures introduced, based on the Student t-test, and employed throughout the framework, ensure the validity of results from a statistical standpoint; they reduce the appearance of experimental errors or the appearance of possible randomness. Results show the relevance of this framework, proving that its application improves the performance and efficiency of multiple classifiers.</p></div>]]></content:encoded><description>

Artificial neural networks (ANNs) are flexible computing tools that have been applied to a wide range of domains with a notable level of accuracy. However, there are multiple choices of ANNs classifiers in the literature that produce dissimilar results. As a consequence of this, the selection of this classifier is crucial for the overall performance of the system. In this work, an integral framework is proposed for the optimization of different ANN classifiers based on statistical hypothesis testing. The framework is tested in a real ballistic scenario. The new quality measures introduced, based on the Student t-test, and employed throughout the framework, ensure the validity of results from a statistical standpoint; they reduce the appearance of experimental errors or the appearance of possible randomness. Results show the relevance of this framework, proving that its application improves the performance and efficiency of multiple classifiers.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00650.x" xmlns="http://purl.org/rss/1.0/"><title>Developing a tool for intellectual capital assessment: an individual-level perspective</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00650.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Developing a tool for intellectual capital assessment: an individual-level perspective</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Matteo Mura, Mariolina Longo</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-29T21:11:50.136916-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00650.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00650.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00650.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper aims to develop a model for assessing and valuing the intellectual capital of an organization by gathering data from individual employees. Also, the paper empirically investigates the relationship between intellectual capital and a specific dimension of employees’ performance. Two surveys were conducted on employees of a leading company in the Italian food product market. The sample analysed comprises 1117 observations. A structural equation modelling (SEM) methodology was used to define the measurement model and to determine the relations between intellectual capital and employees’ performance. The model for intellectual capital assessment developed in this paper may integrate already existing intellectual capital frameworks. The three dimensions of intellectual capital identified mutually affect and have a positive effect on employees’ performance. Our findings contribute to the discussion in the promising research stream of intellectual capital management. As limitations, this study focuses on a single company, and it exclusively adopts individual-level perceptual indicators. These elements make it difficult for any inter-company comparison.</p></div>]]></content:encoded><description>

This paper aims to develop a model for assessing and valuing the intellectual capital of an organization by gathering data from individual employees. Also, the paper empirically investigates the relationship between intellectual capital and a specific dimension of employees’ performance. Two surveys were conducted on employees of a leading company in the Italian food product market. The sample analysed comprises 1117 observations. A structural equation modelling (SEM) methodology was used to define the measurement model and to determine the relations between intellectual capital and employees’ performance. The model for intellectual capital assessment developed in this paper may integrate already existing intellectual capital frameworks. The three dimensions of intellectual capital identified mutually affect and have a positive effect on employees’ performance. Our findings contribute to the discussion in the promising research stream of intellectual capital management. As limitations, this study focuses on a single company, and it exclusively adopts individual-level perceptual indicators. These elements make it difficult for any inter-company comparison.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00647.x" xmlns="http://purl.org/rss/1.0/"><title>Application of generally weighted moving average method to tracking signal state space model</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00647.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Application of generally weighted moving average method to tracking signal state space model</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Cheng-Yi Lin, Shey-Huei Sheu, Tsung-Shin Hsu, Yan-Chun Chen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-29T21:05:23.396518-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00647.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00647.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00647.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p><em>In predicting time series, if a trend includes a structural break, then a state space model can be applied to revise the predictive method. Some scholars suggest that restricted damped trend models yield excellent prediction results by automatically revising unforeseen structural break factors in the prediction process. Restricted damped trend models add a smoothed error statistic to a local-level model and use the exponentially weighted moving average (EWMA) method to make corrections. This paper applies the generally weighted moving average (GWMA) concept and method to a restricted damped trend model that changes the smoothed error statistic from the EWMA form to the GWMA form and adds the correction parameter</em> λ, <em>which distinguishes three situations</em> λ &lt; 1 , λ = 1 , <em>and</em> λ &gt; 1 . <em>The original restricted damped trend model applies only to</em> λ = 1 , <em>enabling the model to capture situations in which</em> λ &lt; 1 <em>and</em> λ &gt; 1 <em>increases its generality. This paper also compares the effect of various parameter values on the predictive model and finds the range of parameter settings that optimize the model</em>.</p></div>]]></content:encoded><description>

In predicting time series, if a trend includes a structural break, then a state space model can be applied to revise the predictive method. Some scholars suggest that restricted damped trend models yield excellent prediction results by automatically revising unforeseen structural break factors in the prediction process. Restricted damped trend models add a smoothed error statistic to a local-level model and use the exponentially weighted moving average (EWMA) method to make corrections. This paper applies the generally weighted moving average (GWMA) concept and method to a restricted damped trend model that changes the smoothed error statistic from the EWMA form to the GWMA form and adds the correction parameter λ, which distinguishes three situations λ &lt; 1 , λ = 1 , and λ &gt; 1 . The original restricted damped trend model applies only to λ = 1 , enabling the model to capture situations in which λ &lt; 1 and λ &gt; 1 increases its generality. This paper also compares the effect of various parameter values on the predictive model and finds the range of parameter settings that optimize the model.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00643.x" xmlns="http://purl.org/rss/1.0/"><title>Forward stage-wise ensemble regression algorithm to improve base regressors prediction ability: an empirical study</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00643.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Forward stage-wise ensemble regression algorithm to improve base regressors prediction ability: an empirical study</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Akın Özçift</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-29T05:43:56.887413-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00643.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00643.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00643.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Analysis of scientific data requires accurate regressor algorithms to decrease prediction errors. Lots of machine learning algorithms, that is, neural networks, rule-based algorithms, regression trees and some kinds of lazy learners, are used to realize this need. In recent years, different ensemble regression strategies were improved to obtain enhanced predictors with lower forecasting errors. Ensemble algorithms combine good models that make errors in different parts of analyzed data. There are mainly two approaches in ensemble regression algorithm generation; boosting and bagging. The aim of this article is to evaluate a boosting-based ensemble approach, forward stage-wise additive modelling (FSAM), to improve some widely used base regressors’ prediction ability. We used 10 regression algorithms in four different types to make predictions on 10 diverse data from different scientific areas and we compared the experimental results in terms of correlation coefficient, mean absolute error, and root mean squared error metrics. Furthermore, we made use of scatter plots to demonstrate the effect of ensemble modelling on the prediction accuracies of evaluated algorithms. We empirically obtained that in general FSAM enhances the accuracies of base regressors or it at least maintains the base regressor performance.</p></div>]]></content:encoded><description>

Analysis of scientific data requires accurate regressor algorithms to decrease prediction errors. Lots of machine learning algorithms, that is, neural networks, rule-based algorithms, regression trees and some kinds of lazy learners, are used to realize this need. In recent years, different ensemble regression strategies were improved to obtain enhanced predictors with lower forecasting errors. Ensemble algorithms combine good models that make errors in different parts of analyzed data. There are mainly two approaches in ensemble regression algorithm generation; boosting and bagging. The aim of this article is to evaluate a boosting-based ensemble approach, forward stage-wise additive modelling (FSAM), to improve some widely used base regressors’ prediction ability. We used 10 regression algorithms in four different types to make predictions on 10 diverse data from different scientific areas and we compared the experimental results in terms of correlation coefficient, mean absolute error, and root mean squared error metrics. Furthermore, we made use of scatter plots to demonstrate the effect of ensemble modelling on the prediction accuracies of evaluated algorithms. We empirically obtained that in general FSAM enhances the accuracies of base regressors or it at least maintains the base regressor performance.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00644.x" xmlns="http://purl.org/rss/1.0/"><title>Flood forecasting at the Dadu River in China based on ANN</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00644.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Flood forecasting at the Dadu River in China based on ANN</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Li-Hua Feng</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-29T05:38:43.54851-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00644.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00644.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00644.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Mappings of the stimuli effects and the input and output estimates of artificial neural networks (ANN) are obtained via combinations of nonlinear functions. This approach offers the advantages of self-learning, self-organization, self-adaptation, and fault tolerance as well as the potential for use in flood forecasting applications. Furthermore, the ANN technology allows the use of multiple variables in both the input and output layers. This capability is very important for flood calculation because the stage, discharge, and other hydrological variables often are functions of many influential variables. Herein, we propose a flood forecasting system with related application, based on ANN. This method offers better performance and efficiency.</p></div>]]></content:encoded><description>

Mappings of the stimuli effects and the input and output estimates of artificial neural networks (ANN) are obtained via combinations of nonlinear functions. This approach offers the advantages of self-learning, self-organization, self-adaptation, and fault tolerance as well as the potential for use in flood forecasting applications. Furthermore, the ANN technology allows the use of multiple variables in both the input and output layers. This capability is very important for flood calculation because the stage, discharge, and other hydrological variables often are functions of many influential variables. Herein, we propose a flood forecasting system with related application, based on ANN. This method offers better performance and efficiency.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00646.x" xmlns="http://purl.org/rss/1.0/"><title>Effects of the correlation model, the trend model, and the number of training points on the accuracy of Kriging metamodels</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00646.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Effects of the correlation model, the trend model, and the number of training points on the accuracy of Kriging metamodels</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Erdem Acar</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-29T05:38:41.049358-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00646.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00646.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00646.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper explores the effects of the correlation model, the trend model, and the number of training points on the accuracy of Kriging metamodels. Gaussian correlation models are found to be superior to exponential and linear correlation models. No particular trend model is found to be better than the other models. The number of training points used in constructing the Kriging metamodels is observed to change the relative performances of the trend and the correlation functions. The leave-one-out cross-validation error is found to become a better surrogate for the actual error, as the number of training points is increased. Finally, the use of an ensemble of metamodels is discussed and it is found that using an ensemble may improve the accuracy.</p></div>]]></content:encoded><description>

This paper explores the effects of the correlation model, the trend model, and the number of training points on the accuracy of Kriging metamodels. Gaussian correlation models are found to be superior to exponential and linear correlation models. No particular trend model is found to be better than the other models. The number of training points used in constructing the Kriging metamodels is observed to change the relative performances of the trend and the correlation functions. The leave-one-out cross-validation error is found to become a better surrogate for the actual error, as the number of training points is increased. Finally, the use of an ensemble of metamodels is discussed and it is found that using an ensemble may improve the accuracy.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00632.x" xmlns="http://purl.org/rss/1.0/"><title>Deriving problem frames from business process and object analysis models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00632.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Deriving problem frames from business process and object analysis models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xinyu Wang, Jie Sun, Xiaohu Yang, Ye Wang, Shanping Li, Aleksander J. Kavs</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-10T00:45:56.97326-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00632.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00632.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00632.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>While Problem Frames have become a useful approach for requirements analysis, little research has been made to explore how to derive them from a complex problem context. The purpose of this paper is to propose such an approach. The proposed approach consists of three steps to drive the development of Problem Frames. In the first step, business process models are developed to capture the behavioural view of the problem context. In the second step, object analysis models are used to capture the structural view of the problem context. Together, these two views collectively and adequately capture the early context knowledge. These two types of model will then be used in the third step to construct context diagrams and derive Problem Frames. A complex real-world problem – equity trading problem – is used to illustrate this approach.</p></div>]]></content:encoded><description>

While Problem Frames have become a useful approach for requirements analysis, little research has been made to explore how to derive them from a complex problem context. The purpose of this paper is to propose such an approach. The proposed approach consists of three steps to drive the development of Problem Frames. In the first step, business process models are developed to capture the behavioural view of the problem context. In the second step, object analysis models are used to capture the structural view of the problem context. Together, these two views collectively and adequately capture the early context knowledge. These two types of model will then be used in the third step to construct context diagrams and derive Problem Frames. A complex real-world problem – equity trading problem – is used to illustrate this approach.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00635.x" xmlns="http://purl.org/rss/1.0/"><title>A hybrid neural network/genetic algorithm applied to breast cancer detection and recurrence</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00635.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A hybrid neural network/genetic algorithm applied to breast cancer detection and recurrence</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Smaranda Belciug, Florin Gorunescu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T22:51:12.955553-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00635.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00635.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00635.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Genetic algorithms (GAs) and neural networks (NNs) are both inspired by computation in biological systems and many attempts have been made to combine the two methodologies to boost the NNs performance. This paper deals with the evolutionary training of a feedforward NN for both breast cancer detection and recurrence. A multi-layer perceptron (MLP) has been designed for this purpose, using a GA routine to set weights, and a Java implementation of this hybrid model has been made. Four databases concerning cancer detection and recurrence have been used, two databases containing numerical attributes only, one database containing ordinal (categorical) attributes solely and one database with mixed attributes. In comparison to some standard NNs, the performance of this approach using the same databases is shown to be superior. Moreover, this hybrid MLP/GA model is very flexible in terms of providing accurate classification, even with different types of attributes, which is usually found in medical studies.</p></div>]]></content:encoded><description>

Genetic algorithms (GAs) and neural networks (NNs) are both inspired by computation in biological systems and many attempts have been made to combine the two methodologies to boost the NNs performance. This paper deals with the evolutionary training of a feedforward NN for both breast cancer detection and recurrence. A multi-layer perceptron (MLP) has been designed for this purpose, using a GA routine to set weights, and a Java implementation of this hybrid model has been made. Four databases concerning cancer detection and recurrence have been used, two databases containing numerical attributes only, one database containing ordinal (categorical) attributes solely and one database with mixed attributes. In comparison to some standard NNs, the performance of this approach using the same databases is shown to be superior. Moreover, this hybrid MLP/GA model is very flexible in terms of providing accurate classification, even with different types of attributes, which is usually found in medical studies.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00639.x" xmlns="http://purl.org/rss/1.0/"><title>Game theory-based influence diagrams</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00639.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Game theory-based influence diagrams</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Lihua Zhou, Kevin Lü, Weiyi Liu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T22:40:29.411566-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00639.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00639.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00639.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Many decisions are made in interactive situations in which decision makers interact and may also affect each other's decision outcomes. In order to model decision makings in such interactive situations, this paper incorporates game theory into influence diagrams and presents a new approach, called game theory-based influence diagrams (GIDs). GIDs consider an extra factor, that of the choice of strategies made by other decision makers, to the list of determinants that influence the decision-making process of each decision maker, so that decision makers can make more rational decisions. As a result of integrating influence diagrams and game theory, GIDs benefit from the simplicity and efficiency of influence diagrams for modelling complex decision problems as well as the rationality and suitability of applying game theory for making decisions in dynamic interactive scenarios. This paper also introduces genetic algorithm-based methods to evaluate GIDs. Experimental studies have been performed for validation and evaluation.</p></div>]]></content:encoded><description>

Many decisions are made in interactive situations in which decision makers interact and may also affect each other's decision outcomes. In order to model decision makings in such interactive situations, this paper incorporates game theory into influence diagrams and presents a new approach, called game theory-based influence diagrams (GIDs). GIDs consider an extra factor, that of the choice of strategies made by other decision makers, to the list of determinants that influence the decision-making process of each decision maker, so that decision makers can make more rational decisions. As a result of integrating influence diagrams and game theory, GIDs benefit from the simplicity and efficiency of influence diagrams for modelling complex decision problems as well as the rationality and suitability of applying game theory for making decisions in dynamic interactive scenarios. This paper also introduces genetic algorithm-based methods to evaluate GIDs. Experimental studies have been performed for validation and evaluation.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00636.x" xmlns="http://purl.org/rss/1.0/"><title>Using simple scenarios for wheelchair driving assistance</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00636.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Using simple scenarios for wheelchair driving assistance</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Baptiste Cablé, Sophie Loriette, Jean-Marc Nigro</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T22:29:11.82304-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00636.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00636.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00636.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Artificial intelligence can be used to recognize and anticipate dynamic situations. Several computational methods based on mathematical tools already exist, but most of the time their implementation is complex and takes a long time to execute.</p></div>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In this article, we propose another learning and anticipation method in order to assist users in dynamic situations. We call it ‘scenario-based reasoning’ algorithm. It is inspired by case-based reasoning. It works with symbolic data and its aim is to make real-time predictions. To do so, manipulated knowledge is specially designed to limit our solution's complexity and to facilitate learning and anticipation.</p></div>]]></content:encoded><description>

Artificial intelligence can be used to recognize and anticipate dynamic situations. Several computational methods based on mathematical tools already exist, but most of the time their implementation is complex and takes a long time to execute.
In this article, we propose another learning and anticipation method in order to assist users in dynamic situations. We call it ‘scenario-based reasoning’ algorithm. It is inspired by case-based reasoning. It works with symbolic data and its aim is to make real-time predictions. To do so, manipulated knowledge is specially designed to limit our solution's complexity and to facilitate learning and anticipation.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00637.x" xmlns="http://purl.org/rss/1.0/"><title>Cluster-based ensemble of classifiers</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00637.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Cluster-based ensemble of classifiers</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Ashfaqur Rahman, Brijesh Verma</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T22:18:34.030099-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00637.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00637.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00637.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p><em>This paper presents cluster-based ensemble classifier – an approach toward generating ensemble of classifiers using multiple clusters within classified data. Clustering is incorporated to partition data set into multiple clusters of highly correlated data that are difficult to separate otherwise and different base classifiers are used to learn class boundaries within the clusters. As the different base classifiers engage on different difficult</em>-<em>to</em>-<em>classify subsets of the data, the learning of the base classifiers is more focussed and accurate. A selection rather than fusion approach achieves the final verdict on patterns of unknown classes. The impact of clustering on the learning parameters and accuracy of a number of learning algorithms including neural network, support vector machine, decision tree and k</em>-<em>NN classifier is investigated. A number of benchmark data sets from the UCI machine learning repository were used to evaluate the cluster-based ensemble classifier and the experimental results demonstrate its superiority over bagging and boosting</em>.</p></div>]]></content:encoded><description>

This paper presents cluster-based ensemble classifier – an approach toward generating ensemble of classifiers using multiple clusters within classified data. Clustering is incorporated to partition data set into multiple clusters of highly correlated data that are difficult to separate otherwise and different base classifiers are used to learn class boundaries within the clusters. As the different base classifiers engage on different difficult-to-classify subsets of the data, the learning of the base classifiers is more focussed and accurate. A selection rather than fusion approach achieves the final verdict on patterns of unknown classes. The impact of clustering on the learning parameters and accuracy of a number of learning algorithms including neural network, support vector machine, decision tree and k-NN classifier is investigated. A number of benchmark data sets from the UCI machine learning repository were used to evaluate the cluster-based ensemble classifier and the experimental results demonstrate its superiority over bagging and boosting.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00638.x" xmlns="http://purl.org/rss/1.0/"><title>Neural network classification of aggregates by means of line laser based 3D acquisition</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00638.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Neural network classification of aggregates by means of line laser based 3D acquisition</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Mahmut Sinecen, Ali Topal, Metehan Makinaci, Bulent Baradan</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T21:54:48.479829-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00638.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00638.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00638.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This study focuses on the development of a new module for a more accurate determination of geometrical properties of aggregates. A laser-based imaging system has been developed for the shape characterization of aggregates by using various digital image analysis techniques. By using this system it is possible to create a three-dimensional (3D) image form of aggregate particles. The system has been optimized to minimize the possible errors during image capturing and processing. The aggregates were classified according to their shape properties as; round, flat, elongated, angular, sphere, and irregular during test procedures. Geometrical properties of each aggregate group were analysed in 3D spatial domain. 3D shape reconstruction and characterization of the aggregates were realized by using digital image processing and analysis techniques based on the laser imaging system. MatLab® Image Processing Toolbox and Neural Network Toolbox were used to extract typical features of the aggregates and classify them according to their geometrical properties. Among the classifier types, multi-layered perceptron that has two hidden layers revealed the best performance (95.83%). The selection and production of appropriate shaped aggregate for various construction purposes seems to be possible by this developed method.</p></div>]]></content:encoded><description>

This study focuses on the development of a new module for a more accurate determination of geometrical properties of aggregates. A laser-based imaging system has been developed for the shape characterization of aggregates by using various digital image analysis techniques. By using this system it is possible to create a three-dimensional (3D) image form of aggregate particles. The system has been optimized to minimize the possible errors during image capturing and processing. The aggregates were classified according to their shape properties as; round, flat, elongated, angular, sphere, and irregular during test procedures. Geometrical properties of each aggregate group were analysed in 3D spatial domain. 3D shape reconstruction and characterization of the aggregates were realized by using digital image processing and analysis techniques based on the laser imaging system. MatLab® Image Processing Toolbox and Neural Network Toolbox were used to extract typical features of the aggregates and classify them according to their geometrical properties. Among the classifier types, multi-layered perceptron that has two hidden layers revealed the best performance (95.83%). The selection and production of appropriate shaped aggregate for various construction purposes seems to be possible by this developed method.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00629.x" xmlns="http://purl.org/rss/1.0/"><title>A two-level detector of short-term unique changes in time series based on a similarity method</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00629.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A two-level detector of short-term unique changes in time series based on a similarity method</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Tomasz Pełech-Pilichowski, Jan T. Duda</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T21:54:42.475221-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00629.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00629.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00629.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In the paper, a novel two-level algorithm of time-series change detection is presented. In the first level, to identify non-stationary sequences in a processed signal, preliminary detection of events is performed with a short-term prediction comparison. In the second stage, to confirm the changes detected in the first level, a similarity method aimed at identification of unique changes is employed. The detection of changes in a non-stationary time series is discussed, implemented algorithms are described and the results produced on a sample four financial time series are shown. General conditions for implementing the proposed algorithm as an immune-like event detector are discussed.</p></div>]]></content:encoded><description>

In the paper, a novel two-level algorithm of time-series change detection is presented. In the first level, to identify non-stationary sequences in a processed signal, preliminary detection of events is performed with a short-term prediction comparison. In the second stage, to confirm the changes detected in the first level, a similarity method aimed at identification of unique changes is employed. The detection of changes in a non-stationary time series is discussed, implemented algorithms are described and the results produced on a sample four financial time series are shown. General conditions for implementing the proposed algorithm as an immune-like event detector are discussed.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00608.x" xmlns="http://purl.org/rss/1.0/"><title>Knowledge-related challenges and solutions in GSD</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00608.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Knowledge-related challenges and solutions in GSD</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Päivi Parviainen, Maarit Tihinen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-06-28T02:46:52.635097-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2011.00608.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2011.00608.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00608.x</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">no</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">no</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<div class="para" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib" xmlns="http://www.w3.org/1999/xhtml"><p><b>Abstract: </b> A number knowledge-related challenges may complicate the work in global software development (GSD) projects. In practice, even a small amount of missing knowledge may cause an activity to fail to create and transfer information which is critical to later functions, causing these later functions to fail. Thus, knowledge engineering holds a central role in order to succeed with globally distributed product development. Furthermore, examining the challenges faced in GSD from a cognitive perspective will help to find solutions that take into account the knowledge needs of different stakeholders in GSD and thus help to establish conditions for successful GSD projects. In this paper, we will discuss these challenges and solutions based on an extensive literature study and practical experience gained in several international projects over the last decade. Altogether, over 50 case studies were analysed. We analysed the challenges identified in the cases from a cognitive perspective for bridging and avoiding the knowledge gaps and, based on this analysis, we will present example solutions to address the challenges during the GSD projects. We will conclude that through understanding both the nature of GSD and the KE challenges in depth, it will be possible for organizations to make their distributed operations successful.</p></div>]]></content:encoded><description>Abstract:  A number knowledge-related challenges may complicate the work in global software development (GSD) projects. In practice, even a small amount of missing knowledge may cause an activity to fail to create and transfer information which is critical to later functions, causing these later functions to fail. Thus, knowledge engineering holds a central role in order to succeed with globally distributed product development. Furthermore, examining the challenges faced in GSD from a cognitive perspective will help to find solutions that take into account the knowledge needs of different stakeholders in GSD and thus help to establish conditions for successful GSD projects. In this paper, we will discuss these challenges and solutions based on an extensive literature study and practical experience gained in several international projects over the last decade. Altogether, over 50 case studies were analysed. We analysed the challenges identified in the cases from a cognitive perspective for bridging and avoiding the knowledge gaps and, based on this analysis, we will present example solutions to address the challenges during the GSD projects. We will conclude that through understanding both the nature of GSD and the KE challenges in depth, it will be possible for organizations to make their distributed operations successful.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00592.x" xmlns="http://purl.org/rss/1.0/"><title>Analysis and balance survey of discrete input-output systems under random environment</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00592.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Analysis and balance survey of discrete input-output systems under random environment</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xian-Min Geng, Liang Li, Yu-Chao Geng, Rong-Mei Cao</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-05-11T05:07:12.354819-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2011.00592.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2011.00592.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00592.x</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">no</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">no</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<div class="para" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib" xmlns="http://www.w3.org/1999/xhtml"><p><b>Abstract: </b> Under random environment, the balance survey is difficult in many fields, such as in the industrial structure, the economics, and the society. In this paper, we study the random dynamic input-output model with consumption, in which the time-delay is one; and analyze the existence of the balanced growth solution by the theory of Markov processes. We present a new criterion of the imbalanced survey, which is a positive right eigenvector of the expectation of a matrix associated with the input-output model. We also will prove that the collapse time is finite almost surely, which indicates that the random dynamic input-output model does not possess a balanced growth solution, and consequently, the economic system must be adjusted constantly.</p></div>]]></content:encoded><description>Abstract:  Under random environment, the balance survey is difficult in many fields, such as in the industrial structure, the economics, and the society. In this paper, we study the random dynamic input-output model with consumption, in which the time-delay is one; and analyze the existence of the balanced growth solution by the theory of Markov processes. We present a new criterion of the imbalanced survey, which is a positive right eigenvector of the expectation of a matrix associated with the input-output model. We also will prove that the collapse time is finite almost surely, which indicates that the random dynamic input-output model does not possess a balanced growth solution, and consequently, the economic system must be adjusted constantly.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2010.00578.x" xmlns="http://purl.org/rss/1.0/"><title>Multi-agent system for knowledge-based event recognition and composition</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2010.00578.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Multi-agent system for knowledge-based event recognition and composition</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Angel Rivas-Casado, Rafael Martinez-Tomás, Antonio Fernández-Caballero</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-03-09T20:35:54.176628-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2010.00578.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2010.00578.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2010.00578.x</prism:url><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">no</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">no</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<div class="para" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib" xmlns="http://www.w3.org/1999/xhtml"><p><b>Abstract: </b> This work presents a multi-agent system for knowledge-based high-level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi-sensory monitoring. A perception agent (plurisensory agent and visual agent)-based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre-defined patterns as higher-level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge-based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored.</p></div>]]></content:encoded><description>Abstract:  This work presents a multi-agent system for knowledge-based high-level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi-sensory monitoring. A perception agent (plurisensory agent and visual agent)-based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre-defined patterns as higher-level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge-based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12010" xmlns="http://purl.org/rss/1.0/"><title>Editorial to the ‘pattern recognition and artificial intelligence for human behaviour analysis' special section</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12010</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Editorial to the ‘pattern recognition and artificial intelligence for human behaviour analysis' special section</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Luca Iocchi, Andrea Prati, Roberto Vezzani</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-09T00:13:59.122679-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12010</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12010</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12010</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Editorial</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">99</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">100</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[]]></content:encoded><description/></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00610.x" xmlns="http://purl.org/rss/1.0/"><title>Human action recognition using an ensemble of body-part detectors</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00610.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Human action recognition using an ensemble of body-part detectors</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bhaskar Chakraborty, Andrew D. Bagdanov, Jordi Gonzàlez, Xavier Roca</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2011-08-28T21:02:03.70169-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2011.00610.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2011.00610.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2011.00610.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">101</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">114</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper describes an approach to human action recognition based on a probabilistic optimization model of body parts using hidden Markov model (HMM). Our method is able to distinguish between similar actions by only considering the body parts having major contribution to the actions, for example, legs for walking, jogging and running; arms for boxing, waving and clapping. We apply HMMs to model the stochastic movement of the body parts for action recognition. The HMM construction uses an ensemble of body-part detectors, followed by grouping of part detections, to perform human identification. Three example-based body-part detectors are trained to detect three components of the human body: the head, legs and arms. These detectors cope with viewpoint changes and self-occlusions through the use of ten sub-classifiers that detect body parts over a specific range of viewpoints. Each sub-classifier is a support vector machine trained on features selected for the discriminative power for each particular part/viewpoint combination. Grouping of these detections is performed using a simple geometric constraint model that yields a viewpoint-invariant human detector. We test our approach on three publicly available action datasets: the KTH dataset, Weizmann dataset and HumanEva dataset. Our results illustrate that with a simple and compact representation we can achieve robust recognition of human actions comparable to the most complex, state-of-the-art methods.</p></div>]]></content:encoded><description>

This paper describes an approach to human action recognition based on a probabilistic optimization model of body parts using hidden Markov model (HMM). Our method is able to distinguish between similar actions by only considering the body parts having major contribution to the actions, for example, legs for walking, jogging and running; arms for boxing, waving and clapping. We apply HMMs to model the stochastic movement of the body parts for action recognition. The HMM construction uses an ensemble of body-part detectors, followed by grouping of part detections, to perform human identification. Three example-based body-part detectors are trained to detect three components of the human body: the head, legs and arms. These detectors cope with viewpoint changes and self-occlusions through the use of ten sub-classifiers that detect body parts over a specific range of viewpoints. Each sub-classifier is a support vector machine trained on features selected for the discriminative power for each particular part/viewpoint combination. Grouping of these detections is performed using a simple geometric constraint model that yields a viewpoint-invariant human detector. We test our approach on three publicly available action datasets: the KTH dataset, Weizmann dataset and HumanEva dataset. Our results illustrate that with a simple and compact representation we can achieve robust recognition of human actions comparable to the most complex, state-of-the-art methods.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00622.x" xmlns="http://purl.org/rss/1.0/"><title>Social interactions by visual focus of attention in a three-dimensional environment</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00622.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Social interactions by visual focus of attention in a three-dimensional environment</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">L. Bazzani, M. Cristani, D. Tosato, M. Farenzena, G. Paggetti, G. Menegaz, V. Murino</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-06T01:45:25.770985-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00622.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00622.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00622.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">115</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">127</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In human behaviour analysis, the visual focus of attention (VFOA) of a person is a very important cue. VFOA detection is difficult, though, especially in a unconstrained and crowded environment, typical of video surveillance scenarios. In this paper, we estimate the VFOA by defining the Subjective View Frustum, which approximates the visual field of a person in a three-dimensional representation of the scene. This opens up to several intriguing behavioural investigations. In particular, we propose the Inter-Relation Pattern Matrix, which suggests possible social interactions between the people present in a scene. Theoretical justifications and experimental results substantiate the validity and the goodness of the analysis performed.</p></div>]]></content:encoded><description>

In human behaviour analysis, the visual focus of attention (VFOA) of a person is a very important cue. VFOA detection is difficult, though, especially in a unconstrained and crowded environment, typical of video surveillance scenarios. In this paper, we estimate the VFOA by defining the Subjective View Frustum, which approximates the visual field of a person in a three-dimensional representation of the scene. This opens up to several intriguing behavioural investigations. In particular, we propose the Inter-Relation Pattern Matrix, which suggests possible social interactions between the people present in a scene. Theoretical justifications and experimental results substantiate the validity and the goodness of the analysis performed.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12025" xmlns="http://purl.org/rss/1.0/"><title>Is tangled the new wicked?</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12025</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Is tangled the new wicked?</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jon G. Hall</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-09T00:13:59.122679-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/exsy.12025</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/exsy.12025</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fexsy.12025</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Editorial</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">128</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">128</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[]]></content:encoded><description/></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00625.x" xmlns="http://purl.org/rss/1.0/"><title>Eliciting and prioritizing quality requirements supported by ontologies: a case study using the ElicitO framework and tool</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00625.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Eliciting and prioritizing quality requirements supported by ontologies: a case study using the ElicitO framework and tool</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Taiseera Hazeem Al Balushi, Pedro R. Falcone Sampaio, Pericles Loucopoulos</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-09T21:40:44.983503-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00625.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00625.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00625.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">129</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">151</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>As software complexity grows and clients demand higher quality software, quality requirements can no longer be considered to be of secondary importance. Thus, eliciting, specifying, prioritizing and validating quality requirements is a prerequisite to the development of effective and efficient information systems. Despite the critical importance of quality requirements, there is a considerable gap in the breadth and depth of quality requirements engineering (RE) support in most RE approaches. In practice, it is often the case to have quality requirements considered as an afterthought in the systems development process. While there is a wealth of modelling techniques and tools for functional requirements, there is very limited support for quality requirements in RE. Support for quality requirements is usually ad-hoc, without clear guidelines on how to capture, specify and manage quality requirements and also without proper usage of standardized terminologies based on established quality models such as the ISO/IEC 9126 quality model. In this paper, we discuss a quality-driven RE framework and tool that applies knowledge management techniques and quality ontologies to support RE activities. The ontology implements the quality characteristics and metrics prescribed by the ISO/9126 quality model, providing a common vocabulary to address quality concerns/aspects across RE activities. We empirically validate how the framework and tool can be used to effectively support the requirements elicitation and prioritization activities through a case study addressing the development of an intranet portal project at the University of Manchester.</p></div>]]></content:encoded><description>

As software complexity grows and clients demand higher quality software, quality requirements can no longer be considered to be of secondary importance. Thus, eliciting, specifying, prioritizing and validating quality requirements is a prerequisite to the development of effective and efficient information systems. Despite the critical importance of quality requirements, there is a considerable gap in the breadth and depth of quality requirements engineering (RE) support in most RE approaches. In practice, it is often the case to have quality requirements considered as an afterthought in the systems development process. While there is a wealth of modelling techniques and tools for functional requirements, there is very limited support for quality requirements in RE. Support for quality requirements is usually ad-hoc, without clear guidelines on how to capture, specify and manage quality requirements and also without proper usage of standardized terminologies based on established quality models such as the ISO/IEC 9126 quality model. In this paper, we discuss a quality-driven RE framework and tool that applies knowledge management techniques and quality ontologies to support RE activities. The ontology implements the quality characteristics and metrics prescribed by the ISO/9126 quality model, providing a common vocabulary to address quality concerns/aspects across RE activities. We empirically validate how the framework and tool can be used to effectively support the requirements elicitation and prioritization activities through a case study addressing the development of an intranet portal project at the University of Manchester.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00626.x" xmlns="http://purl.org/rss/1.0/"><title>Approximated fuzzy logic controlled shunt active power filter for improved power quality</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00626.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Approximated fuzzy logic controlled shunt active power filter for improved power quality</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Rambir Singh, Asheesh K. Singh, Rakesh K. Arya</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-10T06:16:47.476084-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00626.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00626.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00626.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">152</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">161</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Shunt active power filters have been widely used for power quality improvement. With the advancement in artificial intelligence techniques, the applications of fuzzy logic-based control systems have increased manifolds. This paper proposes a reduced rule fuzzy logic controller (FLC) in the voltage control loop of a shunt active power filter (APF), which is approximating a conventional large rule FLC. The difference between the controlled outputs of two controllers is compensated by proposed compensating factors. The dynamic response and harmonic compensation performance of proposed 4-rule approximated fuzzy logic controller (AFLC) is compared with 25-rule FLC. A three-phase shunt APF is used for harmonic and reactive power compensation. The proposed scheme is tested with randomly varying single and multiple non-linear loads. The simulation results presented under transient and steady-state conditions confirm that the proposed 4-rule AFLC efficiently approximates the 25-rule FLC. The proposed control methodology takes less computational time and computational memory as the numbers of rules are reduced significantly.</p></div>]]></content:encoded><description>

Shunt active power filters have been widely used for power quality improvement. With the advancement in artificial intelligence techniques, the applications of fuzzy logic-based control systems have increased manifolds. This paper proposes a reduced rule fuzzy logic controller (FLC) in the voltage control loop of a shunt active power filter (APF), which is approximating a conventional large rule FLC. The difference between the controlled outputs of two controllers is compensated by proposed compensating factors. The dynamic response and harmonic compensation performance of proposed 4-rule approximated fuzzy logic controller (AFLC) is compared with 25-rule FLC. A three-phase shunt APF is used for harmonic and reactive power compensation. The proposed scheme is tested with randomly varying single and multiple non-linear loads. The simulation results presented under transient and steady-state conditions confirm that the proposed 4-rule AFLC efficiently approximates the 25-rule FLC. The proposed control methodology takes less computational time and computational memory as the numbers of rules are reduced significantly.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00627.x" xmlns="http://purl.org/rss/1.0/"><title>Association rule mining using genetic programming to provide feedback to instructors from multiple-choice quiz data</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00627.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Association rule mining using genetic programming to provide feedback to instructors from multiple-choice quiz data</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Cristóbal Romero, Amelia Zafra, Jose María Luna, Sebastián Ventura</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-10T06:56:10.95765-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00627.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00627.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00627.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">162</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">172</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposes the application of association rule mining to improve quizzes and courses. First, the paper shows how to preprocess quiz data and how to create several data matrices for use in the process of knowledge discovery. Next, the proposed algorithm that uses grammar-guided genetic programming is described and compared with both classical and recent soft-computing association rule mining algorithms. Then, different objective and subjective rule evaluation measures are used to select the most interesting and useful rules. Experiments have been carried out by using real data of university students enrolled on an artificial intelligence practice Moodle's course on the CLIPS programming language. Some examples of these rules are shown, together with the feedback that they provide to instructors making decisions about how to improve quizzes and courses. Finally, starting with the information provided by the rules, the CLIPS quiz and course have been updated. These innovations have been evaluated by comparing the performance achieved by students before and after applying the changes using one control group and two different experimental groups.</p></div>]]></content:encoded><description>

This paper proposes the application of association rule mining to improve quizzes and courses. First, the paper shows how to preprocess quiz data and how to create several data matrices for use in the process of knowledge discovery. Next, the proposed algorithm that uses grammar-guided genetic programming is described and compared with both classical and recent soft-computing association rule mining algorithms. Then, different objective and subjective rule evaluation measures are used to select the most interesting and useful rules. Experiments have been carried out by using real data of university students enrolled on an artificial intelligence practice Moodle's course on the CLIPS programming language. Some examples of these rules are shown, together with the feedback that they provide to instructors making decisions about how to improve quizzes and courses. Finally, starting with the information provided by the rules, the CLIPS quiz and course have been updated. These innovations have been evaluated by comparing the performance achieved by students before and after applying the changes using one control group and two different experimental groups.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00630.x" xmlns="http://purl.org/rss/1.0/"><title>Exploring the relationship between system development life cycle and knowledge accumulation in Taiwan's IT industry</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00630.x</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Exploring the relationship between system development life cycle and knowledge accumulation in Taiwan's IT industry</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Wen-Hsiang Lai, Hsin-Cheng Tsen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-25T04:58:16.965558-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1111/j.1468-0394.2012.00630.x</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1111/j.1468-0394.2012.00630.x</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fj.1468-0394.2012.00630.x</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">173</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">182</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">Abstract</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>Many projects fail because the knowledge learned from them is obtained too late or insufficient (Koenig &amp; Srikantaiah, 2004); ‘knowledge in projects', ‘knowledge about projects', and ‘knowledge from projects' are three types of knowledge that result from project-based work (Love et al., 2005). This study explores the relationships between the system development life cycle (SDLC) of project management, firm-level explicit knowledge of organizational knowledge accumulation (OKA), and implicit knowledge of employee knowledge accumulation (EKA) with respect to knowledge accumulation (KA) and knowledge integration (KI). First, it analyzes the competence of SDLC in Taiwan's IT enterprises by adapting expert interviews, analytic hierarchy process (AHP), and fuzzy rule-based theory. This reveals that system planning (SP) and system analysis (SA) are the most important SDLC phases. Second, based on the above result, this study investigates how the effectiveness of SDLC (ESDLC) correlates with KI, OKA, and EKA. Results indicate that EKA and OKA have obvious mutual influences, and that both show significant impact on ESDLC. Furthermore, KI has positive influence on EKA, but negative influence on OKA.</p></div>]]></content:encoded><description>

Many projects fail because the knowledge learned from them is obtained too late or insufficient (Koenig &amp; Srikantaiah, 2004); ‘knowledge in projects', ‘knowledge about projects', and ‘knowledge from projects' are three types of knowledge that result from project-based work (Love et al., 2005). This study explores the relationships between the system development life cycle (SDLC) of project management, firm-level explicit knowledge of organizational knowledge accumulation (OKA), and implicit knowledge of employee knowledge accumulation (EKA) with respect to knowledge accumulation (KA) and knowledge integration (KI). First, it analyzes the competence of SDLC in Taiwan's IT enterprises by adapting expert interviews, analytic hierarchy process (AHP), and fuzzy rule-based theory. This reveals that system planning (SP) and system analysis (SA) are the most important SDLC phases. Second, based on the above result, this study investigates how the effectiveness of SDLC (ESDLC) correlates with KI, OKA, and EKA. Results indicate that EKA and OKA have obvious mutual influences, and that both show significant impact on ESDLC. Furthermore, KI has positive influence on EKA, but negative influence on OKA.</description></item></rdf:RDF>