Non-invasive assessment of liver fibrosis in chronic liver diseases:Implementation in clinical practice and decisional algorithms

Chronic hepatitis B and C together with alcoholic and non-alcoholic fatty liver diseases represent the major causes of progressive liver disease that can eventually evolve into cirrhosis and its end-stage complications,including decompensation,bleeding and liver cancer.Formation and accumulation of fibrosis in the liver is the common pathway that leads to an evolutive liver disease.Precise definition of liver fibrosis stage is essential for management of the patient in clinical practice since the presence of bridging fibrosis represents a strong indication for antiviral therapy for chronic viral hepatitis,while cirrhosis requires a specif ic follow-up including screening for esophageal varices and hepatocellular carcinoma.Liver biopsy has always represented the standard of reference for assessment of hepatic fibrosis but it has some limitations being invasive,costly and prone to sampling errors.Recently,blood markers and instrumental methods have been proposed for the non-invasive assessment of liver fibrosis.However,there are still some doubts as to their implementation in clinical practice and a real consensus on how and when to use them is not still available.This is due to an unsatisfactory accuracy for some of them,and to an incomplete validation for others.Some studies suggest that performance of non-invasive methods for liver fibrosis assessment may increase when they are combined.Combination algorithms of non-invasive methods for assessing liver fibrosis may represent a rational and reliable approach to implement non-invasive assessment of liver fibrosis in clinical practice and to reduce rather than abolish liver biopsies.

Research on Scholarship Evaluation System based on Decision Tree Algorithm

Under the modern education system of China, the annual scholarship evaluation is a vital thing for many of the collegestudents. This paper adopts the classification algorithm of decision tree C4.5 based on the bettering of ID3 algorithm and constructa data set of the scholarship evaluation system through the analysis of the related attributes in scholarship evaluation information.And also having found some factors that plays a significant role in the growing up of the college students through analysis and re-search of moral education, intellectural education and culture&PE.

Vibration Based Tool Insert Health Monitoring Using Decision Tree and Fuzzy Logic

The productivity and quality in the turning process can be improved by utilizing the predicted performance of the cutting tools.This research incorporates condition monitoring of a non-carbide tool insert using vibration analysis along with machine learning and fuzzy logic approach.A non-carbide tool insert is considered for the process of cutting operation in a semi-automatic lathe,where the condition of tool is monitored using vibration characteristics.The vibration signals for conditions such as heathy,damaged,thermal and flank were acquired with the help of piezoelectric transducer and data acquisition system.The descriptive statistical features were extracted from the acquired vibration signal using the feature extraction techniques.The extracted statistical features were selected using a feature selection process through J48 decision tree algorithm.The selected features were classified using J48 decision tree and fuzzy to develop the fault diagnosis model for the improved predictive analysis.The decision tree model produced the classification accuracy as 94.78%with five selected features.The developed fuzzy model produced the classification accuracy as 94.02%with five membership functions.Hence,the decision tree has been proposed as a suitable fault diagnosis model for predicting the tool insert health condition under different fault conditions.

基于DLIN加密的可监管联盟链隐私保护方案

作为去中心化的分布式数据库,区块链凭借其独特的共识机制允许节点不依赖第三方建立点对点的价值转移,因此被广泛应用于金融、数字版权等领域。然而,区块链中账本数据公开透明存储的特性导致交易数据存在严重的隐私泄露风险,现有的隐私保护方案难以在用户隐私保护与数据追溯监管性之间达到平衡。为此,基于决策线性(DLIN)加密算法、Pedersen承诺、双密钥隐地址协议(DKSAP)、非交互式零知识(NIZK)证明,提出一种可监管的联盟链隐私保护方案。将实际交易金额隐藏于承诺中,并生成对应的NIZK证明信息用以保证解密监管密文得到的金额与实际交易金额相等,从而实现对隐藏金额的监管。基于分层确定性的DKSAP,利用DLIN加密算法生成身份验证及监管密文,结合子公钥生成算法实现对交易接收方身份的追溯。理论分析与仿真结果表明,该方案在保证交易数据隐私性并实现可追溯监管性的同时,能够取得较低的计算和通信开销,相比于可监管的隐私保护方案Traceable-Monero,其监管密文解密时间平均下降52.25%。

Supervision of Milling Tool Inserts Using Conventional and Artificial Intelligence Approach: A Review

Due to continuous cutting tool usage,tool supervision is essential for improving the metal cutting industry.In the metal removal process tool,supervision is carried out either by an operator or online tool supervision.Tool super-vision helps to understand tool condition,dimensional accuracy,and surface superiority.For downtime in the metal cutting industry,the main reasons are tool breakage and excessive wear,so it is necessary to supervise tool which gives better tool life and enhance productivity.This paper presents different conventional and artificial intelligence techniques for tool supervision in the processing procedures that have been depicted in writing.

Modeling and Analysis of the Decentralized Interactive Cyber Defense Approach

Powered by the Internet and the ever-increasing level of informatization, the cyberspace has become increasingly complex and its security situation has become increasingly grim, which requires new adaptive and collaborative defense technologies. In this paper, we introduced an extended interactive multi-agent decision model for decentralized cyber defense. Based on the significant advantages of the cooperative multi-agent decision-making, the decentralized interactive decision model DI-MDPs and the corresponding interaction and retrieval algorithms are proposed. Then, we analyzed the interactive decision by the calculation and update processes of three matrices, the stability and evolutionary equilibrium of the proposed model are also analyzed. Finally, we evaluated the performance of the proposed algorithms based on open data sets and standard test environments, the experimental results shown that the proposed work will be more applicable in cyber defense.

一种概率型非对称公钥密码体制的设计和实现

在分析传统公钥密码体制的基础上,设计并实现了一种基于Diffie Hellman判定问题,辅以抗碰撞的Hash函数和公钥证书进行加密和解密,安全性可证明的概率型非对称密码系统。它比基本Cramer-Shoup体制具有更高的效率,且同样具有抵抗自适应选择密文攻击的能力。

Condition Monitoring of Roller Bearing by K-star Classifier andK-nearest Neighborhood Classifier Using Sound Signal

Most of the machineries in small or large-scale industry have rotating elementsupported by bearings for rigid support and accurate movement. For proper functioning ofmachinery, condition monitoring of the bearing is very important. In present study soundsignal is used to continuously monitor bearing health as sound signals of rotatingmachineries carry dynamic information of components. There are numerous studies inliterature that are reporting superiority of vibration signal of bearing fault diagnosis.However, there are very few studies done using sound signal. The cost associated withcondition monitoring using sound signal (Microphone) is less than the cost of transducerused to acquire vibration signal (Accelerometer). This paper employs sound signal forcondition monitoring of roller bearing by K-star classifier and k-nearest neighborhoodclassifier. The statistical feature extraction is performed from acquired sound signals. Thentwo-layer feature selection is done using J48 decision tree algorithm and random treealgorithm. These selected features were classified using K-star classifier and k-nearestneighborhood classifier and parametric optimization is performed to achieve the maximumclassification accuracy. The classification results for both K-star classifier and k-nearestneighborhood classifier for condition monitoring of roller bearing using sound signals werecompared.

Joint receiving mechanism based on blind equalization with variable step size for M-QAM modulation

The problem of inter symbol interference（ ISI） in wireless communication systems caused by multipath propagation when using high order modulation like M-Q AMis solved. Since the wireless receiver doesn＇t require a training sequence,a blind equalization channel is implemented in the receiver to increase the throughput of the system. To improve the performances of both the blind equalizer and the system,a joint receiving mechanismincluding variable step size（ VSS） modified constant modulus algorithms（ MC-MA） and modified decision directed modulus algorithms（ MD DMA） is proposed to ameliorate the convergence speed and mean square error（ MSE） performance and combat the phase error when using high order QAM modulation. The VSS scheme is based on the selection of step size according to the distance between the output of the equalizer and the desired output in the constellation plane. Analysis and simulations showthat the performance of the proposed VSS-MCMA-MD DMA mechanismis better than that of algorithms with a fixed step size. In addition,the MCMA-MDDMA with VSS can performthe phase recovery by itself.

Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges

Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science（including Artificial Intelligence and Multiagent Systems） on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context. This work is dedicated to Jianer Chen, one of the strongest problem solvers in the history of parameterized algorithmics,on the occasion of his 60 th birthday.

A HYBRID APPROACH FOR MINIMIZING MAKESPAN IN PERMUTATION FLOWSHOP SCHEDULING

This work proposes a hybrid approach for solving traditional flowshop scheduling problems to reduce the makespan （total completion time）. To solve scheduling problems, a combination of Decision Tree （DT） and Scatter Search （SS） algorithms are used. Initially, the DT is used to generate a seed solution which is then given input to the SS to obtain optimal / near optimal solutions of makespan. The DT used the entropy function to convert the given problem into a tree structured format / set of rules. The SS provides an extensive investigation of the search space through diversification. The advantages of both DT and SS are used to form a hybrid approach. The proposed algorithm is tested with various benchmark datasets available for flowshop scheduling. The statistical results prove that the proposed method is competent and efficient for solving flowshop problems.