High aspect ratio, processable coordination polymer gel nanotubes based on an AIE-active LMWG with tunable emission

A new TPE based low molecular weight gelator (LMWG) which displays both AIE and MCIE phenomena in gel state has been synthesized. LMWG self-assembles to form 1D nanofibers which undergo morphology transformation to coordination polymer gel (CPG) nanotubes upon metal ion coordination. CPG shows enhanced mechanical stability along with tunable emission properties.

Uncertainty Quantification in Ultrasonic Wave Based Detection of Delamination in Composite Structures

In this paper we consider the problem of guided wave scattering from delamination in laminated composite and further the problem of estimating delamination size and layer-wise location from the guided wave measurement. Damage location and region/size can be estimated from time of flight and wave packet spread, whereas depth information can be obtained from wavenumber modulation in the carrier packet. The key challenge is that these information are highly sensitive to various uncertainties. Variation in reflected and transmitted wave amplitude in a bar due to boundary/interface uncertainty is studied to illustrate such effect. Effect of uncertainty in material parameters on the time of flight are estimated for longitudinal wave propagation. To evaluate the effect of uncertainty in delamination detection, we employ a time domain spectral finite element (tSFEM) scheme where wave propagation is modeled using higher-order interpolation with shape function have spectral convergence properties. A laminated composite beam with layer-wise placement of delamination is considered in the simulation. Scattering due to the presence of delamination is analyzed. For a single delamination, two identical waveforms are created at the two fronts of the delamination, whereas waves in the two sub-laminates create two independent waveforms with different wavelengths. Scattering due to multiple delaminations in composite beam is studied.

Dehydration for a solid coordination network based on CuII-(py)2C(OH)2 trimers

Abstract de congreso: Póster presentado en 12th International Conference on Materials Chemistry (MC12), 20 - 23 July 2015, York, United Kingdom

Metalloporphyrin-based MOFs: First Cobalt Based TPPS-bipy Coordination Network

Poster presentado en el congreso: Third International Conference on Multifunctional, Hybrid and Nanomaterials (3-7 March 2013, Sorrento, Italy)

Heterogeneous catalytic activity on Mn, Fe and Co-based metalloporphyrinic Solid Coordination Frameworks (SCFs)

Comunicación al congreso 1st European Conference on Metal Organic Frameworks and Porous Polymers, celebrado en Postdam del 11 al 14 de octubre de 2015

Uncertainty management for on-line optimisation of a POMDP-based large-scale spoken dialogue system

The optimization of dialogue policies using reinforcement learning (RL) is now an accepted part of the state of the art in spoken dialogue systems (SDS). Yet, it is still the case that the commonly used training algorithms for SDS require a large number of dialogues and hence most systems still rely on artificial data generated by a user simulator. Optimization is therefore performed off-line before releasing the system to real users. Gaussian Processes (GP) for RL have recently been applied to dialogue systems. One advantage of GP is that they compute an explicit measure of uncertainty in the value function estimates computed during learning. In this paper, a class of novel learning strategies is described which use uncertainty to control exploration on-line. Comparisons between several exploration schemes show that significant improvements to learning speed can be obtained and that rapid and safe online optimisation is possible, even on a complex task. Copyright © 2011 ISCA.

A coordination-based approach to elasticity of floppy and stiff random networks

We study the role of connectivity on the linear and nonlinear elastic behavior of amorphous systems using a two-dimensional random network of harmonic springs as a model system. A natural characterization of these systems arises in terms of the network coordination relative to that of an isostatic network $\delta z$; a floppy network has $\delta z<0$, while a stiff network has $\delta z>0$. Under the influence of an externally applied load we observe that the response of both floppy and rigid network are controlled by the same critical point, corresponding to the onset of rigidity. We use numerical simulations to compute the exponents which characterize the shear modulus, the amplitude of non-affine displacements, and the network stiffening as a function of $\delta z$, derive these theoretically and make predictions for the mechanical response of glasses and fibrous networks.

Study of remote sensing based parameter uncertainty in Production Efficiency Models

The remote sensing based Production Efficiency Models (PEMs), springs from the concept of "Light Use Efficiency" and has been applied more and more in estimating terrestrial Net Primary Productivity (NPP) regionally and globally. However, global NPP estimates vary greatly among different models in different data sources and handling methods. Because direct observation or measurement of NPP is unavailable at global scale, the precision and reliability of the models cannot be guaranteed. Though, there are ways to improve the accuracy of the models from input parameters. In this study, five remote sensing based PEMs have been compared: CASA, GLO-PEM, TURC, SDBM and VPM. We divided input parameters into three categories, and analyzed the uncertainty of (1) vegetation distribution, (2) fraction of photosynthetically active radiation absorbed by the canopy (fPAR) and (3) light use efficiency (e). Ground measurements of Hulunbeier typical grassland and meteorology measurements were introduced for accuracy evaluation. Results show that a real-time, more accurate vegetation distribution could significantly affect the accuracy of the models, since it's applied directly or indirectly in all models and affects other parameters simultaneously. Higher spatial and spectral resolution remote sensing data may reduce uncertainty of fPAR up to 51.3%, which is essential to improve model accuracy.

Construction of coordination networks with high connectivity: a new 8-connected self-penetrating network based on tetranuclear metal clusters

Two highly connected cobalt(II) and zinc(II) coordination polymers with tetranuclear metal clusters as the nodes of network have been prepared, being the first example of an 8-connected self-penetrating net based on a cross-linked alpha-Po subnet.

Robust Learning Control for Manipulators with Uncertainty Disturbances Based on Internal Model

In this paper, a disturbance controller is designed for making robotic system behave as a decoupled linear system according to the concept of internal model. Based on the linear system, the paper presents an iterative learning control algorithm to robotic manipulators. A sufficient condition for convergence is provided. The selection of parameter values of the algorithm is simple and easy to meet the convergence condition. The simulation results demonstrate the effectiveness of the algorithm..

Detour-Based Mobility Coordination in DTNs

Commonly, research work in routing for delay tolerant networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that control the mobility of these nodes. In this paper, we argue that for many applications such an assumption is too restrictive: while the spatio-temporal coordinates of the start and end points of a node's journey are determined by exogenous processes, the specific path that a node may take in space-time, and hence the set of nodes it may encounter could be controlled in such a way so as to improve the performance of DTN routing. To that end, we consider a setting in which each mobile node is governed by a schedule consisting of a ist of locations that the node must visit at particular times. Typically, such schedules exhibit some level of slack, which could be leveraged for DTN message delivery purposes. We define the Mobility Coordination Problem (MCP) for DTNs as follows: Given a set of nodes, each with its own schedule, and a set of messages to be exchanged between these nodes, devise a set of node encounters that minimize message delivery delays while satisfying all node schedules. The MCP for DTNs is general enough that it allows us to model and evaluate some of the existing DTN schemes, including data mules and message ferries. In this paper, we show that MCP for DTNs is NP-hard and propose two detour-based approaches to solve the problem. The first (DMD) is a centralized heuristic that leverages knowledge of the message workload to suggest specific detours to optimize message delivery. The second (DNE) is a distributed heuristic that is oblivious to the message workload, and which selects detours so as to maximize node encounters. We evaluate the performance of these detour-based approaches using extensive simulations based on synthetic workloads as well as real schedules obtained from taxi logs in a major metropolitan area. Our evaluation shows that our centralized, workload-aware DMD approach yields the best performance, in terms of message delay and delivery success ratio, and that our distributed, workload-oblivious DNE approach yields favorable performance when compared to approaches that require the use of data mules and message ferries.

Preferential Field Coverage Through Detour-Based Mobility Coordination

Controlling the mobility pattern of mobile nodes (e.g., robots) to monitor a given field is a well-studied problem in sensor networks. In this setup, absolute control over the nodes’ mobility is assumed. Apart from the physical ones, no other constraints are imposed on planning mobility of these nodes. In this paper, we address a more general version of the problem. Specifically, we consider a setting in which mobility of each node is externally constrained by a schedule consisting of a list of locations that the node must visit at particular times. Typically, such schedules exhibit some level of slack, which could be leveraged to achieve a specific coverage distribution of a field. Such a distribution defines the relative importance of different field locations. We define the Constrained Mobility Coordination problem for Preferential Coverage (CMC-PC) as follows: given a field with a desired monitoring distribution, and a number of nodes n, each with its own schedule, we need to coordinate the mobility of the nodes in order to achieve the following two goals: 1) satisfy the schedules of all nodes, and 2) attain the required coverage of the given field. We show that the CMC-PC problem is NP-complete (by reduction to the Hamiltonian Cycle problem). Then we propose TFM, a distributed heuristic to achieve field coverage that is as close as possible to the required coverage distribution. We verify the premise of TFM using extensive simulations, as well as taxi logs from a major metropolitan area. We compare TFM to the random mobility strategy—the latter provides a lower bound on performance. Our results show that TFM is very successful in matching the required field coverage distribution, and that it provides, at least, two-fold query success ratio for queries that follow the target coverage distribution of the field.