Design of campus network terminal positioning system based on topology discovery by YU Bo, HU Donghui, TANG Linchun

“…Based on the proposed algorithm, the approach was proposed and carried out with program design, which could position campus network terminal fast, using the SNMP protocol and database. Theoretical analysis and practical application indicate that the algorithm of topology discovery is simple and efficient, and the terminal positioning system is fast and accuracy.…”
Get full text

Evaluating a distance function by Abgrall, Rémi

“…There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation of Hamilton Jacobi problems, or the fast sweeping method. Here we make a link with some elliptic problem and propose a very fast way to approximate the distance function.…”
Get full text

Evaluation the Effect of different Cooling Cycles on the Hardness Surface of the Conventional Feldspathic Zirconia by Shahad Hazim Ali, Lateef Essa Alwan, Abdul Kareem J. Al-Azzawi

“…The goals of this study is to assess the impact of diverse cooling cycles (slow cooling – fast cooling) on the surface hardness of the Zirconia (VM9). …”
Get full text

Ink Art Three-Dimensional Big Data Three-Dimensional Display Index Prediction Model by Xiaonan Cao

“…High efficiency is achieved in virtual reality scenes, and the multiresolution fast rendering method better maintains the appearance of the prediction model without major deformation.…”
Get full text

Analysis for the Effect of Spatial Discretization Method on AP1000 Reactor Pressure Vessel Fluence Calculation by Junxiao Zheng, Bin Zhang, Shengchun Shi, Yixue Chen

“…To estimate the structural integrity over the designed lifetime and to support analyses for a potential plant life extension, an accurate calculation of the fast neutron fluence (E>1.0 MeV or E>0.1 MeV) at the RPV is significant. …”
Get full text

Production technologies and formulation strategies in development of orodispersible tablets (ODTs) by Stevche Acevski, Angela Mircevska, Marija Glavas Dodov

“…ODTs come with many advantages such as: easy swallowability especially for paediatric, geriatric and bedridden patients, аs well as for people with lack of access to water; fast release of API and fast onset of action; and enhanced bioavailability. …”
Get full text

Navigating global fashion policy: labor, environment, and future directions for sustainability by Meital Peleg Mizrachi

“…These complexities are exemplified by the shift from Europe-led fast fashion to China-driven ultra-fast fashion. …”
Get full text

Safety Assessment of Glucose-Lowering Drugs and Importance of Structured Education during Ramadan: A Systematic Review and Meta-Analysis by Rashmi Shiju, Ayesha Akhil, Smitha Thankachan, Jaakko Tuomilehto, Monira Al Arouj, Abdullah Bennakhi

“…Although patients with poor glycemic control and on multiple insulin injections are at high risk and exempt from fasting, many still insist on it. Thus, healthcare professionals play a pivotal role in managing diabetes-related complications in patients who fast during Ramadan. …”
Get full text

基于透视不变二值特征描述子的图像匹配算法 by Li-chuan GENG, Song-zhi SU, Shao-zi LI

“…Current local feature based image matching algorithms are usually less robust to image perspective transformation.Aiming to solve this problem，a new perspective invariant binary code (PIBC) based image matching algorithm is proposed.Firstly，FAST corners are detected on the pyramid images，those corners with non-maximum Harris corner response value and the edge points are further eliminated.And then，by simulating the perspective transformations of images taken from different viewpoints，a single FAST corner is described with binary descriptors under different viewpoint transformations，which makes the descriptor could describe the identical feature point on different perspective transform images.Experimental results show its robustness to image perspective transformation，while its complexity is similar with SURF.…”
Get full text

Research on routing scheduling technology of computing power network by Ran PANG, Xinxin YI, Liang XIN, Chang CAO, Xiongyan TANG

“…With the needs of high-quality development of the digital economy, the research on computing power network is accelerating.How to realize the integrated scheduling of computing resources and network resources becomes the primary challenge for computing power network.The evolution of computing power network was introduced, the resource awaring and routing scheduling technology of computing power network were analyzed, and a hybrid routing scheduling solution for computing power network was proposed to realize the ability of flexible on-demand, fast routing and easy implementation.The implementation process of the hybrid routing scheduling solution in the remote driving scenario of the Internet of vehicles was introduced, which supported the provision of differentiated services integrating computing and networking and fast tuning when the vehicle was moving.…”
Get full text

Low-complexity massive MIMO channel estimation for mmWave systems via matrix completion by Jiafeng QIU

“…Due to the high computational complexity of mmWave massive MIMO systems realizing reliable channel estimation,a low-complexity mmWave beamspace channel estimation algorithm was proposed utilizing the inherent low-rank of the mmWave channel.The proposed algorithm jointly exploited the channel sparsity in the beamspace domain and its low-rank property in the antenna domain to provide more accurate recovery,especially for shorter training intervals.By regarding the channel estimation as matrix completion problem,the proposed algorithm was based on the alternating direction method of multipliers with fast convergence properties and exploited fast randomized singular value thresholding to significantly reduce the corresponding complexity.The simulation result shows that the proposed algorithm can achieve satisfactory channel estimation performance while maintaining low complexity.…”
Get full text

Global Existence and Blowup Analysis to Single-Species Bacillus System with Free Boundary by Zhi Ling, Zhigui Lin

“…Finally we examine the long time behavior of global solutions; the global fast solution and slow solution are given. Our results show that blowup occurs if the death rate is small and the initial value is large enough. …”
Get full text

Averaging Principles for Nonautonomous Two-Time-Scale Stochastic Reaction-Diffusion Equations with Jump by Yong Xu, Ruifang Wang

“…In this paper, we aim to develop the averaging principle for a slow-fast system of stochastic reaction-diffusion equations driven by Poisson random measures. …”
Get full text

Least Square Homotopy Perturbation Method for Ordinary Differential Equations by Mubashir Qayyum, Imbsat Oscar

Get full text

Deterministic Annealing Approach to Fuzzy C-Means Clustering Based on Entropy Maximization by Makoto Yasuda

“…After that, both the Shannon- and Tsallis-entropy-based FCMs are formulated as DA clustering using the very fast annealing (VFA) method as a cooling schedule. …”
Get full text

Intra-Skip in Inter-Frame Coding of H.264/AVC by Hui Su

“…The critical advantage of this proposed scheme most emphasized on is that it can optimize H.264 encoder in conjunction with any proposed fast inter- and intra-methods which are focusing on inter-partition mode decision, motion search algorithms, and fast intra-algorithms.…”
Get full text

Biological rhythm, sleep quality and functionality in the euthymic period in patients diagnosed with bipolar disorder by Mehmet Baltaci̇oglu, Meltem Pusuroglu

“…The patient group's FAST total score (p [Med-Science 2024; 13(4.000): 942-8]…”
Get full text

Some Applications of (𝐶0,1)-Semigroups by Yu-Hsien Chang, Cheng-hong Hong

“…This study is originally motivated by the thermal balance equations for the gas and solid interphase heat-transfer for the fast-igniting catalytic converter of automobiles. …”
Get full text

Complex network clustering algorithm based on Jordan-form of Laplace-matrix by Jian-wei NIU, Bin DAI, Chao TONG, Guan-ying HUO, Jing PENG

“…Among existing clustering algorithms,the graph-Laplacian-based spectrum clustering algorithm has rigorous theoretical basis and high accuracy.However,the application of this algorithm is limited by its dependence on the prior knowledge,such as the number and the size of clusters.Based on the Jordan form of graph Laplacian,an algorithm was proposed which can obtain the prior knowledge,and perform the primary clustering based on the eigenvalues of the Jordan form.The modularity density function of clusters was defined,and an improved spectrum clustering algorithm with the help of the function and the primary clustering was proposed.The experiments were conducted on diverse datasets showing that,compared with the classic algorithms such as Fast-Newman and Girvan-Newman,the algorithm can reach a high clustering accuracy and a fast convergence rate.…”
Get full text

Multi-level feedback based time synchronization algorithm for wireless sensor networks by HUANGFU Wei1, ZHOU Xin-yun1, CHEN Can-feng3

“…Aiming at the fast and efficient time synchronization protocol for the wireless sensor networks under resource constraints, a novel feedback-based full-scale time synchronization（FTS） algorithm was proposed.The basic idea of FTS is to execute iteratively time synchronization downlink operations on all the nodes of the wireless sensor network and collect the two-way path delay information from only a part of nodes to calculate the average delay adjustment per hop.The stochastically feedback scheme is adopted to reduce the uplink packets.The FTS algorithm also consists of the mechanisms of synchronization error monitoring and clock skew correction.The FTS was implemented on the popular TelosB sensor nodes from UC Berkeley.The experiments show that FTS is a fast, resource-efficient algorithm with ra-tional synchronization precision.…”
Get full text