Independence of Containing Patterns Property and Its Application in Tree Pattern Query Rewriting Using Views

We show that several classes of tree patterns observe the independence of containing patterns property, that is, if a pattern is contained in the union of several patterns, then it is contained in one of them. We apply this property to two related problems on tree pattern rewriting using views. First, given view V and query Q, is it possible for Q to have an equivalent rewriting using V which is the union of two or more tree patterns, but not an equivalent rewriting which is a single pattern? This problem is of both theoretical and practical importance because, if the answer is no, then, to find an equivalent rewriting of a tree pattern using a view, we should use more efficient methods, such as the polynomial time algorithm of Xu and Özsoyoglu (2005), rather than try to find the union of all contained rewritings (which takes exponential time in the worst case) and test its equivalence to Q. Second, given a set S of views, we want to know under what conditions a subset S′ of S is redundant in the sense that for any query Q, the contained rewritings of Q using the views in S′ are contained in those using the views in S???S′. Solving this problem can help us to, for example, choose the minimum number of views to be cached, or better design the virtual schema in a mediated data integration system, or avoid repeated calculation in query optimization. For the first problem, we identify several classes of tree patterns for which the equivalent rewriting can be expressed as a single tree pattern. For the second problem, we present necessary and sufficient conditions for S′ to be redundant with respect to some classes of tree patterns. For both problems we consider extension to cases where there are rewritings using the intersection of multiple views and/or where a schema graph is present.     

Automatic computation of the travelling wave solutions to nonlinear PDEs

Various extensions of the tanh-function method and their implementations for finding explicit travelling wave solutions to nonlinear partial differential equations (PDEs) have been reported in the literature. However, some solutions are often missed by these packages. In this paper, a new algorithm and its implementation called TWS for solving single nonlinear PDEs are presented. TWS is implemented in Maple 10. It turns out that, for PDEs whose balancing numbers are not positive integers, TWS works much better than existing packages. Furthermore, TWS obtains more solutions than existing packages for most cases.

Program summary

Program title:TWSCatalogue identifier:AEAM_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAM_v1_0.htmlProgram obtainable from:CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions:Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.:1250No. of bytes in distributed program, including test data, etc.:78 101Distribution format:tar.gzProgramming language:Maple 10Computer:A laptop with 1.6 GHz Pentium CPUOperating system:Windows XP ProfessionalRAM:760 MbytesClassification:5Nature of problem:Finding the travelling wave solutions to single nonlinear PDEs.Solution method:Based on tanh-function method.Restrictions:The current version of this package can only deal with single autonomous PDEs or ODEs, not systems of PDEs or ODEs. However, the PDEs can have any finite number of independent space variables in addition to time t.Unusual features:For PDEs whose balancing numbers are not positive integers, TWS works much better than existing packages. Furthermore, TWS obtains more solutions than existing packages for most cases.Additional comments:It is easy to use.Running time:Less than 20 seconds for most cases, between 20 to 100 seconds for some cases, over 100 seconds for few cases.References:[1] E.S. Cheb-Terrab, K. von Bulow, Comput. Phys. Comm. 90 (1995) 102.[2] S.A. Elwakil, S.K. El-Labany, M.A. Zahran, R. Sabry, Phys. Lett. A 299 (2002) 179.[3] E. Fan, Phys. Lett. 277 (2000) 212.[4] W. Malfliet, Amer. J. Phys. 60 (1992) 650.[5] W. Malfliet, W. Hereman, Phys. Scripta 54 (1996) 563.[6] E.J. Parkes, B.R. Duffy, Comput. Phys. Comm. 98 (1996) 288.     

Highly Efficient Quasi 2D Blue Perovskite Electroluminescence Leveraging a Dual Ligand Composition

Perovskite light-emitting diodes (PeLEDs) are advancing because of their superior external quantum efficiencies (EQEs) and color purity. Still, additional work is needed for blue PeLEDs to achieve the same benchmarks as the other visible colors. This study demonstrates an extremely efficient blue PeLED with a 488 nm peak emission, a maximum luminance of 8600 cd m⁻², and a maximum EQE of 12.2% by incorporating the double-sided ethane-1,2-diammonium bromide (EDBr₂) ligand salt along with the long-chain ligand methylphenylammonium chloride (MeCl). The EDBr₂ successfully improves the interaction between 2D perovskite layers by reducing the weak van der Waals interaction and creating a Dion–Jacobson (DJ) structure. Whereas the pristine sample (without EDBr₂) is inhibited by small stacking number (n) 2D phases with nonradiative recombination regions that diminish the PeLED performance, adding EDBr₂ successfully enables better energy transfer from small n phases to larger n phases. As evidenced by photoluminescence (PL), scanning electron microscopy (SEM), and atomic force microscopy (AFM) characterization, EDBr₂ improves the morphology by reduction of pinholes and passivation of defects, subsequently improving the efficiencies and operational lifetimes of quasi-2D blue PeLEDs.     

A Hemispherical Image Sensor Array Fabricated with Organic Photomemory Transistors

Hemispherical image sensors simplify lens designs, reduce optical aberrations, and improve image resolution for compact wide-field-of-view cameras. To achieve hemispherical image sensors, organic materials are promising candidates due to the following advantages: tunability of optoelectronic/spectral response and low-temperature low-cost processes. Here, a photolithographic process is developed to prepare a hemispherical image sensor array using organic thin film photomemory transistors with a density of 308 pixels per square centimeter. This design includes only one photomemory transistor as a single active pixel, in contrast to the conventional pixel architecture, consisting of select/readout/reset transistors and a photodiode. The organic photomemory transistor, comprising light-sensitive organic semiconductor and charge-trapping dielectric, is able to achieve a linear photoresponse (light intensity range, from 1 to 50 W m⁻²), along with a responsivity as high as 1.6 A W⁻¹ (wavelength = 465 nm) for a dark current of 0.24 A m⁻² (drain voltage = −1.5 V). These observed values represent the best responsivity for similar dark currents among all the reported hemispherical image sensor arrays to date. A transfer method was further developed that does not damage organic materials for hemispherical organic photomemory transistor arrays. These developed techniques are scalable and are amenable for other high-resolution 3D organic semiconductor devices.     

Contribution of various substrates to total citric acid cycle flux and ]anaplerosis as determined by13C isotopomer analysis and O2 consumption in the heart

A simple relationship between parameters derived from a¹³C NMR isotopomer analysis and O₂ consumption is presented that allows measurement of the absolute rate of acetyl-CoA oxidation and anaplerotic flux in tissues oxidizing a mixture of four substrates. The method was first applied in a study of the effects of work state and -adrenergic stimulation on net acetate oxidation and anaplerosis in the isolated working rat heart. The results demonstrate that the anticipated ratio of 2 between O₂ consumption and TCA cycle flux for hearts oxidizing only acetate holds at low workload when anaplerosis is low, but deviates toward a factor of 3 under high workload conditions when anaplerosis is increased. This analysis was also extended to hearts that oxidize a more physiological mixture of substrates including long-chain fatty acids, acetoacetate, lactate, pyruvate, and glucose. We show that the contribution each substrate makes to total TCA cycle flux can be determined by combined¹³C NMR and O₂ consumption measurements. The present study also demonstrates that stimulation of anaplerosis (by addition of propionate) can significantly alter the relative contribution each substrate makes to total TCA cycle flux. We conclude that if¹³C labeling patterns are selected appropriately, a comprehensive picture of flux through all major metabolic pathways feeding the cycle can be determined in a single experiment even when complex physiological mixtures of substrates are provided.     

Development of quantitative structure-activity relationships for explanatory modeling of fast reacting (meth)acrylate monomers bearing novel functionality

The photoinitiated polymerization of (meth)acrylate monomers bearing novel carbamate functionality exhibits significantly greater reaction rate when compared to more traditional acrylate monomers undergoing similar polymerization. This unusually fast reactivity has been the subject of much investigation. In order to suggest an explanatory mechanism for the enhanced polymerization rates we have conducted quantitative structure-activity relationship investigations of these novel monomers. These studies have resulted in statistically sound models with coefficients of multiple determination of R(2)>0.93. Principal component and k nearest neighbor similarity analysis were also conducted on the multiple regression models. These results are discussed in light of published experimental investigations of the photopolymerization reactivity of the novel monomers.     

Adaptive relaxation for querying heterogeneous XML data sources

Searching XML data with a structured XML query can improve the precision of results compared with a keyword search. However, the structural heterogeneity of the large number of XML data sources makes it difficult to answer the structured query exactly. As such, query relaxation is necessary. Previous work on XML query relaxation poses the problem of unnecessary computation of a big number of unqualified relaxed queries. To address this issue, we propose an adaptive relaxation approach which relaxes a query against different data sources differently based on their conformed schemas. In this paper, we present a set of techniques that supports this approach, which includes schema-aware relaxation rules for relaxing a query adaptively, a weighted model for ranking relaxed queries, and algorithms for adaptive relaxation of a query and top-k query processing. We discuss results from a comprehensive set of experiments that show the effectiveness and the efficiency of our approach.