Performance evaluation of TCP congestion control algorithms in fast long distance network by Guo-dong WANG, Yong-mao REN, Jun LI

Subjects: “…fast long distance network…”
Get full text

A Fast Region-Based Segmentation Model with Gaussian Kernel of Fractional Order by Bo Chen, Qing-Hua Zou, Wen-Sheng Chen, Yan Li

Get full text

Variability among Physicians in Risk Stratification for People with Diabetes during Ramadan Fasting by Bachar Afandi, Mohamed Hassanein, Shehla Shaikh, Gamal Ibrahim, Monira Alarouj

Subjects: “…fasting…”
Get full text

The Fast and Accurate Method of Tuning of SISO Controllers Using Seven Performance Indexes by Stopakevych A.О., Stopakevych О.A.

“…The third task is to develop an algorithm for fast calculation of performance indicators in the range of all possible rational tuning of the controller for a given FOPDT plant model. …”
Get full text

X-Mapper: fast and accurate sequence alignment via gapped x-mers by Jeffry M. Gaston, Eric J. Alm, An-Ni Zhang

Get full text

Handover algorithm using fast DAD mechanism for hierarchical mobile IPv6 by CHEN Wei-xin, HAN Guo-dong, LIU Hong-bo, CAI Hui

“…To solve the problem that the duplicate address detection （DAD） in hierarchical mobile IPv6 （HMIPv6） links too time consuming, a handover algorithm based on fast DAD mechanism for HMIPv6 was proposed. By introducing the IP address allocation management （IAAM） module to establish the DAD-lookup and initiative address-generation mechanism, the proposed algorithm can greatly speed up the DAD course and be implemented easily. …”
Get full text

Fast assessment of the critical principal stress direction for multiple separated multiaxial loadings by M. Cova, P. Livieri, R. Tovo

“…A specifically fitted procedure was developed for a fast computation, at each node of a large FEM model, of the direction undergoing the maximum fatigue damage; the procedure is defined according to an effective stress definition based on the max principal stress amplitude and mean value. …”
Get full text

Fast and Simple LC-MS/MS Method for Rifampicin Quantification in Human Plasma by Žane Temova Rakuša, Robert Roškar, Anita Klančar Andrejc, Tina Trdan Lušin, Nataša Faganeli, Iztok Grabnar, Aleš Mrhar, Albin Kristl, Jurij Trontelj

“…A simple, fast, and cost-effective LC-MS/MS method for quantification of rifampicin in human plasma was developed and fully validated. …”
Get full text

A Fast Optimization Method for Reliability and Performance of Cloud Services Composition Application by Zhao Wu, Naixue Xiong, Yannong Huang, Qiong Gu, Chunyang Hu, Zhongbo Wu, Bo Hang

“…Then the reliability and performance definition based on universal generating function is proposed. Based on this, a fast reliability and performance optimization algorithm is presented. …”
Get full text

Utilization of Carbonized Wood from Tropical Fast-Growing Trees for Functional Materials by Joko Sulistyo, Toshimitsu Hata, Sri Nugroho Marsoem

Subjects: Get full text

Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor by Hidetoshi Takeshita, Sho Shimizu, Hiroyuki Ishikawa, Akifumi Watanabe, Yutaka Arakawa, Naoaki Yamanaka, Kosuke Shiba

“…It combines a new type of parallel data-flow processor with an architecture tuned for fast calculation. The replica placement problem is to find a replica-server set satisfying service constraints in a content delivery network (CDN). …”
Get full text

A Novel Fast Image Stitching Method Based on the Combination of SURF and Cell by Qing An, Xijiang Chen, Shusen Wu

Get full text

Fast Load Distribution Calculation for Cylindrical Gears with Non-Involute Tooth Profiles by Karsten Fetzer, Stefan Landler, Jonas-Frederick Berger, Michael Otto, Karsten Stahl

Get full text

Electromagnetic signal fast adversarial attack method based on Jacobian saliency map by Jian ZHANG, Xia ZHOU, Yiran ZHANG, Zicong WANG

“…In order to generate high-quality electromagnetic signal countermeasure examples, a fast Jacobian saliency map attack (FJSMA) method was proposed.The Jacobian matrix of the attack target class was calculated and feature saliency maps based on the matrix were generated, then the most salient feature points were iteratively selected and perturbations in their neighborhood were continuously added while introducing a single point perturbation constraint, finally adversarial examples were generated.Experimental results show that, compared with Jacobian saliency map attack method, FJSMA improves the generation speed by about 10 times while maintaining the same high attack success rate, and improves the similarity by more than 11%, and compared with other gradient-based methods, the attack success rate is improved by more than 20%, and the similarity is improved by 20% to 30%.…”
Get full text

A Fast CT Reconstruction Scheme for a General Multi-Core PC by Kai Zeng, Erwei Bai, Ge Wang

Get full text

Fast Matching Method of UAV Aerial Photography Enhanced Low Illumination Image by Wenyao Li, Guangqing Liu, Kuan Lu, Pengyun Chen, Junjie Cui, Mingrang Yu, Peng Shen

“…The relevant research findings and conclusions provide a fast and effective method for UAV image matching in different low illumination environments.…”
Get full text

Fast mode selection of intra prediction algorithm based on spatial and frequency analysis by Shu-bo ZHAN, Jian-bin SONG, Li MA, Fang-chun YANG

Get full text

Fast plasma production by intense femtosecond extreme ultraviolet and x-ray pulses by C. Fasolato, E. Stellino, F. Sacchetti, C. Petrillo

Get full text

Global Existence to an Attraction-Repulsion Chemotaxis Model with Fast Diffusion and Nonlinear Source by Yingjie Zhu, Fuzhong Cong

“…Such fast diffusion guarantees the global existence of solutions for any given initial value in a bounded domain. …”
Get full text

Bit-filling algorithm for fast subcarrier-selecting in ultrasonic through-metal communication by Linsen XU, Wei YANG, Hongxian TIAN, Tao WU

“…Aiming at the high complexity of the greedy bit-filling algorithm,a bit-filling algorithm for fast subcarrier-selecting used in ultrasonic through-metal communication was proposed.The approximate expression for the BER increment,which was used as the basis for selecting subcarriers in the greedy bit-filling algorithm,was derived by the BER approximation formula and Taylor formula.The subcarrier was selected first and then its BER was calculated.Therefore,it was unnecessary for the greedy bit-filling algorithm to calculate new BER of all subcarriers.The simulation results show that the proposed algorithm can achieve nearly the same data rate as the greedy bit-filling algorithm and save the BER calculation of about <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <mfrac> <mn>3</mn> <mn>4</mn> </mfrac> </math></inline-formula> subcarriers,greatly reducing the amount of calculation.…”
Get full text