Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Gupta, R.K." wg kryterium: Wszystkie pola


Wyświetlanie 1-4 z 4
Tytuł:
To predict human Biomarker for the obesity using mouse homologous expression data at different theiler stages
Autorzy:
Kumar, A.
Puri, R.
Gupta, K.
Pal, A.
Powiązania:
https://bibliotekanauki.pl/articles/11371.pdf
Data publikacji:
2015
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Opis:
There are numerous genetic factors like MC4R (Melanocortin-4 receptor), POMC (Proopiomelanocortin), SIM1 (Single Minded Gene) etc. important in obesity, which can be used as biomarker. But more reliable diagnostic markers are the need for today, along with new therapeutic strategies that target specific molecules in the disease pathways. As in mouse and human genes, where mutations in one or both species are associated with some phenotypic characteristics as observed in human disease. In molecular mechanisms of development, differentiation, and disease gene expression data provide crucial insights. Up-regulation and down-regulation of selective genes can have major effects on diet-induced obesity, but there is little or no effect when animals are fed a low-fat diet. In present study we have studied the gene expression data of mouse at different theiler stages using GXD BioMart. The interacting partners and pathway of the genes that are already used as biomarker in mouse as well as in humans have been studied. A gene NPY1R (Neuropeptide Y1 receptor) was taken as common after STRING and KEGG results on the basis of biochemical pathways and interactions similar to MC4R. Our present work focuses on comparative genomics and proteomics analysis of NPY1R, which has led to identification of biomarker by comparing it with already known MC4R human and mouse biomarker. It has been concluded that both the proteins are structurally and functionally similar.
Źródło:
International Letters of Natural Sciences; 2015, 45
2300-9675
Pojawia się w:
International Letters of Natural Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using Web Services to enhance Geographic Information Systems
Autorzy:
Ladner, R.
Petry, F.
Warner, E.
Gupta, K.
Powiązania:
https://bibliotekanauki.pl/articles/970472.pdf
Data publikacji:
2006
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
ontologia
usługa WWW
dane przestrzenne
system informacji przestrzennej
ontology
web services
spatial data
GIS
geographic information systems
Opis:
In this paper we describe an approach to the extension of geographic information systems to take advantage of the continuing development of capabilities of the Semantic Web. This is presented in the context of a portal based Geospatial Information Database (GIDB™), an object-oriented spatial database capable of storing multiple data types from multiple sources. We have developed our approach for a specific domain, spatially oriented, meteorological and oceanographic, but this can clearly be applied to other Spatial data domains. Finally we illustrate the use of the ontology development system based on Generative Sublanguage Ontologies (GSO), a type of linguistic ontology inspired by the Generative Lexicon Theory, to develop effective domain ontologies.
Źródło:
Control and Cybernetics; 2006, 35, 1; 29-46
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
Autorzy:
Arora, R.
Gupta, K.
Powiązania:
https://bibliotekanauki.pl/articles/1403683.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
bilevel programming
indefinite quadratic programming
multi-objective programming
pay-off matrix
Taylor series approximation
LINGO 17.0
Opis:
Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem. In this paper, a multi-objective indefinite quadratic bilevel programming problem (MOIQBP) is presented. The defined problem (MOIQBP) has multi-objective functions at both the levels. The followers are independent at the lower level. A fuzzy goal programming methodology is employed which minimizes the sum of the negative deviational variables of both the levels to obtain highest membership value of each of the fuzzy goal. The membership function for the objective functions at each level is defined. As these membership functions are quadratic they are linearized by Taylor series approximation. The membership function for the decision variables at both levels is also determined. The individual optimal solution of objective functions at each level is used for formulating an integrated pay-off matrix. The aspiration levels for the decision makers are ascertained from this matrix. An algorithm is developed to obtain a compromise optimal solution for (MOIQBP). A numerical example is exhibited to evince the algorithm. The computing software LINGO 17.0 has been used for solving this problem.
Źródło:
Archives of Control Sciences; 2020, 30, 4; 683-699
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Branch and bound algorithm for discrete multi- level linear fractional programming problem
Autorzy:
Arora, R.
Gupta, K.
Powiązania:
https://bibliotekanauki.pl/articles/406478.pdf
Data publikacji:
2018
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
linear fractional programming problem
bilevel programming
multilevel programming
discrete variables
integer solution
branch and bound cut
programowanie dwustopniowe
programowanie wielopoziomowe
zmienne dyskretne
Opis:
An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible. The proposed method is extended from bilevel to multilevel linear fractional programming problems with discrete variables. The solution procedure for both the algorithms is elucidated in the paper.
Źródło:
Operations Research and Decisions; 2018, 28, 2; 5-21
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies