Journal articles: 'G*Power'

1

Lasrado, Reena. "G Allen Power, Dementia beyond disease." Dementia 14, no. 3 (2015): 384. http://dx.doi.org/10.1177/1471301215575815.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hassan, Amal S., and Said G. Nassr. "Power Lindley-G Family of Distributions." Annals of Data Science 6, no. 2 (2018): 189–210. http://dx.doi.org/10.1007/s40745-018-0159-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Munyeshyaka, Albert, Praveen Kumar Dhankar, and Joseph Ntahompagaze. "Matter power spectrum in a power-law f(G) gravity." New Astronomy 120 (November 2025): 102423. https://doi.org/10.1016/j.newast.2025.102423.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Biswas, Anjan, and M. Mirzazadeh. "Dark optical solitons with power law nonlinearity using G′/G-expansion." Optik 125, no. 17 (2014): 4603–8. http://dx.doi.org/10.1016/j.ijleo.2014.05.035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Shitian. "On Groups Whose Irreducible Character Degrees of All Proper Subgroups are All Prime Powers." Journal of Mathematics 2021 (June 16, 2021): 1–7. http://dx.doi.org/10.1155/2021/6345386.

Full text

Abstract:

Isaacs, Passman, and Manz have determined the structure of finite groups whose each degree of the irreducible characters is a prime power. In particular, if G is a nonsolvable group and every character degree of a group G is a prime power, then G is isomorphic to S × A , where S ∈ A 5 , PSL 2 8 and A is abelian. In this paper, we change the condition, each character degree of a group G is a prime power, into the condition, each character degree of the proper subgroups of a group is a prime power, and give the structure of almost simple groups whose character degrees of all proper subgroups are all prime powers.

APA, Harvard, Vancouver, ISO, and other styles

6

Kang, Hyun. "Sample size determination and power analysis using the G*Power software." Journal of Educational Evaluation for Health Professions 18 (July 30, 2021): 17. http://dx.doi.org/10.3352/jeehp.2021.18.17.

Full text

Abstract:

Appropriate sample size calculation and power analysis have become major issues in research and publication processes. However, the complexity and difficulty of calculating sample size and power require broad statistical knowledge, there is a shortage of personnel with programming skills, and commercial programs are often too expensive to use in practice. The review article aimed to explain the basic concepts of sample size calculation and power analysis; the process of sample estimation; and how to calculate sample size using G*Power software (latest ver. 3.1.9.7; Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany) with 5 statistical examples. The null and alternative hypothesis, effect size, power, alpha, type I error, and type II error should be described when calculating the sample size or power. G*Power is recommended for sample size and power calculations for various statistical methods (F, t, χ2, Z, and exact tests), because it is easy to use and free. The process of sample estimation consists of establishing research goals and hypotheses, choosing appropriate statistical tests, choosing one of 5 possible power analysis methods, inputting the required variables for analysis, and selecting the “Calculate” button. The G*Power software supports sample size and power calculation for various statistical methods (F, t, χ2, z, and exact tests). This software is helpful for researchers to estimate the sample size and to conduct power analysis.

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Huanyin, Marjan Sheibani, and Handan Kose. "The g-Drazin inverse involving power commutativity." Filomat 34, no. 9 (2020): 2961–69. http://dx.doi.org/10.2298/fil2009961c.

Full text

Abstract:

Let A be a complex Banach algebra. An element a ? A has g-Drazin inverse if there exists b ? A such that b = bab, ab = ba, a-a2b ? A qnil. Let a, b ? Ad. If a3b = ba, b3a = ab, and a2adb = aadba, we prove that a + b ? Ad if and only if 1 + adb ? Ad. We present explicit formula for (a + b)d under certain perturbations. These extend the main results of Wang, Zhou and Chen (Filomat, 30(2016), 1185-1193) and Liu, Xu and Yu (Applied Math. Comput., 216(2010), 3652-3661).

APA, Harvard, Vancouver, ISO, and other styles

8

Raab, Frederick. "Average Efficiency of Class-G Power Amplifiers." IEEE Transactions on Consumer Electronics CE-32, no. 2 (1986): 145–50. http://dx.doi.org/10.1109/tce.1986.290146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Unnikrishnan, Sanil, and S. Shankaranarayanan. "Consistency relation in power law G-inflation." Journal of Cosmology and Astroparticle Physics 2014, no. 07 (2014): 003. http://dx.doi.org/10.1088/1475-7516/2014/07/003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

G. Navamani. "Power Dominator Coloring and Power Dominator Equitable coloring for Hierarchical Tree-Based Network Architecture." Advances in Nonlinear Variational Inequalities 28, no. 3s (2024): 30–38. https://doi.org/10.52783/anvi.v28.2846.

Full text

Abstract:

A power dominator coloring of a graph G is defined as a proper coloring where each vertex in V(G) power dominates every vertex within at least one color class. The minimum number of colors needed for a power dominator coloring of G is denoted as χ_pd (G). Furthermore, a proper coloring of a graph G is considered equitably k-colorable if the sizes of any two color classes differ by at most one, i.e. |(|C^i |-|C^j |)|≤1, 1≤i,j≤ k and the minimum number of colors needed for an equitable coloring of G is denoted as χ_e (G). The power dominator equitable coloring of a graph G defines a proper k-coloring where each vertex in V(G) power dominates all the vertices of at least one color class and also it satisfies the inequality |(|C^i |-|C^j |)|≤1, 1≤i,j≤ k and the minimum number of colors needed for a power dominator equitable coloring of G is denoted as χ_pde (G). In this study, we commence a research on this parameter and determine the power dominator equitable chromatic number χ_pde for certain hierarchical tree-based network architectures. The results are then compared with traditional domination concepts.

APA, Harvard, Vancouver, ISO, and other styles

11

Mohsin, Layla Abdul Jaleel, and Hazim Ghdhaib Kalt. "Alpha Power Type II-G Family: Adding a Power Parameter of Distributions." Mathematical Modelling of Engineering Problems 12, no. 3 (2025): 1031–42. https://doi.org/10.18280/mmep.120330.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Agu, Friday Ikechukwu, Joseph Thomas Eghwerido, and Cosmas Kaitani Nziku. "The Alpha Power Rayleigh-G family of distributions." Mathematica Slovaca 72, no. 4 (2022): 1047–62. http://dx.doi.org/10.1515/ms-2022-0073.

Full text

Abstract:

Abstract This paper introduces a two-parameters generator of continuous statistical probability distributions called the Alpha Power Rayleigh-G (APRAY-G) family, some statistical properties of the family of distributions were derived, and we introduced a two-submodels of the generator. We estimate the parameters of the models based on the method of maximum likelihood estimation and explored simulation studies based on the introduced submodels. We observed that the biasedness and root mean square errors decrease as the sample size becomes large. We examined the applications of the models based on real-life data sets. We compared the obtained results with some existing probability distribution models. The results showed that the proposed models gave a better fitness to the data under investigation.

APA, Harvard, Vancouver, ISO, and other styles

13

Vorapipat, Voravit, Cooper S. Levy, and Peter M. Asbeck. "A Class-G Voltage-Mode Doherty Power Amplifier." IEEE Journal of Solid-State Circuits 52, no. 12 (2017): 3348–60. http://dx.doi.org/10.1109/jssc.2017.2748283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Yoo, Sang-Min, Jeffrey S. Walling, Ofir Degani, et al. "A Class-G Switched-Capacitor RF Power Amplifier." IEEE Journal of Solid-State Circuits 48, no. 5 (2013): 1212–24. http://dx.doi.org/10.1109/jssc.2013.2252754.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Murtianta, Budihardja, Darmawan Utomo, Atyanta Nika Rumaksari, and Jae-Wook Lee. "Class-G series audio power amplifier for subwoofer." TELKOMNIKA (Telecommunication Computing Electronics and Control) 22, no. 5 (2024): 1269. http://dx.doi.org/10.12928/telkomnika.v22i5.25900.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Nackenoff, Carol. "Women, Power, and Political Changeby Bonnie G. Mani." Journal of Women, Politics & Policy 31, no. 4 (2010): 362–63. http://dx.doi.org/10.1080/1554477x.2010.529716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Jr., Isagani S. Cabahug,, Rolito G. Eballe, and Cherry Mae R. Balingit. "Restrained dr-Power Dominating Sets in Graphs." Journal of Advances in Mathematics and Computer Science 38, no. 9 (2023): 45–50. http://dx.doi.org/10.9734/jamcs/2023/v38i91803.

Full text

Abstract:

Consider a nontrivial connected graph G. In this context, a set R that is not empty and a subset of V (G) is referred to as a restrained dr-power dominating set of G. This means that the induced subgraph of the complement of R in G does not contain any isolated vertex and qualifies as a dr-power dominating set of G. To determine the restrained dr-power domination number of G, denoted as yrpw (G), we look at the minimum cardinality of a restrained dr-power dominating set. This study presents significant insights into the restrained dr-power dominating set of a graph G. It provides concrete realizations and exact values for the restrained dr-power domination number within specific graph classes, such as path and cycle graphs, as well as in the context of join and corona operations. Additionally, characterizations of the restrained dr-power dominating set in the join and corona of graphs are demonstrated.

APA, Harvard, Vancouver, ISO, and other styles

18

Kuriachan, Geethu, and A. Parthiban. "On Graph Entropy Measures Based on the Number of Dominating and Power Dominating Sets." Malaysian Journal of Mathematical Sciences 19, no. 1 (2025): 269–87. https://doi.org/10.47836/mjms.19.1.14.

Full text

Abstract:

This article examines graph entropy measures that depend on the number of dominating and power-dominating sets. To quantify the structural complexity of a graph structure, one uses graph entropies. It is easy to compute these properties for smaller networks, and if reliable approximations are developed, similar metrics can also be used for larger graphs. Using various graph invariants, many graph entropy measures have already been established and computed. So, in this work, a new graph entropy measure, namely, power domination entropy, using the power domination polynomial, is introduced. The domination and power domination polynomials of graphs are used to determine the number of dominating and power dominating sets. Let D(G,ξ) represent the collection of all dominating sets of G with size ξ, dξ(G)=|D(G,ξ)|, and γs be the total number of dominating sets of G. Then, the domination entropy of G with n nodes is defined as Idom(G)=−∑ξ=1ndξ(G)γs(G) log(dξ(G)γs(G)). The domination and power domination entropies for a few graphs are further computed. Following that, a comparison between the domination and power domination entropies of several graphs is provided.

APA, Harvard, Vancouver, ISO, and other styles

19

Kayisoglu, Serap. "Rehydration Kinetics of Green Pea Grains Dried at Different Microwave Powers." Philippine Agricultural Scientist 107, no. 4 (2024): 389–400. https://doi.org/10.62550/an18041023.

Full text

Abstract:

In this study, both untreated and pre-treated green pea grain samples dried at different microwave output powers (90, 180, and 360 W) were rehydrated at three different temperatures (30ºC, 50ºC, and 70ºC). The rehydration kinetics of dried peas were analyzed using both the Peleg and the first-order kinetic models. Observations revealed that the Peleg model exhibited better agreement with the experimental data. As both microwave power and rehydration temperature increased, the rehydration capacity also increased in both pre-treated and untreated peas. The highest moisture content was observed after rehydration in pre-treated peas dried at 360 W microwave power (2.80 g water/g dry matter and 213.40% mass gain), while the lowest moisture content was recorded in pre-treated samples dried at 90 W microwave power (1.66 g water/g dry matter and 119.30% mass gain). However, the samples were unable to reach the moisture level (3.10 g water/g dry matter) before drying at all rehydration temperatures. The activation energy of rehydration varied between 10.75 and 37.39 kJ/mol. The color properties of rehydrated green pea grains were significantly influenced by both microwave power and rehydration temperature. As these two parameters increased, the color differences of rehydrated peas compared to fresh peas also increased. The maximum total color difference (E = 17.66) in rehydrated peas compared to fresh peas was observed at 360 W microwave power and 70ºC rehydration temperature with untreated green peas, while the least total color difference (E = 8.69) occurred at 90 W microwave power and 30ºC rehydration temperature with pre-treated green peas.

APA, Harvard, Vancouver, ISO, and other styles

20

Faul, Franz, Edgar Erdfelder, Axel Buchner, and Albert-Georg Lang. "Statistical power analyses using G*Power 3.1: Tests for correlation and regression analyses." Behavior Research Methods 41, no. 4 (2009): 1149–60. http://dx.doi.org/10.3758/brm.41.4.1149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Chen, Chunlai, Xiaonan Cui, John F. Beausang, et al. "Elongation factor G initiates translocation through a power stroke." Proceedings of the National Academy of Sciences 113, no. 27 (2016): 7515–20. http://dx.doi.org/10.1073/pnas.1602668113.

Full text

Abstract:

During the translocation step of prokaryotic protein synthesis, elongation factor G (EF-G), a guanosine triphosphatase (GTPase), binds to the ribosomal PRE-translocation (PRE) complex and facilitates movement of transfer RNAs (tRNAs) and messenger RNA (mRNA) by one codon. Energy liberated by EF-G’s GTPase activity is necessary for EF-G to catalyze rapid and precise translocation. Whether this energy is used mainly to drive movements of the tRNAs and mRNA or to foster EF-G dissociation from the ribosome after translocation has been a long-lasting debate. Free EF-G, not bound to the ribosome, adopts quite different structures in its GTP and GDP forms. Structures of EF-G on the ribosome have been visualized at various intermediate steps along the translocation pathway, using antibiotics and nonhydolyzable GTP analogs to block translocation and to prolong the dwell time of EF-G on the ribosome. However, the structural dynamics of EF-G bound to the ribosome have not yet been described during normal, uninhibited translocation. Here, we report the rotational motions of EF-G domains during normal translocation detected by single-molecule polarized total internal reflection fluorescence (polTIRF) microscopy. Our study shows that EF-G has a small (∼10°) global rotational motion relative to the ribosome after GTP hydrolysis that exerts a force to unlock the ribosome. This is followed by a larger rotation within domain III of EF-G before its dissociation from the ribosome.

APA, Harvard, Vancouver, ISO, and other styles

22

M.Rekha. "Power Edge Domination Number of Certain Graphs in its Corona Product." Panamerican Mathematical Journal 35, no. 3s (2025): 88–93. https://doi.org/10.52783/pmj.v35.i3s.3536.

Full text

Abstract:

For a graph G(V,E) with size n any edge f∈E, a set S^'⊆E is said to be power edge dominating set of graphs G if each edge e∈E-S^' is dominated in S^' by the following rules if : (i) an edge f in G is in power edge dominating set (in short PEDS), then it dominates itself and dominates all the adjacent edges of f, (ii) an observed edge g in G has m >1 adjacent edges and if m-1 of these edges are observed earlier, then the remaining non-observed edge is also observed by g∈G. The minimum cardinality of a power edge domination number of G denoted by γ_ped^' (G). In this paper we introduce a new notion called power edge domination number and discuss the power edge domination number of corona product of certain graphs.

APA, Harvard, Vancouver, ISO, and other styles

23

Ejima, O., K. O. Aremu, and A. Yusuf. "The order divisor-power graph of finite groups." Annals of the Alexandru Ioan Cuza University - Mathematics 71, no. 2 (2025): 133. https://doi.org/10.47743/anstim.2025.00010.

Full text

Abstract:

Let G be a finite group. In this paper, we introduce the order divisor-power graph Γodp(G) associated with G as the simple undirected graph whose vertices are the elements of G and such that two vertices a, b a̸ = b are adjacent if one is a power of the other and their orders are different. We investigate some algebraic properties and combinatorial structures of the order divisor-power graph Γodp(G) and obtain the conditions under which the order divisor-power graph Γodp(G) can be a star graph. Also, we exhibit some connection between the order divisor-power graph and the power graph of dihedral groups up to an isomorphism. Furthermore, we prove that the order divisor-power graphs of some classes of dihedral groups are neither bipartite nor tripartite, but it is a complete multipartite graph if the group is a cyclic group.

APA, Harvard, Vancouver, ISO, and other styles

24

Sonmezoglu, Abdullah. "Stationary optical solitons having Kudryashov’s quintuple power law nonlinearity by extended G′/G–expansion." Optik 253 (March 2022): 168521. http://dx.doi.org/10.1016/j.ijleo.2021.168521.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Parks, Allen D., and David J. Marchette. "Persistent homology in graph power filtrations." Royal Society Open Science 3, no. 10 (2016): 160228. http://dx.doi.org/10.1098/rsos.160228.

Full text

Abstract:

The persistence of homological features in simplicial complex representations of big datasets in R n resulting from Vietoris–Rips or Čech filtrations is commonly used to probe the topological structure of such datasets. In this paper, the notion of homological persistence in simplicial complexes obtained from power filtrations of graphs is introduced. Specifically, the r th complex, r ≥ 1, in such a power filtration is the clique complex of the r th power G r of a simple graph G . Because the graph distance in G is the relevant proximity parameter, unlike a Euclidean filtration of a dataset where regional scale differences can be an issue, persistence in power filtrations provides a scale-free insight into the topology of G . It is shown that for a power filtration of G , the girth of G defines an r range over which the homology of the complexes in the filtration are guaranteed to persist in all dimensions. The role of chordal graphs as trivial homology delimiters in power filtrations is also discussed and the related notions of ‘persistent triviality’, ‘transient noise’ and ‘persistent periodicity’ in power filtrations are introduced.

APA, Harvard, Vancouver, ISO, and other styles

26

Barasara, C. M., and Y. B. Thakkar. "Some Characterizations and NP-Complete Problems for Power Cordial Graphs." Journal of Mathematics 2023 (July 15, 2023): 1–5. http://dx.doi.org/10.1155/2023/2257492.

Full text

Abstract:

A power cordial labeling of a graph G = V G , E G is a bijection f : V G ⟶ 1,2 , … , V G such that an edge e = u v is assigned the label 1 if f u = f v n or f v = f u n , for some n ∈ N ∪ 0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. The graph that admits power cordial labeling is called a power cordial graph. In this paper, we derive some characterizations of power cordial graphs as well as explore NP-complete problems for power cordial labeling. This work also rules out any possibility of forbidden subgraph characterization for power cordial labeling.

APA, Harvard, Vancouver, ISO, and other styles

27

Anitha, J., and S. Muthukumar. "Power domination in splitting and degree splitting graph." Proyecciones (Antofagasta) 40, no. 6 (2021): 1641–55. http://dx.doi.org/10.22199/issn.0717-6279-4357-4641.

Full text

Abstract:

A vertex set S is called a power dominating set of a graph G if every vertex within the system is monitored by the set S following a collection of rules for power grid monitoring. The power domination number of G is the order of a minimal power dominating set of G. In this paper, we solve the power domination number for splitting and degree splitting graph.

APA, Harvard, Vancouver, ISO, and other styles

28

Croome, Sarah, and Mark L. Lewis. "Character Codegrees of Maximal Class -groups." Canadian Mathematical Bulletin 63, no. 2 (2019): 328–34. http://dx.doi.org/10.4153/s0008439519000353.

Full text

Abstract:

AbstractLet $G$ be a $p$-group and let $\unicode[STIX]{x1D712}$ be an irreducible character of $G$. The codegree of $\unicode[STIX]{x1D712}$ is given by $|G:\,\text{ker}(\unicode[STIX]{x1D712})|/\unicode[STIX]{x1D712}(1)$. If $G$ is a maximal class $p$-group that is normally monomial or has at most three character degrees, then the codegrees of $G$ are consecutive powers of $p$. If $|G|=p^{n}$ and $G$ has consecutive $p$-power codegrees up to $p^{n-1}$, then the nilpotence class of $G$ is at most 2 or $G$ has maximal class.

APA, Harvard, Vancouver, ISO, and other styles

29

Ghorbani, Modjtaba, and Fatemeh Abbasi-Barfaraz. "On the characteristic polynomial of power graphs." Filomat 32, no. 12 (2018): 4375–87. http://dx.doi.org/10.2298/fil1812375g.

Full text

Abstract:

The power graph P(G) of finite group G is a graph whose vertex set is G and two distinct vertices are adjacent if one is a power of the other. In this paper, we determine the characteristic polynomial of the power graphs of groups of order a product of three primes.

APA, Harvard, Vancouver, ISO, and other styles

30

Mandal, Arunava. "Dense images of the power maps for a disconnected real algebraic group." Journal of Group Theory 24, no. 5 (2021): 973–85. http://dx.doi.org/10.1515/jgth-2020-0152.

Full text

Abstract:

Abstract Let 𝐺 be a complex algebraic group defined over ℝ, which is not necessarily Zariski-connected. In this article, we study the density of the images of the power maps g → g k g\to g^{k} , k ∈ N k\in\mathbb{N} , on real points of 𝐺, i.e., G ⁢ ( R ) G(\mathbb{R}) equipped with the real topology. As a result, we extend a theorem of P. Chatterjee on surjectivity of the power map for the set of semisimple elements of G ⁢ ( R ) G(\mathbb{R}) . We also characterize surjectivity of the power map for a disconnected group G ⁢ ( R ) G(\mathbb{R}) . The results are applied in particular to describe the image of the exponential map of G ⁢ ( R ) G(\mathbb{R}) .

APA, Harvard, Vancouver, ISO, and other styles

31

Celakoska-Jordanova, Vesna, and Valentina Miovska. "Free power-associative n-ary groupoids." Mathematica Slovaca 69, no. 1 (2019): 71–80. http://dx.doi.org/10.1515/ms-2017-0203.

Full text

Abstract:

Abstract A power-associative n-ary groupoid is an n-ary groupoid G such that for every element a ∈ G, the n-ary subgroupoid of G generated by a is an n-ary subsemigroup of G. The class 𝓟a of power-associative n-ary groupoids is a variety. A description of free objects in this variety and their characterization by means of injective n-ary groupoids in 𝓟a are obtained.

APA, Harvard, Vancouver, ISO, and other styles

32

Kazmierkowski, Marian P. "Power Theories for Improved Power Quality (Pasko, M. and Benysek, G.; 2012) [Book News]." IEEE Industrial Electronics Magazine 7, no. 1 (2013): 68–69. http://dx.doi.org/10.1109/mie.2012.2236488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Oluyede, Broderick, Thatayaone Moakofi, and Fastel Chipepa. "The odd power generalized Weibull-G power series class of distributions: properties and applications." Statistics in Transition New Series 23, no. 1 (2022): 89–108. http://dx.doi.org/10.2478/stattrans-2022-0006.

Full text

Abstract:

Abstract We develop a new class of distributions, namely, the odd power generalized Weibull-G power series (OPGW-GPS) class of distributions. We present some special classes of the proposed distribution. Structural properties, have also been derived. We conducted a simulation study to evaluate the consistency of the maximum likelihood estimates. Moreover, two real data examples on selected data sets, to illustrate the usefulness of the new class of distributions. The proposed model outperforms several non-nested models on selected data sets.

APA, Harvard, Vancouver, ISO, and other styles

34

SCHMIDT, T., L. WORSCHECH, M. SCHEIBNER, T. SLOBODSKYY, L. W. MOLENKAMP, and A. FORCHEL. "SPIN POLARIZATION IN SEMIMAGNETIC CdMnSe/ZnSe QUANTUM DOTS WITH ZERO EXCITON g FACTOR." International Journal of Modern Physics B 21, no. 08n09 (2007): 1626–31. http://dx.doi.org/10.1142/s0217979207043324.

Full text

Abstract:

We have investigated the degree of circular polarization (ρ) in the emission of semimagnetic CdMnSe/ZnSe quantum dots (QDs) with Mn contents of nominally 0, 1 and 2 %. Circularly polarized excitation was used to control the polarization of the excited carriers. The g factors were determined from the dependence of ρ on the magnetic field strength. We demonstrate that in QDs with 1 % Mn the exciton g factor is vanishingly small. We also present measurements on the excitation power dependent changes of the polarization. A direct heating mechanism is identified as origin of the drastic enhancement of the g factor by ramping up the excitation power. For high laser powers the exciton g factor increases by a factor of 30. In addition, by comparing the luminescence polarization of QDs with 2 % Mn and without Mn a sign reversal of the g factor was observed.

APA, Harvard, Vancouver, ISO, and other styles

35

Duncan, Michael J., Lucas Guimaraes-Ferreira, Jason Tallis, Irineu Loturco, Anthony Weldon, and Rohit K. Thapa. "Determining and comparing the optimum power loads in hexagonal and straight bar deadlifts in novice strength-trained males." Biomedical Human Kinetics 15, no. 1 (2023): 229–38. http://dx.doi.org/10.2478/bhk-2023-0027.

Full text

Abstract:

Abstract Study aim: This study aimed to determine and compare the ‘optimum power load’ in the hexagonal (HBDL) and straight (SBDL) bar deadlift exercises. Material and methods: Fifteen novice strength-trained males performed three repetitions of the HBDL and SBDL at loads from 20–90% of their one-repetition maximum (1RM). Peak power, average power, peak velocity, and average velocity were determined from each repetition using a velocity-based linear position transducer. Results: Repeated measures ANOVA revealed a significant effect of load for HBDL and SBDL (all p < 0.001). Post-hoc analyses revealed peak power outputs for HBDL were similar across 50–90% 1RM, with the highest peak power recorded at 80% 1RM (1053 W). The peak power outputs for SBDL were similar across 40–90% 1RM, with the highest peak power recorded at 90% 1RM (843 W). A paired sample t-test revealed that HBDL showed greater peak power at 60% (Hedges’ g effect size g = 0.53), average power at 50–70%, (g = 0.56–0.74), and average velocity at 50% of 1RM (g = 0.53). However, SBDL showed greater peak velocity at 20% (g = 0.52) and average velocity at 90% of 1RM (g = 0.44). Conclusion: Practitioners can use these determined loads to target peak power and peak velocity outputs for the HBDL and SBDL exercises (e.g., 50–90% 1RM in HBDL). The HBDL may offer additional advantages resulting in greater peak power and average power outputs than the SBDL.

APA, Harvard, Vancouver, ISO, and other styles

36

Sehajpal, Sumati, Stewart S. Taylor, David J. Allstot, and Jeffrey S. Walling. "Impact of Switching Glitches in Class-G Power Amplifiers." IEEE Microwave and Wireless Components Letters 22, no. 6 (2012): 282–84. http://dx.doi.org/10.1109/lmwc.2012.2197383.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Orlov, Vladimir A., and Miriam Fugfugosh. "The G‐8 Strelna Summit and Russia's national power." Washington Quarterly 29, no. 3 (2006): 35–48. http://dx.doi.org/10.1162/wash.2006.29.3.35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Scheeler, Robert, Sean Korhummel, and Zoya Popovic. "A Dual-Frequency Ultralow-Power Efficient 0.5-g Rectenna." IEEE Microwave Magazine 15, no. 1 (2014): 109–14. http://dx.doi.org/10.1109/mmm.2013.2288836.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Rastkar, A. R., M. R. Setare, and F. Darabi. "Phantom phase power-law solution in f(G) gravity." Astrophysics and Space Science 337, no. 1 (2011): 487–91. http://dx.doi.org/10.1007/s10509-011-0849-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Rothacher, Albrecht. "David G. Marr: Vietnam 1945. The Quest for Power." Asia Europe Journal 4, no. 1 (2006): 105–9. http://dx.doi.org/10.1007/s10308-006-0043-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bhreathnach-Lynch, Sighle. "Cultural Nationalism in Stone: Albert G. Power, 1881-1945." New Hibernia Review 9, no. 2 (2005): 98–110. http://dx.doi.org/10.1353/nhr.2005.0032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Vasić, B., O. Milenković, and S. McLaughlin. "Power spectral density of multitrack (0,G/I) codes." Electronics Letters 33, no. 9 (1997): 784. http://dx.doi.org/10.1049/el:19970519.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Benbow, Dennis. "LEWIS G WEEKS GOLD MEDAL TO PETER E POWER." APPEA Journal 33, no. 2 (1993): 21. http://dx.doi.org/10.1071/aj92039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Taher, Fatimah, Mohamed Bisher Zeina, and Moustafa Mazhar Ranneh. "Hybrid Alpha Power Marshall Olkin G Class of Distributions." Galoitica: Journal of Mathematical Structures and Applications 8, no. 1 (2023): 20–33. http://dx.doi.org/10.54216/gjmsa.080102.

Full text

Abstract:

This research presents a new class of probability distributions derived as a hybrid class between alpha power transformation class and Marshall Olkin G class and we call it the hybrid alpha power Marshall Olkin G class of distributions (HAPMOG). Characteristics properties of this new class were derived including moments, moments generating function, characteristic function, reliability and hazard functions, and its probability density function was presented in linear combination. Also, many generated distributions depending on this new class was presented and well-studied including HAPMOG-Exponential, HAPMOG-Weibull, HAPMOG-Freshet. This new class of distributions helps in modelling new forms of data, which has important applications in engineering, communication systems, networks modeling, etc.

APA, Harvard, Vancouver, ISO, and other styles

45

أحمد إبراهيم حجازي, مي. "Discrete Alpha Power Transformed Weibull -G Family of distributions." المجلة العلمية للدراسات والبحوث المالية والتجارية 5, no. 2 (2024): 41–74. http://dx.doi.org/10.21608/cfdj.2023.247488.1852.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

GUO, XIUYUN, and LIBO ZHAO. "ON J-GROUPS OF PRIME POWER ORDER." Journal of Algebra and Its Applications 11, no. 06 (2012): 1250106. http://dx.doi.org/10.1142/s021949881250106x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Liu, Xin, Guiyun Chen, and Yanxiong Yan. "A new characterization of the automorphism groups of Mathieu groups." Open Mathematics 19, no. 1 (2021): 1245–50. http://dx.doi.org/10.1515/math-2021-0112.

Full text

Abstract:

Abstract Let cd ( G ) {\rm{cd}}\left(G) be the set of irreducible complex character degrees of a finite group G G . ρ ( G ) \rho \left(G) denotes the set of primes dividing degrees in cd ( G ) {\rm{cd}}\left(G) . For any prime p, let p e p ( G ) = max { χ ( 1 ) p ∣ χ ∈ Irr ( G ) } {p}^{{e}_{p}\left(G)}=\max \left\{\chi {\left(1)}_{p}\hspace{0.08em}| \hspace{0.08em}\chi \in {\rm{Irr}}\left(G)\right\} and V ( G ) = { p e p ( G ) ∣ p ∈ ρ ( G ) } V\left(G)=\left\{{p}^{{e}_{p}\left(G)}\hspace{0.08em}| \hspace{0.1em}p\in \rho \left(G)\right\} . The degree prime-power graph Γ ( G ) \Gamma \left(G) of G G is a graph whose vertices set is V ( G ) V\left(G) , and two vertices x , y ∈ V ( G ) x,y\in V\left(G) are joined by an edge if and only if there exists m ∈ cd ( G ) m\in {\rm{cd}}\left(G) such that x y ∣ m xy| m . It is an interesting and difficult problem to determine the structure of a finite group by using its degree prime-power graphs. Qin proved that all Mathieu groups can be uniquely determined by their orders and degree prime-power graphs. In this article, we continue this topic and successfully characterize all the automorphism groups of Mathieu groups by using their orders and degree prime-power graphs.

APA, Harvard, Vancouver, ISO, and other styles

48

Moghaddamfar, A. R., S. Rahbariyan, and W. J. Shi. "Certain properties of the power graph associated with a finite group." Journal of Algebra and Its Applications 13, no. 07 (2014): 1450040. http://dx.doi.org/10.1142/s0219498814500406.

Full text

Abstract:

The power graph [Formula: see text] of a group G is a simple graph whose vertex-set is G and two vertices x and y in G are adjacent if and only if one of them is a power of the other. The subgraph [Formula: see text] of [Formula: see text] is obtained by deleting the vertex 1 (the identity element of G). In this paper, we first investigate some properties of the power graph [Formula: see text] and its subgraph [Formula: see text]. We next provide necessary and sufficient conditions for a power graph [Formula: see text] to be a strongly regular graph, a bipartite graph or a planar graph. Finally, we obtain some infinite families of finite groups G for which the power graph [Formula: see text] contains some cut-edges.

APA, Harvard, Vancouver, ISO, and other styles

49

Girish, Lakshmi, and Kanagasabapathi Somasundaram. "Bound for the k-Fault-Tolerant Power-Domination Number." Symmetry 16, no. 7 (2024): 781. http://dx.doi.org/10.3390/sym16070781.

Full text

Abstract:

A set S⊆V is referred to as a k-fault-tolerant power-dominating set of a given graph G=(V,E) if the difference S∖F remains a power-dominating set of G for any F⊆S with |F|≤k, where k is an integer with 0≤k<|V|. The lowest cardinality of a k-fault-tolerant power-dominating set is the k-fault-tolerant power-domination number of G, denoted by γPk(G). Generalized Petersen graphs GP(m,k) and generalized cylinders SG are two well-known graph classes. In this paper, we calculate the k-fault-tolerant power-domination number of the generalized Petersen graphs GP(m,1) and GP(m,2). Also, we obtain γPk(G) for the subclasses of cylinders SCm and SBm.

APA, Harvard, Vancouver, ISO, and other styles

50

SREETHU, K., and SEEMA VARGHESE. "Power Domination in Generalized Mycielskian of Cycles." Creative Mathematics and Informatics 33, no. 2 (2024): 289–95. http://dx.doi.org/10.37193/cmi.2024.02.14.

Full text

Abstract:

Let $ G=G(V,E) $ be a graph. A set $ S\subseteq V $ is a power dominating set of $ G $ if $ S $ observes all the vertices in $ V,$ following two rules: domination and propagation. The cardinality of a minimum power dominating set is called the power domination number. In this paper, we compute the power domination number of generalized $ m $-Mycielskian of a cycle, $ C_n $. We found that it depends on the numbers $ n \an m $.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'G*Power'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles