Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
St Andrews Research Repository
Institutional Repository
10555 Publications
More information
Detailed data provider information (OpenDOAR)


  • Primary health care delivery in rural India : examining the efficacy of a policy for recruiting junior doctors in Karnataka.

    This thesis examines the role of primary health care delivery in rural India but specifically focuses on aspects from Karnataka state. It broadly reflects on the differences that exist between urban and rural populations' access to healthcare. The concept of primary health care appears to have lost its lustre at present, it was once enthusiastically promoted in the late 1970s and 1980s but as chronic problems appeared to affect the smooth delivery of healthcare and nowadays major global bodie...

    Minimal and random generation of permutation and matrix groups

    We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases. The bounds are linear in the degree of the permutation or matrix group in general, and logarithmic when the group is primitive. They can be combined with results of Lubotzky to produce explicit bounds on the number of random elements required to generate these groups with ...

    On algorithm selection, with an application to combinatorial search problems

    The Algorithm Selection Problem is to select the most appropriate way for solving a problem given a choice of different ways. Some of the most prominent and successful applications come from Artificial Intelligence and in particular combinatorial search problems. Machine Learning has established itself as the de facto way of tackling the Algorithm Selection Problem. Yet even after a decade of intensive research, there are no established guidelines as to what kind of Machine Learning to use an...

    A comparison of pre-prepared commercial infant feeding meals with home-cooked recipes

    Objectives. To compare the cost, nutritional and food variety contents of commercial meals and published infant and young child feeding (IYCF) home-cooked recipes, and to compare nutritional contents to age-specific recommendations. Design. Cross-sectional study. Setting. Full range of pre-prepared main-meals available within the UK market. Main meal recipes identified from a survey of Amazon’s top 20 bestsellers and IYCF cookbooks available from local libraries. Samples. 278 commercial IYCF ...
  • No data provider research data found
  • Latest Documents Timeline

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Document Types

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Funders in data provider publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Projects with most Publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark