Carbon-based TiO2-x heterostructure nanocomposites for enhanced photocatalytic degradation of dye molecules

Application of brown titanium dioxide (TiO_2-x) and its modified composite forms in the photocatalytic decomposition of organic pollutants in the environment is a promising way to provide solutions for environmental redemption. Herein, we report the synthesis of effective and stable TiO_2-x nanoparticles with g-C₃N₄, RGO, and multiwalled carbon nanotubes (CNTs) using a simple hydrothermal method. Among all the as-synthesized samples, excellent photocatalytic degradation activity was observed for RGO-TiO_2-x nanocomposite with high rate constants of 0.075 min^?1_, 0.083 min^?1 and 0.093 min^?1 for methylene blue, rhodamine-B, and rosebengal dyes under UV–Visible light irradiation, respectively. The altered bandgap (1.8 eV) and the large surface area of RGO-TiO_2-x nanocomposite impacts on both absorption of visible light and efficiency of photogenerated charge electron (e^?)/hole (h⁺) pair separation. This resulted in enhanced photocatalytic property of carbon-based TiO_2-x nanocomposites. A systematic study on the influence of different carbon nanostructures on the photocatalytic activity of brown TiO_2-x is carried out.     

Choice between fixed and variable delays with different reward amounts.

Choice between a variable and a fixed food source was studied in pigeons. The variable source yielded different durations of access to food (changed across experimental conditions) uniquely associated with equiprobable delays of either 20 sec or 60 sec, timed from the choice point. A comparison, elapsing alternative (time-left procedure [J. Gibbon and R. M. Church; see PA, Vol 67:2812]), was associated with fixed access to feeder after a 60-sec delay, timed from the beginning of the trial. Preference was best characterized as reflecting an average of the 2 local rates of reinforcement in the variable alternative (the average of the ratio of each standard amount and its associated delay). The averaging rule characterized initial choice link data well, but terminal link responding showed that Ss also remembered the 2 delay–amount combinations separately. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Influence of Ball Burnishing Process on Equal Channel Angular Pressed Mg-Zn-Si Alloy on the Evolution of Microstructure and Corrosion Properties

Silicon - In the present study, Mg-4Zn-1Si alloy was subjected to equal channel angular pressing (ECAP) up to 4 passes at 300 °C, followed by ball burnishing using 0.3 mm...     

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time

The Contractibility problem takes as input two graphs G and H, and the task is to decide whether H can be obtained from G by a sequence of edge contractions. The Induced Minor and Induced Topological Minor problems are similar, but the first allows both edge contractions and vertex deletions, whereas the latter allows only vertex deletions and vertex dissolutions. All three problems are NP-complete, even for certain fixed graphs H. We show that these problems can be solved in polynomial time for every fixed H when the input graph G is chordal. Our results can be considered tight, since these problems are known to be W[1]-hard on chordal graphs when parameterized by the size of H. To solve Contractibility and Induced Minor, we define and use a generalization of the classic Disjoint Paths problem, where we require the vertices of each of the k paths to be chosen from a specified set. We prove that this variant is NP-complete even when k=2, but that it is polynomial-time solvable on chordal graphs for every fixed k. Our algorithm for Induced Topological Minor is based on another generalization of Disjoint Paths called Induced Disjoint Paths, where the vertices from different paths may no longer be adjacent. We show that this problem, which is known to be NP-complete when k=2, can be solved in polynomial time on chordal graphs even when k is part of the input. Our results fit into the general framework of graph containment problems, where the aim is to decide whether a graph can be modified into another graph by a sequence of specified graph operations. Allowing combinations of the four well-known operations edge deletion, edge contraction, vertex deletion, and vertex dissolution results in the following ten containment relations: (induced) minor, (induced) topological minor, (induced) subgraph, (induced) spanning subgraph, dissolution, and contraction. Our results, combined with existing results, settle the complexity of each of the ten corresponding containment problems on chordal graphs.     

Field Validation of DNDC Model for Methane and Nitrous Oxide Emissions from Rice-based Production Systems of India

The DNDC (DeNitrification and DeComposition) model was tested against experimental data on CH₄ and N₂O emissions from rice fields at different geographical locations in India. There was a good agreement between the simulated and observed values of CH₄ and N₂O emissions. The difference between observed and simulated CH₄ emissions in all sites ranged from −11.6 to 62.5 kg C ha⁻¹ season⁻¹. Most discrepancies between simulated and observed seasonal fluxes were less than 20% of the field estimate of the seasonal flux. The relative deviation between observed and simulated cumulative N₂O emissions ranged from −237.8 to 28.6%. However, some discrepancies existed between observed and simulated seasonal patterns of CH₄ and N₂O emissions. The model simulated zero N₂O emissions from continuously flooded rice fields and poorly simulated CH₄ emissions from Allahabad site. For all other simulated cases, the model satisfactorily simulated the seasonal variations in greenhouse gas emission from paddy fields with different land management. The model also simulated the C and N balances in all the sites, including other gas fluxes, viz. CO₂, NO, NO₂, N₂ and NH₃ emissions. Sensitivity tests for CH₄ indicate that soil texture and pH significantly influenced the CH₄ emission. Changes in organic C content had a moderate influence on CH₄ emission on these sites. Introducing the mid-season drainage reduced CH₄ emissions significantly. Process-based biogeochemical modeling, as with DNDC, can help in identifying strategies for optimizing resource use, increasing productivity, closing yield gaps and reducing adverse environmental impacts.     

On the human ability to discriminate audio ambiances from similar locations of an urban environment

When developing advanced location-based systems augmented with audio ambiances, it would be cost-effective to use a few representative samples from typical environments for describing a larger number of similar locations. The aim of this experiment was to study the human ability to discriminate audio ambiances recorded in similar locations of the same urban environment. A listening experiment consisting of material from three different environments and nine different locations was carried out with nineteen subjects to study the credibility of audio representations for certain environments which would diminish the need for collecting huge audio databases. The first goal was to study to what degree humans are able to recognize whether the recording has been made in an indicated location or in another similar location, when presented with the name of the place, location on a map, and the associated audio ambiance. The second goal was to study whether the ability to discriminate audio ambiances from different locations is affected by a visual cue, by presenting additional information in form of a photograph of the suggested location. The results indicate that audio ambiances from similar urban areas of the same city differ enough so that it is not acceptable to use a single recording as ambience to represent different yet similar locations. Including an image was found to increase the perceived credibility of all the audio samples in representing a certain location. The results suggest that developers of audio-augmented location-based systems should aim at using audio samples recorded on-site for each location in order to achieve a credible impression.     

基于3D打印技术的宽带圆形微带天线

该文介绍了一款环形耦合的圆形贴片天线。采用圆形金属贴片作为天线的辐射贴片,通过在介质板上引入两个谐振环,产生两个新的工作谐振频段。通过调节圆形贴片和耦合环之间的高度,进一步拓宽了天线的工作频段。通过3D打印技术对不规则的介质基板进行加工制作,有效解决了传统加工方法加工难度大及生产周期长的问题。测试结果表明,该天线在3.8~5.8 GHz工作频段内,回波损耗小于10 dB;在5.1 GHz时,天线增益达到8.4 dBi;天线相对带宽为42%,且具有良好的全向辐射特性。天线的测试结果与仿真结果基本吻合。     

Comparing Universal Covers in Polynomial Time

The universal cover T _G of a connected graph G is the unique (possibly infinite) tree covering G, i.e., that allows a locally bijective homomorphism from T _G to G. It is well-known that if a graph G covers a graph H, then their universal covers are isomorphic, and that the latter can be tested in polynomial time by checking if G and H share the same degree refinement matrix. We extend this result to locally injective and locally surjective homomorphisms by following a very different approach. Using linear programming techniques we design two polynomial time algorithms that check if there exists a locally injective or a locally surjective homomorphism, respectively, from a universal cover T _G to a universal cover T _H (both given by their degree matrices). This way we obtain two heuristics for testing the corresponding locally constrained graph homomorphisms. Our algorithm can also be used for testing (subgraph) isomorphism between universal covers, and for checking if there exists a locally injective or locally surjective homomorphism (role assignment) from a given tree to an arbitrary graph H.