125 resultados para Computationally efficient
Resumo:
Cardiac hypertrophy, an important adaptational response, is associated with up-regulation of the immediate early gene, c- jun, which encodes the c-Jun transcription factor. c-Jun may feed back to up-regulate its own transcription and, since the c-Jun N-terminal kinase (JNK) family of mitogen-activated protein kinases (MAPKs) phosphorylate c-Jun(Ser-63/73) to increase its transactivating activity, JNKs are thought to be the principal factors involved in c- jun up-regulation. Hypertrophy in primary cultures of cardiac myocytes is induced by endothelin-1, phenylephrine or PMA, probably through activation of one or more of the MAPK family. These three agonists increased c- jun mRNA with the rank order of potency of PMA approximately endothelin-1>phenylephrine. Up-regulation of c- jun mRNA by endothelin-1 was attenuated by inhibitors of protein kinase C (GF109203X) and the extracellular signal-regulated kinase (ERK) cascade (PD98059 or U0126), but not by inhibitors of the JNK (SP600125) or p38-MAPK (SB203580) cascades. Hyperosmotic shock (0.5 M sorbitol) powerfully activates JNKs, but did not increase c- jun mRNA. These data suggest that ERKs, rather than JNKs, are required for c- jun up-regulation. However, endothelin-1 and phenylephrine induced greater up-regulation of c-Jun protein than PMA and phosphorylation of c-Jun(Ser-63/73) correlated with the level of c-Jun protein. Up-regulation of c-Jun protein by endothelin-1 was attenuated by inhibitors of protein kinase C and the ERK cascade, probably correlating with a primary input of ERKs into transcription. In addition, SP600125 inhibited the phosphorylation of c-Jun(Ser-63/73), attenuated the increase in c-Jun protein induced by endothelin-1 and increased the rate of c-Jun degradation. Thus whereas ERKs are the principal MAPKs required for c- jun transcription, JNKs are necessary to stabilize c-Jun for efficient up-regulation of the protein.
Resumo:
An efficient and rapid synthesis of 1-acetyl-1H-indol-3-yl acetate 1 and its derivatives 7 via the microwave-assisted cyclisation and decarboxylation of 2-[(carboxymethyl)amino]benzoic acids 5 is described. The latter were left to react with acetic anhydride using triethylamine as the base and were subjected to microwave irradiation for 1 minute, at 80 °C with initial power of 300 W. The target 1-acetyl-1H-indol-3-yl acetate 1 and derivatives 7 were isolated in 34-71% yield. In particular, synthesis of 1-acetyl-6-(trifluoromethyl)-1H-indol-3-yl acetate 7f and 1-acetyl-3-methyl-1H-indol-3-yl acetate 7h is reported for the first time.
Resumo:
A Universal Serial Bus (USB) Mass Storage Device (MSD), often termed a USB flash drive, is ubiquitously used to store important information in unencrypted binary format. This low cost consumer device is incredibly popular due to its size, large storage capacity and relatively high transfer speed. However, if the device is lost or stolen an unauthorized person can easily retrieve all the information. Therefore, it is advantageous in many applications to provide security protection so that only authorized users can access the stored information. In order to provide security protection for a USB MSD, this paper proposes a session key agreement protocol after secure user authentication. The main aim of this protocol is to establish session key negotiation through which all the information retrieved, stored and transferred to the USB MSD is encrypted. This paper not only contributes an efficient protocol, but also does not suffer from the forgery attack and the password guessing attack as compared to other protocols in the literature. This paper analyses the security of the proposed protocol through a formal analysis which proves that the information is stored confidentially and is protected offering strong resilience to relevant security attacks. The computational cost and communication cost of the proposed scheme is analyzed and compared to related work to show that the proposed scheme has an improved tradeoff for computational cost, communication cost and security.
Resumo:
The l1-norm sparsity constraint is a widely used technique for constructing sparse models. In this contribution, two zero-attracting recursive least squares algorithms, referred to as ZA-RLS-I and ZA-RLS-II, are derived by employing the l1-norm of parameter vector constraint to facilitate the model sparsity. In order to achieve a closed-form solution, the l1-norm of the parameter vector is approximated by an adaptively weighted l2-norm, in which the weighting factors are set as the inversion of the associated l1-norm of parameter estimates that are readily available in the adaptive learning environment. ZA-RLS-II is computationally more efficient than ZA-RLS-I by exploiting the known results from linear algebra as well as the sparsity of the system. The proposed algorithms are proven to converge, and adaptive sparse channel estimation is used to demonstrate the effectiveness of the proposed approach.