Conclusion

This book contains author’s suggestions as “basic” combinatorial engineering frame-works (hierarchical modeling, design, improvement, etc.) for design and evaluationof modular (composite) systems. Realistic applications in information technologyare examined. Evidently, the suggested frameworks can be successfully used in var-ious domains (e.g., engineering, management, marketing, social sciences) as well. Itmay be very prospective to use the suggested combinatorial engineering frameworksin many other fields, for example: (a) image processing and shape modeling, (b)navigation systems, (c) biomedicine, (d) new materials and combinatorial chemistry,(e) astrophysics.

In the future, special efforts have to be targeted to combinatorial mndeling, de-sign and evaluation of the following: (i) system requirements, (ii) product/systemplatforms, and (iii) product/system families.

Note, the suggested combinatorial engineering frameworks correspond to a newsystems “interface” between fundamental disciplines (e.g., combinatorial optimiza-tion, graph theory) and applied domains (i.e., engineering, applied computer science,management).

In addition, the material of the book may be considered as a new useful part of ed-ucational courses (e.g., systems design, systems configuration, systems engineering,applied combinatorial optimization).

It is necessary to point out, that new significant research directions and/or re-search communities in the field of multidisciplinary modular systems have to beestablished, for example: (1) modular systems engineering, (2) life-cycle engineer-ing of multidisciplinary modular systems, (3) morphological methods in modularsystems design, (4) systems configuration design/engineering. The author’s hope isthe following: this book will play a useful role for the above-mentioned researchdirections/communities.

© Springer International Publishing Switzerland 2015M.S. Levin, Modular System Design and Evaluation,Decision Engineering, DOI 10.1007/978-3-319-09876-0

415

References

1. Abts D, Felderman B (2012) A guided tour of data-center networking. Commun ACM55(6):44–51

2. Adeli H (ed) (2002) Advances in design optimization. CRC Press, Boca Raton3. Adelson-Velsky GM, Gelbukh A, Levner E (2002) On fast path-finding algorithms in AND-

OR graphs. Math Probl Eng 8(4–5):283–2934. Admavicius G, Tuzhilin A (2005) Towards the next generation of recommender systems:

a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng17(6):734–749

5. Admavicius G, Tuzhilin A (2005) Personalization technologies: a process-oriented perspec-tive. Commun ACM 48(10):83–90

6. Agard B, Kusiak A (2004) Data-mining methodology for the design of product families. IntJ Prod Res 42(15):2955–2969

7. Agerfalk PJ, Brinkkemper S, Gonzalez C, Henderson-Seller B, Karlsson F, Kelly S, RalyteJ (2007) Modularization constructs in method engineering: towards common ground? IFIPInt Fed Inf Process 244:359–368

8. Aggarwal A (ed) (2000) Web-based learning and teaching technologies: opportunities andchallanges. IGI Global, Hershey

9. Agrawal A, Klein P, Ravi R (1995) When trees collide: an approximation algorithm for thegeneralized Steiner problem on networks. SIAM J Comput 24(3):440–456

10. Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items inlarge databases. In: Proceedings of the ACM SIGMID conference on management of data.Washington, DC, pp 207–216

11. Agrawal R, Srikant R (2001) On integrating catalogs. In: Proceedings of 10th internationalworld wide web conference WWW 2001, Hong Kong, pp 603–612

12. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows, theory, algorithms, and applica-tions. Prentice Hall, New Jersey

13. Aitkenhead MJ (2008) A co-evolution decision tree classification method. Expert Syst Appl34(1):18–25

14. Aizerman MA, Gusev LA, Petrov SV, Smirnov IM (1977) A dynamic approach to analysis ofstructured representatives as graphs (fundamentals of graph dynamics). I and II. Avtomatikai Telemekhanika 7: 135–151 and 9: 123–136 (in Russian)

15. Aizerman M, Aleskerov F (1995) Theory of choice. Elsevier, Amsterdam16. Akatsu T, Halldorsson MM (2000) On the approximation of largest common subtrees and

largest common point sets. Theoret Comput Sci 233(1–2):33–5017. Akella MR, Batta R, Sudit M, Rogerson P, Blatt A (2008) Cellular network configuration with

co-channel and adjacent-channel interference constraints. Comput Oper Res 35(12):3738–3757

18. Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: asurvey. Comput Netw 38(4):393–422

19. Alavi M, Joachiminsthaler EA (1992) Revising DSS implementation research: a meta-analysis of the literature and suggestions for research. MIS Quarterly 16(1):95–116

© Springer International Publishing Switzerland 2015M.S. Levin, Modular System Design and Evaluation,Decision Engineering, DOI 10.1007/978-3-319-09876-0

417

418 References

20. Alekseev VM (1976) Deciphering algorithm of some classes of monotonic many-valuedfunctions. USSR Comput Math Math Phys 16(1):180–189

21. Alexandrov NM, Husssaini MY (eds) (1997) Multidisciplinary design optimization: state ofthe art. In: Proceedings in applied mathematics series; no 80, SIAM, Providence

22. Alkhazaleh S, Salleh AR, Hassan N (2011) Soft multisets theory. Appl Math Sci 5(72):3561–3573

23. Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J (2006) A general approach to onlinenetwork optimization problems. ACM Trans Algorithms 2(4):640–660

24. Alon N, Fomin F, Gutin G, Krivelevich M, Saurabh S (2009) Spanning directed trees withmany leaves. SIAM J Discreet Math 23(1):466–476

25. Alonso G, Casati F, Kuno H, Machiraju V (2004) Web services: concepts, architectures andapplications. Springer, Berlin

26. Altshuller GS (1988) Creativity as exact science., The theory of the solution of inventiveproblemsGordon and Breach, New York

27. Amir A, Keselman D (1997) Maximum agreement subtree of a set of evolutionary trees -metrics and efficient algorithms. SIAM J Comput 26(6):1656–1669

28. Amir A, Landau GM, Na JC, Park H, Park K, Sim JS (2009) Consensus optimizing bothdistance sum and radius. In: Karlgren J, Tarhio J, Hyyro H (eds) International conference onstring processing and information retrieval SPIRE 2009, LNCS 5721, Springer, pp 234–242

29. Amir A, Landau GM, Na JC, Park H, Park K, Sim JS (2011) Efficient algorithms forconsensus string problems minimizing both distance sum and radius. Theoret Comput Sci412(39):5239–5246

30. Antonsson EK, Cagan J (eds) (2001) Formal engineering design synthesis. Cambridge Uni-versity Press, Cambridge

31. Apostolico A (1997) String editing and longest common subsequences. In: Rozenberg G,Salomaa A (eds) Handbook of formal languages, vol 2. Springer, Berlin, pp 361–398

32. Apostolico A, Guerra C (1987) The longest common subsequence problem revised. Algo-rithmica 2(1–4):315–336

33. Applegate LM, Konsynski BR, Nunamaker JF (1986) Model management systems: designsfor decision support. Decis Support Syst 2(1):81–91

34. Arain FM (2008) IT-based approach for effective management of project changes: a changemanagement system (CMS). Adv Eng Inform 22(4):457–472

35. Archetti C, Bertazzi L, Speranza MG (2003) Reoptimizing the traveling salesman problem.Networks 42(3):154–159

36. Archetti C, Bertazzi L, Speranza MG (2006) Reoptimizing the 0–1 knapsack problem. Tech-nical Report 267, University of Brescia

37. Arnold M, Ohlebusch E (2011) Linear time algorithms for generalizations of the longestcommon substring problem. Algorithmica 60(4):806–818

38. Arpinar IB, Zhang R, Aleman-Meza B, Maduko A (2005) Ontology-driven Web servicescomposition platform. ISeB 2(2):175–199

39. Arroyo JEC, Vieira PS, Vianna DS (2008) A GRAPS algorithm for the multi-criteria mini-mum spanning tree problem. Ann Oper Res 159(1):125–133

40. Artamonov EI, Khachumov VM (1991) Sintez structur spezialjnyh sredstv mashinnoy grafiki(Synthesis of structures for special tools of machine graphics). Inst. of Control Problems,Moscow (in Russian)

41. Ashrafi N, Berman O (1992) Optimization models for selection of programs, consideringcost and reliability. IEEE Trans Reliabilty 41(2):281–287

42. Ashrafi N, Berman O (1994) Optimal design of large software-systems using N-versionprogramming. IEEE Trans Reliabilty 43(2):344–350

43. Asimov M (1962) Introduction to design. Prentice Hall, Englewood Cliffs44. Austello G, Escoffer B, Monnot J, Paschos V (2009) Reoptimization of minimum and max-

imum traveling salesman’s tours. J Discreet Algorithms 7(4):453–46345. Avanthay C, Hertz A, Zufferey N (2003) A variable neighborhood search for graph coloring.

Eur J Oper Res 151(2):379–388

References 419

46. Avella P, Villacci D, Sforza A (2005) A Steiner arborescence model for the feeder reconfig-uration in electric distribution networks. Eur J Oper Res 164(2):505–509

47. Awerbuch B, Azar Y, Bartal Y (2004) On-line generalized Steiner problem. Theoret ComputSci 324(2–3):313–324

48. Ayres RU (1969) Technological forecasting and long-time planning. McGraw-Hill, NewYork

49. Babcock B, Babu S, Datar M, Motwani R, Widom J (2002) Models and issues in data streamsystems. Proceedings of 21st ACM SIGMOD-SIGACT-SUGART symposium principles ofdatabase systems PDOS-2002. Madison, WI, USA, pp 1–16

50. Bachoore EH, Boldaender HL (2006) Convex recoloring of leaf-colored trees. TechnicalReport UU-CS-2006-010, Department of Information and Computing Sciences, UtrechtUniversity

51. Bae SW, Lee C, Choi S (2010) On exact solutions to the Euclidean bottleneck Steiner treeproblem. Inform Proc Lett 110(16):672–678

52. Balabanovic M, Shoham Y (1997) Fab: content-based, collaborative recommendation. Com-mun ACM 40(3):66–72

53. Balakrishnan A, Magnanti T, Mirchandani P (1994) A dual-based algorithm for multi-levelnetwork design. Manag Sci 40(5):567–581

54. Balasubramaian K, Cellatoglu A (2008) Improvements in home automation strategies fordesigning apparatus for efficient smart home. IEEE Trans Consum Electron 54(4):1681–1687

55. Baldwin CY, Clark KB (2000) Design rules: the power of modularity. MIT Press, Cambridge56. Baligh HH (2006) Organization structures: theory and design, analysis and prescription.

Springer, New York57. Banerjee S, Basu A (1993) Model type selection in an integrated DSS environment. Decis

Support Syst 9(1):75–8958. Bang-Jensen J, Gutin G (1997) Alternating cycles and paths in edge-coloured multigraphs:

a survey. Discreet Math 165–166:39–6059. Bansal MS, Fernandez-Baca D (2009) Computing distances between partial rankings. Inform

Proc Lett 109(4):238–24160. Bar-Shalom Y, Fortmann T (1988) Tracking and data association. Academic Press, New

York61. Bar-Shalom Y, Li X-R (1995) Multitarget-multisensor tracking: principles and techniques.

YBS Publishing, Connecticut62. Bar-Yehuda R, Feldman I, Rawitz D (2008) Improved approximation algorithm for convex

recoloring of trees. Theory Comput Syst 43(1):3–1863. Barbosa VC, Asis CAG (2004) Two novel evolutionary formulations of the graph coloring

problem. J Comb Optim 8(1):41–6364. Barbosa PR, Chong EKP, Suvorova S, Moran B (2008) Multitarget-multisensor tracking in

an urban environment: a closed-loop approach. In: Proceedings of SPIE 6969, no. 69690W65. Bard JF, Feinberg A (1989) Two-phase methodology for technology selection and system

design. IEEE Trans Eng Manage 36(1):28–3666. Barker V, O’Connor D (1989) Expert system for configuration at digital: Xcon and beyond.

Commun ACM 32(3):298–31867. Barnhart RK, Hottman SB, Marshall DM, Shappee E (eds) (2011) Introduction to unmanned

aircraft systems. CRC Press, Boca Raton68. Baron S, Kruser DS, Huey BM (eds) (1990) Quantitative modeling of human performance

in complex, dynamic systems. National Academy Press, Washington, D.C69. Baronti P, Pillai P, Chook VWC, Chessa S, Gotta A, Hu YF (2007) Wireless sensor network:

a survey on the state of the art and the 802.15.4 and ZigBee standards. Comput Commun30(7):1655–1695

70. Barthelemy J-P, Guenoche A, Hudey O (1989) Median linear orders: Heuristics and a branchand bound algorithm. Eur J Oper Res 42(3):313–325

420 References

71. Barthelemy J-P, Leclerc B (1995) The median procedure for partitions. In: Cox I, Hansen P,Julesz B (eds) Partitioning data sets, vol 19. DIMACS Series in Discrete MathematicsAMS,Providence, pp 3–34

72. Barton BA (2011) Searching a bitstream in linear time for the longest substring of any givendensity. Algorithmica 61(3):555–579

73. Bascaran E, Bannerot RB, Mistree F (1989) Hierarchical selection decision support problemsin conceptual design. Eng Optim 14(3):207–238

74. Bascaran E, Karandikar HM, Mistree F (1992) Modeling hierarchy in decision-based design:a conceptual exposition. In: Stauffer LA, Taylor DL (eds) Design theory and methodology92. ASME, New York

75. Basu A, Blanning RW (1994) Metagraphs: a tools for modeling decision support systems.Manage Sci 40(12):1579–1600

76. Basu A, Blanning RW (1994) Model integration using metagraphs. Inform Syst Res5(3):195–218

77. Basu A, Blanning RW, Shtub A (1994) Metagraphs in hierarchical modeling. Manage Sci43(5):623–639

78. Batini C, Lenzerini M, Navathe SB (1986) A comparative study of methodologies for database schema integration. ACM Comput Surv 18(4):323–364

79. Batista TV, Joolia A, Coulson G (2005) Managing dynamic reconfiguration in component-based systems. In: Proceedings of the 2nd European workshop on software architectureEWSA’05, pp 1–17

80. Batsyn M, Goldengorin B, Maslov E, Pardalos PM (2014) Improvements to MCS algorithmfor the maximum clique problem. J Comb Optim 27(2):397–416

81. Battacharjee S, Ramesh R, Zionts S (2001) A design framework for e-business infrastructureintegration and resource management. IEEE Trans Syst Man Cybern. Part C 31(3):304–319

82. Bazgan C, Hugot H (2009) Solving efficiently the 0–1 multiobjective knapsack problem.Comp Oper Res 36(1):260–279

83. Beck MP, Lin BW (1983) Some heuristics for the consensus ranking problem. Comp OperRes 10(1):1–7

84. Behzadian M, Kazemzadeh R, Albadvi A, Aghdasi M (2010) PROMETHEE: a comprehen-sive literature review on methodologies and applications. Eur J Oper Res 200(1):198–215

85. Belaziz M, Bouras A, Brun JM (2000) Morphological analysis for product design. ComputAided Des 32(5):377–388

86. Bellazzi R, Montani S, Riva A, Stefanelli M (2001) Web-based telemedicine systems forhome-care: technical issues and experiences. Comput Methods Programs Biomed 64(3):175–187

87. Belotserkovskii DL, Vishnevskii VM (1997) New algorithm for generating a biconnectedspanning subgraphs for topological optimization of data networks. Autom Remote Control58(1) part 2:88–97

88. Benatallah B, Dumas M, Fauvet M-C, Rabhi FA, Sheng QZ (2002) Overview of some patternsfor architecting and managing composite web services. ACM SIGecom Exch. 3(3):9–16

89. Benatallah B, Sheng QZ, Dumas M (2003) The self-serv environment for web servicescomposition. IEEE Internet Comput 7(6):40–48

90. Benders JF (1962) Partitionig procedures for solving mixed variables programming prob-lems. Numer Math 4(1):238–252

91. Bendsoe MP, Sigmund O (2003) Topology optimization: theory, methods and applicaitons,2nd edn. Springer, Berlin

92. Berezovskii BA, Kontorer LA (1987) Efficient algorithm to construct the set of undominatedalternatives of decomposable objects. Autpm Remote Control 48(1), part 2:95–100

93. Berge C (1973) Graphs and hypergraphs. Elsevier, New York94. Berge C (1989) Hypergraphs: combinatorics of finite sets. North Holland, Amsterdam95. Bergroth L, Hakonen H, Raita T (2000) A survey of longest common subsequence algo-

rithms. In: Proceedings of the seventh international symposium on string processing andinformation retrieval SPIRE’00, pp 39–48

References 421

96. Berman O, Ashrafi N (1993) Optimization models for reliability of modular software sys-tems. IEEE Trans Software Eng 19(11):1119–1123

97. Berman P, Ramaiyer V (1994) Improved approximations for the Steiner tree problem. JAlgorithms 17(3):381–408

98. Berry V, Nicolas F (2004) Maximum agreement and compatible supertrees. In: Proceedingsof the 15th annual symposium on combinatorial pattern matching CPM-2004, LNCS 3109,Springer, pp 205–219

99. Bertsimas D, Sim M (2002) Robust discrete optimization. Working Paper, Operations Re-search Center, MIT, MA

100. Bhargava HK, Power DJ, Sun D (2007) Progress in Web-based decision support technologies.Decis Support Syst 43(4):1083–1095

101. Bhaskaran V, Konstantinidis K (1995) Image and video compression standards: algorithmsand architectures. Kluwer, Boston

102. Bhatnagar S, Ganguly S, Izmailov R (2006) Design of IEEE 802.16-based multi-hop wirelessbackhaul network. In: Proceedings of the 1st international conference on access networks,Greece, article no. 5

103. Bi ZM, Lang S, Shen W, Wang L (2008) Reconfigurable manufacturing systems: the stateof the art. Int Prod Res 46(4):967–992

104. Bille P (2005) A survey on edit distance and related problems. Theoret Comput Sci 337(1–3):217–239

105. Bilo D, Bockenhauer H-J, Hromkovic J, Kralovic R, Momke T, Widmayer P, Zych A (2008)Reoptimization of Steiner trees. In: Gudmundsson J (ed) Proceedings of scandinavian work-shop on algorithm theory SWAT’08, LNCS 5124, Springer, pp 258–269

106. Bilo D., Widmayer P, Zych A (2008) Reoptimization of weighted graph and covering prob-lems. In: Bampis E, Skutella M (eds) Proceedings of 6th international workshop on approx-imation and online algorithms WAOA’08, LNCS 5426, Springer, pp 201–213

107. Bilo D, Bockenhauer H-J, Komm D, Kralovic R, Momke T, Seibert S, Zych A (2011)Reoptimization of the shortest common superstring problem. Algorithmica 61(2):227–251

108. Binbasioglu M (1995) Key features for model building decision support systems. Eur J OperRes 82(3):422–437

109. Birmingham WP, Brennan A, Gupta AP, Siewiorek DP (1988) Micon: a single board com-puter synthesis tool. IEEE Circuits Devices Mag 4(1):37–46

110. Blackman SS (1986) Multiple-target tracking with radar applications. Artech House Pub-lishers, Dedham

111. Blackman S, Popoli R (1999) Design and analysis of modern tracking systems. Artech HousePublishers, Boston

112. Blake MB, Gomaa H (2005) Agent-oriented compositional approaches to services-basedcross-organizational workflow. Decis Support Syst 40(1):31–50

113. Blanning RW, Holsapple CW, Whinston AB, (eds), (1993) Special issue on model manage-ment systems. Decis Support Syst 9(1):

114. Bless PN, Kapoor SG, DeVor RE, Klabjan D (2005) An algorithmic strategy for automatedgeneration of multicomponent software tools for virtual manufacturing. J Manufact Sci Eng127(4):866–874

115. Bless PN, Klabjan D, Chang SY (2008) Heuristics for automated knowledge source integra-tion and service composition. Comput Oper Res 35(4):1292–1314

116. Blessing TM, Chakrabarti A (2009) DRM, a Design Research Methodology. Springer, Lon-don

117. Blomqvist E, Levashova T, Ohgren A, Sandkuhl K, Smirnov A, Tarassov V (2005) Config-uration of dynamic SME supply chains based on ontologies. In: Marik V, Brennan RW, Pe-choucek M (eds) Holonic and multi-agent systems for manufacturing. LNAI 3593, Springer,pp 246–256

118. Blum A (1994) New approximation algorithms for graph coloring. J ACM 41(3):470–516119. Blum J, Ding M, Thaeler A, Cheng X (2005) Connected dominating set in sensor net-

works and MANETs. In: Du D-Z, Pardalos P (eds) Handbook of combinatorial optimization.Kluwer Academic, Boston, pp 329–369

422 References

120. Blum C, Blesa MJ, Ibanez ML (2009) Beam search for the longest common subsequenceproblem. Comput Oper Res 36(12):3178–3186

121. Bockenhauer H-J, Hromkovic J, Momke T, Widmayer P (2008) On the hardness of reop-timization. In: Geffert V, Karhumaki J, Bertoni A, Preneel B, Navrat P, Bielikova M (eds)34th international conference on current trends in theory and practice of computer scienceSOFSEM 2008, LNCS 4910, Springer, pp 50–65

122. Bodlaender HL, Kloks T, Tan RB, Van Leeuwen J (2004) Approximations forlambda−coloring of graphs. Comput J 47(2):193–204

123. Bogart KP (1973) Preference structures I: distance between transitive preference relations.J Math Soc 3:49–67

124. Bogdanov K, Holcombe M (2001) Statechart testing method for aircraft control systems.Software Test Verification Reliability 11(1):39–54

125. Bolloju N, Khalifa M, Turban E (2002) Integrating knowledge management into enterpriseenvironment for the next generation decison support. Decis Support Syst 33(2):163–178

126. Bomze I, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. Hand-book of combinatorial optimization. Kluwer Academic, Boston, pp 1–75

127. Bondalapati K, Prasanna VK (2002) Reconfigurable computing systems. Proc IEEE90(7):1201–1217

128. Booch G (1991) Object oriented development. The Benjamin/Cummings Publishing Com-pany, Redwood City

129. Boon B, Park Y (2005) A systematic approach for identifying technology opportunities:keyword-based morphology analysis. Technol. Forecasting & Social Change 72(2):145–160

130. Bordetsky AB, Peltsverger B, Peltsverger S, Statnikov RB (2005) Multi-criteria approach inconfiguration of energy efficient sensor networks. In: Proceedings of 43rd ACM southeastreginal conference, vol 2, pp 28–29

131. Borg I, Groenen P (2005) Modern multidimensional scaling: theory and applications, 2ndedn. Springer, New York

132. Boria N, Paschos VP (2010) Fast reoptimization for the minimum spanning tree problem. JDiscrete Algorithms 8(3):296–310

133. Bose P, Czyzowicz J, Gasieniec L, Kranakis E, Krizanc D, Pelc A, Martin MV (2001) Strate-gies for hotlink assignments. In: International symppsium on algorithms and computation(ISAAC’00), LNCS 1969, Springer, pp 23–34

134. Bossak MA (1998) Simulation based design. J Mater Process Technol 76(1):8–11135. Botafogo RA, Rivlin E, Shneiderman B (1992) Structural analysis of hypertexts: identifying

hierarchies and useful metrics. ACM Trans Inf Syst 10(2):83–110136. Bouhmala N, Granmo O-C (2008) Solving graph coloring problems using learning automata.

In: van Hemert J, Cotta C (eds) Proceedings of 8th European conference on evolutionarycomputation in combinatorial optimization EvoCOP 2008, LNCS 4972, Springer, pp 277–288

137. Braha D (2001) Design-as-satisfiability: a new approach to automated synthesis. Artif IntellEng Des Anal Manuf 15(5):385–399

138. Brans JP, Mareschal B, Vincke P (1984) PROMETHEE: A new family of outranking methodsin multicriteria analysis. In: Brans JP (ed) Operations research ’84. North-Holland, NewYork, pp 77–490

139. Brauers WKM, Zavadskas EK (2012) Robustness of MULTIMOORA: a method for multi-objective optimization. Informatica 23(1):1–25

140. Bregar A, Gyorkos J, Juric MB (2008) Interactive aggregation/ disaggregation dichotomicsorting procedure for group decision analysis based on the threshold model. Informatica19(2):161–190

141. Brelaz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4):251–256142. Briggs P, Cooper KD, Torczon L (1994) Improvements to graph coloring register allocation.

ACM Trans Program Lang Syst 16(3):428–455143. Brin S, Page L, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing

order to the Web. Technical Report 1999–0120, Computer Science Department, StanfordUniversity, Stanford, CA

References 423

144. Brinkkemper S (1996) Method engineering: engineering of information systems develop-ment methods and tools. Inf Software Technol 38(4):275–280

145. Brodka P, Saganowski S, Kazienko P (2013) GED: the method for group evolution discoveryin social networks. Soc Netw Anal Min 3(1):1–14

146. Brooks RL (1940) On coloring the nodes of network. Proceedings of Cambridge philosoph-ical society 37:194–197

147. Brooks RR, Iyengar SS (1998) Multi-sensor fusion: fundamentals and applications withsoftware. Prentice Hall, Englewood Cliffs

148. Brooks RR, Ramanathan P, Sayeed AM (2002) Distributed target classification and trackingin sensor networks. Proc IEEE 91(8):1163–1171

149. Brown DC (1998) Defining configuring. Artif Intell Eng Des Anal Manuf 12(4):301–305150. Browning TR (2001) Applying the design structure matrix to system decomposition and

integration problems. IEEE Trans Eng Manage 48(3):292–306151. Browing TR (2009) The many views of a process: toward a process architecture framework

for product development processes. Syst Eng 12(1):69–90152. Brun L, Kropatsch WG (2003) Construction of combinatorial pyramids. In: Hancock W,

Vento M (eds) Proceedings of IAPR workshop GbPRP 2003, LNCS 2726, Springer, pp1–12

153. Brusilovsky P, Eklund J, Schwarz E (1998) Web-based education for all: a tool for develop-ment adaptive courseware. Comput Netw ISDN Syst 30(1–7):291–300

154. Buede DM (1992) Software review. Overview of MCDA software market. Multi-CriteriaDecis Anal 1(1):59–61

155. Buede DM (2009) The engineering design of systems: methods and models, 2nd edn. Wiley,New York

156. Bui TN, Nguyen TH (2006) An agent-based algorithm for generalized graph colorings.In: Proceedings of the 8th annual conference on genetic and evolutionary computationGECCO’06, Seattle, pp 19–28

157. Bui TN, Nguyen TH, Patel CM, Phan K-AT (2008) An ant-based algorithm for coloringgraphs. Discrete Appl Math 156(2):190–200

158. Bunke H (1997) On a relation between graph edit distance and maximum common subgraph.Pattern Recognit Lett 18(8):689–694

159. Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph.Pattern Recognit Lett 19(3–4):255–259

160. Burkard R, Dell’Amico M, Martello S (2009) Assignment problems. SIAM, Providence161. Butenko S, Cheng X, Oliveira C, Pardalos PM (2004) A new heuristic for the minimum

connected dominating set problem on ad hoc wirless networks. Recent developments incooperative control and optimization. Kluwer Academic, Boston, pp 61–73

162. Cabrera AA, Komoto H, van Beek TJ, Tomyiama T (2014) Architecture-centric designapproach for multidisciplinary product development. In: Simpson TW et al (eds) Advancesin product family and product platform design. Springer, New York, pp 419–447

163. Cagan J, Campbell MI, Finger S, Tomiyama T (2005) A framework for computational designsynthesis: model and applications. J Comput Inf Sci Eng 5(181):171

164. Cai Y, Sullivan KJ (2005) A value-oriented theory of modularity in design. ACM SIGSOFTSoftware Eng Notes 30(4):1–4

165. Campbell MI, Cagan J, Kotovsky K (2000) Agent-based synthesis of electromechanicaldesign configurations. J Mech Des 122(1):61–69

166. Campbell MI, Cagan J, Kotovsky K (2003) The A-design approach to managing automateddesign synthesis. Res Eng Des 14(1):12–24

167. Canuto SA, Resende MGC, Ribeiro CC (2001) Local search with perturbations for theprize-collecting Steiner tree problem in graphs. Networks 38(1):50–58

168. Caramia M, Dell’Olmo P (2004) Bounding vertex coloring by truncated multistage branchand bound. Networks 44(4):231–242

169. Caramia M, Dell’Olmo P, Italiano GF (2006) CHECKGOL: improved local search for graphcoloring. J Discrete Algorithms 4(2):277–298

424 References

170. Caramia SA, Dell’Olmo P (2008) Embedding a novel objective function in a two-phase localsearch for robust vertex coloring. Eur J Oper Res 189(3):1358–1380

171. Caramia SA, Dell’Olmo P (2008) Coloring graphs by iterated local search transversingfeasible and infeasible solutions. Discrete Appl Math 156(2):201–217

172. Carden F, Henry R, Jedlicka R (2002) Telemetry systems engineering. Artech House Pub-lishers, Dedham

173. Caro Y, West DB, Yuster R (2000) Connected domination and spanning trees with manyleafs. SIAM J Discrete Math 13(2):202–211

174. de Castro V, Marcos E, Sanz ML (2006) A model driven method for service compositionmodelling: a case study. Int J Web Eng Technol 2(4):335–353

175. Cattrysse DG, Van Wassenhove LN (1992) A survey of algorithms for the generalized as-signment problem. Eur J Oper Res 60(3):260–272

176. Cawse JN (ed) (2002) Experimental design for combinatorial and high throughput materialdevelopment. Wiley, New York

177. Cela E (1998) The Quadratic assignment problem. Kluwer, Dordrecht178. Ceri S, Fraternali P, Bongio A (2000) Web modeling language (WebML): a modeling lan-

guage for designing web sites. Comput Netw 33(1–6):137–157179. Chakrabarti A (ed) (2002) Engineering design synthesis: understanding, approaches and

tools. Springer, London180. Chams M, Hertz A, de Werra D (1987) Some experiments with simulated annealing for

coloring graphs. Eur J Oper Res 32(2):260–266181. Chandra C, Grabis J (2007) Supply chain configuration: concepts, solutions, and applications.

Springer, New York182. Chang GJ, Lu C (2003) Distance-two labelings of graphs. Eur J Comb 24(1):53–58183. Chang GJ, Chen J-J, Kuo D, Liaw S-C (2007) Distance-two labelings of graphs. Discrete

Appl Math 155(8):1007–1013184. Chari K (2002) Model composition using filter spaces. Inf Syst Res 13(1):15–35185. Chari K (2003) Model composition in a distributed environment. Decis Support Syst

35(3):399–413186. Charicar M, Chekuri C, Cheung T-Y, Dai Z, Goel A, Guha S, Li M (1999) Approximation

algorithms for directed Steiner problems. J Algorithms 33(1):73–91187. Charon I, Hudry O (2008) Optimal clustering of multipartite graphs. Discrete Appl Math

156(8):1330–1347188. Chartier TP, Krentzer E, Langville AN, Pedings KE (2011) Sensitivity and stability of ranking

vectors. SIAM J Sci Comput 33(3):1077–1102189. Chataigner F (2005) Approximating the maximum agreement forest on k trees. Inf Proc Lett

93(5):239–244190. Chekuri C, Even G, Kortsarz G (2006) A greedy approximation algorithm for the group

Steiner problem. Discrete Appl Math 154(1):15–34191. Chen G, Hong L (1997) A genetic algorithm based multi-dimensional data association al-

gorithm for sensor-multi-target tracking. Math Comput Model 26(4):57–69192. Chen D, Du D-Z, Hu X-D, Lin G-H, Wang L, Xue G (2000) Approximations for Steiner

trees with minimum number of Steiner points. J Glob Optim 18(1):17–33193. Chen X, Simons M (2002) A component framework for dynamic reconfiguration of dis-

tributed systems. In: Bisshop J (ed) Proceedings of the IFIP/ACM working conference oncomponent deployment, LNCS 2370, Springer, pp 82–96

194. Chen G, Chen S, Guo W, Chen W (2007) The multicriteria minimum spanning tree problembased genetic algorithm. Inf Sci 177(22):5050–5063

195. Chen H, Lynch KJ, Basu K, Hg NT (1993) Integrating, and activating thesauri for concept-based document retrieval. IEEE Expert 8(2):25–34

196. Chen H, Schatz B, Hg T, Martinez J, Kirchhoff A, Lin C (1996) A parallel computingapproach to creating engineering concept spaces for semantic retrieval: the Illinois DigitalLibrary Initiative Project. IEEE Trans Pattern Anal Mach Intell 18(8):771–782

References 425

197. Chen W (2001) New algorithm for ordered tree-to-tree correction problem. J Algorithms40(2):135–158

198. Chen Y, Kilgour DM, Hipel KW (2006) Multiple criteria classification with an applicationin water resources planning. Comp Oper Res 33(11):3301–3323

199. Chen Y, Hipel KW, Kilgour DM (2007) Multiple-criteria sorting using case-based distancemodel with an application in water resources management. IEEE Trans Syst Man CybernPart A 37(5):680–691

200. Chen J-L, Pan S-W, Chen M-C, Huang Y-M (2008) Communication networks: adaptive radioresource management in an integrated GPRS/UMTS service network. Eur Trans Telecom-mun 19(8):837–845

201. Chen T-C, Chen T-S, Wu P-W (2011) On data collection using mobile robot in wirelesssensor networks. IEEE Trans Syst Man Cybern Part A 41(6):1213–1224

202. Cheng X, Huang X, Li D, Wu W, Du D-Z (2003) A polynomial-time approaximationscheme for the minimum-connected dominating set in ad hoc wireless networks. Networks42(4):202–208

203. Cheng X, Du D-Z (2001) Steiner trees in industries. Kluwer, Dordrecht204. Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data

streams. Knowl Inf Syst 16(1):1–127205. Chiariglione L (1995) The development of an integrated audiovisual coding standard: MPEG.

Proc IEEE 83(2):151–157206. Chiariglione L (1997) MPEG and multimedia communications. IEEE Trans Circuits Syst

Video Technol 7(2):5–18207. Chikofsky EJ, Cross JH (1990) Reverse engineering and design recovery: a taxonomy. IEEE

Software 7(1):13–17208. Chiu M-C, Okudan G (2014) An investigation on the impact of product modularity level on

supply chain perfoirmance metrics: an industrial case study. J Intell Manuf 25(1):120–145209. Cho YH, Kim JL, Kim SH (2002) A personalized recommender system based on web usage

mining and decision tree induction. Expert Syst Appl 23(3):329–342210. Choi N, Song I-Y, Han H (2006) A survey on ontology mapping. SIGMOD Rec 35(3):34–41211. Chong C-Y, Mori S, Barker WH, Chang K-C (2000) Architectures and algorithms for track

association and fusion. IEEE Aerosp Electron Syst Mag 15(1):5–13212. Chorpa S, Gorres ER, Rao MR (1992) Solving the Steiner tree problem on a graph using

branch and cut. ORSA J Comput 4(3):320–355213. Chorpa S, Tsai C (2002) A branch-and-cut approach for mimimum cost multi-level network

design. Discrete Math 242(1–3):65–92214. Cimino JJ, Socratous SA, Clayton PD (1995) Internet as clinical information system: appli-

cation development using the World Wide Web. J Med Inform Assoc 2(5):273–284215. Ciuksys D, Caplinkas A (2007) Reusing ontological knowledge about business processes in

IS engineering: process configuration problem. Informatica 18(4):585–602216. Clune J, Mouret J-B, Lipson H (2012) The evolutionary origins of modularity. Electronic

preprint, 17 pp, July 11, 2012. http://arxiv.org/abs/1207.2743 [q-bio.PE]217. Coble J, Cook DJ, Holder LB (2006) Structure discovery in sequentially-connected data

streams. Int J Artif Intell Tools 15(6):917–944218. Coello CAC, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving

multi-objective problems. Kluwer, Dordrecht219. Cohen DM, Dalal SR, Parelius J, Patton GC (1996) The combinatorial design approach to

automatic test generation. IEEE Software 13(5):83–87220. Colombo G, Mosca A, Sartori F (2007) Towards the design of intelligent CAD systems: an

ontological approach. Adv Eng Inform 21(2):153–168221. Conant RC (1974) Information flows in hierarchical systems. Int J Gen Syst 1(1):9–18222. Connor R, Simeoni F, Iakovos M, Moss R (2011) A bounded distance metric for comparing

tree structure. Inf Syst 36(4):748–764223. Conradi R, Westfechtel B (1998) Versions models for software configuration management.

ACM Comput Surv 30(2):232–282

426 References

224. Cook WD, Seiford LM (1978) Priority ranking and consensus formation. Manage Sci24(16):1721–1732

225. Cook WP, Kress M (1992) Ordinal information and preference structures: decision modelsand applications. Prentice-Hall, Englewood Cliffs

226. Cook WD, Seiford LM, Kress M (1996) A general framework for distance-based consensusin ordinal ranking models. Eur J Oper Res 96(2):392–397

227. Corbett B, Rosen DW (2004) A configuration design based method of platform commoniza-tion for product families. Artif Intell Eng Des Anal Manuf 18(1):21–39

228. Corcho O, Fernandez-Lopez M, Gomez-Perez A (2003) Methodologies, tools and languagesfor building ontologies: where is their meeting point? Data Knowl Eng 46(1):41–64

229. Cordeiro C, Agarwal DP (2006) Ad Hoc and sensor networks: theory and applications. WorldScientific Publishing, Singapore

230. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn.MIT Press and McGraw-Hill, Boston

231. Costa D, Hertz A (1997) Ants can color graphs. J Open Res Software 48(3):295–305232. Costa AM, Cordeau J-F, Laporte G (2006) Steiner tree problems with profits. Inf Syst Oper

Res 44(2):99–115233. Costa AM, Cordeau J-F, Laporte G (2008) Fast heuristics for the Steiner tree problem with

revenues, budget and hop contraints. Eur J Oper Res 190(1):68–78234. Couch A (2008) System configuration management. In: Burgess Bergstra J, M (ed) Handbook

on network and system administration. Elsevier, Amsterdam, pp 75–133235. Couch A, Sun Y (2004) On observed reproducibility in network configuration management.

Sci Comput Program 53(2):215–253236. Cramer EJ, Dennis JE Jr, Frank PD, Lewis RM, Shubin GR (1994) Problem formulation for

multridisciplinary optimization. SIAM J Optim 4(4):754–776237. Crnkovic I, Larson M (2002) Challenges of component-based development. J Syst Soft

61(3):201–212238. Cross N (2000) Engineering design methods, 3rd edn. Wiley, London239. Culler D, Estrin D, Srivastava M (2004) Overview of sensor networks. IEEE Comput

37(8):41–49240. Cumming N (1994) Security: a guide to security systems design and equipment selection

and installation, 2nd edn. Butterworth-Heinemann, Oxford241. Current J, ReVelle C, Cohon J (1986) The hierarchical network design problem. Eur J Oper

Res 27(1):57–66242. Current J, Min H, Schilling D (1990) Multiobjective analysis of facility location decisions.

Eur J Oper Res 49(3):295–300243. Current J, Marsh M (1993) Multiple transportation network design and routing problems:

taxonomy and annotation. Eur J Oper Res 65(1):4–19244. Czyzowicz J, Kranakis E, Krizanc D, Pelc A, Martin MV (2003) Evaluation of hotlink

structure for improving web performance. J Web Eng 1(2):93–127245. Da Costa PCG, Buede DM (2000) Dynamic decision making: a comparison of approaches.

J Multi-Criterion Decis Anal 9(6):243–262246. Da Silveira GJC (2002) Improvement trajectories in operations and technology management:

concept, process and content issues. Technol Anal Strat Manage 14(2):227–240247. Dahmus JB, Gonzalez-Zugasti JP, Otto KN (2001) Modular product architecture. Des Stud

22(5):409–424248. Dai F, Wu J (2004) An expected localized algorithm for connected dominating set formation

in ad hoc wireless networks. IEEE Trans Parallel Distrib Syst 15(10):908–920249. Dan A, Dias DM, Kearney R, Lau TC, Nguyen TN, Parr FN, Sachs MW, Shaikh HH (2001)

Business-to-business integration with tpaML and a business-to-business protocol framework.IBM Syst J 40(1):68–90

250. Dantzig GB, Wolfe P (1960) Decomposiiton principle for linear programs. Oper Res 8:101–111

References 427

251. Darr TP, Klein M, McGuiness DL (1998) Special issue: configuration design. Artif IntellEng Des Anal Manuf 12(4):293–294

252. Dashchenko AI (ed) (2006) Reconfigurable manufacturing systems and transformable fac-tories. Springer, Berlin

253. Daskin MS (1995) Networks and discrete location. Models, algorithms, and applications.Wiley, New York

254. Dawande M, Keskinocak P, Swaminathan JM, Tayur S (2001) On bipartite and multipartiteclique problems. J Algorithms 41(2):388–403

255. de Aragao MP, Uchoa E, Werneck RF (2001) Dual heuristics on the exact solution of largeSteiner problems. Electron Notes Discrete Math 7:150–153

256. de la Higuera C, Casacuberta F (2000) Topology of strings: median string is NP-complete.Theoret Comput Sci 230(1–2):39–48

257. de Werra D (1985) An introduction to timetabling. Eur J Oper Res 19(2):151–162258. Dean JW, Yoon SJ, Susman GI (1992) Advanced manufacturing technology and organization

structure: empowerment or subordination? Organ Sci 3(2):203–229259. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester260. Deb S, Yeddanapudi M, Pattipati L, Bar-Shalom Y (1997) A generalized s-d assignment

algorithm for multisensor-multitarget state estimation. IEEE Trans Aerosp Electron Syst33(2/1):523–538

261. Debevc M, Donlagic D, Svecko R, Spasovski S, Meyer B (1994) Flexible user support withadaptive bar. In: Proceedings of international conference on human computer interactionEWHCI’94, vol 1, St. Petersburg, pp 129–134

262. Dekleva S, Shim JP, Varshney U, Knoerzer G (2007) Evolution and emerging issues inmobile wireless networks. Commun ACM 50(6):38–43

263. Dell’Amico M, Maffioli F (2000) Combining linear and non-linear objectives in spanningtree problems. J Comb Optim 4(2):253–269

264. Deneckere R, Iacovelli A, Kornyshova E, Souveyet C (2009) From method fragmentto method services. (Exploiting Modeling Methods for Systems Analysis and De-sign EMMSAD’08), Montpellier, France, Electronic preprint, pp 17, Nov. 2, 2009.http://arxiv.org/abs/0911.0428 [cs.SE]

265. Deneckere R, Kornyshova E, Rolland C (2011) Method family description and configuration.ICEIS 2011(3):384–387

266. Dessler G (1980) Organizational theory: integrating structure and behaviour. Prentice Hall,Englewood Cliffs

267. Dietmar K (1991) Channel assignment for cellular radio using neural networks. IEEE TransVeh Technol 40(1–2):188–193

268. Dijkstra EW (1956) A note on two problems in connection with graphs. Numer Math 1:269–271

269. Dinic E (1990) The fastest algorithm for the PERT problem with AND- and OR-nodes. In:Proceedings of integer programming and combinatorial optimization conference, Universityof Waterloo Press, pp 185–187

270. Dinu LP, Manea F (2006) An efficient approach for the rank aggregation problem. TheoretComput Sci 359(1–3):455–461

271. Diveev AI (2008) Controlled networks and their applications. Comput Math Math Phys48(8):1428–1442

272. Dixon JR (1966) Design engineering: intventness, analysis and deicison making. McGraw-Hill, New York

273. Dolk DR, Konsynski BR (1984) Knowledge representation for model management systems.IEEE Trans Soft Eng 10(6):619–628

274. Dorne R, Hao J-K (1999) Advances and trends in local search paradigms for optimization.In: Martello S, Osman IH, Roucairol C (eds) Voss S. Meta-Heuristics, Tabu search for graphcoloring, T-coloring and set T-coloringKluwer, Boston, pp 77–92

275. Dos Santos BL, Holsapple CW (1989) A framework for designing adaptive DSS interfaces.Decis Support Syst 5(1):1–11

428 References

276. Douieb K, Langerman S (2008) Dynamic hotlinks. Algorithmica 50(2):208–222277. Douieb K, Langerman S (2010) Near-entropy hotlink assignments. Algorithmica 58(2):221–

344278. Dovier A, Policriti EG, Rossi G (1998) A uniform axiomatic view of lists, multisets, and

sets, and the relevant unification algorithms. Fundamenta Informaticae 36(2/3):201–234279. Dowlatshahi S (1997) The role of product design in designer-buyer-supplier interface. Prod

Plann Control 8(6):522–532280. Drake DE, Hougardy S (2004) On approximation algorithms for the terminal Steiner tree

problem. Inform Proc Lett 89(1):15–18281. Drescher M, Vetta A (2010) An approximation algorithm for the maximum leaf spanning

arborescence problem. ACM Trans Algorihtms 6(3): art 46282. Dror M, Haouari M (2000) Generalized Steiner problems and other variants. J Comb Optim

4(4):415–436283. Dror M, Haouari M, Chaouachi J (2000) Generalized spanning trees. Eur J Oper Res

120(3):583–592284. Drusinsky D (2006) Modeling and verification using UML statecharts. Elsevier, Amsterdam285. Du D-Z, Smith JM, Rubinstein JH (2000) Advances in Steiner trees. Kluwer, Dordrecht286. Du D-Z, Wang L, Xu B (2001) The Euclidean bottleneck Steiner tree and Steiner tree with

minimum number of Steiner points. In: Wang J (ed) Proceedings of 7th annual internationalcomputing and combinatorics conference COCOON 2001. LNCS 2108, Springer, pp 509–518

287. Du D-Z, Hu X (2008) Steiner tree problems in computer communication networks. WorldScientific Publishing, Singapore

288. Du X, Jiao J, Tseng MM (2001) Architecture of product family: fundamentals and method-ology. Concurr Eng Res Appl 9(4):309–325

289. Du X, Jiao J, Tseng MM (2002) Graph grammar based product family modeling. ConcurrEng Res Appl 10(2):113–128

290. Dubov YA, Travkin SI, Iakimets VN (1986) Mnogokriterialjnye modeli postrienia variantovvybora system (Multicriteria models for building of system choice variants). Nauka, Moscow(in Russian)

291. Duff IS (1981) On algorithms for obtaining a maximum transversal. ACM Trans MathSoftware 7(3):315–330

292. Duin CW, Volgenant A, Voss S (2004) Solving group Steiner problems as Steiner problem.Eur J Oper Res 154(1):323–329

293. Dulucq S, Touzet H (2003) Analysis of tree edit distance algorithms. In: Baeza-Yates R,Chavez E, Crochemore M (eds) Proceedings of 14th annual symposium on combinatorialpattern matching CPM 2003, LNCS 2676, Springer, pp 83–95

294. Duncan R (1979) What is the right organizational structure? decision tree analysis providesthe answer. Organ Dyn 7(3):59–80

295. Dustdar S, Schreiner W (2005) A survey on web services composition. Int J Web Grid Serv1(1):1–30

296. Duong TH, Nguyen NT, Jo GS (2009) A hybrid method for integrating multiple ontologies.Cybern Syst 40(2):123–145

297. Dyer JS, Fishburn PC, Steuer RE, Wallenius J, Zionts S (1992) Multiple criteria decisionmaking, multiattribute utility theory: the next ten years. Manage Sci 38(5):645–654

298. Easton T, Singireddy A (2008) A large neighborhood search heuristic for the longest commonsubsequence problem. J Heuristics 14(3):271–283

299. Eder WE, Nosnedl S (2010) Introduction to design engineering: systematic creativity andmanagement. CRC Press, Boca Raton

300. Eghe L, Michel C (2003) String similarity measures for ordered sets of documents in infor-mation retrieval. Inf Process Manage 38(6):823–848

301. Ehrgott M (2005) Multicriteria optimization. Springer, Berlin302. Eiben AE, Van Der Hauw JK, Van Hemert JI (1998) Graph coloring with adaptive evolu-

tionary algorithms. J Heuristics 4(1):25–46

References 429

303. Eirnaki M, Vazirgiannis M (2003) Web-mining for web personalization. ACM Trans InternetTechnol 3(1):1–27

304. Eiter T, Gottlob G (1995) Identifying the minimal transversals of hypergraph and relatedproblems. SIAM J Comput 24(6):1278–1304

305. Eiter T, Gottlob G (2002) Hypergraph transversal computation and related problems in logicand AI. In: Proceedings of European conference on logics in AI JELIA 2002, LNCS 2424,Springer, pp 549–564

306. Elemento O, Gascuet O (2003) An exact and polynomial distance-based algorithm to recon-struct single copy tandem duplication trees. In: Baeza-Yates R, Chavez E, Crochemore M(eds) Proceedings 14th annual symposium on combinatorial pattern matching CPM 2003,LNCS 2676, Springer, pp 96–108

307. Elmaghraby ES (1995) Activity nets: a guided tour through some recent developments. EurJ Oper Res 82(3):383–408

308. ElMaraghy HA (ed) (2009) Changeable and reconfigurable manufacturing systems. Springer,London

309. Elzinga C, Wang H, Lin Z, Kumar Y (2011) Concordance and consensus. Inf Sci181(12):2529–2549

310. Emelyanov SV, Ozernoy VM, Larichev OI et al (1972) Choice of rational variants of tech-nological mines upon multiple criteria. Min J 5:62–71 (in Russian)

311. Engemann KJ (2003) Developments in decision technologies. Int J Technol Policy Manage3(3/4):225–229

312. England JL (1988) Hierarchies, theories, and methodologies. In: Trappl R (ed) Cyberneticsand Systems’88, Kluwer, pp 271–278

313. Ensen TR, Toft B (1995) Graph coloring problems. Wiley, New York314. Eom SB, Lee SM, Kim JK (1993) The intellectual structure of decision support systems

(1971–1989). Decis Support Syst 10(1):19–35315. Eppinger SD, Browning TR (2012) Design structure matrix methods and applications. The

MIT Press, Cambridge316. Ericsson A, Erixon G (1999) Controlling design variants: modular product platforms. ASME,

New York317. Erol K, Hendler J, Nau D (1996) Complexity results for HTN planning. Ann Math Artif

Intell 18(1):69–93318. Escoffer B, Milanic M, Paschos VT (2009) Simple and fast reoptimizations for Steiner tree

problem. Algorithmic Oper Res 4(2):86–94319. Estublier J, Leblang D, Van Der Hoek A, Conradi R, Clemm G, Tichy W, Wiborg-Weber

D (2005) Impact of software engineering research on the practice of software configurationmanagement. ACM Trans Software Eng Methodol 14(5):383–430

320. Eswaran KP, Tarjan RE (1976) Augmentation problems. SIAM J Comput 5(4):653–665321. Even S, Itai A, Shamir A (1976) On the comlexity of timetable and multicommodity flow

problems. SIAM J Comput 5(4):691–703322. Even G, Lotker Z, Ron D, Smorodinsky S (2003) Conflict-free colorings of simple geometric

regions with applications to frequency assignment in cellular networks. SIAM J Comput33(1):94–136

323. Even S, Kortsarz G, Slany W (2005) On network design problems: fixed cost flows and thecovering Steiner problem. ACM Trans Algorithms 1(1):74–101

324. Fagin R, Kumar R, Mahdian M, Sivakumar D, Vee E (2006) Comparing partial rankings.SIAM J Discrete Math 20(3):628–648

325. Farach M, Przytycka T, Thorup M (1995) On the agreement of many trees. Inf Process Lett55(6):297–301

326. Fassina G, Miertus S (eds) (2005) Combinatorial chemistry and technologies: methods andapplications, 2nd edn. CRC Press, Boca Raton

327. Feder T, Motwani R, O’Callaghan L, Olston C, Panigrahy R (2007) Computing shortestpaths with uncertainty. J Algorithms 62(1):1–16

430 References

328. Fedra K, Zhao C, Winkelbauer L (1993) User-oriented methodology and technology ofdecision analysis and support. In: Wessels J, Wierzbicki AP (eds) Interactive multicriteriadecision support: combining rule-based and numerical approaches, vol 397. Lecture notesin economics and mathematical systemsSpringer, Vienna

329. Feldman SI (1991) Software configuration management: Past uses and future challenges.In: Proceedings of the 3rd European software engineering conference ESEC’91, LNCS 550,Springer, pp 1–6

330. Feldman D, Fiat A, Sharir M (2006) Coresets for weighted facilities and their applications.In: Proceedings of 47th symposium on foundations of computer science FOCS 2006, pp315–324

331. Feldman M, Kortsarz G, Nutov Z (2009) Improved approximating algorithms for the di-rected Steiner forest. Proceedings of the 20th annual ACM-SIAM symposium on discretealgorithms (SODA). SIAM, Philadelphia, pp 922–931

332. Feng L, Wang G, Zeng C, Huang R (eds) (2006) Web information systems. In: WISE 2006workshops, LNCS 4256. Springer, New York

333. Fernandez A, Gomez S (2008) Solving non-uniqueness in agglomerative hierarchical clus-tering using multidendrograms. J Classif 25(1):43–65

334. Fernau H, Kneis J, Kratsch D, Langer A, Liedloff M, Raible D, Rossmanith P (2011) An exactalgorithm for the maximum leaf spanning tree problem. Theory Comput Sci 412(45):6290–6302

335. Ferrer M, Valveny E, Serratosa F, Riesen K, Bunke H (2010) Generalized median graphcomputation for means of graph embedding in vector space. Pattern Recognit 43(4):1642–1655

336. Figueira J, Greco S, Ehrgott M (eds) (2005) Multicriteria decision analysis: state of the artsurveys. Kluwer, Boston

337. Filkov V, Skiena S (2004) Integrating microarray data by consensus clustering. Int J ArtifIntell Tools 13(4):863–880

338. Finden CR, Gordon AD (1985) Obtaining common pruned trees. J Classif 2(1):255–276339. Fishburn PC (1970) Utility theory for decision making. Wiley, New York340. Fisher ML, Jaikumar R, Van Wassenhove L (1986) A multiplier adjustment method for the

generalized assignment problem. Manage Sci 32(9):1095–1103341. Fleischanderl G, Friedrich GE, Haselbock A, Schreiner H, Stumptmer M (1998) Configuring

large systems using generative constraint satisfaction. IEEE Intell Syst Appl 13(4):59–68342. Fleurent C, Ferland JA (1996) Genetic and hybrid algorithms for graph coloring. Ann Oper

Res 63(3):437–461343. Floudas CA (1995) Nonlinear and mixed-integer optimization: fundamentals and applica-

tions. Oxford University Press, New York344. Fogg CE, Le Gall DJ, Mitchell JL, Pennebaker WB (eds) (2002) MPEG video: compression

standard. Kluwer, Boston345. Forgionne GA (1991) Decision technology system: a vehicle to consolidate decision making

support. Inf Process Manage 27(6):679–697346. Fraternali P (1999) Tools and approaches for developing data-intensive web applications: a

survey. ACM Comput Surv 31(3):227–263347. Fredman ML, Tarjan RE (1987) Fobinacci heaps and their uses in improved network opti-

mization algorithms. J ACM 34(3):596–615348. French M (1994) Invention and evolution: design in nature and engineering, 2nd edn. Cam-

bridge University Press, Cambridge349. French S, Xu D-L (2005) Comparison study of multi-attribute decision analytic software. J

Multi-Criteria Decis Anal 13(2–3):65–80350. Fuchs B (2003) A note on the terminal Steiner tree problem. Inf Proc Lett 87(4):219–220351. Fuchs B, Kern W, Molle D, Richter S, Rossmanith P, Wang X (2007) Dynamic programming

for minimum Steiner trees. Theory Comput Syst 41(3):493–500352. Fuhrmann S, Krumke SO, Wirth H-C (2001) Multiple hotlink assignment. In: Brandstadt A,

Le VB (eds) Proceedings of WG 2001, LNCS 2204, Springer, pp 189–200

References 431

353. Fujie T (2003) An exact algorithm for the maximum leaf spanning tree problem. ComputOper Res 30(13):1931–1944

354. Fujita K (2002) Product variety optimization under modular architecture. Comput AidedDes 34(12):953–965

355. Funabiki N, Takefuji Y (1992) Neural network parallel algorithm for channel assignment incellular radio networks. IEEE Trans Veh Technol 41(4):430–437

356. Furnas GW, Zacks J (1994) Multitrees: enriching and reusing hierarchical structure. In: Pro-ceedings of international conference human factors in computing systems CHI’94, Boston,pp 330–336

357. Gabow HN (1977) Two algorithms for generating weighted spanning trees in order. SIAMJ Comput 6(1):139–150

358. Gabow HN, Galil Z, Spencer T, Tarjan RE (1986) Efficient algorithms for finding minimumspanning trees in undirected and directed graphs. Combinatorica 6(2):109–122

359. Gabriel K, Ehrig H (2012) Modelling evolution of communication platforms and scenariosbased on transformations of high-level nets and processes. Theoret Comput Sci 429:87–97

360. Gaeta M, Orciuoli F, Paolozzi S, Salemo S (2011) Ontology extraction for knowledge reuse:the e-learning perspective. IEEE Trans Syst Man Cybern Part C 41(4):798–809

361. Gaft MG, Milovidov NN, Serov VI, Gusev ED (1982) Decision making method for choice ofrational configurations of car. In: Problems and methods of decision making in organizationalmanagement systems, Institute for System Analysis, Moscow, pp 77–82 (in Russian)

362. Gagliolo M (2010) Online dynamic algorithm portfolios - minimizing the computationalcost of problem solving. Ph D thesis, University of Lugano

363. Galbraith JR (1979) Designing organizations: an executive guide to strategy, structure, andprocess revised, 2nd edn. Jossey-Bass, New York

364. Gallant J, Maier D, Storer JA (1980) On finding minimal length superstrings. J Comput SystSci 20(1):50–58

365. Galinier P, Hao J-K (1999) Hybrid evolutionary algorithms for graph coloring. J CombOptim 3(4):379–397

366. Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. ComputOper Res 33(9):2547–2562

367. Gandibleux X, Freville A (2000) Tabu search based procedure for solving the 0–1 multiob-jective knapsack problem: the two case. J Heuristics 6(3):361–383

368. Gangemi A (2005) Ontology design patterns for semantic Web content. In: Gal Y et al. (eds)Proceedings of ISWC 2005, LNCS 3729, Springer, pp 262–276

369. Gao J, Lu M (2005) Fuzzy quadratic minimum spanning tree problem. Appl Math Comput164(3):773–788

370. Garey MR, Johnson DS (1979) Computers and intractability: the guide to the theory ofNP-completeness. W.H., Freeman and Company, San Francisco

371. Garud R, Kumaraswamy A, Langlois R (eds) (2009) Managing in the age of modularity:architecture, networks, and organizations. Wiley, New York

372. Gavish B (1992) Topological design of telecommunication networks - the overall designproblem. Eur J Oper Res 58(2):149–172

373. Gavish B, Pirkul H (1991) Algorithms for the multi-resource generalized assignment prob-lem. Manage Sci 37(6):695–713

374. Gehrke J (2009) Encyclopedia of database systems. In: Liu L, Ozsu MT (eds) Scalabledecision tree construction. Springer, New York, pp 2400–2469

375. Gehrke J, Ramakrishnan R, Ganti V (2000) RainForest-a framework for fast decision treeconstruction of large datasets. Data Min Knowl Discov 4(2/3):127–162

376. Gellersen H-W, Wicke R, Gaedke M (1997) WebComposition: an object-oriented supportsystem for the Web engineering lifecycle. Comput Netw ISDN Syst 29(8–13):1429–1437

377. Gen-Huey C, Houle ME, Ming-Ter K (1993) The Steiner problem in distributed computingsystems. Inf Sci 74(1–2):73–96

378. Geng X, Huang Y, Winston AB (2003) Smart marketplaces: a step beyind web services. InfSyst E-Bus Manage 1(1):15–34

432 References

379. Gens GV, Levner EV (1978) Approximation algorithms for certain universal problems inscheduling theory. Eng Cybern 16(6):31–36

380. Geoffrion AM, Krishnan R (2001) Prospects for operations research in the e-business era.Interfaces 31(2):6–36

381. Georgas JC, Taylor RN (2004) Towards a knowledge-based approach to architectural adap-tation management. Proceedings of the 1st ACM SIGSOFT workshop of self-managed sys-tems. New Beach, California, pp 39–43

382. Georgas JC, van der Hoek A, Taylor RN (2005) Architectural runtime configuration man-agement in support of dependable self-adaptaion software. ACM SIGSOFT Software EngNotes 30(4):1–6

383. Georgiadis L, Tarjan RT (2012) Dominator tree certification and independent spanning trees.Electronic preprint, pp 44, Oct. 31, 2012. http://arxiv.org/abs/1210.8303 [cs.DS]

384. Gerlach J, Kuo F-Y (1990) An approach to dialog management for presentation and manip-ulation of composite models in decision support systems. Decis Support Syst 6(3):227–242

385. Gero JS (1990) Design prototypes: a knowledge representation schema for design. AI Mag11(4):26–36

386. Gershenson JK, Prasad GJ, Zhang Y (2003) Product modularity: definitions and benefits. JEng Des 14(3):295–313

387. Geyer P (2008) Multidisciplinary grammars supporting design optimization of buildings.Res Eng Des 18(4):197–216

388. Gfeller B (2012) Faster swap edge computation in minimum diameter spanning trees. Al-gorithmica 62(1–2):169–191

389. Ghanbari M (1999) Video coding: an introduction to standard codes. IEE TelecommunicationSeries 42, IEEE Press

390. Ghoshal S, Gratton L (2002) Integrating the enterprise. MIT Sloan Manage Rev 44(1):31–38391. Ghribi B, Logrippo L (2000) Understanding GPRS: the GSM packet radio service. Comput

Netw 34(5):763–779392. Ginige A, Murugesan S (2001) Web engineering: an introduction. IEEE Multimedia 8(1):14–

18393. Glotov VA, Paveljev VV (1984) Vector stratification. Nauka, Moscow (in Russian)394. Godor I, Magyar G (2005) Cost-optimal topology planning of hierarchical access networks.

Comp Oper Res 32(1):59–86395. Goemans MX, Y-s Myung (1993) A catalog of Steiner tree formulations. Networks 23(1):19–

28396. Gomes C, Selman B (2001) Algorithm portfolio. Artif Intell 126(1–2):43–62397. Gomes FC, de Mendes CN, Pardalos PM, Viana CVR (2008) A parallel multistart algorithm

for the closest string problem. Comp Oper Res 35(11):3636–3643398. Gonzalez-Zugasti JP, Otto KN, Baker JD (2000) A method for architecting product platforms.

Res Eng Des 12(2):61–72399. Goodman RM, Smyth P (1988) Decision tree design from a communication theory stand-

point. IEEE Trans Inf Theory 34(5):979–994400. Goodman RM, Smyth PA (1990) Decision tree design using information theory. Knowl

Acquis 2(1):1–19401. Gordeev EN, Tarastsov OG (1993) Steiner problem. Surv Discrete Math 5(2):3–28 (in

Russian)402. Gordon AD (1990) Constructing dissimilarity measures. J Classif 7(2):257–269403. Gordon AD (1999) Classification, 2nd edn. Chapman & Hall/CRC, Boca Raton404. Gower JC (1985) Encyclopedia of statistical science. In: Kotz S, Johnson NL (eds) Measures

of similarity, dissimilarity, and distance, vol 5. Wiley, New York, pp 397–405405. Gramm J (2008) Closest string problem. In: Kao M-Y (ed) Encyclopedia of algorithms.

Springer, Aalborg, pp 156–158406. Gramm J, Niedermaier R, Rossmanith P (2003) Fixed-parameter algorithms for closest string

and related problems. Algorithmica 37(1):25–42

References 433

407. Grebenuk GG, Krygin AA (2007) Algorithms for optimization of the number of switchingsin heat supply network reconfiguration. Autom Remote Control 68(12):2187–2197

408. Greene D, Doyle D, Cunningham P (2010) Tracking the evolution of communities in dynamicsocial networks. In: Memon N, Alhajj R (eds) Proceedings of 2010 international conferenceon advances in social network analysis and mining ASONAM 2010, IEEE Press, pp 176–183

409. Griffith W (1986) On consecutive k-out-of-n failure systems and their generalizaitons. In:Basu AP (ed) Reliability and quality control. Elsevier, Amsterdam, pp 157–165

410. Griggs JR, Yeh RK (1992) Labeling graphs with a condition at distance 2. SIAM J DiscreteMath 5(4):586–595

411. Griswold WG, Sullivan KJ, Song Y, Shonle M, Tewari N, Cai Y, Rajan H (2006) Modularsoftware design with crosscutting interfaces. IEEE Software 23(1):51–60

412. Grosh D, Agarwal R (1991) Model selection and sequencing in decision support systems.OMEGA 19(2–3):157–167

413. Grossmann IE (1990) Mixed-integer non-linear programming techniques for the synthesisof engineering systems. Res Eng Des 1(2/3):205–228

414. Grotschel M, Martin A, Weismantel R (1997) The Steiner tree packing problem in VLSIdesign. Math Program Ser B 78(2):2281–2675

415. Gruber TR (1993) A translation approach to portable ontology specification. Knowl Acquis5(2):199–220

416. Gu P, Sosale S (1999) Product modularalization for life-cycle engineering. Robot Comput-Integr Manuf 15(5):387–401

417. Gubko MV (2006) The search for optimal organizational hierarchies with homogeneousmanager cost functions. Autom Remote Control 69(1):89–104

418. Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algo-rithmica 20(4):179–193

419. Guha S, Khuller S (1999) Improved methods for approximating node weighted Steiner treesand connected dominating sets. Inf Comput 150(1):57–74

420. Guillemot S, Nicolas F (2006) Solving the maximum agreement subtree and the maximumcompatible tree problems on many bounded degree trees. In: Lewenstein M, Valiente G (eds)Proceedings of the international conference on combinatorial pattern matching CPM 2006,LNCS 4009, Springer, pp 165–176

421. Guitouni A, Martel J-M (1998) Tentitative guidelines to help choosing an appropriativeMCDM method. Eur J Oper Res 109(2):501–521

422. Gupta A, Pal M (2005) Stochastic Steiner tree without root. In: Caires L, Italiano GF,Monteiro L, Palamidessi C, Yung M (eds) Proceedings of 32nd international colloquium onautomata, languages and programming ICALP 2005, LNCS 3580, Springer, pp 1051–1063

423. Gupta A, Hajiaghayi M, Kumar A (2007) Stochastic Steiner tree with non-unifirm infla-tion. In: Charikar M, Jansen K, Reingold O, Rolim JDP (eds) Proceedings of approxima-tion, randomization, and combinatorial optimization: algorithms and techniques, APPROX-RANDOM 2007, LNCS 4627, Springer, pp 134–148

424. Gupta A, Kumar A, Pal M, Roughgarden T (2007) Approximation via cost sharing: Simplerand better approximation algorithms for network design. J ACM 54(3):11–49

425. Gupta D, Jalote P, Barua G (1996) A formal framewpork for on-line software version change.IEEE Trans Software Eng 22(2):120–131

426. Gusfield D (1999) Algorithms on strings, trees and sequences: computer science and com-putational biology. Cambridge University Press, Cambridge

427. Gutin G (1995) Cycles and paths in semicomplete multipartite digraphs, theorems and al-gorithms: a survey. J Graph Theory 19(4):481–505

428. Gutner S (2008) Elementary approximation algorithms for prize collecting Steiner tree prob-lems. In: Yang B, Du D-Z, Wang CA (eds) Proceedings of 2nd annual international confer-ence on combinatorial optimization and applications COCOA 2008, LNCS 5165, Springer,pp 246–254

429. Ha J-W, Kim B-H, Zhang B-T (2010) Layered hypernetwork models for cross-modal asso-ciative text and image keyword generation in multimodal information retrieval. In: ZhangB-T, Orgun MA (eds) Proceedings of PRICAI 2010, LNCS 6230, Springer, pp 76–87

434 References

430. Hac A (2003) Wireless sensor networks designs. Wiley, New York431. Hack S, Goos G (2008) Copy coalescing by graph recoloring. ACM SIGPLAN Not

43(6):227–237432. Hady L, Wozny G (2010) Computer-aided web-based application to modular plant design.

Computer Aided Chem Eng 28:685–690433. Haimes YY (1981) Hierarchical holographic modeling. IEEE Trans Syst Man Cybern

11(9):606–617434. Haimes YY, Tarvainen K, Shima T, Thadathil J (1990) Hierarchical multiobjective analysis

of large-scale systems. Hemisphere Publishing Corporation, New York435. Haine G (1999) GSM Networks: protocols, terminology and implementation. Artech House

Publishers, London436. Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68(12):1497–

1514437. Hall M (1986) Combinatorial theory, 2nd edn. Wiley, New York438. Hallett MT, McCartin C (2007) A faster FPT algorithm for the maximum agreement forest

problem. Theory Comput Syst 41(3):539–550439. Hamaher HW, Ruhe G (1995) On spanning tree problem with multiple objectives. Ann Oper

Res 52(4):209–230440. Hamel AM, Steel MA (1996) Finding a maximum compatible tree is NP-hard for sequences

and trees. Appl Math Lett 9(2):55–59441. Hamirez J-P, Hao J-K (2001) Scatter search for graph coloring. In: Selected papers from the

5th European conference on artificial evolution, pp 168–179442. Hanne T (2001) Intelligent strategies for meta multiple criteria decision making. Kluwer,

Boston443. Hannenhalli S, Pevzner P (1995) Transforming men into mice (polynomial algorithm for

genomic distance problem). Proceedings of 36th annual symposium on foundations of com-puter science FOCS, (1995) IEEE Computer Society. Milwaukee, Wisconsin, pp 581–592

444. Har-Peled S, Mazumdar S (2004) On coresets for k-mean and k-median clustering. In:Proceedings of 36th annual ACM symposium on theory of computing STOC 2004, Chicago,pp 291–300

445. Harary F (1969) Graphs theory. Addison Wesley, Reading446. Harary F, Maybee J (eds) (1985) Graphs and applications. Wiley, New York447. Harbane R, Heydemann M-C (2001) Efficient reconfiguration algorithms of de Bruijn and

Kautz networks into linear arrays. Theory Comput Sci 263(1–2):173–189448. Harel D (1987) STATECHARTS: A visual formalism for complex systems. Sci Comput

Program 8(3):231–274449. Harhalakis G, Lin CP, Nagi R, Proth JM (1992) Hierarchical decision making in computer-

integrated manufacturing systems. In: Proceedings of third international conference on CIM.CS Press, pp 15–24

450. Harper R (ed) (2003) Inside the smart home. Springer, London451. Haubl G, Trifts V (2000) Consumer decision making in online shopping environments: The

effects of interactive decision aids. Marketing Science 19(1):4–21452. Haxhimusa Y, Gland R, Kropatsch WG (2003) Constructing stochastic pyramids by MIDES

- maximal independent directed edge set. In: Hancock W, Vento M (eds) Proceedings IAPRworkshop GbPRP 2003, LNCS 2726, Springer, pp 24–34

453. Hazelrigg GA (1998) A framework for decision-based engineering design. J Mech Des120(4):653–658

454. Hebert C, Bretto A, Cremilleux B (2007) A data mining formalization to improve hypergraphminimal transversal computation. Fundamenta Informaticae 80(4):415–433

455. Heeks R (2005) Implementing and managing e-government. Sage Publications, Los Angeles456. Henderson RM, Clark K (1990) Architectural innovation: the reconfiguration of existing

product technologies and the failure of established firms. Adm Sci Q 35:9–30457. Herrera F, Herrera-Viedma E, Verdegay JL (1997) A rational consensus model in group

decision making using linguistic assessments. Fuzzy Sets and Syst 88(1):31–49

References 435

458. Herrera-Viedma E, Herrera F, Chiclana F (2002) A consensus model for multiperson decisionmaking with different preference structures. IEEE Trans Syst Man Cybern Part A 32(3):394–402

459. Hertz A, de Werra D (1987) Using tabu search techniques for graph coloring. Computing39(4):345–351

460. Heydon A, Levin R, Mann T, Yu Y (2006) Software configuration management system usingvesta. Springer, New York

461. Hillman J, Warren I (2004) Open framework for dynamic reconfiguration. In: Proceedingsof the 24 international conference on software engineering (ICSE 2004), Edinburgh, pp594–603

462. Hiremath C, Hill RR (2007) New greedy heuristics for the multiple-choice multidimensionalknapsack problem. Int J Oper Res 2(4):495–512

463. Hirschberg DS (1977) Algorithms for the longest common subsequence problem. J ACM24(4):664–675

464. Hoang DT, Vitter JS (2002) Efficient algorithms for MPEG video compression. Wiley, NewYork

465. Hoang VT, Sung W-K (2011) Improved algorithms for maximum agreement and compatiblesupertrees. Algorithmica 59(2):195–214

466. Holler H, Voss S (2004) Software tools for multilayer network design. Presentation. In:Proceedings IV international conference on Decision Support for telecommunications andinformation Society, Warsaw, Poland

467. Holsapple CW, Joshi KD (2002) A collaborative approach to ontology design. CommunACM 45(2):42–47

468. Holocher M, Michalski R, Solte D, Vicuna F (1997) MIDA: An open systems architecturefor model-oriented integration of data and algorithms. Decis Support Syst 20(2):135–147

469. Hong X, Nugent C, Mulvenna M, McClean S, Scotney B, Devlin S (2009) Evidential fusionof sensor data for activity recognition in smart homes. Pervasive Mobile Comput 5(3):236–252

470. Hopcroft J, Ullman J (1979) Introduction to automata theory, languages, and computation.Addison Wesley, Reading

471. Hopcroft J, Khan O, Kulis B, Selman B (2003) Natural communities in large linked net-works. In: Proceedings of the ninth ACM SIGKDD international conference on knowledgediscovery and data mining KDD’03, pp 541–546

472. Hopcroft J, Khan O, Kulis B, Selman B (2004) Tracking evolving communities in largelinked networks. Proceedings of the national academy of sciences 101(Suppl 1):5249–5353

473. Hoppner F, Klawonn F, Kruse R, Runkler T (1999) Fuzzy cluster analysis. Wiley, New York474. Hotz L, Wolter K, Krebs T (2006) Configuration in industrial product families. IOS Press,

Amsterdam475. Howard RA (1988) Decision analysis: practice and promise. Manage Sci 34(6):679–695476. Huang GQ, Mak KL (2000) Modelling the customer-supplier interface over the World Wide

Web to facilitate early supplier involvement in new product development. Institution ofMechanical Engineers Proceedings, Part B. J Eng Manuf B 214(9):759–769

477. Huang CC, Kusiak A (1998) Modularity in design of products and systems. IEEE Trans SystMan Cybern Part A 28(10):66–77

478. Huang Y, Geng X, Winston AB (2005) Network mapping services for dynamic selection ofWeb services: promises and challenges. Inf Syst E-Bus Manage 3(3):281–297

479. Hubka V, Eder WE (1988) Theory of technical systems. Springer, Berlin480. Hwang FK, Richards DS, Winter P (1992) The Steiner tree problem. Elsevier, Amsterdam481. Iijima J (1996) Automatic model building and solving for optimization software. Decis

Support Syst 18(3–4):293–300482. Imase M, Waxman BM (1991) Dynamic Steiner tree problem. SIAM J Discrete Math

4(3):369–384483. Inokuchi A, Washio T, Motoda H (2003) Complete mining of frequent patterns from data:

mining graph data. Mach Learn 50(3):321–354

436 References

484. Insua DR, Kersten GE, Rios J, Crima C (2008) Towards decision support for participatorydemocracy. Inf Syst E-Bus Manage 6(2):161–191

485. Intille SS (2002) Designing a home of the future. IEEE Pervasive Comput 1(2):80–86486. Isakowitz T, Bieber M, Vitali F (1998) Web information systems. Comm ACM 41(7):78–80487. Ishii K (1998) Modularity: a key concept in product life cycle engineering. In: Molina A,

Kusiak A, Sanshez J (eds) Handbook of Life Cycle Engineering. Kluwer, Dordrecht, pp511–531

488. Ishikawa K (1985) What is total quality control?. The japannese way, Prentice Hall, Engle-wood Cliffs

489. Itai A, Rodeh M (1989) The multitree approach to reliability in distributed networks. InfComput 79(1):43–59

490. Ivanov AO, Tuzhilin AA (1994) Minimal networks: the Steiner problem and its generaliza-tions. CRC Press, Boca Raton

491. Jacobs T (2012) On the complexity of optimal hotlink assignment. Algorithmica 62(3–4):982–1005

492. Jain AK (1989) Fundamentals of digital image processing. Prentice Hall, Englewood Cliffs493. Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv

31(3):264–323494. Janiak A, Kasperski A (2008) The minimum spanning tree problem with fuzzy costs. Fuzzy

Optim Decis Making 7(2):105–118495. Jansson J, Ng JH-K, Sadakane K, Sung W-K (2005) Rooted maximum agreement supertrees.

Algorithmica 43(4):293–307496. Jardine N, Sibson R (1971) Mathematical taxonomy. Wiley, London497. Jarke M, Rademacher FJ (1988) The AI potential of model management and its central role

in decision support. Decis Support Syst 4(4):387–404498. Jayant N (ed) (2005) Broadband last mile: access technologies for multimedia communica-

tions. CRC Press/Taylor & Francis, London499. Jech T (2002) Set theory. Springer, Berlin500. Jhoti H, Leach AR (eds) (2007) Structure-based drug discovery. Springer, New York501. Jiang D, Pei J (2009) Mining frequent cross-graph quasi-cliques. ACM Trans Knowl Discov

Data 2(4):1–42502. Jiang T, Li M (1995) On the approximation of shortest common supersequences and longest

common subsequences. SIAM Comput 24(5):1122–1139503. Jiang T, Timkovsky VG (1995) Shortest consistent superstring computable in polynomial

time. Theoret Comput Sci 143(1):113–122504. Jiang T, Wang L, Zhang K (1995) Alignment of trees - an alternative to tree edit. Theoret

Comput Sci 143(1):137–148505. Jiang X, Munger A, Bunke H (2001) On median graphs: properties, algorithms, and appli-

cations. IEEE Trans Pattern Anal Mach Intell 23(10):1144–1151506. Jiang X, Bunke H, Csirik J (2004) Median strings: A review. In: Last M, Kandel AA, Bunke

H (eds) Data mining in time series databases. World Scientific, New York, pp 173–192507. Jiao JR, Simpson TW, Siddique Z (2007) Product family design and platform-based product

development: a state-of-the-art review. J Intell Manuf 18(1):5–29508. Johnson DS, Niemi KA (1983) On knapsack, partitions, and a new dynamic programming

techniques for trees. Math Oper Res 8(1):1–14509. Johnson DS, Yannakakis M, Papadimitriou CH (1988) On generating all maximal indepen-

dent sets. Inf Proc Lett 27(3):119–123510. Johnson DS, Aragon CR, McGeoch LA, Schevon C (1991) Optimization by simulated

annealing: an experimental evaluation. Part II: graph coloring and number partitioning. OperRes 39(3):378–406

511. Johnson DS, Trick MA (eds) (1996) Cliques, coloring, and satisfiability. DIMACS Series inDiscrete Mathematics and Theoretical Computer Science, vol 26, AMS, Providence

512. Johnson J, Iravani P (2007) The multilevel hypernetwork dynamics of complex systems ofrobot soccer agents. ACM Trans Auton Adapt Syst 2(2): Art. no. 5

References 437

513. Johnston SL (2008) An efficient decentralized multiradar multitarget tracker for air surveil-lance. IEEE Trans Aerosp Electron Syst 44(2):655–677

514. Jones C (1991) An introduction to graph-based modeling systems. Part II: Graph-grammarsand the implementation. ORSA J Comput 3(3):180–206

515. Jones CV (1993) User interface development and decision support systems. In: HolsappleCW, Whinston AB (eds) Recent developments in decision support systems, NATO ASISeries F 101. Springer, Berlin

516. Jones JC (1992) Design methods, 2nd edn. Wiley, New York517. Jonyer I, Cook DJ, Holder LB (2001) Graph-based hierarchical conceptual clustering. J

Mach Learn Res 2:19–43518. Joobbani R, Siewiorek DP (1986) WEAVER: A knowledge-based routing expert. IEEE Des

Test Comput 3(1):12–23519. Jose A, Tollenaere M (2005) Modular and platform methods for product family design:

literature analysis. J Intell Manuf 16(3):371–390520. Jourdan I, Basseur M, Talbi E-G (2009) Hybridizing exact methods and metaheuristics: a

taxonomy. Eur J Oper Res 199(3):620–629521. Kabale M, Jaskowski B (1985) Generalized implicit enumeration algorihtm for graph col-

oring. Commun ACM 28(4):412–418522. Kamrani AK, Salhieh SM (2002) Product design for modularity, 2nd edn. Kluwer, Boston523. Kannan S, Proebsting T (1998) Register allocation in structured programs. J Algorithms

29(2):223–237524. Kaner C, Falk J, Nguyen HQ (1999) Testing computer software, 2nd edn. Wiley, New York525. Kaplan H, Sharir N (2005) The greedy algorithm for shortest superstrings. Inf Process Lett

93(1):13–17526. Kappel G, Proll B, Reich S, Retschitzegger W (eds) (2006) Web engineering - the discipline

of systematic development of Web applications. Wiley, New York527. Kapsalis A, Rayward-Smith VJ, Smith GD (1993) Solving the graphical Steiner tree problem

using genetic algorithm. J Open Res Software 44(4):397–406528. Karam N, Linckels S, Mainel C (2007) Semantic composition of lecture subparts for a

personalized e-learning. In: Franconi E, Kifer M, May W (eds) Proceedings of 4th europeansemantic web conference ESWC 2007, LNCS 4519, Springer, pp 716–728

529. Karger D, Motwani R, Sudan M (1998) Approximate graph coloring by semidefinite pro-gramming. J ACM 45(2):246–265

530. Karl H, Willig A (2007) Protocols and architectures for wireless sensor networks. Wiley,New York

531. Karniel A, Reich Y (2011) Managing the dynamics of new product development processes.Springer, Heidelberg

532. Karniel A, Reich Y (2011) Formalizing a workflow-net implementation of desig-structure-matrix-based process planning for new product development. IEEE Trans Syst Man CybernPart A 41(3):476–491

533. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW(eds) Complexity of Computer Computations. Plenum, New York, pp 85–103

534. Kastner W, Neuschwndtner G, Soucek S, Newman HM (2005) Communication systems forbuilding automation and control. Proc IEEE 93(6):1178–1203

535. Katz RH (1990) Toward a unified framework for version modeling in engineering databases.ACM Comput Surv 22(4):375–408

536. Kaula R (1994) Integrating decision support systems in organizations: A three-level frame-work. Ind Manage Data Syst. 94(4):6–14

537. Kavvadias DJ, Stavropoulos EC (2005) An efficient algorithm for the transversal hypergraphgeneration. J Graph Algorithms Appl 9(2):239–264

538. Kazienko P, Brodka P, Musial K, Gaworecki J (2010) Multi-layer social network creationbased on bibliographic data. In: Agrawal D (ed) Elmagarmid AK. IEEE CS Press, Social-Com/PASSAT, pp 407–412

438 References

539. Keeney RL, Raiffa H (1976) Decisions with multiple objectives: preferences and valuetradeoffs. Wiley, New York

540. Kellerer H, Mansini R, Pferschy U, Speranza MG (2003) An efficient fully polynomialapproximation scheme for the sub-sum problem. J Comput Syst Sci 66(2):349–370

541. Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin542. Kelsey T, Kotthoff L (2010) The exact closest string problem as a constraint satisfaction

problem. Electronic preprint, 16 pp., May 1, 2010. http://arxiv.org/abs/1005.0089 [cs.AI]543. Kemeny J (1959) Mathematics without numbers. Daedelus 88:577–591544. Kemeny JG, Snell JL (1960) Mathematical models in the social sciences. The MIT Press,

Cambridge, Mass, Reprint545. Kemp C, Tenenbaum JB (2008) The discovery of structural form. PNAS 105(31):10687–

10692546. Kendall M (1938) A new measure for rank correlation. Biometrika 30(1/2):81–93547. Kendall M (1962) Rank correlation methods, 3rd edn. Hafner, New York548. Khachiyan L, Boros E, Elbassioni K, Gurvich V (2006) An efficient implementation of a

quasi-polynomial algorithm for generating hypergraph transversals and its application injoint generation. Discrete Appl Math 154(16):2350–2372

549. Khadke K, Gershenson JK (2007) Technology change analysis for product and product plat-form design. In: 2007 Proceedings of the ASME international design engineering technicalconferences and computers and information in engineering conference DETC2007, vol 3,part A, pp 461–470

550. Khairllah M (2005) Physical security systems handbook: the design and implementation ofelectronic security systems. Butterworth-Heinemann, Oxford

551. Khuller S (1997) Approximation algoritms for finding highly connected subgraphs. In:Hochbaum DS (ed) Approximation Algorithms for NP-hard Problems. PWS PublishingCompany, Boston, pp 236–265

552. Khuller S, Zhu A (2002) The general Steiner star problem. Inf Proc Lett 84(4):215–220553. Kickert WJM (1978) Fuzzy theories on decision making. Nijhoff, London554. Kingston R, Carver S, Evans A, Turton I (2000) Web-based public participation geographical

information systems: an aid to local environment decision making. Comput Environ UrbanSyst 24(2):109–125

555. Kirkwood CW, Slaven MP, Maltz A (2005) Reconfiguring supply-chain decision making atIBM. Interfaces 35(6):460–473

556. Klamroth K, Wiecek M (2000) Dynamic programming approaches to the multiple criteriaknapsack problem. Nav Res Logist 47(1):57–76

557. Klein P, Ravi R (1995) A nearly best-possible approximation algorithm for node-weightedSteiner trees. J Algorithms 19(1):104–115

558. Kleitman D, West D (1991) Spanning trees with many leafs. SIAM J Discrete Math 4(1):99–106

559. Knoblock CA, Minton S, Ambite JL, Ashish N, Muslea I, Philpot AG, Tejada S (2001) TheAriadne approach to web-based information integration. Int J Coop Inf Syst 10(2):145–169

560. Knowles JD, Corne DW (2002) Enumeration of Pareto optimal multi-criteria spanningtrees - a proof of the incorrectness of Zhou and Gen’s proposed algorithm. Eur J OperRes 143(3):543–547

561. Knuth DE (1997 1998 The art of computer programming. vol. 1, 3rd ed., vol. 2, 3rd ed., vol.3, 2nd ed., Addison Wesley, Reading

562. Knuth D, Ratghunathan A (1992) The problem of compatible representatives. SIAM DiscreteMath 5(3):422–427

563. Kobsa A, Wahlster W (1989)(eds) User models in dialog systems. Springer, Berlin564. Koch T, Martin A (1998) Solving Steiner tree problems in graphs to optimality. Networks

32(3):207–232565. Koch T, Martin A, Voss S (2000) SteinLib: an updated library on Steiner problems in graphs.

ZIB-Report 00–37. http://elib.zib.de/steinlib566. Kohonen T (1985) Median strings. t. Pattern Recognit Lett 3(5):309–313

References 439

567. Kolakota R, Whinston A (1996) Frontiors in electronic commerce. Addison Wesley, Reading568. Koldasov GD (1986) Solution optimization during the morphological synthesis of technical

systems. Priborostroenie 29:3–6 (in Russian)569. Konemann J, Leonardi S, Schafer G (2005) A group-strategy proof mechanism for Steiner

forest. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms(SODA), pp 612–619

570. Korhonen P (1991) Using harmonious houses for visual pairwise comparison of multiplecriteria alternatives. Decis Support Syst 7(1):47–54

571. Korhonen P, Wallenius J, Zionts S (1984) Solving the discrete multiple criteria problemusing convex cones. Manage Sci 30(11):1336–1345

572. Kornai J, Liptak T (1965) Two-level planning. Econometrica 33:1451–169573. Kornyshova E, Salinesi C (2007) MCDM techniques selection approaches: state of the art.

In: Proceedings of the 2007 IEEE symposium on computational intellgence in multicriteriadecision making MCDM 2007, pp 22–29

574. Kornyshova E, Deneckere R (2012) Decision making method family MADISE: validationwithin the reuirements engineeirng domain. Proceedings 2012 sixth international conferenceon research challenges in information science RCIS 2012. Valencia, Spain, pp 1–10

575. Kotthoff L (2012) Algorithm selection for combinatorial search problems: a survey. Elec-tronic preprint, 37 pp., Oct. 30, 2012. http://arxiv.org/abs/1210.7959 [cs.AI]

576. Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Informatica15(2):141–145

577. Koutsopoulos I, Tassiulas L (2007) Joint optimal access point selection and channel assign-ment in wireless networks. IEEE/ACM Trans Netw 15(3):521–532

578. Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, Dordrecht579. Kramer J, Magee J (1985) Dynamic configuration for distributed systems. IEEE Trans Soft-

ware Eng 11(4):424–436580. Kranakis E, Krizanc D, Shende S (2001) Approximate hotlink assignment. In: Proceedings of

12th annual international symposium on algorithms and computation, LNCS 2223, Springer,pp 756–767

581. Kranakis E, Krizanc D, Shende S (2004) Approximate hotlink assignment. Inf Process Lett90(3):121–128

582. Krasnoshekov PS, Morozov VV, Fedorov VV (1979) Decomposition in design problems.Eng Cybern 2:7–17 (in Russian)

583. Kreng VB, Lee T-P (2004) Modular product design with grouping genetic algorithm - a casestudy. Comput Ind Eng 46(3):443–460

584. Krikhaar R, Crnkovic I (2007) Software configuration management. Sci Comput Program65(3):215–221

585. Krishnan R (1991) PDM: a knowledge-based tool for model construction. Decis SupportSyst 7(4):301–314

586. Kroqsqaard P, Liljefors T, Madsen U (eds) (2002) Textbook of drug design and discovery,3rd edn. CRC Press, Boca Raton

587. Kruger HA, Kearney WD (2008) Consensus ranking - an ICT security awareness case study.Comput Secur 27(7–8):254–259

588. Kuhn HW (2005) The Hungarian method for the assignment problems. Nav Res Log 52(1):7–21

589. Kuhn P (1999) Algorithms, complexity analysis and VLSI architectures for MPEG-4 motionestimation. Kluwer, Boston

590. Kulkarni RV, Forster A, Venayagamoorthy GK (2011) Computational intelligence in wirelesssensor networks: a survey. IEEE Commun Surv Tutorials 13(1):68–96

591. Kumar A, Pathak RM, Gupta YP, Parsaei HR (1995) A genetic algorithm for distributedsystem topology design. Comput Ind Eng 28(3):659–670

592. Kuntz ID (1992) Structure-based strategies for drug design and discovery. Science257(5073):1078–1082

440 References

593. Kuppuraju N, Ganesan S, Mistree F, Sobieski JS (1985) Hierarchical decision making insystem design. Eng Optim 8(3):223–252

594. Kusiak A (1999) Engineering design: products, processes, and systems. Academic Press,New York

595. Kusiak AP (2008) Interface structure matrix for analysis of products and processes. Pro-ceedings of the 15th CIRP international conference on life cycle engineering LCE 2008.Australia, Sydney, pp 444–448

596. Kuznetsov NA, Levin MSh, Vishnevsky VM (2005) Some combinatorial optimizationschemes for multi-layer network topology. In: Electronic proceedings of 17th IMACS worldcongress 2005, Paris, France, Paper T4-I-42-0486

597. Laber E (2006) Hotlink assignment on the Web. In: Ahlswede R et al. (eds) InformationTransfer and Combinatorics, LNCS 4123, Springer, pp 1088–1092

598. Lai WK, Coghill GG (1996) Channel assignment through evolutionary optimization. IEEETrans Veh Technol 45(1):91–96

599. Lai Y-J, Liu T-Y, Hwang C-L (1994) TOPSIS for MODM. Eur J Oper Res 76(3):486–500600. Land M, Fitzgerald B (2007) Web-based systems design: a study of contemporary practices

and an explanatory framework based on “method-in-action”. Requirements Eng 12(4):203–220

601. Lange S, Middendorf M (2005) Multi task hyperreconfigurable architectures: models andreconfiguration problems. Int J Embed Syst 1(3–4):154–164

602. Langlois RN, Robertson PL (1992) Networks and innovation in a modular system: lessonsfrom the microcomputer and stereo component industries. Res Policy 21(4):297–313

603. Larichev OI, Moshkovich HM, Furems EM (1986) Decision support system ‘Class’. In:Brehmer B, Jungerman H, Lourens P, Sevon G (eds) New Direction in Research on DecisionMaking. Elsevier, Amsterdam, pp 305–315

604. Larichev OI, Sternin M (1998) Man-computer approaches to the multicriteria assignmentproblem. Autom Remote Control 59(7):135–155

605. Layne K, Lee J (2001) Developing fully functional e-government: a four stage model. GovInf Q 18(2):122–136

606. Le Gall D (1991) MPEG: a video compression standard for multimedia applications. Com-mun ACM 34(4):47–58

607. Lee RM (1993) Direct manipulation of graph-based decision models. Decis Support Syst9(4):393–411

608. Lee W-P, Liu C-H, Lu C-C (2002) Intelligent agent-based systems for personalized recom-mendations in internet commerce. Expert Syst Appl 22(4):275–284

609. Lehman MM, Ramil JF (2001) Rules and tools for software evolution planning and man-agement. Ann Software Eng 11:15–44

610. Levachkine S, Guzman-Arenas A (2007) Hierarchy as a new data type for quantitativevariables. Expert Syst Appl 32(3):899–910

611. Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions and reversals.Cybern Control Theory 10(8):707–710

612. Levin MS (1973) Algorithms for fusion of information in control system. Radio-Electronics(Ser. “Radio-Electronic Engineering”) 1: 95–101 (in Russian)

613. Levin MS (1981) An extremal problem of organization of data. Eng Cybern 19(5):87–95614. Levin MS (1984) Combinatorial models in decision making. Procedures for Evaluation of

Multicriteria Objects, Institute of System Analysis, Moscow 9:35–41 (in Russian)615. Levin MS (1986) Application of combinatorial models in computer-aided systems. VNI-

ITEMR, Moscow (in Russian)616. Levin MS (1988) Vector-like proximity estimates for structures. In: Proceedings of All-

Russian Conf. “Problems and Methods of Decision Making in Organizational ManagementSystems”, Institute for System Analysis, Moscow, pp 116–117 (in Russian)

617. Levin MS (1988) Typical approach to quality evaluation in machine-building. VNIIKI,Moscow (in Russian)

618. Levin MS (1989) A hierarchical hypertext system. Autom Doc Math Linguist 23(3):52–59

References 441

619. Levin MS (1991) The usage of discrete MCDM problems: software analysis and design. In:Communication of the IBM-Users School, IBM-Users Association of Israel, pp 47–51

620. Levin MS (1993) Hierarchical components of human-computer systems. In: Bass LE,Gornostaev J, Unger C (eds) Human-Computer Interaction, LNCS 753, Springer, pp 37–52

621. Levin MS (1994) Hierarchical design of user interfaces. In: Blumenthal B, Gornostaev J,Unger C (eds) Selected Papers of 4th international conference on human-computer interac-tion EWHCI-94, LNCS 876, Springer, pp 140–151

622. Levin MS (1995) The third literacy. Aut Doc Math Linguist 29(3):66–81623. Levin MS (1995) Typical decision making problems in preparation of business plans. Sci

Tech Inf Process 22(5):24–34624. Levin MS (1996) Combinatorial design in hypertext. In: Proceedings of 5th international

conference on Information System and developement, Gdansk, pp 255–263625. Levin MS (1996) Hierarchical decision making for education in information engineering.

In: Proceedings of 7th annual European conference of EAEEIE, Oulu, pp 301–307626. Levin MS (1996) Hierarchical morphological multicriteria design of decomposable systems.

Concurr Eng Res Appl 4(2):111–117627. Levin MS (1996) Improvement of decomposable systems. Advances in Concurrent Engi-

neering. Techpub, Toronto, pp 319–325628. Levin MS (1998) Combinatorial engineering of decomposable systems. Kluwer, Dordrecht629. Levin MS (1998) Towards comparison of decomposable systems. Data Science, Classifica-

tion, and Related Methods. Springer, Tokyo, pp 154–161630. Levin MS (2000) Towards systems engineering education. In: Proceedings of 15th European

meeting on cybernetics and systems and research EMCSR-2011, vol 1, Vienna, pp 257–262631. Levin MS (2001) System synthesis with morphological clique problem: fusion of subsystem

evaluation decisions. Inf Fusion 2(3):225–237632. Levin MS (2002) Combinatorial evolution of composite systems. In: Proceedings of 16th

meeting on cybernetics and systems and research EMCSR-2002, vol 1, pp 275–280633. Levin MS (2002) Towards combinatorial analysis, adaptation, and planning of human-

computer systems. Appl Intell 16(3):235–247634. Levin MS (2003) Common part of preference relations. Found Comput Decis Sci 28(4):223–

246635. Levin MS (2005) Modular system synthesis: example for composite packaged software.

IEEE Trans Syst Man Cybern Part C 35(4):544–553636. Levin MS (2006) Composite systems decisions. Springer, London637. Levin MS (2006) Course ’system design: structural approach’. In: Proceedings 18th inter-

national conference design methodology and theory DTM-2006, vol 4a, Philadelphia, pp475–484

638. Levin MS (2007) Combinatorial technological systems problems (examples for commu-nication system). In: Proceedings of international conference on systems engineering andmodeling ICSEM-2007, Israel, pp 24–32

639. Levin MS (2007) Towards hierarchical clustering. In: Diekert V, Volkov M, Voronkov A(eds) Proceedings of CSR-2007, LNCS 4649, Springer, pp 205–215

640. Levin MS (2008) Morphological approach to electronic shopping. In: Proceedings of IEEEregion 8 international conference SIBIRCON-2008, Novosibirsk, pp 280–285

641. Levin MS (2009) Student research projects in system design. In: Proceedings of 1st inter-national conference CSEDU-2009, Lisbon, Portugal, vol 2, pp 67–72

642. Levin MS (2009) Combinatorial optimization in system configuration design. Automat Re-mote Control 70(3):519–561

643. Levin MS (2009) Towards morphological system design. Proceedings of IEEE 7th interna-tional conference on industrial informatics INDIN-2009. Cardiff, UK, pp 95–100

644. Levin MS (2010) Towards communication network development (structural systems is-sues, combinatorial models). In: Proceedings of IEEE region 8 international conferenceSIBIRCON-2010, Irkutsk, vol 1, pp 204–208

442 References

645. Levin MS (2011) k-Set frameworks in multi-criteria combinatorial optimisation. Int J Tech-nol Policy Manage 11(1):85–95

646. Levin MS (2011) Restructuring in combinatorial optimization. Electronic preprint. 11 pp,Febr 8, 2011. http://arxiv.org/abs/1102.1745 [cs.DS]

647. Levins MS (2011) Connection of user’s in last-mile problem. IEEE Trans Syst Man CybernPart A 41(2):370–374

648. Levin MS (2011) Towards k-set problem frameworks in education. In: Proceedings of the3rd international conference on computer supported education CSEDU-2011, vol 2, TheNetherlands, pp 99–104

649. Levin MS (2011) Four-layer framework for combinatorial optimization problems domain.Adv Eng Software 42(12):1089–1098

650. Levin MS (2011) Course on system design (structural approach). Electronic preprint, pp 22,Febr 19, 2011. http://arxiv.org/abs/1103.3845 [cs.SE]

651. Levin MS (2011) Towards configuration of applied Web-based information system. Elec-tronic preprint, pp 13 , Aug 31, 2011. http://arxiv.org/abs/3108.3865 [cs.SE]

652. Levin MS (2011) Aggregation of composite solutions: strategies, models, examples. Elec-tronic preprint, pp 72 , Nov 29, 2011. http://arxiv.org/abs/1111.6983 [cs.SE]

653. Levin MS (2012) Morphological methods for design of modular systems (a survey). Elec-tronic preprint, pp 20 , Jan 9, 2011. http://arxiv.org/abs/1201.1712 [cs.SE]

654. Levin MS (2012) Towards electronic shopping of composite product. Electronic Preprint.pp 10 , March 3, 2012. http://arxiv.org/abs/1203.0648 [cs.SE]

655. Levin MS (2012) Multiset estimates and combinatorial synthesis. Electronic preprint. pp 30, May 9, 2012.http://arxiv.org/abs/1205.2046 [cs.SY]

656. Levin MS (2012) Composition of modular telemetry system with interval multiset estimates.Electronic preprint. pp 9 , July 25, 2012. http://arxiv.org/abs/1207.6651 [cs.SY]

657. Levin MS (2012) Composite strategy for multicriteria ranking/sorting (methodological is-sues, examples). Electronic preprint. pp 24, Nov 9, 2012. http://arxiv.org/abs/1211.2245[math.OC]

658. Levin MS (2012) Towards design of system hierarchy (research survey). Electronic preprint.pp 36, Dec 7, 2012.http://arxiv.org/abs/1212.1735 [math.OC]

659. Levin MS (2012) Clique-based fusion of graph streams in multi-function system testing.Informatica 23(3):391–404

660. Levin MS (2012) Combinatorial synthesis of communication protocol ZigBee with inter-val multiset estimates. In: Proceedings of International 4th It. conference on ultra moderntelecommunication ICUMT-2012, St. Petersburg, pp 29–34

661. Levin MS (2013) Towards combinatorial evolution of composite systems. Expert Syst Appl40(4):1342–1351

662. Levin MS (2013) Note on combinatorial engineering frameworks for hierarchical modularsystems. Electronic preprint. pp 11, Mar 29, 2013. http://arxiv.org/abs/1304.0030 [math.OC]

663. Levin MS (2013) Improvement/extension of modular systems as combinatorial reengineer-ing (survey). Electronic preprint, pp 24, Apr 17, 2013. http://arxiv.org/abs/1304.4965 [cs.AI]

664. Levin MS (2013) Note on evaluation of hierarchical modular systems. Electronic preprint,pp 15, May 21, 2013. http://arxiv.org/abs/1305.4917 [cs.AI]

665. Levin MS (2013) Towards detection of bottlenecks in modular systems. Electronic preprint,pp 12, June 1, 2013. http://arxiv.org/abs/1306.0128 [cs.AI]

666. Levin MS (2013) Towards multistage design of modular systems. Electronic preprint, pp 13,June 19, 2013. http://arxiv.org/abs/1306.4635 [cs.AI]

667. Levin MS (2013) Synthesis of MPEG-like standard with interval multiset estimates. In:Proceedings of the eight international conference on digital telecommunications ICDT-2013,Italy, pp 14–19

668. Levin MS (2013) Modular design and improvement of the management system in the smarthome with the use of interval multiset estimates. J Commun Technol Electron 58(6):584–593

669. Levin MS (2013) A modular approach to the communication protocol and standard formultimedia information: a review. J Commun Technol Electron 58(6):594–601

References 443

670. Levin MS, Michailov AA (1987) Dialogue system for stratification. Proceedings of all-union institute for standardization in machine-building, VNIINMASH, Moscow 57:53–59(in Russian)

671. Levin MS, Michailov AA (1987) Building a system for group ranking. Models and Methodsof Optimization, Institute of System Analysis, Moscow 11:104–114 (in Russian)

672. Levin MS, Michailov AA (1987) Logical approach to organization of procedure expert strat-ification. In: Abstracts of 2nd All-Union School “Applied problems of Control for Macrosys-tems”. Institute of System Analysis, Moscow, pp 29–31 (in Russian)

673. Levin MS, Michailov AA (1988) Fragments of objects set stratification technology. Preprint,Moscow, Institute for System Analysis, Moscow (in Russian)

674. Levin MS, Michailov AA (1990) Dialogue System for Comparison of Multicriteria Objects.89.01.0045; 50890000275; 89.03. Description 77 p, Specification 3 p, Information Bulletin“Algorithms and Software”, Computing Center of Russian Academy of Sciences, Moscow,No. 1

675. Levin MS, Nisnevich ML (2001) Combinatorial scheme for management of life cycle: Ex-ample for concrete macrotechnology. J Intell Manuf 12(4):393–401

676. Levin MS, Elperin T (2003) Algorithm scheme for spatio-temporal pattern synthesis. Un-published manusript, The Ben-Guriuon University, Israel

677. Levin MS, Sokolova LV (2004) Hierarchical combinatorial planning of medical treatment.Comput Methods Program Biomed 73(1):3–11

678. Levin MS, Firer M (2005) Hierarchical morphological design of immunoassay technology.Comput Biol Med 35(3):229–245

679. Levin MS, Danieli MA (2005) Hierarchical decision making framework for evaluation andimprovement of composite systems (example for building). Informatica 16(2):213–240

680. Levin MS, Last M (2006) Design of test inputs and their sequences in multi-function systemtesting. Appl Intell 25(1):105–124

681. Levin MS, Khodakovskii IA (2007) Structural design of the telemetry system. Autom RemoteControl 68(9):1654–1661

682. Levin MS, Vishnitskiy RO (2007) Towards morphological design of GSM network. InfProcess 7(2):183–190

683. Levin MS, Leus AV (2009) Configuration of integrated security system. Proceedings of7th IEEE international conference on industrial informatics INDIN-2009. Cardiff, UK, pp101–105

684. Levin MS, Sharov SY (2009) Hierarchical morphological composition of Web-hosting sys-tem. J Integr Des Process Sci 13(1):1–14

685. Levin MS, Kruchkov O, Hadar O, Kaminsky E (2009) Combinatorial systems evolution:example of standard for multimedia information. Informatica 20(4):519–538

686. Levin MS, Andrushevich A, Kistler R, Klapproth A (2010) Combinatorial evolution ofZigBee protocol. In: Proceedings of of IEEE region 8 international conference SIBIRCON-2010, vol 1, Irkutsk, pp 314–319

687. Levin MS, Andrushevich A, Klapproth A (2010) Composition of management system forsmart homes. Inf Process 10(1): 78–86 http://www.jip.ru/2010/78-86-2010.pdf

688. Levin MS, Petukhov MV (2010) Multicriteria assignment problem (selection of accesspoints). Proceedings of 23rd international conference IEA/AIE-2010, “Trends in AppliedIntelligent Systems”, LNCS 6097, part II. Springer, Cordoba, pp 277–287

689. Levin MS, Petukhov MV (2010) Connection of users with a telecommunications network:multicriteria assignment problem. J Commun Technol Electron 55(12):1532–1542

690. Levin MS, Fimin AV (2010) Configuration of alarm wireless sensor element. In: Proceed-ings of 2nd international conference on Ultra Modern Telecommunication ICUMT-2010,Moscow, pp 924–928

691. Levin MS, Safonov AV (2010) Towards modular redesign of networked system. In: Pro-ceedinds of 2nd international conference on ultra modern telecommunication ICUMT-2010,Moscow, pp 109–114

444 References

692. Levin MS, Andrushevich A, Klapproth A (2011) Improvement of building automation sys-tem. In: Mehrotra KG et al (eds) Proceedings of 24th international ConferenceIEA/AIE-2011, LNCS 6704. Springer, Part II, pp 459–468

693. Levin MS, Nuriakhmetov RI (2011) Multicriteria Steiner tree problem for communicationnetwork. Electronic preprint, pp 11, Febr 12, 2011. http://arxiv.org/abs/1102.2524 [cs.DS]

694. Levin MS, Safonov AV (2011) Improvement of regional telecommunications networks. JCommun Technol Electron 56(6):770–778

695. Levin MS, Zamkovoy AA (2011) Multicriteria Steier tree with the cost of Steiner vertices.J Commun Technol Electron 56(12):1527–1542

696. Levin MS, Fimin AV (2012) Design of modular wireless sensor. Electronic preprint. pp 7,March 9, 2012. http://arxiv.org/abs/1203.2031 [cs.SE]

697. Levin MS, Andrushevich A, Kistler R, Klapproth A (2012) Combinatorial evolution andforecasting of communication protocol ZigBee, Electronic preprint. pp 6, April 15, 2012.http://arxiv.org/abs/1204.3259 [cs.NI]

698. Levitin G (2003) Linear multi-state sliding window systems. IEEE Trans Relaibility52(2):263–269

699. Lewandowsky G, Condon A (1996) Experiments with parallel graph coloring heuristicsand applications of graph coloring. In: Johnson DS, Trick MA (eds) Cliques, Coloring, andSatisfiability: Second DIMACS Implementation Challenge. Providence, AMS, pp 309–334

700. Lewis KE, Chen W, Schmidt LC (2006) (eds), Decision making in engineering design.ASME Press, New York

701. Leymann F, Roller D, Schmidt M (2002) Web services and business process management.IBM Syst J 41(2):198–211

702. Li HL (1987) Solving discrete multicriteria decision problems based on logic-based decisionsupport systems. Decis Support Syst 3(2):101–118

703. Li M, Ma B, Wang L (2002) On the closest string and substring problem. J ACM 49(2):157–171

704. Li L, Garibaldi J, Krasnogor N (2006) Automated self-assembly programming paradigm:initial investigation. In: Proceedings of the third IEEE international workshop on Engineeringof autonomic and autonomous systems EASe2006, IEEE Press, pp 25–36

705. Li Z, Liechty M, Xu J, Lev B (2014) A fuzzy multi-criteria group decision making method forindividual research output evaluation with maximum consensus. Knowl-Based Syst 56:253–263

706. Liang T-P (1985) Integrating model management with data management in decision supportsystems. Decis Support Syst 1(3):221–232

707. Liang T-P (1988) Development of a knowledge-based model management system. Oper Res36(6):849–863

708. Liang W (2002) Constructing minimum-energy broadcast trees in ad hoc wireless networks.Proceedings of 3rd MOBIHOC. ACM, New York, pp 112–122

709. Lin G-H, Xue G (1999) Steiner tree problem with minimum number of Steiner points andbounded edge-length. Inf Proc Lett 69(2):53–57

710. Lin G-H, Xue G (2000) On the terminal Steiner tree problem. Inf Proc Lett 84(2):103–107711. Lin J (1996) Integration of weighted knowledge bases. Artif Intell 83(2):363–378712. Lin W-L, Lo C-C, Chao K-M, Younas M (2008) Consumer-centeric QoS-aware selection of

web services. J Comput Syst Sci 74(2):211–231713. Lin Y-B (1997) OA&M for GSM network. IEEE Netw 11(2):46–57714. Lin YR, Chi Y, Zhu S, Sundaram H, Tseng BL (2008) FacetNet: a framework for analyzing

communities and their evolutions in dynamic networks. Proceedings of 17th internationalworld wide web conference WWW (2008) ACM Press. Beijing, Chine, pp 685–694

715. Lipson H, Pollack JB, Suh NP (2002) On the origin of modular evolution. Evolution56(8):1549–1556

716. Ljubic I, Weiskircher R, Pferschy U, Klau G, Mutzel P, Fischetti M (2006) An algorithmicframework for the exact solution of the prize-collecting Steiner tree problem. Math ProgramSer B 105(2–3):427–449

References 445

717. Lopez MF, Gomez-Perez A, Sierra JP, Sierra AP (1999) Building a chemical ontology usingmethodology and the ontology design environment. IEEE Intell Syst 14(1):37–46

718. Lu H, Ravi R (1992) The power of local optimization: approximation algorithms for max-imum leaf spanning tree. Proceedings of the annual allerton conferenc on communicationcontrol and computing, USA, University of Illinois 30:533–542

719. Lu H, Ravi R (1998) Approximating maximum leaf spanning trees in almost linear time. JAlgorithms 29(1):132–141

720. Lu J, Ruan D, Zhang G (eds) (2007) E-Service intelligence methodologies, technologies andapplications. Springer, Berlin

721. Lu Y, Smith S (2006) Augmented reality E-commerce assistant system: designing whileshopping. In: Proceedings of IDETC/CIE’06, Pennsylvania, DETC2006-99401

722. Lubetsky VA, Selivestrov AV (2004) Multipartite graphs with two vertices in each part. InfProcess 4(2):127–132 (in Russian)

723. Lubetsky VA, Selivestrov AV (2004) Note on cliques and alignments. Inf Process 4(3):241–246

724. Lucet C, Mendes F, Moukrim A (2006) An exact method for graph coloring. Comput OperRes 33(8):2189–2207

725. Lukasik S, Kokosinski Z, Swieton G (2008) Parallel simulated annealing algorithm forgraph coloring problem. In: Wyrzykowski R, Dongarra J, Karczewski K, Wasniewski J (eds)Proceedings of 7th international conference on parallel processing and applied mathematicsPRAM 2007, LNCS 4967, Springer, pp 229–238

726. Lust T, Teghem J (2010) The multiobjective multidimensional knapsack problem: a surveyand a new approach. Electronic preprint, 2011. http: //arxiv.org/abs/1007.4063.v1

727. Lustig Y, Vardi MY (2013) Synthesis from component libraries. Int Software Tools TechnolTransf 15(5–6):603–618

728. Ma B, Sun X (2008) More efficient algorithms for closest string and substring problems. In:Vingron M, Wong L (eds) Proceedings of international conference on research in computa-tional molecular biology RECOMB 2008, LNCS 4955, Springer, pp 396–409

729. Madhusudan T, Uttamsingh N (2006) A declarative approach to composing web services indynamic environments. Decis Support Syst 41(2):325–357

730. Magnanti TL, Wolsey LA (1995) Optimal trees. In: Ball MO et al (eds) Handbooks in OR& MS, vol 7. North-Holland, Amsterdam, pp 503–615

731. Magnani M, Rossi L (2011) The ml-model for multi-layer social networks. In: Proceedingsof ASONAM, IEEE computer society, pp 5–12

732. Magnani M, Rossi L (2012) Multi-stratum networks: toward a unified model of on-lineidentities. Electronic preprint, pp 18, Nov 1, 2012. http://arxiv.org/abs/1211.0169 [cs.SI]

733. Maier D (1978) The complexity of some problems on subsequences and supersequences. JACM 25(2):322–336

734. Mailharro D (1998) A classification and constraint-based framework for configuration. ArtifIntell Eng Des Anal Manuf 12(4):383–397

735. Malaguti E, Toth P (2008) An evolutionary approach for bandwidth multicoloring problems.Eur J Oper Res 189(3):638–651

736. Mangiameli P, West D, Rampal R (2004) Model selection for medical diagnosis decisionsupport systems. Decis Support Syst 36(3):247–259

737. Manino MV, Greenberg BS, Hong SN (1990) Model libraries: Knowledge representationand reasoning. ORSA J Comput 2(3):287–301

738. Manolescu I, Brambilla M, Ceri S, Comai S, Fraternali P (2005) Model-driven design anddeployment of service-enabled web applications. ACM Trans Internet Technol 5(3):439–479

739. Marakas GM (1999) Decision support systems in the twenty first century. Prentice Hall,Upper Saddle River

740. March JG, Simon HA (1993) Organizations, 2nd edn. Wiley-Blackwell, New York741. Mareschal B, Brans J-P (1988) Geometrical representation for MCDA. Eur J Oper Res

34(1):69–77

446 References

742. Marianov V, Serra D (2001) Hierarchical location-allocation models for congested systems.Eur J Oper Res 135(1):196–209

743. Martello S, Toth P (1990) Knapsack problem: algorithms and computer implementation.Wiley, New York

744. Martin MV, Ishii K (2001) Design for variety: developing standardized and modularizedproduct platform architecture. Res Eng Des 13(4):213–235

745. Martins EQ (1984) On a multicriteria shortest path problem. Eur J Oper Res 16(2):236–245746. Marzal A, Vidal E (1993) Computation of normalized edit distance and applications. IEEE

Trans Pattern Anal Mach Intell 15(9):926–932747. Matichin R, Peleg D (2004) Approximation algorithm for hotlink assignment in the greedy

model. Theoret Comput Sci 383(1):102–110748. McCormack C, Jones D (1997) Building a Web-based education system. Wiley, New York749. McDermott J (1982) R1: a rule-based configurer of computer systems. Artif Intell 19(2):39–

88750. McKeenly PK, Sadjadi SM, Kasten EP, Cheng BHC (2004) Composing adaptive software.

IEEE Comput 37(7):56–64751. Mehrabi MG, Ulsoy AG, Koren Y (2000) Reconfigurable manufacturing systems. J Intell

Manuf 11(4):403–419752. Mehrotra A (1997) GSM system engineering. Artech House Publishers, Boston753. Mehrotra A, Trick MA (1996) A column generation approach for graph coloring. INFORMS

J Comput 8(4):344–354754. Mens T, Demeyer S (2008) (eds) Software evolution. Springer, Berlin755. Mens T, Serebrenik A, Cleve A (2014) (eds) Evolving software systems. Springer, Berlin756. Mesarovic MD, Macko D, Takahara Y (1970) Theory of hierarchical, multilevel systems.

Academic Press, New York757. Meyer M, Lehnerd AP (1997) The power of product platform - building value and cost

leadship. Free Press, New York758. Mikkola JH, Gassmann O (2004) Managing modularity of product architecture: towards an

integrated theory. IEEE Trans Eng Manage 50(2):204–218759. Mikrin EA (2001) Some problems of synthesis of optimal modular systems of real-time

data handling in the ACS of the Alfa International Space Station. Autom Remote Control62(1):160–165

760. Milanovic N, Malek M (2004) Current solutions for web service composition. IEEE InternetComput 8(6):51–59

761. Militello LG, Dominguez CO, Lintern G, Klein G (2010) The role of cognitive systemsengineering in the systems engineering design process. Syst Eng 13(3):261–273

762. Minsky M (1975) A framework for representing knowledge. In: Winston PH (ed) The Psy-chology of Computer Vision. McGraw-Hill, New York, pp 211–277

763. Mintzberg H (1979) The structuring of organizations: a synthesis of the research. PrenticeHall, Englewood Cliffs

764. Mirkin BG (1979) Group choice. Halsted Press, New York765. Mirkin BG (2005) Clustering for data mining: a data recovery approach. Chapman &

Hall/CRC, New York766. Mirkin BG, Chernyi LB (1970) On measurement of distance between partition of a finite set

of units. Autom Remote Control 31:786–792767. Mirkin B, McMorris FR, Robets FS, Rzhetsky A (eds) (1996) Mathematical hierarchies and

biology. DIMACS Series in Discrete Mathathematics and Theoretical Computer Science,AMS, Providence

768. Mirkin B, Muchnik I (2002) Layered clusters of tightness set functions. Appl Math Lett15(2):147–151

769. Mishin S (2007) Optimal organizational hierarchies in firms. J Bus Econ Manage 8(2):79–99770. Mishra N, Ron D, Swaminathan R (2004) A new conceptual clustering framework. Mach

Learn 56(1–3):115–151

References 447

771. Mistree F, Smith W, Bras B (1993) A decision-based approach tp concurrent design. In:Parsaei HR, Sullivan WG (eds) Concurrent engineering: contemporary issues and moderndesign tools. Springer, New York, pp 127–158

772. Mitchell JL, Pennebaker WB, Fogg CE, Legall DJ (eds) (1996) MPEG video compressionstandard. Chapman & Hall, London

773. Mittal S, Frayman F (1989) Towards a generic model of configuration tasks. In: Proceedingsof the 11th joint conference on artificial intelligence, pp 1395–1401

774. Mittal S, Falkenhainer B (1990) Dynamic constraint satisfaction problem. In: Proceedingsof the 8th national conference on artificial intelligence, pp 25–32

775. Molnar M, Bellabas A, Lahoud S (2012) The cost optimal solution of the multi-constrainedmulticast routing problem. Comput Netw 56(13):3136–3149

776. Montemanni R, Gambardella L (2004) An exact algorithm for the robust shortest path prob-lem with interval data. Comput Oper Res 31(10):1667–1680

777. Montemanni R, Gambardella L (2005) A branch and bound algorithm for the robust spanningtree problem with interval data. Eur J Oper Res 161(3):771–779

778. Monti S, Tamayo P, Mesirov J, Golub T (2003) Consensus clustering: A resampling-basedmethod for class discovery and visualization of gene expression microarray data. Mach Learn52(1–2):91–118

779. Moon MJ (2002) The evolution of e-government among municipalities. Public Adm Rev62(4):424–433

780. Mora M, Frogionne G, Gupta JND (eds) (2003) Decision making support systems. IdeaGroup Publishing, Hershley, Achivements and challenges for the new decades

781. Moradkhan MD, Browne WN (2006) A knowledge-based evolution strategy for the multi-objective minimum spanning tree problem. In: Proceedings of 2006 IEEE congress on evo-lutionary computation CEC’2006, pp 1391–1398

782. Moran S, Snir S (2007) Efficient approximation of convex recoloring. J Comput Syst Sci73(7):1078–1089

783. Moran S, Snir S (2008) Convex recoloring of strings and trees: definitions, hardness resultsand algorithms. J Comput Syst Sci 74(5):850–869

784. Morefield CL (1997) Application of 0–1 integer programming to multitarget tracking prob-lems. IEEE Trans Autom Control 22(3):302–312

785. Morgan CL (1927) Emergent evolution. Northgate and Williams, London786. Moses J (2010) Architecting engineering systems. In: van de Poel I, Goldberg DE (eds)

Philosophy and Engineering. Springer, New York, pp 275–284787. Mousavi SR, Tabataba F (2012) An improved algorithm for the longest common subsequence

problem. Comp Oper Res 39(3):512–520788. Muhanna WA (1993) An object-oriented framework for model management and DSS de-

velopment. Decis Support Syst 9(2):217–229789. Muhanna WA, Pick RA (1994) Meta-modeling concepts and tools for model management:

a systems approach. Manage Sci 40(9):1093–1123790. Mullat JE (1976) Extremal subsystems of monotone systems: I and II. Autom Remote Control

37(5): 758–766 and 37(8): 1286–1294791. Muller-Lankenau C, Wehmeyer K, Klein S (2006) Strategic channel alignment: an analysis

of the configuration of physical and virtual marketing channels. Inf Syst E-Bus Manage4(2):187–216

792. Murat C, Pachos VT (2006) On the probabilistic minimum coloring and minimum k-coloring.Discrete Appl Math 154(3):564–586

793. Murata S, Yoshida E, Kurikawa H, Tomita K, Kokaji S (2001) Concept of self-reconfigurablemodular robotic system. Artif Intell Eng 15(4):383–387

794. Murhammer MW, Lee K-K, Motallebi P, Borghi P, Wozabal K (1999) IP network designguide. IBM red book, IBM, New York

795. Murtagh F (1983) A survey of recent advances in hierarchical clustering algorithms. ComputJ 26(4):354–359

448 References

796. Mussen MA (1992) Dimensions of knowledge sharing and reuse. Comput Biomed Res25:435–467

797. Nederlof J (2013) Fast polynomial-space algorithms using inclusion-exclusion (improvingon Steiner tree and related problems). Algorithmica 65(4):868–884

798. Nelson SA, Parkinson MB, Papalambros PY (2001) Multicriteria optimization in productplatform design. J Mech Des 123(2):199–204

799. Nemhauser GL, Trick MA (1998) Scheduling a major college basketball conference. OperRes 46(1):1–8

800. Nicolas F, Rivals E (2003) Complexities of centre and median string problems. In: Baeza-Yates R, Chavez E, Crochemore M (eds) Proceedings of 14th annual symposium on combi-natorial pattern matching CPM 2003, LNCS 2676, Springer, pp 315–327

801. Noltmeier H, Wirth H-C, Krumke SO (1999) Network design and improvement. ACMComput Surv 32(3es): art. no. 2

802. Norcio AF, Stanley J (1989) Adaptive human computer interfaces: a literature survey andperspective. IEEE Trans Syst Man Cybern 19(2):399–408

803. Norris M, Davis RE, Pengelly A (2000) Component-based network systems engineering.Artech House Publishers, Boston

804. Norman TL (2007) Integrated security systems design: concepts, specifications, and imple-mentation. Butterworth-Heinemann, Oxford

805. Novak R, Rugelj J, Kundus C (2001) Steiner tree based distributed multicast routing innetworks. Steiner Trees in Industries. Kluwer, Dordrecht, pp 327–352

806. Noy NF, Hafner C (1997) The state of the art in ontology design: A survey and comparativereview. AI Mag 18(3):53–74

807. Noy N, Musen M (2000) PROMPT: algorithm and tool for automated ontology merging andalignment. Proc AAAI 2000:450–455

808. Noy N, Doan AH, Halevy AY (2005) Semantic integration. AI Mag 26(1):7–10809. Obreque C, Marianov V, Rios M (2008) Optimal design of hierarchical network with free

main path extremes. Oper Res Lett 36(3):366–371810. Obreque C, Donoso M, Gutierrez G, Marianov V (2010) A branch and cut algorithm for the

hierarchical network design problem. Eur J Oper Res 200(1):28–35811. Oh H, Chae K (2007) An energy-efficient sensor routing with low latency, stability for smart

home network. Int Smart Home 1(2):71–82812. Oh S-C, Lee D, Kumara SRT (2005) A comparative illustration of AI planning-based web

services composition. ACM SIGecom Exch 5(5):1–10813. Oliveira CAS, Pardalos PM (2005) A survey of combinatorial optimization problems in

multicast routing. Comp Oper Res 32(8):1953–1981814. Oncan T (2007) A survey on the generalized assignment problem. Inf Syst Oper Res

45(3):123–141815. Orgyczak W, Wierzbicki A, Milewski M (2008) On multi-criteria approach to fair and

efficient bandwidth allocation. Omega 36(3):451–463816. Orman LV (2007) Consumer support systems. Commun ACM 50(7):49–54817. Osteen RE, Tou JT (1973) A clique-detection algorithm based on neighbourhoods in graphs.

Int J Comput Inf Sci 2(4):257–268818. Oster ZJ (2013) Reasoning with qualitative preferences to develop optimal component-based

systems. In: Proceedings of the (2013) international IEEE Press, conference on softwareengineering, pp 1456–1458

819. Osyczka A (2002) Evoluitonary algorithms for single and multicriteria design optimization.Physica-Verlag, Heidelberg

820. Otto KN, Wood KL (1998) Product evolution: a reverse engineering and redesign method-ology. Res Eng Des 10(4):226–243

821. Otto KN, Wood KL (2003) Product design: techniques in reverse engineering and newpruduct development. Prentice Hall, Upper Saddle River

822. Ozer M (1999) A survey of new product evolution models. Int J Prod Innov Manage 16(1):77–94

References 449

823. Ozernoy VM (1992) Choosing the “best” multiple criteria decision-making method. Inf SystOper Res 30(2):159–171

824. Pachos VT (1999) A survey of approximately optimal solutions to some covering and packingproblems. ACM Comput Surv 29(2):171–209

825. Pachos VT (2003) Polynomial approximation and graph-coloring. Computing 70(1):41–86826. Pahl G, Beitz W, Feldhusen J, Grote K-H (2007) Engineering design: a systematic approach,

3rd edn. Springer, London827. Palla G, Barabasi AL, Vicsek T (2007) Quantifying social group evolution. Nature 446:664–

667828. Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complex-

ity. Dover Pubns, Kent829. Papalambros P, Wilde DJ (2000) Principles of optimal design: modeling and computation.

Cambridge University Press, Cambridge830. Papazoglou MP, van den Heuvel W-J (2006) Service-oriented design and development

methodology. Int J Web Eng Technol 2(4):412–442831. Para J, Hossain MA, Uribarren A, Jacob E, Saddik AE (2009) Flexible smart home ar-

chitecure using device profile for web services: a peer-to-peer approach. Int J Smart Home3(2):39–56

832. Pardalos PM, Wolkowicz H (eds) (1994) Quadratic assignment and related problems. AMS,Providence

833. Pardalos P, Batzyn M, Maslov E (2013) Cliques and quasi-cliques in large graphs: theory andapplications. Proceedings of international conference on discrete optimization and operationsresearch DOOR-2013. Novosibirsk, Sobolev Institute of Mathematics, pp 24–28

834. Paredis CJJ, Diaz-Calderon A, Sinha R, Khosla PK (2001) Composable models forsimulation-based design. Eng Comput 17(2):112–128

835. Pareto V (1971) Mannual of political economy. (English translation). A. M. Kelley Publish-ers, New York

836. Parra-Hernandez R, Dimopoulos N (2002) A new heuristic for solving the multichoicemultidimensional knapsack problem. IEEE Trans Syst Man Cybern Part A 35(5):708–717

837. Pedrycz W (2005) Knowledge-based clustering. Wiley, New York838. Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: Proceedings of

11th ACM SIGKDD international conference on Knowledge Discovery in Data Mining, pp228–238

839. Peine A (2009) Understanding the dynamics of technological configurations: a conceptualframework and the case of smart home. Technol Forecast Soc Chang 76(3):396–409

840. Pemmaraju S, Skiena S (2003) Computational discrete mathematics: combinatorics andgraph theory with mathematica. Cambridge University Press, New York

841. Pereira F (2002) The MPEG-4 book. Wiley, New York842. Pergini S, Goncalves MA, Fox EA (2004) Recommender systems research: a connection-

centeric survey. J Intell Inf Syst 23(2):107–143843. Perkowitz M, Etzioni O (1999) Towards adaptive web sites: conceptual framework and case

study. Comput Netw 31(11–16):1245–1258844. Perkowitz M, Erzioni O (2000) Adaptation web sites. Commun ACM 43(8):152–158845. Petrik M, Zilberstein S (2006) Learning parallel portfolios of algorithms. Ann Math Artif

Intell 48(1–2):85–106846. Petrovsky AB (2008) Clustering and sorting multi-attribute objects in multiset metric space.

In: Proceedings of 4th international conference intelligent systems IS 2008, pp 1144–1148847. Pettie S, Ramachandran V (2002) An optimal minimum spanning tree algorithm. J ACM

49(1):16–34848. Pettie S, Ramachandran V (2002) A randomized time-work optimal parallel algorithm for

finding a minimum spanning forest. SIAM J Comput 31(6):1876–1895849. Petzold LR (1983) Automatic selection of methods for solving stiff and nonstiff systems of

ordinary differential equations. SIAM J Sci Comput 4(1):136–148

450 References

850. Phillips C, Warnow TJ (1996) The asymmetric tree - a new model for building consensustree. Discrete Appl Math 71(1–3):311–335

851. Piaget J (1971) Biology and knowledge. The University of Chicago Press, Chicago852. Pinto HS, Martins JP (2001) A methodology for ontology integration. Proceedings of 1st

international conference knowl capture K-CAP’01. Victoria, Canada, pp 113–138853. Piramuthu S (2005) Knowledge-based framework for automated dynamic supply chain con-

figuration. Eur J Oper Res 165(1):219–230854. Pirkul H, Current J, Nagarajan V (1991) The hierarchical network design problem: A new

formulation and solution procedures. Transp Sci 25(3):175–182855. Pitkow J, Schutze H, Cass T, Cooley R, Turnbull D, Edmonds A, Adar E, Breuel T (2002)

Personalized search. Commun ACM 45(9):50–55856. Pollock LL, Soffa ML (1992) Incremental global reoptimization of programs. ACM Trans

Program Lang Syst 14(2):173–200857. Poore AB (1994) Multidimensional assignment formulation of data association problems

arising from multitarget and multisensor tracking. Comput Optim Appl 3(1):27–57858. Poore AB, Rijavec N (1993) A lagrangian relaxation algorithm for multidimensional assign-

ment problems arising from multitarget tracking. SIAM J Optim 3(3):544–563859. Porter MA, Onnela JP, Mucha PJ (2009) Communities in networks. Not AMS 56(9):1082–

1097860. Power DJ (2004) Specifying an expanded framework for classifying and decribing decision

suport systems. Commun Assoc Inf Syst 13:258–266861. Pracht WE (1990) Model visualization: graphical support for DSS problem structuring and

knowledge organization. Decis Support Syst 6(1):13–27862. Prins JEJ (2006) Designing e-government, 2nd edn. Kluwer, Dordrecht863. Proctor RW, Nof SY, Yih Y (eds) (2011) Cultural factors in systems design: decision making

and actions. CRC Press, Boca Raton864. Prokopska A (2001) Application of morphological analysis methodology in architectural

design. Acta Polytechnica 41(1):46–54865. Pruhs K, Woeginger GJ (2007) Approximation schemes for a class of subset selection prob-

lems. Theoret Comput Sci 382(2):151–156866. Pulvermuller E, Goos G, Assmann U (2005) Preface: New software composition concepts.

Sci Comput Program 56(1–2):1–4867. Pyt’ev YP (1993) Morphological image analysis. Pattern Recognit Image Anal 3(1):19–28868. Pyt’ev YP (1997) Methods for morphological analysis of color images. Pattern Recognit

Image Anal 8(4):517–531869. Qi H, Iyengar SS, Chakrabarty K (2001) Distributed sensor networks - a review of recent

research. J Franklin Inst 338(6):655–668870. Qiu J, Liu Y, Mohan G, Chua KC (2011) Fast spanning tree reconnection mechanism for

resilient Metro Ethernet networks. Comput Netw 55(12):2717–2729871. Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81–106872. Quinlan JR (1990) Decision trees and decision making. IEEE Trans Syst Man Cybern

20(2):339–346873. Rahnema M (1993) Overview of the GSM systems and protocol architecture. IEEE Commun

Mag 31(4):92–100874. Rajpathak DG, Motta E, Zdrahal Z, Roy R (2006) A generic library of problem solving

methods for scheduling applications. IEEE Trans Knowl Data Eng 18(6):815–828875. Rakov DL (1996) Morphological synthesis method of the search for promising technical

systems. IEEE Aerosp Elect Syst Mag 11(12):3–8876. Ramanathan S (1996) Multicast tree generation in networks with asymmetric links.

IEEE/ACM Trans Netw 4(4):558–568877. Ramanathan S (1999) A unified framework and algorithm for channel assignment in wireless

networks. Wirel Netw 5(2):81–94878. Ramanathan S, Lloyd EL (1993) Scheduling algorithms for multi-hop radio networks.

IEEE/ACM Trans Netw 1(2):166–177

References 451

879. Ramirez-Marquez JE, Sauser BJ (2009) System development planning via system maturityoptimization. IEEE Trans Eng Manage 56:533–548

880. Rao SS (2009) Engineering optimization: theory and practice, 4th edn. Wiley, New York881. Rashidi P, Cook DJ (2009) Keeping the resident in the loop: adapting the smart home to the

user. IEEE Trans Syst Man Cybern Part A 39(5):949–959882. Rasmussen J (1985) The role of hierarchical knowledge representation in decision making

and system management. IEEE Trans Syst Man Cybern 15(2):234–243883. Rasoul Mousavi S, Tabataba F (2012) An improved algorithm for the longest common

subsequence problem. Eur J Oper Res 39(3):512–520884. Raymond JW, Gardiner EJ, Willett P (2002) RASCAL: calculation of graph similarity using

maximal common edge subgraph. Comput J 45(6):631–644885. Reich Y (1995) A critical review of general design theory. Res Eng Des 7(1):1–18886. Reich Y, Kapeliuk A (2005) A framework for organizing the space of decision problems with

application to solving subjective, context-dependent problems. Decis Support Syst 41(1):1–19

887. Reinhartz-Berger I, Dori D, Katz S (2002) OPM/Web-object-process methodology for de-veloping Web applications. Ann Software Eng 13(1–4):141–161

888. Resende MGC, Pardalos PM (eds) (2006) Handbook of optimizaiton in telecommunications.Springer, New York

889. Resnick P, Varian HR (1997) Recommender systems. Commun ACM 40(3):56–60890. Reynolds J (2004) The complete e-commerce book: design, build and maintain a successful

Web-based business, 2nd edn. CMP Books, Gilroy891. Ribeiro RA, Rodrigues AJ, Zarate P, (eds), (2003) Special issue “Decision Support Systems:

Current Research”. Eur J Oper Res 145(2)892. Ricci F, Rokach L, Shapira B, Kantor PB (eds) (2011) Recommender systems handbook.

Springer, Berlin893. Rice JR (1976) The algorithm selection problem. In: Advances in Computers, vol 15, Aca-

demic Press, pp 65–118894. Ritchey T (2006) Problem structuring using computer-aided morphological analysis. J Open

Res Software 57(7):792–801895. Ritchey T (2012) Wicked problems/social messes: decision support modelling with mor-

phological analysis. Springer, Berlin896. Robbes R, Lanza M, Lungu M (2007) An approach to software evolution based on semantic

change. In: Dwyer MB, Lopes A (eds) Proceedings of 10th international conference onfundamental approaches to software engineering FASE 2007, LNCS 4422, Springer, pp27–41

897. Robinson DF, Foulds LR (1981) Comparison of phyogenetic trees. Math Bio 53(1/2):131–147

898. Robles-Kelly A, Hancock ER (2004) String edit distance, random walks and graph matching.Int J Pattern Recognit Artif Intell 18(3):315–327

899. Rodriguez MA, Jarur MC (2005) A genetic algorithm for searching spatial configurations.IEEE Trans Evol Comput 9(3):252–270

900. Rodrigues EM, Sagot MF, Wakabayashi Y (2007) The maximum agreement forest problem:Approximation algorithms and computational experiments. Theoret Comput Sci 374(1–3):91–110

901. Roman D, Keller U, Lausen H, de Bruijn J, Lara R, Stollberg M, Pollers A, Feier C, BusslerC, Fensel D (2005) Web service modeling ontology. Appl Ontology 1(1):77–106

902. Roozenburg N (1993) On the pattern of reasoning in innovative design. Des Stud 14(1):6–18903. Rosenthal-Sabroux C, Zarate P (eds) (1997) Special Issue “Artificial Intelligence Tools for

Decision Support Systems”. Eur J Oper Res 103(2)904. Rosenwein MB, Wong RT (1995) Constrained Steiner tree problem. Eur J Oper Res

81(2):430–439905. Ross A, Venkataramanan MA, Ernstberger KW (1998) Reconfiguring the supply network

using current performance data. Dec Sci 29(3):707–724

452 References

906. Roth MA, Wolfson DC, Kleewein JC, Nelin CJ (2002) Information integration: a new gen-eration of information technology. IBM Syst J 41(4):563–577

907. Rouse WB (1986) A note on the nature of creativity in engineering: implications for sup-porting system design. Inf Process Manage 22(4):279–285

908. Rouse WB, Cannon-Bowers JA, Salas E (1992) The role of mental models in team perfor-mance in complex systems. IEEE Trans Syst Man Cybern 22(6):1296–1308

909. Rouse WB (2005) A theory of enterprise transformation. Syst Eng 8(4):279–295910. Roy B (1996) Multicriteria methodology for decision aiding. Kluwer, Dordrecht911. Rust RT, Kannan PK (2007) E-services: a new paradigm for business in the electronic

environment. Commun ACM 46(6):36–42912. Saaty TL (1988) The analytic hierarchy process. MacGraw-Hill, New York913. Sabin D, Freuder EC (1996) Configuration as composite constraint satisfaction. In: Interrante

LD, Luger GF (ed) Workshop notes of AAAI fall symposium on configuration, USA, pp26–36

914. Sabin D, Weigel R (1998) Product configuration frameworks - a survey. IEEE Intell SystAppl 13(4):42–49

915. Sager TJ, Lin S-J (1991) Pruning procedure for exact graph coloring. ORSA J Comput3(3):226–230

916. Sahal D (1981) Patterns of technological innovations. Addison Wesley, Reading917. Sahni S (1975) Approximate algorithms for 0/1 knapsack problem. J ACM 22(1):115–124918. Sahni S (1976) Algorithms for scheduling independent tasks. J ACM 23(1):116–127919. Sahni S, Horowitz E (1978) Combinatorial problems: reducibility and approximation. Oper

Res 26(5):718–759920. Saitou N, Imanishi T (1989) Relative efficiencies of the Fitch-Margoliash, maximum-

parsimony, minimum-likehood, minimum-evolution, and neighbor-joining methods of phy-logenetic tree construction in obtaining the correct tree. Mol Biol Evol 6(5):514–525

921. Sakashita M, Makino K, Nagamochi H, Fujishige S (2006) Minimum transversals in posi-modular systems. In: Azar Y, Erlebach T (eds) Proceedings of 14th annual European sym-posium on algorithms ESA 2006, LNCS 4168, Springer, pp 576–587

922. Salvador F, Forza C, Rungtusanatham M (2002) Modularity, product variety, productionvolume, and component sourcing: theorizing beyond genetic prescriptions. J Oper Manage20(5):549–575

923. Sanchez R, Mahoney JT (1996) Modularity, flexibilty, and knowledge management in prod-uct and organization design. Strat Manage J 17:63–76

924. Sanchis LA (2002) Experimental analysis of heuristic algorithms for the dominating setproblem. Algorithmica 33(1):3–18

925. Santos M, Drummond LMA, Uchoa E (2007) A distributed primal-dual heuristic for Steinerproblems in networks. In: Demetrescu C (ed) Proceedings of 6th international workshop onexperiments algorithms WEA 2007, LNCS 4525, Springer, pp 175–188

926. Scarelli A, Narula SC (2002) A multicriteria assignment problem. J Multi-Criteria Dec Anal11(2):65–74

927. Schaerf A (1999) A survey of automated timetabling. Artif Intell Rev 13(2):87–127928. Schafer R, Sikora T (1995) Digital video coding standards and their role in video commu-

nications. Proc IEEE 83:907–923929. Schaffter MW (1997) Scheduling with forbidden sets. Discrete Appl Math 72(12):155–166930. Schein J (2007) An information model for building automation systems. Autom Constr

16(2):125–139931. Scherlis WL, Eisenberg J (2003) IT research, innovation, and e-government. Commun ACM

46(1):67–68932. Schewe K-D, Thalheim B, Binermann-Zdanowitcz A, Kaschek R, Kuss T, Tschiedel B

(2005) A conceptual view of Web-based E-learning. Edu Inf Tech 10(1–2):83–110933. Schierholt K (2001) Process configuration: combining the principles of product configuration

and process planning. Artif Intell Eng Des Anal Manuf 15(5):411–424

References 453

934. Schilling MA (2000) Toward a general modular systems theory and its application to interfirmproduct modularity. Acad Manage Rev 25(2):312–334

935. Schmidt LC, Cagan J (1997) GGREADA: a graph grammar-based machine design algorithm.Res Eng Des 9(4):195–213

936. Schmidt LC, Cagan J (1998) Optimal configuration design: an integrated approach usinggrammars. J Mech Des 120(1):2–9

937. Schmidt LC, Shetty H, Chase SC (2000) A graph grammar approach for structure synthesisof mechanisms. J Mech Des 122(4):371–376

938. Schneider-Hufschmidt M, Kuhme T, Malinowsli U (1993) Adaptive user interfaces: princi-ples and practice. Elsevier, Amsterdam

939. Segev A (1987) The node-weighted Steiner tree problem. Networks 17(1):1–17940. Selivestrov AV, Lubetsky VA (2006) Search for concervative parts of nucleotide sequences.

Inf Process 6(1):33–36 (in Russian)941. Selkow SM (1977) The tree-to-tree editing problem. Inf Proc Lett 6(6):184–186942. Semple C, Steel M (2000) A supertree method for rooted trees. Discrete Appl Math 105(1–

3):147–158943. Sered Y, Reich Y (2006) Standardization and modularization driven by minimizing overall

process effort. Comput Aided Des 38(5):405–416944. Sereni J-S (2008) Randomly colouring graphs (a combinatorial view). Comput Sci Rev

2(2):63–95945. Sewell EC (1996) An improved algorithm for exact graph coloring. In: Johnson DS, Trick

MA (eds) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge.Providence, RI, AMS, pp 259–373

946. Serzhantov AV (1983) An optimal deciphering algorithm for some classes of monotonicfunctions. USSR Comput Math Math Phys 23(1):144–148

947. Shai O, Titus N, Ramani K (2008) Combinatorial synthesis approach employing graphnetworks. Adv Eng Inform 22(2):161–171

948. Shakun MF (1988) Evolutionary system design: policy making under complexity and groupdecision support systems. Holden Day Inc., Oakland

949. Shasha D, Zhang K (1989) Simple fast algorithms for the editing distance between trees andrelated problems. SIAM J Comput 18(6):1245–1262

950. Shaw M, Blanning R, Strader T, Whinston AB (2000) Handbook on electronic commerce.Springer, New York

951. Shephard MS, Beal MW, O’bara RM, Webster BE (2004) Toward simulation-based design.Finite Elem Anal Des 40(12):1575–1598

952. Shih H-S, Shyur H-J, Lee ES (2007) An extension of TOPSIS for group decision making.Math Comput Modell 45(7–8):801–813

953. Shim JP, Warkentin M, Courtney JF, Power DJ, Sharda R, Carlsson C (2002) Past, present,and future of decision support technology. Decis Support Syst 33(2):111–126

954. Shirwaiker RA, Okudan GE (2008) Triz and axiomatic design: a review of case-studies anda proposed synergistic use. J Intell Manuf 19(1):33–47

955. Show MJ, Tu P-L, De P (1988) Applying machine learning to model management in decisionsupport systems. Decis Support Syst 4(3):285–305

956. Shoubridge P, Kraetzl M, Wallis W, Bunke H (2002) Detection of abnormal change in timeseries of graphs. J Interconnect Netw 3(1–2):85–101

957. Shupe JA, Mistree F (1987) Compromise: an effective approach for the hierarchical designof structural systems. Comput Struct 27(3):407–415

958. Siddique Z, Rosen DW (2001) On combinatorial design spaces for the configuration designof product families. Artif Intell Eng Des Anal Manuf 15(2):91–108

959. Siddique Z, Boddu K, Siddique Z, Boddu K (2005) A CAD template approach to supportweb-based customer centric product design. J Comput Inf Sci Eng 5(4):381–387

960. Sim JS, Park K (1999) The consensus string problem for a metric is NP-complete. In: RamanR, Simpson J (eds) Proceedings of the 10th australian workshop on combinatorial algorithms.Perth, WA, Australia, pp 107–113

454 References

961. Simon HA (1997) Administrative behavior: a study of decision-making processes in admin-istrative organization, 4th edn. The Free Press, New York

962. Simon HA, Newell A (1958) Heuristic problem solving: the next advance in operationsresearch. Oper Res 6(1):1–10

963. Simon HA (1996) The science of the artificial, 3rd edn. MIT Press, Boston964. Simpson TW (2004) Product platform design and customization: status and promise. Artif

Intell Eng Des Anal Manuf 18(1):3–20965. Simpson TW, Maier JRA, Mistree F (2001) Product platform design: method and application.

Res Eng Des 13(1):2–22966. Simpson TW, Siddique Z, Jiao J (2006) Product platform and product family design: methods

and applications. Springer, Berlin967. Simpson TW et al (eds) (2014) Advances in product family and product platform design.

Springer, New York968. Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning

tree problem. Appl Soft Comput 9(2):625–631969. Singhal J, Katz JL (1990) A branch-and-fathom algorithm for the long range process design

problem. Manage Sci 36(4):513–516970. Siskos Y, Spyridakos A (1999) Intelligent multicriteria decision support: overview and per-

spectives. Eur J Oper Res 113(2):236–246971. Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J

Comput 2(1):33–45972. Smelcer JB, Carmel E (1997) The effectiveness of different representations for managerial

problem solving: comparing tables and maps. Decis Sci 28(2):391–420973. Smirnov A, Sheremetov L, Chilov N, Cortes JR (2004) Soft-computing technologies for

configuration of cooperative supply chain. Appl Soft Comput 4(1):87–107974. Smith DH, Allen SM, Hurley S (2001) Characteristics of good meta-heuristics algorithms

for the frequency assignment problem. Ann Oper Res 107(1–4):285–301975. Sneath PHA, Sokol RR (1973) Numerical taxonomy: the principles and practice of numerical

classification. W.H. Freeman and Company, San Francisco976. Sobol IM (1992) An efficient approach to multicriteria optimum design problems. Surv Math

Ind 1(4):259–281977. Sodhi MS (2001) Applications and opportunities for operations research in Internet-enabled

supply chains and electronic martketplaces. Interfaces 31(2):56–89978. Sohraby K, Minoli D, Znati T (2007) Wireless sensor networks: technology, protocols, and

applications. Wiley, New York979. Solis-Oba R (1998) 2-approximation algorithm for finding a spanning tree with maximum

number of leafs. In: Bilardi G, Italiano GF, Pietracaprina A, Pucci G (eds) Proceedings of 6thannual European symposium on algorihtms - ESA’98, LNCS 1461, Springer, pp 441–452

980. Solnon C, Jolion J-M (2007) Generalized vs set median string for histogram based distances:Algorithms and classification results in image domain. In: Escolano F, Vento M (eds) Pro-ceedings of the 6th workshop on graph based representation in pattern recognition GbPrP2007, LNCS 4538, Springer, pp 404–414

981. Sommerville I (2007) Software engineering, 8th edn. Pearson Education, Essex982. Song G, Ding F, Zang W, Song A (2008) A wireless power outlet system for smart homes.

IEEE Trans Consum Electron 54(4):1688–1691983. Sousa JP, Poladian V, Garlan D, Schmerl B, Shaw M (2006) Task-based adaptation for

ubiquitous computing. IEEE Trans Syst Man Cybern Part C 36(3):328–340984. Srikant R, Agrawal R (1997) Mining generalized association rules. Future Gener Comput

Syst 13(2–3):161–180985. Standing C (2000) Internet commerce development. Artech House Publishers, Boston986. Steel M, Warnow T (1993) Kaikoura tree theorems: Computing the maximum agreement

subtree. Inf Process Lett 48(2):77–82987. Stefik M (1995) Introduction to knowledge systems. Morgan Kaufmann Publishers, San

Francisco

References 455

988. Stein GC, Strzalkowski T, Wise GB (2000) Interactive, text-based summarization of multipledocuments. Comput Intell 16(4):606–613

989. Steward DV (1981) The design structure system: a method for managing the design ofcomplex systems. IEEE Trans Eng Manage 28(3):71–74

990. Stilman B (1993) Formal language for hierarchical systems control. Lang Des 1(4):333–356991. Storer JA (1981) Constructing full spanning trees for cubic graphs. Inf Proc Lett 13(1):8–11992. Steuer RE (1986) Multple criteria optimization: theory, computation, and application. Wiley,

New York993. Stumptner M, Frierdich GE, Haselbock A (1998) Generative constraint-based configuration

of large technical systems. Artif Intell Eng Des Anal Manuf 12(4):307–320994. Stupnikov S, Kalinichenko L, Bressan S (2006) Interactive discovery and composition of

complex web services. In: Manolopoulos Y, Pokorny J, Sellis T (eds) Proceedings of 10theast-west European conference on advances in databases and information systems ADBIS2006, LNCS 4152, Springer, pp 216–231

995. Sugumaran V, Tanniru M, Storney VC (2008) A knowledge-based framework for extractingcomponents in agile systems development. Inf Technol Manage 9(1):37–53

996. Suh NP (1990) The principles of design. Oxford University Press, Oxford997. Suh NP (2001) Axiomatic design: advances and applications. Oxford University Press, Ox-

ford998. Sun M-T, Reibman AR (2001) Compression video over networks. Marcel Dekker, New York999. Sun A, Zeng DD, Hsinchun C (2010) Burst detection from multiple data streams: A network-

based approach. IEEE Trans Syst Man Cybern Part C 40(3):258–2671000. Sung Y-W, Zhou L (2004) The effect of alliance information on Web service composition.

Inf Syst E-Bus Manage 6(4):403–4171001. Suryanegara M, Miyazaki K (2010) Tehcnological changes in the innovation system towards

4G mobile service. Int Technol Policy Manage 10(4):375–3941002. Syropoulos A (2001) Mathematics of multisets. In: Calude CS et al. (eds) Multiset process-

ing: mathematical, computer science, and molecular computing points of view, LNCS 2235,Springer, pp 347–358

1003. Szekely GJ, Rizzo ML (2005) Hierarchical clustering via joint between-within distances:extending Ward’s minimum variance method. J Classif 22(2):151–183

1004. Tai K-C (1979) The tree-to-tree correction problem. J ACM 26(3):422–4331005. Taka K, Liang E (1997) Analysis and design of Web-based information systems. Comput

Netw ISDN Syst 29(8–13):1167–11801006. Talbi E (2009) Metaheuristics: from design to implementation. Wiley, New York1007. Tanaka E (1994) A metric between unrooted and unordered trees and its bottom-up comput-

ing method. IEEE Trans Pattern Anal Mach Intell 16(12):1233–12381008. Tanaka E, Tanaka K (1988) The tree-to-tree editing problem. Int J Pattern Recognit Artif

Intell 2(2):221–2401009. Tanenbaum AS (2002) Computer networks, 4th edn. Prentice Hall, New Jersy1010. Tanenbaum AS (2006) Structured computer organization, 5th edn. Prentice Hall, Upper

Saddle River1011. Tannenbaum AS, Kavcic B, Rosner M, Vianello M, Weisner G (1974) Hierarchy in organi-

zation. Jossey-Bass Inc, San Fransisco1012. Tang H, Wu Y, Yao JT, Wang G (2003) CUPTRSS: a web-based research support system. In:

Yao JT, Lingras P (eds) Proceedings of the workshop on applications, products and servicesof web-based support systems WSS03. Halifax, Canada, pp 21–28

1013. Tarapata Z (2007) On a multicriteria shortest path problem. Int J Appl Math Comput Sci17(2):269–287

1014. Tarhio J, Ukkonen E (1988) A greedy approximation algorithm for constructing shortestcommon superstrings. Theoret Comput Sci 57(1):131–145

1015. Tarjan RE (1976) Edge-disjoint spanning trees and depth-first search. Acta Informatica6(2):171–185

456 References

1016. Tate DM, Smith AE (1990) A genetic approach to the quadratic assignment problem. ComputOper Res 22(1):73–83

1017. Tate J, Woolford-Lim B, Bate I, Yao X (2012) Evolutionary and principled search strategiesfor sensornet protocol optimization. IEEE Trans Syst Man Cybern Part B 42(1):163–180

1018. Taura T, Kubota A (1999) A study on engineering history base. Res Eng Des 11:45–541019. Tavana M (2003) CROSS: a multicriteria group-decision-making model for evaluating and

prioritizing advanced-technology projects at NASA. Interfaces 33(3):40–561020. Ten TA, Van Harmelen F, Schreiber AT, Wielinga B (1998) Construction of problem-solving

methods as parametric design. Int J Human Comput Stud 49(4):363–3891021. Ten TA, Van Harmelen F, Wielinga B, Configuration of web services as parametric design.

In: Davies J, Fensel D, Bussler C, Studer R (eds) Proceedings of the first semantic websymposium: research and applications ESWS 2004, LNCS 3053, Springer, pp 299–311

1022. Thai M, Wang F, Liu D, Zhu S, Du D (2007) Connected dominating sets in wireless networkswith different transmission ranges. IEEE Trans Mob Comput 6(7):721–730

1023. Thanassoulis E (2001) Introduction to the theory and application of data envelopment analy-sis: a foundation text with integrated software. Kluwer, Boston

1024. Thomsen E (2002) OLAP solutions: building multidimensional information systems, 2ndedn. Wiley, New York

1025. Timkovsky VG (1989) Complexity of common subsequence and supersequence problems.Cybern Syst Anal 25(5):565–580

1026. Tisal J (1997) GSM cellular radio telephony. Wiley, New York1027. Torsello A, Hancock ER (2001) Efficiently computing weighted tree edit-distance using re-

laxation labeling. In: Figueiredo M, Zerubia J, Jain AK (eds) Energy Minimization Methodsin Computer Vision and Pattern Recognition. LNCS 2134, Springer, pp 438–453

1028. Torsello A, Hidovic D, Pelillo M (2005) Polynomial-time metrics for attributed trees. IEEETrans Pattern Anal Mach Intell 27(7):1087–1099

1029. Trinkaus HL, Hanne T (2005) KnowCube: a visual and interactive support for multicriteriadecision making. Comput Oper Res 32(5):1289–1309

1030. Tsai Y-T, Wang K-S (1999) The development of modular-based design in considering tech-nology complexity. Eur J Oper Res 119(3):692–703

1031. Tseng H-E, Chang C-C, Li J-D (2008) Modular design to support green life-cycle engineer-ing. Expert Syst Appl 34(4):2524–2537

1032. Tseng JCR, Hwang G-J (2007) Development of automatic customer service system on theInternet. Electron Commer Res Appl 6(1):19–28

1033. Turban E, Aronson J (2001) Decision support systems and intelligent systems. Prentice Hall,Upper Saddle River

1034. Tuyttens D, Teghem J, Fortemps P, Van Nieuwenhuyze K (2000) Performance of the MOSAmethod for the bicriteria assignment problem. J Heuristics 6(3):295–310

1035. Tversky A (1972) Elimination by aspects: a theory of choice. Psychol Rev 79(4):281–2991036. Uchoa E (2006) Reduction tests for the prize-collecting Steiner problem. Oper Res Lett

34(4):437–4441037. Ueda K (2001) Synthesis and emergence - research overview. Artif Intell Eng 15(4):321–3271038. Ulrich KT, Eppinger SD (2000) Product design and development, 2nd edn. McGraw-Hill,

Boston1039. Umeda Y, Fukushige S, Tonoike K, Kondoh S (2008) Product modularity for life cycle

design. CIRP Ann - Manuf Technol 57(1):13–161040. Uschold M, Gruninger M (1996) Ontologies: principles, methods and applications. Knowl

Eng Rev 11(2):93–1361041. Valiente G (2001) An efficient bottom-up distance between trees. Proceedings of the 8th

international symposium string processing information retrieval SPIRE (2001) IEEE CSPress. Laguna de San Rafael, Chile, pp 212–219

1042. Valiente G (2002) Algorithms on trees and graphs. Springer, Berlin1043. Valtchev D, Frankov I (2002) Service gateway architecture for a smart home. IEEE Commun

Mag 40(4):126–132

References 457

1044. Van Den Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channelassignment. J Graph Theory 29(4):263–283

1045. Van Ryzin J (ed) (1977) Classification and clustering. Academic Press, New York1046. Vashist A, Kulikowsky C, Muchnik I (2004) Automatic screening for groups of orthologous

genes in comparative genomics using multipartite clustering. Technical Report 33, DIMACS,NJ

1047. Vashist A, Kulikowski CA, Muchnik I (2007) Ortholog clustering on a multipartite graph.IEEE/ACM Trans Comput Biol Bioinform 4(1):17–27

1048. Vetschera R (1994) MCView: An integrated graphical system to support multiattribute de-cisions. Decis Support Syst 11(4):363–371

1049. Vidal E, Marzal A, Aibar P (1995) Fast computation of normalized edit distances. IEEETrans Pattern Anal Mach Intell 17(9):899–902

1050. Vincke P (1974) Problemes multicriteres. Cachiers du Centre d’Etudes de Recherche Oper-ationelle 16:425–439 (in French)

1051. Vincke P (1999) Robust solutions and methods in decision-aid. J Multicriteria Decis Anal8(3):181–187

1052. Vinh PC, Bowen JP (2005) Continuity aspects of embedded reconfigurable computing. InnovSyst Software Eng 1(1):41–53

1053. Vinze A, Sen A (1991) Expert assistance for the decision support process using hierarchicalplanning. IEEE Trans Syst Man Cybern 21(2):390–401

1054. Vizilter YV (2009) Design of data segmentation and compression operators based on pro-jective morphological decomposition. J Comput Syst Sci Int 48(3):415–429

1055. Vizilter YV, Zheltov SY (2008) Projective morphologies and their applicaiton in structuralanalysis of digital images. J Comput Syst Sci Int 47(6):944–958

1056. Vizilter YV, Zheltov SY (2009) The use of projective morphologies for object detection andidentification in images. J Comput Syst Sci Int 48(2):282–294

1057. Vizilter YV, Sidyakin SV, Rubis AY, Gorbatsevich VS (2012) Morphological shape com-parison based on skeleton representation. Pattern Recognit Image Anal 22(3):412–418

1058. Voronin AA, Mishin SP (2002) Algorithms to seek the optimal structure of the organizationalsystem. Autom Remote Control 63(5):803–814

1059. Voronin AA, Mishin SP (2002) A model of optimal control of structural changes in anorganizational system. Autom Remote Control 63(8):1329–1342

1060. Voss CA, Hsuan J (2009) Service architecture and modularity. Decis Sci 40(3):541–5691061. Voss S (1992) Steiner’s problem in graphs: heuristic methods. Discrete Appl Math 40(1):45–

721062. Voss S (1999) The Steiner tree problem with hop constraints. Ann Oper Res 86:321–3451063. Voss S (2000) Modern heuristic search methods for the Steiner tree problem in graph. In:

Smith JM, Rubinstein JH (eds) Du D-Z. Kluwer, Advances in Steiner Trees, pp 283–3231064. Voss S (2006) Steiner tree problems in telecommunication. In: Pardalos PM, Resende M

(eds) Handbook of optimization in telecommunications. Springer, New York, pp 459–4921065. Vujosevic M, Stanojevic M (2003) A bicriteria Steiner tree problem on graph. Yugoslav J

Oper Res 13(1):25–331066. Wache H, Vogele T, Visser U, Stickenschmidt H, Schuster G, Neumann H, Hubner S (2001)

Ontology-based integration of information - a survey of existing methods. Proceedings ofinternational workshop ontologies and information sharing IJCAI-01. Seattle, WA, pp 108–117

1067. Wagner RA, Fisher MJ (1974) The string-to-string correction problem. J ACM 21(1):168–173

1068. Wallace M, Schimpf J (2002) Finding the right hybrid algorithm - a combinatorial meta-problem. Ann Math Artif Intell 34(4):259–269

1069. Waller HJ (1976) The synthesis of hierarchical structures: techniques and applications. DecisSci 7(4):659–674

1070. Wallis WD, Shoubridge P, Kraetz M, Ray D (2001) Graph distances using graph union.Pattern Recognit Lett 22(6–7):701–704

458 References

1071. Wang J, Malakooti B (1992) A feedforward neural network for multiple criteria decisionmaking. Comput Oper Res 19(2):151–167

1072. Wang JT-L, Zhang K (2001) Finding similar consensus between trees: an algorithm anddistance hierarchy. Pattern Recognit 34(1):127–137

1073. Wang J, Chen J, Huang JM (2008) An improved lower bound on approximation algorithmsfor the closest substring problem. Inf Proc Lett 107(1):24–28

1074. Wang W (2010) Reverse engineering: technology of reinvention. CRC Press, Boca Raton1075. Wang Y-F, Chuang Y-L, Hsu M-H, Keh H-C (2004) A personalized recommender sytem for

the cosmetic business. Expert Syst Appl 26(3):427–4341076. Wang Y-H, Yang L (2008) Smart home information: a framework for integration and man-

agement. Measur Control 41(10):300–3041077. Warburton A (1987) Approximation of pareto optima in multiobjective shortest path problem.

Oper Res 35:70–791078. Wassesrman AI (1985) Extending state transition diagrams for the specification of human-

computer systems. IEEE Trans Software Eng 11(8):699–7131079. Watkinson J (2001) MPEG handbook. Butterworth-Heinemann, UK1080. West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Englewood Cliffs1081. Westbrook J, Yan DCK (1993) Greedy algorithm for the on-line Steiner tree and generalized

Steiner problems. In: Dehne FKHA, Sack J-R, Santoro N, Whitesides S (eds) Proceedingsof the third workshop on algorithms and data structures WADS’93, LNCS 709, Springer, pp622–633

1082. Whidden C, Beiko RG, Zeh N (2010) Fast FPT algorithms for computing rooted agreementforest: Theory and experiments. In: Proceedings of the 9th international symposium onexperimental algorithms SEA 2010, LNCS 6049, Springer, pp 141–153

1083. Whidden C, Beiko RG, Zeh N (2011) Fixed parameter and approximation al-gorithms for maximum agreement forests. Electronic preprint, Aug 12, 2011.http://arxiv.org/abs/1108.2664v1 [q-bio.PE]

1084. Whieler A (2007) Commercial applications of wireless sensor networks using ZigBee. IEEECommun Mag 45(4):70–77

1085. Wielinga B, Schreiber G (1997) Configuration-design problem solving. IEEE Expert IntellSyst Appl 12(2):49–56

1086. Wigderson A (1983) Improving the performance garantee for approximate graph coloring.J ACM 30(4):729–735

1087. Wilson SR, Czarnik AW (eds) (1997) Combinatorial chemistry: synthesis and application.Wiley, New York

1088. Wilson JM (2005) An algorithm for the generalzed assignment problem with special orderedsets. J Heuristics 11(4):337–350

1089. Winter P (1987) Steiner problem in networks: a survey. Networks 17(2):129–1671090. Wissema JG (1976) Morphological analysis: its application to a company TF-investigation.

Future 8(2):146–1531091. Woeginger GJ (2000) When does a dynamic programming formulation guarantee the exis-

tence of a fully polynomial approximation scheme (FPTAS)? INFORMS J Comput 12(1):57–75

1092. Wong RT (1984) Dual ascent approach for Steiner tree problems on a directed graph. MathProgr 28(3):271–287

1093. Wrembel R, Koncila C (2006) Data warehouses and Olap: concepts, architectures and solu-tions. IGI Global, Hershey

1094. Wu BY, Chao K-M (2004) Spanning trees and optimization problems. CRC Press, BocaRaton

1095. Wu J, Huang L, Wang D (2008) ASM-based model of dynamic service update in OSGi.ACM SIGSOFT Software Engineering Notes 33(2): article no. 8

1096. Wynants G (2001) Network synthesis problems. Kluwer, Dordrecht1097. Xiang X-D, Sun X, Briceno G, Lou Y, Wang K-A, Chang H, Wallace-Freedman WG,

Chen S-W, Schultz PG (1995) A combinatorial approach to material discovery. Science268(5218):1738–1740

References 459

1098. Xiang X-D, Takeuchi I (2003) Combinatorial material synthesis. CRC Press, Boca Raton1099. Xie Y, Wang H, Efstathiou J (2005) A research framework for Web-based open decision

suport systems. Knowl-Based Syst 18(7):309–3191100. Xin D, Han J, Yan X, Cheng H (2007) Compressing frequent patterns. Data Knowl Eng

60(1):5–291101. Xiong P, Fan Y, Zhou M (2010) A Petri net approach to analysis and composition of Web

services. IEEE Trans Syst Man Cybern Part A 40(2):376–3871102. Yager RR (1986) On the theory of bags. Int J Gen Syst 13(1):23–371103. Yager RR (1988) On ordered weighted averaging aggregation operators in multicriteria

decision making. IEEE Trans Syst Man Cybern 18(1):183–1901104. Yamamachi H, Tsujimura Y, Kambayashi Y, Yamamoto H (2006) Multi-objective genetic al-

gorithm for solving N-version program design problem. Reliability Eng Syst Saf 91(9):1083–1094

1105. Yaman H, Karasan OE, Pinar MC (2001) The robust spanning tree problem with intervaldata. Oper Res Lett 29(1):31–40

1106. Yang W (1991) Identifying syntactic differences between two programs. Software - PractExperience 21(7):739–755

1107. Yao AC (1975) An O(|E | log log |V |) algorithm for finding minimum spanning trees. InfProc Lett 4(1):21–23

1108. Yao YY (2003) A framework for Web-based research support systems. Proceedings of 23rdinternational computer software and application conference COMPSAC 2003. Dallas, TX,pp 601–606

1109. Yeh RK (2000) The edge soan of distance two labellings of graphs. Taiwan J Math 4(4):675–683

1110. Yeh RK (2006) A survey on labeling graphs with a condition at distance two. Discrete Math306(12):1217–1231

1111. Yelowitz L (1976) An efficient algorithm for constructing hierarchical graphs. IEEE TransSyst Man Cybern 6(4):327–329

1112. Yerramareddy S, Lu SC-Y (1993) Hierarchical and interactive decision refinement method-ology for engineering design. Res Eng Des 4(4):227–240

1113. Yick J, Mukherjee B, Ghosal D (2008) Wireless sensor network survey. Comput Netw52(12):2292–2330

1114. Yigit AS, Ulsoy AG, Allahverdi A (2002) Optimizing modular product design for reconfig-urable manufacturing. J Intell Manuf 13(2):309–316

1115. Yolum P, Singh MP (2005) Engineering self-organizing referral networks for trustworthyservice selection. IEEE Trans Syst Man Cybern Part A 35(3):396–407

1116. Yoon KP, Hwang C (1995) Multiple attribute decision making: an introduction. SAGE Pub-lications, California

1117. Younas M, Chao K-M, Laing C (2005) Composition of web service in distributed serviceoriented design activities. Adv Eng Inf 19(2):143–153

1118. Youwey W, Dingwei W, Ip WH (2006) Optimal design of link structure for e-supermarketwebsite. IEEE Trans Syst Man Cybern Part A 36(2):327–337

1119. Yu C, Liu K-L, Meng W, Wu Z, Rishe N (2002) A methodology to retrieve text documentsfrom multiple databases. IEEE Trans Knowl Data Eng 14(6):1347–1361

1120. Yu T, Lin K-J (2005) Service selection algorithms for Web services selection with end-to-endQoS constraints. J Inf Syst e-Bus Manage 3(2):103–126

1121. Yu T, Zhang Y, Lin K-J (2007) Efficient algorithms for Web services selection with end-to-end QoS constraints. ACM Trans Web 1(1):1–46

1122. Yuditskii SA (2008) Operational-objective modeling of dynamics of organizational systemsdevelopment via Petri nets. Autom Remote Control 69(1):105–113

1123. Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338–3531124. Zadorozhny V, Chrysanthis P, Krishnamurthy P (2007) Network-aware wireless sensor man-

agement. Springer, New York

460 References

1125. Zarrabi-Zadeh H (2011) An almost space-optimal streaming algorithm for coresets in fixeddimensions. Algorithmica 60(5):46–59

1126. Zavadskas EK, Ustinovichius L, Peldschus F (2003) Development of software for multiplecriteria evaluation. Informatica 14(2):259–272

1127. Zelikovsky AZ (1993) An 11/6-approximation algorithm for the network Steiner problem.Algorithmica 9(5):463–470

1128. Zelikovsky AZ (1998) A series of approximation algorithms for the acyclic directed Steinertree problem. Algorithmica 18(1):99–110

1129. Zelinka I (2004) Soma - self-organizng migration algorithm. In: New Optimization Tech-niques in Engineering. Springer, Heidelberg, pp 186–217

1130. Zhang K (1996) A constrained edit-distance between unordered labeled trees. Algorithmica15(3):205–222

1131. Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees andrelated problems. SIAM J Comput 18(6):1245–1262

1132. Zhang K, Statman R, Shasha D (1992) On the editing distance between unordered labeledtrees. Infor Proc Lett 42(3):133–139

1133. Zhang K, Wang JTL, Shasha D (1996) On the editing distance between undirected acyclicgraphs. Int J Found Comp Sci 7(1):43–57

1134. Zhang R, Vashist A, Muchnik IB, Kulikovski CA, Metaxas DN (2005) A new combinatorialapproach to supervised learning: application to gait recognition. In: Zhao W, Gong S, TangX (eds) Proceedings of the second international workshop on analysis and modeling of facesand gestures AMFG 2005, LNCS 3723, Springer, pp 55–69

1135. Zhang S, Goddard S (2007) A software architecture and framework for Web-based distributeddecision systems. Decis Support Syst 43(4):1133–1150

1136. Zhuravlev YI (1998) An algebraic approach to recognition or classification problems. PatternRecognit Image Anal 8(1):59–100

1137. Zilberstein S, Russell S (1996) Optimal composition of real-time systems. Artif Intell 82(1–2):181–213

1138. Zimmerman H (1980) OSI reference model - the ISO model of architecture for open systemsinterconnection. IEEE Trans Commun 28(4):425–432

1139. Zimmerman HJ (1987) Fuzzy sets, decision making, and expert systems. Springer, Berlin1140. Zimmerman t (1996) Personal area nerworks: near-field intrabody communication. IBM

Syst J 35(3 and 4):609–6171141. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study

and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–2711142. Zopounidis C, Doumpos M (2000) PREFDIS: a multicriteria decision support system for

sorting decision problems. Comp Oper Res 27(7–8):779–7971143. Zopounidis C, Doumpos M (2002) Multicriteria classification and sorting methods: a liter-

ature review. Eur J Oper Res 138(2):229–2461144. Zopounidis C, Doumpos M (2009) Multicriteria sorting methods. In: Floudas CA, Pardalos

PM (eds) Encyclopedia of optimization. 2nd ed., Springer, pp 2379–23961145. Zou F, Li X, Kim D, Wu W (2008) Two constant approximation algorithms for node-weighted

Steiner tree in unit disk graphs. In: Yang B, Du D-Z, Wang CA (eds) Proceedings of Secondannual international conference on Combinatorial Optimization and Applications COCOA2008, LNCS 5165, Springer, pp 278–285

1146. Zwicky F (1969) Discovery invention, research through the morphological approach. McMil-lan, New York

Index

AAccess network, 7, 79, 183Access point, x, 83, 85, 183, 186, 187, 189,

339, 340, 342–344, 346, 349Activity net, 298Acyclic digraph, 247, 249Adaptation, 7Adaptive problem solving framework, 288Additive function, 13, 16Adjacency matrix, 209, 211Admissible composition, 14, 16Admissible solution, 15, 16, 23, 25, 26, 28,

32Agglomerative algorithm, 69, 70, 93, 184,

374, 409Aggregated course, 229, 245Aggregated multiset estimate, 52, 59, 60, 64Aggregated ranking, 219, 326Aggregated solution, 192, 194, 197, 198,

205, 236, 246, 271, 276, 304, 313,314, 326, 338, 401

Aggregated system, 7Aggregation, ix, 37, 159, 160, 163, 191,

192, 196, 200, 202–205, 207,217, 219–222, 226, 236–242,245, 265, 267–269, 271, 275,276, 288, 290, 293, 294, 298–301,303, 304, 311, 314–317, 326–328, 331, 337, 351, 357, 358, 401,402, 411

Aggregation of estimates, 39, 46Aggregation of forecasts, 401, 411Aggregation of modular solutions, ix, 191,

245, 300, 316Aggregation of structures, viii, ix, 8, 153Aggregation of system versions, 7, 9

Aggregation strategy, 191, 194, 196, 199,205, 222, 401, 402, 411

Agreement forest, 194Agreement structure, 220Agreement tree, 194, 212, 221AI-based method, ix, 1, 35, 74, 77, 91, 108,

299, 300, 316, 380Algebraic high level nets, 265Algorithm system, 279, 280, 286, 287Algorithm(s)/solving framework, 4Alignment, 37, 47, 212, 226Alignment distance, 212Alignment of multiset estimates, 39, 48Allocation, 8, 18, 89, 91, 93, 95, 100, 105,

107, 142, 159, 183, 270Allocation problem, 18, 91, 93, 95, 105, 107,

184, 270, 343Altshuller, Genrich S., ix, 1Analysis of decision, vii, 19, 281Analysis of result, 281, 288, 291, 298Analysis/decision point, 249, 251, 256, 260,

262, 264Analytic Hierarchy Process (AHP), 7, 122,

124, 130, 283And-or graph, 298And-or tree, 402Ant colony optimization, 102Approximation, 178, 193, 207, 221, 252Approximation algorithm, 17, 18, 74, 75, 94,

102, 164, 175, 178, 190, 208, 228,343

Architectural innovation, 265Architecture, viii, 8, 72, 90, 193, 279, 281,

329, 389, 390Assignment, 8, 9, 13, 18, 37, 38, 67, 83, 85,

87, 89, 91, 93, 95, 97, 100, 101,103, 105, 107, 142, 154, 159, 186,

© Springer International Publishing Switzerland 2015M.S. Levin, Modular System Design and Evaluation,Decision Engineering, DOI 10.1007/978-3-319-09876-0

461

462 Index

189, 190, 226, 232, 233, 245, 270,339, 340, 342, 345, 346, 349, 350

Assignment of specialists, 270, 295Assignment problem, 13, 18, 85, 91, 93, 95,

105, 107, 142, 157, 165, 178, 184,189, 218, 219, 270, 343, 344, 346

Augmentation problem, 142, 159, 170, 178,181

Axiom based design, 1, 270

BBackbone network, 183Best point, 114, 124, 126, 127, 129, 140, 144Bi-connected network, 79, 81, 82Binary compatibility, 14–16, 21, 23, 93Binary relation, 97, 114, 200, 267–269, 361,

370, 374, 375, 408Binary variable, 172, 179, 180, 218, 222,

224, 225, 227, 275, 313, 314, 337,356, 358, 399

Boolean matrix, 85, 189, 340Boolean variable, 16, 60, 85, 189, 340Boruvka’s algorithm, 74Bottleneck, 7, 131–134, 136–145, 154, 158,

166, 167, 320, 321, 357, 390, 395,396, 398

Bottleneck Steiner tree problem, 74Bottom-up framework/scheme, 34, 35, 52,

81, 176Branch-and-bound, 17, 18, 74, 75, 270, 343Branch-and-cut, 74, 83Building automation system, 389–391, 395,

399Bus, 79, 141, 183, 390

CCardinality, 37–39Cascade-like bottom-up process, 175Chain, 247, 249, 250, 252Change, 108, 164, 166, 213–215, 265, 268,

269, 271, 273, 281, 290, 310, 311,361, 362, 364, 366–368, 370–372, 374–376, 379, 380, 390, 401,403, 404, 406, 407, 411

Change item, 268, 269, 271, 273Change of structure, 164, 390Change operation, 265, 268, 269, 271,

361, 362, 366, 370–372, 374–376, 401, 404, 406, 411

Channel assignment, 100Children asthma, 256Choice problem, 4, 279, 281

Circuit layout, 75Clique, 9, 36, 71, 78, 80, 87, 91, 93–95, 102,

105, 107, 145–154, 232, 233, 245Clique problem, 8, 95, 100, 270Clique-based fusion, 131, 132, 138, 141, 145Closeness to ideal point, 13, 15, 21, 32, 34,

35Closest string problem, 195Cluster head, 87Clustering, 8, 9, 19, 36, 67, 69–71, 78, 81,

82, 86, 91, 93, 94, 105, 107, 178,183–185, 226, 279, 281, 374, 401,409

Clustering in multipartite graph, 36Color compatibility, 102, 104Column generation method, 102Combinatorial ABC-book, xCombinatorial engineering framework, viii–

x, 3, 4, 7, 9Combinatorial evolution, viii, x, 3, 7, 265,

267, 277, 338, 379, 401, 413Combinatorial investment, 230Combinatorial meta-problem, 280Combinatorial modeling, xCombinatorial optimization, viii, ix, 8, 9, 72,

78, 82, 89, 91, 108, 142, 155, 157,159, 164–166, 171, 183, 225, 226,232, 233, 245, 265, 270, 280, 361,402

Combinatorial synthesis, ix, x, 37, 39, 48–50, 61, 64, 66, 157, 158, 161, 166,167, 186, 194, 247, 249, 265, 267,268, 271, 279, 294, 298–301, 303,305, 311, 314, 315, 331, 351, 361,375, 377, 389, 390, 399, 401, 413

Common subgraph, 194Common subsequence, 194Common substructure, 207Common subtree, 212Common supergraph, 194Common supersequence, 194Communication network, x, 78, 83, 100,

155, 183, 186, 264, 339, 340, 344,366, 376

Communication protocol, ix, x, 72, 75, 90,178, 390, 391, 401, 402, 404, 413

Communication provider, 80, 315, 316, 319,323–326

Compatibility, ix, 6, 12–15, 18–21, 23–25, 29, 32, 49, 50, 59, 89, 97–102, 104–107, 111, 115, 116, 118,122, 124, 126, 130, 131, 137–140,157–159, 161–163, 180, 181,

Index 463

193, 197, 198, 200, 202–204, 215,217, 222, 225, 227, 233, 236, 237,245, 247, 249, 253, 255, 257, 258,260, 267–269, 273, 275, 295, 296,302, 303, 306, 308, 310, 311, 316,319, 321, 323, 326, 333, 336–338,351, 354–356, 358, 370, 371, 375,376, 379, 390, 393, 395, 396

Compatibility estimate, 20, 24, 49, 50, 59,181, 193, 200, 202–204, 215, 217,222, 225, 227, 233, 236, 237, 273,297, 308, 311, 323, 326, 333, 338,375, 379, 396

Compatible representatives, 105, 107Compatible tree, 221Complementarity, 97, 267–269, 370, 408Composite bottleneck, 139, 140, 143–145Composite combinatorial optimization

problem, 8Composite DA, 15, 16, 19, 25, 27–30, 34, 35,

50, 139, 166, 167, 233, 242, 253–255, 320–324, 326, 334, 336, 379,394, 395, 397, 398

Composite decision, x, 20, 22, 31, 163, 316,322, 323, 334, 335, 375, 393, 398

Composite fault, 138, 139, 154Composite problem framework, 78Composite solution, 19, 97, 99, 100, 139,

186, 191, 299, 301, 310, 311Composite solving strategy, x, 279, 280, 293,

294, 296, 298Composite system, 12, 111–113, 129, 131,

137, 138, 154, 155, 160, 200, 201,247, 263, 265, 276

Composite system fault, 132, 139, 154Composition, 11, 14–16, 21, 35, 38, 49, 50,

54, 56, 58, 89, 90, 102, 116, 131,161, 215, 232, 233, 245, 263, 265,273, 279, 280, 291, 295, 300, 301,303, 304, 311, 316, 329, 359, 377,389

Compression strategy, 194, 197, 198Concentric presentation of composite solu-

tion, 21, 139, 140Concept space, 7Conceptual design, 7Condensing, 155, 170, 174Configuration, ix, 1, 12, 89–91, 100, 101,

105–109, 168, 169, 279, 300, 303,306, 314–317, 329, 331, 351, 390

Configuration management, 90, 91, 265Configuration trajectory, 91, 105, 107, 108

Connected dominating set problem, 75, 131,132, 141, 142

Connected structure, 81Connectivity, 76, 80, 170, 181, 189, 341, 342Consensus, 124, 130, 153, 191, 192, 194,

196, 198, 212, 217, 218, 245, 300Constrained Steiner tree problem, 74Constraint satisfaction problem, 35, 91Continent network, 182Coresets problem, 36Covering, 68, 109, 183, 193, 226Covering problem, 8, 100, 109, 164, 183Critical element, 140Critical network component, 132Critical node, 131, 141Critical structure, 151Critical substructure, 151Cross-graph clique, 146Curve of equal quality, 121

DData association, 103Data envelopment analysis, 111DBMS, 78, 319, 321, 322, 325, 328Decision maker, 281, 292Decision making, vii, x, 4, 34, 130, 153, 218,

232, 233, 245, 270, 271, 279–281,285, 286, 291

Decision making engineering, 280Decision making framework, vii, 281Decision tree, 7, 256, 262Design framework, 3, 7, 34, 52, 78, 86, 87,

158, 249, 270Design of system trajectory, 303Design of topology, 87, 90, 91Design of trajectory, viii, ix, 7, 9, 249, 374,

375Design principles, 1Design structure matrix (DSM), 1, 36Design/redesign point, 263Designing while shopping, 301Detection of bottleneck, viii, 9, 131, 132,

134, 137, 140, 142, 143, 145, 154,158, 166, 320

Detection of bottlenecks in hierarchical mor-phological design, 142

Detection of clique, 146, 150, 153Detection of clique over graph streams, 150Detection of composite bottleneck, 143, 145Detection of contradiction, 281Detection of critical connection between

nodes, 141

464 Index

Detection of critical network component,132

Detection of critical nodes in network, 141Detection of critical system component, 131,

143Detection of cross-graph clique, 146Detection of fault, 389Detection of group of critical interconnected

nodes, 141Detection of interconnected system compo-

nents, 132, 138, 143Detection of low quality assignment, 142,

154Detection of low quality connection between

nodes, 154Detection of low quality layer topology, 141,

154Detection of low quality network topology,

132, 142Detection of maximal elements, 294, 297Detection of Pareto-efficient elements, 294,

297Detection of quasi-clique, 146Detection of system bottleneck, ix, 3, 7, 8,

132, 134, 137, 140, 142, 143, 145,154, 158, 166

Development action, 157, 185Development plan, 185, 186Digraph, 213, 247, 249, 251, 263Digraph based system trajectory, 251Dijkstra algorithm, 93, 94Direct expert based forecast, 401, 404, 406,

409Direct expert based procedure, 124, 293, 298Direct logical method, 121, 124, 130, 283,

293–295, 297, 298Discordance, 209Discrete domain of proximity, 44Dissimilarity, 211, 212Distributed network, 79, 183Divide and conquer, 11Divisive strategy, 69Domain expert, 68, 112, 120, 124, 192Dominance factor, 213–216Dominance parameter, 212DSS, 78, 279, 280, 291, 292DSS COMBI, 221, 267, 279–281, 285, 290–

292, 294, 296, 298Dynamic decision making, 153, 263Dynamic hotlink assignment, 178Dynamic matching problem, 104Dynamic programming, 17, 18, 61, 63, 64,

74, 83, 94, 270

Dynamic Steiner tree problem, 74Dynamic system reconfiguration, 108

EEarly stage design, 269Edit distance, 207, 208Educational course, 191, 225–227, 231, 267,

269, 273Electre, 23, 85, 121, 124, 130, 136, 183, 189,

230, 231, 290, 294, 319, 333, 337,344, 345

Electronic shopping, ix, x, 9, 299, 300, 305,314

Engineering design, 1Engineering history base, 265Engineering optimization, 1Enumerative method, 14, 16–18, 77, 83, 102,

221, 343, 344Equivalence, 267–269, 370, 408Evaluation framework, 112–114Evaluation of alternatives, 281Evolution framework, 276Evolution process, 7, 362Evolutionary computation, 270Evolutionary design, 1, 265Evolutionary optimization, 102Evolutionary tree, 7Expert based procedure, 36, 67, 68, 71, 191,

192, 270, 294, 401Expert judgment, 15, 23, 28, 31, 66, 67, 86,

97, 112, 120–122, 124, 130, 134,178, 184, 185, 192, 206, 222–224,227, 233, 237, 252, 265, 267, 268,270, 271, 273, 275, 283, 284, 297,302, 306–308, 310, 312, 313, 319,333, 337, 344, 351, 354, 356, 358,374–376, 379, 390, 393, 396, 399,401, 406, 409

Extension, ix, 7, 11, 108, 155–157, 163, 182,190, 194, 205, 222, 271, 301, 312,329, 331, 357, 370, 373, 375, 389,390, 396, 397, 399, 406, 411

Extension strategy, 155, 157, 158, 186, 190,194, 196–198, 390

FFault, 138, 139, 145, 154, 403, 404Finite-state machine, 263Five-layer architecture, 8Flow of system generations, 7Ford-Bellman algorithm, 94

Index 465

Forecast, 143, 265, 268, 271, 276, 371, 401,402, 408–413

Forecast of bottleneck, 143, 144Forecasting, viii–x, 3, 7, 9, 91, 131, 132, 144,

265, 267, 276, 277, 338, 401, 402,404, 413

Forest, 7, 74, 90, 194Formal method, 1Four-stage Pareto-efficient trajectory, 255FPTAS, 17, 171, 178Frequency assignment, 100Frequency bandwidth, 83, 188, 340Frequency spectrum, 340, 342Freshe axiom, 213Function cluster, 146, 147, 149–152Functional graph, 285, 298Functional graph menu, 291, 293Fusion, 104, 131, 132, 138, 141, 145, 146,

148, 149, 153, 298, 331, 389Fuzzy set, 38, 66, 91, 245

GGeneral design theory, 1Generalized assignment problem, 93, 178,

339Generalized median, 46, 47, 51, 54, 57, 58,

60, 61, 64, 195Generalized quadratic assignment problem,

93Generalized Steiner problem, 74Generalized Steiner star problem, 74Generalized system syndrome, 154Generation of alternatives, vii, 281Generation of criteria, vii, 281Generation of ideal point(s), 28Generation of scales, vii, 281Genetic algorithm, 18, 35, 74, 83, 91, 94,

102, 343Global network, 182, 183Grammatical design, 270Graph augmentation problem, 77, 178, 181Graph based design structure, 263Graph coloring, 8, 89, 93, 100, 102, 226Graph coloring problem, 93, 100, 102, 270Graph grammar, 91Graph recoloring, 157, 159, 168, 169Graph stream, 131, 132, 145, 150, 152GRASP algorithm, 74Greedy algorithm, 18, 29, 74, 75, 85, 168,

180, 189, 218, 222, 225, 227, 270,313, 314, 343, 344, 374, 409, 411,412

Group Steiner tree problem, 74GSM network, 11, 21, 22, 29, 31

HHeuristic, 18, 74, 75, 77, 83, 85, 91, 94, 102,

184, 189, 218, 219, 221, 222, 228,270, 326, 339, 343, 344, 375

Hierarchical approach, 1, 359Hierarchical clustering, 67, 69–71, 93, 184Hierarchical composite system, 111Hierarchical decision making, 34Hierarchical design, viii, 7, 8, 231, 233, 249,

270, 271, 273, 316, 331, 351, 389,390, 401

Hierarchical modular system, viii, 9, 111,131

Hierarchical morphological design, 37, 91,93, 107, 132, 143, 273

Hierarchical morphological multicriteria de-sign (HMMD), 13, 18–21, 30, 32–35, 48–50, 52, 54, 94, 95, 102,105–107, 115, 124, 130, 131, 137,142, 159, 162, 166, 167, 181, 186,230, 231, 233, 242, 247, 249, 252,267, 268, 271, 280, 301, 316, 326,336, 350, 351, 375, 390

Hierarchical morphological system model,9, 269, 301

Hierarchical network, 6, 7, 154, 251Hierarchical network design problem, 82,

93, 131, 132, 141, 142Hierarchical structure, viii, ix, 3, 67, 68,

70, 71, 76, 77, 85, 91, 170, 256,265, 267–269, 329, 332, 351, 377,390–392, 395, 396, 402

Hierarchical system, x, 7, 37, 105, 111, 131,247, 331, 390, 395, 396

Hierarchical system model, viii–x, 3, 7–9,11, 395

Hierarchical task network (HTN), 34Hierarchical two-level network design prob-

lem, 82Hierarchy, 4, 5, 7, 11, 67, 68, 90, 91, 93, 112,

181, 183, 191, 193, 229, 230, 247,287

Hierarchy of building, 69Hierarchy of communication network, 78Hierarchy of problem solving components,

288HMMD with interval multiset estimates, 49,

124, 130, 390Hot-tree assignment, 178

466 Index

Hotlink, 176–178Hotlink assignment problem, 67, 155, 157,

158, 170, 176–178Hub, 183Hungarian method, 343Hybrid metaheuristic, 270, 280

IIdeal point, 20, 25, 28, 50, 54, 60, 114, 121,

122, 124, 129, 139, 161–163, 167,296, 305, 306, 320, 321, 355, 394,396

Ideal solution, 15, 25, 26, 121, 161, 163, 322Ill-structured problem, 282Improved system, 158–162Improvement, viii–x, 7, 20, 138, 139,

141, 155, 156, 158–163, 165–168, 182, 183, 185, 190, 232,245, 262, 269–271, 273, 299, 315,320, 321, 331, 336–338, 351, 356,357, 359, 365, 366, 368, 373,376, 389, 390, 394–396, 398–400, 404, 406–409, 411

Improvement action, 20, 139, 155, 157, 160,161, 163, 166, 167, 185, 336, 356,357, 395, 398–400

Improvement strategy, 155, 157, 190Improvement trajectory, 265, 400Independent set problem, 100Information retrieval, 299, 300Integrated estimate, 41–43, 47, 54, 113, 114,

122, 124, 410Integrated graph, 146, 147, 149, 150, 152Integrated multiset estimate, 43, 59–62, 163Integrated scale, 111, 118Integrated security system, ix, x, 9, 331, 332Integration of estimates, 39, 41, 124, 130Integration table, 122, 124, 126, 127, 130Inter-cluster distance, 71Interconnected system components, 139,

143, 145, 148International network, 182Interval multiset estimate, ix, 13, 37, 49, 86,

114, 116, 119, 122, 124, 126, 127,129, 130, 157, 161, 163, 267, 269,273, 297, 351, 354, 359, 389–391,393, 396, 400

Intra-cluster distance, 71Investment, 191, 233, 245, 270, 271

JJapanese approach of quality management,

132

Kk-connected network, 79–81k-connected topology, 183k-model framework, 4k-problem framework, 4Kendall tau distance, 209, 211, 215, 218Kendall, Maurice G., 209, 211, 215, 218Kernel, 173, 192, 221, 273, 301, 312, 326,

411Knapsack problem, viii, 8, 17, 18, 35, 37, 60,

62–64, 108, 157, 165, 172–175,194, 206, 217, 218, 226, 232, 233,245, 265, 270, 313, 374, 401, 408,409, 411

Knapsack-like problem, 39, 62, 159, 161,174, 178, 221, 222, 294, 300, 361

Knowledge base, 89, 245, 283Knowledge engineering, 153, 270Kruskal’s algorithm, 74

LLabelled tree, 212Last mile problem, 183Law of software evolution, 265Layered structure, 67, 68, 155, 170, 182, 209,

282, 291–293, 296, 298Leaf vertex, 6, 7, 83, 114, 141, 170, 249, 251Learning automata, 102Levin, Mark Sh., x, 294Library of algorithm components, 288, 377Library of algorithms, 287, 377Library of techniques/methods, 281Library of typical DM problems, 281Library of typical situations, 281Linear ordering, 280–282, 284–286, 288–

292, 298, 323Linear ranking, 279, 291, 293, 294, 297Linguistic geometry, 34Local area network (LAN), 182Local optimization, 75, 270Local search, 74, 102Logical point, 247, 249, 250, 257, 258, 260,

262

Index 467

MMaintenance, 1, 7, 21, 69, 72, 145, 146, 151,

153, 247, 263, 269, 305, 306, 316,319, 323, 389, 396, 406, 407

Man-machine procedure, 290, 293, 343Management system for smart home, x, 9,

389–391MANET, 75Marketing, 270, 271Markov decision process, 153Matching, 103, 104, 109Maximal point, 121, 122Maximum agreement forest, 221Maximum agreement substructure, 207Maximum clique in multipartite graph, 36,

95Maximum common substructure, 207Maximum common subtree, 221Maximum leaf spanning tree problem, 72,

74, 75, 93, 131, 132, 141Maximum substructure, 153, 195Median, 191, 192, 194–196, 198, 217, 218,

326Median estimate, 39, 46, 47, 118, 124, 129,

130Median interval multiset estimate, 163Median solution, 227, 228, 300Median string, 194, 208Median structure, 192, 196, 300Median tree, 212, 221, 222Medical diagnosis, 247, 262–264Medical treatment plan, 69, 247, 249, 256,

257, 260, 262–264Membership function, 220Meta-modeling, 280Metaheuristic, 102, 270, 280Method composition, 291Method engineering, 36Metric, 207, 209, 212, 215, 217, 246Metropolitan network, 182Mikhailov, Andrew A., 280, 294, 295Minimum cost transformation, 207Minimum diameter spanning tree, 74Minimum spanning forest, 74Minimum spanning multi-tree, 74Minimum spanning tree, 83Minimum spanning tree problem, viii, 72–

74, 93, 164, 183Minimum Steiner tree problem, viii, 72, 74,

183Minimum superstructure, 153, 195Minimum-energy broadcast tree, 75Minsky, Marvin L., vii, 4

Model management, 89, 279, 280Modification, 11–13, 72, 101, 155–158, 163,

164, 170, 182, 186, 190, 205–207, 220, 222–225, 271, 279, 287,289–291

Modification of system structure, 155, 157,158

Modified version of HMMD, 49, 50, 52, 54Modular design, x, 7, 35, 317, 331, 351, 377,

379, 389, 390, 401Modular solution, 127, 129, 191, 193, 304Modular system, ix, x, 1, 3, 4, 7, 89, 111–113,

115, 127, 129, 131, 154, 155, 158,160, 164, 165, 190, 193, 247, 263,265, 267, 276, 351, 359, 389

Modular system design, 7Modularity, 1, 265Monitoring, 281, 298Monitoring of solving process, 298Morphological analysis, 11–14, 16, 18, 21,

23, 25, 32, 35, 36, 85, 86, 91, 93,181, 270

Morphological class, 12–15Morphological clique, 93, 94, 102, 105, 107,

108, 390Morphological clique problem, viii, 19, 89,

91, 102, 105, 157, 265, 315, 331,389, 390

Morphological design, x, 12, 14, 19, 37, 91,93, 132, 137, 143, 265, 267, 268,273, 280, 300, 305, 315, 331, 351,389

Morphological hierarchy, 6, 67, 85, 86, 247Morphological set, 193, 200Morphological structure, 6, 131, 155, 170,

181, 191, 193, 199, 201, 215, 221,222, 229–231, 233, 236, 247, 250,257, 258, 260, 262, 263, 302, 311,352

Morphological table, 36Morphology, 193, 200–203, 216, 280Morphology of series strategy, 297Morphology of solving strategy, 294MPEG-like standard, x, 267, 361, 362, 364–

369, 377–379Multi-component system, 89Multi-layer communication, 7, 79Multi-layer computer system, 6Multi-layer network, 6, 79, 83, 86, 140, 141,

154Multi-layer network topology, viii, 86Multi-layer structure, 6, 67, 71, 77, 78, 86,

93, 131, 140, 141, 182

468 Index

Multi-layer system, 7, 37, 52, 78, 105, 182,339

Multi-level complex system, 7Multi-stratum network, 6Multicriteria analysis, 31, 267Multicriteria assesment, 97Multicriteria assignment problem, 18, 67,

85, 93, 178, 339, 343Multicriteria combinatorial optimization,

viii, 8, 78Multicriteria decision making, 12, 16, 91,

265, 280, 283, 296, 300, 402Multicriteria description, 17, 111, 114, 115,

119, 120, 124, 126, 127, 129, 130,132, 134, 161, 176, 265, 269, 292,371

Multicriteria Dijkstra algorithm, 94Multicriteria evaluation, 268Multicriteria Ford-Bellman algorithm, 94Multicriteria generalized assignment prob-

lem, 178Multicriteria knapsack-like problem, viii,

178, 300Multicriteria Kruskal’s spanning tree algo-

rithm, 74Multicriteria multiple choice problem, viii,

12, 17, 29, 91, 184, 186, 300, 316,390, 401

Multicriteria Prims spanning tree algorithm,74

Multicriteria QAP, 19Multicriteria ranking, viii, x, 18, 23, 81, 85,

119, 131–133, 136, 138, 141, 143,183, 189, 194, 265, 267, 279–281,283, 285, 290–292, 296, 298–300, 304, 306, 319, 333, 344, 345,361, 371, 372, 375, 408

Multicriteria selection, viii, 108, 131, 157,161, 194, 206, 222, 223, 300, 303,304

Multicriteria shortest path problem, 93, 94Multicriteria spanning tree problem, 74Multicriteria Steiner tree problem, viii, 74Multicriteria Steiner tree problem with cost

of Steiner vertices, 74Multidimensional scaling, 120Multidisciplinary optimization, 270Multiobjective evolutionary optimization,

35, 74Multipartite clique, 93, 95, 105, 107Multipartite graph, 36, 91, 94, 95, 105, 107,

109

Multipartite graph clustering, 89, 93–95,105, 107

Multiple choice problem, viii, 8, 12, 13, 17,21, 29, 30, 32, 34, 35, 37, 60–62,81, 91, 105–108, 157, 165–167,171, 172, 174, 175, 178–180, 184,194, 206, 218–220, 222, 224, 226,227, 247, 249, 265, 267, 268, 270,275, 300, 301, 313, 315, 316, 323,337, 351, 357, 374, 389, 390, 398,399, 401, 409, 410

Multiple choice problem with multiset esti-mates, 61–63, 390

Multiple domain problem, 262Multiple hotlink assignment, 178Multiple selection scheme, 303, 304Multisensor tracking, 103Multiset, 37–39, 49Multiset coefficient, 38, 39, 65Multiset estimate, 37–41, 47, 48, 50, 60–64,

66, 111, 161, 267, 269, 273, 276,357, 358, 400

Multiset number, 38, 47, 65Multistage design, ix, 3, 7, 247, 249, 256,

263, 267, 316, 336, 375Multistage trajectory, 247, 262, 263, 361

NNeighbor hierarchical layers, 78, 339Neighborhood of Pareto-efficient solutions,

20, 116, 118, 163Network design, 72, 183, 270Network extension, 182, 183, 186Network hierarchy, 79, 182, 183, 407Network improvement, 182–184Network protocol, 100, 270Network topology, 86, 183, 270Neural network, 102, 283Node weighted Steiner tree problem, 74Nonlinear mixed-integer optimization, 35,

270Notebook, 191, 203–205, 222, 267, 299, 302NP-complete, 95, 195NP-hard, 17–19, 46, 74, 83, 85, 93, 94, 101,

142, 164, 178, 221, 228, 343Number of multiset, 39

OObject oriented design, 1OLAP system, 36, 89Online reconfiguration, 108Online Steiner tree problem, 74

Index 469

Ontology, 7, 67, 71, 72, 91, 156, 157, 245,299, 316

Optimal organizational hierarchy, 67, 76, 77,91

Ordinal assessment, 37, 38, 48Ordinal compatibility, 19, 86, 115, 137, 138,

166, 200Ordinal estimate, 50, 85, 97, 115, 122, 124,

126, 127, 130, 138, 145, 147, 161,166, 181, 189, 223, 281, 283, 302,303, 306, 354, 376, 377

Ordinal priority, 18, 193, 200, 215, 236, 291–293, 301, 302

Ordinal scale, 37–39, 70, 83, 86, 111, 114,115, 119–122, 124, 137, 148, 157,161, 162, 167, 184, 185, 188, 200,223, 283, 291, 304, 306, 319, 344,377, 396

Ordinal scale for system quality, 122, 124,137

Organic hierarchy, 4, 7Organizational hierarchy, 7Organizational structure, 76, 245Outranking technique, 121, 122, 124, 130,

133, 183, 270, 283, 294, 297, 408Overlay structure, 170, 171

PParameter space investigation, 1, 270Pareto chart based method, 131, 132, 134,

136, 141, 143Pareto-based morphological analysis, 13, 16,

21, 28, 32–35Pareto-efficient composite DA, 30, 49, 50,

258–260, 273, 297, 306, 308,319–322, 355, 394, 396

Pareto-efficient DA, 28, 166, 253–255, 258–260, 273, 297, 306, 308

Pareto-efficient element, 133, 294, 297Pareto-efficient estimate, 40, 45Pareto-efficient path, 93Pareto-efficient point, 20, 28, 114, 121, 122,

131, 163Pareto-efficient solution, 13, 16, 17, 19, 20,

28, 32, 34, 59, 74, 93, 102, 115,116, 118, 127, 129, 138, 160–163,166, 196, 221, 222, 227–229, 236,249, 258, 259, 270, 271, 305, 337,344, 410

Pareto-efficient subsystem, 140Pareto-efficient trajectory, 255, 336Pareto-layer, 120–122, 124, 130, 228, 410

Pareto-rule, 70, 114, 294, 297Partition-synthesis heuristic, 74Partitioning, viii, 11, 67Petri net, 7, 72, 316Phone network, 184Phylogenetic tree, 7Plan of student activity, 229Political marketing, 270Polytree, 7Poset of system quality, 19, 21, 49, 50, 54, 56,

59, 60, 115, 137–140, 162, 163,167, 255, 296, 305, 306, 334, 355,394, 396

Poset-like estimate, 124, 127, 144Poset-like scale, 20, 48, 111, 114–116, 118,

119, 121, 122, 129, 138–140, 144,157, 161–163, 354

Precedence, 267–269, 408Predictive detection of interconnected sys-

tem components, 143Predictive detection of low quality network

topology, 132Predictive detection of system bottleneck,

132, 142, 143Predictive detection of system component,

132, 143Predictive forecasting, 131Preference matrix, 294, 297Preference relation, vii, 127, 200, 228, 280,

281, 286, 292, 293, 298Prim’s algorithm, 74Prize-collecting Steiner tree problem, 74Problem formulation, 280, 291, 298Problem framework, 4, 78, 159, 290Problem of compatible representatives, 105,

107Problem of representatives, 36, 89, 92, 93,

105Problem reformulation, 288, 290, 291, 298Problem resolving, 288Problem restructuring, 288, 290, 291Problem solving, 280, 283, 288, 291Problem solving framework, 4, 185, 192,

249, 283, 286, 288, 289, 291, 316Problem structuring, vii, 4, 281, 286, 288,

291Profit, 17, 180, 185, 196–198, 206, 217, 218,

231, 268, 269, 313, 314, 362, 371,374, 408, 411

Promethee, 121, 124, 130Protocol generation, 401, 402Prototype, 299, 301, 304, 312Prototype based design, 1

470 Index

Proximity, 16, 26–28, 39, 70, 71, 94, 124,155, 166, 169, 191, 195, 196,207–209, 212–215, 217, 220,236, 246, 314

Proximity matrix, 45

QQuadratic assignment problem (QAP), 13,

18, 19, 93, 95, 350Quality management, 131, 132Quantitative estimate, 122, 126, 127, 281Quantitative scale, 111, 114, 115, 119, 120,

157Quasi sub-clique, 147Quasi-clique, 146–149, 151, 153, 154Quasi-metric, 207

RRAM, 171, 172Random algorithm, 102, 343Ranking, 191, 193, 194, 199, 200, 207, 209,

211, 215, 216, 218–220, 236, 237,245, 280, 281, 284–286, 289–291

Ranking problem, 8, 9, 281, 401Reassignment, 157, 182, 189Recoloring, 169Recoloring cost matrix, 169Recommender system, 299Reconfigurable problem solving framework,

286Reconfiguration, 1, 90, 91, 105, 106, 108,

155, 165, 181, 186, 265, 279, 280,289, 291, 329, 336, 338, 356, 359,380, 400, 413

Reconfiguration of problem solving process,289, 291

Recovering problem, 158Recycling, 1, 7Redesign, ix, 7, 154, 155, 158, 164, 165, 183,

189, 262, 263, 265, 338, 390, 400,413

Reengineering, 155, 164, 232, 245, 390Reference point, 52, 120, 122, 124, 130, 290Reference solution, 130Reference vector, 220Reliable modular software design, 35Reoptimization, 155, 159, 164Repair plan, 299, 301, 306, 307Replacement, 159, 163, 166, 186, 194, 197,

198, 205, 206, 222, 224, 225Restructuring, viii, ix, 8, 67, 68, 91, 159,

164–166

Resultant ordinal estimate, 120, 127Resultant priority, 23, 127, 129, 230, 231,

286, 306, 319, 333Resultant ranking, 289, 290Reverse engineering, 1Ring, 78, 79, 82, 83, 87, 142, 183Root, 5, 7, 141, 170, 251Routing, 75, 226, 233, 245, 403, 404, 407

SSAT problem, 226Scale integration, 111, 112, 120, 122Scale transformation, 111, 112, 119, 130Scale transformation problem, 111Scale-poset, 39Scatter search, 102Scheduling, 100, 226, 270Search engine, 300Secondary tree, 142Sensor, 270, 389Sensor network, 100, 270Series ranking strategy, 288, 289Series solving strategy, 280, 294, 297, 298Series trajectory, 249Series-parallel graph, 176, 249Series-parallel ranking strategy, 288Series-parallel solving strategy, 294, 298Series-parallel trajectory, 249Set median, 46, 53, 54, 56, 60, 62, 64, 195,

196Set morphology, 193, 196Set of change items, 268, 271, 273Shakun model for evolutionary design, 265Shortest common superstring problem, 164Shortest path on multipartite graph, 94Shortest path problem, 8, 89, 93, 94, 105,

107, 316Similarity, 207, 212Simon, Herbert A., vii, 4, 281, 282Simulated annealing, 74, 102Simulation based design, 270Software configuration management, 265Solution graph, 262Solving strategy, x, 89, 94, 106, 279–281,

285, 326Sorting, 249, 279–281, 284, 291, 292, 296,

298Sorting problem, 8, 9, 119, 122, 131, 136,

200, 281, 283Space of system excellence, 18, 20, 115, 116,

137, 163Space of system quality, 19, 21, 31, 115, 137,

274, 320, 321, 334

Index 471

Spanning forest, 74, 183Spanning network, 252Spanning problem with minimum internal

nodes, 141Spanning structure, 68, 74, 76, 142, 252Spanning tree, 8, 9, 67, 72–74, 83, 93, 141,

165, 178, 183, 226, 249, 251, 252,270

Special system ordinal scale, 114, 116, 118,121, 122, 127, 129, 163

Standard for multimedia information, 9, 361,377, 379

Star, 74, 79, 87Start-up company, 247, 271Start-up team, 252State transition diagram, 263Statechart, 7Steiner forest problem, 74Steiner point, 74, 178–180Steiner tree, 67, 74, 93, 155, 164, 170, 178,

179, 183, 226Steiner tree coloring problem, 74Steiner tree problem with hop constraints, 74Steiner tree problem with minimum number

of Steiner points, 74Steiner tree problem with profits, 74Steiner tree problem with unit weights, 74Steiner tree scheduling problem, 74Stochastic Steiner tree problem, 74Strategy for multicriteria ranking, 9Structural constraint, 371Structured solution, 265, 315, 331, 351Student project, 232, 233, 245, 271Sub-clique, 147, 148, 151Sub-morphology, 200, 202Subsolution, 196, 198, 230, 231, 268, 275,

337, 357Substructure, 191, 192, 194–196, 198, 199,

205, 207, 222, 301, 312, 411Subtree, 171, 177, 201–203, 221Subtree distance, 212Summarization by components, 41, 42, 124Super-morphology, 200, 202Supercharger for gas-pump aggregate, 133Supersolution, 197, 198, 230, 231, 268, 275,

337, 357Superstructure, 191, 193–195, 197, 199,

205, 206, 237, 245, 301, 312, 411Supertree, 194, 201–203Survivable Steiner network problem, 74Syndrome, 149System analysis, 232, 233, 245System architecture, 193, 329

System bottleneck, ix, 7, 8, 131–134, 136–140, 142, 143, 145, 154, 158, 161,166

System change, 105, 108, 143, 268, 269, 371,390

System composition, 48, 116, 389System configuration, ix, x, 1, 12, 89–91, 93,

94, 100, 105–109, 316, 317, 351,390

System configuration design, viii, 1, 90, 91,93, 94, 100, 105, 107–109, 316

System configuration trajectory, 107System design, viii–x, 1, 3, 7–9, 232, 233,

245, 262, 263, 268, 271, 351, 390,395, 398

System development, ix, 7, 109, 156, 157,183, 185, 190, 265, 390

System diagnosis, 262, 263System evaluation, ix, x, 3, 7–9, 111, 112,

116, 122, 124, 129, 130, 157, 160,161, 163

System evolution, ix, 7, 9, 109, 143, 144,183, 265, 267, 269, 362

System excellence, 19, 20, 137, 160, 161,163

System extension, 7, 155–158, 163, 265,389, 396

System fault, 131, 132, 139, 145, 148, 154System forecast, 143, 267, 268, 271System function cluster, 146System generation, 7, 265, 267, 268, 271,

401System hierarchy, ix, 6, 11, 19, 68, 71, 78,

86, 87, 90, 93, 114, 181, 193, 332System improvement, ix, x, 1, 3, 7, 9, 155–

161, 163, 166–168, 190, 262, 263,336, 356, 389, 390, 396, 399, 400

System kernel, 192, 194, 196–198, 204–206,222, 223, 226, 227, 230, 231, 271,275, 312, 357

System life cycle, ix, 1, 69, 232, 245, 269,316

System maturity, 265System modularity, 1System morphology, 158, 200, 201, 395System quality, 19, 115, 122, 124, 130, 137–

139, 157, 160–163, 167System reconfiguration, 1, 91, 108, 163, 181,

329System structure, ix, 3, 14, 50, 105, 113, 124,

131, 143, 149, 155–158, 166, 170,181, 182, 269, 390, 396

System syndrome, 149, 154

472 Index

System synthesis, viii, 1, 11, 232System testing, 1, 7, 112, 141, 145, 148, 247,

262, 263System trajectory, ix, x, 7, 91, 94, 107, 108,

143, 232, 245, 247, 249–251, 255,263, 311, 315, 316, 324, 325, 331,336

System utilization, 263Systems engineering, ix, x, 90, 231, 245,

269, 271, 317, 380

TTabu search, 18, 102Technological trajectory, 265, 376, 379, 380Telemetry system, ix, x, 9, 270, 351, 352,

359Terminal Steiner tree problem, 74Theory of knowledge, 1Theory of technical systems, 1Thesauri, 7, 72Three-part motor vehicle, 301, 305Three-stage problem solving framework,

288Three-stage series ranking strategy, 289Three-stage series-parallel ranking strategy,

290Three-stage trajectory, 250Time point, 247, 249Timetabling, 100Top-level network, 249–252, 256, 260TOPSIS, 36, 122, 124, 126, 130Track initiation rule, 152Track maintenance rule, 153Trajectory of bottleneck, 144, 145Trajectory of composite bottleneck, 145Trajectory of system component, 154Transformation, 85, 155, 163, 165, 169, 170,

172, 178, 181, 182, 207, 208, 260,265, 269, 285, 293, 390

Transformation of hierarchy, 67Transformation of layered structure, 182Transformation of morphological structure,

181Transformation of tree into Steiner tree, 67,

178Transversal, 93, 100, 109Traveling salesman problem (TSP), 164,

226, 270Tree, 4, 7, 67, 68, 73, 74, 78, 79, 82, 83,

87, 90, 93, 142, 155, 170, 171,175, 176, 178, 179, 181, 183, 191,193, 194, 196, 199, 201, 203, 207,212–216, 221, 247, 249–251

Tree edit distance, 212Tree-inclusion problem, 178Tree-like structure, 6, 7, 70, 133, 170, 171,

193, 204, 236, 237, 247, 249, 252,256, 310, 390

Tree-like system model, 19, 193, 215, 236,249, 267, 271, 301, 317, 326, 361,401

Tree-like system trajectory, 249–251, 256,260

Triangle inequality, 44TRIZ, ix, 1Two-layer network, 83, 87Two-level network design problem, 142Two-stage evolution, 265

UUML, 72Upgrade, ix, 7, 155, 158, 165, 176, 183, 338,

390, 399Utility, 17, 112, 119, 120, 122, 160, 161, 217,

218, 270, 371Utility function, 119, 120, 122, 124, 127,

130, 133, 161, 284, 290, 294, 297

VVariable neighborhood search, 102, 343Vector estimate, 17, 85, 111, 114, 115, 119,

120, 124, 126, 127, 129, 130, 132,134, 161, 176, 269, 292, 371

Vector-like proximity, 28, 43, 94, 196, 208,209, 211, 215, 221, 222, 236

Venn-diagram, 194Version modeling, 265, 270Vertex coloring problem, 101, 102Vertex recoloring, 168, 169VLSI design, 72

WWeb-based system, ix, x, 9, 93, 249, 267,

299, 300, 315–318, 322, 326, 329Wide area network (WAN), 182Wireless ad hoc network, 75, 344Wireless network, 339, 340Wireless sensor, ix, x, 9, 381, 382, 384, 387

Index 473

Wireless sensor network (WSN), 75, 267,390, 401, 407, 413

Worst point, 115, 121, 122, 124, 126, 127,129, 139, 163

ZZigBee communication protocol, x, 9, 267,

390, 391, 401, 402, 413Zwicky, Fritz, 11, 12