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.     

基于微博用户兴趣话题的相似用户挖掘

相似用户挖掘是提高社交网络服务质量的重要途径，在面向大数据的社交网络时代，准确的相似用户挖掘对于用户和互联网企业等都有重要的意义，而根据用户自己的兴趣话题挖掘的相似用户更符合相似用户的要求。提出了一种基于用户兴趣话题进行相似用户挖掘的方法。该方法首先使用TextRank话题提取方法对用户进行兴趣话题提取，再对用户发表内容进行训练，计算出所有词之间的相似度。提出CP（Corresponding Position similarity）、CPW（Corresponding Position Weighted similarity）、AP（All Position similarity）、APW（All Position Weighted similarity）四种用户兴趣话题词相似度计算方法，通过用户和相似用户间关注、粉丝重合率验证相似用户挖掘效果，APW similarity的相似用户的关注/粉丝重合百分比为1.687%，优于提出的其他三种算法，分别提高了26.3%、2.8%、12.4%，并且比传统的文本相似度方法Jaccard相似度、编辑距离算法、余弦相似度分别提高了20.4%、21.2%、45.0%。因此APW方法可以更加有效地挖掘出用户的相似用户。     

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.     

A novel approach to adaptive relational association rule mining

The paper focuses on the adaptive relational association rule mining problem. Relational association rules represent a particular type of association rules which describe frequent relations that occur between the features characterizing the instances within a data set. We aim at re-mining an object set, previously mined, when the feature set characterizing the objects increases. An adaptive relational association rule method, based on the discovery of interesting relational association rules, is proposed. This method, called ARARM (Adaptive Relational Association Rule Mining) adapts the set of rules that was established by mining the data before the feature set changed, preserving the completeness. We aim to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended object set. Experiments testing the method's performance on several case studies are also reported. The obtained results highlight the efficiency of the ARARM method and confirm the potential of our proposal.     

GK1C型内燃机车频繁停车现象探讨与解决方案

运用过程中各类相关因子的变化,会使得机车柴油机配气相位出现一定程度变化,采取某种措施调整或是处理可以解决动力不足的问题。     

Geothermal energy utilization trends from a technological paradigm perspective

The use of geothermal energy and its associated technologies has been increasing worldwide. However, there has been little paradigmatic research conducted in this area. This paper proposes a systematic methodology to research the development trends for the sustainable development of geothermal energy. A novel data analysis system was created to research the geothermal energy utilization trends, and a technological paradigm theory was adopted to explain the technological changes. A diffusion velocity model was used to simulate and forecast the geothermal power generation development in the diffusion phase. Simulation results showed that the development of installed capacity for geothermal generation had a strong inertia force along with the S-curve. Power generation from geothermal power sources reached a peak in 2008 and is estimated to be saturated by 2030. Geothermal energy technologies in hybrid power systems based on other renewable energy sources look to be more promising in the future.     

综采工作面粉尘防治问题分析与技术改进

针对新桥煤矿2301综采工作面机载喷雾系统喷雾效果差、喷雾耗水量大造成煤质含水量超标、喷嘴雾化程度不高、喷嘴容易发生堵塞等问题,提出了高压喷雾系统设计方案,选择了1.2mm的锥形引射喷嘴和1.5mm的扇形引射喷嘴。采用固定水泵供水方式,结合工作面实际情况,计算出喷雾总用水量247.5L/min,提高了喷雾射程,提升了除尘效果。     

一种基于Spark的不确定数据集频繁模式挖掘算法

如何在海量不确定数据集中提高频繁模式挖掘性能是目前研究的热点.传统算法大多是以期望、概率或者权重等单一指标为数据项集支持度，在大数据背景下，同时考虑概率和权重支持度的算法难以兼顾其执行效率.为此，本文提出一种基于Spark的不确定数据集频繁模式挖掘算法（UWEFP），首先，为了同时兼顾数据项的概率和权重，计算一项集的最大概率权重值并进行剪枝；然后，为了减少对数据集的多次扫描，结合Spark框架的优点，设计了一种具有FP-tree特征的新颖的UWEFP-tree结构进行模式树的构建及挖掘；最后在Spark环境下，以UCI数据集进行实验验证.实验结果表明本文的方法在保证挖掘结果的同时，提高了效率.     

Broadband bowtie belt nanoantennas

In this article, we study a linear array of bowtie nanoantennas placed between two metallic strips that can work from 800 to 1420 nm (600 nm linewidth), with an electric field enhancement factor close to 20. We study the dynamical change of the position of the electric field enhancement amongst different elements in the array and, at the same time, the effects of dispersion on the scalability of the array elements. A systematic analysis and methodology to produce an array that can operate over a large bandwidth whilst maintaining the electric field enhancement without significant variation is provided.