Fast-flucos:malicious domain name detection method for Fast-flux based on DNS traffic by Chunyu HAN, Yongzheng ZHANG, Yu ZHANG

“…There are three weaknesses in previous Fast-flux domain name detection method on the aspects of stability,targeting,and applicability to common real-world DNS traffic environment.For this,a method based on DNS traffic,called Fast-flucos was proposed.Firstly,the traffic anomaly filtering and association matching algorithms were used for improving detection stability.Secondly,the features,quantified geographical width,country list,and time list,were applied for better targeting Fast-flux domains.Lastly,the feature extraction were finished by the more suitable samples for trying to adapt to common real-world DNS traffic.Several machine learning algorithms including deep learning are tried for determining the best classifier and feature combination.The experimental result based on real-world DNS traffic shows that Fast-flucos’ recall rate is 0.998 6,precision is 0.976 7,and ROC_AUC is 0.992 9,which are all better than the current main stream approaches,such as EXPOSURE,GRADE and AAGD.…”
Get full text

Fasting for male fertility—a mixed methods study by Katharina T. May, Jocelyn Behling, Katharina Sochiera-Plegniere, Katharina Batschari, Christian S. Kessler, Christian S. Kessler, Christian S. Kessler, Andreas Michalsen, Andreas Michalsen, Farid I. Kandil, Sarah B. Blakeslee, Michael Jeitler, Michael Jeitler, Michael Jeitler, Wiebke Stritter, Daniela A. Koppold, Daniela A. Koppold, Daniela A. Koppold

“…This study aimed at investigating feasibility and effects of a Fasting Mimicking Diet (FMD) in the context of male subfertility.Materials and methodsIn this two-arm, randomized, controlled, exploratory mixed methods study men with impaired sperm quality were randomized into a fasting and a waiting-list control group. …”
Get full text

Fast and live virtual machine migration in data center networks by Teng MA, Yuxiang HU

“…In data center networks,virtual machine live migration causes large volume of data transfer on core links of the network,which leads to performance degradation of the baring application and other background services.Based on inheriting the existing memory page de-duplication technique,a new search structure was presented composed of a counting Bloom filter with each bucket pointing to a link list,which overcame the problem of false positive of memory page lookup.Furthermore,a pruned algorithm was proposed to reduce the length of each link list and accelerate the lookup as much as possible to accomplish live and fast virtual machine migration in rack level.Experiment results show that the proposed method transfers less data on core links,takes less time to finish migration,and decreases the degradation of network applications caused by migration.…”
Get full text

Gas-Cooled Fast Reactor: A Historical Overview and Future Outlook by W. F. G. van Rooijen

“…A review is given of developments in the area of Gas-Cooled Fast Reactors (GCFR) in the period from roughly 1960 until 1980. …”
Get full text

Fast approximation of the top‐k items in data streams using FPGAs by Ali Ebrahim, Jalal Khalifat

Get full text

A Method for Fast Leaderboard Calculations in Massive Online Game-Based Environments by Julian Moreno Cadavid, Hernán Darío Vanegas Madrigal

“…It is based on two particular data structures, a Self-Balanced Ordering Statistic Tree and a hash table, to perform proper leaderboard calculations in a fast and cheap way. More specifically, our proposal has O(log2⁡N) time complexity, whereas other approaches also based on in-memory data structures like linked lists have O(N), and others based on Hard Disk Drive operations like a relational database have O(Nlog2⁡N). …”
Get full text

Fast IEEE802.1Qbv Gate Scheduling Through Integer Linear Programming by Alitzel Galilea Torres-Macias, Juan Segarra Flor, Jose Luis Briz Velasco, Antonio Ramirez-Trevino, Hector Blanco-Alcaine

Get full text

A fast VVC intra-coding algorithm based on graph neural network and statistical analysis by LI Tiansong, LIU Haokun, CUI Shaoguo, LIU Shucen, CHEN Yan, WANG Hongkui

“…An efficient graph neural network model was used to directly predict the optimal partition mode of CU, thus skipping redundant CU partition traversal. Secondly, a fast algorithm for intra-frame mode selection based on spatial correlation and texture features was proposed. …”
Get full text

The use of BirdNET embeddings as a fast solution to find novel sound classes in audio recordings by Slade Allen-Ankins, Sebastian Hoefer, Jacopo Bartholomew, Sheryn Brodie, Lin Schwarzkopf

Get full text

Ultra-fast [18F]florbetapir PET imaging using the uMI Panorama PET/CT system by Xueqian Yang, Meiqi Wu, Menglin Liang, Haiqiong Zhang, Bo Li, Chenhui Mao, Liling Dong, Yuan Wang, Haiqun Xing, Chao Ren, Zhenghai Huang, Qingxiang Wen, Qi Ge, Zhengqing Yu, Feng Feng, Jing Gao, Li Huo

“…Comparisons of image quality and Aβ detectability between various fast scan groups and G10min group were conducted. …”
Get full text

Research on incremental deployment mechanism of network modality for polymorphic network environment by Jiong LI, Yuxiang HU, Pengshuai CUI, Le TIAN, Yongji DONG

“…Polymorphic networks support diverse network requirements and can coexist, evolve, and change on a unified physical or logical infrastructure in the form of network modality.They can maximize the innovation vitality of network technology driven by new applications.The evolution and development of modality require the incremental deployment of modality to meet the needs of convenience and privacy protection in the multi-user deployment process.However, the deployment of current network functions still uses the one-by-one deployment method, resulting in high complexity of the deployment of new modality, and mutual exposure of processing logic between different users.To address these issues, an incremental deployment mechanism for polymorphic network environments was proposed.Firstly, an incremental deployment mechanism for network modality was designed.Then, the incremental deployment of modality was abstracted as a graph merging problem based on this mechanism, and an adjacency list-based merge parsing graph algorithm was designed.The simulation results indicate that the proposed mechanism can achieve fast and correct merging of network modality, support incremental modality deployment, and greatly reduce the application deployment and service provision threshold of new network systems.…”
Get full text

Design of High-Speed Multiway Merge Sorting Networks Using Fast Single-Stage N-Sorters and N-Filters by Robert B. Kent, Marios S. Pattichis

Get full text

Research and practice of SRv6 for integrated carrying of video cloud by Chongfeng XIE, Wenjie JIANG, Chenhao MA, Hao YAN, Sifei WANG, Cong LI, Yunqing CHEN

“…SRv6 is newly emerging,source routing-based technology,which aims to realize network programmability by steering a packet through an ordered list of instructions in the IPv6 extension header,so as to meet multiple requirements,such as fast service provisioning.Based on the field trial of SRv6 in the production network in Sichuan province,the SRv6 solution for integration the video clouds in multi-domain networks was illustrated,which had shown the advantages of SRv6 in service agility,secure separation,bandwidth elasticity and inter-domain deployment.In addition,the challenges of SRv6 were listed and development policy was given in the end.…”
Get full text

Global Alignment of Pairwise Protein Interaction Networks for Maximal Common Conserved Patterns by Wenhong Tian, Nagiza F. Samatova

“…In view of this, we introduce a connected-components based fast algorithm, HopeMap, for network alignment. Observing that the size of true orthologs across species is small comparing to the total number of proteins in all species, we take a different approach based on a precompiled list of homologs identified by KO terms. …”
Get full text

Raising the Quality of Spesialists’ Training: the Procedure Selection by M. N. Oskina

“…At the time of educational system reorganization, the higher school’s fast response to the changing personal, labor market and society demands becomes even more relevant. …”
Get full text

3G Long Term Evolution Baseband Processing with Application-Specific Processors by Perttu Salmela, Juho Antikainen, Teemu Pitkänen, Olli Silvén, Jarmo Takala

“…In this study, the software defined radio (SDR) is targeted and the four essential baseband functions of the 3G LTE receiver, namely, list sphere decoding, fast Fourier transform, QR decomposition, and turbo decoding, are addressed and the functions are implemented as application specific processors (ASPs). …”
Get full text

Automatized Calculating System for a Ketogenic Diet: CETORAP by Ligia M. Marcos Plasencia, Edelsia Rojas Massipe, Amarilis Barbié Rubiera

“…<strong>Objective:</strong> To create a reliable and fast method to accelerate the bothersome and lingerie calculations of the necessary recommendations for a ketogenic diet. …”
Get full text