儿童用品TBT通报数据可视化预警研究

探索采用数据可视化技术分析儿童用品TBT通报数据,以可视化图形图像呈现通报热点并揭示趋势信息,提出对策与建议,助力为儿童用品产业升级、TBT预警数据分析和信息传播工作提供新思路,提高中小企业的国外市场准入机会。     

REST API技术及在移动通信网络管理中的应用

介绍了目前最炙手可热的REST架构风格，该风格顺应Web2.0的兴起，完美的匹配了云计算时代来临的可扩展要求，在各种应用场景中都得到了充分的表现。根据其技术特点，分析了该风格的API在移动通信网络管理中的应用，从网管系统内部、网管系统之间以及网管系统与上层APP应用之间等多方面对是否适用于REST风格以及如何在合适的位置使用REST API进行了分析。     

云杉八齿小蠹Ips typographus L.虚拟模型构建方法研究

本文以云杉八齿小蠹Ips typographus Linnaeus为例,经标本选取,观察虫体整体形态,绘制整体结构草图,电子显微镜观察局部、得到局部数字图像,分别建立虫体每一部分的高精度细节。把模型每部分拼装在一起组成整体模型,构建出了云杉八齿小蠹三维虚拟昆虫数字化模型。     

Classification of the cardiotocogram data for anticipation of fetal risks using machine learning techniques

The aim of the research is evaluating the classification performances of eight different machine-learning methods on the antepartum cardiotocography (CTG) data. The classification is necessary to predict newborn health, especially for the critical cases. Cardiotocography is used for assisting the obstetricians’ to obtain detailed information during the pregnancy as a technique of measuring fetal well-being, essentially in pregnant women having potential complications. The obstetricians describe CTG shortly as a continuous electronic record of the baby's heart rate took from the mother's abdomen. The acquired information is necessary to visualize unhealthiness of the embryo and gives an opportunity for early intervention prior to happening a permanent impairment to the embryo. The aim of the machine learning methods is by using attributes of data obtained from the uterine contraction (UC) and fetal heart rate (FHR) signals to classify as pathological or normal. The dataset contains 1831 instances with 21 attributes, examined by applying the methods. In the paper, the highest accuracy displayed as 99.2%.     

基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

Semantically enriched Massive Open Online Courses (MOOCs) platform

Massive Open Online Courses (MOOCs) are becoming an essential source of information for both students and teachers. Noticeably, MOOCs have to adapt to the fast development of new technologies; they also have to satisfy the current generation of online students. The current MOOCs’ Management Systems, such as Coursera, Udacity, edX, etc., use content management platforms where content are organized in a hierarchical structure. We envision a new generation of MOOCs that support interpretability with formal semantics by using the SemanticWeb and the online social networks. Semantic technologies support more flexible information management than that offered by the current MOOCs’ platforms. Annotated information about courses, video lectures, assignments, students, teachers, etc., can be composed from heterogeneous sources, including contributions from the communities in the forum space. These annotations, combined with legacy data, build foundations for more efficient information discovery in MOOCs’ platforms. In this article we review various Collaborative Semantic Filtering technologies for building Semantic MOOCs’ management system, then, we present a prototype of a semantic middle-sized platform implemented at Western Kentucky University that answers these aforementioned requirements.     

Event-triggered variable horizon Supervisory Predictive control of hybrid power plants

The supervision of a hybrid power plant, including solar panels, a gas microturbine and a storage unit operating under varying solar power profiles is considered. The Economic Supervisory Predictive controller assigns the power references to the controlled subsystems of the hybrid cell using a financial criterion. A prediction of the renewable sources power is embedded into the supervisor. Results deteriorate when the solar power is unsteady, owing to the inaccuracy of the predictions for a long-range horizon of 10 s. The receding horizon is switched between an upper and a lower value according to the amplitude of the solar power trend. Theoretical results show the relevance of horizon switching, according to a tradeoff between performance and prediction accuracy. Experimental results, obtained in a Hardware In the Loop (HIL) framework, show the relevance of the variable horizon approach. Power amplifiers allow us to simulate virtual components, such as a gas microturbine, and to blend their powers with that of real devices (storage unit, real solar panels). In this case, fuel savings, reaching 15%, obtained under unsteady operating conditions lead to a better overall performance of the hybrid cell. The overall savings obtained in the experiments amount to 12%.     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.