Korean automatic spacing using pretrained transformer encoder and analysis

Automatic spacing in Korean is used to correct spacing units in a given input sentence. The demand for automatic spacing has been increasing owing to frequent incorrect spacing in recent media, such as the Internet and mobile networks. Therefore, herein, we propose a transformer encoder that reads a sentence bidirectionally and can be pretrained using an out-of-task corpus. Notably, our model exhibited the highest character accuracy (98.42%) among the existing automatic spacing models for Korean. We experimentally validated the effectiveness of bidirectional encoding and pretraining for automatic spacing in Korean. Moreover, we conclude that pretraining is more important than fine-tuning and data size.     

Coverage optimization algorithm based on VF-CS in mobile sensor network

A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.     

基于虚拟现实的复杂场景加载优化算法

目前大规模场景模型生成的需求量日益增加, 现提出了一种基于区域的自动 LOD (Levels Of Details)构建算法. 该算法基于动态网格简化算法, 在游戏设计制作的过程中, 游戏开发人员会经常需要对美工部门人员提供的模型进行优化. 为了可以使模型的面数得到简化, 并且不改变模型的外观. 当今流行的 LOD技术非常擅于处理这种情况, 判断模型与摄像机的距离如果超过一定范围之后, 自动调取不同层次的模型, 当模型距离摄像机很远的情况下使用面数低的模型替换高模, 这样可以提高帧率并且降低摄像机前的三角面以及顶点数从而减少渲染压力. 一般模型的简化分为静态和动态模型的简化.大部分情况下, 程序员会让美工部门提供几套不同面数的模型或者通过模型简化工具对高模进行减面并存成多个Mesh, 并在程序运行的时候, 根据模型与摄像机的距离远近动态的替换Mesh. 这是一种静态的方法.这里将尝试使用一种动态的网格简化和LOD技术相结合的方法. 这种新型算法的大大的简化了操作流程, 美术人员只需要提供一个模型, 程序员可以使用这种方法生成量级不同的低模, 根据摄像机与模型的远近自动的调取不同精度的模型.     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

基于机器视觉的机车齿轮毂全自动双轴拧紧机的设计和应用

设计了基于机器视觉的机车齿轮毂全自动双轴拧紧机,根据拧紧工艺和扭矩控制原理实现对螺栓拧紧力矩的控制;通过丝杠变径机构,实现不同规格齿轮毂螺栓拧紧;利用机器视觉实现螺栓位置的识别以及初始位置的确定;讨论了自动拧紧机控制系统的硬件组成和软件系统配置,并介绍了防错、防漏功能的设计流程。螺栓自动拧紧机可提高装配精度和操作效率,降低工人的劳动强度。     

“电网一张图”时空信息管理系统

文章首先总结了电力企业信息管理系统的现状,提出了多源信息管理系统融合集成的邦联、子集和完全融合3种方式,分析了3种方式的优缺点,以建设企业"互联网搜索"型数字引擎为目标,提出了融合基于本体的图数据库建模,多维关联与路径因果分析,和人机共生互动可视化决策于一体的企业信息管理系统技术发展趋势;在系统分析目前正在快速发展的图数据库技术与传统关系数据库之间的本质区别基础上,总结原创的电力图计算平台技术的特点;在此基础上讨论"电网一张图"在建设能源互联网时空信息管理平台数据关联索引图中的核心作用,提出了支持能源互联网建设的"电网一张图"时空信息管理系统的技术架构与特点,最后总结"电网一张图"时空信息管理系统在提高电网安全运行水平、提升客户服务水平、增强清洁能源消纳水平、改善经营绩效水平、以及为综合能源服务和建设能源生态等提供数据服务方面的广阔应用场景。     

Hybrid self-inertia weight adaptive particle swarm optimisation with local search using C4.5 decision tree classifier for feature selection problems

ABSTRACT

Feature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets.     

Automatic Transformation of Membrane‐Type Electronic Devices into Complex 3D Structures via Extrusion Shear Printing and Thermal Relaxation of Acrylonitrile–Butadiene–Styrene Frameworks

This work demonstrates a means of automatic transformation from planar electronic devices to desirable 3D forms. The method uses a spatially designed thermoplastic framework created via extrusion shear printing of acrylonitrile–butadiene–styrene (ABS) on a stress‐free ABS film, which can be laminated to a membrane‐type electronic device layer. Thermal annealing above the glass transition temperature allows stress relaxation in the printed polymer chains, resulting in an overall shape transformation of the framework. In addition, the significant reduction in the Young's modulus and the ability of the polymer chains to reflow in the rubbery state release the stress concentration in the electronic device layer, which can be positioned outside the neutral mechanical plane. Electrical analyses and mechanical simulations of a membrane‐type Au electrode and indium gallium zinc oxide transistor arrays before and after transformation confirm the versatility of this method for developing 3D electronic devices based on planar forms.     

区域控制器的安全需求建模与自动验证

轨道交通区域控制器（ZC）是我国轨道交通信号系统选型的主流制式——基于通信的列车控制系统（CBTC）的核心子系统，其突出的安全性使得安全需求的形式化验证成为一个非常重要的问题.但是ZC自身的复杂性以及领域知识的繁杂难以掌握，使得形式化方法很难应用到安全需求的验证中去.针对这些问题，提出一种安全需求的自动验证方法，使用半形式化的问题框架方法（PF）来建模和分解安全需求，根据需求模型自动生成安全需求的验证模型和验证性质，在此基础上自动生成验证模型的Scade语言实现，并通过Design Verifier验证器对需求进行组合验证.最后，使用了某个实际案例ZC的一个子问题CAL_EOA进行了研究，实验结果证明了该方法的可行性与有效性，它能自动地将安全需求模型进行组合验证，改善了验证的效率.     

Large neighborhood search for the bike request scheduling problem

This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds.