Click-together azobenzene dendrons: Synthesis and characterization

We synthesized 1,2,3-triazole-linked azobenzene dendrons of four generations. No protection-deprotection approach was needed during the generation development via click reaction. The photoisomerization of azobenzene dendrons was Studied using UV-vis spectra. The cis isomers of these dendrons were more stable than trans isomers in the dark; however, the cis isomers could be quickly converted to trans forms under visible light exposure in seconds. The trans form could change to cis form reversibly by UV irradiation as well.

The immobilization of proteins on biodegradable polymer fibers via click chemistry

A facile and efficient method to immobilize bioactive proteins onto polymeric substrate was established. Testis-specific protease 50 (TSP50) was immobilized on ultrafine biodegradable polymer fibers, i.e., (1) to prepare a propargyl-containing polymer P(LA90-co-MPCIO) by introducing propargyl group into a cyclic carbonate monomer (5-methyl-5-propargyloxycarbonyl-1,3-dioxan2-one, MPC) and copolymerizing it with L-lactide; (2) to electrospin the functionalized polymer into ultrafine fibers; (3) to azidize the TSP50, and (4) to perform the click reaction between the propargyl groups on the fibers and the azido groups on the protein.

Highly efficient and recoverable dendritic organocatalyst from click chemistry for the asymmetric michael addition of ketones to nitroolefins without the use of organic solvent

A series Of pyrrolidine-triazole based dendritic catalysts have been synthesized and applied directly in the asymmetric Michael addition of ketones to nitroolefins without the use of an organic solvent. Good yields (up to 99%), and high diastereoselectivities (up to syn/anti = 45:1) and enantioselectivities (up to 95% ee) have been obtained. Furthermore. the third generation catalyst can be reused at least five times without significant loss of catalytic activity. (C) 2008 Elsevier Ltd. All rights reserved.

Grafting BSA onto poly[(L-lactide)-co-carbonate] microspheres by click chemistry

Model protein bovine serum albumin (BSA) was covalently grafted onto poly[(L-lactide)co-carbonate] microsphere surfaces by "click chemistry." The grafting was confirmed by confocal laser scanning microscopy and X-ray photoelectron spectroscopy. The maximum amount of surface-grafted BSA was 45 mg.g(-1). The secondary structure of the grafted BSA was analyzed by FTIR and the results demonstrated that the grafting did not affect protein structure. This strategy can also be used on microspheres prepared from poly(L-lactide)/poly[(L-lactide)-co-carbonate] blend materials.

Immobilization of dipyridyl complex to magnetic nanoparticle via click chemistry as a recyclable catalyst for Suzuki cross-coupling reactions

A magnetic nanoparticle (MNP)-supported di(2-pyridyl)methanol palladium dichloride complex was prepared via click chemistry. The MNP-supported catalyst was evaluated in Suzuki coupling reaction in term of activity and recyclability in DMF. It was found to be highly efficient for Suzuki coupling reaction using aryl bromides as substrates and could be easily separated by an external magnet and reused in five consecutive runs without obvious loss of activity.

Sugars-grafted aliphatic biodegradable poly(L-lactide-co-carbonate)s by click reaction and their specific interaction with lectin molecules

A novel biodegradable aliphatic poly(L-lactide-co-carbonate) bearing pendant acetylene groups was successfully prepared by ring-opening copolymerization of L-lactide (LA) with 5-methyl-5-propargyloxycarbonyl-1,3-dioxan-2-one (PC) in the presence of benzyl alcohol as initiator with ZnEt2 as catalyst in bulk at 100 degrees C and subsequently used for grafting 2-azidoethyl beta-D-glucopyranoside and 2-azidoethyl beta-lactoside by the typical "click reaction," that is Cu(I)-catalyzed cycloaddition of azide and alkyne. The density of acetylene groups in the copolymer can be tailored by the molar ratio of PC to LA during the copolymerization. The aliphatic copolymers grafted with sugars showed low cytotoxicity to L929 cells, improved hydrophilic properties and specific recognition and binding ability with lectins, that is Concanavalin A (Con A) and Ricinus communis agglutinin (RCA). Therefore, this kind of sugar-grafted copolymer could be a good candidate in variety of biomedical applications.

基于MontaVista Linux的开放式机器人控制器研究与实现

本文提出了一种基于MontaVista Linux操作系统的开放式机器人控制器,该系统采用CAN总线作为控制器的系统总线。由于MontaVista Linux操作系统的开放性和良好的移植性,使得系统可以方便扩展、定制不同的应用软件模块和操作系统模块,并且在各种硬件平台间具有良好的移植性。同时由于采用CAN总线作为系统总线,使得系统可灵活配置且可以通过现场总线与其它设备共享数据。

基于多线程的Linux下并发服务器的实现研究

探讨了Linux平台下多线程技术和套接字网络通讯问题,在此基础上利用互斥锁和条件变量技术设计了一个面向连接的多线程并发服务器的详细算法。最后给出了基于Posix线程库的Linux系统下用C++实现多线程并发服务器的基本程序框架。实际项目应用表明这种基于多线程的并发服务器结构在完善程序功能的同时还可以有效提高其服务性能。

Linux下多线程技术在SPM纳米操作系统中的应用

启动一个新的进程必须分配给它独立的地址空间,建立众多的数据表来维护它的代码段、堆栈段和数据段,这是一种“昂贵”的多任务工作方式。相比之下,多线程技术是一种非常“节俭”的多任务操作方式。本文针对SPM纳米操作系统中的ARM嵌入式开发平台的任务特点,分析比较了Linux系统下多线程和多进程技术的性能,为设计实现ARM开发平台下的多线程程序起到关键的作用。

基于嵌入式实时Linux的远程监控系统

提出了一种基于嵌入式实时Linux的设备远程监控系统,重点针对现有远程监控系统体积、实时性问题加以改进。在自行研发的操作系统基础之上,一方面实现了嵌入式Internet技术;另一方面满足了系统硬实时性需求,为故障的实时预报、诊断、控制提供了强有力的支持。

Instalação e Configuração do PostgreSQL no Linux via código-fonte.

Apesar de exigir maior grau de dificuldade do que a instalação via pacotes, a instalação via código-fonte oferece uma infinidade de recursos em relação à primeira, tais como: definir a estrutura de diretórios para binários, bibliotecas, módulos, manuais e demais arquivos do SGBD conforme o desejado, o que facilita a organização, localização e manutenção do PostgreSQL; ativar suporte a um determinado idioma, para tradução de mensagens; construir suporte a determinadas linguagens ou módulos; definir alguns parâmetros padrões; além de conceber maior controle e segurança nas atualizações de versões do SGBD, evitando assim, atualizações automáticas indesejáveis por meio do sistema operacional e a conseqüente perda de bases de dados; entre outros. Para este trabalho, foi utilizado o sistema operacional Ubuntu Server 8.04.1, contudo, este tutorial é totalmente aplicável e compatível a outras versões Ubuntu, bem como a outras distribuições Linux, respeitando, é claro, as particularidades de algumas distribuições, como a estrutura de diretórios destes. Quanto ao SGBD PostgreSQL, foi adotado a versão 8.3.4, lançada em Setembro/2008, contudo, este tutorial se aplica também à versões inferiores 8.x.x deste SGBD.

Reti complesse e analisi del segnale elettroencefalografico

The identification of subject-specific traits extracted from patterns of brain activity still represents an important challenge. The need to detect distinctive brain features, which is relevant for biometric and brain computer interface systems, has been also emphasized in monitoring the effect of clinical treatments and in evaluating the progression of brain disorders. Graph theory and network science tools have revealed fundamental mechanisms of functional brain organization in resting-state M/EEG analysis. Nevertheless, it is still not clearly understood how several methodological aspects may bias the topology of the reconstructed functional networks. In this context, the literature shows inconsistency in the chosen length of the selected epochs, impeding a meaningful comparison between results from different studies. In this study we propose an approach which aims to investigate the existence of a distinctive functional core (sub-network) using an unbiased reconstruction of network topology. Brain signals from a public and freely available EEG dataset were analyzed using a phase synchronization based measure, minimum spanning tree and k-core decomposition. The analysis was performed for each classical brain rhythm separately. Furthermore, we aim to provide a network approach insensitive to the effects that epoch length has on functional connectivity (FC) and network reconstruction. Two different measures, the phase lag index (PLI) and the Amplitude Envelope Correlation (AEC), were applied to EEG resting-state recordings for a group of eighteen healthy volunteers. Weighted clustering coefficient (CCw), weighted characteristic path length (Lw) and minimum spanning tree (MST) parameters were computed to evaluate the network topology. The analysis was performed on both scalp and source-space data. Results about distinctive functional core, show highest classification rates from k-core decomposition in gamma (EER=0.130, AUC=0.943) and high beta (EER=0.172, AUC=0.905) frequency bands. Results from scalp analysis concerning the influence of epoch length, show a decrease in both mean PLI and AEC values with an increase in epoch length, with a tendency to stabilize at a length of 12 seconds for PLI and 6 seconds for AEC. Moreover, CCw and Lw show very similar behaviour, with metrics based on AEC more reliable in terms of stability. In general, MST parameters stabilize at short epoch lengths, particularly for MSTs based on PLI (1-6 seconds versus 4-8 seconds for AEC). At the source-level the results were even more reliable, with stability already at 1 second duration for PLI-based MSTs. Our results confirm that EEG analysis may represent an effective tool to identify subject-specific characteristics that may be of great impact for several bioengineering applications. Regarding epoch length, the present work suggests that both PLI and AEC depend on epoch length and that this has an impact on the reconstructed network topology, particularly at the scalp-level. Source-level MST topology is less sensitive to differences in epoch length, therefore enabling the comparison of brain network topology between different studies.

Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux

Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given task and across multiple tasks for a given period of time. Similar to RMS, SRMS has two components: a feasibility test and a scheduling algorithm. SRMS feasibility test ensures that it is possible for a given periodic task set to share a given resource without violating any of the statistical QoS constraints imposed on each task in the set. The SRMS scheduling algorithm consists of two parts: a job admission controller and a scheduler. The SRMS scheduler is a simple, preemptive, fixed-priority scheduler. The SRMS job admission controller manages the QoS delivered to the various tasks through admit/reject and priority assignment decisions. In particular, it ensures the important property of task isolation, whereby tasks do not infringe on each other. In this paper we present the design and implementation of SRMS within the KURT Linux Operating System [HSPN98, SPH 98, Sri98]. KURT Linux supports conventional tasks as well as real-time tasks. It provides a mechanism for transitioning from normal Linux scheduling to a mixed scheduling of conventional and real-time tasks, and to a focused mode where only real-time tasks are scheduled. We overview the technical issues that we had to overcome in order to integrate SRMS into KURT Linux and present the API we have developed for scheduling periodic real-time tasks using SRMS.

Assessing segmentation processes by click detection: online measure of statistical learning, or simple interference?

Statistical learning can be used to extract the words from continuous speech. Gómez, Bion, and Mehler (Language and Cognitive Processes, 26, 212–223, 2011) proposed an online measure of statistical learning: They superimposed auditory clicks on a continuous artificial speech stream made up of a random succession of trisyllabic nonwords. Participants were instructed to detect these clicks, which could be located either within or between words. The results showed that, over the length of exposure, reaction times (RTs) increased more for within-word than for between-word clicks. This result has been accounted for by means of statistical learning of the between-word boundaries. However, even though statistical learning occurs without an intention to learn, it nevertheless requires attentional resources. Therefore, this process could be affected by a concurrent task such as click detection. In the present study, we evaluated the extent to which the click detection task indeed reflects successful statistical learning. Our results suggest that the emergence of RT differences between within- and between-word click detection is neither systematic nor related to the successful segmentation of the artificial language. Therefore, instead of being an online measure of learning, the click detection task seems to interfere with the extraction of statistical regularities.