-
241
Machine learning Hubbard parameters with equivariant neural networks
Published 2025-01-01“…Abstract Density-functional theory with extended Hubbard functionals (DFT + U + V) provides a robust framework to accurately describe complex materials containing transition-metal or rare-earth elements. …”
Get full text
Article -
242
Cartoon Image Encryption Algorithm by a Fractional-Order Memristive Hyperchaos
Published 2019-01-01Get full text
Article -
243
-
244
Adaptive micro partition and hierarchical merging for accurate mixed data clustering
Published 2024-12-01Get full text
Article -
245
Evaluating Affective User-Centered Design of Video Games Using Qualitative Methods
Published 2018-01-01“…In recent years, researchers and practitioners in the human-computer interaction (HCI) community have placed a lot of focus in developing methods and processes for use in the gaming field. …”
Get full text
Article -
246
Behavior Intention Derivation of Android Malware Using Ontology Inference
Published 2018-01-01Get full text
Article -
247
A study on fuzzy cognitive maps using fuzzy inference system
Published 2024-12-01Get full text
Article -
248
Doppler Ambiguity Resolution Based on Random Sparse Probing Pulses
Published 2015-01-01Get full text
Article -
249
Preventive Control Strategy of Cascading Fault considering Safety and Economy
Published 2021-01-01Get full text
Article -
250
Kansei Analysis of the Japanese Residential Garden and Development of a Low-Cost Virtual Reality Kansei Engineering System for Gardens
Published 2011-01-01“…The results of the analyses were used to create a low-cost virtual reality Kansei engineering system that permits visualization of garden designs corresponding to selected Kansei words. To render complex garden scenes, we developed an original 3D computation and rendering library built on Java. …”
Get full text
Article -
251
Multiagent Systems as an Approach to Building Fuzzy voter Communities using fuzzy languages
Published 2025-01-01Get full text
Article -
252
-
253
Ways to improve the accuracy of the harmonic method for simulating two-dimensional signals
Published 2024-04-01“…The article studies properties of the harmonic simulation method within the framework of the spectral theory and evaluates the quality of this method. A review of the literature on the existing methods for modeling multidimensional random fields is carried out, making it possible to compare these methods using criteria such as the complexity of the algorithm, computational costs and memory requirements, requirements for the covariance function and the grid. …”
Get full text
Article -
254
Model-Order Reduction of Multistage Cascaded Models for Digital Predistortion
Published 2025-01-01Get full text
Article -
255
Multiaircraft Optimal 4D Trajectory Planning Using Logical Constraints
Published 2019-01-01Get full text
Article -
256
Generalizing the Brady-Yong Algorithm: Efficient Fast Hough Transform for Arbitrary Image Sizes
Published 2025-01-01“…Thus, supported both by theory and experiments, generalization of the Brady-Yong algorithm for images of arbitrary size while maintaining asymptotic computational complexity and acceptable accuracy remains of paramount necessity. …”
Get full text
Article -
257
Notes on Post-criticality: Towards an Architecture of Reflexive Modernisation
Published 2009-01-01“…To what extent can considerations of political economy, culture, globalisation, and environmental crisis be translated into the explicit performance criteria and computational parameters? What role is there for tools forged in the fires of ‘critical architecture’ in the emerging architectural creativity increasingly characterised by complexity, provisional outcomes, and unpredictable form?…”
Get full text
Article -
258
LDPC code reconstruction based on algorithm of finding low weight code-words
Published 2017-06-01“…LDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction.First,theoretical analysis was provided for the number of received code-vectors needed for the reconstruction,and a lower bound was derived.Then,according to the lower bound,and based on an algorithm for finding low weight code-words,a new reconstruction method was proposed.It looked for low weight vectors one by one from the dual space of the received code-vector space and used them to reconstruct the sparse parity-check matrices.Number of iterations and the computational complexity of the method were analyzed based on exponential distribution theory.Under noise-free conditions,drawbacks of the existing method,including limited applicable range and large quantity of required data,have been overcame.Under noisy conditions,the proposed method has higher robustness against noise and relatively low complexity,compared to existing methods.For QC-LDPC codes,the reconstruction performance can be further improved using the quasi-cyclic property of their sparse parity-check matrices.…”
Get full text
Article -
259
Sparse Regularization With Reverse Sorted Sum of Squares via an Unrolled Difference-of-Convex Approach
Published 2025-01-01“…These include developing an algorithm grounded in theory, not heuristics, reducing computational complexity, enabling the automatic determination of numerous parameters, and ensuring the number of iterations remains feasible. …”
Get full text
Article -
260
Multi-label feature selection algorithm based on joint mutual information of max-relevance and min-redundancy
Published 2018-05-01“…Feature selection has played an important role in machine learning and artificial intelligence in the past decades.Many existing feature selection algorithm have chosen some redundant and irrelevant features,which is leading to overestimation of some features.Moreover,more features will significantly slow down the speed of machine learning and lead to classification over-fitting.Therefore,a new nonlinear feature selection algorithm based on forward search was proposed.The algorithm used the theory of mutual information and mutual information to find the optimal subset associated with multi-task labels and reduced the computational complexity.Compared with the experimental results of nine datasets and four different classifiers in UCI,the proposed algorithm is superior to the feature set selected by the original feature set and other feature selection algorithms.…”
Get full text
Article