Synthesis and characterization of rabies virus glycoprotein-tagged amphiphilic cyclodextrins for siRNA delivery in human glioblastoma cells: in vitro analysis

In man brain cancer is an aggressive, malignant form of tumour, it is highly infiltrative in nature, is associated with cellular heterogeneity and affects cerebral hemispheres of the brain. Current drug therapies are inadequate and an unmet clinical need exists to develop new improved therapeutics. The ability to silence genes associated with disease progression by using short interfering RNA (siRNA) presents the potential to develop safe and effective therapies. In this work, in order to protect the siRNA from degradation, promote cell specific uptake and enhance gene silencing efficiency, a PEGylated cyclodextrin (CD)-based nanoparticle, tagged with a CNS-targeting peptide derived from the rabies virus glycoprotein (RVG) was formulated and characterized. The modified cyclodextrin derivatives were synthesized and co-formulated to form nanoparticles containing siRNA which were analysed for size, surface charge, stability, cellular uptake and gene-knockdown in brain cancer cells. The results identified an optimised co-formulation prototype at a molar ratio of 1:1.5:0.5 (cationic cyclodextrin:PEGylated cyclodextrin:RVG-tagged PEGylated cyclodextrin) with a size of 281±39.72nm, a surface charge of 26.73±3mV, with efficient cellular uptake and a 27% gene-knockdown ability. This CD-based formulation represents a potential nanocomplex for systemic delivery of siRNA targeting brain cancer.

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Supporting real-time parallel task models with work-stealing

Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.

Parallel real-time support for distributed adaptive embedded applications

Real-time embedded applications require to process large amounts of data within small time windows. Parallelize and distribute workloads adaptively is suitable solution for computational demanding applications. The purpose of the Parallel Real-Time Framework for distributed adaptive embedded systems is to guarantee local and distributed processing of real-time applications. This work identifies some promising research directions for parallel/distributed real-time embedded applications.

A framework for the development of parallel and distributed real-time embedded systems

Embedded real-time applications increasingly present high computation requirements, which need to be completed within specific deadlines, but that present highly variable patterns, depending on the set of data available in a determined instant. The current trend to provide parallel processing in the embedded domain allows providing higher processing power; however, it does not address the variability in the processing pattern. Dimensioning each device for its worst-case scenario implies lower average utilization, and increased available, but unusable, processing in the overall system. A solution for this problem is to extend the parallel execution of the applications, allowing networked nodes to distribute the workload, on peak situations, to neighbour nodes. In this context, this report proposes a framework to develop parallel and distributed real-time embedded applications, transparently using OpenMP and Message Passing Interface (MPI), within a programming model based on OpenMP. The technical report also devises an integrated timing model, which enables the structured reasoning on the timing behaviour of these hybrid architectures.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.

A parallel programming model for ada

Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone. To take advantage of multi-core processors, parallel programming models are proposed as promising solutions for more effectively using multi-core processors. This paper discusses some of the existent models and frameworks for parallel programming, leading to outline a draft parallel programming model for Ada.

Professions and inter-disciplinary teamwork in socially embedded bureaucracies: Synthesis and hypotheses on the impact of informal and formal organization

In order to maximize their productivity, inter-disciplinary multi-occupation teams of professionals need to maximize inter-occupational cooperation in team decision making. Cooperation, however, is challenged by status anxiety over organizational careers and identity politics among team members who differ by ethnicity-race, gender, religion, nativity, citizenship status, etc. The purpose of this paper is to develop hypotheses about how informal and formal features of bureaucracy influence the level of inter-occupation cooperation achieved by socially diverse, multi-occupation work teams of professionals in bureaucratic work organizations. The 18 hypotheses, which are developed with the heuristic empirical case of National Science Foundation-sponsored university school partnerships in math and science curriculum innovation in the United States, culminate in the argument that cooperation can be realized as a synthesis of tensions between informal and formal features of bureaucracy in the form of participatory, high performance work systems.

Synthesis, characterization and reactivity of new cobalt, palladium and nickel complexes bearing α-diimines and P, O ligands

This work describes the synthesis and characterization of a series of new α-diimine and P,O, β-keto and acetamide phosphines ligands, and their complexation to Ni(II), Co(II),Co(III) and Pd(II) to obtain a series of new compounds aiming to study their structural characteristics and to test their catalytic activity. All the compounds synthesized were characterized by the usual spectroscopic and spectrometric techniques: Elemental Analysis, MALDI-TOF-MS spectrometry, IR, UV-vis, 1H, 13C and 31P NMR spectroscopies. Some of the paramagnetic compounds were also characterized by EPR. For the majority of the compounds it was possible to solve their solid state structure by single crystal X-ray diffraction. Tests for olefin polymerization were performed in order to determine the catalytic activity of the Co(II) complexes. Chapter I presents a brief introduction to homogenous catalysis, highlighting the reactions catalyzed by the type of compounds described in this thesis, namely olefin polymerization and oligomerization and reactions catalyzed by the complexes bearing α-diimines and P,O type ligands. Chapter II is dedicated to the description of the synthesis of new α-diimines cobalt (II) complexes, of general formula [CoX2(α-diimine)], where X = Cl or I and the α-diimines are bis(aryl)acenaphthenequinonediimine) (Ar-BIAN) and 1,4-diaryl-2,3-dimethyl-1,4-diaza-1,3-butadiene (Ar-DAB). Structures solved by single crystal X-ray diffraction were obtained for all the described complexes. For some of the compounds, X-band EPR measurements were performed on polycrystalline samples, showing a high-spin Co(II) (S = 3/2) ion, in a distorted axial environment. EPR single crystal experiments on two of the compounds allowed us to determine the g tensor orientation in the molecular structure. In Chapter III we continue with the synthesis and characterization of more cobalt (II)complexes bearing α-diimines of general formula [CoX2(α-diimine)], with X = Cl or I and α-diimines are bis(aryl)acenaphthenequinonediimine) (Ar-BIAN) and 1,4-diaryl-2,3-dimethyl- 1,4-diaza-1,3-butadiene (Ar-DAB). The structures of three of the new compounds synthesized were determined by single crystal X-ray diffraction. A NMR paramagnetic characterization of all the compounds described is presented. Ethylene polymerization tests were done to determine the catalytic activity of several of the Co(II) complexes described in Chapter II and III and their results are shown. In Chapter IV a new rigid bidentate ligand, bis(1-naphthylimino)acenaphthene, and its complexes with Zn(II) and Pd(II), were synthesized. Both the ligand and its complexes show syn and anti isomers. Structures of the ligand and the anti isomer of the Pd(II) complex were solved by single crystal X-ray diffraction. All the compounds were characterized by elemental analysis, MALDI-TOF-MS spectrometry, and by IR, UV-vis, 1H, 13C, 1H-1H COSY, 1H-13C HSQC, 1H-13C HSQC-TOCSY and 1H-1H NOESY NMR when necessary. DFT studies showed that both conformers of [PdCl2(BIAN)] are isoenergetics and can be obtain experimentally. However, we can predict that the isomerization process is not available in square-planar complex, but is possible for the free ligand. The molecular geometry is very similar in both isomers, and only different orientations for naphthyl groups can be expected. Chapter V describes the synthesis of new P, O type ligands, β-keto phosphine, R2PCH2C(O)Ph, and acetamide phosphine R2PNHC(O)Me, as well as a series of new cobalt(III) complexes namely [(η5-C5H5)CoI2{Ph2PCH2C(O)Ph}], and [(η5- C5H5)CoI2{Ph2PNHC(O)Me}]. Treating these Co(III) compounds with an excess of Et3N, resulted in complexes η2-phosphinoenolate [(η5-C5H5)CoI{Ph2PCH…C(…O)Ph}] and η2- acetamide phosphine [(η5-C5H5)CoI{Ph2PN…C(…O)Me}]. Nickel (II) complexes were also obtained: cis-[Ni(Ph2PN…C(…O)Me)2] and cis-[Ni((i-Pr)2PN…C(…O)Me)2]. Their geometry and isomerism were discussed. Seven structures of the compounds described in this chapter were determined by single crystal X-ray diffraction. The general conclusions of this work can be found in Chapter VI.

Synthesis of the Piacenzian onshore record between the Aveiro and Setubal parallels (Western portuguese margin)

Onshore, the Piacenzianof the Mondego and Lower Tagus Tertiary basins comprises siliciclastic sediments deposited in shallow marine to continental environments. The outcrops of the deposits are relatively widespread in the Aveiro and Seuibal region. A lithostratigraphic synthesis based on the correlation of geological sections, is presented for the two basins. In general, the Piacenzian sediments display a regressive sucession. The Late Tortonian-Zanclean (?) confined drainage pattern changed at the beginning of Piazencian, to fluvial systems draining to the Atlantic, and capturing the drainage of the inner parts of the Hesperic Meseta. The Piacenzian sedimentary sequence post-dates one of the uprising phases during Neogene compression, recorded by a strong regional unconformity. Some local active faulting - as in Lousa, Rio Maior and Senibal- Pinhal Novo - allowed the local thickening of the sedimentary record. Later compressive tectonism continues to generate reverse faulting and diapiric reactivation, affecting those sediments. Currently, the Piacenzian deposits culminates the marginal piedmonts, widely eroded by the Quaternary fluvial dissection.

Parallel hyperspectral unmixing on GPUs

This letter presents a new parallel method for hyperspectral unmixing composed by the efficient combination of two popular methods: vertex component analysis (VCA) and sparse unmixing by variable splitting and augmented Lagrangian (SUNSAL). First, VCA extracts the endmember signatures, and then, SUNSAL is used to estimate the abundance fractions. Both techniques are highly parallelizable, which significantly reduces the computing time. A design for the commodity graphics processing units of the two methods is presented and evaluated. Experimental results obtained for simulated and real hyperspectral data sets reveal speedups up to 100 times, which grants real-time response required by many remotely sensed hyperspectral applications.

Copper-organic frameworks assembled from in situ generated 5-(4-pyridyl) tetrazole building blocks: synthesis, structural features, topological analysis and catalytic oxidation of alcohols

Two new metal- organic compounds {[Cu-3(mu(3)-4-(p)tz)(4)(mu(2)-N-3)(2)(DMF)(2)](DMF)(2)}(n) (1) and {[Cu(4ptz) (2)(H2O)(2)]}(n) (2) {4-ptz = 5-(4-pyridyl)tetrazolate} with 3D and 2D coordination networks, respectively, have been synthesized while studying the effect of reaction conditions on the coordination modes of 4-pytz by employing the [2 + 3] cycloaddition as a tool for generating in situ the 5-substituted tetrazole ligands from 4-pyridinecarbonitrile and NaN3 in the presence of a copper(II) salt. The obtained compounds have been structurally characterized and the topological analysis of 1 discloses a topologically unique trinodal 3,5,6-connected 3D network which, upon further simplification, results in a uninodal 8-connected underlying net with the bcu (body centred cubic) topology driven by the [Cu-3(mu(2)-N-3)(2)] cluster nodes and mu(3)-4-ptz linkers. In contrast, the 2D metal-organic network in 2 has been classified as a uninodal 4-connected underlying net with the sql [Shubnikov tetragonal plane net] topology assembled from the Cu nodes and mu(2)-4-ptz linkers. The catalytic investigations disclosed that 1 and 2 act as active catalyst precursors towards the microwave-assisted homogeneous oxidation of secondary alcohols (1-phenylethanol, cyclohexanol, 2-hexanol, 3-hexanol, 2-octanol and 3-octanol) with tert-butylhydroperoxide, leading to the yields of the corresponding ketones up to 86% (TOF = 430 h(-1)) and 58% (TOF = 290 h(-1)) in the oxidation of 1-phenylethanol and cyclohexanol, respectively, after 1 h under low power ( 10 W) microwave irradiation, and in the absence of any added solvent or additive.

Design, synthesis and biologival evaluation of novel isoniazid derivatives with potente antitubercular activity

The disturbing emergence of multidrug-resistant strains of Mycobacterium tuberculosis (Mtb) has been driving the scientific community to urgently search for new and efficient antitubercular drugs. Despite the various drugs currently under evaluation, isoniazid is still the key and most effective component in all multi-therapeutic regimens recommended by the WHO. This paper describes the QSAR-oriented design, synthesis and in vitro antitubercular activity of several potent isoniazid derivatives (isonicotinoyl hydrazones and isonicotinoyl hydrazides) against H37Rv and two resistant Mtb strains. QSAR studies entailed RFs and ASNNs classification models, as well as MLR models. Strict validation procedures were used to guarantee the models' robustness and predictive ability. Lipophilicity was shown not to be relevant to explain the activity of these derivatives, whereas shorter N-N distances and lengthy substituents lead to more active compounds. Compounds I, 2, 4, 5 and 6, showed measured activities against H37Rv higher than INH (i.e., MIC <= 0.28 mu M), while compound 9 exhibited a six fold decrease in MIC against the katG (S315T) mutated strain, by comparison with INH (Le., 6.9 vs. 43.8 mu M). All compounds were ineffective against H37Rv(INH) (Delta katG), a strain with a full deletion of the katG gene, thus corroborating the importance of KatG in the activation of INH-based compounds. The most potent compounds were also shown not to be cytotoxic up to a concentration 500 times higher than MIC. (C) 2014 Elsevier Masson SAS. All rights reserved.