首页 > 最新文献

International Journal of Computational Intelligence and Applications最新文献

英文 中文
Combining Neural Networks with Logic Rules 神经网络与逻辑规则的结合
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-03-27 DOI: 10.1142/s1469026823500153
Lujiang Zhang
How to utilize symbolic knowledge in deep learning is an important problem. Deep neural networks are flexible and powerful, while symbolic knowledge has the virtue of interpretability and intuitiveness. It is necessary to combine the two together to inject symbolic knowledge into neural networks. We propose a novel approach to combine neural networks with logic rules. In this approach, task-specific supervised learning and policy-based reinforcement learning are performed alternately to train a neural model until convergence. The basic idea is to use supervised learning to train a deep model and use reinforcement learning to propel the deep model to meet logic rules. In the process of the policy gradient reinforcement learning, if a predicted output of a deep model meets all logical rules, the deep model is given a positive reward, otherwise, it is given a negative reward. By maximizing the expected rewards, the deep model can be gradually adjusted to meet logical constraints. We conduct experiments on the tasks of named entity recognition. The experimental results demonstrate the effectiveness of our method.
如何在深度学习中利用符号知识是一个重要的问题。深度神经网络是灵活而强大的,而符号知识具有可解释性和直观性的优点。有必要将两者结合起来,为神经网络注入符号知识。我们提出了一种将神经网络与逻辑规则相结合的新方法。在这种方法中,任务特定的监督学习和基于策略的强化学习交替执行,以训练神经模型直到收敛。其基本思想是使用监督学习来训练深度模型,并使用强化学习来推动深度模型满足逻辑规则。在策略梯度强化学习过程中,如果深度模型的预测输出满足所有逻辑规则,则给予深度模型正奖励,否则给予负奖励。通过最大化预期回报,可以逐步调整深度模型以满足逻辑约束。我们对命名实体识别的任务进行了实验。实验结果证明了我们方法的有效性。
{"title":"Combining Neural Networks with Logic Rules","authors":"Lujiang Zhang","doi":"10.1142/s1469026823500153","DOIUrl":"https://doi.org/10.1142/s1469026823500153","url":null,"abstract":"How to utilize symbolic knowledge in deep learning is an important problem. Deep neural networks are flexible and powerful, while symbolic knowledge has the virtue of interpretability and intuitiveness. It is necessary to combine the two together to inject symbolic knowledge into neural networks. We propose a novel approach to combine neural networks with logic rules. In this approach, task-specific supervised learning and policy-based reinforcement learning are performed alternately to train a neural model until convergence. The basic idea is to use supervised learning to train a deep model and use reinforcement learning to propel the deep model to meet logic rules. In the process of the policy gradient reinforcement learning, if a predicted output of a deep model meets all logical rules, the deep model is given a positive reward, otherwise, it is given a negative reward. By maximizing the expected rewards, the deep model can be gradually adjusted to meet logical constraints. We conduct experiments on the tasks of named entity recognition. The experimental results demonstrate the effectiveness of our method.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":" ","pages":""},"PeriodicalIF":1.8,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44257933","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
Instrument Identification Technology Based on Deep Learning 基于深度学习的仪器识别技术
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2021-08-12 DOI: 10.1142/s1469026821500176
Yunhai Song, Zhenzhen Zhou, Hourong Zhang, Haohui Su, Han Zhang, Qi Wang
With the continuous improvement of science and technology, the substation remote control system has been constantly improved, which provides the possibility for the complete realization of intelligent and unmanned substation. However, due to the special substation environment, it is easy to cause interference, coupled with the low accuracy of today’s video image processing algorithm, which leads to the frequent occurrence of false alarms and missing alarms. Manual intervention is needed to deal with this, which inhibits the display of automatic intelligent substation processing functions. Therefore, in this paper, the most rapidly developed machine learning algorithm — deep learning is applied to the substation instrument equipment identification processing, in order to improve the accuracy and efficiency of instrument equipment identification, and make due contributions to the full realization of unattended substation.
随着科学技术的不断进步,变电站远程控制系统不断完善,为变电站智能化、无人化的完全实现提供了可能。但是,由于变电站的特殊环境,容易造成干扰,再加上目前视频图像处理算法的精度较低,导致误报和漏报的情况频繁发生。这需要人工干预来处理,这抑制了自动化智能变电站处理功能的显示。因此,本文将目前发展最快的机器学习算法——深度学习应用于变电站仪表设备的识别处理,以期提高仪表设备识别的准确性和效率,为全面实现变电站无人值看守做出应有的贡献。
{"title":"Instrument Identification Technology Based on Deep Learning","authors":"Yunhai Song, Zhenzhen Zhou, Hourong Zhang, Haohui Su, Han Zhang, Qi Wang","doi":"10.1142/s1469026821500176","DOIUrl":"https://doi.org/10.1142/s1469026821500176","url":null,"abstract":"With the continuous improvement of science and technology, the substation remote control system has been constantly improved, which provides the possibility for the complete realization of intelligent and unmanned substation. However, due to the special substation environment, it is easy to cause interference, coupled with the low accuracy of today’s video image processing algorithm, which leads to the frequent occurrence of false alarms and missing alarms. Manual intervention is needed to deal with this, which inhibits the display of automatic intelligent substation processing functions. Therefore, in this paper, the most rapidly developed machine learning algorithm — deep learning is applied to the substation instrument equipment identification processing, in order to improve the accuracy and efficiency of instrument equipment identification, and make due contributions to the full realization of unattended substation.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"20 1","pages":"2150017:1-2150017:13"},"PeriodicalIF":1.8,"publicationDate":"2021-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64014566","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
An Efficient Classification Algorithm Based on T-Cells Maturation with No Parameters 基于无参数t细胞成熟的高效分类算法
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2017-12-17 DOI: 10.1142/S1469026817500249
Chen Jungan, Chen Jinyin, Yang Dongyong
In artificial immune system, many algorithms based on negative selection methods have been proposed to achieve satisfying classification performances. However, there are still many problems required to be solved, such as parameters sensibility and computational complexity. In this paper, a novel classification algorithm based on T-cells maturation algorithm was proposed for anomaly detection. Data set from UC Irvine Machine Learning Repository was used for 10-fold cross-validation, and simulation results confirmed its similar performances with AIRS. Compared with other classification algorithms based on negative selection methods, the proposed algorithm has no parameters and lower complexity, and can achieve satisfying classification results.
在人工免疫系统中,人们提出了许多基于负选择方法的算法来获得令人满意的分类性能。但是,在参数敏感性和计算复杂度等方面仍有许多问题需要解决。本文提出了一种基于t细胞成熟算法的异常检测分类算法。使用来自UC Irvine机器学习存储库的数据集进行10倍交叉验证,仿真结果证实了其与AIRS的相似性能。与其他基于负选择方法的分类算法相比,该算法不需要参数,且复杂度较低,可以获得令人满意的分类结果。
{"title":"An Efficient Classification Algorithm Based on T-Cells Maturation with No Parameters","authors":"Chen Jungan, Chen Jinyin, Yang Dongyong","doi":"10.1142/S1469026817500249","DOIUrl":"https://doi.org/10.1142/S1469026817500249","url":null,"abstract":"In artificial immune system, many algorithms based on negative selection methods have been proposed to achieve satisfying classification performances. However, there are still many problems required to be solved, such as parameters sensibility and computational complexity. In this paper, a novel classification algorithm based on T-cells maturation algorithm was proposed for anomaly detection. Data set from UC Irvine Machine Learning Repository was used for 10-fold cross-validation, and simulation results confirmed its similar performances with AIRS. Compared with other classification algorithms based on negative selection methods, the proposed algorithm has no parameters and lower complexity, and can achieve satisfying classification results.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"65 1","pages":"1750024"},"PeriodicalIF":1.8,"publicationDate":"2017-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76520601","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
A New Stochastic Optimization Approach: Dolphin Swarm Optimization Algorithm 一种新的随机优化方法:海豚群优化算法
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2016-06-20 DOI: 10.1142/S1469026816500115
Wang Yong, Wang Tao, Zhang Cheng-zhi, Huang Hua-Juan
A novel nature-inspired swarm intelligence (SI) optimization is proposed called dolphin swarm optimization algorithm (DSOA), which is based on mimicking the mechanism of dolphins in detecting, chasing after, and preying on swarms of sardines to perform optimization. In order to test the performance, the DSOA is evaluated against the corresponding results of three existing well-known SI optimization algorithms, namely, particle swarm optimization (PSO), bat algorithm (BA), and artificial bee colony (ABC), in the terms of the ability to find the global optimum of a range of the popular benchmark functions. The experimental results show that the proposed optimization seems superior to the other three algorithms, and the proposed algorithm has the performance of fast convergence rate, and high local optimal avoidance.
提出了一种新型的基于自然启发的群体智能优化算法——海豚群优化算法(DSOA),该算法基于模拟海豚对沙丁鱼群的探测、追逐和捕食机制进行优化。为了测试DSOA的性能,根据现有三种知名的SI优化算法(即粒子群优化算法(PSO)、蝙蝠算法(BA)和人工蜂群算法(ABC)的相应结果,对DSOA进行了评估,以找到一系列流行基准函数的全局最优能力。实验结果表明,该算法优于其他三种算法,具有收敛速度快、局部最优避免率高的特点。
{"title":"A New Stochastic Optimization Approach: Dolphin Swarm Optimization Algorithm","authors":"Wang Yong, Wang Tao, Zhang Cheng-zhi, Huang Hua-Juan","doi":"10.1142/S1469026816500115","DOIUrl":"https://doi.org/10.1142/S1469026816500115","url":null,"abstract":"A novel nature-inspired swarm intelligence (SI) optimization is proposed called dolphin swarm optimization algorithm (DSOA), which is based on mimicking the mechanism of dolphins in detecting, chasing after, and preying on swarms of sardines to perform optimization. In order to test the performance, the DSOA is evaluated against the corresponding results of three existing well-known SI optimization algorithms, namely, particle swarm optimization (PSO), bat algorithm (BA), and artificial bee colony (ABC), in the terms of the ability to find the global optimum of a range of the popular benchmark functions. The experimental results show that the proposed optimization seems superior to the other three algorithms, and the proposed algorithm has the performance of fast convergence rate, and high local optimal avoidance.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"15 1","pages":"1650011"},"PeriodicalIF":1.8,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S1469026816500115","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64014167","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}
引用次数: 16
EFFICIENT DNA MOTIF DISCOVERY USING MODIFIED GENETIC ALGORITHM 基于改进遗传算法的高效DNA基序发现
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2013-09-24 DOI: 10.1142/S146902681350017X
E. A. Daoud
In this study, a new genetic algorithm was developed to discover the best motifs in a set of DNA sequences. The main steps were: finding the potential positions in each sequence by using few voters (1–5 sequences), constructing the chromosomes from the potential positions, evaluating the fitness for each gene (position) and for each chromosome, calculating the new random distribution, and using the new distribution to generate the next generation. To verify the effectiveness of the proposed algorithm, several real and artificial datasets were used; the results are compared to the standard genetic algorithm, and Gibbs, MEME, and consensus algorithms. Although all the algorithms have low correlation with the correct motifs, the new algorithm exhibits higher accuracy, without sacrificing implementation time.
在这项研究中,开发了一种新的遗传算法来发现一组DNA序列中的最佳基序。主要步骤是:利用少量投票点(1-5个序列)找到每个序列的潜在位置,从潜在位置构建染色体,评估每个基因(位置)和每个染色体的适合度,计算新的随机分布,并使用新的分布产生下一代。为了验证该算法的有效性,使用了多个真实数据集和人工数据集;将结果与标准遗传算法、Gibbs算法、MEME算法和共识算法进行比较。虽然所有算法与正确基序的相关性都很低,但新算法在不牺牲实现时间的情况下具有更高的精度。
{"title":"EFFICIENT DNA MOTIF DISCOVERY USING MODIFIED GENETIC ALGORITHM","authors":"E. A. Daoud","doi":"10.1142/S146902681350017X","DOIUrl":"https://doi.org/10.1142/S146902681350017X","url":null,"abstract":"In this study, a new genetic algorithm was developed to discover the best motifs in a set of DNA sequences. The main steps were: finding the potential positions in each sequence by using few voters (1–5 sequences), constructing the chromosomes from the potential positions, evaluating the fitness for each gene (position) and for each chromosome, calculating the new random distribution, and using the new distribution to generate the next generation. To verify the effectiveness of the proposed algorithm, several real and artificial datasets were used; the results are compared to the standard genetic algorithm, and Gibbs, MEME, and consensus algorithms. Although all the algorithms have low correlation with the correct motifs, the new algorithm exhibits higher accuracy, without sacrificing implementation time.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"12 1","pages":"1350017"},"PeriodicalIF":1.8,"publicationDate":"2013-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S146902681350017X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64014113","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}
引用次数: 2
Combining Statistical and Geometric Features for Colonic Polyp Detection in CTC Based on Multiple Kernel Learning. 基于多核学习的CTC结肠息肉检测中统计特征与几何特征的结合。
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2010-01-01 DOI: 10.1142/S1469026810002744
Shijun Wang, Jianhua Yao, Nicholas Petrick, Ronald M Summers

Colon cancer is the second leading cause of cancer-related deaths in the United States. Computed tomographic colonography (CTC) combined with a computer aided detection system provides a feasible approach for improving colonic polyps detection and increasing the use of CTC for colon cancer screening. To distinguish true polyps from false positives, various features extracted from polyp candidates have been proposed. Most of these traditional features try to capture the shape information of polyp candidates or neighborhood knowledge about the surrounding structures (fold, colon wall, etc.). In this paper, we propose a new set of shape descriptors for polyp candidates based on statistical curvature information. These features called histograms of curvature features are rotation, translation and scale invariant and can be treated as complementing existing feature set. Then in order to make full use of the traditional geometric features (defined as group A) and the new statistical features (group B) which are highly heterogeneous, we employed a multiple kernel learning method based on semi-definite programming to learn an optimized classification kernel from the two groups of features. We conducted leave-one-patient-out test on a CTC dataset which contained scans from 66 patients. Experimental results show that a support vector machine (SVM) based on the combined feature set and the semi-definite optimization kernel achieved higher FROC performance compared to SVMs using the two groups of features separately. At a false positive per scan rate of 5, the sensitivity of the SVM using the combined features improved from 0.77 (Group A) and 0.73 (Group B) to 0.83 (p ≤ 0.01).

结肠癌是美国癌症相关死亡的第二大原因。计算机断层结肠镜(CTC)联合计算机辅助检测系统为提高结肠息肉的检出率和增加CTC在结肠癌筛查中的应用提供了可行的途径。为了区分真息肉和假阳性,从候选息肉中提取了各种特征。这些传统特征大多试图捕获息肉候选物的形状信息或周围结构(褶皱、结肠壁等)的邻域知识。在本文中,我们提出了一套新的基于统计曲率信息的息肉候选形状描述符。这些特征称为曲率直方图特征,具有旋转、平移和尺度不变性,可以作为现有特征集的补充。然后,为了充分利用传统的几何特征(定义为A组)和新的高度异构的统计特征(B组),我们采用基于半确定规划的多核学习方法,从两组特征中学习一个优化的分类核。我们对包含66名患者扫描的CTC数据集进行了留一名患者的测试。实验结果表明,与单独使用两组特征的支持向量机相比,基于组合特征集和半确定优化核的支持向量机(SVM)具有更高的FROC性能。在每次扫描假阳性率为5时,使用组合特征的支持向量机的灵敏度从0.77 (a组)和0.73 (B组)提高到0.83 (p≤0.01)。
{"title":"Combining Statistical and Geometric Features for Colonic Polyp Detection in CTC Based on Multiple Kernel Learning.","authors":"Shijun Wang,&nbsp;Jianhua Yao,&nbsp;Nicholas Petrick,&nbsp;Ronald M Summers","doi":"10.1142/S1469026810002744","DOIUrl":"https://doi.org/10.1142/S1469026810002744","url":null,"abstract":"<p><p>Colon cancer is the second leading cause of cancer-related deaths in the United States. Computed tomographic colonography (CTC) combined with a computer aided detection system provides a feasible approach for improving colonic polyps detection and increasing the use of CTC for colon cancer screening. To distinguish true polyps from false positives, various features extracted from polyp candidates have been proposed. Most of these traditional features try to capture the shape information of polyp candidates or neighborhood knowledge about the surrounding structures (fold, colon wall, etc.). In this paper, we propose a new set of shape descriptors for polyp candidates based on statistical curvature information. These features called histograms of curvature features are rotation, translation and scale invariant and can be treated as complementing existing feature set. Then in order to make full use of the traditional geometric features (defined as group A) and the new statistical features (group B) which are highly heterogeneous, we employed a multiple kernel learning method based on semi-definite programming to learn an optimized classification kernel from the two groups of features. We conducted leave-one-patient-out test on a CTC dataset which contained scans from 66 patients. Experimental results show that a support vector machine (SVM) based on the combined feature set and the semi-definite optimization kernel achieved higher FROC performance compared to SVMs using the two groups of features separately. At a false positive per scan rate of 5, the sensitivity of the SVM using the combined features improved from 0.77 (Group A) and 0.73 (Group B) to 0.83 (p ≤ 0.01).</p>","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"9 1","pages":"1-15"},"PeriodicalIF":1.8,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S1469026810002744","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"29359860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
REALIZATION PROBLEM FOR POSITIVE CONTINUOUS-TIME SYSTEMS WITH DELAYS 具有时滞的正连续系统的实现问题
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2006-06-01 DOI: 10.1142/S1469026806002003
Kaczorek Tadeusz
The realization problem for positive, continuous-time linear single-input, single-output systems with delays is formulated and solved. Sufficient conditions for the existence of positive realizations of a given proper transfer function are established. A procedure for computation of positive minimal realizations is presented and illustrated by an example.
提出并求解了具有时滞的正连续线性单输入单输出系统的实现问题。给出了给定固有传递函数正实现存在的充分条件。给出了正最小实现的计算方法,并通过实例进行了说明。
{"title":"REALIZATION PROBLEM FOR POSITIVE CONTINUOUS-TIME SYSTEMS WITH DELAYS","authors":"Kaczorek Tadeusz","doi":"10.1142/S1469026806002003","DOIUrl":"https://doi.org/10.1142/S1469026806002003","url":null,"abstract":"The realization problem for positive, continuous-time linear single-input, single-output systems with delays is formulated and solved. Sufficient conditions for the existence of positive realizations of a given proper transfer function are established. A procedure for computation of positive minimal realizations is presented and illustrated by an example.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"06 1","pages":"289-298"},"PeriodicalIF":1.8,"publicationDate":"2006-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S1469026806002003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64014100","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}
引用次数: 10
A NOVEL MECHANISM BASED ON ARTIFICIAL LOGICAL SPIDER WEB FOR REROUTING IN MPLS NETWORKS 一种基于人工逻辑蜘蛛网的MPLS网络重路由机制
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2005-06-01 DOI: 10.1142/S1469026805001520
Xinyu Yang, Yi Shi
Multiprotocol label switching (MPLS) is a hybrid solution that combines the advantages of easy forwarding with the ability of guaranteeing quality-of-service (QoS). To deliver reliable service, MPLS requires traffic protection and recovery. Rerouting is one such recovery mechanism. In this paper, we propose a novel rerouting model called DDRAAS that is inspired by the spider and its web in nature. We try to establish an artificial logical spider web in the MPLS network to reorganise it into a structure that is more regular and simple. Based on this, we give the definition of the reroute area. Artificial spiders are then used to explore recovery paths dynamically in the reroute area. DDRAAS can be used to calculate the recovery paths in advance in order to protect the work path, while the improved DDRAAS can be a fast rerouting algorithm to calculate and establish recovery paths when faults occur. We have simulated our mechanism using the MPLS network simulator (MNS) and the performance metrics were compared to those of other proposals. The simulation results show that our mechanism is better in reducing packet loss, disorder and has faster rerouting speed. These improvements help to minimise the effects of link failure and/or congestion.
MPLS (Multiprotocol label switching,多协议标签交换)是一种混合解决方案,它将易于转发的优点与保证服务质量(QoS)的能力相结合。为了提供可靠的业务,MPLS需要对流量进行保护和恢复。重路由就是这样一种恢复机制。在本文中,我们提出了一种新的重路由模型,称为DDRAAS,它的灵感来自于蜘蛛和它的网。我们尝试在MPLS网络中建立一个人工的逻辑蜘蛛网,将其重新组织成一个更加规则和简单的结构。在此基础上,给出了改道区域的定义。然后使用人工蜘蛛在重路由区域动态探索恢复路径。DDRAAS可以提前计算恢复路径,以保护工作路径;改进后的DDRAAS可以作为快速重路由算法,在故障发生时计算并建立恢复路径。我们使用MPLS网络模拟器(MNS)模拟了我们的机制,并将性能指标与其他建议进行了比较。仿真结果表明,该机制在减少丢包和混乱方面有较好的效果,并且具有较快的重路由速度。这些改进有助于最小化链路故障和/或拥塞的影响。
{"title":"A NOVEL MECHANISM BASED ON ARTIFICIAL LOGICAL SPIDER WEB FOR REROUTING IN MPLS NETWORKS","authors":"Xinyu Yang, Yi Shi","doi":"10.1142/S1469026805001520","DOIUrl":"https://doi.org/10.1142/S1469026805001520","url":null,"abstract":"Multiprotocol label switching (MPLS) is a hybrid solution that combines the advantages of easy forwarding with the ability of guaranteeing quality-of-service (QoS). To deliver reliable service, MPLS requires traffic protection and recovery. Rerouting is one such recovery mechanism. In this paper, we propose a novel rerouting model called DDRAAS that is inspired by the spider and its web in nature. We try to establish an artificial logical spider web in the MPLS network to reorganise it into a structure that is more regular and simple. Based on this, we give the definition of the reroute area. Artificial spiders are then used to explore recovery paths dynamically in the reroute area. DDRAAS can be used to calculate the recovery paths in advance in order to protect the work path, while the improved DDRAAS can be a fast rerouting algorithm to calculate and establish recovery paths when faults occur. We have simulated our mechanism using the MPLS network simulator (MNS) and the performance metrics were compared to those of other proposals. The simulation results show that our mechanism is better in reducing packet loss, disorder and has faster rerouting speed. These improvements help to minimise the effects of link failure and/or congestion.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"05 1","pages":"119-139"},"PeriodicalIF":1.8,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S1469026805001520","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64014045","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
Book Review: "Biorobotics: Methods and Applications", Barbara Webb and Thomas R. Consi 书评:《生物机器人:方法与应用》,芭芭拉·韦伯和托马斯·康西著
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2003-09-01 DOI: 10.1142/S1469026803000951
P. Chandana
{"title":"Book Review: \"Biorobotics: Methods and Applications\", Barbara Webb and Thomas R. Consi","authors":"P. Chandana","doi":"10.1142/S1469026803000951","DOIUrl":"https://doi.org/10.1142/S1469026803000951","url":null,"abstract":"","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"03 1","pages":"309-310"},"PeriodicalIF":1.8,"publicationDate":"2003-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S1469026803000951","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64014036","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
BOOK REVIEW: "SWARM INTELLIGENCE," J. KENNEDY, R. C. EBERHART and Y. SHI 书评:《群体智慧》,J. KENNEDY, R. C. EBERHART, Y. SHI
IF 1.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2003-03-01 DOI: 10.1142/S1469026803000513
A. T. Hayes
{"title":"BOOK REVIEW: \"SWARM INTELLIGENCE,\" J. KENNEDY, R. C. EBERHART and Y. SHI","authors":"A. T. Hayes","doi":"10.1142/S1469026803000513","DOIUrl":"https://doi.org/10.1142/S1469026803000513","url":null,"abstract":"","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":"13 1","pages":"135-139"},"PeriodicalIF":1.8,"publicationDate":"2003-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1142/S1469026803000513","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64013707","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
期刊
International Journal of Computational Intelligence and Applications
全部 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