The computational complexity

The thesis is structured as follows: In Chapter 1, the scientific literature is summarized within the scope of this study. Chapter 2 provides a comprehensive overview of the principles of the applied computational approaches in this study. Chapter 3 identifies the important residues of the LsIA/α7 nAChR complex that affect the interactions between the toxin and the membrane protein due to C-terminal carboxylation of LsIA. The effects of C-terminal modification of LsIA on interactions with α3β2 nAChR, involved in cardiovascular diseases, were also investigated in Chapter 4.

234p runthenight04 02-02-2023 11 3   Download

Research objectives of the thesis: Research the theories of complex fuzzy sets, complex fuzzy logic and measures based on complex fuzzy sets; research and development of fuzzy inference system based on complex fuzzy sets; research applied techniques to reduce rules, optimize fuzzy rules in complex fuzzy inference system; research on how to represent rules based on fuzzy knowledge graphs to reduce inference computation time for the test set and deal with the cases where the new dataset is not present in the training data set.

27p beloveinhouse01 15-08-2021 17 4   Download

By analyzing the emerging needs as described above, this thesis specified the research target as to propose a feature having a novel yet efficient and low complex ity graph structure in detecting multi-arch IoT botnet with high accuracy.

30p capheviahe27 23-02-2021 10 3   Download

In this chapter, students will be able to understand: Routers receive packets and use the most efficient path to forward them to their destinations, complex internetworks can have redundant routers that provide multiple paths to the same destination, routers store information about the network in a routing table,...

4p tangtuy08 21-04-2016 46 2   Download

Parallel Implementation of MAFFT on CUDA-Enabled Graphics Hardware present a new approach to accelerat- ing MAFFT on Graphics Processing Units (GPUs) using the Compute Unified Device Architecture (CUDA) programming model. Compared with the implementations of other MSA algorithms on GPUs, parallelization of MAFFT is more challenging since the space complexity.

14p ducla78 30-07-2015 48 6   Download

ProLiV - Animated Process-modeler of Complex (Computational) Linguistic Methods and Theories - is a fully modular, flexible, XML-based stand-alone Java application, used for computer-assisted learning in Natural Language Processing (NLP) or Computational Linguistics (CL).

4p hongphan_1 15-04-2013 60 4   Download

We have investigated the consequences of introducing a bisecting GlcNAc moiety into biantennary N-glycans. Computational analysis of glycan conformation with pro-longed simulation periods in vacuo and in a solvent box revealed two main effects: backfolding of thea1–6 arm and stacking of the bisectingGlcNAc and the neighboring Man/ GlcNAc residues of both antennae.Chemoenzymatic syn-thesis produced the bisecting biantennary decasaccharide N-glycan and itsa2–3(6)-sialylated variants.

17p dell39 03-04-2013 44 5   Download

A versatile software tool,virtualmslab, is presented that can perform advanced complex virtual proteomic experiments with mass spectrometric analyses to assist in the characterization of proteins. The virtual experimen-tal results allow rapid, flexible and convenient exploration of sample prepar-ation strategies and are used to generate MS reference databases that can be matched with the real MS data obtained from the equivalent real experi-ments.

11p dell39 27-03-2013 35 3   Download

The complexity of full-scale metabolic models is a major obstacle for their effective use in computational systems biology. The aim of model reduction is to circumvent this problem by eliminating parts of a model that are unimportant for the properties of interest.

16p inspiron33 23-03-2013 31 2   Download

The direct conversion of plant cell wall polysaccharides into soluble sugars is one of the most important reactions on earth, and is performed by cer-tain microorganisms such as Clostridium thermocellum(Ct). These organ-isms produce extracellular multi-subunit complexes (i.e. cellulosomes) comprising a consortium of enzymes, which contain noncatalytic carbohy-drate-binding modules (CBM) that increase the activity of the catalytic module.

12p media19 06-03-2013 46 4   Download

2. The computational inter-relationships between data types are complex: eg rainfall/soil type/location/species. A Generic model can evaluate a variety of separate investment projects for a variety of users.

16p muaxuan102 21-02-2013 75 9   Download

Supercomputers are the most powerful computers. They are used for problems requiring complex calculations. Because of their size and expense, supercomputers are relatively rare. Supercomputers are used by universities, government agencies, and large businesses.

13p trada85 18-01-2013 57 7   Download

We prove that Cayley graphs of SL2 (Fp ) are expanders with respect to the projection of any fixed elements in SL(2, Z) generating a non-elementary subgroup, and with respect to generators chosen at random in SL2 (Fp ). 1. Introduction Expanders are highly-connected sparse graphs widely used in computer science, in areas ranging from parallel computation to complexity theory and cryptography; recently they also have found some remarkable applications in pure mathematics; see [5],[10], [15], [20], [21] and references therein. ...

19p dontetvui 17-01-2013 49 6   Download

Dedicated to C´sar Camacho for his 60th birthday e Abstract After gluing foliated complex manifolds, we derive a preparation-like theorem for singularities of codimension-one foliations and planar vector fields (in the real or complex setting). Without computation, we retrieve and improve results of Levinson-Moser for functions, Dufour-Zhitomirskii for nondegenerate ˙ codimension-one foliations (proving in turn the analyticity), Str´zyna-Zoladek o˙ ´ for non degenerate planar vector fields and Bruno-Ecalle for saddle-node foliations in the plane. ...

15p noel_noel 17-01-2013 49 5   Download

We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique. To that end, one needs to develop a new proof framework, and to borrow and extend ideas from several fields. 1. Introduction The basic purpose of computational complexity theory is to classify computational problems according to the amount of resources required to solve them. In particular, the most basic task is to classify computational problems to those that are efficiently solvable and those that are not. ...

48p noel_noel 17-01-2013 60 6   Download

We consider a specialization of an untwisted quantum affine algebra of type ADE at a nonzero complex number, which may or may not be a root of unity. The Grothendieck ring of its finite dimensional representations has two bases, simple modules and standard modules. We identify entries of the transition matrix with special values of “computable” polynomials, similar to Kazhdan-Lusztig polynomials. At the same time we “compute” q-characters for all simple modules. The result is based on “computations” of Betti numbers of graded/cyclic quiver varieties.

42p tuanloccuoi 04-01-2013 52 8   Download

Characteristic cohomology classes, defined in modulo 2 coefficients by Stiefel [26] and Whitney [28] and with integral coefficients by Pontrjagin [24], make up the primary source of first-order invariants of smooth manifolds. When their utility was first recognized, it became an obvious goal to study the ways in which they admitted extensions to other categories, such as the categories of topological or PL manifolds; perhaps a clean description of characteristic classes for simplicial complexes could even give useful computational techniques.

25p tuanloccuoi 04-01-2013 60 6   Download

Question 1. Reorder the following efficiencies from the smallest to the largest: a. 2n3 + n5 b. 2000 c. 4n+1 d. n4 e. (n-1)! f. nlog2(n) g. 2klogk(n) (k is a predefined constant) Solution: Efficiency: a measure of amount of time for an algorithm to execute (Time Efficiency) or a measure of amount of memory needed for an algorithm to execute (Space Efficiency). Non-decreasing order: 2000

5p dragonly 03-01-2013 38 1   Download

Enzymes are basically composed of 20 naturally occurring amino acids, yet they catalyse a dizzying array of chemical reactions, with regiospecificity and stereospecificity and under physiological conditions. In this review, we attempt to gain some understanding of these complex proteins

11p cosis54 09-12-2012 44 2   Download

This paper presents the experiences gained from ongoing research collaboration between the School of Computer Engineering at Nanyang Technological University and the Southampton e-Science centre at the University of Southampton using a serviceoriented approach for complex engineering design optimization. The service-oriented approach enables programmatic collaboration to be realized while maintaining the autonomy of individual codes at the different institutes and organizations. In the current work, a Genetic algorithm optimization logic implemented as a Grid...

6p khangoc239 10-08-2012 52 6   Download