Application of the Heterogeneous System Prediction Method to Pattern Recognition Problem

* This work was financially supported by RFBR-04-01-00858.

Structural basis for receptor activity-modifying protein-dependent selective peptide recognition by a G protein-coupled receptor

Association of receptor activity-modifying proteins (RAMP1-3) with the G protein-coupled receptor (GPCR) calcitonin receptor-like receptor (CLR) enables selective recognition of the peptides calcitonin gene-related peptide (CGRP) and adrenomedullin (AM) that have diverse functions in the cardiovascular and lymphatic systems. How peptides selectively bind GPCR:RAMP complexes is unknown. We report crystal structures of CGRP analog-bound CLR:RAMP1 and AM-bound CLR:RAMP2 extracellular domain heterodimers at 2.5 and 1.8 Å resolutions, respectively. The peptides similarly occupy a shared binding site on CLR with conformations characterized by a β-turn structure near their C termini rather than the α-helical structure common to peptides that bind related GPCRs. The RAMPs augment the binding site with distinct contacts to the variable C-terminal peptide residues and elicit subtly different CLR conformations. The structures and accompanying pharmacology data reveal how a class of accessory membrane proteins modulate ligand binding of a GPCR and may inform drug development targeting CLR:RAMP complexes.

Hamilton’s Principle with Variable Order Fractional Derivatives

MSC 2010: 26A33, 70H25, 46F12, 34K37 Dedicated to 80-th birthday of Prof. Rudolf Gorenflo

Sensor Location Problem for a Multigraph

MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35

Numerical solution of the Dirichlet initial boundary value problem for the heat equation in exterior 3-dimensional domains using integral equations

A numerical method for the Dirichlet initial boundary value problem for the heat equation in the exterior and unbounded region of a smooth closed simply connected 3-dimensional domain is proposed and investigated. This method is based on a combination of a Laguerre transformation with respect to the time variable and an integral equation approach in the spatial variables. Using the Laguerre transformation in time reduces the parabolic problem to a sequence of stationary elliptic problems which are solved by a boundary layer approach giving a sequence of boundary integral equations of the first kind to solve. Under the assumption that the boundary surface of the solution domain has a one-to-one mapping onto the unit sphere, these integral equations are transformed and rewritten over this sphere. The numerical discretisation and solution are obtained by a discrete projection method involving spherical harmonic functions. Numerical results are included.

Identification of a time-dependent bio-heat blood perfusion coefficient

In the paper the identification of the time-dependent blood perfusion coefficient is formulated as an inverse problem. The bio-heat conduction problem is transformed into the classical heat conduction problem. Then the transformed inverse problem is solved using the method of fundamental solutions together with the Tikhonov regularization. Some numerical results are presented in order to demonstrate the accuracy and the stability of the proposed meshless numerical algorithm.

Self-adapting parallel metric-space search engine for variable query loads

This research focuses on automatically adapting a search engine size in response to fluctuations in query workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computer resources to or from the engine. Our solution is to contribute an adaptive search engine that will repeatedly re-evaluate its load and, when appropriate, switch over to a dierent number of active processors. We focus on three aspects and break them out into three sub-problems as follows: Continually determining the Number of Processors (CNP), New Grouping Problem (NGP) and Regrouping Order Problem (ROP). CNP means that (in the light of the changes in the query workload in the search engine) there is a problem of determining the ideal number of processors p active at any given time to use in the search engine and we call this problem CNP. NGP happens when changes in the number of processors are determined and it must also be determined which groups of search data will be distributed across the processors. ROP is how to redistribute this data onto processors while keeping the engine responsive and while also minimising the switchover time and the incurred network load. We propose solutions for these sub-problems. For NGP we propose an algorithm for incrementally adjusting the index to t the varying number of virtual machines. For ROP we present an ecient method for redistributing data among processors while keeping the search engine responsive. Regarding the solution for CNP, we propose an algorithm determining the new size of the search engine by re-evaluating its load. We tested the solution performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud. Our experiments show that when we compare our NGP solution with computing the index from scratch, the incremental algorithm speeds up the index computation 2{10 times while maintaining a similar search performance. The chosen redistribution method is 25% to 50% faster than other methods and reduces the network load around by 30%. For CNP we present a deterministic algorithm that shows a good ability to determine a new size of search engine. When combined, these algorithms give an adapting algorithm that is able to adjust the search engine size with a variable workload.

The effectiveness of an intelligent tutoring system on the attitude and achievement of developmental mathematics students in a community college

This study examined the effectiveness of intelligent tutoring system instruction, grounded in John Anderson's ACT theory of cognition, on the achievement and attitude of developmental mathematics students in the community college setting. The quasi-experimental research used a pretest-posttest control group design. The dependent variables were problem solving achievement, overall achievement, and attitude towards mathematics. The independent variable was instructional method.^ Four intact classes and two instructors participated in the study for one semester. Two classes (n = 35) served as experimental groups; they received six lessons with real-world problems using intelligent tutoring system instruction. The other two classes (n = 24) served as control groups; they received six lessons with real-world problems using traditional instruction including graphing calculator support. It was hypothesized that students taught problem solving using the intelligent tutoring system would achieve more on the dependent variables than students taught without the intelligent tutoring system.^ Posttest mean scores for one teacher produced a significant difference in overall achievement for the experimental group. The same teacher had higher means, not significantly, for the experimental group in problem solving achievement. The study did not indicate a significant difference in attitude mean scores.^ It was concluded that using an intelligent tutoring system in problem solving instruction may impact student's overall mathematics achievement and problem solving achievement. Other factors must be considered, such as the teacher's classroom experience, the teacher's experience with the intelligent tutoring system, trained technical support, and trained student support; as well as student learning styles, motivation, and overall mathematics ability. ^

Quantifying the effects of temperature and concentration on variable-density flow in numerical modeling of groundwater systems: Implications for predictive uncertainty and data collection

Groundwater systems of different densities are often mathematically modeled to understand and predict environmental behavior such as seawater intrusion or submarine groundwater discharge. Additional data collection may be justified if it will cost-effectively aid in reducing the uncertainty of a model's prediction. The collection of salinity, as well as, temperature data could aid in reducing predictive uncertainty in a variable-density model. However, before numerical models can be created, rigorous testing of the modeling code needs to be completed. This research documents the benchmark testing of a new modeling code, SEAWAT Version 4. The benchmark problems include various combinations of density-dependent flow resulting from variations in concentration and temperature. The verified code, SEAWAT, was then applied to two different hydrological analyses to explore the capacity of a variable-density model to guide data collection. ^ The first analysis tested a linear method to guide data collection by quantifying the contribution of different data types and locations toward reducing predictive uncertainty in a nonlinear variable-density flow and transport model. The relative contributions of temperature and concentration measurements, at different locations within a simulated carbonate platform, for predicting movement of the saltwater interface were assessed. Results from the method showed that concentration data had greater worth than temperature data in reducing predictive uncertainty in this case. Results also indicated that a linear method could be used to quantify data worth in a nonlinear model. ^ The second hydrological analysis utilized a model to identify the transient response of the salinity, temperature, age, and amount of submarine groundwater discharge to changes in tidal ocean stage, seasonal temperature variations, and different types of geology. The model was compared to multiple kinds of data to (1) calibrate and verify the model, and (2) explore the potential for the model to be used to guide the collection of data using techniques such as electromagnetic resistivity, thermal imagery, and seepage meters. Results indicated that the model can be used to give insight to submarine groundwater discharge and be used to guide data collection. ^

The effectiveness of an intelligent tutoring system on the attitude and achievement of developmental mathematics students in a community college

This study examined the effectiveness of intelligent tutoring system instruction, grounded in John Anderson's ACT theory of cognition, on the achievement and attitude of developmental mathematics students in the community college setting. The quasi-experimental research used a pretest-posttest control group design. The dependent variables were problem solving achievement, overall achievement, and attitude towards mathematics. The independent variable was instructional method. Four intact classes and two instructors participated in the study for one semester. Two classes (n = 35) served as experimental groups; they received six lessons with real-world problems using intelligent tutoring system instruction. The other two classes (n = 24) served as control groups; they received six lessons with real-world problems using traditional instruction including graphing calculator support. It was hypothesized that students taught problem solving using the intelligent tutoring system would achieve more on the dependent variables than students taught without the intelligent tutoring system. Posttest mean scores for one teacher produced a significant difference in overall achievement for the experimental group. The same teacher had higher means, not significantly, for the experimental group in problem solving achievement. The study did not indicate a significant difference in attitude mean scores. It was concluded that using an intelligent tutoring system in problem solving instruction may impact student's overall mathematics achievement and problem solving achievement. Other factors must be considered, such as the teacher's classroom experience, the teacher's experience with the intelligent tutoring system, trained technical support, and trained student support; as well as student learning styles, motivation, and overall mathematics ability.

Fixed vs. variable noise in 2AFC contrast discrimination: lessons from psychometric functions.

Recent discussion regarding whether the noise that limits 2AFC discrimination performance is fixed or variable has focused either on describing experimental methods that presumably dissociate the effects of response mean and variance or on reanalyzing a published data set with the aim of determining how to solve the question through goodness-of-fit statistics. This paper illustrates that the question cannot be solved by fitting models to data and assessing goodness-of-fit because data on detection and discrimination performance can be indistinguishably fitted by models that assume either type of noise when each is coupled with a convenient form for the transducer function. Thus, success or failure at fitting a transducer model merely illustrates the capability (or lack thereof) of some particular combination of transducer function and variance function to account for the data, but it cannot disclose the nature of the noise. We also comment on some of the issues that have been raised in recent exchange on the topic, namely, the existence of additional constraints for the models, the presence of asymmetric asymptotes, the likelihood of history-dependent noise, and the potential of certain experimental methods to dissociate the effects of response mean and variance.

Compensatory Education: Approaching the Problem from the Wrong Direction

*Designated as an exemplary master's project for 2015-16*

Application of Volterra Equations to Solve Unit Commitment Problem of Optimised Energy Storage and Generation

Development of reliable methods for optimised energy storage and generation is one of the most imminent challenges in modern power systems. In this paper an adaptive approach to load leveling problem using novel dynamic models based on the Volterra integral equations of the first kind with piecewise continuous kernels. These integral equations efficiently solve such inverse problem taking into account both the time dependent efficiencies and the availability of generation/storage of each energy storage technology. In this analysis a direct numerical method is employed to find the least-cost dispatch of available storages. The proposed collocation type numerical method has second order accuracy and enjoys self-regularization properties, which is associated with confidence levels of system demand. This adaptive approach is suitable for energy storage optimisation in real time. The efficiency of the proposed methodology is demonstrated on the Single Electricity Market of Republic of Ireland and Northern Ireland.

'A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem'

Abstract- A Bayesian optimization algorithm for the nurse scheduling problem is presented, which involves choosing a suitable scheduling rule from a set for each nurse's assignment. Unlike our previous work that used GAs to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. eventually, we will be able to identify and mix building blocks directly. The Bayesian optimization algorithm is applied to implement such explicit learning by building a Bayesian network of the joint distribution of solutions. The conditional probability of each variable in the network is computed according to an initial set of promising solutions. Subsequently, each new instance for each variable is generated by using the corresponding conditional probabilities, until all variables have been generated, i.e. in our case, a new rule string has been obtained. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the conditional probabilities for all nodes in the Bayesian network are updated again using the current set of promising rule strings. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed approach might be suitable for other scheduling problems.

Hybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems

This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual solutions. The heuristic permutations are then used to construct the solutions. Variable Neighborhood Search, Steepest Descent, Iterated Local Search and Tabu Search are compared. An analysis of their performance within the high level search space of heuristics is also carried out. Experimental results on benchmark exam timetabling problems demonstrate the simplicity and efficiency of this hyperheuristic approach. They also indicate that the choice of the high level search methodology is not crucial and the high level search should explore the heuristic search space as widely as possible within a limited searching time. This simple and general graph based hyperheuristic may be applied to a range of timetabling and optimisation problems.