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ę "efficient" wg kryterium: Temat


Wyświetlanie 1-7 z 7
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part I
Autorzy:
Meena, N.
Gayathri, A.
Powiązania:
https://bibliotekanauki.pl/articles/1030980.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient bondage number
strong efficient domination
Opis:
Let G=(V,E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v∈V(G),|N_s [v]∩S|=1.(|N_w [v]∩S|=1) , where N_s [v]={u∈V(G) ∶uv ∈E(G),deg〖u ≥degv 〗 }. (N_w [v]={u∈V(G) ∶uv ∈E(G), degv ≥degu The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient dominating set of G and is denoted by γ_se (G) (γ_we (G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient bondage number b_se (G) of a non empty graph G is the minimum cardinality among all sets of edges X⊆E such that γ_se (G-X)>γ_se (G). In this paper, the strong efficient bondage number of some path related graphs and some special graphs are studied.
Źródło:
World Scientific News; 2020, 145; 342-353
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part II
Autorzy:
Meena, N.
Priyanka, G. Jeba
Powiązania:
https://bibliotekanauki.pl/articles/1031591.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Domination
strong efficient domination
strong efficient non bondage number
Opis:
Let G = (V,E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v∈V(G),|N_s [v]∩S|=1.( |N_w [v]∩S|=1), where〖 N〗_s (v)={u∈V(G):uv∈E(G),degu≥degv}(N_w (v){u∈V(G),uv∈E(G),degv≥degu}. The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and denoted by γ_se (G)(γ_we (G)). The strong efficient non bondage number b_sen (G) is the maximum cardinality of all sets of edge X⊆E such that γ_se (G-X) = γ_se (G). In this paper, the strong efficient non bondage number of some corona related graphs are studied.
Źródło:
World Scientific News; 2020, 146; 22-35
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Strong Efficient Co-Bondage Number of Some Graphs
Autorzy:
Meena, N.
Vignesh, M. Madhan
Powiązania:
https://bibliotekanauki.pl/articles/1030836.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient co-bondage number
strong efficient domination
Opis:
Let G = (V, E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v ∈ V(G), |N_s [v]∩ S|=1. (|N_w [v]∩ S|=1), where N_s (v) = {u ∈V(G) : uv∈ E(G), deg u ≥ deg v}. (N_w (v) = {u ∈V(G) : uv∈ E(G), deg v ≥ deg u}). The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by γ_se(G) (γ_we(G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient co-bondage number 〖bc〗_se(G) is the maximum cardinality of all sets of edges X ⊆ E such that γ_se (G+X) γ_se(G). In this paper, the strong efficient co-bondage number of some standard graphs and some special graphs are determined.
Źródło:
World Scientific News; 2020, 145; 234-244
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Concepts Arising from Strong Efficient Domination Number. Part – III
Autorzy:
Vignesh, M. Madhan
Meena, N.
Powiązania:
https://bibliotekanauki.pl/articles/1031631.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
domination
strong efficient co-bondage number
strong efficient domination
Opis:
Let G = (V, E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every v ∈ V(G), |N_s[] ∩ S|=1. (|N_w [] ∩ S|=1), where N_s () = {u ∈V(G) : uv ∈ E(G), deg u ≥ deg v}. (N_w () = {u ∈V(G) : uv ∈ E(G), deg v ≥ deg u}). The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and is denoted by γ_se(G) (γ_we(G)). A graph G is strong efficient if there exists a strong efficient dominating set of G. The strong efficient co-bondage number (G) is the maximum cardinality of all sets of edges X ⊆ E such that γ_se( + ) ≤ γ_se(G). In this paper, further results on strong efficient co-bondage number of some special graphs are determined.
Źródło:
World Scientific News; 2020, 146; 110-120
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling Based Wireless Sensor Networks Integrated with IoT Environment
Autorzy:
Mahendran, N.
Powiązania:
https://bibliotekanauki.pl/articles/1193556.pdf
Data publikacji:
2016
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Data Scheduling Schemes
Energy Efficient
IoT
Network lifetime
Sensor Network
Opis:
Wireless Sensor networks are widely adopt in military, target tracking, signal processing and monitoring applications like traffic and structural, the small and low cost unreliable sensor nodes in these applications uses batteries as the sole energy source. The energy efficiency becomes difficult task as the tiny and less weight battery act as source of each node. Scheduling the different category of data packets is a way to reduce the power consumption and increasing the lifetime of sensor nodes. The existing scheduling algorithms are not adapted to the environment changes. The basic FCFS (First Come First Serve) suffered by long delay while transmit the real time data packets. In DMP (Dynamic Multilevel Priority) real time data packets occupies highest priority, the remaining non real time data packets sent to lower priority level queues. Some real time task holds the resources for longer time, the other task have to wait, it makes the deadlock condition. The NJN (Nearest Job Next) will select the nearest requesting sensor node for service, real time packets have to wait long time. The proposed Adaptive weighted scheduling scheme changes the behavior of the network queue by adaptively changes the weights based on network traffic. Simulation results proof that, adaptive weighted scheduling algorithm works better than the FCFS and DMP data scheduling in terms of energy consumption and lifetime. Our future scheme to integrate Internet of Things (IoT) with the WSN to increase the performance of the wireless networks.
Źródło:
World Scientific News; 2016, 41; 116-127
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The nexus between Prices and Macroeconomic Variables in Iran
Autorzy:
Mehrara, Mohsen
Powiązania:
https://bibliotekanauki.pl/articles/1194077.pdf
Data publikacji:
2014
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Granger Causality and Efficient Market Hypothesis
Macroeconomic variables
Stock Price Index
Opis:
This paper examines the causal relationship between stock prices and macroeconomic aggregates in Iran, by applying the techniques of the long–run Granger non–causality test proposed by Toda and Yamamoto (1995). We test the causal relationships between the TEPIX Index and the three macroeconomic variables: money supply, value of trade balance, and industrial production using quarterly data for the period 1993:1 to 2010:4. The results show unidirectional long run causality from macroeconomic variables to stock market. Accordingly, the stock prices are not a leading indicator for economic variables, which is inconsistent with the previous findings that the stock market rationally signals changes in real activities. Contrarily, the macro variables seem to lead stock prices. So, Tehran Stock Exchange (TSE) is not informationally efficient.
Źródło:
World Scientific News; 2014, 6; 1-9
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient protocol for the synthesis of novel 2-amino-N-(1-(aryl-2-oxo-2Hchromen-3-yl)ethylidene) benzohydrazides act as an antimicrobial agents
Autorzy:
Rola, R. R.
Joshi, H. D.
Powiązania:
https://bibliotekanauki.pl/articles/1031432.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
2-amino-N'-(1-(6-bromo-2-oxo-2H-chromen-3-yl)ethylidene)benzohydrazides
antimicrobial evaluation
efficient procedure
Opis:
We report here the protocol for the preparation of 2-amino-N'-(1-(aryl-2-oxo-2H-chromen-3-yl)ethylidene)benzohydrazides compounds in moderate to excellent yields (46–86%) within a short reaction time (10–15 min), through a clean and efficient procedure. Additionally, the method has a wide substrate scope and provides an accessible route for the large-scale direct synthesis of 2-amino-N'-(1-(aryl-2-oxo-2H-chromen-3-yl)ethylidene)benzohydrazides. The products were assayed for their in vitro biological assay antimicrobial evaluation against two Gram-negative bacteria Escherichia coli MTCC 442, Pseudomonas aeruginosa MTCC 441 and antifungal activity against Candida albicans MTCC 227, Aspergillus Niger MTCC 282, Aspergillus clavatus MTCC 1323 at different concentrations which compared with ampicillin, chloramphenicol, ciprofloxacin, norfloxacin, nystatin, and greseofulvin in as standard drugs which are presented.
Źródło:
World Scientific News; 2021, 152; 15-26
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-7 z 7

    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