首页 > 最新文献

Tenth International Conference on Computer Modeling and Simulation (uksim 2008)最新文献

英文 中文
SimGrid: A Generic Framework for Large-Scale Distributed Experiments SimGrid:大规模分布式实验的通用框架
Pub Date : 2008-04-01 DOI: 10.1109/P2P.2009.5284500
M. Quinson
Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unfortunately, it is often impossible to obtain theoretical or analytical results to compare the performance of algorithms targeting such systems. One possibility is to conduct large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms as experiments are labor-intensive and results typically not reproducible. Consequently, one must resort to simulations, which enable reproducible results and also make it possible to explore wide ranges of platform and application scenarios. In this paper we describe the SimGrid framework, a simulation-based framework for evaluating cluster, grid and P2P algorithms and heuristics. This paper focuses on SimGrid v3, which greatly improves on previous versions thanks to a novel and validated modular simulation engine that achieves higher simulation speed without hindering simulation accuracy. Also, two new user interfaces were added to broaden the targeted research community. After surveying existing tools and methodologies we describe the key features and benefits of SimGrid.
分布式计算是一个非常广泛和活跃的研究领域,包括集群计算、计算网格、桌面网格和点对点(P2P)系统。不幸的是,通常不可能获得理论或分析结果来比较针对此类系统的算法的性能。一种可能性是在真实平台上进行大量的背靠背实验。虽然这在紧密耦合的平台上是可能的,但在现代分布式平台上是不可行的,因为实验是劳动密集型的,结果通常是不可复制的。因此,必须求助于模拟,这可以实现可再现的结果,并使探索广泛的平台和应用程序场景成为可能。在本文中,我们描述了SimGrid框架,这是一个基于模拟的框架,用于评估集群,网格和P2P算法和启发式。本文的重点是SimGrid v3,由于采用了一种新颖且经过验证的模块化仿真引擎,该引擎在不影响仿真精度的情况下实现了更高的仿真速度,大大改进了以前的版本。此外,还增加了两个新的用户界面,以扩大目标研究社区。在调查了现有的工具和方法之后,我们描述了SimGrid的主要特性和优点。
{"title":"SimGrid: A Generic Framework for Large-Scale Distributed Experiments","authors":"M. Quinson","doi":"10.1109/P2P.2009.5284500","DOIUrl":"https://doi.org/10.1109/P2P.2009.5284500","url":null,"abstract":"Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unfortunately, it is often impossible to obtain theoretical or analytical results to compare the performance of algorithms targeting such systems. One possibility is to conduct large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms as experiments are labor-intensive and results typically not reproducible. Consequently, one must resort to simulations, which enable reproducible results and also make it possible to explore wide ranges of platform and application scenarios. In this paper we describe the SimGrid framework, a simulation-based framework for evaluating cluster, grid and P2P algorithms and heuristics. This paper focuses on SimGrid v3, which greatly improves on previous versions thanks to a novel and validated modular simulation engine that achieves higher simulation speed without hindering simulation accuracy. Also, two new user interfaces were added to broaden the targeted research community. After surveying existing tools and methodologies we describe the key features and benefits of SimGrid.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"58 1","pages":"126-131"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76314040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 481
Fuzzy Online Risk Assessment for Distributed Intrusion Prediction and Prevention Systems 分布式入侵预测与防御系统的模糊在线风险评估
K. Haslum, A. Abraham, S. J. Knapskog
A Distributed Intrusion Prediction and Prevention Systems (DIPPS) not only detects and prevents possible intrusions but also possesses the capability to predict possible intrusions in a distributed network. Based on the DIPS sensors, instead of merely preventing the attackers or blocking traffic, we propose a fuzzy logic based online risk assessment scheme. The key idea of DIPPS is to protect the network(s) linked to assets, which are considered to be very risky. To implement DIPPS we used a Distributed Intrusion Detection System (DIDS) with extended real time traffic surveillance and online risk assessment. To model and predict the next step of an attacker, we used a Hidden Markov Model (HMM) that captures the interaction between the attacker and the network. The interaction between various DIDS and integration of their output are achieved through a HMM. The novelty of this paper is the detailed development of Fuzzy Logic Controllers to estimate the various risk(s) that are dependent on several other variables based on the inputs from HMM modules and the DIDS agents. To develop the fuzzy risk expert system, if-then fuzzy rules were formulated based on interviews with security experts and network administrators. Preliminary results indicate that such a system is very practical for protecting assets which are prone to attacks or misuse, i.e. highly at risk.
分布式入侵预测与防御系统(DIPPS)不仅能够检测和预防可能发生的入侵,还具有对分布式网络中可能发生的入侵进行预测的能力。在DIPS传感器的基础上,我们提出了一种基于模糊逻辑的在线风险评估方案,而不是仅仅阻止攻击者或阻塞流量。DIPPS的关键思想是保护与资产相关的网络,这些资产被认为是非常危险的。为了实现DIPPS,我们使用了分布式入侵检测系统(DIDS),该系统具有扩展的实时交通监控和在线风险评估功能。为了建模和预测攻击者的下一步行动,我们使用了隐马尔可夫模型(HMM)来捕获攻击者和网络之间的交互。各种did之间的交互和输出的集成是通过HMM实现的。本文的新颖之处在于模糊逻辑控制器的详细发展,该控制器基于HMM模块和DIDS代理的输入来估计依赖于几个其他变量的各种风险。为了开发模糊风险专家系统,在对安全专家和网络管理员进行访谈的基础上,制定了if-then模糊规则。初步结果表明,这种系统对于保护容易受到攻击或滥用的资产(即高风险资产)非常实用。
{"title":"Fuzzy Online Risk Assessment for Distributed Intrusion Prediction and Prevention Systems","authors":"K. Haslum, A. Abraham, S. J. Knapskog","doi":"10.1109/UKSIM.2008.30","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.30","url":null,"abstract":"A Distributed Intrusion Prediction and Prevention Systems (DIPPS) not only detects and prevents possible intrusions but also possesses the capability to predict possible intrusions in a distributed network. Based on the DIPS sensors, instead of merely preventing the attackers or blocking traffic, we propose a fuzzy logic based online risk assessment scheme. The key idea of DIPPS is to protect the network(s) linked to assets, which are considered to be very risky. To implement DIPPS we used a Distributed Intrusion Detection System (DIDS) with extended real time traffic surveillance and online risk assessment. To model and predict the next step of an attacker, we used a Hidden Markov Model (HMM) that captures the interaction between the attacker and the network. The interaction between various DIDS and integration of their output are achieved through a HMM. The novelty of this paper is the detailed development of Fuzzy Logic Controllers to estimate the various risk(s) that are dependent on several other variables based on the inputs from HMM modules and the DIDS agents. To develop the fuzzy risk expert system, if-then fuzzy rules were formulated based on interviews with security experts and network administrators. Preliminary results indicate that such a system is very practical for protecting assets which are prone to attacks or misuse, i.e. highly at risk.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"1 1","pages":"216-223"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81371927","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 47
Flexible Offline-Visualization for Mobile Wireless Networks 移动无线网络的灵活离线可视化
J. Lessmann, T. Heimfarth
For the evaluation of wireless network protocols, simulation has established itself as a good compromise between cost and complexity, on the one hand, and accuracy of results, on the other hand. In order to assess and debug the simulated protocols, visualization both in the form of textual console messages and graphical representations can be of great help. In this paper, we present a network visualizer which was written for the wireless network simulator ShoX. Aside from nodes, links, movements and data packets, our visualizer allows to graphically display arbitrary node and link states in an intuitive and flexible way. As opposed to other visualization tools, it provides the possibility to change the way in which such inner states are displayed without running the simulation again. This can significantly improve the designer's productivity especially in complex network scenarios. Further, our visualizer allows to display textual debug messages together with the graphical animation in a synchronized form, thus combining the strengths of textual and graphical informations.
对于无线网络协议的评估,仿真已经成为成本和复杂性与结果准确性之间的一个很好的折衷。为了评估和调试模拟协议,以文本控制台消息和图形表示形式的可视化会有很大帮助。本文介绍了一个为无线网络模拟器ShoX编写的网络可视化工具。除了节点,链接,移动和数据包,我们的可视化工具允许以直观和灵活的方式图形化显示任意节点和链接状态。与其他可视化工具相反,它提供了更改内部状态显示方式的可能性,而无需再次运行模拟。这可以显著提高设计人员的工作效率,特别是在复杂的网络场景中。此外,我们的可视化工具允许以同步的形式将文本调试消息与图形动画一起显示,从而结合了文本和图形信息的优势。
{"title":"Flexible Offline-Visualization for Mobile Wireless Networks","authors":"J. Lessmann, T. Heimfarth","doi":"10.1109/UKSIM.2008.33","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.33","url":null,"abstract":"For the evaluation of wireless network protocols, simulation has established itself as a good compromise between cost and complexity, on the one hand, and accuracy of results, on the other hand. In order to assess and debug the simulated protocols, visualization both in the form of textual console messages and graphical representations can be of great help. In this paper, we present a network visualizer which was written for the wireless network simulator ShoX. Aside from nodes, links, movements and data packets, our visualizer allows to graphically display arbitrary node and link states in an intuitive and flexible way. As opposed to other visualization tools, it provides the possibility to change the way in which such inner states are displayed without running the simulation again. This can significantly improve the designer's productivity especially in complex network scenarios. Further, our visualizer allows to display textual debug messages together with the graphical animation in a synchronized form, thus combining the strengths of textual and graphical informations.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"45 1","pages":"404-409"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90461390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Concept of Multi-agent Conditional Interplay 多智能体条件相互作用的概念
A. Botchkaryov, Serhiy Kovela
A new approach to modeling the collective behaviour in terms of conditional multi-agent interplay is proposed in this paper. Within this approach, we explicitly model the situation where some agents’ action history (past behaviour) conditions subsequent actions of some other agents. Such a viewpoint of the multi-agent behaviour provides for the possibility to create and study useful models of collective behaviour, ultimately gaining a deeper understanding of the basic laws of the conditional interplay. The temporizing game as an example of modeling the collective behaviour within the sample coordination space, the cyberCromlech, demonstrates the approach.
本文提出了一种基于条件多智能体相互作用的集体行为建模方法。在这种方法中,我们明确地模拟了一些代理的行为历史(过去的行为)条件下其他代理的后续行为的情况。这种多主体行为的观点为创建和研究有用的集体行为模型提供了可能性,最终对条件相互作用的基本规律有了更深入的理解。作为在样本协调空间(cyberCromlech)中对集体行为建模的一个例子,临时博弈演示了这种方法。
{"title":"Concept of Multi-agent Conditional Interplay","authors":"A. Botchkaryov, Serhiy Kovela","doi":"10.1109/UKSIM.2008.125","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.125","url":null,"abstract":"A new approach to modeling the collective behaviour in terms of conditional multi-agent interplay is proposed in this paper. Within this approach, we explicitly model the situation where some agents’ action history (past behaviour) conditions subsequent actions of some other agents. Such a viewpoint of the multi-agent behaviour provides for the possibility to create and study useful models of collective behaviour, ultimately gaining a deeper understanding of the basic laws of the conditional interplay. The temporizing game as an example of modeling the collective behaviour within the sample coordination space, the cyberCromlech, demonstrates the approach.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"4 1","pages":"100-105"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89208698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Decision Model for Group Assessment of Credit Applications 信贷申请群体评估的决策模型
N. Karadimas, G. Rigopoulos, A. Orsoni
This paper proposes a group decision model for the assessment of credit/loan applications by a team. As many new players enter the finance sector, offering new products and different forms of financing, it is important that credit applications are assessed from multiple angles including the marketing and risk management sides. While external organisations offer independent ratings and credit reports of potential applicants, lending firms need to take into account internal criteria in order to effectively allocate and grant credit to their customers. Individual products target specific customer profiles:in this paper we propose a tool to support the multicriteria assessment and classification of the applicants' profile aiming for a good match between the product and the customer. This will look at expanding the firm's customer base with a reduced risk of bad credit.
本文提出了一个团队评估信贷/贷款申请的群体决策模型。随着许多新的参与者进入金融领域,提供新的产品和不同的融资形式,从多个角度评估信贷申请是很重要的,包括营销和风险管理方面。虽然外部机构为潜在申请人提供独立评级和信用报告,但贷款公司需要考虑内部标准,以便有效地为客户分配和授予信贷。单个产品针对特定的客户配置文件:在本文中,我们提出了一个工具,以支持申请人的配置文件的多标准评估和分类,旨在产品和客户之间的良好匹配。这将着眼于在降低不良信用风险的情况下扩大公司的客户群。
{"title":"A Decision Model for Group Assessment of Credit Applications","authors":"N. Karadimas, G. Rigopoulos, A. Orsoni","doi":"10.1109/UKSIM.2008.34","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.34","url":null,"abstract":"This paper proposes a group decision model for the assessment of credit/loan applications by a team. As many new players enter the finance sector, offering new products and different forms of financing, it is important that credit applications are assessed from multiple angles including the marketing and risk management sides. While external organisations offer independent ratings and credit reports of potential applicants, lending firms need to take into account internal criteria in order to effectively allocate and grant credit to their customers. Individual products target specific customer profiles:in this paper we propose a tool to support the multicriteria assessment and classification of the applicants' profile aiming for a good match between the product and the customer. This will look at expanding the firm's customer base with a reduced risk of bad credit.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"8 1","pages":"319-323"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89541061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Quality of Service Routing for Real-Time Applications Using the Analytical Hierarchy Process (Invited Paper) 基于层次分析法的实时应用服务质量路由(特邀论文)
A. Awajan, K. Al-Begain, Paula Thomas
Multimedia and real-time applications applied on the Internet require Quality of Service (QoS) routing algorithms; however, QoS routing is considered an NP-complete problem. This paper proposes an enhanced source based QoS routing algorithm that aims at reducing the complexity of route selection for services with multi QoS metrics. The algorithm uses the Analytic Hierarchy Process to find the best path between the service provider and the client that meets a list of constraints stored in a QoS profile; these constraints are specific for that particular service. Simulation results show that the algorithm finds a path with multiple metrics in scalable time; also the algorithm shows high ability to handle various types of multimedia and real-time applications
互联网上的多媒体和实时应用需要服务质量(QoS)路由算法;然而,QoS路由被认为是一个np完全问题。本文提出了一种增强的基于源的QoS路由算法,旨在降低具有多QoS度量的业务的路由选择复杂性。该算法使用层次分析法寻找服务提供者和客户端之间满足QoS配置文件中存储的约束列表的最佳路径;这些约束是特定于特定服务的。仿真结果表明,该算法在可扩展时间内找到具有多个度量的路径;该算法具有较强的处理各种多媒体和实时应用的能力
{"title":"Quality of Service Routing for Real-Time Applications Using the Analytical Hierarchy Process (Invited Paper)","authors":"A. Awajan, K. Al-Begain, Paula Thomas","doi":"10.1109/UKSIM.2008.98","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.98","url":null,"abstract":"Multimedia and real-time applications applied on the Internet require Quality of Service (QoS) routing algorithms; however, QoS routing is considered an NP-complete problem. This paper proposes an enhanced source based QoS routing algorithm that aims at reducing the complexity of route selection for services with multi QoS metrics. The algorithm uses the Analytic Hierarchy Process to find the best path between the service provider and the client that meets a list of constraints stored in a QoS profile; these constraints are specific for that particular service. Simulation results show that the algorithm finds a path with multiple metrics in scalable time; also the algorithm shows high ability to handle various types of multimedia and real-time applications","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"134 1","pages":"70-75"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86325705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Potentials and Defiances of Mobile Devices and Wireless Networks 移动设备和无线网络的潜力和挑战
J. Sieck
information systems developed at the author’s university. It examines key features of the systems, shows multiple ways of mobile content access and outlines future research potentials.
作者所在大学开发的信息系统。它考察了系统的主要特征,展示了移动内容访问的多种方式,并概述了未来的研究潜力。
{"title":"Potentials and Defiances of Mobile Devices and Wireless Networks","authors":"J. Sieck","doi":"10.1109/UKSIM.2008.109","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.109","url":null,"abstract":"information systems developed at the author’s university. It examines key features of the systems, shows multiple ways of mobile content access and outlines future research potentials.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89150689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
New Predictive Models for COD from All Stages in Full ECF Bleaching Sequences 全ECF漂白序列各阶段COD的新预测模型
Sandeep Jain, G. Mortha, C. Calais
This paper proposes new mathematical models for the prediction of chemical oxygen demand (COD) from different stages in full ECF bleaching sequences and discusses several important issues related to model development and interpretation. The effects of different process conditions, like pH, chemical charge, initial Kappa number, carryover, temperature etc., on the formation of COD from the different chlorine dioxide stages (Do, D1, D2) and extraction stages (E, EO, EP, EOP) were studied and corresponding models were developed for softwood and hardwood pulps. The models, based on results obtained from the extensive studies of the kinetics, stoichiometry, and effluent properties of the chlorine dioxide stages and extraction stages in the ECF bleaching of pulp, were tested for accuracy on a vast range of data both from literature and laboratory experiments. The kinetics, stoichiometry and effluent properties have not previously been considered together for optimization and would be of considerable use in bleach plant optimization as well as in process control of different stages. This study will also help in understanding the need for modifications of the conventional conditions in both the chlorine dioxide and the extraction stages to obtain the best mix between a low formation of COD and high bleaching efficiency.
本文提出了预测全ECF漂白序列中不同阶段化学需氧量(COD)的数学模型,并讨论了与模型开发和解释有关的几个重要问题。研究了不同工艺条件(pH、化学荷量、初始Kappa数、结转量、温度等)对不同二氧化氯阶段(Do、D1、D2)和提取阶段(E、EO、EP、EOP) COD形成的影响,并建立了针叶和硬木纸浆的相应模型。这些模型基于对ECF纸浆漂白过程中二氧化氯阶段和萃取阶段的动力学、化学计量学和流出物特性的广泛研究得出的结果,并在文献和实验室实验的大量数据上进行了准确性测试。动力学、化学计量学和流出物性能以前没有一起考虑过优化,这将在漂白剂厂优化以及不同阶段的过程控制中有相当大的用处。该研究还将有助于了解在二氧化氯和萃取阶段修改常规条件的必要性,以获得低COD形成和高漂白效率之间的最佳组合。
{"title":"New Predictive Models for COD from All Stages in Full ECF Bleaching Sequences","authors":"Sandeep Jain, G. Mortha, C. Calais","doi":"10.1109/UKSIM.2008.8","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.8","url":null,"abstract":"This paper proposes new mathematical models for the prediction of chemical oxygen demand (COD) from different stages in full ECF bleaching sequences and discusses several important issues related to model development and interpretation. The effects of different process conditions, like pH, chemical charge, initial Kappa number, carryover, temperature etc., on the formation of COD from the different chlorine dioxide stages (Do, D1, D2) and extraction stages (E, EO, EP, EOP) were studied and corresponding models were developed for softwood and hardwood pulps. The models, based on results obtained from the extensive studies of the kinetics, stoichiometry, and effluent properties of the chlorine dioxide stages and extraction stages in the ECF bleaching of pulp, were tested for accuracy on a vast range of data both from literature and laboratory experiments. The kinetics, stoichiometry and effluent properties have not previously been considered together for optimization and would be of considerable use in bleach plant optimization as well as in process control of different stages. This study will also help in understanding the need for modifications of the conventional conditions in both the chlorine dioxide and the extraction stages to obtain the best mix between a low formation of COD and high bleaching efficiency.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"1 1","pages":"278-283"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89158344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A Meta-Model Based Approach to UML Modelling 基于元模型的UML建模方法
A. Teilans, A. Kleins, Uldis Sukovskis, Y. Merkuryev, Ivars Meirans
This paper is devoted to a meta-model based approach to UML systems modelling. The approach allows creating a system model by operating with artefacts from the problem domain, followed by generation of a UML model. The discussed approach is illustrated by generating UML models, using Use Case and Activity diagrams of the UML language.
本文致力于一种基于元模型的UML系统建模方法。该方法允许通过操作来自问题域的工件来创建系统模型,然后生成UML模型。所讨论的方法是通过使用UML语言的用例和活动图生成UML模型来说明的。
{"title":"A Meta-Model Based Approach to UML Modelling","authors":"A. Teilans, A. Kleins, Uldis Sukovskis, Y. Merkuryev, Ivars Meirans","doi":"10.1109/UKSIM.2008.60","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.60","url":null,"abstract":"This paper is devoted to a meta-model based approach to UML systems modelling. The approach allows creating a system model by operating with artefacts from the problem domain, followed by generation of a UML model. The discussed approach is illustrated by generating UML models, using Use Case and Activity diagrams of the UML language.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"44 1","pages":"667-672"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76033918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Behavior of Evolutionary Many-Objective Optimization 进化多目标优化行为
H. Ishibuchi, Noritaka Tsukamoto, Y. Nojima
Evolutionary multiobjective optimization (EMO) is one of the most active research areas in the field of evolutionary computation. Whereas EMO algorithms have been successfully used in various application tasks, it has also been reported that they do not work well on many-objective problems. In this paper, first we examine the behavior of the most well-known and frequently-used EMO algorithm on many-objective 0/1 knapsack problems. Next we briefly review recent proposals for the scalability improvement of EMO algorithms to many-objective problems. Then their effects on the search ability of EMO algorithms are examined. Experimental results show that the increase in the convergence of solutions to the Pareto front often leads to the decrease in their diversity. Based on this observation, we suggest future research directions in evolutionary many-objective optimization.
进化多目标优化(EMO)是进化计算领域中最活跃的研究方向之一。尽管EMO算法已经成功地应用于各种应用任务,但也有报道称它们在许多客观问题上工作得并不好。在本文中,我们首先研究了最著名和最常用的EMO算法在多目标0/1背包问题上的行为。接下来,我们简要回顾了EMO算法在多目标问题上的可扩展性改进的最新建议。然后研究了它们对EMO算法搜索能力的影响。实验结果表明,Pareto前沿解收敛性的增加往往导致其多样性的降低。在此基础上,提出了进化多目标优化的未来研究方向。
{"title":"Behavior of Evolutionary Many-Objective Optimization","authors":"H. Ishibuchi, Noritaka Tsukamoto, Y. Nojima","doi":"10.1109/UKSIM.2008.13","DOIUrl":"https://doi.org/10.1109/UKSIM.2008.13","url":null,"abstract":"Evolutionary multiobjective optimization (EMO) is one of the most active research areas in the field of evolutionary computation. Whereas EMO algorithms have been successfully used in various application tasks, it has also been reported that they do not work well on many-objective problems. In this paper, first we examine the behavior of the most well-known and frequently-used EMO algorithm on many-objective 0/1 knapsack problems. Next we briefly review recent proposals for the scalability improvement of EMO algorithms to many-objective problems. Then their effects on the search ability of EMO algorithms are examined. Experimental results show that the increase in the convergence of solutions to the Pareto front often leads to the decrease in their diversity. Based on this observation, we suggest future research directions in evolutionary many-objective optimization.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"131 1","pages":"266-271"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88351216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
期刊
Tenth International Conference on Computer Modeling and Simulation (uksim 2008)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1