电信运营商云网规划数字化研究和实现

基于电信运营商数字化转型，系统性地提出了数据驱动的云网发展规划体系，以及六大关键数字化能力构建，设计和实现了一种云网规划数字化平台，该平台可用于实现目标网络精细规划、边缘计算精准预测等场景，并探讨了数字孪生在规划领域的应用前景，对运营商推进云网融合战略、推进高质量发展具有指导和参考意义。     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

毫米波三维异质异构集成技术的进展与应用

三维异质异构集成技术是实现电子信息系统向着微型化、高效能、高整合、低功耗及低成本方向发展的最重要方法,也是决定信息化平台中微电子和微纳系统领域未来发展的一项核心高技术。文章详细介绍了毫米波频段三维异质异构集成技术的优势、近年来的发展趋势以及面临的挑战。利用硅基MEMS 光敏复合薄膜多层布线工艺可实现异质芯片的低损耗互连,同时三维集成高性能封装滤波器、高辐射效率封装天线等无源元件,还能很好地处理布线间的电磁兼容和芯片间的屏蔽问题。最后介绍了一款新型毫米波三维异质异构集成雷达及其在远距离生命体征探测方面的应用。     

Patterns in environmental priorities revealed through government open data portals

The ways in which environmental priorities are framed are varied and influenced by political forces. One technological advance--the proliferation of government open data portals (ODPs)--has the potential to improve governance through facilitating access to data. Yet it is also known that the data hosted on ODPs may simply reflect the goals and interests of multiple levels of political power. In this article, I use traditional statistical correlation and regression techniques along with newer natural language processing and machine learning algorithms to analyze the corpus of datasets hosted on government ODPs (total: 49,066) to extract patterns that relate scales of governance and political liberalism/conservatism to the priorities and meaning attached to environmental issues. I find that state-level and municipal-level ODPs host different categories of environmental datasets, with municipal-level ODPs generally hosting more datasets pertaining to services and amenities and state-level ODPs hosting more datasets pertaining to resource protection and extraction. Stronger trends were observed for the influences of political conservatism/liberalism among state-level ODPs than for municipal-level ODPs.     

Reversible data hiding based on RSBEMD coding and adaptive multi-segment left and right histogram shifting

By leveraging the secret data coding using the remainder storage based exploiting modification direction (RSBEMD), and the pixel change operation recording based on multi-segment left and right histogram shifting, a novel reversible data hiding (RHD) scheme is proposed in this paper. The secret data are first encoded by some specific pixel change operations to the pixels in groups. After that, multi-segment left and right histogram shifting based on threshold manipulation is implemented for recording the pixel change operations. Furthermore, a multiple embedding policy based on chess board prediction (CBP) and threshold manipulation is put forward, and the threshold can be adjusted to achieve adaptive data hiding. Experimental results and analysis show that it is reversible and can achieve good performance in capacity and imperceptibility compared with the existing methods.     

Prediction of risk factors of cyberbullying-related words in Korea: Application of data mining using social big data

The study examined a decision tree analysis using social big data to conduct the prediction model on types of risk factors related to cyberbullying in Korea. The study conducted an analysis of 103,212 buzzes that had noted causes of cyberbullying and data were collected from 227 online channels, such as news websites, blogs, online groups, social network services, and online bulletin boards. Using opinion-mining method and decision tree analysis, the types of cyberbullying were sorted using SPSS 25.0. The results indicated that the total rate of types of cyberbullying in Korea was 44%, which consisted of 32.3% victims, 6.4% perpetrators, and 5.3% bystanders. According to the results, the impulse factor was also the greatest influence on the prediction of the risk factors and the propensity for dominance factor was the second greatest factor predicting the types of risk factors. In particular, the impulse factor had the most significant effect on bystanders, and the propensity for dominance factor was also significant in influencing online perpetrators. It is necessary to develop a program to diminish the impulses that were initiated by bystanders as well as victims and perpetrators because many of those bystanders have tended to aggravate impulsive cyberbullying behaviors.     

A single-phase algorithm for mining high utility itemsets using compressed tree structures

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms.     

机载光电雷达它机试飞技术研究

机载光电雷达受平台及大气环境影响较大,而它机试飞能有效规避研制风险,是产品研制的必经阶段。本文介绍了机载光电雷达它机试飞试验系统组成、试验流程和数据处理等内容。经工程验证,实施过程满足任务需求,对其他光电系统的它机及本机试飞具有参考价值。     

Definition and detection of data-based uniqueness in evaluating bilinear (two-way) chemical measurements

Multivariate curve resolution methods, frequently used in analyzing bilinear data sets, result in ambiguous decomposition in general. Implementing the adequate constraints may lead to reduce the so-called rotational ambiguity drastically, and in the most favorable cases to the unique solution. However, in some special cases, non-negativity constraint as minimal information of the system is a sufficient condition to resolve profiles uniquely. Although, several studies on exploring the uniqueness of the bilinear non-negatively constrained multivariate curve resolution methods have been made in the literature, it has still remained a mysterious question. In 1995, Manne published his profile-based theorems giving the necessary and sufficient conditions of the unique resolution. In this study, a new term, i.e., data-based uniqueness is defined and investigated in details, and a general procedure is suggested for detection of uniquely recovered profile(s) on the basis of data set structure in the abstract space. Close inspection of Borgen plots of these data sets leads to realize the comprehensive information of local rank, and these argumentations furnish a basis for data-based uniqueness theorem. The reported phenomenon and its exploration is a new stage (it can be said fundament) in understanding and describing the bilinear (matrix-type) chemical data in general.