Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to id...Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network. Based on two-tree Dijkstra and Priority＇First-Search （PFS） algorithm, a modified algorithm is presented. To apply the algorithm, a network representation transformation is made first.展开更多
This paper is devoted to find an intelligent and safe path for two-link robotic arm in dynamic environment. This paper focuses on computational part of motion planning in completely changing dynamic environment at eve...This paper is devoted to find an intelligent and safe path for two-link robotic arm in dynamic environment. This paper focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains,?since the local minima and sharp edges are the most common problems in all path planning algorithms. In addition, finding a path solution in a dynamic environment represents a challenge for the robotics researchers,?so in this paper, a proposed mixing approach was suggested to overcome all these obstructions. The proposed approach methodology?for obtaining robot interactive path planning solution in known dynamic environment utilizes?the use of modified heuristic D-star (D*) algorithm based on the full free Cartesian space analysis at each motion sample with the Particle Swarm Optimization (PSO) technique.?Also, a modification on the?D* algorithm has been done to match the dynamic environment requirements by adding stop and return backward cases which is not included in the original D* algorithm theory. The resultant interactive path solution was computed by taking into consideration the time and position changes of the moving obstacles. Furthermore, to insure the enhancement of the?final path length optimality, the PSO technique was used.?The simulation results are given to show the effectiveness of the proposed method.展开更多
Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domai...Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional Domain-to-the-Node (DtN) scheme.展开更多
Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-si...Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-similarity measures. Among these measures, the common neighbour index, the resource allocation index, and the local path index, stemming from different source, have been proved to have relatively high accuracy and low computational effort. In this paper, we propose a similarity index by combining the resource allocation index and the local path index. Simulation results on six unweighted networks show that the accuracy of the proposed index is higher than that of the local path one. Based on the same idea of the present index, we develop its corresponding weighted version and test it on several weighted networks. It is found that, except for the USAir network, the weighted variant also performs better than both the weighted resource allocation index and the weighted local path index. Due to the improved accuracy and the still low computational complexity, the indices may be useful for link prediction.展开更多
In conventional shared risk link group （SRLG）-diverse path selection （CSPS） algorithm in survivable GMPLS networks, SRLG is taken into account when selecting the backup paths, while the primary path selection meth...In conventional shared risk link group （SRLG）-diverse path selection （CSPS） algorithm in survivable GMPLS networks, SRLG is taken into account when selecting the backup paths, while the primary path selection method is the sarne as the algorithms without SRLG constraint. A problem of CSPS algorithm is that, after a primary path is selected, the success probability to select an SRLG-diverse backup path for it is low. If SRLG is taken into account when computing the primary path, then the probability to successfully select an SRLG-diverse backup path will be much increased. Based on this idea, an active SRLG-diverse path selection （ASPS） algorithm is proposed. To actively avoid selecting those SRLG links, when computing the primary path, a link that share risk with more links is assigned a larger link cost. To improve the resource utilization ratio, it is permitted that the bandwidth resources are shared among backup paths. What is more, differentiated reliability （DiR） requirements of different customers are considered in ASPS algorithm. The simulation results show that, compared with CSPS algorithm, ASPS algorithm not only increases successful protection probability but also improves resource utilization ratio.展开更多
目的分析合成生物学领域的主路径。方法以“合成生物学”为主题词在Web of Science平台德温特专利数据库(DII)进行精准检索,得到专利数据集;构建专利引文网络,采用搜索路径连接数(SPLC)算法计算遍历权重,选择5种路径搜索方式,提取主路径...目的分析合成生物学领域的主路径。方法以“合成生物学”为主题词在Web of Science平台德温特专利数据库(DII)进行精准检索,得到专利数据集;构建专利引文网络,采用搜索路径连接数(SPLC)算法计算遍历权重,选择5种路径搜索方式,提取主路径,识别合成生物学技术创新热点。结果截至2023年6月5日,合成生物学领域共有专利申请432项,包含专利引文4987件。1992年至2021年,专利申请数量呈增长趋势,预计2025年和2030年专利申请数量将分别达到113项和216项;技术创新聚焦于基因合成及基因编辑相关研究。合成生物学领域局部后向主路径与全局主路径一致,识别出的专利数量最多,有14件,包含6条技术路线;局部前向主路径与全局关键路径主路径上的专利完全相同,仅技术轨迹有差异,识别出13件专利;局部前向主路径的技术路线最多,有12条。基于主路径分析,合成生物学领域技术创新主要聚焦于脂质体、样本处理方法、水凝胶、液滴网络等技术,高价值专利技术聚焦于生物打印、液滴封装、水凝胶网络等技术。结论主路径分析可识别技术发展轨迹及高价值专利,从情报学角度为合成生物学研究提供了信息支撑。展开更多
Line-of-sight (LOS) link planning condition has been observed to have effects on the atmospheric factor which cause crucial signal loss. The main objective of the planning was to improve a set of a link using point to...Line-of-sight (LOS) link planning condition has been observed to have effects on the atmospheric factor which cause crucial signal loss. The main objective of the planning was to improve a set of a link using point to point condition to assist the performance in emerging its strategy for handling the fixed WLAN service. The purpose of this paper is to provide a quick description of various propagation loss mechanisms on Link Budget Tool (LBT). LBT is customized to create point to point link for local area network (LAN) through radio frequency range operating between 2.400 GHz and 5.800 GHz. This software is able to define the effect of signal loss and expected performances according to the distances between link propagation conditions based on a number of system parameters.展开更多
基金Supported bythe National Tenth Five-Year PlanforScientific and Technological Development of China (2001BA102A06-11)
文摘Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network. Based on two-tree Dijkstra and Priority＇First-Search （PFS） algorithm, a modified algorithm is presented. To apply the algorithm, a network representation transformation is made first.
文摘This paper is devoted to find an intelligent and safe path for two-link robotic arm in dynamic environment. This paper focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains,?since the local minima and sharp edges are the most common problems in all path planning algorithms. In addition, finding a path solution in a dynamic environment represents a challenge for the robotics researchers,?so in this paper, a proposed mixing approach was suggested to overcome all these obstructions. The proposed approach methodology?for obtaining robot interactive path planning solution in known dynamic environment utilizes?the use of modified heuristic D-star (D*) algorithm based on the full free Cartesian space analysis at each motion sample with the Particle Swarm Optimization (PSO) technique.?Also, a modification on the?D* algorithm has been done to match the dynamic environment requirements by adding stop and return backward cases which is not included in the original D* algorithm theory. The resultant interactive path solution was computed by taking into consideration the time and position changes of the moving obstacles. Furthermore, to insure the enhancement of the?final path length optimality, the PSO technique was used.?The simulation results are given to show the effectiveness of the proposed method.
基金Acknowledgements This work was supported by Chang Jiang Scholars Program of the Ministry of Education of China, National Science Fund for Distinguished Young Scholars under Grant No.60725104 the National Basic Research Program of China under Grant No. 2007CB310706+2 种基金 the National Natural Science Foundation of China under Ca＇ant No. 60932002, No. 60932005, No. 61071101 the Hi-Tech Research and Development Program of China under Grant No. 2009AA01Z254, No. 2009AA01Z215 NCEF Program of MoE of China, and Sichuan Youth Science and Technology Foundation under Crant No. 09ZQ026-032.
文摘Inter-domain path computing is one big issue in multi-domain networks. The Hierarchical Path Computing Element (H-PCE) is a semi-central architecture for computing inter-domain path. To facilitate H-PCE in inter-domain path computing, this paper proposed a topology aggregation scheme to abstract the edge nodes and their connected inter-domain link as one vertex to achieve more optimal paths and confidentiality guarantee. The effectiveness of the scheme has been demonstrated on solving wavelength routing in multi-domain Wavelength Division Multiplexing (WDM) network via simulation. Simulation results show that this scheme reduces at least 10% inter-domain blocking probability, compared with the traditional Domain-to-the-Node (DtN) scheme.
基金Project supported by the National Natural Science Foundation of China (Grant No. 30570432)the Young Research Foundation of Education Department of Hunan Province of China (Grant No. 11B128)partly by the Doctor Startup Project of Xiangtan University (Grant No. 10QDZ20)
文摘Missing link prediction provides significant instruction for both analysis of network structure and mining of unknown links in incomplete networks. Recently, many algorithms have been proposed based on various node-similarity measures. Among these measures, the common neighbour index, the resource allocation index, and the local path index, stemming from different source, have been proved to have relatively high accuracy and low computational effort. In this paper, we propose a similarity index by combining the resource allocation index and the local path index. Simulation results on six unweighted networks show that the accuracy of the proposed index is higher than that of the local path one. Based on the same idea of the present index, we develop its corresponding weighted version and test it on several weighted networks. It is found that, except for the USAir network, the weighted variant also performs better than both the weighted resource allocation index and the weighted local path index. Due to the improved accuracy and the still low computational complexity, the indices may be useful for link prediction.
基金supported by the National Natural Science Foundation of China (60673142)Applied Basic ResearchProject of Sichuan Province (2006J13-067).
文摘In conventional shared risk link group （SRLG）-diverse path selection （CSPS） algorithm in survivable GMPLS networks, SRLG is taken into account when selecting the backup paths, while the primary path selection method is the sarne as the algorithms without SRLG constraint. A problem of CSPS algorithm is that, after a primary path is selected, the success probability to select an SRLG-diverse backup path for it is low. If SRLG is taken into account when computing the primary path, then the probability to successfully select an SRLG-diverse backup path will be much increased. Based on this idea, an active SRLG-diverse path selection （ASPS） algorithm is proposed. To actively avoid selecting those SRLG links, when computing the primary path, a link that share risk with more links is assigned a larger link cost. To improve the resource utilization ratio, it is permitted that the bandwidth resources are shared among backup paths. What is more, differentiated reliability （DiR） requirements of different customers are considered in ASPS algorithm. The simulation results show that, compared with CSPS algorithm, ASPS algorithm not only increases successful protection probability but also improves resource utilization ratio.
文摘目的分析合成生物学领域的主路径。方法以“合成生物学”为主题词在Web of Science平台德温特专利数据库(DII)进行精准检索,得到专利数据集;构建专利引文网络,采用搜索路径连接数(SPLC)算法计算遍历权重,选择5种路径搜索方式,提取主路径,识别合成生物学技术创新热点。结果截至2023年6月5日,合成生物学领域共有专利申请432项,包含专利引文4987件。1992年至2021年,专利申请数量呈增长趋势,预计2025年和2030年专利申请数量将分别达到113项和216项;技术创新聚焦于基因合成及基因编辑相关研究。合成生物学领域局部后向主路径与全局主路径一致,识别出的专利数量最多,有14件,包含6条技术路线;局部前向主路径与全局关键路径主路径上的专利完全相同,仅技术轨迹有差异,识别出13件专利;局部前向主路径的技术路线最多,有12条。基于主路径分析,合成生物学领域技术创新主要聚焦于脂质体、样本处理方法、水凝胶、液滴网络等技术,高价值专利技术聚焦于生物打印、液滴封装、水凝胶网络等技术。结论主路径分析可识别技术发展轨迹及高价值专利,从情报学角度为合成生物学研究提供了信息支撑。
文摘Line-of-sight (LOS) link planning condition has been observed to have effects on the atmospheric factor which cause crucial signal loss. The main objective of the planning was to improve a set of a link using point to point condition to assist the performance in emerging its strategy for handling the fixed WLAN service. The purpose of this paper is to provide a quick description of various propagation loss mechanisms on Link Budget Tool (LBT). LBT is customized to create point to point link for local area network (LAN) through radio frequency range operating between 2.400 GHz and 5.800 GHz. This software is able to define the effect of signal loss and expected performances according to the distances between link propagation conditions based on a number of system parameters.
