A Compact Representation for 3D Animation Using Octrees and Affine Transformations by Youyou Wang, Guilherme N. DeSouza

“…In fact, we demonstrate a computation complexity of Θ(𝑛2) for our method, while some of these methods can reach complexities of 𝑂(𝑛3) and worse. …”
Get full text

A Comparative Analysis of Fractional Space-Time Advection-Dispersion Equation via Semi-Analytical Methods by Noufe H. Aljahdaly, Rasool Shah, Muhammed Naeem, Mohammad Asif Arefin

“…Researchers use a variety of numerical techniques to study such fractional models, but the nonlocality of the derivative having fractional order leads to high computation complexity and complex calculations, so the task is to find an efficient technique that requires less computation and provides greater accuracy when numerically solving such models. …”
Get full text

Interference Mitigation Based on Low Complexity Subspace Tracking Method for Vehicle Positioning by Ping Zhang, Qiang Wu, Binbin Jing

“…The proposed monitor is simple, efficient, and can decide when to start the interference mitigation procedure, which can reduce the computation complexity significantly; Subspace-based method is introduced to track the interference basis matrix that can be feed to RootMUSIC to detect the frequency of interference, followed by the interference mitigation with a notch filter. …”
Get full text

Sparse Deep Nonnegative Matrix Factorization by Zhenxing Guo, Shihua Zhang

“…We also analyzed the computing complexity of our frameworks to demonstrate their efficiency. …”
Get full text

A distributed scheme for energy-efficient event-based target recognition using Internet of Multimedia Things by Manal Alsabhan, Adel Soudani, Manan Almusallam

“…Some solutions presented in the literature, such as image compression, do not efficiently solve this problem because of the algorithms’ computational complexities. Thus, detecting the event of interest locally before the communication using shape-based descriptors would avoid useless data transmission and would extend the network lifetime. …”
Get full text

Robust H-Infinity Filter and PSO-SVM Based Monitoring of Power Quality Disturbances System by Prakash K. Ray, Harish Kumar Sahoo, Asit Mohanty, Javed Khan Bhutto, Abdulwasa Bakr Barnawi, Abdulmjeed Ali Alshaya

“…Twelve different statistical features are extracted by passing the disturbances through robust H-infinity filter in order to minimize the data size and computational complexities. The statistical properties of PQ disturbances are initially categorized using the Fast Generalized Fuzzy-C means (FGFCM) clustering approach. …”
Get full text

High Performance GPU-Based Fourier Volume Rendering by Marwan Abdellah, Ayman Eldeib, Amr Sharawi

“…As a result of its O(N2log⁡N) time complexity, it provides a faster alternative to spatial domain volume rendering algorithms that are O(N3) computationally complex. Relying on the Fourier projection-slice theorem, this technique operates on the spectral representation of a 3D volume instead of processing its spatial representation to generate attenuation-only projections that look like X-ray radiographs. …”
Get full text

Effect of Physically Realistic Potential Energy Form on Spatial Pattern Complexity in a Collective Motion Model by Austin M. Marcus, Hiroki Sayama

“…The particle model was simulated under a number of parameterizations of this generalized potential, and the average complexity of the spatial pattern produced by each was computed. Complexity was measured by tracking the information needed to describe the particle system at different scales (the complexity profile). …”
Get full text

Minimum-cost gateway placement in wireless mesh networks with QoS constraints by ZENG Feng, CHEN Zhi-gang, DENG Xiao-heng

“…Focusing on gateway optimal placement with QoS constraints in WMNs and aiming to minimize the cost of gateway placement,firstly,a new concept of limited dominating set（LDS） in graph was presented to addresses the gate-way placement problem,and to find the solution of minimum placement cost is to find the LDS of minimum weight in the graph.Then,in order to find the minimum weighted LDS in graph,a greedy algorithm GREEDY_LDS was proposed,in which the ratio of LOAD/COST was used as heuristic information to find minimum cost placement of gateway.To get further optimal solution,a particle swarm optimization algorithm PSO_LDS was proposed,in which two premature avoidance methods were presented to improve the algorithm’s ability of searching for global optimal solution.At last,simulation has been done,and experiment result shows that GREEDY_LDS has lower computing complexity,and when the number of gateway candidate is more than 17% of the total number of node,the result from GREEDY_LDS is better than the others.Simulation also shows that PSO_LDS can get the more optimal solution at the price of increasing of executing time.Compared with GREEDY_LDS and OPEN/CLOSE,the average cost of gateway placement is decreased by about 15% and 9% respectively.…”
Get full text

Advanced Text Summarization Model Incorporating NLP Techniques and Feature-Based Scoring by Estabraq Abdulreda Kadhim, Mohammad-Reza Feizi-Derakhshi, Hadi S. Aghdasi

“…Moreover, although it is more computationally complex, it efficiently combines higher quality with faster summarization. …”
Get full text

Improved Laplacian Biogeography-Based Optimization Algorithm and Its Application to QAP by Xinming Zhang, Doudou Wang, Haiyan Chen, Wentao Mao, Shangwang Liu, Guoqi Liu, Zhi Dou

“…Finally, some measures such as example learning, mutation operation removing, and greedy selection are adopted mostly to reduce the computation complexity of LxBBO. A lot of experimental results on the complex functions from the CEC-2013 test set show ILxBBO obtains better performance than LxBBO and quite a few state-of-the-art algorithms do. …”
Get full text

Genetic optimization–based scheduling in maritime cyber physical systems by Tingting Yang, Hailong Feng, Jian Zhao, Ruilong Deng, Ying Wang, Zhou Su

“…In order to cope with the computation complexity of traditional scheduling algorithms in intermittent infostations scenario, time-capacity mapping method is exploited to transfer it to a continue scenario when classic scheduling algorithms could be utilized with lower time complexity. …”
Get full text

Fast Skyline Community Search in Multi-Valued Networks by Dongxiao Yu, Lifang Zhang, Qi Luo, Xiuzhen Cheng, Jiguo Yu, Zhipeng Cai

“…However, the algorithms proposed on skyline community search can only work in the special case that the nodes have different values on each attribute, and the computation complexity degrades exponentially as the number of attributes increases. …”
Get full text

A kurtosis-ESPRIT algorithm for RealTime stability assessment in droop controlled microgrids by Adham Osama, Abdallah F. El-Hamalawy, Mohammed E. Ammar, Amr M. AbdelAty, Hatem H. Zeineldin, Tarek H. M. EL-Fouly, Ehab F. El-Saadany

“…Abstract Although detailed analytical models for droop-controlled microgrids are available, they are computationally complex and do not consider real-time variations in microgrid parameters and operating conditions. …”
Get full text

ZenLDA: Large-Scale Topic Model Training on Distributed Data-Parallel Platform by Bo Zhao, Hucheng Zhou, Guoqiang Li, Yihua Huang

“…The novelty of ZenLDA consists of three main aspects: (1) it converts the commonly used serial Collapsed Gibbs Sampling (CGS) inference algorithm to a Monte-Carlo Collapsed Bayesian (MCCB) estimation method, which is embarrassingly parallel; (2) it decomposes the LDA inference formula into parts that can be sampled more efficiently to reduce computation complexity; (3) it proposes a distributed LDA training framework, which represents the corpus as a directed graph with the parameters annotated as corresponding vertices and implements ZenLDA and other well-known inference methods based on Spark. …”
Get full text

Smart Home Security: An Efficient Multi-Factor Authentication Protocol by Ghazaleh Sarbishaei, Amir Masoud Aminian Modarres, Farahnaz Jowshan, Fateme Zahra Khakzad, Hasti Mokhtari

“…Evaluating the computation complexity and space complexity of the proposed protocol also verifies its superior performance compared with similar schemes.…”
Get full text

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach by Faqeer ur Rehman, Clemente Izurieta

“…Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. …”
Get full text

Enhanced crayfish optimization algorithm: Orthogonal refracted opposition-based learning for robotic arm trajectory planning. by Yuefeng Leng, Chunlai Cui, Zhichao Jiang

“…In high-dimensional scenarios, trajectory planning is a challenging and computationally complex optimization task that requires finding the optimal trajectory within a complex domain. …”
Get full text

Two-party cooperative blind signature based on SM2 by Xue BAI, Baodong QIN, Rui GUO, Dong ZHENG

“…SM2, issued by China in 2010, is a public key cryptography standard based on elliptic curves.It has been widely used in finance, social security and other fields thanks to its advantages of improved signature efficiency, decreased storage space and computing complexity than RSA.With the popularization and application of SM2, the issues of its key security and data privacy are of great concern.The single-key mode inhibits the potential application in multi-user settings, and the leakage of the key will threaten the security of the entire cryptosystem due to the centralization.The problem of secure storage and reasonable utilization of keys needs to be solved urgently.In addition, the SM2 digital signature algorithm cannot guarantee the message privacy.Aiming at the issues of key security and data privacy of the signature algorithm, many researchers have proposed the idea of cooperative signature and blind signature for SM2.However, there isn’t SM2 collaborative blind signature scheme proposed.Then a two-party cooperative blind signing protocol based on SM2 was proposed in this paper, which allowed two parties to sign except the user.The signing process did not require recovering the complete private key, while not revealing the information of the partial private key and secret number.The key was stored separately to improve the security of the key, while the blind signature protected the privacy of the message.In terms of security, the protocol satisfied unforgeability and unlinkability.The protocol was implemented using C to demonstrate the efficiency of each participant’s local operation.In the honest model, the time cost of each entity in the cooperative signature phase was similar as that of executing a lightweight SM2 blind signature.Overall, the proposed protocol has certain advantages in terms of function and efficiency.…”
Get full text

LMF-Net: A Learnable Multimodal Fusion Network for Semantic Segmentation of Remote Sensing Data by Jihao Li, Wenkai Zhang, Weihang Zhang, Ruixue Zhou, Chongyang Li, Boyuan Tong, Xian Sun, Kun Fu

“…Experiments on two well-established benchmark datasets reveal that our LMF-Net possesses superior segmentation behavior and strong generalization capability. In terms of computation complexity, it achieves competitive performance as well. …”
Get full text