Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (13)

Search Parameters:
Keywords = metaprogramming

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
21 pages, 4911 KB  
Article
A Dual-Gene Signature of PMAIP1 and GADD45A for Early Detection of Intrahepatic Cholangiocarcinoma in the Context of Primary Sclerosing Cholangitis
by Bei Yao, Yiming Ma, Shuang Guan, Qiguang Zheng, Yanan Yu, Ran Jia, Yinli Shi, Zhiyong Hou, Zhong Wang and Jun Liu
Int. J. Mol. Sci. 2026, 27(11), 4826; https://doi.org/10.3390/ijms27114826 - 27 May 2026
Viewed by 226
Abstract
Primary sclerosing cholangitis (PSC) is a chronic inflammatory precursor associated with an increased risk of intrahepatic cholangiocarcinoma (ICC), yet identifying malignant features within the persistent inflammatory background remains challenging. In this study, a background-deviation framework was applied to explore malignant-associated determinants during PSC-associated [...] Read more.
Primary sclerosing cholangitis (PSC) is a chronic inflammatory precursor associated with an increased risk of intrahepatic cholangiocarcinoma (ICC), yet identifying malignant features within the persistent inflammatory background remains challenging. In this study, a background-deviation framework was applied to explore malignant-associated determinants during PSC-associated cholangiocarcinogenesis. Single-cell RNA sequencing data from PSC, ICC tumor tissues, and adjacent non-tumor tissues were integrated, followed by functional enrichment, CellChat analysis, Monocle 2 pseudotime reconstruction, Non-negative Matrix Factorization (NMF), STRING/Cytoscape network analysis, and diagnostic signature construction using LASSO regression and exhaustive best subset selection. Single-cell profiling suggested disease-associated cellular remodeling, including cholangiocyte expansion in ICC samples. Functional and intercellular communication analyses indicated a putative transition from an immune-dominant PSC state toward a hyper-biosynthetic ICC-associated phenotype, accompanied by a possible MIF receptor-usage shift from CXCR4 to CD44. Monocle 2 and NMF further identified candidate malignant-associated trajectories and meta-programs, with MYC/TP63-related regulatory signals emerging as potential contributors. Based on these exploratory findings, best subset selection identified a two-gene transcriptomic candidate signature comprising PMAIP1 and GADD45A, which showed promising discriminative performance in internal cross-validation and an external tumor-versus-adjacent validation cohort. These findings provide a transcriptomic basis for further validation of PSC-associated cholangiocarcinogenesis and potential ICC surveillance markers. Full article
(This article belongs to the Section Molecular Oncology)
Show Figures

Figure 1

24 pages, 7327 KB  
Article
Dual Immunological Prognostic Models for Risk Stratification and Treatment Insights in Triple-Negative Breast Cancer
by Shihua Lin, Hongjiu Wang, Zhenzhen Wang, Yuxuan Xiao, Menoudji Djetoyom Patrice, Li Wang, Xia Li and Yunpeng Zhang
Int. J. Mol. Sci. 2026, 27(3), 1494; https://doi.org/10.3390/ijms27031494 - 3 Feb 2026
Viewed by 832
Abstract
Triple-negative breast cancer (TNBC) represents the most aggressive breast cancer subtype, with its highly heterogeneous tumor microenvironment posing substantial challenges for precision diagnosis and therapy. To address this, we aim to construct a novel prognostic framework based on tumor-immune interactions. Through integrative analysis [...] Read more.
Triple-negative breast cancer (TNBC) represents the most aggressive breast cancer subtype, with its highly heterogeneous tumor microenvironment posing substantial challenges for precision diagnosis and therapy. To address this, we aim to construct a novel prognostic framework based on tumor-immune interactions. Through integrative analysis of single-cell RNA sequencing data from 30 TNBC samples (106,132 cells), we identify key tumor expression metaprograms and uncover their interaction with an immunosuppressive dendritic-cell subset, a process associated with the NECTIN1–NECTIN4 axis. Leveraging these interactions, we developed and validated two immunological prognostic models using multi-cohort transcriptomic data, including the stress response tumor cell and pDC_CLEC4C prognostic model (SPSM) and the immune response tumor cell and pDC_CLEC4C prognostic model (IPSM). These models effectively stratified TNBC patients into distinct risk groups, with the low-risk group characterized by an immunologically active microenvironment and elevated expression of immune checkpoint genes, suggesting a potential responsiveness to immunotherapy. Furthermore, we identified several potential therapeutic agents, including imatinib and bortezomib. Collectively, our dual-model framework provides a tool for risk stratification, offers translational insights for precision treatment, and presents new directions for understanding TNBC heterogeneity and therapeutic development. Full article
(This article belongs to the Special Issue Molecular Research in Triple-Negative Breast Cancer: 2nd Edition)
Show Figures

Figure 1

32 pages, 5258 KB  
Article
Developing GA-FuL: A Generic Wide-Purpose Library for Computing with Geometric Algebra
by Ahmad Hosny Eid and Francisco G. Montoya
Mathematics 2024, 12(14), 2272; https://doi.org/10.3390/math12142272 - 20 Jul 2024
Viewed by 2965
Abstract
The Geometric Algebra Fulcrum Library (GA-FuL) version 1.0 is introduced in this paper as a comprehensive computational library for geometric algebra (GA) and Clifford algebra (CA), in addition to other classical algebras. As a sophisticated software system, GA-FuL is useful for practical applications [...] Read more.
The Geometric Algebra Fulcrum Library (GA-FuL) version 1.0 is introduced in this paper as a comprehensive computational library for geometric algebra (GA) and Clifford algebra (CA), in addition to other classical algebras. As a sophisticated software system, GA-FuL is useful for practical applications requiring numerical or symbolic prototyping, optimized code generation, and geometric visualization. A comprehensive overview of the GA-FuL design is provided, including its core design intentions, data-driven programming characteristics, and extensible layered design. The library is capable of representing and manipulating sparse multivectors of any dimension, scalar kind, or metric signature, including conformal and projective geometric algebras. Several practical and illustrative use cases of the library are provided to highlight its potential for mathematical, scientific, and engineering applications. The metaprogramming code optimization capabilities of GA-FuL are found to be unique among other software systems. This allows for the automated production of highly efficient code, based on powerful geometric modeling formulations provided by geometric algebra. Full article
(This article belongs to the Section B: Geometry and Topology)
Show Figures

Figure 1

24 pages, 608 KB  
Article
GTMesh: A Highly Efficient C++ Template Library for Numerical Schemes on General Topology Meshes
by Tomáš Jakubec and Pavel Strachota
Appl. Sci. 2023, 13(15), 8748; https://doi.org/10.3390/app13158748 - 28 Jul 2023
Viewed by 3614
Abstract
This article introduces GTMesh, an open-source C++ library providing data structures and algorithms that facilitate the development of numerical schemes on general polytopal meshes. After discussing the features and limitations of the existing open-source alternatives, we focus on the theoretical description of geometry [...] Read more.
This article introduces GTMesh, an open-source C++ library providing data structures and algorithms that facilitate the development of numerical schemes on general polytopal meshes. After discussing the features and limitations of the existing open-source alternatives, we focus on the theoretical description of geometry and the topology of conforming polytopal meshes in an arbitrary-dimensional space, using elements from graph theory. The data structure for mesh representation is explained. The main part of the article focuses on the implementation of data structures and algorithms (computation of measures, centers, normals, cell coloring) by using State-of-the-Art template metaprogramming techniques for maximum performance. The geometrical algorithms are designed to be valid regardless of the dimension of the underlying space. As an integral part of the library, a template implementation of class reflection in C++ has been created, which is sufficiently versatile and suitable for the development of numerical and data I/O algorithms working with generic data types. Finally, the use of GTMesh is demonstrated on a simple example of solving the heat equation by the finite volume method. Full article
(This article belongs to the Topic Software Engineering and Applications)
Show Figures

Figure 1

14 pages, 3005 KB  
Article
Principles of Building Digital Twins to Design Integrated Energy Systems
by Valery Stennikov, Evgeny Barakhtenko, Dmitry Sokolov and Gleb Mayorov
Computation 2022, 10(12), 222; https://doi.org/10.3390/computation10120222 - 16 Dec 2022
Cited by 11 | Viewed by 4155
Abstract
The design of integrated energy systems (IESs) is a challenging task by reason of the highly complex configurations of these systems, the wide range of equipment used, and a diverse set of mathematical models and dedicated software employed to model it. The use [...] Read more.
The design of integrated energy systems (IESs) is a challenging task by reason of the highly complex configurations of these systems, the wide range of equipment used, and a diverse set of mathematical models and dedicated software employed to model it. The use of digital twins allows modeling in virtual space for various IES configurations. As a result, an optimal option of IES is obtained, which is implemented in the construction or expansion of a real-world IES. The paper proposes the principles of building digital twins for solving the IES design problems. The paper presents a new methodological approach developed by the authors to design an IES with the help of its digital twin. This approach includes the following components: the architecture of the software platform to create digital twins, a set of technologies and tools to implement the platform, methods to automatically construct a digital twin based on the Model-Driven Engineering concept, an algorithm to design an IES based on its digital twin, and principles to organize a computational process using a multi-agent approach. The results of the computational experiment using the software implementation of the IES digital twin components are presented for a test energy supply scheme. Full article
Show Figures

Figure 1

25 pages, 1111 KB  
Article
GenoMus: Representing Procedural Musical Structures with an Encoded Functional Grammar Optimized for Metaprogramming and Machine Learning
by José López-Montes, Miguel Molina-Solana and Waldo Fajardo
Appl. Sci. 2022, 12(16), 8322; https://doi.org/10.3390/app12168322 - 19 Aug 2022
Cited by 3 | Viewed by 4228
Abstract
We present GenoMus, a new model for artificial musical creativity based on a procedural approach, able to represent compositional techniques behind a musical score. This model aims to build a framework for automatic creativity, that is easily adaptable to other domains beyond music. [...] Read more.
We present GenoMus, a new model for artificial musical creativity based on a procedural approach, able to represent compositional techniques behind a musical score. This model aims to build a framework for automatic creativity, that is easily adaptable to other domains beyond music. The core of GenoMus is a functional grammar designed to cover a wide range of styles, integrating traditional and contemporary composing techniques. In its encoded form, both composing methods and music scores are represented as one-dimensional arrays of normalized values. On the other hand, the decoded form of GenoMus grammar is human-readable, allowing for manual editing and the implementation of user-defined processes. Musical procedures (genotypes) are functional trees, able to generate musical scores (phenotypes). Each subprocess uses the same generic functional structure, regardless of the time scale, polyphonic structure, or traditional or algorithmic process being employed. Some works produced with the algorithm have been already published. This highly homogeneous and modular approach simplifies metaprogramming and maximizes search space. Its abstract and compact representation of musical knowledge as pure numeric arrays is optimized for the application of different machine learning paradigms. Full article
(This article belongs to the Special Issue Advances in Computer Music)
Show Figures

Figure 1

16 pages, 24565 KB  
Article
Short-Time Fourier Transform Based on Metaprogramming and the Stockham Optimization Method
by Grzegorz Rybak and Krzysztof Strzecha
Sensors 2021, 21(12), 4123; https://doi.org/10.3390/s21124123 - 15 Jun 2021
Cited by 18 | Viewed by 5579
Abstract
The extension for high-performance STFT (Short-Time Fourier Transform) algorithm written entirely in Java language for non-parallel computations is presented in the current paper. This solution could compete with the best available and most common algorithms supplied by libraries such as FFTW or JTransform. [...] Read more.
The extension for high-performance STFT (Short-Time Fourier Transform) algorithm written entirely in Java language for non-parallel computations is presented in the current paper. This solution could compete with the best available and most common algorithms supplied by libraries such as FFTW or JTransform. The main idea was to move complex computations and expensive functions to the program generation phase. Thus, only core and essential operations were executed during the runtime phase. Furthermore, new approach allows to eliminate the necessity for a rearrangement operation that uses the bit-reversal permutation technique. This article presents a brief description of the STFT solution that was worked out as an extension for the original application, in order to increase its efficiency. The solution remains a Stockham algorithm adapted using metaprogramming techniques and entails an additional reduction its execution time. Performance tests and experiments were conducted using a Java Platform and JMH library, which allowed for accurate execution time measurements. Major aspects of the Java VM like warm-up effects were also taken into consideration. Solution was applied into Electrical Capacitance Tomography measurement system in order to measure the material changes during the silo discharging industrial process. Full article
Show Figures

Figure 1

29 pages, 1543 KB  
Article
Variational Quantum Chemistry Programs in JaqalPaq
by Oliver G. Maupin, Andrew D. Baczewski, Peter J. Love and Andrew J. Landahl
Entropy 2021, 23(6), 657; https://doi.org/10.3390/e23060657 - 24 May 2021
Cited by 4 | Viewed by 4707
Abstract
We present example quantum chemistry programs written with JaqalPaq, a python meta-programming language used to code in Jaqal (Just Another Quantum Assembly Language). These JaqalPaq algorithms are intended to be run on the Quantum Scientific Computing Open User Testbed (QSCOUT) platform at [...] Read more.
We present example quantum chemistry programs written with JaqalPaq, a python meta-programming language used to code in Jaqal (Just Another Quantum Assembly Language). These JaqalPaq algorithms are intended to be run on the Quantum Scientific Computing Open User Testbed (QSCOUT) platform at Sandia National Laboratories. Our exemplars use the variational quantum eigensolver (VQE) quantum algorithm to compute the ground state energies of the H2, HeH+, and LiH molecules. Since the exemplars focus on how to program in JaqalPaq, the calculations of the second-quantized Hamiltonians are performed with the PySCF python package, and the mappings of the fermions to qubits are obtained from the OpenFermion python package. Using the emulator functionality of JaqalPaq, we emulate how these exemplars would be executed on an error-free QSCOUT platform and compare the emulated computation of the bond-dissociation curves for these molecules with their exact forms within the relevant basis. Full article
(This article belongs to the Special Issue Noisy Intermediate-Scale Quantum Technologies (NISQ))
Show Figures

Figure 1

18 pages, 470 KB  
Article
Human-Error Prevention for Autonomous Edge Software Using Minimalistic Modern C++
by Ryo Fukano and Masato Ishikawa
Big Data Cogn. Comput. 2019, 3(4), 52; https://doi.org/10.3390/bdcc3040052 - 4 Nov 2019
Viewed by 5888
Abstract
In science and engineering using edge-embedded software, it is necessary to demonstrate the validity of results; therefore, the software responsible for operating an edge system is required to guarantee its own validity. The aim of this study is to guarantee the validity of [...] Read more.
In science and engineering using edge-embedded software, it is necessary to demonstrate the validity of results; therefore, the software responsible for operating an edge system is required to guarantee its own validity. The aim of this study is to guarantee the validity of the sampled-time filter and time domain as fundamental elements of autonomous edge software. This requires the update law of a sampled-time filter to be invoked once per every control cycle, which we guaranteed by using the proposed domain specific language implemented by a metaprogramming design pattern in modern C++ (C++11 and later). The time-domain elements were extracted from the software, after which they were able to be injected into the extracted software independent from the execution environment of the software. The proposed approach was shown to be superior to conventional approaches that only rely on the attention of programmers to detect design defects. This shows that it is possible to guarantee the validity of edge software by using only a general embedded programming language such as modern C++ without auxiliary verification and validation toolchains. Full article
Show Figures

Figure 1

8 pages, 401 KB  
Article
Automated Rediscovery of the Maxwell Equations
by Mark Stalzer and Chao Ju
Appl. Sci. 2019, 9(14), 2899; https://doi.org/10.3390/app9142899 - 19 Jul 2019
Cited by 1 | Viewed by 3184
Abstract
There is sufficient information in the far-field of a radiating dipole antenna to rediscover the Maxwell Equations and the wave equations of light, including the speed of light c . We created TheoSea, a Julia program that does this in a few [...] Read more.
There is sufficient information in the far-field of a radiating dipole antenna to rediscover the Maxwell Equations and the wave equations of light, including the speed of light c . We created TheoSea, a Julia program that does this in a few seconds, and the key insight is that the compactness of theories drives the search. The program is a computational embodiment of the scientific method: observation, consideration of candidate theories, and validation. Full article
(This article belongs to the Section Computing and Artificial Intelligence)
Show Figures

Figure 1

16 pages, 402 KB  
Article
Practical Sparse Matrices in C++ with Hybrid Storage and Template-Based Expression Optimisation
by Conrad Sanderson and Ryan Curtin
Math. Comput. Appl. 2019, 24(3), 70; https://doi.org/10.3390/mca24030070 - 19 Jul 2019
Cited by 31 | Viewed by 11917
Abstract
Despite the importance of sparse matrices in numerous fields of science, software implementations remain difficult to use for non-expert users, generally requiring the understanding of the underlying details of the chosen sparse matrix storage format. In addition, to achieve good performance, several formats [...] Read more.
Despite the importance of sparse matrices in numerous fields of science, software implementations remain difficult to use for non-expert users, generally requiring the understanding of the underlying details of the chosen sparse matrix storage format. In addition, to achieve good performance, several formats may need to be used in one program, requiring explicit selection and conversion between the formats. This can be both tedious and error-prone, especially for non-expert users. Motivated by these issues, we present a user-friendly and open-source sparse matrix class for the C++ language, with a high-level application programming interface deliberately similar to the widely-used MATLAB language. This facilitates prototyping directly in C++ and aids the conversion of research code into production environments. The class internally uses two main approaches to achieve efficient execution: (i) a hybrid storage framework, which automatically and seamlessly switches between three underlying storage formats (compressed sparse column, red-black tree, coordinate list) depending on which format is best suited and/or available for specific operations, and (ii) a template-based meta-programming framework to automatically detect and optimise the execution of common expression patterns. Empirical evaluations on large sparse matrices with various densities of non-zero elements demonstrate the advantages of the hybrid storage framework and the expression optimisation mechanism. Full article
Show Figures

Figure 1

22 pages, 2664 KB  
Technical Note
Python Non-Uniform Fast Fourier Transform (PyNUFFT): An Accelerated Non-Cartesian MRI Package on a Heterogeneous Platform (CPU/GPU)
by Jyh-Miin Lin
J. Imaging 2018, 4(3), 51; https://doi.org/10.3390/jimaging4030051 - 8 Mar 2018
Cited by 37 | Viewed by 13370
Abstract
A Python non-uniform fast Fourier transform (PyNUFFT) package has been developed to accelerate multidimensional non-Cartesian image reconstruction on heterogeneous platforms. Since scientific computing with Python encompasses a mature and integrated environment, the time efficiency of the NUFFT algorithm has been a major obstacle [...] Read more.
A Python non-uniform fast Fourier transform (PyNUFFT) package has been developed to accelerate multidimensional non-Cartesian image reconstruction on heterogeneous platforms. Since scientific computing with Python encompasses a mature and integrated environment, the time efficiency of the NUFFT algorithm has been a major obstacle to real-time non-Cartesian image reconstruction with Python. The current PyNUFFT software enables multi-dimensional NUFFT accelerated on a heterogeneous platform, which yields an efficient solution to many non-Cartesian imaging problems. The PyNUFFT also provides several solvers, including the conjugate gradient method, 1 total variation regularized ordinary least square (L1TV-OLS), and 1 total variation regularized least absolute deviation (L1TV-LAD). Metaprogramming libraries have been employed to accelerate PyNUFFT. The PyNUFFT package has been tested on multi-core central processing units (CPUs) and graphic processing units (GPUs), with acceleration factors of 6.3–9.5× on a 32-thread CPU platform and 5.4–13× on a GPU. Full article
Show Figures

Figure 1

22 pages, 3009 KB  
Article
Model-Driven Approach for Body Area Network Application Development
by Algimantas Venčkauskas, Vytautas Štuikys, Nerijus Jusas and Renata Burbaitė
Sensors 2016, 16(5), 670; https://doi.org/10.3390/s16050670 - 12 May 2016
Cited by 7 | Viewed by 6885
Abstract
This paper introduces the sensor-networked IoT model as a prototype to support the design of Body Area Network (BAN) applications for healthcare. Using the model, we analyze the synergistic effect of the functional requirements (data collection from the human body and transferring it [...] Read more.
This paper introduces the sensor-networked IoT model as a prototype to support the design of Body Area Network (BAN) applications for healthcare. Using the model, we analyze the synergistic effect of the functional requirements (data collection from the human body and transferring it to the top level) and non-functional requirements (trade-offs between energy-security-environmental factors, treated as Quality-of-Service (QoS)). We use feature models to represent the requirements at the earliest stage for the analysis and describe a model-driven methodology to design the possible BAN applications. Firstly, we specify the requirements as the problem domain (PD) variability model for the BAN applications. Next, we introduce the generative technology (meta-programming as the solution domain (SD)) and the mapping procedure to map the PD feature-based variability model onto the SD feature model. Finally, we create an executable meta-specification that represents the BAN functionality to describe the variability of the problem domain though transformations. The meta-specification (along with the meta-language processor) is a software generator for multiple BAN-oriented applications. We validate the methodology with experiments and a case study to generate a family of programs for the BAN sensor controllers. This enables to obtain the adequate measure of QoS efficiently through the interactive adjustment of the meta-parameter values and re-generation process for the concrete BAN application. Full article
(This article belongs to the Special Issue Security and Privacy in Sensor Networks)
Show Figures

Figure 1

Back to TopTop