-
81
Mechanical and Civil Engineering Optimization with a Very Simple Hybrid Grey Wolf—JAYA Metaheuristic Optimizer
Published 2024-11-01“…However, most MAs (especially hybrid algorithms) have very complicated formulations. The present study demonstrated that it is possible to build a very simple hybrid metaheuristic algorithm combining basic versions of classical MAs, and including very simple modifications in the optimization formulation to maximize computational efficiency. …”
Get full text
Article -
82
The rational canonical form of a matrix
Published 1986-01-01“…The purpose of this paper is to provide an efficient algorithmic means of determining the rational canonical form of a matrix using computational symbolic algebraic manipulation packages, and is in fact the practical implementation of a classical mathematical method.…”
Get full text
Article -
83
Development of Wearable Wireless Multichannel f-NIRS System to Evaluate Activities
Published 2025-05-01“…The popularity of this approach lies in the fact that new single-channel brain oxygen sensors can be used in a variety of scenarios. …”
Get full text
Article -
84
-
85
The new global public: Surveillance and the risks to the civil sphere
Published 2025-01-01Get full text
Article -
86
-
87
Detecting Malware C&C Communication Traffic Using Artificial Intelligence Techniques
Published 2025-01-01“…Banking malware poses a significant threat to users by infecting their computers and then attempting to perform malicious activities such as surreptitiously stealing confidential information from them. …”
Get full text
Article -
88
USING DATABASES TO DESIGN BEARINGS EMPLOYED IN THE CONSTRUCTION OF MECHANISMS
Published 2018-05-01“…In this paper, we have designed the rules and the facts database of an expert system used to design bearings for the construction of mechanisms and we have also described the way the said expert system works, based on the computation algorithm.…”
Get full text
Article -
89
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
Published 2024-04-01“…Moreover, our proofs are constructive, and imply the existence of polynomial-time algorithms to compute good connected orderings for these graph classes.…”
Get full text
Article -
90
Applications of density functional theory and machine learning in nanomaterials: A review
Published 2025-07-01“…Also, this review considers developments between DFT and machine learning (ML)-based techniques that have paved the way for accelerated discoveries and design of novel nanomaterials. In fact, the ML algorithm has built models based on data from DFT, which predicts with high accuracy the properties of materials at reduced computational costs to expand vast areas of emerging chemistries. …”
Get full text
Article -
91
An integrated AHP-GP-GA approach for public project portfolio selection problem
Published 2025-10-01“…The GP employed a computational approach to address numerous goals and limitations. …”
Get full text
Article -
92
Transparency in artificial intelligence
Published 2020-05-01“…This conceptual paper addresses the issues of transparency as linked to artificial intelligence (AI) from socio-legal and computer scientific perspectives. Firstly, we discuss the conceptual distinction between transparency in AI and algorithmic transparency, and argue for the wider concept ‘in AI’, as a partly contested albeit useful notion in relation to transparency. …”
Get full text
Article -
93
-
94
-
95
The Set of Numerical Semigroups with Frobenius Number Belonging to a Fixed Interval
Published 2025-08-01“…</mo></mrow></semantics></math></inline-formula> In this work, we will show that <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">A</mi><mo>(</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo><mo>)</mo><mo>=</mo><mo>{</mo><mi>S</mi><mo>∣</mo><mi>S</mi></mrow></semantics></math></inline-formula> is a numerical semigroup whose Frobenius number belongs to <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo><mo>}</mo></mrow></semantics></math></inline-formula> and is a covariety. This fact allows us to present an algorithm which computes all the elements from <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">A</mi><mo>(</mo><mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo><mo>)</mo><mo>.…”
Get full text
Article -
96
Numerical Semigroups with a Given Frobenius Number and Some Fixed Gaps
Published 2025-05-01“…</mo></mrow></semantics></math></inline-formula> In this work, we prove that <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">A</mi><mo>(</mo><mi>P</mi><mo>)</mo></mrow></semantics></math></inline-formula> is a covariety; therefore, we can arrange the elements of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">A</mi><mo>(</mo><mi>P</mi><mo>)</mo></mrow></semantics></math></inline-formula> in the form of a tree. This fact allows us to present several algorithms, including one that calculates all the elements of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">A</mi><mo>(</mo><mi>P</mi><mo>)</mo></mrow></semantics></math></inline-formula>, another that obtains its maximal elements (with respect to the set inclusion order) and one more that computes the elements of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">A</mi><mo>(</mo><mi>P</mi><mo>)</mo></mrow></semantics></math></inline-formula> that cannot be expressed as an intersection of two elements of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">A</mi><mo>(</mo><mi>P</mi><mo>)</mo><mo>,</mo></mrow></semantics></math></inline-formula> that properly contain it.…”
Get full text
Article -
97
-
98
Swiftly identifying strongly unique k-mers
Published 2025-07-01“…They are useful for placing sequenced DNA fragments at the correct location without computing alignments and without ambiguity. However, they are not necessarily robust: A single basepair change may turn a unique k-mer into a different one that may in fact be present at one or more different locations, which may give confusing or contradictory information when attempting to place a read by its k-mer content. …”
Get full text
Article -
99
Sperm swarm optimization for many objective power flow problems with enhanced performance evaluation in power systems
Published 2025-05-01“…MaOSSO is shown to consistently outperform competing methods with up to 15–20% faster convergence and 25% less computation time. While applying the algorithm on the MaO-OPF problem, the active/reactive power loss minimization was optimized along with the voltage stability, emissions, operational cost, and Pareto front diversity sustaining. …”
Get full text
Article -
100
Machine learning-based prediction of CO2 solubility in methyldiethanolamine solutions: A comparative study
Published 2025-06-01Get full text
Article