Flexible,Mechanically Stable,Porous Self-Standing Microfiber Network Membranes of Covalent Organic Frameworks: Preparation Method and Characterization

Covalent organic frameworks (COFs) show advantageous characteristics, such as an ordered pore structure and a large surface area for gas storage and separation, energy storage, catalysis, and molecular separation. However, COFs usually exist as difficult-to-process powders, and preparing continuous, robust, flexible, foldable, and rollable COF membranes is still a challenge. Herein, such COF membranes with fiber morphology for the first time prepared via a newly introduced template-assisted framework process are reported. This method uses electrospun porous polymer membranes as a sacrificial large dimension template for making self-standing COF membranes. The porous COF fiber membranes, besides having high crystallinity, also show a large surface area (1153 m² g⁻¹), good mechanical stability, excellent thermal stability, and flexibility. This study opens up the possibility of preparation of large dimension COF membranes and their derivatives in a simple way and hence shows promise in technical applications in separation, catalysis, and energy in the future.     

Estimating and reducing the memory requirements of signal processing codes for embedded systems

Most embedded systems have limited amount of memory. In contrast, the memory requirements of the digital signal processing (DSP) and video processing codes (in nested loops, in particular) running on embedded systems is significant. This paper addresses the problem of estimating and reducing the amount of memory needed for transfers of data in embedded systems. First, the problem of estimating the region associated with a statement or the set of elements referenced by a statement during the execution of nested loops is analyzed. For a fixed execution ordering, a quantitative analysis of the number of elements referenced is presented; exact expressions for uniformly generated references and a close upper and lower bound for nonuniformly generated references are derived. Second, in addition to presenting an algorithm that computes the total memory required, this paper also discusses the effect of transformations (that change the execution ordering) on the lifetimes of array variables, i.e., the time between the first and last accesses to a given array location. The term maximum window size is introduced, and quantitative expressions are derived to compute the maximum window size. A detailed analysis of the effect of unimodular transformations on data locality, including the calculation of the maximum window size, is presented.     

Performance of hashed cache data migration schemes on multicomputers

Many researchers approach the problem of programming distributed memory machines by assuming a global shared name space. Thus the user views the distributed memory of the machine as though it were shared. A major issue that arises at this point is how to manage the memory. When a processor accesses data stored on another processor's memory, data must be moved between the two processors. Once these data are retrieved from another processor's memory, several interesting issues are raised. Where should these data be stored locally? What transformations must be performed to the code to guarantee that the nonlocal accesses reference the correct memory location? What optimizations can be performed to reduce the time spent in accessing the nonlocal data? In this paper we examine various data migration mechanisms that allow an explicit and controlled mapping of data to memory. We describe, experimentally evaluate, and model a set of schemes for storing and retrieving off-processor array elements. The schemes are all based on using hash tables for efficient access of nonlocal data. The three different techniques evaluated are the basic hashed cache, partial enumeration, and full enumeration, the details of which are described in the paper. In all three schemes, nonlocal data are stored in hash tables—the difference is in the amount of memory used by the schemes and the retrieval mechanisms for nonlocal data.     

Reliability models for computer systems: An overview including dataflow graphs

The reliability of a system is the probability that the system will perform its intended mission under given conditions. This paper provides an overview of the approaches to reliability modelling and identifies their strengths and weaknesses. The models discussed include structure models, simple stochastic models and decomposable stochastic models. Ignoring time-dependence, structure models give reliability as a function of the topological structure of the system. Simple stochastic models make direct use of the properties of underlying stochastic processes, while decomposable models consider more complex systems and analyse them through subsystems. Petri nets and dataflow graphs facilitate the analysis of complex systems by providing a convenient framework for reliability analysis.     

Studies of photoconductivity in β-Apo-8′ carotenal

The photoconductive properties of a carotenoid polyene,β-Apo-8′ carotenal in polycrystalline form has been studied. The growth of the photocurrent shows an overshoot in the growth-time curve before steady state value is attained. This behaviour of photocurrent is proposed to be due to higher value of recombination coefficient than trapping coefficient. From the temperature dependence study it is observed that the steady state photocurrent, at first increases with increase of temperature, attains a maximum at a particular temperatureT _max and then decreases with temperature. TheT _max value agrees with the temperature above and below which steady state photocurrent is attained differently. Monomolecular and bimolecular recombination processes at two temperature regimes are proposed to account for the observed behaviour. The dependence of photocurrent with excitation light intensity and wavelength study provide information on the carrier generation processes. The fast decay of photocurrent have been observed at different temperatures and from this study the decay constant is calculated and it is found to be temperature independent.     

Adenosine A1 receptor stimulation antagonizes the negative inotropic effects of the PKC activator dioctanoylglycerol

It has been suggested that adenosine cardioprotection occurs via adenosine A1 receptor-mediated activation of protein kinase C (PKC). However, adenosine has well-known vasodilatory effects in the myocardium, whereas PKC is a vasoconstrictor. This study examined whether adenosine A1 receptor activation alters the effects of the PKC activator. 1,2-dioctanoyl-s,n-glycerol (DOG) in isolated perfused rat hearts (left-ventricular developed pressure) and rat ventricular myocytes ([Ca2+]i and cell shortening). Exposure to DOG decreased left-ventricular developed pressure by 30%, an effect that was completely reversible. Pretreatment of isolated hearts with either the PKC inhibitor chelerythrine or the adenosine A1 agonist 2-chloro-N6-cyclo-cyclo-isolated pentlyadenosine (CCPA) attenuated the negative inotropic effects of DOG. In the isolated myocytes, DOG decreased [Ca2+]i and cell shortening by 25 and 28%, respectively, effects that were attenuated by both chelerythrine and CCPA. The CCPA attenuation of the DOG-induced decrease in [Ca2+]i and cell shortening was blocked by pretreating the myocytes with the adenosine A1 antagonist, 8-cyclopentyl-1,3-dipropylxanthine (DPCPX). These results indicate that in rat ventricular myocardium, adenosine A1 receptor activation attenuates the apparent PKC-dependent negative inotropic effects of DOG via preservation of [Ca2+]i levels.