Увійти

Готові списки джерел за темами / G-Computation / Статті в журналах

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: G-Computation.

Статті в журналах з теми "G-Computation"

Автор: Grafiati

Опубліковано: 25 січня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 статей у журналах для дослідження на тему "G-Computation".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Breger, Tiffany L., Jessie K. Edwards, Stephen R. Cole, Daniel Westreich, Brian W. Pence, and Adaora A. Adimora. "Two-stage g-computation." Epidemiology 31, no. 5 (September 2020): 695–703. http://dx.doi.org/10.1097/ede.0000000000001233.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Wang, Changping, Chaokun Wang, Gaoyang Guo, Xiaojun Ye, and Philip S. Yu. "Efficient Computation of G-Skyline Groups." IEEE Transactions on Knowledge and Data Engineering 30, no. 4 (April 1, 2018): 674–88. http://dx.doi.org/10.1109/tkde.2017.2777994.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Losev, Ivan V. "Computation of Weyl groups of $G$-varieties." Representation Theory of the American Mathematical Society 14, no. 02 (January 5, 2010): 9–69. http://dx.doi.org/10.1090/s1088-4165-10-00365-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Herman, Allen. "Using G-algebras for Schur index computation." Journal of Algebra 260, no. 2 (February 2003): 463–75. http://dx.doi.org/10.1016/s0021-8693(02)00577-x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Losev, I. V. "Computation of weight lattices of G-varieties." Journal of Mathematical Sciences 161, no. 1 (July 28, 2009): 70–96. http://dx.doi.org/10.1007/s10958-009-9537-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Vansteelandt, S., and N. Keiding. "Invited Commentary: G-Computation-Lost in Translation?" American Journal of Epidemiology 173, no. 7 (March 16, 2011): 739–42. http://dx.doi.org/10.1093/aje/kwq474.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Wang, Aolin, and Onyebuchi A. Arah. "G-computation demonstration in causal mediation analysis." European Journal of Epidemiology 30, no. 10 (October 2015): 1119–27. http://dx.doi.org/10.1007/s10654-015-0100-z.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Hall, Michael J., Neil E. Olson, and Roger D. Chamberlain. "Utilizing Virtualized Hardware Logic Computations to Benefit Multi-User Performance." Electronics 10, no. 6 (March 12, 2021): 665. http://dx.doi.org/10.3390/electronics10060665.

Повний текст джерела

Анотація:

Recent trends in computer architecture have increased the role of dedicated hardware logic as an effective approach to computation. Virtualization of logic computations (i.e., by sharing a fixed function) provides a means to effectively utilize hardware resources by context switching the logic to support multiple data streams of computation. Multiple applications or users can take advantage of this by using the virtualized computation in an accelerator as a computational service, such as in a software as a service (SaaS) model over a network. In this paper, we analyze the performance of virtualized hardware logic and develop M/G/1 queueing model equations and simulation models to predict system performance. We predict system performance using the queueing model and tune a schedule for optimal performance. We observe that high variance and high load give high mean latency. The simulation models validate the queueing model, predict queue occupancy, show that a Poisson input process distribution (assumed in the queueing model) is reasonable for low load, and expand the set of scheduling algorithms considered.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Chu, Yunn-Kuang, and Jau-Chuan Ke. "Mean response time for a G/G/1 queueing system: Simulated computation." Applied Mathematics and Computation 186, no. 1 (March 2007): 772–79. http://dx.doi.org/10.1016/j.amc.2006.08.048.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Chatton, A., F. Le Borgne, M. Léger, R. Lenain, and Y. Foucher. "G-computation et intelligence artificielle en inférence causale." Revue d'Épidémiologie et de Santé Publique 69 (June 2021): S10—S11. http://dx.doi.org/10.1016/j.respe.2021.04.013.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Rablen, Paul R. "A Procedure for Computing Hydrocarbon Strain Energies Using Computational Group Equivalents, with Application to 66 Molecules †." Chemistry 2, no. 2 (April 30, 2020): 347–60. http://dx.doi.org/10.3390/chemistry2020022.

Повний текст джерела

Анотація:

A method is presented for the direct computation of hydrocarbon strain energies using computational group equivalents. Parameters are provided at several high levels of electronic structure theory: W1BD, G-4, CBS-APNO, CBS-QB3, and M062X/6-31+G(2df,p). As an illustration of the procedure, strain energies are computed for 66 hydrocarbons, most of them highly strained.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Xiao, Jianqiang, Dianbo Ma, and Satoshi Yamane. "Optimizing 3D Convolution Kernels on Stereo Matching for Resource Efficient Computations." Sensors 21, no. 20 (October 13, 2021): 6808. http://dx.doi.org/10.3390/s21206808.

Повний текст джерела

Анотація:

Despite recent stereo matching algorithms achieving significant results on public benchmarks, the problem of requiring heavy computation remains unsolved. Most works focus on designing an architecture to reduce the computational complexity, while we take aim at optimizing 3D convolution kernels on the Pyramid Stereo Matching Network (PSMNet) for solving the problem. In this paper, we design a series of comparative experiments exploring the performance of well-known convolution kernels on PSMNet. Our model saves the computational complexity from 256.66 G MAdd (Multiply-Add operations) to 69.03 G MAdd (198.47 G MAdd to 10.84 G MAdd for only considering 3D convolutional neural networks) without losing accuracy. On Scene Flow and KITTI 2015 datasets, our model achieves results comparable to the state-of-the-art with a low computational cost.

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Han, Xixian, Jinbao Wang, Jianzhong Li, and Hong Gao. "Efficient computation of G-Skyline groups on massive data." Information Sciences 587 (March 2022): 300–322. http://dx.doi.org/10.1016/j.ins.2021.12.028.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Delmer, Francine, and Jean-Marc Deshouillers. "On the computation of $g(k)$ in Waring’s problem." Mathematics of Computation 54, no. 190 (May 1, 1990): 885. http://dx.doi.org/10.1090/s0025-5718-1990-1011440-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Fancher, Raymond E. "Spearman's original computation of g: A model for Burt?" British Journal of Psychology 76, no. 3 (August 1985): 341–52. http://dx.doi.org/10.1111/j.2044-8295.1985.tb01957.x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Delmer, Francine, and Jean-Marc Deshouillers. "On the Computation of g(k) in Waring's Problem." Mathematics of Computation 54, no. 190 (April 1990): 885. http://dx.doi.org/10.2307/2008517.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Hernandez, Lucia N., та Christopher J. Nachtsheim. "Fast Computation of Exact G-Optimal Designs Via Iλ-Optimality". Technometrics 60, № 3 (3 липня 2018): 297–305. http://dx.doi.org/10.1080/00401706.2017.1371080.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Gandy, Paul J. F., and Jacek Klinowski. "Exact computation of the triply periodic G (`Gyroid') minimal surface." Chemical Physics Letters 321, no. 5-6 (May 2000): 363–71. http://dx.doi.org/10.1016/s0009-2614(00)00373-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Neugebauer, Romain, and Mark J. van der Laan. "G-computation estimation for causal inference with complex longitudinal data." Computational Statistics & Data Analysis 51, no. 3 (December 2006): 1676–97. http://dx.doi.org/10.1016/j.csda.2006.06.016.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Rabanillo‐Viloria, Iñaki, Ante Zhu, Santiago Aja‐Fernández, Carlos Alberola‐López, and Diego Hernando. "Computation of exact g‐factor maps in 3D GRAPPA reconstructions." Magnetic Resonance in Medicine 81, no. 2 (September 6, 2018): 1353–67. http://dx.doi.org/10.1002/mrm.27469.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Seddighin, Morteza. "Computation of antieigenvalues." International Journal of Mathematics and Mathematical Sciences 2005, no. 5 (2005): 815–21. http://dx.doi.org/10.1155/ijmms.2005.815.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Chatton, Arthur, Florent Le Borgne, Clémence Leyrat, and Yohann Foucher. "G-computation and doubly robust standardisation for continuous-time data: A comparison with inverse probability weighting." Statistical Methods in Medical Research 31, no. 4 (December 3, 2021): 706–18. http://dx.doi.org/10.1177/09622802211047345.

Повний текст джерела

Анотація:

In time-to-event settings, g-computation and doubly robust estimators are based on discrete-time data. However, many biological processes are evolving continuously over time. In this paper, we extend the g-computation and the doubly robust standardisation procedures to a continuous-time context. We compare their performance to the well-known inverse-probability-weighting estimator for the estimation of the hazard ratio and restricted mean survival times difference, using a simulation study. Under a correct model specification, all methods are unbiased, but g-computation and the doubly robust standardisation are more efficient than inverse-probability-weighting. We also analyse two real-world datasets to illustrate the practical implementation of these approaches. We have updated the R package RISCA to facilitate the use of these methods and their dissemination.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Saloff-Coste, Laurent, and Wolfgang Woess. "Computing Norms of Group-Invariant Transition Operators." Combinatorics, Probability and Computing 5, no. 2 (June 1996): 161–78. http://dx.doi.org/10.1017/s0963548300001942.

Повний текст джерела

Анотація:

We consider transition operators P on a countable set, which are reversible, irreducible and invariant under a group G of permutations of X with compact point stabilizers. We relate the computation of the spectral radius (norm) of P with the spectral radii of certain matrices defined over the factor set G\X. In various cases, this allows easy computation of the norm of P.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

DENG, YI, and SHI-KUO CHANG. "A FRAMEWORK FOR THE MODELING AND PROTOTYPING OF DISTRIBUTED INFORMATION SYSTEMS." International Journal of Software Engineering and Knowledge Engineering 01, no. 03 (September 1991): 203–26. http://dx.doi.org/10.1142/s0218194091000172.

Повний текст джерела

Анотація:

The major issues in designing Distributed Information Systems (DIS) include localization of control and data, inherent concurrency, intensive interactions among computation agents, history sensitivity, dynamic configuration and continuous system change and evolution. We propose a framework, called the G-Net model, for the specification, modeling and prototyping of DIS. The G-Net model not only provides a flexible notation to represent the executable specification of DIS through G-Net instantiation, but also offers a novel style of decentralized concurrent computation, allowing flexible inter-agent communication and interaction. A prototype of the G-Net framework has been implemented on workstations connected by a local network.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Pérez, Juan F., and Benny Van Houdt. "THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS." Probability in the Engineering and Informational Sciences 25, no. 4 (July 21, 2011): 487–517. http://dx.doi.org/10.1017/s0269964811000155.

Повний текст джерела

Анотація:

We consider M/G/1-type Markov chains where a transition that decreases the value of the level triggers the phase to a small subset of the phase space. We show how this structure—referred to as restricted downward transitions—can be exploited to speed up the computation of the stationary probability vector of the chain. To this end we define a new M/G/1-type Markov chain with a smaller block size, the G matrix of which is used to find the original chain's G matrix. This approach is then used to analyze the BMAP/PH/1 queue and the BMAP[2]/PH[2]/1 preemptive priority queue, yielding significant reductions in computation time.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Paredaens, J., P. Peelman, and L. Tanca. "Merging graph-based and rule-based computation: The language G-Log." Data & Knowledge Engineering 25, no. 3 (April 1998): 267–300. http://dx.doi.org/10.1016/s0169-023x(97)00020-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Rose, S., J. M. Snowden, and K. M. Mortimer. "Rose et al. Respond to "G-Computation and Standardization in Epidemiology"." American Journal of Epidemiology 173, no. 7 (March 16, 2011): 743–44. http://dx.doi.org/10.1093/aje/kwq475.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Lee, Kunyoung, Seunghyun Kim, and Eui Chul Lee. "Fast and Accurate Facial Expression Image Classification and Regression Method Based on Knowledge Distillation." Applied Sciences 13, no. 11 (May 24, 2023): 6409. http://dx.doi.org/10.3390/app13116409.

Повний текст джерела

Анотація:

As emotional states are diverse, simply classifying them through discrete facial expressions has its limitations. Therefore, to create a facial expression recognition system for practical applications, not only must facial expressions be classified, emotional changes must be measured as continuous values. Based on the knowledge distillation structure and the teacher-bounded loss function, we propose a method to maximize the synergistic effect of jointly learning discrete and continuous emotional states of eight expression classes, valences, and arousal levels. The proposed knowledge distillation model uses Emonet, a state-of-the-art continuous estimation method, as the teacher model, and uses a lightweight network as the student model. It was confirmed that performance degradation can be minimized even though student models have multiply-accumulate operations of approximately 3.9 G and 0.3 G when using EfficientFormer and MobileNetV2, respectively, which is much less than the amount of computation required by the teacher model (16.99 G). Together with the significant improvements in computational efficiency (by 4.35 and 56.63 times using EfficientFormer and MobileNetV2, respectively), the decreases in facial expression classification accuracy were approximately 1.35% and 1.64%, respectively. Therefore, the proposed method is optimized for application-level interaction systems in terms of both the amount of computation required and the accuracy.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Niwas, Sri, and M. Israil. "Computation of apparent resistivities using an exponential approximation of kernel functions." GEOPHYSICS 51, no. 8 (August 1986): 1594–602. http://dx.doi.org/10.1190/1.1442210.

Повний текст джерела

Анотація:

We present a fresh approach to the mathematical computation of apparent resistivities in electrical prospecting. The method is based on an exponential approximation of the kernel function which reduces the integral equation for the potential over a layered earth to a simple algebraic equation. The coefficients in the approximation are obtained using a least‐squares inversion technique. A single, unified matrix equation allows computation of apparent resistivity values for arbitrary four‐electrode arrays over a layered earth. The unified G function automatically reduces to that of a symmetrical four‐electrode array and dipole array function with the proper interelectrode separation. Computations for some two‐, three‐, and four‐layer earth models (Schlumberger configuration), along with a few Wenner and radial dipole apparent resistivity values, demonstrate the versatility of this unified equation.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Tian, Yi. "Exact solutions for a class of volterral integral-differential equations arising in viscoelastic fluid." Thermal Science 20, no. 3 (2016): 807–12. http://dx.doi.org/10.2298/tsci1603807t.

Повний текст джерела

Анотація:

In this paper, we applied (G'/G)-expansion method to a class of Volterra integral-differential equations in viscoelastic fluid. The solution procedure of this method, by the help of symbolic computation of MATLAB, is of utter simplicity. The obtained results show that (G'/G)-expansion method is effective.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Băncioiu, Camil, and Remus Brad. "Accelerating Causal Inference and Feature Selection Methods through G-Test Computation Reuse." Entropy 23, no. 11 (November 12, 2021): 1501. http://dx.doi.org/10.3390/e23111501.

Повний текст джерела

Анотація:

This article presents a novel and remarkably efficient method of computing the statistical G-test made possible by exploiting a connection with the fundamental elements of information theory: by writing the G statistic as a sum of joint entropy terms, its computation is decomposed into easily reusable partial results with no change in the resulting value. This method greatly improves the efficiency of applications that perform a series of G-tests on permutations of the same features, such as feature selection and causal inference applications because this decomposition allows for an intensive reuse of these partial results. The efficiency of this method is demonstrated by implementing it as part of an experiment involving IPC–MB, an efficient Markov blanket discovery algorithm, applicable both as a feature selection algorithm and as a causal inference method. The results show outstanding efficiency gains for IPC–MB when the G-test is computed with the proposed method, compared to the unoptimized G-test, but also when compared to IPC–MB++, a variant of IPC–MB which is enhanced with an AD–tree, both static and dynamic. Even if this proposed method of computing the G-test is presented here in the context of IPC–MB, it is in fact bound neither to IPC–MB in particular, nor to feature selection or causal inference applications in general, because this method targets the information-theoretic concept that underlies the G-test, namely conditional mutual information. This aspect grants it wide applicability in data sciences.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Chen, Lingling, Hongmei Zhang, and Yuejun Song. "Extraction of Impervious Surface from High-Resolution Remote Sensing Images Based on a Lightweight Convolutional Neural Network." Wireless Communications and Mobile Computing 2022 (August 28, 2022): 1–8. http://dx.doi.org/10.1155/2022/8636973.

Повний текст джерела

Анотація:

Due to continuous progress of urbanization in China, large area of natural surface has become impervious. Automatic extraction of impervious surface (IS) from high-resolution remote sensing images is important to urban planning and environmental management. Artificial identification of IS is time-consuming and laborious. It is valuable to develop more intelligent recognition patterns. In recent years, semantic segmentation models based on convolutional neural network (CNN) have made great progress in extraction of IS from remote sensing images. However, most existing models focus on improving accuracy and rarely consider computational efficiency. In order to keep balance between computing resource consumption, computing speed, and segmentation accuracy, we propose a lightweight semantic segmentation network model based on CNN, and we named it LWIBNet. LWIBNet uses an efficient encoding-decoding structure as the skeleton and connects the encoding part and the decoding part by the Skip Layer. Moreover, in order to reduce the number of parameters and speed up the calculation, we introduce improved Squeeze-and-Excitation (SE) module, inverted residuals, and depthwise separable convolution to form the Inv-Bottleneck (IB) module and use it as the core to build the LWIBNet model. On the computational complexity, LWIBNet and LWIBNet-TTA have the lowest FLOPs (14.14 G), and SegNet has the second lowest FLOPs, but SegNet is 3.2 times higher than LWIBNet (45.05 G vs 14.14 G). Both the LWIBNet model and classic models are tested and compared on the same data set. The results show that the LWIBNet model achieves a bit higher segmentation accuracy with less computation cost, and its computation speed is faster.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Ellenberg, Lauren, Gabriella Newman, Stephen Sawin, and Jonathan Shi. "Efficient computation of the Kauffman bracket." Journal of Knot Theory and Its Ramifications 23, no. 05 (April 2014): 1450026. http://dx.doi.org/10.1142/s0218216514500266.

Повний текст джерела

Анотація:

This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with g boundary points and n crossings in the Kauffman bracket skein module is a linear combination of O(2g) basis elements, with each coefficient a polynomial with at most n non-zero terms, each with integer coefficients, and that the link can be built one crossing at a time as a sequence of tangles with maximum number of boundary points bounded by [Formula: see text] for some C. From this it follows that the computation of the Kauffman bracket of the link takes time and memory a polynomial in n times [Formula: see text].

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Ghosal, A., and Ashok Kumar Barman. "Computation of Statistical Distribution of Delay Time for G1/G/1 System." Calcutta Statistical Association Bulletin 44, no. 1-2 (March 1994): 103–14. http://dx.doi.org/10.1177/0008068319940108.

Повний текст джерела

Анотація:

In queuing literature identification of delay time distribution is confined either to determination of its balance transformation or computation of its mean. This paper deals with the approximation of the distribution of its delay time under equilibrium conditions.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

EPSTEIN, DAVID B. A., and DEREK F. HOLT. "COMPUTATION IN WORD-HYPERBOLIC GROUPS." International Journal of Algebra and Computation 11, no. 04 (August 2001): 467–87. http://dx.doi.org/10.1142/s0218196701000619.

Повний текст джерела

Анотація:

We describe two practical algorithms for computing with word-hyperbolic groups, both of which we have implemented. The first is a method for estimating the maximum width, if it exists, of geodesic bigons in the Cayley graph of a finitely presented group G. Our procedure will terminate if and only this maximum width exists, and it has been proved by Papasoglu that this is the case if and only if G is word-hyperbolic. So the algorithm amounts to a method of verifying the property of word-hyperbolicity of G. The aim of the second algorithm is to compute the thinness constant for geodesic triangles in the Cayley graph of G. This seems to be a much more difficult problem, but our implementation does succeed with straightforward examples. Both algorithms involve substantial computations with finite state automata.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Campo-Montalvo, Elena, Marián Fernández de Sevilla, J. Rafael Magdalena Benedicto, and Sonia Pérez-Díaz. "Some New Symbolic Algorithms for the Computation of Generalized Asymptotes." Symmetry 15, no. 1 (December 26, 2022): 69. http://dx.doi.org/10.3390/sym15010069.

Повний текст джерела

Анотація:

We present symbolic algorithms for computing the g-asymptotes, or generalized asymptotes, of a plane algebraic curve, C, implicitly or parametrically defined. The g-asymptotes generalize the classical concept of asymptotes of a plane algebraic curve. Both notions have been previously studied for analyzing the geometry and topology of a curve at infinity points, as well as to detect the symmetries that can occur in coordinates far from the origin. Thus, based on this research, and in order to solve practical problems in the fields of science and engineering, we present the pseudocodes and implementations of algorithms based on the Puiseux series expansion to construct the g-asymptotes of a plane algebraic curve, implicitly or parametrically defined. Additionally, we propose some new symbolic methods and their corresponding implementations which improve the efficiency of the preceding. These new methods are based on the computation of limits and derivatives; they show higher computational performance, demanding fewer hardware resources and system requirements, as well as reducing computer overload. Finally, as a novelty in this research area, a comparative analysis for all the algorithms is carried out, considering the properties of the input curves and their outcomes, to analyze their efficiency and to establish comparative criteria between them.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Wang, Xueqin, Yadong Shang, and Huahui Di. "Exact Solutions for the Wick-Type Stochastic Schamel-Korteweg-de Vries Equation." Advances in Mathematical Physics 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/4647838.

Повний текст джерела

Анотація:

We consider the Wick-type stochastic Schamel-Korteweg-de Vries equation with variable coefficients in this paper. With the aid of symbolic computation and Hermite transformation, by employing the (G′/G,1/G)-expansion method, we derive the new exact travelling wave solutions, which include hyperbolic and trigonometric solutions for the considered equations.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Arulmozhi, G. "Direct method for reliability computation of k-out-of-n: G systems." Applied Mathematics and Computation 143, no. 2-3 (November 2003): 421–29. http://dx.doi.org/10.1016/s0096-3003(02)00373-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Schmidt, Silke. "Quantile g-Computation: A New Method for Analyzing Mixtures of Environmental Exposures." Environmental Health Perspectives 128, no. 10 (October 2020): 104004. http://dx.doi.org/10.1289/ehp7342.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Castro, M. E., A. Niño, and C. Muñoz-Caro. "Gmat. A software tool for the computation of the rovibrational G matrix." Computer Physics Communications 180, no. 7 (July 2009): 1183–87. http://dx.doi.org/10.1016/j.cpc.2009.01.006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Gioia, Ciro, Antonio Angrisano, and Salvatore Gaglione. "Neustrelitz Total Electron Content Model for Galileo Performance: A Position Domain Analysis." Sensors 23, no. 7 (April 6, 2023): 3766. http://dx.doi.org/10.3390/s23073766.

Повний текст джерела

Анотація:

Ionospheric error is one of the largest errors affecting global navigation satellite system (GNSS) users in open-sky conditions. This error can be mitigated using different approaches including dual-frequency measurements and corrections from augmentation systems. Although the adoption of multi-frequency devices has increased in recent years, most GNSS devices are still single-frequency standalone receivers. For these devices, the most used approach to correct ionospheric delays is to rely on a model. Recently, the empirical model Neustrelitz Total Electron Content Model for Galileo (NTCM-G) has been proposed as an alternative to Klobuchar and NeQuick-G (currently adopted by GPS and Galileo, respectively). While the latter outperforms the Klobuchar model, it requires a significantly higher computational load, which can limit its exploitation in some market segments. NTCM-G has a performance close to that of NeQuick-G and it shares with Klobuchar the limited computation load; the adoption of this model is emerging as a trade-off between performance and complexity. The performance of the three algorithms is assessed in the position domain using data for different geomagnetic locations and different solar activities and their execution time is also analysed. From the test results, it has emerged that in low- and medium-solar-activity conditions, NTCM-G provides slightly better performance, while NeQuick-G has better performance with intense solar activity. The NTCM-G computational load is significantly lower with respect to that of NeQuick-G and is comparable with that of Klobuchar.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Xu, Gen Hai, Song Hua Ma, and Jian Ping Fang. "Investigation of (G^'/G)-Expansion Method and Exact Solutions for the (2+1)-Dimensional Calogero-Bogoyavlenskii-Schiff System." Applied Mechanics and Materials 432 (September 2013): 235–39. http://dx.doi.org/10.4028/www.scientific.net/amm.432.235.

Повний текст джерела

Анотація:

With the help of the symbolic computation system Maple and the (G'/G)-expansion method and a linear variable separation method, a new family of exact solutions (including solitary wave solutions,periodic wave solutions and rational function solutions) of the (2+1)-dimensional Calogero-Bogoyavlenskii-Schiff system (2DCBS) is derived.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Mărcuț, Ioan. "Deformations of the Lie–Poisson sphere of a compact semisimple Lie algebra." Compositio Mathematica 150, no. 4 (March 27, 2014): 568–78. http://dx.doi.org/10.1112/s0010437x13007689.

Повний текст джерела

Анотація:

AbstractA compact semisimple Lie algebra $\mathfrak{g}$ induces a Poisson structure $\pi _{\mathbb{S}}$ on the unit sphere $\mathbb{S}(\mathfrak{g}^*)$ in $\mathfrak{g}^*$. We compute the moduli space of Poisson structures on $\mathbb{S}(\mathfrak{g}^*)$ around $\pi _{\mathbb{S}}$. This is the first explicit computation of a Poisson moduli space in dimension greater or equal than three around a degenerate (i.e. not symplectic) Poisson structure.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Huang, Xin. "The Investigation of Solutions to the Coupled Schrödinger-Boussinesq Equations." Abstract and Applied Analysis 2013 (2013): 1–5. http://dx.doi.org/10.1155/2013/170372.

Повний текст джерела

Анотація:

The (G′/G)-expansion method and the symbolic computation system Mathematica are employed to investigate the coupled Schrödinger-Boussinesq equations. The hyperbolic function solutions, trigonometric function solutions, and rational function solutions to the equations are obtained. The decaying properties of several solutions are analyzed.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Bourgey, Florian, Stefano De Marco, Emmanuel Gobet, and Alexandre Zhou. "Multilevel Monte Carlo methods and lower–upper bounds in initial margin computations." Monte Carlo Methods and Applications 26, no. 2 (June 1, 2020): 131–61. http://dx.doi.org/10.1515/mcma-2020-2062.

Повний текст джерела

Анотація:

AbstractThe multilevel Monte Carlo (MLMC) method developed by M. B. Giles [Multilevel Monte Carlo path simulation, Oper. Res. 56 2008, 3, 607–617] has a natural application to the evaluation of nested expectations {\mathbb{E}[g(\mathbb{E}[f(X,Y)|X])]}, where {f,g} are functions and {(X,Y)} a couple of independent random variables. Apart from the pricing of American-type derivatives, such computations arise in a large variety of risk valuations (VaR or CVaR of a portfolio, CVA), and in the assessment of margin costs for centrally cleared portfolios. In this work, we focus on the computation of initial margin. We analyze the properties of corresponding MLMC estimators, for which we provide results of asymptotic optimality; at the technical level, we have to deal with limited regularity of the outer function g (which might fail to be everywhere differentiable). Parallel to this, we investigate upper and lower bounds for nested expectations as above, in the spirit of primal-dual algorithms for stochastic control problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Zhang, Zhigang, Songfeng Lu, Jie Sun, and Qing Zhou. "The Constant Speedup Mechanism on Adiabatic Quantum Computation." Journal of Computational and Theoretical Nanoscience 13, no. 10 (October 1, 2016): 7262–65. http://dx.doi.org/10.1166/jctn.2016.5997.

Повний текст джерела

Анотація:

In the adiabatic quantum computation model, a computational procedure is described by the continuous time evolution of a time dependent Hamiltonian. Classically, the unstructured search problem can be solved only in a running time of order O(G). However, by modifying the structure of local Hamiltonian or using specific interpolating functions, it is possible to do the calculation in constant time for a quantum computer. This paper reveals the cause that lead to the speedup. We analyze two kinds of specific adiabatic quantum models, and conclude that the value of relevant elements in back-diagonal of the local Hamiltonian is the main factors affecting the time complexity of adiabatic quantum algorithms. According to the speedup mechanism, we have proposed two kinds of adiabatic quantum algorithms to make a constant time complexity.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Yu, Zimeng, and Hailong Tian. "Application of Machine Learning in Predicting Formation Condition of Multi-Gas Hydrate." Energies 15, no. 13 (June 28, 2022): 4719. http://dx.doi.org/10.3390/en15134719.

Повний текст джерела

Анотація:

Thermodynamic models are usually employed to predict formation condition of hydrates. However, these thermodynamic models usually require a large amount of calculations to approach phase equilibrium. Additionally, parameters included in the thermodynamic model need to be calibrated based on the experimental data, which leads to high uncertainties in the predicted results. With the rapid development of artificial intelligence (AI), machine learning as one of sub-discipline has been developed and been widely applied in various research area. In this work, machine learning was innovatively employed to predict the formation condition of natural gas hydrates to overcome the high computation cost and low accuracy. Three data-driven models, Random Forest (RF), Naive Bayes (NB), Support Vector Regression (SVR) were tentatively used to determine the formation condition of hydrate formed by pure and mixed gases. Experimental data reported in previous work were taken to train and test the machine learning models. As a representative thermodynamic model the Chen–Guo (C-G) model was used to analyze the computational efficiency and accuracy of machine learning models. The comparison of results predicted by C-G model and machine learning models with the experimental data indicated that the RF model performed better than the NB and SVR models on both computation speed and accuracy. According to the experimental data, the average AADP calculated by the C-G model is 7.62 times that calculated by the RF model. Meanwhile, the average time costed by the C-G model is 75.65 times that by the RF model. Compared with the other two machine learning models, the RF model is expected to be used in predicting the formation condition of natural gas hydrate under field conditions.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Manafian, Jalil, and Monireh Nasrollahpour. "Exact Solutions for the KdV Equation with Forcing Term by the Generalized tanh-coth Method and the (G′/G)-Expansion Method." ISRN Applied Mathematics 2014 (June 3, 2014): 1–12. http://dx.doi.org/10.1155/2014/948072.

Повний текст джерела

Анотація:

An application of the generalized tanh-coth method and the (G′/G)-expansion method to search for exact solutions of nonlinear partial differential equations is analyzed. These methods are used for the KdV equation with forcing term. The generalized tanh-coth method and the (G′/G)-expansion method were used to construct periodic wave and solitary wave solutions of nonlinear evolution equations. It is shown that the generalized tanh-coth method and the (G′/G)-expansion method, with the help of symbolic computation, provide a straightforward and powerful mathematical tool for solving nonlinear problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Zhou, Jia-Kai, Dah-Yen Yang, and Sheh-Yi Sheu. "The molecular mechanism of ligand unbinding from the human telomeric G-quadruplex by steered molecular dynamics and umbrella sampling simulations." Physical Chemistry Chemical Physics 17, no. 19 (2015): 12857–69. http://dx.doi.org/10.1039/c5cp00378d.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

KARAGIORGOS, GREGORY, and DIMITRIOS POULAKIS. "EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS." Discrete Mathematics, Algorithms and Applications 03, no. 04 (December 2011): 537–52. http://dx.doi.org/10.1142/s1793830911001401.

Повний текст джерела

Анотація:

In this paper we consider the problem of computation of a basis for an abelian group G with N elements such that the prime factorization of N is known. We present two deterministic algorithms for this task and a deterministic algorithm in case where a generating system for G is given.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!