Assembly theory (AT) quantifies selection using the assembly equation and identifies complex objects that occur in abundance based on two measurements, assembly index and copy number. The assembly index is determined ...
详细信息
Index Modulation based Orthogonal Frequency Multiple Access (IM-OFDMA) is a novel multiple access scheme that has been recently proposed. IM-OFDMA has been shown to outperform current multiple access, such as OFDMA, i...
详细信息
ISBN:
(数字)9798350384819
ISBN:
(纸本)9798350384826
Index Modulation based Orthogonal Frequency Multiple Access (IM-OFDMA) is a novel multiple access scheme that has been recently proposed. IM-OFDMA has been shown to outperform current multiple access, such as OFDMA, in terms of the error performance and spectral efficiency, which nominates it to be a good candidate for beyond 5G networks. In this paper, a new variant of IM-OFDMA is proposed, termed as Full IM-OFDMA (FIM-OFDMA), that is able to further improve the spectral efficiency and the error performance. Moreover, the computational complexity at the detection stage in IM-OFDMA is investigated, and consequently, a new reduced-complexity detector, termed as Signal Power (SP) detector, is proposed that is valid for both IM-OFDMA and FIM-OFDMA schemes. Both the average bit error rate and computational complexity are mathematically analyzed. Analytical and simulation results show that the proposed FIM-IMOFDA can attain better error performance as compared to the conventional IM-OFDMA. Also, explored results reveal that the propose SP detector can achieve a significant reduction in the computational complexity as compared to the optimal maximum likelihood detector, without scarifying the error performance.
DEVS is a sound Modeling and Simulation (M&S) framework that describes a model in a modular and hierarchical way. It comes along with an abstract simulation algorithm which defines its operational semantics. Many ...
详细信息
DEVS is a sound Modeling and Simulation (M&S) framework that describes a model in a modular and hierarchical way. It comes along with an abstract simulation algorithm which defines its operational semantics. Many variants of such an algorithm have been proposed by DEVS researchers. Yet, the proper interpretation and analysis of the computational complexity of such approaches have not been systematically addressed and defined. As systems become larger and more complex, the efficiency of the DEVS simulation algorithms in terms of time complexity measure becomes a major issue. Therefore, it is necessary to devise a method for computing this complexity. This paper proposes a generic method to address such an issue, taking advantage of the recursion embedded in the triggered-by-message principle of the DEVS simulation protocol. The applicability of the method is shown through the complexity analysis of various DEVS simulation algorithms.
AI4Biopharmaceutical is an important field of interest in both academia and industry. Due to the characteristics of biopharmaceutical industry data and the hardware limitation of real factories, biopharmaceutical indi...
详细信息
ISBN:
(数字)9798350386226
ISBN:
(纸本)9798350386233
AI4Biopharmaceutical is an important field of interest in both academia and industry. Due to the characteristics of biopharmaceutical industry data and the hardware limitation of real factories, biopharmaceutical indicators prediction models need to balance computational complexity and prediction effectiveness. We propose a low computational complexity hybrid model (LCCH) combing the biopharmaceutical mechanism with artificial intelligence for biopharmaceutical indicators prediction. We use the Doolittle method to reduce the computational complexity of the online decomposition phase to O(1), while employing the half-router attention incorporating biopharmaceutical mechanism to significantly reduce the computational complexity of the prediction phase. The model achieves the state-of-the-art results for the prediction of five biopharmaceutical indicators: amino nitrogen, reducing sugar, total sugar, bacterial concentration,and viscosity in the erythromycin pharmaceutical scenario. Compared to the other outstanding baseline models from the last three years, LCCH demonstrates the superiority and potential of the hybrid model for biopharmaceutical industrial applications.
Petri net is a mathematical tool for discrete event systems. Workflow analysis is one of successful application of Petri net. DECLARE relation template is one of important properties to check validity of workflows. Th...
详细信息
ISBN:
(纸本)9781728110899
Petri net is a mathematical tool for discrete event systems. Workflow analysis is one of successful application of Petri net. DECLARE relation template is one of important properties to check validity of workflows. This paper studies computational complexity to decide whether the DECLARE relation templates between transitions A and B. The problems are shown to verified in determinstic polynomial time for sound acyclic free choice workflow nets. They are shown to be co-NP hard for sound acyclic non-free choice workflow nets.
作者：
Ichihara, KazuhiroNishimura, YuyaTani, SeiichiNihon Univ
Coll Humanities & Sci Dept Math 3-25-40 Sakurajosui Tokyo Tokyo 1568550 Japan Hiroshima Univ
Grad Sch Adv Sci & Engn 1-3-1 Kagamiyama Higashi Hiroshima City Hiroshima 7398526 Japan Nihon Univ
Coll Humanities & Sci Dept Informat Sci 3-25-40 SakurajosuiSetagaya Ku Tokyo 1568550 Japan
The classical knot recognition problem is the problem of determining whether the virtual knot represented by a given diagram is classical. We prove that this problem is in NP, and we give an exponential time algorithm...
详细信息
The classical knot recognition problem is the problem of determining whether the virtual knot represented by a given diagram is classical. We prove that this problem is in NP, and we give an exponential time algorithm for the problem.
Different classes of quantifiers provably require different verification algorithms with different complexity profiles. The algorithm for proportional quantifiers, like 'most', is more complex than that for no...
详细信息
Different classes of quantifiers provably require different verification algorithms with different complexity profiles. The algorithm for proportional quantifiers, like 'most', is more complex than that for nonproportional quantifiers, like 'all' and 'three'. We tested the hypothesis that different complexity profiles affect ERP responses during sentence verification, but not during sentence comprehension. In experiment 1, participants had to determine the truth value of a sentence relative to a previously presented array of geometric objects. We observed a sentence-final negative effect of truth value, modulated by quantifier class. Proportional quantifiers elicited a sentence-internal positivity compared to nonproportional quantifiers, in line with their different verification profiles. In experiment 2, the same stimuli were shown, followed by comprehension questions instead of verification. ERP responses specific to proportional quantifiers disappeared in experiment 2, suggesting that they are only evoked in a verification task and thus reflect the verification procedure itself. Our findings demonstrate that algorithmic aspects of human language processing are subjected to the same formal constraints applicable to abstract machines.
The paper is dedicated to assessing the computational complexity of the genetic algorithm as one of the key tools for solving optimization problems. The main types of algorithmic complexity are outlined. A mathematica...
详细信息
ISBN:
(数字)9798331520564
ISBN:
(纸本)9798331520571
The paper is dedicated to assessing the computational complexity of the genetic algorithm as one of the key tools for solving optimization problems. The main types of algorithmic complexity are outlined. A mathematical framework for estimating the asymptotic complexity of the genetic algorithm is presented. An investigation into the influence of population size and the number of generations on the asymptotic complexity of the genetic algorithm in solving the traveling salesman problem is conducted. Based on the obtained results, a linear dependence of the execution time of the genetic algorithm on the size of the input data under consideration is demonstrated.
Here we study the computational complexity of the constrained synchronization problem for the class of regular commutative constraint languages. Utilizing a vector representation of regular commutative constraint lang...
详细信息
ISBN:
(纸本)9783030581503;9783030581497
Here we study the computational complexity of the constrained synchronization problem for the class of regular commutative constraint languages. Utilizing a vector representation of regular commutative constraint languages, we give a full classification of the computational complexity of the constrained synchronization problem. Depending on the constraint language, our problem becomes PSPACE-complete, N P-complete or polynomial time solvable. In addition, we derive a polynomial time decision procedure for the complexity of the constrained synchronization problem, given a constraint automaton accepting a commutative language as input.
We show that for meshes hierarchically adapted towards singularities there exists an order of variable elimination for direct solvers that will result in time complexity not worse than O(max(N, N3q-1/q)), where N is t...
详细信息
ISBN:
(纸本)9783030504205;9783030504199
We show that for meshes hierarchically adapted towards singularities there exists an order of variable elimination for direct solvers that will result in time complexity not worse than O(max(N, N3q-1/q)), where N is the number of nodes and q is the dimensionality of the singularity. In particular, we show that this formula does not change depending on the spatial dimensionality of the mesh. We also show the relationship between the time complexity and the Kolmogorov dimension of the singularity.
暂无评论