Results 221 to 230 of about 1,352 (259)
Some of the next articles are maybe not open access.
Passive systems failure probability estimation by the meta-AK-IS2 algorithm
Nuclear Engineering and Design, 2014Simplicity of design and independence from external inputs make passive safety systems very attractive both from the economical and safety points of view, for the development of future nuclear reactor concepts. On the other hand, concerns arise due to the not fully understood physical phenomena underlying their (passive) functioning and the scarce ...
CADINI, FRANCESCO +2 more
openaire +2 more sources
Journal of Mechanical Design, 2022
Abstract Sampling methods are powerful tools for structural reliability analysis with complex failure domains due to their stability and accuracy. One of the most frequently used sampling methods is the importance sampling (IS) method, which can markedly reduce the sampling variance and computational costs.
Gang Li, Long Jiang, Bin Lu, Wanxin He
openaire +1 more source
Abstract Sampling methods are powerful tools for structural reliability analysis with complex failure domains due to their stability and accuracy. One of the most frequently used sampling methods is the importance sampling (IS) method, which can markedly reduce the sampling variance and computational costs.
Gang Li, Long Jiang, Bin Lu, Wanxin He
openaire +1 more source
aK-Mode: New algorithm to cluster OLAP requirement schemas
2013 International Conference on Control, Decision and Information Technologies (CoDIT), 2013Different methods are proposed to generate the schema of data mart. We propose a new one that starts by clustering the OLAP requirements that are represented as schemas, then, it generates the schemas of the data mart one for each cluster, and finally it validates them.
Nouha Arfaoui, Jalel Akaichi
openaire +1 more source
An AK-BRP dictionary learning algorithm for video frame sparse representation in compressed sensing
Multimedia Tools and Applications, 2016Sparsifying transform is an important prerequisite in compressed sensing. And it is practically significant to research the fast and efficient signal sparse representation methods. In this paper, we propose an adaptive K-BRP (AK-BRP) dictionary learning algorithm.
Yang Qian +3 more
openaire +1 more source
AnO(k 2n2) algorithm to find ak-partition in ak-connected graph
Journal of Computer Science and Technology, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Ma 0001, Shaohan Ma
openaire +1 more source
Improved Performance of CDL Algorithm Using DDELM-AE and AK-SVD
2019Due to the poor robustness and high complexity of the concentrated dictionary learning (CDL) algorithm, this paper addresses these issues using denoising deep extreme learning machine based on autoencoder (DDELM-AE) and approximate k singular value decomposition (AK-SVD).
Xiulan Yu +3 more
openaire +1 more source
A Linear Time Algorithm for Finding ak-Tree Core
Journal of Algorithms, 1997Summary: Given a tree containing \(n\) vertices, consider the sum of the distance between all vertices and a \(k\)-leaf subtree (subtree which contains exactly \(k\) leaves). A \(k\)-tree core is a \(k\)-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a \(k\)-tree core for a given \(k\
Akiyoshi Shioura, Takeaki Uno
openaire +2 more sources
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph
Algorithmica, 1992The authors present a linear-time algorithm for finding a sparse \(k\)- connected spanning subgraph for a given \(k\)-connected undirected graph. This is used to improve the time complexities of other graph connectivity problems.
Hiroshi Nagamochi, Toshihide Ibaraki
openaire +2 more sources
Computer Methods in Applied Mechanics and Engineering
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Zhang +4 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Zhang +4 more
openaire +2 more sources

