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.     

Sleep in a live-in mining operation: The influence of start times and restricted non-work activities

The amount of sleep obtained between shifts is influenced by numerous factors including the length of work and rest periods, the timing of the rest period relative to the endogenous circadian cycle and personal choices about the use of non-work time. The current study utilised a real-world live-in mining environment to examine the amount of sleep obtained when access to normal domestic, family and social activities was restricted. Participants were 29 mining operators (26 male, average age 37.4 ± 6.8 years) who recorded sleep, work and fatigue information and wore an activity monitor for a cycle of seven day shifts and seven night shifts (both 12 h) followed by either seven or fourteen days off. During the two weeks of work participants lived on-site. Total sleep time was significantly less (p < 0.01) while on-site on both day (6.1 ± 1.0 h) and night shifts (5.7 ± 1.5 h) than days off (7.4 ± 1.4 h). Further, night shift sleep was significantly shorter than day-shift sleep (p < 0.01). Assessment of subjective fatigue ratings showed that the sleep associated with both days off and night shifts had a greater recovery value than sleep associated with day shifts (p < 0.01). While on-site, participants obtained only 6 h of sleep indicating that the absence of competing domestic, family and social activities did not convert to more sleep. Factors including shift start times and circadian influences appear to have been more important.     

Schema mapping and query translation in heterogeneous P2P XML databases

Peers in a peer-to-peer data management system often have heterogeneous schemas and no mediated global schema. To translate queries across peers, we assume each peer provides correspondences between its schema and a small number of other peer schemas. We focus on query reformulation in the presence of heterogeneous XML schemas, including data–metadata conflicts. We develop an algorithm for inferring precise mapping rules from informal schema correspondences. We define the semantics of query answering in this setting and develop query translation algorithm. Our translation handles an expressive fragment of XQuery and works both along and against the direction of mapping rules. We describe the HePToX heterogeneous P2P XML data management system which incorporates our results. We report the results of extensive experiments on HePToX on both synthetic and real datasets. We demonstrate our system utility and scalability on different P2P distributions.     

BOO: Behavior-oriented ontology to describe participant dynamics in collocated design meetings

Facilitating meetings is not an easy task. To assist the facilitator, we have been designing intelligent support systems, which can help contextual sensemaking, decision making and action. However, these systems are constructed based on behavioral models that provide guidelines to understand participant behaviors. This paper presents an ontology to describe participants’ behaviors in collaborative design meetings and rules that correlate them with the group’s acceptance of the final product. This ontology describes the group dynamics at collocated meetings, using verbal and non-verbal cues of attention shifts and attention maintenance as its basic constructs. The objective of creating this ontology was to better understand face-to-face meetings to eventually help meeting facilitators identify issues that may lead to dissatisfaction with the final product through behavioral cues. The ontology was derived through extensive analysis of a series of engineering design session videos. The design group was composed of experts with similar backgrounds, but working in different divisions of the same company. Different points of view were argued and decisions were made at the end of each meeting. After each meeting, participants were asked to asynchronously commit to the decisions made in the group. Our ontology can be used to identify the factors that lead to an undesired outcome, and now serves as a basis for a new project, which uses rules to support design meetings, improve final artifact acceptance and reduce rework. Our conclusions point out correlations between designers’ behaviors and future artifact acceptance and actions that interrupt or bring back group attention. The ontology was validated through application to other meeting situations. These findings may guide software developers in the creation of tools to support group design, and may be applied by an intelligent system.     

DipGame: A challenging negotiation testbed

There is a chronic lack of shared application domains to test advanced research models and agent negotiation architectures in Multiagent Systems. In this paper we introduce a friendly testbed for that purpose. The testbed is based on The Diplomacy Game where negotiation and the relationships between players play an essential role. The testbed profits from the existence of a large community of human players that know the game and can easily provide data for experiments. We explain the infrastructure in the paper and make it freely available to the AI community.     

Applying machine learning techniques for scaling out data quality algorithms in cloud computing environments

Deduplication is the task of identifying the entities in a data set which refer to the same real world object. Over the last decades, this problem has been largely investigated and many techniques have been proposed to improve the efficiency and effectiveness of the deduplication algorithms. As data sets become larger, such algorithms may generate critical bottlenecks regarding memory usage and execution time. In this context, cloud computing environments have been used for scaling out data quality algorithms. In this paper, we investigate the efficacy of different machine learning techniques for scaling out virtual clusters for the execution of deduplication algorithms under predefined time restrictions. We also propose specific heuristics (Best Performing Allocation, Probabilistic Best Performing Allocation, Tunable Allocation, Adaptive Allocation and Sliced Training Data) which, together with the machine learning techniques, are able to tune the virtual cluster estimations as demands fluctuate over time. The experiments we have carried out using multiple scale data sets have provided many insights regarding the adequacy of the considered machine learning algorithms and proposed heuristics for tackling cloud computing provisioning.     

Supporting Unified Distributed Management and Autonomic Decisions: Design,Implementation and Deployment

Nowadays, the prevailing use of networks based on traditional centralized management systems reflects on a fast increase of the management costs. The growth in the number of network equipments and services reinforces the need to distribute the management responsibilities throughout the network devices. In this approach, each device executes common network management functionalities, being part of the overall network management platform. In this paper, we present a Unified Distributed Network Management (UDNM) framework that provides a unified (wired and wireless) management network solution, where further different network services can take part of this infrastructure, e.g., flow monitoring, accurate routing decisions, distributed policies dissemination, etc. This framework is divided in two main components: (A) Situation awareness, which sets up initial information through bootstrapping, discovery, fault-management process and exchange of management information; (B) Autonomic Decision System (ADS) that performs distributed decisions in the network with incomplete information. We deploy the UDNM framework in a testbed which involves two cities (\(\approx\)250 km between), different standards (IEEE 802.3, IEEE 802.11 and IEEE 802.16e) and network technologies, such as, wired virtual grid, wireless ad-hoc gateways, ad-hoc mobile access devices. The UDNM framework integrates management functionalities into the managed devices, proving to be a lightweight and easy-respond framework. The performance analysis shows that the UDNM framework is feasible to unify devices management functionalities and to take accurate decisions on top of a real network.     

The effect of the temporal resolution of NDVI data on season onset dates and trends across Canadian broadleaf forests

Satellite remote sensing has the potential to contribute to plant phenology monitoring at spatial and temporal scales relevant for regional and global scale studies. Historically, temporal composites of satellite data, ranging from 8 days to 16 days, have been used as a starting point for satellite-derived phenology data sets. In this study we assess how the temporal resolution of such composites affects the estimation of the start of season (SOS) by: 1) calibrating a relationship between satellite derived SOS with in situ leaf unfolding (LU) of trembling aspen (Populus tremuloides) across Canada and 2) quantifying the sensitivity of calibrated satellite SOS estimates and trends, over Canadian broadleaf forests, to the temporal resolution of NDVI data. SOS estimates and trends derived from daily NDVI data were compared to SOS estimates and trends derived from multiday NDVI composites that retain the exact date of the maximum NDVI value or that assume the midpoint of the multiday interval as the observation date. In situ observations of LU dates were acquired from the PlantWatch Canada network. A new Canadian database of cloud and snow screened daily 1-km resolution National Oceanic and Atmospheric Administration advanced very high resolution radiometer surface reflectance images was used as input satellite data. The mean absolute errors of SOS dates with respect to in situ LU dates ranged between 13 and 40 days. SOS estimates from NDVI composites that retain the exact date of the maximum NDVI value had smaller errors (~ 13 to 20 days). The sensitivity analysis reinforced these findings: SOS estimates from NDVI composites that use the exact date had smaller absolute deviations from the LU date (0 to − 5 days) than the SOS estimates from NDVI composites that use the midpoint (− 2 to − 27 days). The SOS trends between 1985 and 2007 were not sensitive to the temporal resolution or compositing methods. However, SOS trends at individual ecozones showed significant differences with the SOS trends from daily NDVI data (Taiga plains and the Pacific maritime zones). Overall, our results suggest that satellite based estimates of vegetation green-up dates should preferably use sub-sampled NDVI composites that include the exact observation date of the maximum NDVI to minimize errors in both, SOS estimates and SOS trend analyses. For trend analyses alone, any of the compositing methods could be used, preferably with composite intervals of less than 28 days. This is an important finding, as it suggests that existing long-term 10-day or 15-day NDVI composites could be used for SOS trend analyses over broadleaf forests in Canada or similar areas. Future studies will take advantage of the growing in situ phenology networks to improve the validation of satellite derived green-up dates.     

Diagnosing and correcting design inconsistencies in source code with logical abduction

Correcting design decay in source code is not a trivial task. Diagnosing and subsequently correcting inconsistencies between a software system’s code and its design rules (e.g., database queries are only allowed in the persistence layer) and coding conventions can be complex, time-consuming and error-prone. Providing support for this process is therefore highly desirable, but of a far greater complexity than suggesting basic corrective actions for simplistic implementation problems (like the “declare a local variable for non-declared variable” suggested by Eclipse).We present an abductive reasoning approach to inconsistency correction that consists of (1) a means for developers to document and verify a system’s design and coding rules, (2) an abductive logic reasoner that hypothesizes possible causes of inconsistencies between the system’s code and the documented rules and (3) a library of corrective actions for each hypothesized cause. This work builds on our previous work, where we expressed design rules as equality relationships between sets of source code artifacts (e.g., the set of methods in the persistence layer is the same as the set of methods that query the database). In this paper, we generalize our approach to design rules expressed as user-defined binary relationships between two sets of source code artifacts (e.g., every state changing method should invoke a persistence method).We illustrate our approach on the design of IntensiVE, a tool suite that enables defining sets of source code artifacts intensionally (by means of logic queries) and verifying relationships between such sets.