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.     

Maximum Data Generation Rate Routing Protocol Based on Data Flow Controlling Technology for Rechargeable Wireless Sensor Networks

For rechargeable wireless sensor networks, limited energy storage capacity, dynamic energy supply, low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario. Therefore, before data delivery, a sensor has to update its waking schedule continuously and share them to its neighbors, which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets. In this work, we propose the maximum data generation rate routing protocol based on data flow controlling technology. For a sensor, it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors. Hence, the energy consumption for time synchronization, location information and waking schedule shared will be reduced significantly. The saving energy can be used for improving data collection rate. Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.     

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.     

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

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

面向电信承载网的监控系统设计与实现

面对电信承载网连接的日益增长的海量终端设备，运营商需要结合网络拓扑对终端设备产生的数据进行高效的汇聚统计、异常分析、故障定位处理等操作。针对已有系统存在的操作困难、分析效率低等问题，设计与实现了一个面向电信承载网的高效监控系统，提供实时与离线数据分析和多维可视化分析的能力。对网管、认证、终端等系统及设备采集的数据进行结构化存储，对采集的数据进行拓扑相关性和时间序列方法分析，根据分析结果实现基于动态阈值控制的异常实时告警、定位等操作，并提供多维度可视化分析对网络状态进行实时监控。实际应用结果表明，该系统性能优异，具有良好交互性，能较好地满足承载网运维人员业务分析需求。     

Clinical significance of contact lens related changes of ocular surface tissue observed on optical coherence images

PurposeTo investigate the relationship between the real contact lens imprint into the conjunctival tissue, observed by optical coherence tomography (OCT) and conjunctival staining and contact lens wearing comfort.Methods17 participants (mean age = 26.6 SD ± 3.6 years; 7 females) were fitted with three different contact lenses base curves of the same silicone hydrogel custom lens type (Visell 50; Hecht Contactlinsen, Au, Germany) in a randomised order. One lens was optimally fitted according to the manufacturer's recommendation, one fitted 0.4 mm flatter and one fitted 0.4 mm steeper. After 4 h of lens wear the contact lens edge in the area of the conjunctiva was imaged nasally and temporally using OCT (Optovue iVue SD-OCT). To correct the artefact due to optical distortion with OCT, the imprint of all worn lenses was measured on a glass plate afterwards. Conjunctival staining in the limbal region after 4 h of lens wear was classified using the CCLRU Grading Scale. Comfort scoring was based on visual analog scales from 0 (very poor) to 100 (excellent).ResultsThe mean conjunctival imprint of all contact lens edges was 32.0 ± 8.1 μm before and 7.3 ± 6.5 μm after distortion correction of the OCT images. The distortion corrected conjunctival imprint with the 0.4 mm steeper lens (11.5 ± 6.2 μm) was statistically significantly greater compared to the optimally fitted lens (6.5 ± 5.9 μm) (One-way ANOVA followed Tukey-test; p = 0.017) and greater compared to the 0.4 mm flatter lens (3.9 ± 5.3 μm) (p < 0.001). There was no statistically significant difference between the optimally fitted lens and the 0.4 mm flatter lens (p = 0.209). The nasally measured imprint (11.4 ± 9.0 μm) was significantly greater than the temporally measured (3.3 ± 7.6 μm) (p < 0.001). There was no statistically significant correlation between the amount of conjunctival imprint and the graded conjunctival staining (p = 0.346) or the wearer’s comfort (p = 0.735).ConclusionsContact lens edges imaged by OCT exhibited displacement artefacts. The observed conjunctival imprints are a combination of real conjunctival compression and artefacts. A deeper imprint of the contact lens into the conjunctiva caused by a steeper base curve was not related to clinically significant staining or changes in comfort after 4 h of lens wear. The observed differences between nasal and temporal imprint are likely to be caused by variations of conjunctival thickness and the shape of the underlying sclera.     

Transport Map sampling with PGD model reduction for fast dynamical Bayesian data assimilation

The motivation of this work is to address real-time sequential inference of parameters with a full Bayesian formulation. First, the proper generalized decomposition (PGD) is used to reduce the computational evaluation of the posterior density in the online phase. Second, Transport Map sampling is used to build a deterministic coupling between a reference measure and the posterior measure. The determination of the transport maps involves the solution of a minimization problem. As the PGD model is quasi-analytical and under a variable separation form, the use of gradient and Hessian information speeds up the minimization algorithm. Eventually, uncertainty quantification on outputs of interest of the model can be easily performed due to the global feature of the PGD solution over all coordinate domains. Numerical examples highlight the performance of the method.     

基于模糊谱聚类的不确定蛋白质相互作用网络功能模块挖掘

针对谱聚类融合模糊C-means（FCM）聚类的蛋白质相互作用（PPI）网络功能模块挖掘方法准确率不高、执行效率较低和易受假阳性影响的问题，提出一种基于模糊谱聚类的不确定PPI网络功能模块挖掘（FSC-FM）方法。首先，构建一个不确定PPI网络模型，使用边聚集系数给每一条蛋白质交互作用赋予一个存在概率测度，克服假阳性对实验结果的影响；第二，利用基于边聚集系数流行距离（FEC）策略改进谱聚类中的相似度计算，解决谱聚类算法对尺度参数敏感的问题，进而利用谱聚类算法对不确定PPI网络数据进行预处理，降低数据的维数，提高聚类的准确率；第三，设计基于密度的概率中心选取策略（DPCS）解决模糊C-means算法对初始聚类中心和聚类数目敏感的问题，并对预处理后的PPI数据进行FCM聚类，提高聚类的执行效率以及灵敏度；最后，采用改进的边期望稠密度（EED）对挖掘出的蛋白质功能模块进行过滤。在酵母菌DIP数据集上运行各个算法可知，FSC-FM与基于不确定图模型的检测蛋白质复合物（DCU）算法相比，F-measure值提高了27.92%，执行效率提高了27.92%；与在动态蛋白质相互作用网络中识别复合物的方法（CDUN）、演化算法（EA）、医学基因或蛋白质预测算法（MGPPA）相比也有更高的F-measure值和执行效率。实验结果表明，在不确定PPI网络中，FSC-FM适合用于功能模块的挖掘。     

Data sharing mechanism of various mineral resources based on blockchain

Basins with various mineral resources coexisting and enriching often occupy an important strategic position. The exploration of various mineral resources is repetitive at present due to unshared data and imperfect management mechanism. This situation greatly increases the cost of energy exploitation in the country. Traditional data-sharing mode has several disadvantages, such as high cost, difficulty in confirming the right of data, and lack of incentive mechanism, which make achieving real data sharing difficult. In this paper, we propose a data-sharing mechanism based on blockchain and provide implementation suggestions and technical key points. Compared with traditional data-sharing methods, the proposed data-sharing mechanism can realize data sharing, ensure data quality, and protect intellectual property. Moreover, key points in the construction are stated in the case study section to verify the feasibility of the data-sharing system based on blockchain proposed in this paper.