Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.     

Distributed wireless power transfer in sensor networks with multiple Mobile Chargers

We investigate the problem of efficient wireless power transfer in wireless sensor networks. In our approach, special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient charging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.     

Viability of intertwined supply networks: extending the supply chain resilience angles towards survivability. A position paper motivated by COVID-19 outbreak

An intertwined supply network (ISN) is an entirety of interconnected supply chains (SC) which, in their integrity secure the provision of society and markets with goods and services. The ISNs are open systems with structural dynamics since the firms may exhibit multiple behaviours by changing the buyer-supplier roles in interconnected or even competing SCs. From the positions of resilience, the ISNs as a whole provide services to society (e.g. food service, mobility service or communication service) which are required to ensure a long-term survival. The analysis of survivability at the level of ISN requires a consideration at a large scale as resilience of individual SCs. The recent example of coronavirus COVID-19 outbreak clearly shows the necessity of this new perspective. Our study introduces a new angle in SC resilience research when a resistance to extraordinary disruptions needs to be considered at the scale of viability. We elaborate on the integrity of the ISN and viability. The contribution of our position study lies in a conceptualisation of a novel decision-making environment of ISN viability. We illustrate the viability formation through a dynamic game-theoretic modelling of a biological system that resembles the ISN. We discuss some future research areas.     

一种快速解压的无损压缩算法

随着信息技术的不断发展,大量数据给存储和传输都带来了巨大的挑战。数据压缩能够有效减少数据量,方便数据的处理和传输。无损压缩是一种利用数据的冗余特点进行压缩的压缩方法,解压时可以完全还原数据而不会有任何失真。在研究LZO算法的快速解压原理基础上,设计了一种新的压缩算法。该算法通过减少压缩数据中压缩块的数量,降低了解压程序的执行开销。测试结果表明,新算法可实现比LZO算法更快的解压速度。     

泛在电力物联网在北京经济技术开发区的应用探索

泛在电力物联网是物联网在电力领域的具体体现，建设泛在电力物联网是推进"三型两网"建设的关键环节，也是实现能源转型的必要手段。阐述了泛在电力物联网的定义，从供电公司角度出发，根据北京经济技术开发区实际情况，讨论了依托地区特点的泛在电力物联网实施策略和实际应用场景，分析了可能遇到的问题。得出结论：随着泛在电力物联网的深入建设，供电公司能够为电力客户提供多元化服务，提高客户满意度；地市供电公司能够依托泛在电力物联网开展更多电力相关业务；泛在电力物联网的安全性、实用性、有效性是发展面临的首要问题。     

高校实验室计算机网络故障诊断技术研究

为了提升高校实验数据处理水平,高校实验室的相关建设工作已经步入正轨,但层出不穷的信息安全问题也向高校实验室计算机网络维护工作提出了新的挑战。文章从现阶段高校实验室计算机网络的相关建设工作出发,简要论述引发网络故障的具体原因,并对其诊断技术进行探讨。     

基于“IPv6+”的智能IP网络方案

随着第4次工业革命的到来，人类社会正逐步迈向万物互联的智能时代。智能时代需要更加自动化、智能化的IP网络，基于“IPv6+”的SRv6、BIERv6等技术是使能新一代IP网络的关键基础。全面阐述了“IPv6+”的技术内涵，结合华为在智能 IP 网络解决方案上的创新和思考，介绍了“IPv6+”在极简连接、SLA 保障、专网体验、质量感知和云网一体等多个解决方案场景的关键技术与典型应用，助力5G与云业务发展。     

Genetic algorithm and self organizing map based fuzzy hybrid intelligent method for color image segmentation

The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods.     

A bat-neural network multi-agent system (BNNMAS) for stock price prediction: Case study of DAX stock price

Creating an intelligent system that can accurately predict stock price in a robust way has always been a subject of great interest for many investors and financial analysts. Predicting future trends of financial markets is more remarkable these days especially after the recent global financial crisis. So traders who access to a powerful engine for extracting helpful information throw raw data can meet the success. In this paper we propose a new intelligent model in a multi-agent framework called bat-neural network multi-agent system (BNNMAS) to predict stock price. The model performs in a four layer multi-agent framework to predict eight years of DAX stock price in quarterly periods. The capability of BNNMAS is evaluated by applying both on fundamental and technical DAX stock price data and comparing the outcomes with the results of other methods such as genetic algorithm neural network (GANN) and some standard models like generalized regression neural network (GRNN), etc. The model tested for predicting DAX stock price a period of time that global financial crisis was faced to economics. The results show that BNNMAS significantly performs accurate and reliable, so it can be considered as a suitable tool for predicting stock price specially in a long term periods.     

Congestion management by determining optimal location of series FACTS devices using hybrid bacterial foraging and Nelder–Mead algorithm

In this paper, the Thyristor-Controlled Series-Compensated (TCSC) devices are located for congestion management in the power system by considering the non-smooth fuel cost function and penalty cost of emission. For this purpose, it is considered that the objective function of the proposed optimal power flow (OPF) problem is minimizing fuel and emission penalty cost of generators. A hybrid method that is the combination of the bacterial foraging (BF) algorithm with Nelder–Mead (NM) method (BF-NM) is employed to solve the OPF problems. The optimal location of the TCSC devices are then determined for congestion management. The size of the TCSC is obtained by using of the BF-NM algorithm to minimize the cost of generation, cost of emission, and cost of TCSC. The simulation results on IEEE 30-bus, modified IEEE 30-bus and IEEE 118-bus test system confirm the efficiency of the proposed method for finding the optimal location of the TCSC with non-smooth non-convex cost function and emission for congestion management in the power system. In addition, the results clearly show that a better solution can be achieved by using the proposed OPF problem in comparison with other intelligence methods.