Einloggen

Thematische Bibliographien / Computational analysis / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Computational analysis.

Zeitschriftenartikel zum Thema „Computational analysis“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 11. September 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Computational analysis" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Liu, G. R. „Computational methods for certified solutions, adaptive analysis, real-time computation, and inverse analysis of mechanics problem“. Proceedings of The Computational Mechanics Conference 2011.24 (2011): _—1_—_—5_. http://dx.doi.org/10.1299/jsmecmd.2011.24._-1_.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

ILIE, Marcel, Augustin Semenescu, Gabriela Liliana STROE und Sorin BERBENTE. „NUMERICAL COMPUTATIONS OF THE CAVITY FLOWS USING THE POTENTIAL FLOW THEORY“. ANNALS OF THE ACADEMY OF ROMANIAN SCIENTISTS Series on ENGINEERING SCIENCES 13, Nr. 2 (2021): 78–86. http://dx.doi.org/10.56082/annalsarscieng.2021.2.78.

Der volle Inhalt der Quelle

Annotation:

Computational fluid dynamics of turbulent flows requires large computational resources or are not suitable for the computations of transient flows. Therefore methods such as Reynolds-averaged Navier-Stokes equations are not suitable for the computation of transient flows. The direct numerical simulation provides the most accurate solution, but it is not suitable for high-Reynolds number flows. Large-eddy simulation (LES) approach is computationally less demanding than the DNS but still computationally expensive. Therefore, alternative computational methods must be sought. This research concerns the modelling of inviscid incompressible cavity flow using the potential flow. The numerical methods employed the finite differences approach. The time and space discretization is achieved using second-order schemes. The studies reveal that the finite differences approach is a computationally efficient approach and large computations can be performed on a single computer. The analysis of the flow physics reveals the presence of the recirculation region inside the cavity as well at the corners of the cavity

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Juneja, Shall, Deepayan Mukherjee und Sachi Garg. „Computational Analysis of RNA Nucleotide Sequences“. International Journal of Trend in Scientific Research and Development Volume-3, Issue-2 (28.02.2019): 369–72. http://dx.doi.org/10.31142/ijtsrd21342.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Fajdiga, Gorazd. „Computational fatigue analysis of contacting mechanical elements“. Tehnicki vjesnik - Technical Gazette 22, Nr. 1 (2015): 169–75. http://dx.doi.org/10.17559/tv-20140429122305.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Bhardwaj, Shalini, und Yashwant Buke. „Computational Fluid Dynamics Analysis of A Turbocharger System“. International Journal of Scientific Research 3, Nr. 5 (01.06.2012): 161–64. http://dx.doi.org/10.15373/22778179/may2014/49.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Gao, Feng, Gang Li, Rui Hu und Hiroshi Okada. „Computational Fluid Dynamic Analysis of Coronary Artery Stenting“. International Journal of Bioscience, Biochemistry and Bioinformatics 4, Nr. 3 (2014): 155–59. http://dx.doi.org/10.7763/ijbbb.2014.v4.330.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

LESSNER, Daniel. „ANALYSIS OF TERM MEANING "COMPUTATIONAL THINKING"“. Journal of Technology and Information 6, Nr. 1 (01.04.2014): 71–88. http://dx.doi.org/10.5507/jtie.2014.006.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Takizawa, Kenji, Yuri Bazilevs, Tayfun E. Tezduyar, Ming-Chen Hsu und Takuya Terahara. „Computational Cardiovascular Medicine With Isogeometric Analysis“. Journal of Advanced Engineering and Computation 6, Nr. 3 (30.09.2022): 167. http://dx.doi.org/10.55579/jaec.202263.381.

Der volle Inhalt der Quelle

Annotation:

Isogeometric analysis (IGA) brought superior accuracy to computations in both fluid and solid mechanics. The increased accuracy has been in representing both the problem geometry and the variables computed. Beyond using IGA basis functions in space, with IGA basis functions in time in a space–time (ST) context, we can have increased accuracy also in representing the motion of solid surfaces. Around the core methods such as the residual-based variational multiscale (VMS), ST-VMS and arbitrary Lagrangian–Eulerian VMS methods, with complex-geometry IGA mesh generation methods and immersogeometric analysis, and with special methods targeting specific classes of computations, the IGA has been very effective in computational cardiovascular medicine. We provide an overview of these IGA-based computational cardiovascular-medicine methods and present examples of the computations performed.This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium provided the original work is properly cited.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Planitz, Max, und R. E. Moore. „Computational Functional Analysis“. Mathematical Gazette 70, Nr. 451 (März 1986): 69. http://dx.doi.org/10.2307/3615858.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Fink, James P., und R. E. Moore. „Computational Functional Analysis.“ Mathematics of Computation 47, Nr. 175 (Juli 1986): 372. http://dx.doi.org/10.2307/2008105.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Giraud, Mathieu, Richard Groult, Emmanuel Leguy und Florence Levé. „Computational Fugue Analysis“. Computer Music Journal 39, Nr. 2 (Juni 2015): 77–96. http://dx.doi.org/10.1162/comj_a_00300.

Der volle Inhalt der Quelle

Annotation:

One of the pinnacles of form in classical Western music, the fugue is often used in the teaching of music analysis and composition. Fugues alternate between instances of a subject and other patterns and modulatory sections, called episodes. Musicological analyses are generally built on these patterns and sections. We have developed several algorithms to perform an automated analysis of a fugue, starting from a score in which all the voices are separated. By focusing on the diatonic similarities between pitch intervals, we detect subjects and countersubjects, as well as partial harmonic sequences inside the episodes. We also implemented tools to detect subject scale degrees, cadences, and pedals, as well as a method for segmenting the fugue into exposition and episodic parts. Our algorithms were tested on a corpus of 36 fugues by J. S. Bach and Dmitri Shostakovich. We provide formalized ground-truth data on this corpus as well as a dynamic visualization of the ground truth and of our computed results. The complete system showed acceptable or good results for about one half of the fugues tested, enabling us to depict their design.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Protsko, I. O., und D. V. Ostrovka. „ANALYSIS OF THE ERROR OF COMPUTATION FAST TRANSFORMS OF FOURIER CLASS BASED ON CYCLIC CONVOLUTIONS“. Ukrainian Journal of Information Technology 2, Nr. 1 (2020): 52–56. http://dx.doi.org/10.23939/ujit2020.02.052.

Der volle Inhalt der Quelle

Annotation:

The features of the computational model of discrete transforms of Fourier class based on cyclic convolutions to determine the algorithmic calculation error are analyzed. Based on the approach of efficient computation of discrete transforms of Fourier class of arbitrary size N, using of a hashing array to transform a discrete basis matrix into a set of block-cyclic submatrices, the components of computational costs are considered. These components of computational costs depend on the type of transform, the size and the block-cycle structure of the transformation core. Examples of computational model and block-cyclic structure of matrices of simplified arguments of basis functions for mutually inverse discrete cosine transforms of types II, III are given. The computational model characterizes the accumulation of rounding errors at the stages of adding input data, computing cyclic convolutions, combining the results of convolutions. Discrete cyclic convolutions can be implemented using fast algorithms or a type of system that corresponds to digital filters with finite pulse characteristics. The possibility of parallel computation of the reduced number of cyclic convolutions makes the analysis of errors insensitive to rearrangement of their computations. The multiplication operations performed when computing the cyclic convolution uses a smaller number of basis coefficients equal to N/4 or N/2 depending on the size of transform. The formats of representation of real numbers in computer systems are considered, which also determine the magnitude of the computational error of transforms. The results of direct and fast computation of discrete cosine transform of type II based on cyclic convolutions with size N=58 in the format wit floating point of double precision and computation error between them are presented. The apriori process of studying the transform errors of the corresponding type and size by the method of mathematical modeling and computational experiment is approximate, which allows to predict the statistical averages of the accuracy of computing the discrete Fourier transform of arbitrary size based on cyclic convolutions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

C., Mohan Raj. „Analysis of Various Automotive Mufflers: Computational Fluid Dynamics Approach“. Revista Gestão Inovação e Tecnologias 11, Nr. 4 (10.07.2021): 1339–48. http://dx.doi.org/10.47059/revistageintec.v11i4.2191.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Kumar, Sachin. „Computational Analysis for Random Winglet Designs on Light Aircraft“. Journal of Advanced Research in Mechanical Engineering and Technology 05, Nr. 01 (19.03.2018): 01–16. http://dx.doi.org/10.24321/2454.8650.201801.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Sahu, Rishabh Kumar, Saurabh Sharma und Vivek Swaroop Vishal Kumar. „Experimental Investigations and Computational Analysis on Subsonic Wind Tunnel“. International Journal of Trend in Scientific Research and Development Volume-3, Issue-3 (30.04.2019): 1708–11. http://dx.doi.org/10.31142/ijtsrd23511.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Cortés, J. C., J. V. Romero, M. D. Roselló, Francisco-J. Santonja und Rafael-J. Villanueva. „Solving Continuous Models with Dependent Uncertainty: A Computational Approach“. Abstract and Applied Analysis 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/983839.

Der volle Inhalt der Quelle

Annotation:

This paper presents a computational study on a quasi-Galerkin projection-based method to deal with a class of systems of random ordinary differential equations (r.o.d.e.’s) which is assumed to depend on a finite number of random variables (r.v.’s). This class of systems of r.o.d.e.’s appears in different areas, particularly in epidemiology modelling. In contrast with the other available Galerkin-based techniques, such as the generalized Polynomial Chaos, the proposed method expands the solution directly in terms of the random inputs rather than auxiliary r.v.’s. Theoretically, Galerkin projection-based methods take advantage of orthogonality with the aim of simplifying the involved computations when solving r.o.d.e.’s, which means to compute both the solution and its main statistical functions such as the expectation and the standard deviation. This approach requires the previous determination of an orthonormal basis which, in practice, could become computationally burden and, as a consequence, could ruin the method. Motivated by this fact, we present a technique to deal with r.o.d.e.’s that avoids constructing an orthogonal basis and keeps computationally competitive even assuming statistical dependence among the random input parameters. Through a wide range of examples, including a classical epidemiologic model, we show the ability of the method to solve r.o.d.e.’s.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Wang, Xin, Zhi Yu, Le Yang und Ji Li. „Design and Analysis of a Non-Iterative Estimator for Target Location in Multistatic Sonar Systems with Sensor Position Uncertainties“. Mathematics 8, Nr. 1 (15.01.2020): 129. http://dx.doi.org/10.3390/math8010129.

Der volle Inhalt der Quelle

Annotation:

Target location is the basic application of a multistatic sonar system. Determining the position/velocity vector of a target from the related sonar observations is a nonlinear estimation problem. The presence of possible sensor position uncertainties turns this problem into a more challenging hybrid parameter estimation problem. Conventional gradient-based iterative estimators suffer from the problems of initialization difficulties and local convergence. Even if there is no problem with initialization and convergence, a large computational cost is required in most cases. In view of these drawbacks, we develop a computationally efficient non-iterative position/velocity estimator. The main numerical computation involved is the weighted least squares optimization, which makes the estimator computationally efficient. Parameter transformation, model linearization and two-stage processing are exploited to prevent the estimator from iterative computation. Through performance analysis and experimental verification, we find that the proposed estimator reaches the hybrid Cramér–Rao bound and has linear computational complexity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Alkhimova, Larisa E., Maria G. Babashkina und Damir A. Safin. „Computational analysis of aspirin“. Journal of Molecular Structure 1251 (März 2022): 131975. http://dx.doi.org/10.1016/j.molstruc.2021.131975.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Sharov, Artem V., Tatyana M. Burkhanova, Tugba Taskın Tok, Maria G. Babashkina und Damir A. Safin. „Computational Analysis of Molnupiravir“. International Journal of Molecular Sciences 23, Nr. 3 (28.01.2022): 1508. http://dx.doi.org/10.3390/ijms23031508.

Der volle Inhalt der Quelle

Annotation:

In this work, we report in-depth computational studies of three plausible tautomeric forms, generated through the migration of two acidic protons of the N4-hydroxylcytosine fragment, of molnupiravir, which is emerging as an efficient drug to treat COVID-19. The DFT calculations were performed to verify the structure of these tautomers, as well as their electronic and optical properties. Molecular docking was applied to examine the influence of the structures of the keto-oxime, keto-hydroxylamine and hydroxyl-oxime tautomers on a series of the SARS-CoV-2 proteins. These tautomers exhibited the best affinity behavior (−9.90, −7.90, and −9.30 kcal/mol, respectively) towards RdRp-RTR and Nonstructural protein 3 (nsp3_range 207–379-MES).

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Rettinger, Robert. „Computational Complexity in Analysis“. Electronic Proceedings in Theoretical Computer Science 24 (03.06.2010): 3. http://dx.doi.org/10.4204/eptcs.24.3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Karlin, S., und L. R. Cardon. „Computational DNA Sequence Analysis“. Annual Review of Microbiology 48, Nr. 1 (Oktober 1994): 619–54. http://dx.doi.org/10.1146/annurev.mi.48.100194.003155.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

EDDY, S. R. „Computational Analysis of RNAs“. Cold Spring Harbor Symposia on Quantitative Biology 71 (01.01.2006): 117–28. http://dx.doi.org/10.1101/sqb.2006.71.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Egnor, S. E. Roian, und Kristin Branson. „Computational Analysis of Behavior“. Annual Review of Neuroscience 39, Nr. 1 (08.07.2016): 217–36. http://dx.doi.org/10.1146/annurev-neuro-070815-013845.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Baek, W. K., R. I. Stephens und B. Dopker. „Integrated Computational Durability Analysis“. Journal of Engineering for Industry 115, Nr. 4 (01.11.1993): 492–99. http://dx.doi.org/10.1115/1.2901795.

Der volle Inhalt der Quelle

Annotation:

A computer aided analysis method is described for durability assessment in the early design stages using multibody dynamic analysis, finite element stress analysis, and fatigue life prediction methods. From multibody dynamic analysis of a mechanical system, dynamic loads of a mechanical component were calculated. Finite element stress analysis with substructuring techniques produced accurate stress fields for the component. From the dynamic loads and the stress field of the component, a dynamic stress history at the critical location was produced using the superposition principle. Using Neuber’s rule, a local strain time history was produced from the dynamic stress history. The local strain based fatigue life prediction method was then used to predict “crack initiation” life of the critical component. The predicted fatigue crack initiation life was verified by experimental durability tests. This methodology can be combined with identification of weak links and optimization techniques such that the design optimization for an entire mechanical system based upon durability is possible during the early product development stage.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Dobner, H.-J. „Contributions to computational analysis“. Bulletin of the Australian Mathematical Society 41, Nr. 2 (April 1990): 231–35. http://dx.doi.org/10.1017/s0004972700018049.

Der volle Inhalt der Quelle

Annotation:

In this paper some new results concerning computational analysis are established. The fundamental concepts of interval analysis and fixed point theorems suitable for computational purposes are developed and applied to concrete examples illustrating this new method of proving mathematical statements.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Vahabzadeh, Yousef, Nima Chamanara, Karim Achouri und Christophe Caloz. „Computational Analysis of Metasurfaces“. IEEE Journal on Multiscale and Multiphysics Computational Techniques 3 (2018): 37–49. http://dx.doi.org/10.1109/jmmct.2018.2829871.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Brown, Guy J., und Martin Cooke. „Computational auditory scene analysis“. Computer Speech & Language 8, Nr. 4 (Oktober 1994): 297–336. http://dx.doi.org/10.1006/csla.1994.1016.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Anagnostopoulou, Christina, und Chantal Buteau. „Can computational music analysis be both musical and computational?“ Journal of Mathematics and Music 4, Nr. 2 (Juli 2010): 75–83. http://dx.doi.org/10.1080/17459737.2010.520455.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Vo, A. V., und D. F. Laefer. „A BIG DATA APPROACH FOR COMPREHENSIVE URBAN SHADOW ANALYSIS FROM AIRBORNE LASER SCANNING POINT CLOUDS“. ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences IV-4/W8 (23.09.2019): 131–37. http://dx.doi.org/10.5194/isprs-annals-iv-4-w8-131-2019.

Der volle Inhalt der Quelle

Annotation:

<p><strong>Abstract.</strong> Because of the importance of access to sunlight, shadow analysis is a common consideration in urban design, especially for dense urban developments. As shadow computation is computationally expensive, most urban shadow analysis tools have to date circumvented the high computational costs by representing urban complexity only through simplified geometric models. The simplification process removes details and adversely affects the level of realism of the ultimate results. In this paper, an alternative approach is presented by utilizing the highest level of detail and resolution captured in the geometric input data source, which is an extremely high-resolution airborne laser scanning point cloud (300 points/m2). To cope with the high computational demand caused by the use of this dense and detailed input data set, the Comprehensive Urban Shadow algorithm is introduced to distribute the computation for parallel processing on a Hadoop cluster. The proposed comprehensive urban shadow analysis solution is scalable, reasonably fast, and capable of preserving the original resolution and geometric detail of the original point cloud data.</p>

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Pardhanani, Anand, und Graham F. Carey. „Optimization of computational grids“. Numerical Methods for Partial Differential Equations 4, Nr. 2 (1988): 95–117. http://dx.doi.org/10.1002/num.1690040202.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Babuška, I., F. Nobile und R. Tempone. „Reliability of computational science“. Numerical Methods for Partial Differential Equations 23, Nr. 4 (2007): 753–84. http://dx.doi.org/10.1002/num.20263.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Sabadini, Irene, und Daniele C. Struppa. „Computational algebraic analysis methods in Clifford analysis“. Mathematical Methods in the Applied Sciences 25, Nr. 16-18 (2002): 1415–27. http://dx.doi.org/10.1002/mma.379.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Ichimura, Tsuyoshi, Ryoichiro Agata, Takane Hori, Kenji Satake, Kazuto Ando, Toshitaka Baba und Mueno Hori. „Tsunami Analysis Method with High-Fidelity Crustal Structure and Geometry Model“. Journal of Earthquake and Tsunami 11, Nr. 05 (Dezember 2017): 1750018. http://dx.doi.org/10.1142/s179343111750018x.

Der volle Inhalt der Quelle

Annotation:

Higher fidelity seafloor topography and crustal structure models have become available with accumulation of observation data. Previous studies have shown that the consideration of such high-fidelity models produces significant effects, in some cases, on crustal deformation results that are used as inputs for tsunami analysis. However, it is difficult to apply high-fidelity model of crustal deformation computations to tsunami computations because of large computational costs. In this paper, we propose a new crustal deformation computation method for estimating inputs for tsunami computations, which is based on a finite element analysis method with remarkable reduction of computation costs by efficient use of the arithmetic space and the solution space. This finite element analysis method enables us to conduct [Formula: see text]-times crustal deformation computations using high-fidelity models with a degree of freedom on the order of [Formula: see text] for the 2011 Tohoku earthquake example. Tsunami computations with typical settings are conducted as an application example to present the advantages and characteristics of the proposed method. Comparisons between results of the proposed and the conventional method reveal that large shallow fault slip around the trench axis may lead to significant differences in tsunami waveforms and inundation height distributions in some cases.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Otoguro, Yuto, Hiroki Mochizuki, Kenji Takizawa und Tayfun E. Tezduyar. „Space–Time Variational Multiscale Isogeometric Analysis of a tsunami-shelter vertical-axis wind turbine“. Computational Mechanics 66, Nr. 6 (31.08.2020): 1443–60. http://dx.doi.org/10.1007/s00466-020-01910-5.

Der volle Inhalt der Quelle

Annotation:

AbstractWe present computational flow analysis of a vertical-axis wind turbine (VAWT) that has been proposed to also serve as a tsunami shelter. In addition to the three-blade rotor, the turbine has four support columns at the periphery. The columns support the turbine rotor and the shelter. Computational challenges encountered in flow analysis of wind turbines in general include accurate representation of the turbine geometry, multiscale unsteady flow, and moving-boundary flow associated with the rotor motion. The tsunami-shelter VAWT, because of its rather high geometric complexity, poses the additional challenge of reaching high accuracy in turbine-geometry representation and flow solution when the geometry is so complex. We address the challenges with a space–time (ST) computational method that integrates three special ST methods around the core, ST Variational Multiscale (ST-VMS) method, and mesh generation and improvement methods. The three special methods are the ST Slip Interface (ST-SI) method, ST Isogeometric Analysis (ST-IGA), and the ST/NURBS Mesh Update Method (STNMUM). The ST-discretization feature of the integrated method provides higher-order accuracy compared to standard discretization methods. The VMS feature addresses the computational challenges associated with the multiscale nature of the unsteady flow. The moving-mesh feature of the ST framework enables high-resolution computation near the blades. The ST-SI enables moving-mesh computation of the spinning rotor. The mesh covering the rotor spins with it, and the SI between the spinning mesh and the rest of the mesh accurately connects the two sides of the solution. The ST-IGA enables more accurate representation of the blade and other turbine geometries and increased accuracy in the flow solution. The STNMUM enables exact representation of the mesh rotation. A general-purpose NURBS mesh generation method makes it easier to deal with the complex turbine geometry. The quality of the mesh generated with this method is improved with a mesh relaxation method based on fiber-reinforced hyperelasticity and optimized zero-stress state. We present computations for the 2D and 3D cases. The computations show the effectiveness of our ST and mesh generation and relaxation methods in flow analysis of the tsunami-shelter VAWT.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Cui, Zhe, Jayaram Kancherla, Kyle W. Chang, Niklas Elmqvist und Héctor Corrada Bravo. „Proactive visual and statistical analysis of genomic data in Epiviz“. Bioinformatics 36, Nr. 7 (29.11.2019): 2195–201. http://dx.doi.org/10.1093/bioinformatics/btz883.

Der volle Inhalt der Quelle

Annotation:

Abstract Motivation Integrative analysis of genomic data that includes statistical methods in combination with visual exploration has gained widespread adoption. Many existing methods involve a combination of tools and resources: user interfaces that provide visualization of large genomic datasets, and computational environments that focus on data analyses over various subsets of a given dataset. Over the last few years, we have developed Epiviz as an integrative and interactive genomic data analysis tool that incorporates visualization tightly with state-of-the-art statistical analysis framework. Results In this article, we present Epiviz Feed, a proactive and automatic visual analytics system integrated with Epiviz that alleviates the burden of manually executing data analysis required to test biologically meaningful hypotheses. Results of interest that are proactively identified by server-side computations are listed as notifications in a feed. The feed turns genomic data analysis into a collaborative work between the analyst and the computational environment, which shortens the analysis time and allows the analyst to explore results efficiently. We discuss three ways where the proposed system advances the field of genomic data analysis: (i) takes the first step of proactive data analysis by utilizing available CPU power from the server to automate the analysis process; (ii) summarizes hypothesis test results in a way that analysts can easily understand and investigate; (iii) enables filtering and grouping of analysis results for quick search. This effort provides initial work on systems that substantially expand how computational and visualization frameworks can be tightly integrated to facilitate interactive genomic data analysis. Availability and implementation The source code for Epiviz Feed application is available at http://github.com/epiviz/epiviz_feed_polymer. The Epiviz Computational Server is available at http://github.com/epiviz/epiviz-feed-computation. Please refer to Epiviz documentation site for details: http://epiviz.github.io/.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Gourary, M. M., S. G. Rusakov, S. L. Ulyanov, M. M. Zharov und B. J. Mulvaney. „Circuit Distortion Analysis Based on the Simplified Newton's Method“. Journal of Electrical and Computer Engineering 2011 (2011): 1–11. http://dx.doi.org/10.1155/2011/540305.

Der volle Inhalt der Quelle

Annotation:

A new computational technique for distortion analysis of nonlinear circuits is presented. The new technique is applicable to the same class of circuits, namely, weakly nonlinear and time-varying circuits, as the periodic Volterra series. However, unlike the Volterra series, it does not require the computation of the second and third derivatives of device models. The new method is computationally efficient compared with a complete multitone nonlinear steady-state analysis such as harmonic balance. Moreover, the new technique naturally allows computing and characterizing the contributions of individual circuit components to the overall circuit distortion. This paper presents the theory of the new technique, a discussion of the numerical aspects, and numerical results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Zhang, Guiming, und Jin Xu. „Multi-GPU-Parallel and Tile-Based Kernel Density Estimation for Large-Scale Spatial Point Pattern Analysis“. ISPRS International Journal of Geo-Information 12, Nr. 2 (18.01.2023): 31. http://dx.doi.org/10.3390/ijgi12020031.

Der volle Inhalt der Quelle

Annotation:

Kernel density estimation (KDE) is a commonly used method for spatial point pattern analysis, but it is computationally demanding when analyzing large datasets. GPU-based parallel computing has been adopted to address such computational challenges. The existing GPU-parallel KDE method, however, utilizes only one GPU for parallel computing. Additionally, it assumes that the input data can be held in GPU memory all at once for computation, which is unrealistic when conducting KDE analysis over large geographic areas at high resolution. This study develops a multi-GPU-parallel and tile-based KDE algorithm to overcome these limitations. It exploits multiple GPUs to speedup complex KDE computation by distributing computation across GPUs, and approaches density estimation with a tile-based strategy to bypass the memory bottleneck. Experiment results show that the parallel KDE algorithm running on multiple GPUs achieves significant speedups over running on a single GPU, and higher speedups are achieved on KDE tasks of a larger problem size. The tile-based strategy renders it feasible to estimate high-resolution density surfaces over large areas even on GPUs with only limited memory. Multi-GPU parallel computing and tile-based density estimation, while incurring very little computational overhead, effectively enable conducting KDE for large-scale spatial point pattern analysis on geospatial big data.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Fish, Jacob, und Sergey Kuznetsov. „Computational continua“. International Journal for Numerical Methods in Engineering 84, Nr. 7 (25.10.2010): 774–802. http://dx.doi.org/10.1002/nme.2918.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Bell, John B., Alejandro L. Garcia und Sarah A. Williams. „Computational fluctuating fluid dynamics“. ESAIM: Mathematical Modelling and Numerical Analysis 44, Nr. 5 (26.08.2010): 1085–105. http://dx.doi.org/10.1051/m2an/2010053.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Saito, Yoshifuru. „Wavelet Analysis for Computational Electromagnetics“. IEEJ Transactions on Fundamentals and Materials 116, Nr. 10 (1996): 833–39. http://dx.doi.org/10.1541/ieejfms1990.116.10_833.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Vendrusculo, Laurimar Gonçalves, Paulo Sérgio Graziano Magalhães, Sidney Rosa Vieira und José Ruy Porto de Carvalho. „Computational system for geostatistical analysis“. Scientia Agricola 61, Nr. 1 (Februar 2004): 100–107. http://dx.doi.org/10.1590/s0103-90162004000100017.

Der volle Inhalt der Quelle

Annotation:

Geostatistics identifies the spatial structure of variables representing several phenomena and its use is becoming more intense in agricultural activities. This paper describes a computer program, based on Windows Interfaces (Borland Delphi), which performs spatial analyses of datasets through geostatistic tools: Classical statistical calculations, average, cross- and directional semivariograms, simple kriging estimates and jackknifing calculations. A published dataset of soil Carbon and Nitrogen was used to validate the system. The system was useful for the geostatistical analysis process, for the manipulation of the computational routines in a MS-DOS environment. The Windows development approach allowed the user to model the semivariogram graphically with a major degree of interaction, functionality rarely available in similar programs. Given its characteristic of quick prototypation and simplicity when incorporating correlated routines, the Delphi environment presents the main advantage of permitting the evolution of this system.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Auslander, Louis, und Peter Henrici. „Applied and Computational Complex Analysis.“ American Mathematical Monthly 95, Nr. 4 (April 1988): 366. http://dx.doi.org/10.2307/2323585.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Yagi, Sane M. „Computational Discourse Analysis for Interpretation“. Meta 44, Nr. 2 (02.10.2002): 268–79. http://dx.doi.org/10.7202/004627ar.

Der volle Inhalt der Quelle

Annotation:

Résumé Une m"thode informatis"e qui permet lÕexamen attentif du discours dans la langue source et dans la langue cible, milliseconde par milliseconde, a "t" "labor"e afin de permettre une analyse de lÕinterpr"tation. En utilisant un programme sp"cialement d"velopp" ‹ cet effet, lÕanalyse du discours de lÕinterpr"tation peut maintenant 'tre automatis"e et rendue quantitative. Les discours en langue source et en langue cible peuvent 'tre trac"s graphiquement et parall'lement sur lÕaxe des temps, facilitant ainsi la comparaison entre le discours et son interpr"tation simultan"e; on peut comparer la dur"e de chaque "clat et de chaque pause, le d"but et la compensation, le degr" de simultan"it" entre lÕorateur et lÕinterpr'te et bien dÕautres param'tres importants au th"oricien de lÕinterpr"tariat.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Relun, Nicolas, David Néron und Pierre-Alain Boucard. „Multiscale elastic-viscoplastic computational analysis“. European Journal of Computational Mechanics 20, Nr. 7-8 (Januar 2011): 379–409. http://dx.doi.org/10.3166/ejcm.20.379-409.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Boljanović, Slobodanka, und Andrea Carpinteri. „Computational Failure Analysis under Overloading“. Metals 11, Nr. 10 (23.09.2021): 1509. http://dx.doi.org/10.3390/met11101509.

Der volle Inhalt der Quelle

Annotation:

The aim of this research work is to shed more light on performance-based design through a computational framework that assesses the residual strength of damaged plate-type configurations under overloading. Novel expressions are generated to analyze the power of crack-like stress raisers coupled with retardation effects. Analytical outcomes show that careful consideration of the overload location and crack size can be quite effective in improving safety design and failure mode estimation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

P, Karthikeyan, Madhavan S und Silambarasan SM. „Computational analysis of hydrocarbon combustion“. IARJSET 8, Nr. 5 (30.05.2021): 506–11. http://dx.doi.org/10.17148/iarjset.2021.8588.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Gauthier, Robert P., und James R. Wallace. „The Computational Thematic Analysis Toolkit“. Proceedings of the ACM on Human-Computer Interaction 6, GROUP (14.01.2022): 1–15. http://dx.doi.org/10.1145/3492844.

Der volle Inhalt der Quelle

Annotation:

As online communities have grown, Computational Social Science has rapidly developed new techniques to study them. However, these techniques require researchers to become experts in a wide variety of tools in addition to qualitative and computational research methods. Studying online communities also requires researchers to constantly navigate highly contextual ethical and transparency considerations when engaging with data, such as respecting their members' privacy when discussing sensitive or stigmatized topics. To overcome these challenges, we developed the Computational Thematic Analysis Toolkit, a modular software package that supports analysis of online communities by combining aspects of reflexive thematic analysis with computational techniques. Our toolkit demonstrates how common analysis tasks like data collection, cleaning and filtering, modelling and sampling, and coding can be implemented within a single visual interface, and how that interface can encourage researchers to manage ethical and transparency considerations throughout their research process.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

MINAMIHARA, Megumi, Takuya TERAHARA, Yasutoshi TANIGUCHI, Kenji TAKIZAWA und Tayfun E. TEZDUYAR. „Computational analysis of mitral valve“. Proceedings of The Computational Mechanics Conference 2021.34 (2021): 255. http://dx.doi.org/10.1299/jsmecmd.2021.34.255.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Hines, Pamela J. „Computational analysis of cell walls“. Science 372, Nr. 6543 (13.05.2021): 698.7–699. http://dx.doi.org/10.1126/science.372.6543.698-g.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Cohen, Jonathan D., Nathaniel Daw, Barbara Engelhardt, Uri Hasson, Kai Li, Yael Niv, Kenneth A. Norman et al. „Computational approaches to fMRI analysis“. Nature Neuroscience 20, Nr. 3 (23.02.2017): 304–13. http://dx.doi.org/10.1038/nn.4499.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!