main program sequence 中文意思是什麼
main program sequence
解釋
主程序序列-
Second, emphases were put on set authentication research, an architecture of set authentication was proposed to expound the intelligent architecture design theory fitting with layered model. then, with displaying the protocol model, the process control principle was analysed, and more attention was taken to discuss the mathematic model of rsa algorithm and integration of various model methods, to give the component model based on main - program / sub - process architecture family and formalized description. next, by establishing the usercase model, activity model, object structure model and sequence model in order, and based on the data model, a lot of measure were taken to optimize these models. finally, the main framework of set authentication in acme template was given, with the java implement and aop implement for typical applications together
然後重點對set認證的領域模型進行了研究與分析，提出set認證的領域框架，闡述了與層次模型相適應的智能軟體構架設計思想;進而提出set認證的協議模型，分析其過程式控制制原理，並且進一步探討了rsa安全演算法的數學模型和多種建模機制的綜合應用，給出基於主程序/子過程體系結構風格和形式描述的構件模型。在依次建立set認證的用例模型、活動模型、對象結構模型、順序模型的基礎之上，分析得到了系統的數據模型，然後使用多種手段對模型進行優化。最後給出了set認證系統主要框架的acme描述，以及set認證系統中的典型應用的java實現和面向方面實現。 -
The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed
該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
分享友人