Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information
Identifieur interne : 000D72 ( Istex/Corpus ); précédent : 000D71; suivant : 000D73Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information
Auteurs : Hernán Astudillo ; Javier Pereira ; Claudia L PezSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2006.
Abstract
Abstract: Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information- improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.
Url:
DOI: 10.1007/11966104_15
Links to Exploration step
ISTEX:21C40112351A12B9CD556492C719286198DEF409Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</title><author><name sortKey="Astudillo, Hernan" sort="Astudillo, Hernan" uniqKey="Astudillo H" first="Hernán" last="Astudillo">Hernán Astudillo</name><affiliation><mods:affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: hernan@inf.utfsm.cl</mods:affiliation></affiliation></author><author><name sortKey="Pereira, Javier" sort="Pereira, Javier" uniqKey="Pereira J" first="Javier" last="Pereira">Javier Pereira</name><affiliation><mods:affiliation>Universidad Diego Portales, Escuela de Ingeniería Informática, Av. Ejército 441, Santiago, Chile</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: javier.pereira@udp.cl</mods:affiliation></affiliation></author><author><name sortKey="L Pez, Claudia" sort="L Pez, Claudia" uniqKey="L Pez C" first="Claudia" last="L Pez">Claudia L Pez</name><affiliation><mods:affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: clopez@inf.utfsm.cl</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:21C40112351A12B9CD556492C719286198DEF409</idno><date when="2006" year="2006">2006</date><idno type="doi">10.1007/11966104_15</idno><idno type="url">https://api.istex.fr/document/21C40112351A12B9CD556492C719286198DEF409/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000D72</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000D72</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</title><author><name sortKey="Astudillo, Hernan" sort="Astudillo, Hernan" uniqKey="Astudillo H" first="Hernán" last="Astudillo">Hernán Astudillo</name><affiliation><mods:affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: hernan@inf.utfsm.cl</mods:affiliation></affiliation></author><author><name sortKey="Pereira, Javier" sort="Pereira, Javier" uniqKey="Pereira J" first="Javier" last="Pereira">Javier Pereira</name><affiliation><mods:affiliation>Universidad Diego Portales, Escuela de Ingeniería Informática, Av. Ejército 441, Santiago, Chile</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: javier.pereira@udp.cl</mods:affiliation></affiliation></author><author><name sortKey="L Pez, Claudia" sort="L Pez, Claudia" uniqKey="L Pez C" first="Claudia" last="L Pez">Claudia L Pez</name><affiliation><mods:affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: clopez@inf.utfsm.cl</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2006</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">21C40112351A12B9CD556492C719286198DEF409</idno><idno type="DOI">10.1007/11966104_15</idno><idno type="ChapterID">15</idno><idno type="ChapterID">Chap15</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information- improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Hernán Astudillo</name><affiliations><json:string>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</json:string><json:string>E-mail: hernan@inf.utfsm.cl</json:string></affiliations></json:item><json:item><name>Javier Pereira</name><affiliations><json:string>Universidad Diego Portales, Escuela de Ingeniería Informática, Av. Ejército 441, Santiago, Chile</json:string><json:string>E-mail: javier.pereira@udp.cl</json:string></affiliations></json:item><json:item><name>Claudia López</name><affiliations><json:string>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</json:string><json:string>E-mail: clopez@inf.utfsm.cl</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information- improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.</abstract><qualityIndicators><score>4.028</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>980</abstractCharCount><pdfWordCount>2528</pdfWordCount><pdfCharCount>16250</pdfCharCount><pdfPageCount>8</pdfPageCount><abstractWordCount>125</abstractWordCount></qualityIndicators><title>Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</title><genre.original><json:string>OriginalPaper</json:string></genre.original><chapterId><json:string>15</json:string><json:string>Chap15</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Dough Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbruecken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2006</copyrightDate></serie><host><editor><json:item><name>Volker Gruhn</name><affiliations><json:string>Chair for Applied Telematics/e-Business, University of Leipzig, Germany</json:string><json:string>E-mail: gruhn@ebus.informatik.uni-leipzig.de</json:string></affiliations></json:item><json:item><name>Flavio Oquendo</name><affiliations><json:string>VALORIA Laboratory, University of South Brittany, Tohannic Campus, 56017, Vannes, France</json:string><json:string>E-mail: flavio.oquendo@univ-ubs.fr</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Software Engineering</value></json:item></subject><isbn><json:string>978-3-540-69271-3</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Software Architecture</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>978-3-540-69272-0</json:string></bookId><volume>4344</volume><pages><last>211</last><first>204</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-540-69272-0</json:string></eisbn><copyrightDate>2006</copyrightDate><doi><json:string>10.1007/11966104</json:string></doi></host><publicationDate>2006</publicationDate><copyrightDate>2006</copyrightDate><doi><json:string>10.1007/11966104_15</json:string></doi><id>21C40112351A12B9CD556492C719286198DEF409</id><score>1</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/21C40112351A12B9CD556492C719286198DEF409/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/21C40112351A12B9CD556492C719286198DEF409/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/21C40112351A12B9CD556492C719286198DEF409/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2006</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</title><author><persName><forename type="first">Hernán</forename><surname>Astudillo</surname></persName><email>hernan@inf.utfsm.cl</email><affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</affiliation></author><author><persName><forename type="first">Javier</forename><surname>Pereira</surname></persName><email>javier.pereira@udp.cl</email><affiliation>Universidad Diego Portales, Escuela de Ingeniería Informática, Av. Ejército 441, Santiago, Chile</affiliation></author><author><persName><forename type="first">Claudia</forename><surname>López</surname></persName><email>clopez@inf.utfsm.cl</email><affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</affiliation></author></analytic><monogr><title level="m">Software Architecture</title><title level="m" type="sub">Third European Workshop, EWSA 2006, Nantes, France, September 4-5, 2006, Revised Selected Papers</title><idno type="pISBN">978-3-540-69271-3</idno><idno type="eISBN">978-3-540-69272-0</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/11966104</idno><idno type="BookID">978-3-540-69272-0</idno><idno type="BookTitleID">143543</idno><idno type="BookSequenceNumber">4344</idno><idno type="BookVolumeNumber">4344</idno><idno type="BookChapterCount">19</idno><editor><persName><forename type="first">Volker</forename><surname>Gruhn</surname></persName><email>gruhn@ebus.informatik.uni-leipzig.de</email><affiliation>Chair for Applied Telematics/e-Business, University of Leipzig, Germany</affiliation></editor><editor><persName><forename type="first">Flavio</forename><surname>Oquendo</surname></persName><email>flavio.oquendo@univ-ubs.fr</email><affiliation>VALORIA Laboratory, University of South Brittany, Tohannic Campus, 56017, Vannes, France</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2006"></date><biblScope unit="volume">4344</biblScope><biblScope unit="page" from="204">204</biblScope><biblScope unit="page" to="211">211</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Dough</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation></editor><biblScope><date>2006</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><idno type="istex">21C40112351A12B9CD556492C719286198DEF409</idno><idno type="DOI">10.1007/11966104_15</idno><idno type="ChapterID">15</idno><idno type="ChapterID">Chap15</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2006</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information- improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I14029</label><item><term>Computer Science</term></item><item><term>Software Engineering</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2006">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/21C40112351A12B9CD556492C719286198DEF409/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Dough</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>CA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><City>MA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbruecken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-540-69272-0</BookID><BookTitle>Software Architecture</BookTitle><BookSubTitle>Third European Workshop, EWSA 2006, Nantes, France, September 4-5, 2006, Revised Selected Papers</BookSubTitle><BookVolumeNumber>4344</BookVolumeNumber><BookSequenceNumber>4344</BookSequenceNumber><BookDOI>10.1007/11966104</BookDOI><BookTitleID>143543</BookTitleID><BookPrintISBN>978-3-540-69271-3</BookPrintISBN><BookElectronicISBN>978-3-540-69272-0</BookElectronicISBN><BookChapterCount>19</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2006</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14029" Priority="1" Type="Secondary">Software Engineering</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Volker</GivenName><FamilyName>Gruhn</FamilyName></EditorName><Contact><Email>gruhn@ebus.informatik.uni-leipzig.de</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Flavio</GivenName><FamilyName>Oquendo</FamilyName></EditorName><Contact><Email>flavio.oquendo@univ-ubs.fr</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Chair for Applied Telematics/e-Business</OrgDivision><OrgName>University of Leipzig</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>VALORIA Laboratory</OrgDivision><OrgName>University of South Brittany</OrgName><OrgAddress><Street>Tohannic Campus</Street><Postcode>56017</Postcode><City>Vannes</City><Country>France</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part3"><PartInfo TocLevels="0"><PartID>3</PartID><PartSequenceNumber>3</PartSequenceNumber><PartTitle>Position Papers</PartTitle><PartChapterCount>5</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Software Architecture</BookTitle></PartContext></PartInfo><Chapter ID="Chap15" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>15</ChapterID><ChapterDOI>10.1007/11966104_15</ChapterDOI><ChapterSequenceNumber>15</ChapterSequenceNumber><ChapterTitle Language="En">Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</ChapterTitle><ChapterFirstPage>204</ChapterFirstPage><ChapterLastPage>211</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2006</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>3</PartID><BookID>978-3-540-69272-0</BookID><BookTitle>Software Architecture</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Hernán</GivenName><FamilyName>Astudillo</FamilyName></AuthorName><Contact><Email>hernan@inf.utfsm.cl</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Javier</GivenName><FamilyName>Pereira</FamilyName></AuthorName><Contact><Email>javier.pereira@udp.cl</Email></Contact></Author><Author AffiliationIDS="Aff18"><AuthorName DisplayOrder="Western"><GivenName>Claudia</GivenName><FamilyName>López</FamilyName></AuthorName><Contact><Email>clopez@inf.utfsm.cl</Email></Contact></Author><Affiliation ID="Aff18"><OrgName>Universidad Técnica Federico Santa María, Departamento de Informática</OrgName><OrgAddress><Street>Avenida España 1680</Street><City>Valparaíso</City><Country>Chile</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgName>Universidad Diego Portales, Escuela de Ingeniería Informática</OrgName><OrgAddress><Street>Av. Ejército 441</Street><City>Santiago</City><Country>Chile</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information- improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information</title></titleInfo><name type="personal"><namePart type="given">Hernán</namePart><namePart type="family">Astudillo</namePart><affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</affiliation><affiliation>E-mail: hernan@inf.utfsm.cl</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Javier</namePart><namePart type="family">Pereira</namePart><affiliation>Universidad Diego Portales, Escuela de Ingeniería Informática, Av. Ejército 441, Santiago, Chile</affiliation><affiliation>E-mail: javier.pereira@udp.cl</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Claudia</namePart><namePart type="family">López</namePart><affiliation>Universidad Técnica Federico Santa María, Departamento de Informática, Avenida España 1680, Valparaíso, Chile</affiliation><affiliation>E-mail: clopez@inf.utfsm.cl</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2006</dateIssued><copyrightDate encoding="w3cdtf">2006</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Component-based software elaboration becomes unwieldy for some practical situations with large numbers of components for which information is imperfect (incomplete, imprecise and/or uncertain). This article addresses the problem of identifying “interesting” component sets for some given non-functional requirements (NFRs), using imperfect information about large number of components. Rather than providing completely specified solutions, this approach allows architects to identify and compare whole assemblies, and focus eventual information- improvement efforts only on those components that are part of candidate assemblies. The proposed technique builds on the Azimut layered architectural abstractions, adapting an algorithmic approach used to mine association rules, and taking three parameters: a minimal “support score” that candidate assemblies must meet, and two credibility-value thresholds about the catalog themselves. An example illustrates the approach.</abstract><relatedItem type="host"><titleInfo><title>Software Architecture</title><subTitle>Third European Workshop, EWSA 2006, Nantes, France, September 4-5, 2006, Revised Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Volker</namePart><namePart type="family">Gruhn</namePart><affiliation>Chair for Applied Telematics/e-Business, University of Leipzig, Germany</affiliation><affiliation>E-mail: gruhn@ebus.informatik.uni-leipzig.de</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Flavio</namePart><namePart type="family">Oquendo</namePart><affiliation>VALORIA Laboratory, University of South Brittany, Tohannic Campus, 56017, Vannes, France</affiliation><affiliation>E-mail: flavio.oquendo@univ-ubs.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2006</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic></subject><identifier type="DOI">10.1007/11966104</identifier><identifier type="ISBN">978-3-540-69271-3</identifier><identifier type="eISBN">978-3-540-69272-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">143543</identifier><identifier type="BookID">978-3-540-69272-0</identifier><identifier type="BookChapterCount">19</identifier><identifier type="BookVolumeNumber">4344</identifier><identifier type="BookSequenceNumber">4344</identifier><identifier type="PartChapterCount">5</identifier><part><date>2006</date><detail type="part"><title>Position Papers</title></detail><detail type="volume"><number>4344</number><caption>vol.</caption></detail><extent unit="pages"><start>204</start><end>211</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2006</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dough</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2006</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2006</recordOrigin></recordInfo></relatedItem><identifier type="istex">21C40112351A12B9CD556492C719286198DEF409</identifier><identifier type="DOI">10.1007/11966104_15</identifier><identifier type="ChapterID">15</identifier><identifier type="ChapterID">Chap15</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2006</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2006</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D72 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000D72 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:21C40112351A12B9CD556492C719286198DEF409
|texte= Identifying “Interesting” Component Assemblies for NFRs Using Imperfect Information
}}
| This area was generated with Dilib version V0.6.31. |  |