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.     

QoS-Aware Optical Fog-Assisted Cyber-Physical System in the 5G Ready Heterogeneous Network

Wireless Personal Communications - In recent years, the emergence of Internet of things and cyber-physical system provide a proactive and efficacious solution to enable remote monitoring, machine...     

A fine-grain architecture for relational database aggregationoperations

The design and simulation of a bit-sliced processor for relational database aggregation functions, are discussed. The processor, which addresses an important, computationally expensive problem in database computers, takes two tuples as input (one bit at a time) and returns two bits as output every clock cycle. A larger aggregation unit uses a number of identical slice processors, connected according to odd-even network topology, to achieve improved performance on a parallel pipelined processor. The data processing time is completely overlapped with the input and output of data to and from the unit. The design is independent of the tuple size, and since a bit-serial computation is used, the system requires limited interconnection     

Treatment of depressive symptoms during short-term rehabilitation: An attempted replication of the DOUR project.

Objective: To replicate and extend P. A. Lichtenberg and colleagues' (1996) cross-disciplinary intervention to improve physical and mental health among older adults. Participants: 14 depressed older adults (6 treatment, 8 control). Setting: The short-term rehabilitation unit of an urban nursing home. Intervention: Occupational therapists were trained to treat depression using pleasant events and cognitive-behavioral therapies. Outcome Measures: Geriatric Depression Scale, the Short Form-12, and the Multi-Level Assessment Instrument: Activities of Daily Living. Results: No significant group differences were found in physical or mental health. However, more control group members (75%) than treatment group members (33%) were depressed at study completion. Conclusions: The treatment of depressive symptoms can be integrated with a nonmental health treatment modality. (PsycINFO Database Record (c) 2011 APA, all rights reserved)     

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.     

Computational complexity of sorting and joining relations withduplicates

It is shown that the existence of duplicate values in some attribute columns has a significant impact on the computational complexity of the sorting and joining operations. This is especially true when the number of distinct tuple values is a small fraction of the total number of tuples. The authors characterize a multirelation M (n, L) by its cardinality n and the number of distinct elements L it contains. Under this characterization, the worst time complexity of sorting such a multirelation with binary comparisons as basic operations is investigated. Upper and lower bounds on the number of three-branch comparisons needed to sort such a multirelation are established. Thereafter, the methodology used to study the complexity of sorting is applied to the natural join operation. It is shown that the existence of duplicate values in the join attribute columns can be exploited to reduce the computational complexity of the natural join operation