A new fast motion estimation algorithm using fast mode decision for high-efficiency video coding standard

High-efficiency video coding is the latest standardization effort of the International Organization for Standardization and the International Telecommunication Union. This new standard adopts an exhaustive algorithm of decision based on a recursive quad-tree structured coding unit, prediction unit, and transform unit. Consequently, an important coding efficiency may be achieved. However, a significant computational complexity is resulted. To speed up the encoding process, efficient algorithms based on fast mode decision and optimized motion estimation were adopted in this paper. The aim was to reduce the complexity of the motion estimation algorithm by modifying its search pattern. Then, it was combined with a new fast mode decision algorithm to further improve the coding efficiency. Experimental results show a significant speedup in terms of encoding time and bit-rate saving with tolerable quality degradation. In fact, the proposed algorithm permits a main reduction that can reach up to 75 % in encoding time. This improvement is accompanied with an average PSNR loss of 0.12 dB and a decrease by 0.5 % in terms of bit-rate.     

Optimal Deep Learning Based Intruder Identification in Industrial Internet of Things Environment

With the increased advancements of smart industries, cybersecurity has become a vital growth factor in the success of industrial transformation. The Industrial Internet of Things (IIoT) or Industry 4.0 has revolutionized the concepts of manufacturing and production altogether. In industry 4.0, powerful Intrusion Detection Systems (IDS) play a significant role in ensuring network security. Though various intrusion detection techniques have been developed so far, it is challenging to protect the intricate data of networks. This is because conventional Machine Learning (ML) approaches are inadequate and insufficient to address the demands of dynamic IIoT networks. Further, the existing Deep Learning (DL) can be employed to identify anonymous intrusions. Therefore, the current study proposes a Hunger Games Search Optimization with Deep Learning-Driven Intrusion Detection (HGSODL-ID) model for the IIoT environment. The presented HGSODL-ID model exploits the linear normalization approach to transform the input data into a useful format. The HGSO algorithm is employed for Feature Selection (HGSO-FS) to reduce the curse of dimensionality. Moreover, Sparrow Search Optimization (SSO) is utilized with a Graph Convolutional Network (GCN) to classify and identify intrusions in the network. Finally, the SSO technique is exploited to fine-tune the hyper-parameters involved in the GCN model. The proposed HGSODL-ID model was experimentally validated using a benchmark dataset, and the results confirmed the superiority of the proposed HGSODL-ID method over recent approaches.     

Detection of Abnormal Activities from Various Signals Based on Statistical Analysis

We perceive big data with massive datasets of complex and variegated structures in the modern era. Such attributes formulate hindrances while analyzing and storing the data to generate apt aftermaths. Privacy and security are the colossal perturb in the domain space of extensive data analysis. In this paper, our foremost priority is the computing technologies that focus on big data, IoT (Internet of Things), Cloud Computing, Blockchain, and fog computing. Among these, Cloud Computing follows the role of providing on-demand services to their customers by optimizing the cost factor. AWS, Azure, Google Cloud are the major cloud providers today. Fog computing offers new insights into the extension of cloud computing systems by procuring services to the edges of the network. In collaboration with multiple technologies, the Internet of Things takes this into effect, which solves the labyrinth of dealing with advanced services considering its significance in varied application domains. The Blockchain is a dataset that entertains many applications ranging from the fields of crypto-currency to smart contracts. The prospect of this research paper is to present the critical analysis and review it under the umbrella of existing extensive data systems. In this paper, we attend to critics' reviews and address the existing threats to the security of extensive data systems. Moreover, we scrutinize the security attacks on computing systems based upon Cloud, Blockchain, IoT, and fog. This paper lucidly illustrates the different threat behaviour and their impacts on complementary computational technologies. The authors have mooted a precise analysis of cloud-based technologies and discussed their defense mechanism and the security issues of mobile healthcare.

     

Fluid Simulation with Articulated Bodies

We present an algorithm for creating realistic animations of characters that are swimming through fluids. Our approach combines dynamic simulation with data-driven kinematic motions (motion capture data) to produce realistic animation in a fluid. The interaction of the articulated body with the fluid is performed by incorporating joint constraints with rigid animation and by extending a solid/fluid coupling method to handle articulated chains. Our solver takes as input the current state of the simulation and calculates the angular and linear accelerations of the connected bodies needed to match a particular motion sequence for the articulated body. These accelerations are used to estimate the forces and torques that are then applied to each joint. Based on this approach, we demonstrate simulated swimming results for a variety of different strokes, including crawl, backstroke, breaststroke, and butterfly. The ability to have articulated bodies interact with fluids also allows us to generate simulations of simple water creatures that are driven by simple controllers.     

Online collaboration: Collaborative behavior patterns and factors affecting globally distributed team performance

Studying the collaborative behavior of online learning teams and how this behavior is related to communication mode and task type is a complex process. Research about small group learning suggests that a higher percentage of social interactions occur in synchronous rather than asynchronous mode, and that students spend more time in task-oriented interaction in asynchronous discussions than in synchronous mode. This study analyzed the collaborative interaction patterns of global software development learning teams composed of students from Turkey, US, and Panama. Data collected from students’ chat histories and forum discussions from three global software development projects were collected and compared. Both qualitative and quantitative analysis methods were used to determine the differences between a group’s communication patterns in asynchronous versus synchronous communication mode. K-means clustering with the Ward method was used to investigate the patterns of behaviors in distributed teams. The results show that communication patterns are related to communication mode, the nature of the task, and the experience level of the leader. The paper also includes recommendations for building effective online collaborative teams and describes future research possibilities.     

Bilayer segmentation of webcam videos using tree-based classifiers

This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The frames are segmented into foreground and background layers that comprise a subject (participant) and other objects and individuals. The algorithm produces correct segmentations even in the presence of large background motion with a nearly stationary foreground. This research makes three key contributions: First, we introduce a novel motion representation, referred to as "motons," inspired by research in object recognition. Second, we propose estimating the segmentation likelihood from the spatial context of motion. The estimation is efficiently learned by random forests. Third, we introduce a general taxonomy of tree-based classifiers that facilitates both theoretical and experimental comparisons of several known classification algorithms and generates new ones. In our bilayer segmentation algorithm, diverse visual cues such as motion, motion context, color, contrast, and spatial priors are fused by means of a conditional random field (CRF) model. Segmentation is then achieved by binary min-cut. Experiments on many sequences of our videochat application demonstrate that our algorithm, which requires no initialization, is effective in a variety of scenes, and the segmentation results are comparable to those obtained by stereo systems.     

A new supervised classification algorithm in artificial immune systems with its application to carotid artery Doppler signals to diagnose atherosclerosis

Because of its self-regulating nature, immune system has been an inspiration source for usually unsupervised learning methods in classification applications of Artificial Immune Systems (AIS). But classification with supervision can bring some advantages to AIS like other classification systems. Indeed, there have been some studies, which have obtained reasonable results and include supervision in this branch of AIS. In this study, we have proposed a new supervised AIS named as Supervised Affinity Maturation Algorithm (SAMA) and have presented its performance results through applying it to diagnose atherosclerosis using carotid artery Doppler signals as a real-world medical classification problem. We have employed the maximum envelope of the carotid artery Doppler sonograms derived from Autoregressive (AR) method as an input of proposed classification system and reached a maximum average classification accuracy of 98.93% with 10-fold cross-validation method used in training-test portioning. To evaluate this result, comparison was done with Artificial Neural Networks and Decision Trees. Our system was found to be comparable with those systems, which are used effectively in literature with respect to classification accuracy and classification time. Effects of system's parameters were also analyzed in performance evaluation applications. With this study and other possible contributions to AIS, classification algorithms with effective performances can be developed and potential of AIS in classification can be further revealed.     

Combining docking, scoring and molecular field analyses to probe influenza neuraminidase-ligand interactions

In this project, several docking conditions, scoring functions and corresponding protein-aligned molecular field analysis (CoMFA) models were evaluated for a diverse set of neuraminidase (NA) inhibitors. To this end, a group of inhibitors were docked into the active site of NA. The docked structures were utilized to construct a corresponding protein-aligned CoMFA models by employing probe-based (H+, OH, CH3) energy grids and genetic partial least squares (G/PLS) statistical analysis. A total of 16 different docking configurations were evaluated, of which some succeeded in producing self-consistent and predictive CoMFA models. However, the best model coincided with docking the ionized ligands into the hydrated form of the binding site via PLP1 scoring function (r2LOO=0.735, r2PRESS against 24 test compounds=0.828). The highest-ranking CoMFA models were employed to probe NA-ligand interactions. Further validation by comparison with a co-crystallized ligand-NA crystallographic structure was performed. This combination of docking/scoring/CoMFA modeling provided interesting insights into the binding of different NA inhibitors.     

实时多处理器系统中基于能量节约的动态调度算法

当前处理器由于较高的能量消耗。导致处理器热量散发的提高及系统可靠性的降低，已经成为目前计算机领域较为关心的问题．然而目前一些有效降低能量消耗的技术大多针对单处理器系统，较少考虑多处理器系统．本文提出的调度算法针对多处理器系统，以最短任务优先调度为基础，结合其它有效技术，如共享空闲时间回收等，使得实时任务在其截止期内完成的同时能够有效地减低整个系统的能量消耗．针对独立任务集及具有依赖关系的任务集，本文提出两种算法：STFBA1及STFBA2（Shortest Task First—Based Algorithm）．与目前所知的有效算法相比，我们的算法具有更好的性能（调度长度及能量消耗）．     

基于任务同步及节能的实时调度算法

实时任务在实际应用中通常需要以独占方式访问共享资源, 但是由于资源的独占性导致高优先权任务运行时往往被低优先权任务阻塞, 从而产生优先权反转, 难以满足任务的实时性;同时当前处理器由于较高的能量消耗,导致处理器热量散发提高及系统可靠性降低, 已经成为目前计算机领域较为关心的问题.提出一种基于任务同步及节能的实时调度算法CSSFA,有效地解决了上述难题.CSSFA在满足任务实时可调度性及任务同步的条件下,固定临界区的运行速度,使更多的空闲时间用于非临界区部分,有效地降低了整体系统的能耗;同时也能避免高优先权任务被阻塞、临界区继承高优先权任务的速度时所造成的处理器电压开关的频繁切换, 因而能有效地降低实时任务调度的成本.试验测试表明,CSSFA在调度性能上明显优于目前所知的有效算法.