Introduction: Recall and precision are two indicators for evaluating information retrieval system’s efficiency and performance. The aim of the present study was to compare the recall and precision of Iranmedex, Magiran and SID DATABASEs for retrieval of scholarly information in the domain of pharmacy.Methods: This work is an analytical study that, in this was used from comparison method and direct observation by end user. The population was articles retrieved from the Web sites of Iranmedex, Magiran & SID DATABASEs. Data collection tool was checklist that validity was confirmed by experts of LIS. First, Keywords were listed from two numbers 7 & 8 of Twenty-first volume Journal of Behavioral pharmacology; And Keywords associated with this field were determined by Pharmacy specialists. Ten selected keywords searched in 3 DATABASEs. Then retrieved results were refer to Pharmacy specialists for identify relevant records. The obtained data were analyzed with descriptive statistics (frequency), (χ2) and SPSS 11.5 software at the significant level of P<0.05.Results: Retrieved records of Iranmedex DATABASE were 615, from Magiran 375 and SID was 116 records. Iranmedex dominated the top positions when comparing relative recall (39%) and SID revealed reliable precision in the output (55.1%). Iranmedex and Magiran DATABASE have had more overlap (219 records).Conclusion: The results are tips for Pharmacy specialists to choose DATABASE for retrieval of scholarly information, if recall is important for they, choose Iranmedex and if high precision is important, need to use the SID DATABASE.

Introduction: The Iranian Brain Imaging DATABASE (IBID) was initiated in 2017, with 5 major goals: provide researchers easy access to a neuroimaging DATABASE, provide normative quantitative measures of the brain for clinical research purposes, study the aging profile of the brain, examine the association of brain structure and function, and join the ENIGMA consortium. Many prestigious DATABASEs with similar goals are available. However, they were not done on an Iranian population, and the battery of their tests (e. g. cognitive tests) is selected based on their specific questions and needs. Methods: The IBID will include 300 participants (50% female) in the age range of 20 to 70 years old, with an equal number of participants (#60) in each age decade. It comprises a battery of cognitive, lifestyle, medical, and mental health tests, in addition to several Magnetic Resonance Imaging (MRI) protocols. Each participant completes the assessments on two referral days. Results: The study currently has a cross-sectional design, but longitudinal assessments are considered for the future phases of the study. Here, details of the methodology and the initial results of assessing the first 152 participants of the study are provided. Conclusion: IBID is established to enable research into human brain function, to aid clinicians in disease diagnosis research, and also to unite the Iranian researchers with interests in the brain.

Introduction ore than 20 years have elapsed since the first single base pair substitution underlying an inherited disease in humans was characterized at the DNA level. Disease-associated gene lesions are currently collected and publicized by the Human Gene Mutation DATABASE (HGMD) in Cardiff, locusspecific mutation DATABASEs, and to some extent by the Genome DATABASE (GDB) and Online Mendelian Inheritance in Man (OMIM) as comprehensive and up-to-date resources for information on genetic disorders and mutations causing them.1 – 4

In a verifiable DATABASE scheme (VDB), a client with limited storage resources securely outsources its very large and dynamic DATABASE to an untrusted server such that any attempt to tamper with the data, or even any unintentional changes to the data, can be detected by the client with high probability. The latest work in this area has tried to add the secure search feature of single keyword and multiple keywords. In this paper, we intend to add a range query to the features of this DATABASE. The scheme presented in this article provides the requirements of a secure search, namely the completeness of the search result, the proof of the empty search result, the lack of additional information leakage and the freshness of the search results, as well as the DATABASE with public verifiability. In the proposed scheme, the computational complexity of the client is not changed significantly compared with the previous scheme, but the computational and storage complexity of the server has increased which is justifiable by its rich resources.