Artificial intelligence has emerged as the core of the 4th industrial revolution, and large amounts of data processing, such as big data technology and rapid data analysis, are inevitable. The most fundamental and universal data interpretation technique is an analysis of information through regression, which is also the basis of machine learning. Ridge regression is a technique of regression that decreases sensitivity to unique or outlier information. The time-consuming calculation portion of the matrix computation, however, basically includes the introduction of an inverse matrix. As the size of the matrix expands, the matrix solution method becomes a major challenge. In this paper, a new algorithm is introduced to enhance the speed of ridge regression estimator calculation through series expansion and computation recycle without adopting an inverse matrix in the calculation process or other factorization methods. In addition, the performances of the proposed algorithm and the existing algorithm were compared according to the matrix size. Overall, excellent speed-up of the proposed algorithm with good accuracy was demonstrated.

This article describes how events that make up text stories can be represented and extracted. We also address the results from our simple experiment on extracting and clustering events in terms of emotions, under the assumption that different emotional events can be associated with the classified clusters. Each emotion cluster is based on Plutchik's eight basic emotion model, and the attributes of the NLTK-VADER are used for the classification criterion. While comparisons of the results with human raters show less accuracy for certain emotion types, emotion types such as joy and sadness show relatively high accuracy. The evaluation results with NRC Word Emotion Association Lexicon (aka EmoLex) show high accuracy values (more than 90% accuracy in anger, disgust, fear, and surprise), though precision and recall values are relatively low.

This paper identifies challenging factors that hinder the successful settlement of the MyData industry, which is drawing global attention, and it analyzes the priority of solutions. To this end, a mixed-methodology including analytic network process technique was borrowed step-by-step to identify variables, analyze them, and provide interpretations. From the first step, the study found that the market aspect was the most important for the success of the K-MyData business, and the release of interesting representative services was found to be the easiest way to inspire market growth. From the second step, as a socio-cultural issue, the lack of consensus on data provisioning was found to present a major obstacle. To achieve consensus, it is very important for business participants to gain the trust of consumers. From the third step, it was found that the scope of data collection and responsibility for accidents needs to be clarified. Government and business-related persons must observe the principles of MyData while tackling these obstacles. It is also necessary for the government to be sensitive to changes in the environment as a focal actor. Doing so will lead to data industry activation and will help guarantee of rights of data subjects in a balanced manner. Finally, it is notable that technical barriers now have the lowest priority. Although technology is important, MyData business must also overcome market, socio-cultural, and institutional challenges. The study selected Korea as its research target, but it is expected to provide useful insights to other countries that are planning MyData business similar to Korea.

The low cost of Bluetooth technology has led to its wide usage in indoor positioning. However, some inherent shortcomings of Bluetooth technology have limited its further development in indoor positioning, such as the unstable positioning state caused by the fluctuation of Received Signal Strength Indicator (RSSI) and the low transmission frequency accompanied by a poor real-time performance in positioning and tracking moving targets. To address these problems, an indoor fusion positioning algorithm of Bluetooth technology and pedestrian dead reckoning (PDR) based on a particle filter with dynamic adjustment of weights calculation strategy (BPDW) will be proposed. First, an orderly statistical filter (OSF) sorts the RSSI values of a period and then eliminates outliers to obtain relatively stable RSSI values. Next, the Group-based Trilateration algorithm (GTP) enhances positioning accuracy. Finally, the particle filter algorithm with dynamic adjustment of weight calculation strategy fuses the results of Bluetooth positing and PDR to improve the performance of positioning moving targets. To evaluate the performance of BPDW, we compared BPDW with other representative indoor positioning algorithms, including fingerprint positioning, trilateral positioning (TP), multilateral positioning (MP), Kalman filter, and strong tracking filter. The results showed that BPDW has the best positioning performance on static and moving targets in simulation and actual scenes.

With the rapid development of the Chinese water project, the safety monitoring of dams is urgently needed. Many drawbacks exist in dams, such as high monitoring costs, a limited equipment service life, long-term monitoring difficulties. MEMS sensors have the advantages of low cost, high precision, easy installation, and simplicity, so they have broad application prospects in engineering measurements. This paper designs intelligent monitoring based on the collaborative measurement of dual MEMS sensors. The system first determines the endpoint coordinates of the sensor array by the coordinate transformation relationship in the monitoring system and then obtains the dam settlement according to the endpoint coordinates. Next, this paper proposes a dual-MEMS sensor collaborative measurement algorithm that builds a mathematical model of the dual-sensor measurement. The monitoring system realizes mutual compensation between sensor measurement data by calculating the motion constraint matrix between the two sensors. Compared with the single-sensor measurement, the dual-sensor measurement algorithm is more accurate and can improve the reliability of long-term monitoring data. Finally, the experimental results show that the dam subsidence monitoring system proposed in this paper fully meets the engineering monitoring accuracy needs, and the dual-sensor collaborative measurement system is more stable than the single-sensor monitoring system.

For accurately analysing and forecasting the social networks of China's political, economic and social power elites, it is necessary to develop a database that collates their information. The development of such a database involves three stages: data definition, data collection and data quality maintenance. The present study recommends distinctive solutions in overcoming the challenges that occur in existing comparable databases. We used organizational and event factors to identify the Chinese power elites to be included in the database, and used their memberships, social relations and interactions in combination with flows data collection methodologies to determine the associations between them. The system can be used to determine the optimal relationship path (i.e., the shortest path) to reach a target elite and to identify of the most important power elite in a social network (e.g., degree, closeness and eigenvector centrality) or a community (e.g., a clique or a cluster). We have used three social network analysis tools (i.e., R, UCINET and NetMiner) in order to find the important nodes in the network. We compared the results of centrality rankings of each tool. We found that all three tools are providing slightly different results of centrality. This is because different tools use different algorithms and even within the same tool there are various libraries which provide the same functionality (i.e., ggraph, igraph and sna in R that provide the different function to calculate centrality). As there are chances that the results may not be the same (i.e. centrality rankings indicating the most important nodes can be varied), we recommend a comparison test using different tools to get accurate results.

Covid-19 pandemic required all the world to use internet more actively. As a result, individuals and businesses are more open to digital threats. In order to provide security within the network, firewalls should be used. Firewalls act as a gateway between the corporate and the external networks. Therefore, it is more important than ever to choose the right firewall for each network. In this study, a new linear decision making model is proposed in order to find out the most suitable firewall and the estimates are completed according to this new model. Also, this model is compared with multi-objective optimization on the basis of ratio analysis (MOORA) method. This study distinguishes from other studies by proposing a new solution which ranks the firewall alternatives using linear and MOORA approaches. These approaches are used in many fields before but not in information technologies. Thus, this study can be considered quite innovative in terms of the problem it handles and the approaches used. It offers up-to-date and practical suggestions related to a decision making problem that has not been previously studied in the literature.

The detection of bolts is an important task in high-speed train inspection systems, and it is frequently performed to ensure the safety of trains. The difficulty of the vision-based bolt inspection system lies in small sample defect detection, which makes the end-to-end network ineffective. In this paper, the problem is resolved in two stages, which includes the detection network and cascaded classification networks. For small bolt detection, all bolts including defective bolts and normal bolts are put together for conducting annotation training, a new loss function and a new boundingbox selection based on the smallest axis-aligned convex set are proposed. These allow YOLOv3 network to obtain the accurate position and bounding box of the various bolts. The average precision has been greatly improved on PASCAL VOC, MS COCO and actual data set. After that, the Siamese network is employed for estimating the status of the bolts. Using the convolutional Siamese network, we are able to get strong results on few-shot classification. Extensive experiments and comparisons on actual data set show that the system outperforms state-of-the-art algorithms in bolt inspection.

Fintech, which stands for financial technology, is growing fast globally since the economic crisis hit the United States in 2008. Fintech companies are striving to secure a competitive advantage over existing financial services by providing efficient financial services utilizing the latest technologies. Fintech companies can be classified into several areas according to their business solutions. Among the Fintech sector, peer-to-peer (P2P) lending companies are leading the domestic Fintech industry. P2P lending is a method of lending funds directly to individuals or businesses without an official financial institution participating as an intermediary in the transaction. The rapid growth of P2P lending companies has now reached a level that threatens secondary financial markets. However, as the growth rate increases, so does the potential risk factor. In addition to government laws to protect and regulate P2P lending, further measures to reduce the risk of P2P lending accidents have yet to keep up with the pace of market growth. Since most P2P lenders do not implement their own credit rating system, they rely on personal credit scores provided by credit rating agencies such as the NICE credit information service in Korea. However, it is hard for P2P lending companies to figure out the intentional loan default of the borrower since most borrowers' credit scores are not excellent. This study analyzed the voices of telephone conversation between the loan consultant and the borrower in order to verify if it is applicable to determine the personal credit score. Experimental results show that the change in pitch frequency and change in voice pitch frequency can be reliably identified, and this difference can be used to predict the loan defaults or use it to determine the underlying default risk. It has also been shown that parameters extracted from sample voice data can be used as a determinant for classifying the level of personal credit ratings.

Texture synthesis technology has the advantages of repairing texture and structure at the same time. However, during the filling process, the size of the patch is fixed, and the content of the filling is not fully considered. In order to be able to adaptively change the patch size, we used the exemplar-based inpainting technique as the test algorithm, considering the image structure and texture, calculated the image structure patch size and texture patch size, and comprehensively determined the image patch size. This can adaptively change the patch size according to the filling content. In addition, we use multi-layer images to calculate the priority, so that the order of image repair was more stable. The proposed repair algorithm is compared with other image repair algorithms. The experimental results showed that the proposed adaptive image repair algorithm can better repair the texture and structure of the image, which proved the effectiveness of the proposed algorithm.

Video action recognition is widely used in video surveillance, behavior detection, human-computer interaction, medically assisted diagnosis and motion analysis. However, video action recognition can be disturbed by many factors, such as background, illumination and so on. Two-stream convolutional neural network uses the video spatial and temporal models to train separately, and performs fusion at the output end. The multi segment Two-Stream convolutional neural network model trains temporal and spatial information from the video to extract their feature and fuse them, then determine the category of video action. Google Xception model and the transfer learning is adopted in this paper, and the Xception model which trained on ImageNet is used as the initial weight. It greatly overcomes the problem of model underfitting caused by insufficient video behavior dataset, and it can effectively reduce the influence of various factors in the video. This way also greatly improves the accuracy and reduces the training time. What's more, to make up for the shortage of dataset, the kinetics400 dataset was used for pre-training, which greatly improved the accuracy of the model. In this applied research, through continuous efforts, the expected goal is basically achieved, and according to the study and research, the design of the original dual-flow model is improved.

In recent years, facial attribute editing has been successfully used to effectively change face images of various attributes based on generative adversarial networks and encoder-decoder models. However, existing models have a limitation in that they may change an unintended part in the process of changing an attribute or may generate an unnatural result. In this paper, we propose a model that improves the learning of the attention mask by adding a spatial attention mechanism based on the unified selective transfer network (referred to as STGAN) using semi-supervised learning. The proposed model can edit multiple attributes while preserving details independent of the attributes being edited. This study makes two main contributions to the literature. First, we propose an encoder-decoder model structure that learns and edits multiple facial attributes and suppresses distortion using an attention mask. Second, we define guide masks and propose a method and an objective function that use the guide masks for multiple facial attribute editing through semi-supervised learning. Through qualitative and quantitative evaluations of the experimental results, the proposed method was proven to yield improved results that preserve the image details by suppressing unintended changes than existing methods.

Indian herbal plants are used in agriculture and in the food, cosmetics, and pharmaceutical industries. Laboratory-based tests are routinely used to identify and classify similar herb species by analyzing their internal cell structures. In this paper, we have applied computer vision techniques to do the same. The original leaf image was preprocessed using the Chan-Vese active contour segmentation algorithm to efface the background from the image by setting the contraction bias as (v) -1 and smoothing factor (µ) as 0.5, and bringing the initial contour close to the image boundary. Thereafter the segmented grayscale image was fed to a leaky capacitance fired neuron model (LCFN), which differentiates between similar herbs by combining different groups of pixels in the leaf image. The LFCN's decay constant (f), decay constant (g) and threshold (h) parameters were empirically assigned as 0.7, 0.6 and h=18 to generate the 1D feature vector. The LCFN time sequence identified the internal leaf structure at different iterations. Our proposed framework was tested against newly collected herbal species of natural images, geometrically variant images in terms of size, orientation and position. The 1D sequence and shape features of aloe, betel, Indian borage, bittergourd, grape, insulin herb, guava, mango, nilavembu, nithiyakalyani, sweet basil and pomegranate were fed into the 5-fold Bayesian regularization neural network (BRNN), K-nearest neighbors (KNN), support vector machine (SVM), and ensemble classifier to obtain the highest classification accuracy of 91.19%.

At present, deep convolution network-based salient object detection (SOD) has achieved impressive performance. However, it is still a challenging problem to make full use of the multi-scale information of the extracted features and which appropriate feature fusion method is adopted to process feature mapping. In this paper, we propose a new adjacency auxiliary network (AANet) based on multi-scale feature fusion for SOD. Firstly, we design the parallel connection feature enhancement module (PFEM) for each layer of feature extraction, which improves the feature density by connecting different dilated convolution branches in parallel, and add channel attention flow to fully extract the context information of features. Then the adjacent layer features with close degree of abstraction but different characteristic properties are fused through the adjacent auxiliary module (AAM) to eliminate the ambiguity and noise of the features. Besides, in order to refine the features effectively to get more accurate object boundaries, we design adjacency decoder (AAM_D) based on adjacency auxiliary module (AAM), which concatenates the features of adjacent layers, extracts their spatial attention, and then combines them with the output of AAM. The outputs of AAM_D features with semantic information and spatial detail obtained from each feature are used as salient prediction maps for multi-level feature joint supervising. Experiment results on six benchmark SOD datasets demonstrate that the proposed method outperforms similar previous methods.

This study investigates open-source dynamic XSS filters used as security devices in web applications to account for the effectiveness of filters in protecting against XSS attacks. The experiment involves twelve representative filters, which are examined individually by placing them into the final output function of a custom-built single-input-form web application. To assess the effectiveness of the filters in their tasks of sanitizing XSS payloads and in preserving benign payloads, a black-box testing method is applied using an automated XSS testing framework. The result in working with malicious and benign payloads shows an important trade-off in the filters' tasks. Because the filters that only check for dangerous or safe elements, they seem to neglect to validate their values. As some safe values are mistreated as dangerous elements, their benign payload function is lost in the way. For the filters to be more effective, it is suggested that they should be able to validate the respective values of malicious and benign payloads; thus, minimizing the trade-off. This particular assessment of XSS filters provides important insight regarding the filters that can be used to mitigate threats, including the possible configurations to improve them in handling both malicious and benign payloads.

With the rapid development of science and technology, several high-performance networks have emerged with various new applications. Consequently, financially or socially motivated attacks on specific networks have also steadily become more complicated and sophisticated. To reduce the damage caused by such attacks, administration of network traffic flow in real-time and precise analysis of past attack traffic have become imperative. Although various traffic analysis methods have been studied recently, they continue to suffer from performance limitations and are generally too complicated to apply in existing systems. To address this problem, we propose a method to calculate the correlation between the malicious and normal flows and classify attack traffics based on the corresponding correlation values. In order to evaluate the performance of the proposed method, we conducted several experiments using examples of real malicious traffic and normal traffic. The evaluation was performed with respect to three metrics: recall, precision, and f-measure. The experimental results verified high performance of the proposed method with respect to first two metrics.

Most secure solutions like cryptography are software based and they are designed to mainly deal with the outside attacks for traditional networks, but such soft security is hard to be implemented in wireless sensor networks to counter the inside attacks from internal malicious nodes. To address this issue, reputation has been introduced to tackle the inside malicious nodes. Reputation is essentially a stimulating mechanism for nodes' cooperation and is employed to detect node misbehaviors and improve the trust-worthiness between individual nodes. Among the reputation models, binomial distribution based reputation has many advantages such as light weight and ease of implementation in resource-constraint sensor nodes, and accordingly researchers have proposed many insightful related methods. However, some of them either directly use the modelling results, apply the models through simple modifications, or only use the required components while ignoring the others as an integral part of the whole model, this topic still lacks a comprehensive and systematical review. Thus the motivation of this study is to provide a thorough survey concerning each detailed functional components of binomial distribution based reputation for wireless sensor networks. In addition, based on the survey results, we also argue some open research problems and suggest the directions that are worth future efforts. We believe that this study is helpful to better understanding the reputation modeling mechanism and its components for wireless sensor networks, and can further attract more related future studies.

MILP-based automatic search is the most common method in analyzing the security of cryptographic algorithms. However, this method brings many issues such as low efficiency due to the large size of the model, and the difficulty in finding the contradiction of the impossible differential distinguisher. To analyze the security of ESF algorithm, this paper introduces a simplified MILP-based search model of the differential distinguisher by reducing constrains of XOR and S-box operations, and variables by combining cyclic shift with its adjacent operations. Also, a new method to find contradictions of the impossible differential distinguisher is proposed by introducing temporary variables, which can avoid wrong and miss selection of contradictions. Based on a 9-round impossible differential distinguisher, 15-round attack of ESF can be achieved by extending forward and backward 3-round in single-key setting. Compared with existing results, the exact lower bound of differential active S-boxes in single-key setting for 10-round ESF are improved. Also, 2108 9-round impossible differential distinguishers in single-key setting and 14 12-round impossible differential distinguishers in related-key setting are obtained. Especially, the round of the discovered impossible differential distinguisher in related-key setting is the highest, and compared with the previous results, this attack achieves the highest round number in single-key setting.

The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

As an essential part of the urban transportation system, precise perception of the traffic flow parameters at the traffic signal intersection ensures traffic safety and fully improves the intersection's capacity. Traditional detection methods of road traffic flow parameter can be divided into the micro and the macro. The microscopic detection methods include geomagnetic induction coil technology, aerial detection technology based on the unmanned aerial vehicles (UAV) and camera video detection technology based on the fixed scene. The macroscopic detection methods include floating car data analysis technology. All the above methods have their advantages and disadvantages. Recently, indoor location methods based on wireless signals have attracted wide attention due to their applicability and low cost. This paper extends the wireless signal indoor location method to the outdoor intersection scene for traffic flow parameter estimation. In this paper, the detection scene is constructed at the intersection based on the received signal strength indication (RSSI) ranging technology extracted from the wireless signal. We extracted the RSSI data from the wireless signals sent to the road side unit (RSU) by the vehicle nodes, calibrated the RSSI ranging model, and finally obtained the traffic flow parameters of the intersection entrance road. We measured the average speed of traffic flow through multiple simulation experiments, the trajectory of traffic flow, and the spatiotemporal map at a single intersection inlet. Finally, we obtained the queue length of the inlet lane at the intersection. The simulation results of the experiment show that the RSSI ranging positioning method based on wireless signals can accurately estimate the traffic flow parameters at the intersection, which also provides a foundation for accurately estimating the traffic flow state in the future era of the Internet of Vehicles.