Two-dimensional electron states bound to an off-plane donor in a magnetic field

The states of an electron confined in a two-dimensional (2D) plane and bound to an off-plane donor impurity center, in the presence of a magnetic field, are investigated. The energy levels of the ground state and the first three excited states are calculated variationally. The binding energy and the mean orbital radius of these states are obtained as a function of the donor center position and the magnetic field strength. The limiting cases are discussed for an in-plane donor impurity (i.e. a 2D hydrogen atom) as well as for the donor center far away from the 2D plane in strong magnetic fields, which corresponds to a 2D harmonic oscillator.

On the lower bound on the exchange-correlation energy in two dimensions

We study the properties of the lower bound on the exchange-correlation energy in two dimensions. First we review the derivation of the bound and show how it can be written in a simple density-functional form. This form allows an explicit determination of the prefactor of the bound and testing its tightness. Next we focus on finite two-dimensional systems and examine how their distance from the bound depends on the system geometry. The results for the high-density limit suggest that a finite system that comes as close as possible to the ultimate bound on the exchange-correlation energy has circular geometry and a weak confining potential with a negative curvature. (c) 2009 Elsevier B.V. All rights reserved.

Tightened Lieb-Oxford Bound for Systems of Fixed Particle Number

The Lieb-Oxford bound is a constraint upon approximate exchange-correlation functionals. We explore a nonempirical tightening of that bound in both universal and electron number-dependent form. The test functional is PBE. Regarding both atomization energies (slightly worsened) and bond lengths (slightly improved), we find the PBE functional to be remarkably insensitive to the value of the Lieb-Oxford bound. This both rationalizes the use of the original Lieb-Oxford constant in PBE and suggests that enhancement factors more sensitive to sharpened constraints await discovery.

Empirical analysis of the Lieb-Oxford bound in ions and molecules

Universal properties of the Coulomb interaction energy apply to all many-electron systems. Bounds on the exchange-correlation energy, in particular, are important for the construction of improved density functionals. Here we investigate one such universal property-the Lieb-Oxford lower bound-for ionic and molecular systems. In recent work [J Chem Phys 127, 054106 (2007)], we observed that for atoms and electron liquids this bound may be substantially tightened. Calculations for a few ions and molecules suggested the same tendency, but were not conclusive due to the small number of systems considered. Here we extend that analysis to many different families of ions and molecules, and find that for these, too, the bound can be empirically tightened by a similar margin as for atoms and electron liquids. Tightening the Lieb-Oxford bound will have consequences for the performance of various approximate exchange-correlation functionals. (C) 2008 Wiley Periodicals Inc.

Crystal structure of a soluble decoy receptor IL-22BP bound to interleukin-22

Interleukin-22 (IL-22) plays an important role in the regulation of immune and inflammatory responses in mammals. The IL-22 binding protein (IL-22BP), a soluble receptor that specifically binds IL-22, prevents the IL-22/interleukin-22 receptor 1 (IL-22R1)/interleukin-10 receptor 2 (IL-10R2) complex assembly and blocks IL-22 biological activity. Here we present the crystal structure of the IL-22/IL-22BP complex at 2.75 angstrom resolution. The structure reveals IL-22BP residues critical for IL-22 binding, which were confirmed by site-directed mutagenesis and functional studies. Comparison of IL-22/IL-22BP and IL-22/IL-22R1 crystal structures shows that both receptors display an overlapping IL-22 binding surface, which is consistent with the inhibitory role played by IL-22 binding protein.

Continuous GRASP with a local active-set method for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic-based on the CGRASP and GENCAN methods-for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP-GENCAN on a set of benchmark multimodal test functions.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

The bound quiver of a split extension

In this paper, we give a sufficient (which is also necessary under a compatibility hypothesis) condition on a set of arrows in the quiver of an algebra A so that A is a split extension of A/M, where M is the ideal of A generated by the classes of these arrows. We also compare the notion of split extension with that of semiconvex extension of algebras.

Purification and partial characterization of a midgut membrane-bound alpha-glucosidase from Quesada gigas (Hemiptera: Cicadidae)

Adults of Quesada gigas (Hemiptera: Cicadidae) have a major alpha-glucosidase bound to the perimicrovillar membranes, which are lipoprotein membranes that surround the midgut cell microvilli in Hemiptera and Thysanoptera. Determination of the spatial distribution of alpha-glucosidases in Q. gigas midgut showed that this activity is not equally distributed between soluble and membrane-bound isoforms. The major membrane-bound enzyme was solubilized in the detergent Triton X-100 and purified to homogeneity by means of gel filtration on Sephacryl S-100, and ion-exchange on High Q and Mono Q columns. The purified alpha-glucosidase is a protein with a pH optimum of 6.0 against the synthetic substrate p-nitrophenyl alpha-D-glucoside and M(r) of 61,000 (SDS-PAGE). Taking into account V(Max)/K(M) ratios, the enzyme is more active on maltose than sucrose and prefers oligomaltodextrins up to maltopentaose, with lower efficiency for longer chain maltodextrins. The Q gigas alpha-glucosidase was immunolocalized in perimicrovillar membranes by using a monospecific polyclonal antibody raised against the purified enzyme from Dysdercus peruvianus. The role of this enzyme in xylem fluid digestion and its possible involvement in osmoregulation is discussed. (C) 2009 Elsevier Inc. All rights reserved.

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

Statistical bound of genetic solutions to quadratic assignment problems

Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones. 

Online and Offline Gaming as Support for English Education in Swedish Upper Elementary Schools with Focus on Reading Comprehension Online and Offline Gaming as Support for English Education in Swedish Upper Elementary Schools with Focus on Reading Comprehension : A literature review about online and offline gaming as a resource for developing English reading comprehension in Swedish schools in year 4-6

The aim of this degree thesis is to see what research says about the use of computer and video games to support upper elementary pupils’ development in English reading comprehension in Swedish schools. Other goals are to see how online and offline gaming can be integrated in the Swedish schools and what attitudes teachers have towards gaming. The method used is a systematic literature review and the purpose is to analyze chosen articles and to find relevant content that answers the research questions. Five articles were chosen from different databases and were systematically analyzed in this thesis. The results show that online gaming as support for education can be rewarding for some upper elementary pupils in English learning. However, in English reading comprehension there is not much research found which means that more research needs to be made within this area. Moreover, involving online gaming in English language learning seems to be a challenge for teachers mostly because of their lack of knowledge about the subject, even though they are positive to gaming. The lack of knowledge about the subject could be altered with more education and courses in the area.

Teaching grammar: A study of the common English grammar errors and grammar teaching methods that can be relevant for Swedish upper secondary schools

Grammar has always been an important part of language learning. Based on various theories, such as the universal grammar theory (Chomsky, 1959) and, the input theory (Krashen, 1970), the explicit and implicit teaching methods have been developed. Research shows that both methods may have some benefits and disadvantages. The attitude towards English grammar teaching methods in schools has also changed and nowadays grammar teaching methods and learning strategies, as a part of language mastery, are one of the discussion topics among linguists. This study focuses on teacher and learner experiences and beliefs about teaching English grammar and difficulties learners may face. The aim of the study is to conduct a literature review and to find out what scientific knowledge exists concerning the previously named topics. Along with this, the relevant steering documents are investigated focusing on grammar teaching at Swedish upper secondary schools. The universal grammar theory of Chomsky as well as Krashen’s input hypotheses provide the theoretical background for the current study. The study has been conducted applying qualitative and quantitative methods. The systematic search in four databases LIBRIS, ERIK, LLBA and Google Scholar were used for collecting relevant publications. The result shows that scientists’ publications name different grammar areas that are perceived as problematic for learners all over the world. The most common explanation of these difficulties is the influence of learner L1. Research presents teachers’ and learners’ beliefs to the benefits of grammar teaching methods. An effective combination of teaching methods needs to be done to fit learners’ expectations and individual needs. Together, they will contribute to the achieving of higher language proficiency levels and, therefore, they can be successfully applied at Swedish upper secondary schools.

English-medium instruction in Sweden : Perspectives and practices in two upper secondary schools

This thesis presents English-medium instruction (EMI) in the Swedish context, focusing on perspectives and practices in two schools. The research question is as follows: How and why is EMI offered, chosen, and practiced in the Swedish upper secondary school today? The aim is to explore the status of the educational option, the reasons for offering EMI to stakeholders, the stakeholders’ beliefs about and goals of EMI, and the implementation of EMI in the classroom. A survey of all upper secondary schools in Sweden was conducted to ascertain the spread of content teaching through a foreign language. The educational context was studied from an ecological perspective using methods based in linguistic ethnography. Language alternation, academic language, and language hierarchy were all considered. Interviews were analysed for content; and classroom language use was analysed for language choice and function. The concepts of affordance and scaffolding together with translanguaging were key. The de facto policies of the micro contexts of the schools were examined in light of the declared national policy of the macro context of Sweden. The results indicate that the option in Swedish schools has not increased, and also tends to only be EMI—not Content and Language Integrated Learning (CLIL) or instruction through other languages. EMI is offered for prestige, an international profile, marketing potential and personal interest. EMI students are academically motivated and confident, and see the option as “fun”. 100% EMI in the lessons is not the goal or the practice. Translanguaging is abundant, but how language alternation is perceived as an affordance or not differs in the two schools. One focuses on how the languages are used while the other focuses on how much each language is used. In conclusion, the analysis suggests that a development of definitions and practices of EMI in Sweden is needed, especially in relation to language policy and language hierarchy.