Диссертация (1137155), страница 20
Текст из файла (страница 20)
1981. Vol. 12, no. 1.pp. 36-39.65. Brynjolfsson E., Hitt L., and Yang S. Intangible Assets: Computersand Organizational Capital // Brookings Papers on EconomicActivity. 2002. Vol. 2, no. 1. pp. 137-181.66. Brynjolfsson E., Renshaw A., and Alstyne M. The Matrix of Change// Sloan Management Review. 1997. Vol. 38, no. 2.67. Brynjolfsson E., Saunders A. Wired for innovation : how informationtechnology is reshaping the economy. Massachusetts: MIT, 2010.68. Chen P.P. The Entity-Relationship Model - Towards a Unified Viewof Data // ACM Transactions on Database Systems.
1976. Vol. 1, no.1. pp. 9-36.69. Chief Infromation Officer Council. A Practical Guide to FederalEnterprise Architecture Framework [Электронный ресурс] // U.S.Government Accountability Office. 2001. URL: http://www.gao.gov/assets/590/588407.pdf (дата обращения: 03.08.2013).70. Chorafas D. Enterprise Architecture and New Generation InformationSystems. CRC Press, 2001.71. Datta D., Deb K., Fonseca C.M.
Solving Class Timetabling Problemof IIT Kanpur using multi-objective evolutionary algorithm[Электронный ресурс] // College of Engineering, Michigan StateUniversity.2006.URL:http://www.egr.msu.edu/~kdeb/papers/k2006006.pdf (дата обращения: 20.05.2014).72. Deb K., Pratap A., Agarwal S., and Meyarivan T. A Fast and ElitistMultiobjective Genetic Algorithm: NSGA-II // IEEE Transactions onEvolutionary Computation. 2002. Vol. 6, no. 4. pp. 182-197.15173.
Dube M., Dixit S. Comprehensive Measurement Frameworks forEnterprise Architectures // International Journal of Computer Science& Information Technology. 2011. Vol. 3, no. 4. pp. 71-92.74. Emery D., Hilliard R. Every Architecture Description Needs aFramework: Expressing Architecture Frameworks Using ISO/IEC42010 // In: Software Architecture, 2009 & European Conference onSoftwareArchitecture.WICSA/ECSA2009.JointWorkingIEEE/IFIP Conference on. Cambridge: IEEE, 2009.75.
Enterprise Architecture Research Forum. Definition for EA as definedby EARF[Электронныйресурс] //EnterpriseKnowledgeEngineering and Management (MEKE) Research Group — MEKEProjects Site. 2013. URL: http://hufee.meraka.org.za/Hufeesite/collaborations/earf/definition-for-ea-as-defined-by-the-group(датаобращения: 14.03.2013).76.
Gaschnig J. Performance measurement and analysis of certain searchalgorithms. Technical report CMU-CS-79-124. Pittsburgh: CarnegieMellon University, 1979.77. Graves T. Enterprise Architecture: A Pocket Guide. Ely: ITGovernance Publishing, 2009.78. Harel D. Statecharts: A visual formalism for complex systems //Science of Computer Programming. 1987. no. 8(3). pp. 231–274.79. IFAC/IFIP Task Force on Architectures for Enterprise Integration.GERAM: Generalised Enterprise Reference Architecture andMethodology Version 1.6.3 [Электронный ресурс] // School ofInformation and Communication Technology - Griffith University.1999.
URL: http://www.ict.griffith.edu.au/~bernus/taskforce/geram/versions/geram1-6-3/GERAMv1.6.3.pdf17.08.2013).(датаобращения:15280. Johnson D.S., Aragon C.R., McGeoch L.A., and Schevon C.Optimization by simulated annealing: An experimental evaluation.Murray Hill, NJ: AT&T Bell Laboratories, 1987.81. Johnson P., Ekstedt M., Silva E., and Plazaola L. Using EnterpriseArchitecture for CIO Decision-Making: On the Importance of Theory// Proceedings of the Second Annual Conference on SystemsEngineering Research.
Los Angeles. 2004.82. Knowledge Based Systems, Inc. IDEF3 [Электронный ресурс] //IDEF Family of Methods. 2010. URL: http://www.idef.com/IDEF3.htm (дата обращения: 07.09.2013).83. LankhorstM.EnterpriseArchitectureatWork:Modelling,Communication and Analysis. Heidelberg: Springler, 2013.84. Le Vie D.S. Understanding Data Flow Diagrams // AnnualConference. Society for Technical Communication (STC). Orlando.2000. Vol.
47. pp. 396-401.85. Luke S. Essentials of Metaheuristics. A Set of Undergraduate LectureNotes. Department of Computer Science George Mason University[Электронный ресурс] // George Mason University Department ofComputerScience.2013.URL:http://cs.gmu.edu/~sean/book/metaheuristics/Essentials.pdf (дата обращения: 18.03.2014).86. Mackworth A.K. Consistency in networks of relations // ArtificialIntelligence. 1977.
Vol. 8, no. 1. pp. 99-118.87. McGovern J. A Practical Guide to Enterprise Architecture. UpperSaddle River, NJ: Prentice Hall Professional Technical Reference,2004.15388. Nidhiry N.M., Saravanan R. FMS Scheduling Optimization UsingModified NSGA-II // Proceedings of 11th IRAJ InternationalConference. Chennai, India. 2014.89. Peng W., Zhang Q., and Li H. Comparison between MOEA/D andNSGA-II on the Multi-Objective Travelling Salesman Problem //Studies in Computational Intelligence. 2009.
Vol. 171, no. 1. pp. 309324.90. Proper E. Enterprise Architecture: Creating Value by InformedGovernance. Heidelberg: Springer, 2009.91. Radulescu Z., Radulescu M. Project Portfolio Selection Models andDecision Support // Studies in Informatics and Control. 2001. Vol.
10,no. 4. pp. 275-286.92. Rinnoy Kan A.H.G., Timmer G.T. Stochastic Global OptimizationMethods // Mathematical Programming. 1987. Vol. 39, no. 1. pp. 2756.93. Ross J., Weill P., and Robertson D. Enterprise Architecture AsStrategy: Creating a Foundation for Business Execution. Harvard:Harvard Business Press, 2006.94. Ruttkay Z. Constraint satisfaction a survey // CWI Quarterly. 1998.Vol.
11, no. 2/3. pp. 163-214.95. Schaffer J.D. Multiple Objective Optimization with Vector EvaluatedGenetic Algorithms // In: Proceedings of the 1st internationalConference on Genetic Algorithms. Pittsburgh: Lawrence Erlbaum,1985. pp. 93-100.15496. Scheer A.W., Nüttgens M. ARIS Architecture and Reference Modelsfor Business Process Management. Vol 1806.
// In: Business ProcessManagement. Lecture Notes in Computer Science. Heidelberg:Springler, 2000. pp. 376-389.97. Schekkerman J. How to Manage the Enterprise Architecture Practice.Victoria: Trafford Publishing, 2009.98. Seshadri A. NSGA - II: A multi-objective optimization algorithm File Exchange - Mathlab Central [Электронный ресурс] //MathWorks. 2006. URL: http://www.mathworks.com/matlabcentral/fileexchange/10429-nsga-ii-a-multi-objective-optimization-algorithm(дата обращения: 20.03.2014).99. Sessions R. A Comparison of the Top Four Enterprise-ArchitectureMethodologies [Электронный ресурс] // Microsioft DeveloperNetwork.2008.URL:http://msdn.microsoft.com/en-us/library/bb466232.aspx (дата обращения: 03.08.2013).100.
Sowa F., Zachman J. Extending and formalizing the framework forinformation systems architecture // IBM systems journal. 1992. Vol.3, no. 3. pp. 590-616.101. Spewak S., Hill S. Enterprise architecture planning: developing ablueprint for data, applications, and technology. New York: Wiley,1992.102.
Starkweather T., McDaniel S., Mathias K., and Whitley D. AComparison of Genetic Sequencing Operators // In: Proceedings ofthe Fourth International Conference on Genetic Algorithms. SanDiego, CA, USA: University of California, 1991.155103. The Open Group. Definitions [Электронный ресурс] // TOGAF 9.1.2011. URL: http://pubs.opengroup.org/architecture/togaf9-doc/arch/chap03.html (дата обращения: 04.03.2014).104. The Open Group. Part II: Architecture Development Method (ADM)[Электронный ресурс] // The Open Group Publications Server. 2011.URL:http://pubs.opengroup.org/architecture/togaf9-doc/arch/toc-pt2.html (дата обращения: 29.07.2013).105. The Open Group. TOGAF 9.1 [Электронный ресурс] // The OpenGroup Publications Server. 2011. URL: http://pubs.opengroup.org/architecture/togaf9-doc/arch/index.html(датаобращения:03.08.2013).106.
ObjectManagementGroup.UnifiedModelingLanguage[Электронный ресурс] // Object Management Group. 2011. URL:http://www.omg.org/spec/UML/ (дата обращения: 07.09.2013).107. Urbaczewski L., Mrdalj S. A Comparison of Enterprise ArchitectureFrameworks // Issues in Information Systems. 2006.
Vol. 7, no. 2. pp.18-23.108. Van Veldhuizen D., Lamount G. Multiobjective EvolutionaryAlgorithms: Analyzing the State-of-the Art. // EvolutionaryComputation. 2000. Vol. 8, no. 2.109. Zachman J. John Zachman's Concise Definition of The ZachmanFramework [Электронный ресурс] // Zachman International. 2008.URL: http://www.zachman.com/about-the-zachman-framework (датаобращения: 03.08.2013).110. Zachman J.
A Framework for Information Systems Architecture //IBM Systems Journal. 1987. Vol. 26, no. 3. pp. 276-292.156ПРИЛОЖЕНИЯ157Приложение 1. Результаты вычислительного экспериментаРешения задачи (2.30)-(2.31) для матрицы 5х6 методами удовлетворенияограничений.№2Легкость l(d(j))σl1 l2 l3 l4 l5 l61 -2 -2 -1 -2Ценность V(d(j))L4 -1 2,13 -4Vd1 Vd2 Vd3 Vd4 Vd5 Vd6c1 c2 c3 c4 c5 c6 c7 c8 c9 c10 c1132-11410,563916485 10132 -2 -2 -22 -11 1,60 -431421-11,72395 102735 -2 -2 -2101 1,37 -431412-11,72395 10274 -3 -20 -111 1,49 -4-114312 -1,28485 1083 -3 -22 -1 -33 2,36 -4-111324 -2,444811 1,24 -414-1312 -0,11102 -2 -21 -1 -11 1,25 -4141-132123 -2 -22 -301 1,79 -4131421522 -2 -4 -211 2,13 -4132141562 -2 -2 -2 -11 1,59 -413-1141732 -2 -2 -4 -13 2,42 -41132-11762 -2 -2 -2 -33 2,28 -4113-11802 -2 -3 -1 -11 1,70 -411-1398 -2 -2 -1 -12П3Элем.
преобразования c(i)cov27 116 11487 111648 П2739 11165 10 113916275 10274839 11160,225 1027 11483916 П-10,895 1039 11271648-11,06 1139165 1027482 -0,44 1139485 1027164 -1,11 115 103916482724 -1,11 115 103948162742 -1,11 115 1048392716Всего получено 180 решений. В таблице приведены только те решения, для которых построеныграфики целевых функций в параграфе 3.4.3Парето-оптимальные решения.158Приложение 2. Листинг основной процедуры' Построение множества Парето-оптимальных решений с использованием NSGA-IISub BuildParetoSet(MatrixID As Integer)Dim i As IntegerDim p As IntegerDim s As IntegerDim s1 As IntegerDim m As IntegerDim Tr() As IntegerDim bSize As Integer' размер блока строк, отображающих решениеDim lTotal As Double' значения общей "легкости" траекторииDim pPairs As Integer ' количество пар практикDim CovV As Double' ковариация графиков ценности практикDim MatingPool(1 To mPoolSize) As Integer ' пул спариванияDim Offsprings() As Integer ' массив хромосом потомковDim nCh As Integer' количество потомков в текущем поколенииDim mySW As StopWatchMaxLevel = 0MedLevel = 0StartTime = Now()Set mySW = New StopWatchmySW.StartTimerForm_frmMatrixOutput.lTime.Caption = "Начало: " & StartTimeForm_frmMatrixOutput.lOutput.Caption = "..."' инициализация моделиCall Model_Init(MatrixID)' массив хромосом потомковReDim Offsprings(1 To mPoolSize * 2, 1 To kM)' заполнение популяции PopA (построение случайных допустимых решений)Call FillPop' вычисление целевых функций агентов популяцииFor i = 1 To nP159Call CalcFitness(PopA, i, FitA)NextForm_frmMatrixOutput.lBranches.Caption = "Недоминируемая сортировка..."' ранжирование агентов популяции (недоминируемая сортировка)Call NDS(PopA, FitA, 2)' вычисление расстояния скученности (crouding distance) (будет в FitA(i,0))Call CroudDist(PopA, FitA)For i = 1 To nGenForm_frmMatrixOutput.lBranches.Caption = "Поколение " & i & _": турнирная селекция..."DoEvents' Турнирная селекция.
Из популяции PopA() выбирается mPoolSize особей' в MatingPool()Call TournamentSelection(PopA, FitA, mPoolSize, MatingPool)Form_frmMatrixOutput.lBranches.Caption = "Поколение " & i & _": генетические операторы..."DoEvents' выполняем кроссовер и мутацию среди особей пула скрещивания,' хромосомы потомков - в OffspringsCall GeneticOperator(PopA, MatingPool, Offsprings, nCh)Form_frmMatrixOutput.lBranches.Caption = "Поколение " & i & _": рекомбинация..."DoEvents' формируем промежуточную популяцию, PopB = PopA + OffspringsCall Recombine(PopB, FitB, PopA, FitA, Offsprings, nCh)Form_frmMatrixOutput.lBranches.Caption = "Поколение " & i & _": недомининуемая сортировка..."DoEvents' ранжирование агентов популяции (недоминируемая сортировка)Call NDS(PopB, FitB, 2)' вычисление расстояния скученности (crouding distance)' (будет в FitB(i,0))Call CroudDist(PopB, FitB)' выбираем особи в новое поколение PopA() на основании ранга160' и расстояния скученностиCall SelectNewGen(PopA, FitA, PopB, FitB)DoEvents' если нажата кнопка "Прервать"If Halt Theni = nGenEnd IfNext iFinishTime = Now()Form_frmMatrixOutput.lTime.Caption = Form_frmMatrixOutput.lTime.Caption & _", завершение: " & FinishTime & " (" & Format(FinishTime _- StartTime, "hh:mm:ss") & ") " & mySW.EndTimer()' Вывод решений NSGA-2 в ExcelCall OutputPopASet mySW = NothingEnd Sub161Приложение 3.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
