Mechanism for green unicast routing protection in multi-granularity transport networks by Jun-ling SHI, Xing-wei WANG, Min HUANG

“…The mechanism for green unicast routing protection is designed with the constraint of quality of service (QoS),energy consumption and the survivability of single link or node failure considered.The path is calculated under the constraint of QoS based on K-shortest path algorithm.The resource allocation is done on multi-layer auxiliary graph considering the minimum times of wavelength conversion.Three protection levels are provided according to the service demands.The mechanism is implemented over EON (Europe optical network) topology by simulation.Performance evaluation has been done on the blocking probability,the protecting/working resource ratio and the load balance degree by comparing with certain existent mechanism.It has been shown that the proposed mechanism is both feasible and effective.…”
Get full text

基于透视不变二值特征描述子的图像匹配算法 by Li-chuan GENG, Song-zhi SU, Shao-zi LI

“…Current local feature based image matching algorithms are usually less robust to image perspective transformation.Aiming to solve this problem，a new perspective invariant binary code (PIBC) based image matching algorithm is proposed.Firstly，FAST corners are detected on the pyramid images，those corners with non-maximum Harris corner response value and the edge points are further eliminated.And then，by simulating the perspective transformations of images taken from different viewpoints，a single FAST corner is described with binary descriptors under different viewpoint transformations，which makes the descriptor could describe the identical feature point on different perspective transform images.Experimental results show its robustness to image perspective transformation，while its complexity is similar with SURF.…”
Get full text

Construction of Target Controllable Image Segmentation Model Based on Homotopy Perturbation Technology by Shu-Li Mei

“…So, the bottleneck of the variational model on image segmentation is the lower efficiency of the algorithm. Combining the multiscale wavelet interpolation operator and HPM, a semianalytical numerical method can be obtained, which can improve the computational efficiency and accuracy greatly. …”
Get full text

Optimum Design of Load Capacity of Cycloidal Pin Wheel by Leilei Xu, Jianxin Su

“…Matlab is used to call the genetic algorithm in its optimization toolbox for solution. …”
Get full text

Denoising and reconstruction of evaporation duct based on quadratic optimal threshold approximation message passing method by Guosheng RUI, Ge LIU, Wenbiao TIAN, Daoguang DONG, Yanan ZHANG

“…To solve the problem that the mixed noise of compressed sensing observation stage had adverse effects on the high-precision reconstruction in the time-space situation awareness process of evaporative duct,an approximate message passing method based on quadratic optimal threshold was proposed.A quadratic stabilization threshold function which integrated advantages of soft and hard threshold functions was designed,and the optimal threshold setting policy was added to the iterative process based on conjugate gradient method to speed up convergence.Theoretical analysis and experiments show that,compared with several mainstream algorithms,the proposed algorithm has the faster convergence rate and lower denoising reconstruction error.…”
Get full text

Fuzzy Lattice Reasoning for Pattern Classification Using a New Positive Valuation Function by Yazdan Jamshidi Khezeli, Hossein Nezamabadi-pour

“…As a consequence, the modified algorithm achieves better classification results. The effectiveness of the modified FLR is demonstrated by examples on several well-known pattern recognition benchmarks.…”
Get full text

Behavior authentication of Web users based on machine learning by Zenan WU, Liqin TIAN, Zhigang WANG

“…According to the security problem of Web user information,the user behavior was analyzed and authenticated by the method of machine learning.First of all,through the principal component analysis to reduce the dimension of the original data set,then use the SVM algorithm to allow the computer to learn the history of user behavior evidence,to get a model to identify the user's identity.The practical application and theoretical analysis show that the model in user behavior identification authentication,can be more accurate and efficient classification of dangerous users and trusted users,analysis lay a solid theoretical and practical basis for the high performance user behavior such as electronic commerce,network finance and other key of Internet applications.…”
Get full text

Design of home fire detection system based on wireless multi-sensor data fusion by Wenbin CHENG, Lei DU, Yiyi LIU

“…Aiming at the shortcomings of false alarm and leakage alarm in the existing fire detection system and the complicated wiring,high cost and poor flexibility of the traditional wired fire detection system,a set of home fire detection system based on wireless multi-sensor data fusion was designed,to detect the fire safety hazards caused by kitchen equipment aging,electrical wiring aging or electrical equipment aging.The design of multi-sensor data fusion algorithm,fire detection system hardware framework and software implementation were described in detail.The simulation results show that the scheme has the characteristics of high accuracy and flexibility.…”
Get full text

Operation Optimization of Microgrid System Based on Intelligent System Model by Jian Kang

“…In addition, this paper adopts the method of extracting the harmonic current command in the synchronous coordinate system based on the band-pass filter composed of SOGI and combines the RDFT algorithm to determine the number of harmonics that can be compensated and the degree of compensation for the harmonic number. …”
Get full text

Defense-enhanced dynamic heterogeneous redundancy architecture based on executor partition by Ting WU, Chengnan HU, Qingnan CHEN, Anbang CHEN, Qiuhua ZHENG

“…Aiming at the security problem when servants are faced with common vulnerabilities, an improved DHR architecture called IDHR was proposed.On the basis of DHR, an executor-partition module that divided the executor-set to several executor pools by the heterogeneity among the executors was introduced to improve the heterogeneity among the executor pools.Moreover, the scheduling algorithm was improved by choosing executor pools randomly at first, and then choosing the executors from these pools randomly.Finally, through two experimental schemes of random simulation and Web server emulation, the security evaluation of the proposed IDHR architecture was carried out from two aspects of attack success rate and control rate.Experimental results show that the security of the IDHR architecture, especially when the common vulnerability is unknown, is significantly better than the traditional DHR architecture.…”
Get full text

A Note on Two-Agent Scheduling with Resource Dependent Release Times on a Single Machine by Peng Liu, Lini Duan

“…The optimal properties and the optimal polynomial time algorithm are proposed to solve the scheduling problem.…”
Get full text

Vector Bond Graph Method for the Dynamics Analysis of Planar Linkage based on Generalized Velocity by Wang Zhongshuang, Xu He

“…By the corresponding algorithm,the automatic dynamics modeling,calculation and analysis of planar six bar press mechanism on a computer is realized,the influence of pulse working load on mechanism driving moment is revealed,and the validity of the procedure proposed is verified.…”
Get full text

Calculating the feature method of short text based on analytic hierarchy process by Xue-qiang ZOU, Xiu-guo BAO, Xiao-jun HUANG, Hong-yuan MA, Qing-sheng YUAN

“…Furthermore, this method was also implemented in the traditional clustering algorithm. Experimental results show that, compared with the traditional tf-idf method, the improved approach has a better clustering effect on the average scattering for clusters and the total separation between clusters.…”
Get full text

Achieving efficient location privacy protection based on cache by Lu-lu LI, Jia-feng HUA, Sheng WAN, Hui ZHU, Feng-hua LI

“…With the development of mobile Internet and the popularization of intelligent terminals,location based services(LBS) has been widespread in navigation,social network and other fields.Due to the sensitivity of personal location information,data privacy protection related to location of mobile objects has become the hotspots of research.Considering the openness of the background information,and based on the information cache mechanism,a dummy selection algorithm was proposed to reduce the number of interactions between the user and the untrusted server and combine the k-anonymity to achieve efficient location privacy.Without relying on trusted third party,the scheme can prevent the attackers owned background information from inference attack,and the detail simulation results indicate its effectiveness and efficiency.…”
Get full text

Link prediction method based on the similarity of high path by Qiuyang GU, Bao WU, Renyong CHI

“…For the problem that the existing link prediction method has many problems, including low accuracy and low efficiency, a method of high-order path similarity link prediction was proposed.Firstly, the path was used as the judging feature to predict missing links in complex networks, which could make resource allocation more effective and restricts information leakage by punishing public neighbor pairs.Secondly, by using high order paths as judging features, the available long paths between seed nodes would be punished.Finally, several real complex network datasets were used for numerical examples calculation.Experimental results show that the proposed algorithm is more accurate and efficient than other baseline methods.…”
Get full text

Moving target defense solution on network layer based on OpenFlow by Yi-xun HU, Kang-feng ZHENG, Yi-xian YANG, Xin-xin NIU

“…In order to take an active part in network attack and defense,a moving target defense solution on network layer based on OpenFlow was proposed,using the flexibility of network brought by OpenFlow network architecture.On the network layer,through mapping the correspondent nodes’ addresses to pseudo-random virtual addresses in the LAN and mapping correspondent nodes’ ports to virtual ports,achieving the hiding of correspond nodes in the whole network and the information of network architecture.Researches verify the system’s effectiveness.Comparing with existing moving target defense solutions,the proposed algorithm can be deployed easily in the traditional network,and realize comprehensive protection of the corresponding in the whole network.…”
Get full text

Collaborative Recommendation for Online Social Networks Based on User Behavior Cognitive by Jin Qi, Bin Xu, Xiaoxuan Hu, Bianjia Xu, Xinglin Xiao

“…Recently，online social network（OSN）has become essential tools for information sharing and communication in people’s work and life.How to cognitive massive，complex，large-area and spatiotemporal association user behavior information and provide personalized re1commendation services have become problems need special attention in development of OSN.Thus，a frame of collaborative recommendation for OSN based on user behavior cognitive was proposed which used collaborative filtering algorithm to provide personalized recommendation services on the basis of analysis of behavior of user characteristics，text information and interest preferences，etc.Experimental results verify that the proposed collaborative recommendation strategy based on user behavior cognitive has good stability and actual application effect.…”
Get full text

Research on intelligent computing offloading model based on reputation value in mobile edge computing by Jin QI, Hairong SUN, Kun GONG, Bin XU, Shunyi ZHANG, Yanfei SUN

“…Aiming at the problem of high-latency,high-energy-consumption,and low-reliability mobile caused by computing-intensive and delay-sensitive emerging mobile applications in the explosive growth of IoT smart mobile terminals in the mobile edge computing environment,an offload decision-making model where delay and energy consumption were comprehensively included,and a computing resource game allocation model based on reputation that took into account was proposed,then improved particle swarm algorithm and the method of Lagrange multipliers were used respectively to solve models.Simulation results show that the proposed method can meet the service requirements of emerging intelligent applications for low latency,low energy consumption and high reliability,and effectively implement the overall optimized allocation of computing offload resources.…”
Get full text

Research on Grid Scheduling of Super-Peer Model Based on QoS by Shanliang Pan, Xi Huang, Qinjiao Mao

“…Firstly，a kind of grid resource management model——super-peer model was proposed.For this model，economic mechanism was introduced，allowing a grid user to put forward the task’s expected execution deadline，cost limit and the weight parameters between them.Those are the QoS parameters of application-level.Then，a corresponding resource scheduling algorithm was shown.Next，hierarchical colored Petri net and price timed Petri net were used to model and the dynamic process of grid resource scheduling was simulated.Lastly，reachable task graph（RTG）of Petri net model was constructed and the system’s scheduling performance was analyzed，such as throughout capacity，load-balancing，scheduling time and cost through an example.…”
Get full text

Tasking planning based on task splitting and merging in relay satellite network by Run-zi LIU, Min SHENG, Cheng-yuan TANG, Jian-dong LI, Kai DU, Yong-an YANG

“…To handle the low planning efficiency of the tasks with too long or too short service time,a task planning scheme was proposed based on task splitting and merging for relay satellite systems.First,a task splitting and merging was developed to transfer the task requirements of user to task units which could be planned with high efficiency.Secondly,based on the parallel machine scheduling model,the optimization problem of the task unit planning to maximize the number of completed tasks in the network was built.Further,a heuristic polynomial time scheduling algorithm was proposed.Simulation results show that compared to the traditional scheme,the task planning scheme perform better in terms of completed task number,resource utilization and fairness.…”
Get full text