Ethyl oleate ozonide as an epoxidation tool of C60 and C70 fullerenes

When dissolved in ethyl oleate secondary ozonide, both C₆₀ and C₇₀ fullerenes undergo a series of epoxidation reactions. The pseudofirst-order kinetic rate constants of this process were determined spectrophotometrically at various temperatures and the activation energy for C₆₀ epoxidation through ethyl oleate ozonide was found at 25.9 kcal/mol. Furthermore, C₆₀ was found more reactive than C₇₀ with the ozonide. The kinetics rate constants of C₆₀ epoxidation with ethyl oleate ozonide were compared with the C₆₀ photo-oxidation and auto-oxidation determined in pure ethyl oleate. The epoxidation of fullerenes starts from the homolysis of the peroxide group of the 1,2,4-trioxolane ring of ethyl oleate secondary ozonide. Thus, it is suggested that fullerenes have a potential as decomposition agents of secondary ozonides in some technological applications.     

Sorafenib delivery nanoplatform based on superparamagnetic iron oxide nanoparticles magnetically targets hepatocellular carcinoma

Currently,sorafenib is the only systemic therapy capable of increasing overall survival of hepatocellular carcinoma patients.Unfortunately,its side effects,particularly its overall toxicity,limit the therapeutic response that can be achieved.Superparamagnetic iron oxide nanoparticles (SPIONs) are very attractive for drug delivery because they can be targeted to specific sites in the body through application of a magnetic field,thus improving intratumoral accumulation and reducing adverse effects.Here,nanoformulations based on polyethylene glycol modified phospholipid micelles,loaded with both SPIONs and sorafenib,were successfully prepared and thoroughly investigated by complementary techniques.This nanovector system provided effective drug delivery,had an average hydrodynamic diameter of about 125 nm,had good stability in aqueous medium,and allowed controlled drug loading.Magnetic analysis allowed accurate determination of the amount of SPIONs embedded in each micelle.An in vitro system was designed to test whether the SPION micelles can be efficiently held using a magnetic field under typical flow conditions found in the human liver.Human hepatocellular carcinoma (HepG2) cells were selected as an in vitro system to evaluate tumor cell targeting efficacy of the superparamagnetic micelles loaded with sorafenib.These experiments demonstrated that this delivery platform is able to enhance sorafenib's antitumor effectiveness by magnetic targeting.The magnetic nanovectors described here represent promising candidates for targeting specific hepatic tumor sites,where selective release of sorafenib can improve its efficacy and safety profile.     

Protein kinase C-dependent in vivo phosphorylation of prourokinase leads to the formation of a receptor competitive antagonist

We recently reported that in vivo phosphorylation of urokinase-type plasminogen activator on Ser138/303 prevents its catalytic-independent ability to promote myelomonocytic cell adherence and motility. We now show that Ca2+ activated, phospholipid-dependent protein kinase C from rat brain phosphorylates in vitro a peptide corresponding to prourokinase residues 133-143 (DGKKPSSPPEE) and the full-length molecule on Ser138/139. The in vivo involvement of the protein kinase C isoenzyme family is supported by the finding that inhibition of kinase C activity prevents prourokinase phosphorylation on Ser138/303 in A431 human carcinoma cells. Conversely, a short treatment of A431 cells with phorbol myristate acetate increases the extent of phosphorylated prourokinase and, concomitantly, affects its function; under these conditions, the capability of prourokinase to up-regulate U937 monocyte-like cell adherence is severely impaired, although receptor binding is unaltered. By the aid of a "phosphorylation-like" variant (Ser138 to Glu) we show that modification of Ser138 is sufficient to confer to prourokinase the antagonistic properties observed following in vivo stimulation of protein kinase C activity. These observations provide the first evidence that protein kinase C directs the formation of a receptor competitive antagonist by regulating the in vivo phosphorylation state of prourokinase.     

HLA_ACTOR_REPAST: An approach to distributing RePast models for high-performance simulations

RePast is a popular agent toolkit with proven capabilities to fulfil the modelling challenges of large multi-agent systems (MASs). The toolkit, though, is normally used on a standalone workstation and therefore its practical use can be constrained (in space and time) by the limited available computing resources. This paper proposes an original approach – HLA_ACTOR_REPAST – aimed to distributing RePast models for high-performance simulation of complex scalable models. Novel in HLA_ACTOR_REPAST is an exploitation of a lean actor infrastructure implemented in Java. Actors bring to RePast agents such features as migration, location-transparent naming, efficient communications, and a control-centric framework. Actors can be orchestrated by an in-the-large custom control structure which is in charge of ensuring the necessary message causality constraints. Distribution and time management concerns depend on the IEEE standard HLA middleware. The paper first discusses details of the software engineering process underlying the development of HLA_ACTOR_REPAST. The mapping techniques, assisted by Java text annotations and aspect-oriented programming, try to minimize “code intrusions” in the original model and favour model transparency. The paper then furnishes some experimental data which witness the good performance results achieved by applying HLA_ACTOR_REPAST to a distributed version of a classic MAS benchmark model.     

Understanding user requirements and preferences for a digital library Web portal

This article reports the findings of a user study conducted in the context of the TELplus project to gain insights about user needs and preferences for the digital library services offered by The European Library Web portal. The user requirements collection for the Web portal was designed by adopting a comprehensive survey approach. This combined explicit user feedback with implicit usage data so as to provide a more in-depth analysis of user experience with the portal. The analysis conducted shed light on likely motivations for both participant usage and reluctance to use the services provided, leading to more informed decisions on how to refine, improve, and present Web portal services to their future users. The lessons learnt from this case study also contributed to the development of an integrated methodological framework which provided insights for the future design and evaluation of digital library Web portals and services.     

Registered e-mail (REM) — Reliable e-mail for everybody

The need for REM: For many years now the market felt the need for a registered and reliable e-mail, suitable to provide evidence just like the paper registered mail. Several implementations have been set up to this purpose: Incamail (Switzerland), Posta Elettronica Certificata — PEC (Italy), Euronot@ries’ MAILWITNESS, De-Mail (Germany), etc. Within the EU project “Pan-European Public Procurement Online” — PEPPOL — its Work Project (WP8) is developing a “secure and reliable transport of electronic business documents”.     

Survey on using constraints in data mining

This paper provides an overview of the current state-of-the-art on using constraints in knowledge discovery and data mining. The use of constraints in a data mining task requires specific definition and satisfaction tools during knowledge extraction. This survey proposes three groups of studies based on classification, clustering and pattern mining, whether the constraints are on the data, the models or the measures, respectively. We consider the distinctions between hard and soft constraint satisfaction, and between the knowledge extraction phases where constraints are considered. In addition to discussing how constraints can be used in data mining, we show how constraint-based languages can be used throughout the data mining process.     

Mobile Agent Coordination for Distributed Network Management

Mobile agents are a promising technology to face the problems raised by the increasing complexity and size of today's networks. In particular, in the area of network management, mobile agents can lead to a fully distributed paradigm to overcome the limits of traditional centralized approaches. A basic requirement for the management of a complex network is the definition of high-level and flexible models to coordinate the accesses to the resources—data and services—provided by the network nodes. On this basis, this paper describes the MARS coordination architecture for mobile agents. MARS is based on the definition of programmable tuple spaces associated with the network nodes: mobile agents can access the local resources and services via the tuple space, thus adopting a standard and high-level interface. The network administrator—via mobile agents—can dynamically program the behavior of the tuple space in reaction to the agents' access to the tuple space, thus leading to a flexible network model. Several examples show the effectiveness of the MARS approach in supporting network management activities.     

Path Analysis and Renaming for Predicated Instruction Scheduling

Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural mechanism that increases instruction level parallelism by removing branches and allowing simultaneous execution of multiple paths of control, only committing instructions from the correct path. In order for the compiler to expose and use such parallelism, traditional compiler data-flow and path analysis needs to be extended to predicated code. In this paper, we motivate the need for renaming and for predicates that reflect path information. We present Predicated Static Single Assignment (PSSA) which uses renaming and introduces Full -Path Predicates to remove false dependences and enable aggressive predicated optimization and instruction scheduling. We demonstrate the usefulness of PSSA for Predicated Speculation and Control Height Reduction. These two predicated code optimizations used during instruction scheduling reduce the dependence length of the critical paths through a predicated region. Our results show that using PSSA to enable speculation and control height reduction reduces execution time from 12 to 68%.