Search

Glutamate decarboxylase (GAD, EC 4.1.1.15) is an important enzyme in gamma-aminobutyric acid biosynthesis and DL-glutamic acid resolution. In this study, the Enterococcus faecium-derived GAD was successfully immobilized by regenerated chitin (RC) via specific adsorption of cellulose-binding domain (CBD). The optimal binding buffer was 20 mmol/L phosphate buffer saline (pH 8.0), and the RC binding capacity was 1.77 ± 0.11 mgcbd-gad/grc under this condition. The ratio of wet RC and crude enzyme solution used for immobilization was recommended to 3:50 (g/mL). To evaluate the effect of RC immobilization on GAD, properties of the immobilize GAD (RC-CBD-GAD) were investigated. Results indicated RC-CBD-GAD was relatively stable at pH 4.4–5.6 and temperature − 20–40 °C, and the optimal reaction pH value and temperature were pH 4.8 and 50 °C, respectively. When it was reacted with 5 mmol/L of follow chemical reagents respectively, the activity of RC-CBD-GAD was hardly affected by EDTA, KCl, and NaCl, and significantly inactivated by AgNO3, MnSO4, MgSO4, CuSO4, ZnSO4, FeCl2, FeCl3, AlCl3, CaCl2, and Pb(CH3COO)2. The apparent Km and Vmax were 28.35 mmol/L and 147.06 μmol/(gRC-CBD-GAD·min), respectively. The optimum time for a batch of catalytic reaction without exogenous pH control was 2 h. Under this reaction time, RC-CBD-GAD had a good reusability with a half-life of 23 cycles, indicating that it was very attractive for GABA industry. As a novel, efficient, and green CBD binding carrier, RC provides an alternative way to protein immobilization.

An interconnection network’s diagnosability is an important metric for measuring its self-diagnostic capability. Permanent fault and intermittent fault are two different fault models that exist in an interconnection network. In this paper, we focus on the problem pertaining to the diagnosability of interconnection networks in an intermittent fault situation. First, we study a class of interconnection networks called crisp three-cycle networks, in which the cn in -number (the number of common vertices each pair of vertices share) is no more than one. Necessary and sufficient conditions are derived for the diagnosability of crisp three-cycle networks under the PMC (Preparata, Metze, and Chien) model. A simple check can show that many well-known interconnection networks are crisp three-cycle networks. Second, we prove that an interconnection network S is a t i -fault diagnosable system without repair if and only if its minimum in-degree is greater than t i under the BGM (Barsi, Grandoni, and Masetrini) model. Finally, we extend the necessary and sufficient conditions to determine whether an interconnection network S is t i -fault diagnosable without repair under the MM (Maeng and Malek) model from the permanent fault situation to the intermittent fault situation.

Diagnosis by comparison is a realistic approach to detect faults of multiprocessor systems. This paper considers a pessimistic diagnostic strategy for hypercube-like multiprocessor systems under the comparison model. The pessimistic strategy is a diagnostic process whereby all faulty nodes can be correctly identified and at most one fault-free node may be misjudged as a faulty node. We propose a pessimistic diagnosis algorithm based on the largest component in the faulty system. For a system with $N=2^n$ nodes and $n\ge 5$ , when the number of faulty nodes is bounded by $2n-2$ , the algorithm can correctly identify all nodes except at most one node left undiagnosed. The time complexity of the algorithm is $O(Nlog_2N)$ .

Lipoprotein-associated phospholipase A2 (Lp-PLAOur study cohort included 320 consecutive STEMI patients undergoing PPCI with HTB who were randomly assigned to receive either TA before PPCI (TA group, n = 160) or PPCI alone (standard PPCI group, n = 160). The baseline characteristics of study participants were well-matched. After 30 ± 2 days, serum Lp-PLAAfter 30 ± 2 days of treatment, TA may significantly reduce serum levels of Lp-PLA

In this paper, we propose a novel method to deal with a large number of faults existing in the system based on the PMC model. We derive a fault bound $T$ for a $N$ -node ring based on cycle partition and Pigeonhole principle. Under this fault bound, it is guaranteed that at least one sequence obtained from cycle partition can be picked out and all nodes in this sequence can be identified. The corresponding ring diagnosis algorithm is then provided. Using this ring diagnosis method, we propose a five-round adaptive diagnosis scheme for networks containing Hamiltonian cycle. Simulations show that for Hamiltonian networks with node degree more than $3$ , it can achieve almost complete diagnosis.

Two sufficient conditions for robust stability of discrete-time uncertain singular systems with polytope type uncertainties are proposed. The conditions are expressed in terms of a set of linear matrix inequalities (LMIs) involving only the vertices of the polytope domain. It enables us to determine robust stability of discrete-time uncertain singular systems easily by solving some LMIs. The new approaches can yield much sharper and less conservative results than the simultaneous stability approaches. Numerical examples are included to illustrate the the efficiency of the proposed approaches.

In this paper, the stability and state feedback stabilization problems of neutral type descriptor systems are considered. Some new delay-independent stability criterions are presented by employing the stability of a new operator mathcal D, LMIs and Lyapunov stability theory. Based on the criterions, sufficient conditions are derived such that under suitable controller the corresponding closed-loop systems of the neutral type descriptor systems are asymptotically stable.Furthermore, the stabilizing controller and robust stabilizing controller ( when there exist structure disturbance) for the neutral type descriptor system are also obtained. The effectiveness of our result can be checked by Matlab LMI toolbox.

Based on an extension model of rough set theory, a novel method of generating optimal decision rules directly from incomplete information systems is proposed in this paper. Through this method, the minimum condition attributes set of all objects can be obtained without data reduction for every single object, and the generalized decision rules can be generated from the original incomplete systems. Two examples show that the method is well suited for both consistent information systems and inconsistent information systems.