url
stringlengths 16
775
| text
stringlengths 100
1.02M
| date
timestamp[s] | metadata
stringlengths 1.07k
1.1k
|
|---|---|---|---|
https://zbmath.org/authors/?q=ai%3Akarmarkar.narendra-k
|
# zbMATH — the first resource for mathematics
## Karmarkar, Narendra K.
Compute Distance To:
Author ID: karmarkar.narendra-k Published as: Karmarkar, Narendra; Karmarkar, N.; Karmarkar, N. K.; Karmarkar, Narendra K. External Links: MGP · Wikidata · dblp
Documents Indexed: 18 Publications since 1984
all top 5
#### Co-Authors
4 single-authored 5 Kamath, Anil P. 5 Ramakrishnan, K. G. 5 Resende, Mauricio G. C. 2 Adler, Ilan 2 Karp, Richard Manning 2 Lakshman, Y. N. 2 Veiga, Geraldo 1 Lagarias, Jeffrey C. 1 Lipton, Richard J. 1 Lovász, László 1 Luby, Michael G. 1 Lueker, George S. 1 Odlyzko, Andrew M. 1 Slutsman, Lev 1 Wang, Pyng
all top 5
#### Serials
4 Mathematical Programming. Series A. Series B 1 Journal of Applied Probability 1 Kiberneticheskiĭ Sbornik. Novaya Seriya 1 SIAM Journal on Computing 1 Combinatorica 1 Journal of Symbolic Computation 1 AT&T Technical Journal 1 Annals of Operations Research 1 Journal of Global Optimization 1 ORSA Journal on Computing
all top 5
#### Fields
14 Operations research, mathematical programming (90-XX) 5 Numerical analysis (65-XX) 5 Computer science (68-XX) 2 Combinatorics (05-XX) 1 Field theory and polynomials (12-XX) 1 Commutative algebra (13-XX) 1 Functions of a complex variable (30-XX) 1 Differential geometry (53-XX) 1 Probability theory and stochastic processes (60-XX)
#### Citations contained in zbMATH Open
18 Publications have been cited 1,317 times in 1,165 Documents Cited by Year
A new polynomial-time algorithm for linear programming. Zbl 0557.90065
Karmarkar, N.
1984
An implementation of Karmarkar’s algorithm for linear programming. Zbl 0682.90061
Adler, Ilan; Resende, Mauricio G. C.; Veiga, Geraldo; Karmarkar, Narendra
1989
Approximate polynomial greatest common divisors and nearest singular mials. Zbl 0928.13017
Karmarkar, N.; Lakshman, Y. N.
1996
On approximate GCDs of univariate polynomials. Zbl 0967.12007
Karmarkar, N. K.; Lakshman, Y. N.
1998
An interior point algorithm to solve computationally difficult set covering problems. Zbl 0753.90046
Karmarkar, Narendra; Resende, Mauricio G. C.; Ramakrishnan, K. G.
1991
A Monte-Carlo algorithm for estimating the permanent. Zbl 0781.05034
Karmarkar, N.; Karp, R.; Lipton, R.; Lovász, László; Luby, M.
1993
Data structures and programming techniques for the implementation of Karmarkar’s algorithm. Zbl 0752.90043
Adler, Ilan; Karmarkar, Narendra; Resende, Mauricio G. C.; Veiga, Geraldo
1989
Computational experience with an interior point algorithm on the satisfiability problem. Zbl 0716.90083
Kamath, A. P.; Karmarkar, N. K.; Ramakrishnan, K. G.; Resende, M. G. C.
1990
Computational results of an interior point algorithm for large scale linear programming. Zbl 0739.90042
Karmarkar, N. K.; Ramakrishnan, K. G.
1991
Riemannian geometry underlying interior-point methods for linear programming. Zbl 0725.90058
Karmarkar, Narendra
1990
A continuous approach to inductive inference. Zbl 0783.90122
Kamath, Anil P.; Karmarkar, Narendra K.; Ramakrishnan, K. G.; Resende, Mauricio G. C.
1992
Probabilistic analysis of optimum partitioning. Zbl 0611.60011
Karmarkar, Narendra; Karp, Richard M.; Lueker, George S.; Odlyzko, Andrew M.
1986
Power series variants of Karmarkar-type algorithms. Zbl 0682.90060
Karmarkar, Narendra K.; Lagarias, Jeffrey C.; Slutsman, Lev; Wang, Pyng
1989
An approximate dual projective algorithm for solving assignment problems. Zbl 0788.90049
Ramakrishnan, K. G.; Karmarkar, N. K.; Kamath, A. P.
1993
An interior-point approach to NP-complete problems. I. Zbl 0725.90075
Karmarkar, Narendra
1990
A new polynomial-time algorithm for linear programming. Zbl 0684.90062
Karmarkar, N.
1989
A continuous method for computing bounds in integer quadratic optimization problems. Zbl 0762.90058
Kamath, A.; Karmarkar, N.
1992
An $$O(nL)$$ iteration algorithm for computing bounds in quadratic optimization problems. Zbl 0968.90502
Kamath, Anil P.; Karmarkar, Narendra K.
1993
On approximate GCDs of univariate polynomials. Zbl 0967.12007
Karmarkar, N. K.; Lakshman, Y. N.
1998
Approximate polynomial greatest common divisors and nearest singular mials. Zbl 0928.13017
Karmarkar, N.; Lakshman, Y. N.
1996
A Monte-Carlo algorithm for estimating the permanent. Zbl 0781.05034
Karmarkar, N.; Karp, R.; Lipton, R.; Lovász, László; Luby, M.
1993
An approximate dual projective algorithm for solving assignment problems. Zbl 0788.90049
Ramakrishnan, K. G.; Karmarkar, N. K.; Kamath, A. P.
1993
An $$O(nL)$$ iteration algorithm for computing bounds in quadratic optimization problems. Zbl 0968.90502
Kamath, Anil P.; Karmarkar, Narendra K.
1993
A continuous approach to inductive inference. Zbl 0783.90122
Kamath, Anil P.; Karmarkar, Narendra K.; Ramakrishnan, K. G.; Resende, Mauricio G. C.
1992
A continuous method for computing bounds in integer quadratic optimization problems. Zbl 0762.90058
Kamath, A.; Karmarkar, N.
1992
An interior point algorithm to solve computationally difficult set covering problems. Zbl 0753.90046
Karmarkar, Narendra; Resende, Mauricio G. C.; Ramakrishnan, K. G.
1991
Computational results of an interior point algorithm for large scale linear programming. Zbl 0739.90042
Karmarkar, N. K.; Ramakrishnan, K. G.
1991
Computational experience with an interior point algorithm on the satisfiability problem. Zbl 0716.90083
Kamath, A. P.; Karmarkar, N. K.; Ramakrishnan, K. G.; Resende, M. G. C.
1990
Riemannian geometry underlying interior-point methods for linear programming. Zbl 0725.90058
Karmarkar, Narendra
1990
An interior-point approach to NP-complete problems. I. Zbl 0725.90075
Karmarkar, Narendra
1990
An implementation of Karmarkar’s algorithm for linear programming. Zbl 0682.90061
Adler, Ilan; Resende, Mauricio G. C.; Veiga, Geraldo; Karmarkar, Narendra
1989
Data structures and programming techniques for the implementation of Karmarkar’s algorithm. Zbl 0752.90043
Adler, Ilan; Karmarkar, Narendra; Resende, Mauricio G. C.; Veiga, Geraldo
1989
Power series variants of Karmarkar-type algorithms. Zbl 0682.90060
Karmarkar, Narendra K.; Lagarias, Jeffrey C.; Slutsman, Lev; Wang, Pyng
1989
A new polynomial-time algorithm for linear programming. Zbl 0684.90062
Karmarkar, N.
1989
Probabilistic analysis of optimum partitioning. Zbl 0611.60011
Karmarkar, Narendra; Karp, Richard M.; Lueker, George S.; Odlyzko, Andrew M.
1986
A new polynomial-time algorithm for linear programming. Zbl 0557.90065
Karmarkar, N.
1984
all top 5
#### Cited by 1,504 Authors
34 Terlaky, Tamás 29 Ye, Yinyu 18 Roos, Cornelis 17 Kheirfam, Behrouz 17 Todd, Michael J. 16 Vial, Jean-Philippe 15 Fang, Shu-Cherng 15 Peyghami, Mohammad Reza 14 Anstreicher, Kurt M. 13 Mizuno, Shinji 12 Tsuchiya, Takashi 11 Arbel, Ami 11 Kojima, Masakazu 10 Monteiro, Renato D. C. 9 Adler, Ilan 9 Darvay, Zsolt 9 Gondzio, Jacek 9 Kalantari, Bahman 9 Oliveira, Aurelio Ribeiro Leite 9 Zhang, Shuzhong 8 Liu, Hongwei 8 Resende, Mauricio G. C. 8 Tseng, Paul 8 Zangiabadi, Maryam 7 den Hertog, Dick 7 Goffin, Jean-Louis 7 Goldfarb, Donald 7 Jansen, Benjamin 7 Mansouri, Hossein 7 Salahi, Maziar 7 Sen, Syamal Kumar 6 Freund, Robert M. 6 Jarre, Florian 6 Megiddo, Nimrod 6 Mitchell, John E. 6 Ramakrishnan, K. G. 6 Sturm, Jos F. 6 Yang, Ximei 6 Yassine, Adnan 6 Yu, Bo 5 Asadi, Soodabeh 5 Bai, Fengshan 5 Bouafia, Mousaab 5 Gonzaga, Clovis C. 5 Gritzmann, Peter 5 Júdice, Joaquim João 5 Karmarkar, Narendra K. 5 Klee, Victor LaRue 5 Liang, Heng 5 Lin, Zhenghua 5 Mehrotra, Sanjay 5 Mészáros, Csaba 5 Mitrouli, Marilena 5 Potra, Florian-Alexandru 5 Saigal, Romesh 5 Shanno, David F. 5 Triantaphyllou, Evangelos 5 Tsao, H.-S. Jacob 5 van Maaren, Hans 5 Vanderbei, Robert Joseph 5 Wright, Margaret H. 5 Yoshise, Akiko 5 Zhang, Mingwang 4 Amini, Keyvan 4 Benterki, Djamel 4 Boyd, Stephen Poythress 4 Christou, Dimitrios 4 Chubanov, Sergei 4 Feng, Guochen 4 Ghaffari Hadigheh, Alireza 4 Huang, Siming 4 Karcanias, Nicos 4 Koenker, Roger W. 4 Malyshev, Dmitry S. 4 Markovsky, Ivan 4 Muramatsu, Masakazu 4 Nakamura, Yoshimasa 4 Nematollahi, Eissa 4 Pardalos, Panos M. 4 Raghavan, Prabhakar 4 Samaras, Nikolaos 4 Sassano, Antonio 4 Stoer, Josef 4 Su, Menglong 4 Takács, Petra-Renáta 4 Vaidya, Pravin M. 4 Wu, Shiquan 4 Zhang, Yin 4 Zhang, Yinkui 4 Zorkal’tsev, Valeriǐ Ivanovich 3 Agarwal, Ravi P. 3 Amaldi, Edoardo 3 Bai, Yanqin 3 Barnes, Earl R. 3 Birge, John R. 3 Caron, Richard J. 3 Chen, Shengyuan 3 Cho, Gyeong-Mi 3 de Klerk, Etienne 3 Dikin, Ilya I. ...and 1,404 more Authors
all top 5
#### Cited in 231 Serials
154 Mathematical Programming. Series A. Series B 66 European Journal of Operational Research 62 Journal of Optimization Theory and Applications 47 Operations Research Letters 40 Annals of Operations Research 38 Optimization 38 Linear Algebra and its Applications 30 Discrete Applied Mathematics 29 Computers & Operations Research 29 Computational Optimization and Applications 28 Applied Mathematics and Computation 26 Theoretical Computer Science 26 Algorithmica 22 Journal of Computational and Applied Mathematics 22 Optimization Methods & Software 14 Information Processing Letters 12 Journal of Global Optimization 12 Optimization Letters 10 Journal of Symbolic Computation 10 Mathematical and Computer Modelling 10 Numerical Algorithms 9 Artificial Intelligence 9 Applied Numerical Mathematics 8 Computers & Mathematics with Applications 7 Journal of Computer and System Sciences 7 Mathematical Programming 7 Journal of Combinatorial Optimization 7 Discrete Optimization 6 Applied Mathematics and Optimization 6 Numerical Functional Analysis and Optimization 6 Information and Computation 6 ZOR. Zeitschrift für Operations Research 5 Information Sciences 5 Acta Mathematicae Applicatae Sinica. English Series 5 SIAM Journal on Optimization 5 Annals of Mathematics and Artificial Intelligence 5 Mathematical Methods of Operations Research 5 Journal of the Operations Research Society of China 4 International Journal of Mathematical Education in Science and Technology 4 Journal of Mathematical Analysis and Applications 4 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 4 Journal of Complexity 4 Discrete & Computational Geometry 4 Journal of Automated Reasoning 4 Japan Journal of Industrial and Applied Mathematics 4 Games and Economic Behavior 4 Bulletin of the American Mathematical Society. New Series 4 Computational Statistics and Data Analysis 4 Cybernetics and Systems Analysis 4 Top 4 Mathematical Problems in Engineering 4 Wuhan University Journal of Natural Sciences (WUJNS) 4 RAIRO. Operations Research 4 Journal of Systems Science and Complexity 4 Journal of Applied Mathematics and Computing 4 Mathematical Programming Computation 3 Discrete Mathematics 3 Mathematics of Operations Research 3 Networks 3 Journal of Information & Optimization Sciences 3 Combinatorica 3 Acta Applicandae Mathematicae 3 Journal of Shanghai University 3 Journal of Interdisciplinary Mathematics 3 Acta Mathematica Sinica. English Series 3 CEJOR. Central European Journal of Operations Research 3 Optimization and Engineering 2 Bulletin of the Australian Mathematical Society 2 Mathematics of Computation 2 Automatica 2 Computing 2 Fuzzy Sets and Systems 2 Journal of Mathematical Psychology 2 Journal of Pure and Applied Algebra 2 Mathematics and Computers in Simulation 2 Operations Research 2 SIAM Journal on Computing 2 Physica D 2 Asia-Pacific Journal of Operational Research 2 Applied Mathematics Letters 2 Real-Time Systems 2 Random Structures & Algorithms 2 Computational Geometry 2 Computer Science in Economics and Management 2 Designs, Codes and Cryptography 2 Automation and Remote Control 2 International Journal of Computer Mathematics 2 Journal of Statistical Computation and Simulation 2 Proceedings of the Indian Academy of Sciences. Mathematical Sciences 2 Applied Mathematics. Series B (English Edition) 2 Computational and Applied Mathematics 2 Economic Theory 2 Reliable Computing 2 Constraints 2 Journal of Inequalities and Applications 2 International Journal of Applied Mathematics and Computer Science 2 Fundamenta Informaticae 2 The ANZIAM Journal 2 Foundations of Computational Mathematics 2 Journal of Applied Mathematics ...and 131 more Serials
all top 5
#### Cited in 44 Fields
915 Operations research, mathematical programming (90-XX) 262 Numerical analysis (65-XX) 230 Computer science (68-XX) 46 Calculus of variations and optimal control; optimization (49-XX) 45 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 43 Combinatorics (05-XX) 39 Linear and multilinear algebra; matrix theory (15-XX) 27 Convex and discrete geometry (52-XX) 26 Statistics (62-XX) 20 Field theory and polynomials (12-XX) 19 Systems theory; control (93-XX) 16 Mathematical logic and foundations (03-XX) 16 Number theory (11-XX) 15 Information and communication theory, circuits (94-XX) 12 Biology and other natural sciences (92-XX) 11 Commutative algebra (13-XX) 10 Algebraic geometry (14-XX) 10 Probability theory and stochastic processes (60-XX) 10 Mechanics of deformable solids (74-XX) 8 Real functions (26-XX) 7 Dynamical systems and ergodic theory (37-XX) 6 History and biography (01-XX) 5 Approximations and expansions (41-XX) 4 Ordinary differential equations (34-XX) 4 Functional analysis (46-XX) 4 Operator theory (47-XX) 3 Functions of a complex variable (30-XX) 3 Manifolds and cell complexes (57-XX) 3 Quantum theory (81-XX) 3 Statistical mechanics, structure of matter (82-XX) 2 Order, lattices, ordered algebraic structures (06-XX) 2 Group theory and generalizations (20-XX) 2 Partial differential equations (35-XX) 2 Differential geometry (53-XX) 1 General and overarching topics; collections (00-XX) 1 Nonassociative rings and algebras (17-XX) 1 Category theory; homological algebra (18-XX) 1 Special functions (33-XX) 1 Difference and functional equations (39-XX) 1 Integral equations (45-XX) 1 Geometry (51-XX) 1 General topology (54-XX) 1 Global analysis, analysis on manifolds (58-XX) 1 Geophysics (86-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-09-28T05:01:29 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3925969898700714, "perplexity": 11460.415313495052}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780060201.9/warc/CC-MAIN-20210928032425-20210928062425-00525.warc.gz"}
|
https://par.nsf.gov/biblio/10341769-white-box-adversarial-data-stream-model
|
This content will become publicly available on January 1, 2023
The White-Box Adversarial Data Stream Model
Authors:
; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10341769
Journal Name:
Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2022)
Page Range or eLocation-ID:
15-27
5. We revisit the much-studied problem of space-efficiently estimating the number of triangles in a graph stream, and extensions of this problem to counting fixed-sized cliques and cycles, obtaining a number of new upper and lower bounds. For the important special case of counting triangles, we give a $4$-pass, $(1\pm\varepsilon)$-approximate, randomized algorithm that needs at most $\widetilde{O}(\varepsilon^{-2}\cdot m^{3/2}/T)$ space, where $m$ is the number of edges and $T$ is a promised lower bound on the number of triangles. This matches the space bound of a very recent algorithm (McGregor et al., PODS 2016), with an arguably simpler and more general technique. We give an improved multi-pass lower bound of $\Omega(\min\{m^{3/2}/T, m/\sqrt{T}\})$, applicable at essentially all densities $\Omega(n) \le m \le O(n^2)$. We also prove other multi-pass lower bounds in terms of various structural parameters of the input graph. Together, our results resolve a couple of open questions raised in recent work (Braverman et al., ICALP 2013). Our presentation emphasizes more general frameworks, for both upper and lower bounds. We give a sampling algorithm for counting arbitrary subgraphs and then improve it via combinatorial means in the special cases of counting odd cliques and odd cycles. Our results show that these problemsmore »
| 2022-12-01T13:51:15 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.731240451335907, "perplexity": 890.4166495577575}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710813.48/warc/CC-MAIN-20221201121601-20221201151601-00021.warc.gz"}
|
https://gea.esac.esa.int/archive/documentation/GDR2/Gaia_archive/chap_datamodel/sec_dm_external_catalogues/ssec_dm_sdssdr9_original_valid.html
|
# 14.4.6 sdssdr9_original_valid
SDSS DR9 Catalogue, primary object only, extracted from photoObj fits files.
Reference paper: Ahn et al. (2012)
Original catalogue: http://data.sdss3.org/sas/dr9/boss/photoObj/
Columns description:
sdssdr9_oid : Unique Numeric Identifier (long)
Incremental unique numeric identifier (increasing with declination). This is the only field which was not in the original SDSS DR9 catalogue, but was added for cross-match purposes.
obj_id : Unique SDSS identifier (string)
A number identifying an object in the image catalog for DR9. It is a bit-encoded integer of run, rerun, camcol, field, object.
The bits are assigned in objid as follows:
• 63 0, unassigned
• 59$-$62 skyVersion resolved sky version
• 48$-$58 rerun, number of pipeline rerun
• 32$-$47 run, run number
• 29$-$31 camcol, camera column (1-6)
• 28 0, unassigned
• 16$-$27 field, field number within run
• 0$-$15 id, object number within field
thing_id : Unique identifier from global resolve (long)
Each unique source in the SDSS catalog is identified by the thing_id. Each source may have been observed more than once in multiple runs, and might therefore have multiple detections listed in the catalog. Only one detection is considered primary.
ra : RA (double, Angle[deg])
J2000 Right Ascension (from r-band, or best other band if r-band if too faint or saturated in r).
dec : DEC (double, Angle[deg])
J2000 Declination (from r-band, or best other band if r-band if too faint or saturated in r).
ra_error : Reference error in RAcosDEC (double, Angle[arcsec])
Error in RA*cos(DEC)
dec_error : Reference error in DEC (double, Angle[arcsec])
Error in DEC.
mjd : Date of observation (double, Time[day])
Modified Julian Date, used to indicate the date that a given piece of SDSS data (image or spectrum) was taken.
u_mag : PSF magnitude in the u band (double, Magnitude[mag])
For isolated stars, which are well-described by the point spread function (PSF), the optimal measure of the total flux is determined by fitting a PSF model to the object.
u_mag_error : error on PSF magnitude in the u band (double, Magnitude[mag])
PSF magnitude error.
g_mag : PSF magnitude in the g band (double, Magnitude[mag])
For isolated stars, which are well-described by the point spread function (PSF), the optimal measure of the total flux is determined by fitting a PSF model to the object.
g_mag_error : error on PSF magnitude in the g band (double, Magnitude[mag])
PSF magnitude error.
r_mag : PSF magnitude in the r band (double, Magnitude[mag])
For isolated stars, which are well-described by the point spread function (PSF), the optimal measure of the total flux is determined by fitting a PSF model to the object.
r_mag_error : error on PSF magnitude in the r band (double, Magnitude[mag])
PSF magnitude error.
i_mag : PSF magnitude in the i band (double, Magnitude[mag])
For isolated stars, which are well-described by the point spread function (PSF), the optimal measure of the total flux is determined by fitting a PSF model to the object.
i_mag_error : error on PSF magnitude in the i band (double, Magnitude[mag])
PSF magnitude error.
z_mag : PSF magnitude in the z band (double, Magnitude[mag])
For isolated stars, which are well-described by the point spread function (PSF), the optimal measure of the total flux is determined by fitting a PSF model to the object.
z_mag_error : error on PSF magnitude in the z band (double, Magnitude[mag])
PSF magnitude error.
objc_type : type classification of the object (int)
Distinguishes stars (type=6) and galaxies (type=3) based on their morphology. It is quantified on the basis of the difference between the PSF and model magnitudes.
clean_flag : clean photometry flag for point sources (int)
Clean photometry flag for point sources (1=clean, 0=unclean).
| 2021-12-08T03:32:16 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 6, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.33458414673805237, "perplexity": 10839.706005197682}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964363437.15/warc/CC-MAIN-20211208022710-20211208052710-00331.warc.gz"}
|
https://dlmf.nist.gov/14.5#E19
|
# §14.5 Special Values
## §14.5(i) $x=0$
14.5.1 $\mathsf{P}^{\mu}_{\nu}\left(0\right)=\frac{2^{\mu}\pi^{1/2}}{\Gamma\left(\frac% {1}{2}\nu-\frac{1}{2}\mu+1\right)\Gamma\left(\frac{1}{2}-\frac{1}{2}\nu-\frac{% 1}{2}\mu\right)},$ ⓘ Symbols: $\Gamma\left(\NVar{z}\right)$: gamma function, $\mathsf{P}^{\NVar{\mu}}_{\NVar{\nu}}\left(\NVar{x}\right)$: Ferrers function of the first kind, $\pi$: the ratio of the circumference of a circle to its diameter, $\mu$: general order and $\nu$: general degree A&S Ref: 8.6.1 (modified) Referenced by: §10.59, §14.30(ii) Permalink: http://dlmf.nist.gov/14.5.E1 Encodings: TeX, pMML, png See also: Annotations for §14.5(i), §14.5 and Ch.14
14.5.2 $\left.\frac{\mathrm{d}\mathsf{P}^{\mu}_{\nu}\left(x\right)}{\mathrm{d}x}\right% |_{x=0}=-\frac{2^{\mu+1}\pi^{1/2}}{\Gamma\left(\frac{1}{2}\nu-\frac{1}{2}\mu+% \frac{1}{2}\right)\Gamma\left(-\frac{1}{2}\nu-\frac{1}{2}\mu\right)},$
14.5.3 $\mathsf{Q}^{\mu}_{\nu}\left(0\right)=-\frac{2^{\mu-1}\pi^{1/2}\sin\left(\frac{% 1}{2}(\nu+\mu)\pi\right)\Gamma\left(\frac{1}{2}\nu+\frac{1}{2}\mu+\frac{1}{2}% \right)}{\Gamma\left(\frac{1}{2}\nu-\frac{1}{2}\mu+1\right)},$ $\nu+\mu\neq-1,-2,-3,\dots$, ⓘ Symbols: $\Gamma\left(\NVar{z}\right)$: gamma function, $\mathsf{Q}^{\NVar{\mu}}_{\NVar{\nu}}\left(\NVar{x}\right)$: Ferrers function of the second kind, $\pi$: the ratio of the circumference of a circle to its diameter, $\sin\NVar{z}$: sine function, $\mu$: general order and $\nu$: general degree A&S Ref: 8.6.2 Referenced by: Erratum (V1.1.3) for Equations (14.5.3), (14.5.4), Erratum (V1.1.3) for Equations (14.5.3), (14.5.4) Permalink: http://dlmf.nist.gov/14.5.E3 Encodings: TeX, pMML, png Correction (effective with 1.1.3): The constraint has been corrected to exclude all negative integers. See also: Annotations for §14.5(i), §14.5 and Ch.14
14.5.4 $\left.\frac{\mathrm{d}\mathsf{Q}^{\mu}_{\nu}\left(x\right)}{\mathrm{d}x}\right% |_{x=0}=\frac{2^{\mu}\pi^{1/2}\cos\left(\frac{1}{2}(\nu+\mu)\pi\right)\Gamma% \left(\frac{1}{2}\nu+\frac{1}{2}\mu+1\right)}{\Gamma\left(\frac{1}{2}\nu-\frac% {1}{2}\mu+\frac{1}{2}\right)},$ $\nu+\mu\neq-1,-2,-3,\dots$. ⓘ Symbols: $\Gamma\left(\NVar{z}\right)$: gamma function, $\mathsf{Q}^{\NVar{\mu}}_{\NVar{\nu}}\left(\NVar{x}\right)$: Ferrers function of the second kind, $\pi$: the ratio of the circumference of a circle to its diameter, $\cos\NVar{z}$: cosine function, $\frac{\mathrm{d}\NVar{f}}{\mathrm{d}\NVar{x}}$: derivative, $x$: real variable, $\mu$: general order and $\nu$: general degree A&S Ref: 8.6.4 Referenced by: Erratum (V1.1.3) for Equations (14.5.3), (14.5.4), Erratum (V1.1.3) for Equations (14.5.3), (14.5.4) Permalink: http://dlmf.nist.gov/14.5.E4 Encodings: TeX, pMML, png Correction (effective with 1.1.3): The constraint has been corrected to exclude all negative integers. See also: Annotations for §14.5(i), §14.5 and Ch.14
## §14.5(ii) $\mu=0$, $\nu=0,1$
14.5.5 $\mathsf{P}_{0}\left(x\right)=P_{0}\left(x\right)=1,$ ⓘ
14.5.6 $\mathsf{P}_{1}\left(x\right)=P_{1}\left(x\right)=x.$ ⓘ
14.5.7 $\displaystyle\mathsf{Q}_{0}\left(x\right)$ $\displaystyle=\frac{1}{2}\ln\left(\frac{1+x}{1-x}\right),$ ⓘ Symbols: $\ln\NVar{z}$: principal branch of logarithm function, $\mathsf{Q}_{\NVar{\nu}}\left(\NVar{x}\right)=\mathsf{Q}^{0}_{\nu}\left(x\right)$: Ferrers function of the second kind and $x$: real variable A&S Ref: 8.4.2 Permalink: http://dlmf.nist.gov/14.5.E7 Encodings: TeX, pMML, png See also: Annotations for §14.5(ii), §14.5 and Ch.14 14.5.8 $\displaystyle\mathsf{Q}_{1}\left(x\right)$ $\displaystyle=\frac{x}{2}\ln\left(\frac{1+x}{1-x}\right)-1.$ ⓘ Symbols: $\ln\NVar{z}$: principal branch of logarithm function, $\mathsf{Q}_{\NVar{\nu}}\left(\NVar{x}\right)=\mathsf{Q}^{0}_{\nu}\left(x\right)$: Ferrers function of the second kind and $x$: real variable A&S Ref: 8.4.4 Permalink: http://dlmf.nist.gov/14.5.E8 Encodings: TeX, pMML, png See also: Annotations for §14.5(ii), §14.5 and Ch.14
14.5.9 $\displaystyle\boldsymbol{Q}_{0}\left(x\right)$ $\displaystyle=\frac{1}{2}\ln\left(\frac{x+1}{x-1}\right),$ ⓘ Symbols: $\ln\NVar{z}$: principal branch of logarithm function, $\boldsymbol{Q}_{\NVar{\nu}}\left(\NVar{z}\right)=\boldsymbol{Q}^{0}_{\nu}\left% (z\right)$: Olver’s associated Legendre function and $x$: real variable A&S Ref: 8.4.2 (modified) Permalink: http://dlmf.nist.gov/14.5.E9 Encodings: TeX, pMML, png See also: Annotations for §14.5(ii), §14.5 and Ch.14 14.5.10 $\displaystyle\boldsymbol{Q}_{1}\left(x\right)$ $\displaystyle=\frac{x}{2}\ln\left(\frac{x+1}{x-1}\right)-1.$ ⓘ Symbols: $\ln\NVar{z}$: principal branch of logarithm function, $\boldsymbol{Q}_{\NVar{\nu}}\left(\NVar{z}\right)=\boldsymbol{Q}^{0}_{\nu}\left% (z\right)$: Olver’s associated Legendre function and $x$: real variable A&S Ref: 8.4.4 (modified) Permalink: http://dlmf.nist.gov/14.5.E10 Encodings: TeX, pMML, png See also: Annotations for §14.5(ii), §14.5 and Ch.14
For the corresponding formulas when $\nu=2$ see §14.5(vi).
## §14.5(iii) $\mu=\pm\frac{1}{2}$
In this subsection and the next two, $0<\theta<\pi$ and $\xi>0$.
14.5.11 $\displaystyle\mathsf{P}^{1/2}_{\nu}\left(\cos\theta\right)$ $\displaystyle=\left(\frac{2}{\pi\sin\theta}\right)^{1/2}\cos\left(\left(\nu+% \tfrac{1}{2}\right)\theta\right),$ 14.5.12 $\displaystyle\mathsf{P}^{-1/2}_{\nu}\left(\cos\theta\right)$ $\displaystyle=\left(\frac{2}{\pi\sin\theta}\right)^{1/2}\frac{\sin\left(\left(% \nu+\frac{1}{2}\right)\theta\right)}{\nu+\frac{1}{2}},$ 14.5.13 $\displaystyle\mathsf{Q}^{1/2}_{\nu}\left(\cos\theta\right)$ $\displaystyle=-\left(\frac{\pi}{2\sin\theta}\right)^{1/2}\sin\left(\left(\nu+% \tfrac{1}{2}\right)\theta\right),$
14.5.14 $\mathsf{Q}^{-1/2}_{\nu}\left(\cos\theta\right)=\left(\frac{\pi}{2\sin\theta}% \right)^{1/2}\frac{\cos\left(\left(\nu+\frac{1}{2}\right)\theta\right)}{\nu+% \frac{1}{2}}.$ ⓘ Symbols: $\mathsf{Q}^{\NVar{\mu}}_{\NVar{\nu}}\left(\NVar{x}\right)$: Ferrers function of the second kind, $\pi$: the ratio of the circumference of a circle to its diameter, $\cos\NVar{z}$: cosine function, $\sin\NVar{z}$: sine function, $\nu$: general degree and $0<\theta<\pi$: variable A&S Ref: 8.6.15 (corrected) Referenced by: Erratum (V1.0.16) for Equation (14.5.14) Permalink: http://dlmf.nist.gov/14.5.E14 Encodings: TeX, pMML, png Errata (effective with 1.0.16): Originally this equation was incorrect because of a minus sign in front of the right-hand side. Reported 2017-04-10 by André Greiner-Petter See also: Annotations for §14.5(iii), §14.5 and Ch.14
14.5.15 $\displaystyle P^{1/2}_{\nu}\left(\cosh\xi\right)$ $\displaystyle=\left(\frac{2}{\pi\sinh\xi}\right)^{1/2}\cosh\left(\left(\nu+% \tfrac{1}{2}\right)\xi\right),$ 14.5.16 $\displaystyle P^{-1/2}_{\nu}\left(\cosh\xi\right)$ $\displaystyle=\left(\frac{2}{\pi\sinh\xi}\right)^{1/2}\frac{\sinh\left(\left(% \nu+\frac{1}{2}\right)\xi\right)}{\nu+\frac{1}{2}},$ 14.5.17 $\displaystyle\boldsymbol{Q}^{\pm 1/2}_{\nu}\left(\cosh\xi\right)$ $\displaystyle=\left(\frac{\pi}{2\sinh\xi}\right)^{1/2}\frac{\exp\left(-\left(% \nu+\frac{1}{2}\right)\xi\right)}{\Gamma\left(\nu+\frac{3}{2}\right)}.$
## §14.5(iv) $\mu=-\nu$
14.5.18 $\displaystyle\mathsf{P}^{-\nu}_{\nu}\left(\cos\theta\right)$ $\displaystyle=\frac{(\sin\theta)^{\nu}}{2^{\nu}\Gamma\left(\nu+1\right)},$ 14.5.19 $\displaystyle P^{-\nu}_{\nu}\left(\cosh\xi\right)$ $\displaystyle=\frac{(\sinh\xi)^{\nu}}{2^{\nu}\Gamma\left(\nu+1\right)}.$
## §14.5(v) $\mu=0$, $\nu=\pm\frac{1}{2}$
In this subsection $K\left(k\right)$ and $E\left(k\right)$ denote the complete elliptic integrals of the first and second kinds; see §19.2(ii).
14.5.20 $\mathsf{P}_{\frac{1}{2}}\left(\cos\theta\right)=\frac{2}{\pi}\left(2E\left(% \sin\left(\tfrac{1}{2}\theta\right)\right)-K\left(\sin\left(\tfrac{1}{2}\theta% \right)\right)\right),$
14.5.21 $\displaystyle\mathsf{P}_{-\frac{1}{2}}\left(\cos\theta\right)$ $\displaystyle=\frac{2}{\pi}K\left(\sin\left(\tfrac{1}{2}\theta\right)\right),$ 14.5.22 $\displaystyle\mathsf{Q}_{\frac{1}{2}}\left(\cos\theta\right)$ $\displaystyle=K\left(\cos\left(\tfrac{1}{2}\theta\right)\right)-2E\left(\cos% \left(\tfrac{1}{2}\theta\right)\right),$ 14.5.23 $\displaystyle\mathsf{Q}_{-\frac{1}{2}}\left(\cos\theta\right)$ $\displaystyle=K\left(\cos\left(\tfrac{1}{2}\theta\right)\right).$ ⓘ Symbols: $K\left(\NVar{k}\right)$: Legendre’s complete elliptic integral of the first kind, $\cos\NVar{z}$: cosine function, $\mathsf{Q}_{\NVar{\nu}}\left(\NVar{x}\right)=\mathsf{Q}^{0}_{\nu}\left(x\right)$: Ferrers function of the second kind and $0<\theta<\pi$: variable A&S Ref: 8.13.10 (in slightly different form) Permalink: http://dlmf.nist.gov/14.5.E23 Encodings: TeX, pMML, png See also: Annotations for §14.5(v), §14.5 and Ch.14
14.5.24 $\displaystyle P_{\frac{1}{2}}\left(\cosh\xi\right)$ $\displaystyle=\frac{2}{\pi}e^{\xi/2}E\left(\left(1-e^{-2\xi}\right)^{1/2}% \right),$ 14.5.25 $\displaystyle P_{-\frac{1}{2}}\left(\cosh\xi\right)$ $\displaystyle=\frac{2}{\pi\cosh\left(\frac{1}{2}\xi\right)}K\left(\tanh\left(% \tfrac{1}{2}\xi\right)\right),$
14.5.26 $\boldsymbol{Q}_{\frac{1}{2}}\left(\cosh\xi\right)=2\pi^{-1/2}\cosh\xi% \operatorname{sech}\left(\tfrac{1}{2}\xi\right)K\left(\operatorname{sech}\left% (\tfrac{1}{2}\xi\right)\right)-4\pi^{-1/2}\cosh\left(\tfrac{1}{2}\xi\right)E% \left(\operatorname{sech}\left(\tfrac{1}{2}\xi\right)\right),$
14.5.27 $\boldsymbol{Q}_{-\frac{1}{2}}\left(\cosh\xi\right)=2\pi^{-1/2}e^{-\xi/2}K\left% (e^{-\xi}\right).$
## §14.5(vi) Addendum to §14.5(ii): $\mu=0$, $\nu=2$
14.5.28 $\displaystyle\mathsf{P}_{2}\left(x\right)$ $\displaystyle=P_{2}\left(x\right)=\frac{3x^{2}-1}{2},$ ⓘ Symbols: $\mathsf{P}_{\NVar{\nu}}\left(\NVar{x}\right)=\mathsf{P}^{0}_{\nu}\left(x\right)$: Ferrers function of the first kind, $P_{\NVar{\nu}}\left(\NVar{z}\right)=P^{0}_{\nu}\left(z\right)$: Legendre function of the first kind and $x$: real variable Referenced by: (14.5.28) Permalink: http://dlmf.nist.gov/14.5.E28 Encodings: TeX, pMML, png Addition (effective with 1.0.7): (14.5.28) has been added to this section. See also: Annotations for §14.5(vi), §14.5 and Ch.14 14.5.29 $\displaystyle\mathsf{Q}_{2}\left(x\right)$ $\displaystyle=\frac{3x^{2}-1}{4}\ln\left(\frac{1+x}{1-x}\right)-\frac{3}{2}x,$ ⓘ Symbols: $\ln\NVar{z}$: principal branch of logarithm function, $\mathsf{Q}_{\NVar{\nu}}\left(\NVar{x}\right)=\mathsf{Q}^{0}_{\nu}\left(x\right)$: Ferrers function of the second kind and $x$: real variable Referenced by: (14.5.29) Permalink: http://dlmf.nist.gov/14.5.E29 Encodings: TeX, pMML, png Addition (effective with 1.0.7): (14.5.29) has been added to this section. See also: Annotations for §14.5(vi), §14.5 and Ch.14 14.5.30 $\displaystyle\boldsymbol{Q}_{2}\left(x\right)$ $\displaystyle=\frac{3x^{2}-1}{8}\ln\left(\frac{x+1}{x-1}\right)-\frac{3}{4}x.$ ⓘ Symbols: $\ln\NVar{z}$: principal branch of logarithm function, $\boldsymbol{Q}_{\NVar{\nu}}\left(\NVar{z}\right)=\boldsymbol{Q}^{0}_{\nu}\left% (z\right)$: Olver’s associated Legendre function and $x$: real variable Referenced by: (14.5.30) Permalink: http://dlmf.nist.gov/14.5.E30 Encodings: TeX, pMML, png Addition (effective with 1.0.7): (14.5.30) has been added to this section. See also: Annotations for §14.5(vi), §14.5 and Ch.14
| 2021-10-19T18:50:32 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 233, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9585890769958496, "perplexity": 12615.218544345955}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-43/segments/1634323585280.84/warc/CC-MAIN-20211019171139-20211019201139-00138.warc.gz"}
|
https://indico.fnal.gov/event/17199/contributions/42080/attachments/26053/32353/refresherTutorial.slides.html
|
# Quantum Computing Refresher Tutorial¶
September 13, 2018
I'm a Fermilab Senior Scientist.
I mostly work managing part of the Scientific Computing Division and am a scientist on the Muon g-2 Experiment.
I'm involved in Quantum Computing because it is applicable to my SCD role and I'm interested in how HEP researchers would use such systems (infrastructure, interfaces).
...and it's WAY COOL and new for me. Nothing like giving a tutorial to force yourself to learn something new.
We'll mostly follow the Argonne Workshop Tutorial by Maththew Otten and Scott Aaronson's lecture notes (errors in this talk are mine alone, of course).
Don't worry about the toolkits used here. Concentrate on the content.
Goal: Understand the basics of some quantum gates
This will be really fast - not meant at all to be a comprehensive introduction to QC nor will we go over all of the rules of QC. There are lots of good resources out there. Google (the search engine) can help you find them.
Let's go... Remember Probability...
Say we have coin that is either heads or tails.
A vector of classical probabilities can describe this system:
$\begin{bmatrix} a \\ b \end{bmatrix}^h_t$ where $a, b \geq 0$ and $a+b=1$
We can turn the coin over...
$\begin{bmatrix} 0 & 1 \\ 1 & 0 \\ \end{bmatrix} \begin{bmatrix}a \\ b\end{bmatrix}^h_t = \begin{bmatrix}b \\ a\end{bmatrix}^h_t$
e.g. the transformation matrix is $\begin{bmatrix} P(\text{heads}|a) & P(\text{heads}|b) \\ P(\text{tails}|a) & P(\text{tails}|b)\end{bmatrix}$
so the old probability for heads is now the probability for tails and vice-versa
We can fairly flip the coin...
$\begin{bmatrix} \frac{1}{2} & \frac{1}{2} \\ \frac{1}{2} & \frac{1}{2} \\ \end{bmatrix} \begin{bmatrix}a \\ b\end{bmatrix}^h_t = \begin{bmatrix}\frac{1}{2}(a+b) \\ \frac{1}{2}(a+b)\end{bmatrix}^h_t = \begin{bmatrix}\frac{1}{2} \\ \frac{1}{2}\end{bmatrix}^h_t$
We can do fancier things, like flip the coin, and if we get heads flip again but if we get tails we turn it to heads
$\begin{bmatrix}\frac{1}{2} & 1 \\ \frac{1}{2} & 0 \end{bmatrix} \begin{bmatrix}a \\ b\end{bmatrix}^h_t = \begin{bmatrix}\frac{1}{2}a + b \\ \frac{1}{2} a\end{bmatrix}^h_t$ ... remember $\begin{bmatrix} P(\text{heads}|a) & P(\text{heads}|b) \\ P(\text{tails}|a) & P(\text{tails}|b)\end{bmatrix}$
If flip and get heads, then $a=1, b=0$. Flip again and final outcome is random $\begin{bmatrix}1/2 \\ 1/2\end{bmatrix}^h_t$
If flip and get tails, then $a=0, b=1$. Turn over and always get heads. $\begin{bmatrix}1 \\ 0\end{bmatrix}^h_t$
Sum of column is 1.
Now two coins $\begin{bmatrix} a \\ b \end{bmatrix}^h_t ,\; \begin{bmatrix} c \\ d \end{bmatrix}^h_t$
The combined probability is the tensor product
$\begin{bmatrix} a \\ b \end{bmatrix}^h_t \bigotimes \begin{bmatrix} c \\ d \end{bmatrix}^h_t = \begin{bmatrix} P_{hh} \\ P_{ht} \\ P_{th} \\ P_{tt} \end{bmatrix}^{hh}_{tt} = \begin{bmatrix} ac \\ ad \\ bc \\ bd \end{bmatrix}^{hh}_{tt}$
Note that some products are impossible for independent coins, like $\begin{bmatrix} 1/2 \\ 0 \\ 0 \\ 1/2 \end{bmatrix}^{hh}_{tt}$
Say we turn over the second coin only if the first coin is tails
$\begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \end{bmatrix} \begin{bmatrix} ac \\ ad \\ bc \\ bd \end{bmatrix}^{hh}_{tt} = \begin{bmatrix} ac \\ ad \\ bd \\ bc \end{bmatrix}^{hh}_{tt}\; \;$ (Controlled not, CNOT)
Try starting with first coin random, second coin heads
$\begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \end{bmatrix} \begin{bmatrix} 1/2 \\ 0 \\ 1/2 \\ 0 \end{bmatrix}^{hh}_{tt} = \begin{bmatrix} 1/2 \\ 0 \\ 0 \\ 1/2 \end{bmatrix}^{hh}_{tt}$
You can't get this with independent coins! They now must be correlated.
## Amplitudes and Probabilities¶
A classical configuration is given by a probability for it occurring, $p \in [0, 1]$
A quantum configuration is given by a complex amplitude $\alpha \in \mathbb{C}$, probability of measuring the quantum system in that configuration is $p = |\alpha|^2$
(Wikipedia)
This is a key difference between classical and quantum systems!
So now using amplitudes...
$\begin{bmatrix} \alpha \\ \beta \end{bmatrix}^0_1$ (for a two-state system - measured in state "0" or "1")
The probability that a measurement shows the system is
in state 0 is $|\alpha|^2$ and is in state 1 is $|\beta|^2$
and $|\alpha|^2 + |\beta|^2 = 1$
System state described by unit vector in Hilbert space $\cal{H}$
We can simplify $\begin{bmatrix} \alpha \\ \beta \end{bmatrix}^0_1$ with
$\left|0\right> = \begin{bmatrix} 1 \\ 0 \end{bmatrix}^0_1$ and $\left|1\right> = \begin{bmatrix} 0 \\ 1 \end{bmatrix}^0_1$(these are basis vectors - the Computational basis)
So, $\begin{bmatrix} \alpha \\ \beta \end{bmatrix}^0_1 = \alpha \left|0\right> + \beta \left|1\right> = \left|\psi\right>$
$\left|\psi\right> = \alpha \left|0\right> + \beta \left|1\right> = \begin{bmatrix} \alpha \\ \beta \end{bmatrix}$ (ket - column vector)
$\left<\psi\right| = \alpha^* \left<0\right| + \beta^* \left<1\right| = \begin{bmatrix} \alpha^* \; \beta^* \end{bmatrix}$ (bra - Hermitian conjugate - row vector)
$\left<v|w\right>$ is the inner product (projection of state $w$ onto $v$)
$\left<\psi | \psi \right> = \alpha^* \alpha \left<0|0\right> + \beta^* \beta \left<1|1\right> = |\alpha|^2 + |\beta|^2 = 1$
$\left< 0 | 1 \right> = \left< 1 | 0 \right> = 0$ (basis vectors are orthogonal)
$\left<v|w\right> = \left<w|v\right>^*$
Linear transformation changes quantum states $U \begin{bmatrix} \alpha \\ \beta \end{bmatrix} = \begin{bmatrix} \alpha' \\ \beta' \end{bmatrix}$
$U$ is unitary if $| \alpha |^2 + | \beta |^2 = | \alpha' |^2 + | \beta' |^2$ (preserves the norm)
A unitary matrix maps to a unitary transformation
$\left|\psi'\right> = \alpha' \left|0\right> + \beta' \left|1\right> = U \left|\psi\right>$
Unitary transformations preserve the the norm
$\left< \psi | \psi \right> = \Big(U \left| \psi \right>\Big)^\dagger \; U\left|\psi\right> = \left< \psi | U^\dagger U | \psi \right>$
So, for any $\psi$, $U^\dagger U = I$ and thus $U^{-1} = U^\dagger$
and the rows of $U$ form and ortho-normal unit basis
We can transform to other bases, such as,
$\left| + \right> = \frac{\left| 0 \right> + \left| 1 \right>}{\sqrt{2}}, \; \left| - \right> = \frac{\left| 0 \right> - \left| 1 \right>}{\sqrt{2}}$ (Hadamard Basis)
$\left| i \right> = \frac{\left| 0 \right> + i\left| 1 \right>}{\sqrt{2}}, \; \left| -i \right> = \frac{\left| 0 \right> - i\left| 1 \right>}{\sqrt{2}}$
Rotating into other bases, for example,
$R_\theta = \begin{bmatrix} \cos\theta && -\sin\theta \\ \sin\theta && \cos\theta \end{bmatrix}$, so $R_{\pi/4} = \begin{bmatrix} 1/\sqrt{2} && -1/\sqrt{2} \\ 1/\sqrt{2} && 1/\sqrt{2} \end{bmatrix}$
And
$R_{\pi/4} \left| 0 \right> = \left| + \right>$, $R_{\pi/4} \left| + \right> = \left| 1 \right>$
$R_{\pi/4} \left| 1 \right> = -\left| - \right>$,
This two state system is a qubit
Like a classical bit, upon measurement it is either "0" or "1"
Unlike a classical bit, the qubit's amplitude makes for rich phenomena, like superposition
## Bloch Sphere¶
Represent state of the qubit as $|\psi\rangle = \cos\Big(\frac{\theta}{2}\Big) |0\rangle + e^{i\phi} \sin\Big(\frac{\theta}{2}\Big) |1\rangle$
Plot this on a sphere. Note global phase. (Click on the sphere)
In [1]:
%matplotlib inline
import numpy as np
import matplotlib.pyplot as plt
import qutip as qt
b = qt.Bloch()
b.show()
$\left| \psi \right> = \left| 0 \right>$
In [2]:
# Make some basis vectors
zero = qt.basis(2, 0)
one = qt.basis(2, 1)
b.clear()
b.render()
$\left| \psi \right> = \left| 1 \right>$
In [3]:
b.clear()
b.render()
Superposition $\left| \psi \right> = \frac{1}{\sqrt{2}} \Big( \left| 0 \right> + \left| 1 \right> \Big)$
In [4]:
b.clear()
b.render()
$\left| + \right>$ and $\left| - \right>$
In [5]:
b.clear()
b.render()
$\left| i \right>$ and $\left| -i \right>$
In [6]:
b.clear()
b.add_states( (zero + 1.j* one).unit() )
b.add_states( (zero - 1.j* one).unit() )
b.render()
Another superposition:
$\left|\psi\right> = R_{\pi/3} \left| 0 \right> = \frac{1}{2} \left| 0 \right> + \frac{\sqrt{3}}{2} \left| 1 \right>$; $P(0) = 1/4, P(1) = 3/4$
And add a phase... $\left|\psi'\right> = \frac{1}{2} \left| 0 \right> + \sqrt{\frac{3}{8}} \, (1 + i) \left| 1 \right>$
In [7]:
import math
b.clear()
b.add_states( ( 0.5*zero + math.sqrt(3)/2*one ) )
b.add_states( ( 0.5*zero + math.sqrt(3/8)*(1+1.j)*one ) )
b.render()
Transform states with gates. One-qubit gates include the Pauli gates:
Pauli X: $\sigma_x = \begin{bmatrix} 0 && 1 \\ 1 && 0 \end{bmatrix}$, Pauli Y: $\sigma_y = \begin{bmatrix} 0 && -i \\ i && 0 \end{bmatrix}$, Pauli Z: $\sigma_z = \begin{bmatrix} 1 && 0 \\ 0 && -1 \end{bmatrix}$
They just reflect about axes. Can also do with rotations. $\sigma_x$ is also the NOT gate and is $(R_{\pi/4})^2$
In [8]:
b.clear()
b.render()
An extremely important gate is the Hadamard gate... $H = \frac{1}{\sqrt{2}} \begin{bmatrix} 1 && 1 \\ 1 && -1 \end{bmatrix}$.
It will put qubits into and out of the superposition state.
$H \left| 0 \right> = \frac{1}{\sqrt{2}} \Big( \left| 0 \right> + \left| 1 \right> \Big) = \left| + \right>$, $H \left| + \right> = \left| 0 \right>$, $H \left| 1 \right> = \left| - \right>$, $H \left| - \right> = \left| 1 \right>$
In [9]:
b.clear()
b.render()
A circuit is a series of gates on one or more qubits. Time goes to the right. The measurements are assumed to take place in the $\left| 0 \right>$, $\left| 1 \right>$ basis.
Let's do a Hadamard gate and measure the outcome.
In [10]:
from qiskit import QuantumCircuit, QuantumRegister, ClassicalRegister, execute
from qiskit.tools.visualization import plot_histogram, circuit_drawer, matplotlib_circuit_drawer
q = QuantumRegister(1)
c = ClassicalRegister(1)
h = QuantumCircuit(q, c)
h.h(q)
h.measure(q, c)
circuit_drawer(h)
Out[10]:
| 2021-10-28T21:47:42 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8280961513519287, "perplexity": 2787.2517481783393}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-43/segments/1634323588526.57/warc/CC-MAIN-20211028193601-20211028223601-00448.warc.gz"}
|
https://www.nist.gov/condensed-matter
|
An official website of the United States government
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
# Condensed matter
## News and Updates
### This Simple Material Could Scrub Carbon Dioxide From Power Plant Smokestacks
An easily synthesized chemical filter could stop the greenhouse gas from reaching the atmosphere.
### Scientists Discover Crystal Exhibiting Exotic Spiral Magnetism
An exotic form of magnetism has been discovered and linked to an equally exotic type of electrons, according to scientists who analyzed a new crystal in which
### 19th International Workshop on Low Temperature Detectors (LTD19)
The 19th International Workshop on Low Temperature Detectors (LTD19) was an opportunity for researchers from around the world to exchange information about the
## Projects and Programs
### Nano-Chemical Imaging and -Spectroscopy (IR, nIR, VIS)
Ongoing
Conventional techniques for analyzing chemical composition, such as infrared (IR) microscopy often miss critically important nanoscale details. To overcome this
### Extreme ultraviolet optical constants
Ongoing
In the vacuum ultraviolet and extreme ultraviolet (EUV), the indices of refraction of all materials become complex: N = n + ik, or N = 1- d + ik. Here, n is the
### Micro- and nano-optomechanical systems
Ongoing
Light can interact with mechanical systems in interesting and useful ways, not only probing the mechanical motion with spectacular sensitivity, but also driving
### Light-matter interactions in Semiconductor Nanostructures
Ongoing
The quantum optics of light interacting with semiconductor-based nanostructures is being studied to extend concepts of entanglement and coherence in atomic
## Publications
### Variable Strain in Armchair and Zigzag Epitaxial Graphene Nanoribbons
Author(s)
Heather Hill, Ching-Chen Yeh, Swapnil Mhatre, Ngoc Thanh Mai Tran, Hanbyul Jin, Adam Biacchi, Chi-Te Liang, Angela R. Hight Walker, Albert Rigosi
### Self-dual quasiperiodic percolation
Author(s)
Grace Sommers, Michael Gullans, David Huse
How does the percolation transition behave in the absence of quenched randomness? To address this question, we study a nonrandom self-dual quasiperiodic model
### Topological charge pumping with subwavelength Raman lattices
Author(s)
Ian Spielman, Gediminas Juzeliunas, Domantas Burba, mantas Raciunas
Recent experiments demonstrated deeply subwavelength lattices using atoms with $N$ internal states Raman-coupled with lasers of wavelength $\lambda$. The
### Efficient Computational Design of 2D van der Waals Heterostructures: Band-Alignment, Lattice-Mismatch, Web-app Generation and Machine-learning
Author(s)
Kamal Choudhary, Kevin Garrity, Francesca Tavazza, Ghanshyam Pilania
We develop a computational database, web-apps and machine-learning (ML) models to accelerate the design and discovery of two-dimensional (2D)-heterostructures
## Software
### OCEAN
OCEAN is a versatile package for calculating both optical/UV and core-edge spectroscopy. It is a first-principles code based on both ground-state density
### HolograFREE
An electron hologram is a fringe modulated image containing the amplitude and phase information of an electron transparent object. The HolograFREE routines
## Tools and Instruments
### High Throughput (Combinatorial) Screening Tool for Characterization of Thin Film Thermoelectrics as a Function Temperature
Description High-throughput (combinatorial) metrologies have evolved as a useful approach to rapidly determine the composition-structure-property relationships
| 2023-03-28T01:49:29 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.310895174741745, "perplexity": 14389.839865551758}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296948756.99/warc/CC-MAIN-20230328011555-20230328041555-00211.warc.gz"}
|
https://phys.libretexts.org/Bookshelves/University_Physics/Book%3A_University_Physics_(OpenStax)/Map%3A_University_Physics_I_-_Mechanics%2C_Sound%2C_Oscillations%2C_and_Waves_(OpenStax)/14%3A_Fluid_Mechanics/14.0E%3A_14.E%3A_Fluid_Mechanics_(Exercises)
|
$$\require{cancel}$$
# 14.E: Fluid Mechanics (Exercises)
## Conceptual Questions
### 14.1 Fluids, Density, and Pressure
1. Which of the following substances are fluids at room temperature and atmospheric pressure: air, mercury, water, glass?
2. Why are gases easier to compress than liquids and solids?
3. Explain how the density of air varies with altitude.
4. The image shows a glass of ice water filled to the brim. Will the water overflow when the ice melts? Explain your answer.
1. How is pressure related to the sharpness of a knife and its ability to cut?
2. Why is a force exerted by a static fluid on a surface always perpendicular to the surface?
3. Imagine that in a remote location near the North Pole, a chunk of ice floats in a lake. Next to the lake, a glacier with the same volume as the floating ice sits on land. If both chunks of ice should melt due to rising global temperatures, and the melted ice all goes into the lake, which one would cause the level of the lake to rise the most? Explain.
4. In ballet, dancing en pointe (on the tips of the toes) is much harder on the toes than normal dancing or walking. Explain why, in terms of pressure.
5. Atmospheric pressure exerts a large force (equal to the weight of the atmosphere above your body—about 10 tons) on the top of your body when you are lying on the beach sunbathing. Why are you able to get up?
6. Why does atmospheric pressure decrease more rapidly than linearly with altitude?
7. The image shows how sandbags placed around a leak outside a river levee can effectively stop the flow of water under the levee. Explain how the small amount of water inside the column of sandbags is able to balance the much larger body of water behind the levee.
1. Is there a net force on a dam due to atmospheric pressure? Explain your answer.
2. Does atmospheric pressure add to the gas pressure in a rigid tank? In a toy balloon? When, in general, does atmospheric pressure not affect the total pressure in a fluid?
3. You can break a strong wine bottle by pounding a cork into it with your fist, but the cork must press directly against the liquid filling the bottle—there can be no air between the cork and liquid. Explain why the bottle breaks only if there is no air between the cork and liquid.
### 14.2 Measuring Pressure
1. Explain why the fluid reaches equal levels on either side of a manometer if both sides are open to the atmosphere, even if the tubes are of different diameters.
### 14.3 Pascal's Principle and Hydraulics
1. Suppose the master cylinder in a hydraulic system is at a greater height than the cylinder it is controlling. Explain how this will affect the force produced at the cylinder that is being controlled.
### 14.4 Archimedes’ Principle and Buoyancy
1. More force is required to pull the plug in a full bathtub than when it is empty. Does this contradict Archimedes’ principle? Explain your answer.
2. Do fluids exert buoyant forces in a “weightless” environment, such as in the space shuttle? Explain your answer.
3. Will the same ship float higher in salt water than in freshwater? Explain your answer.
4. Marbles dropped into a partially filled bathtub sink to the bottom. Part of their weight is supported by buoyant force, yet the downward force on the bottom of the tub increases by exactly the weight of the marbles. Explain why.
### 14.5 Fluid Dynamics
1. Many figures in the text show streamlines. Explain why fluid velocity is greatest where streamlines are closest together. (Hint: Consider the relationship between fluid velocity and the cross-sectional area through which the fluid flows.)
### 14.6 Bernoulli’s Equation
1. You can squirt water from a garden hose a considerably greater distance by partially covering the opening with your thumb. Explain how this works.
2. Water is shot nearly vertically upward in a decorative fountain and the stream is observed to broaden as it rises. Conversely, a stream of water falling straight down from a faucet narrows. Explain why.
3. Look back to Figure 14.29. Answer the following two questions. Why is po less than atmospheric? Why is po greater than pi?
4. A tube with a narrow segment designed to enhance entrainment is called a Venturi, such as shown below. Venturis are very commonly used in carburetors and aspirators. How does this structure bolster entrainment?
1. Some chimney pipes have a T-shape, with a crosspiece on top that helps draw up gases whenever there is even a slight breeze. Explain how this works in terms of Bernoulli’s principle.
2. Is there a limit to the height to which an entrainment device can raise a fluid? Explain your answer.
3. Why is it preferable for airplanes to take off into the wind rather than with the wind?
4. Roofs are sometimes pushed off vertically during a tropical cyclone, and buildings sometimes explode outward when hit by a tornado. Use Bernoulli’s principle to explain these phenomena.
5. It is dangerous to stand close to railroad tracks when a rapidly moving commuter train passes. Explain why atmospheric pressure would push you toward the moving train.
6. Water pressure inside a hose nozzle can be less than atmospheric pressure due to the Bernoulli effect. Explain in terms of energy how the water can emerge from the nozzle against the opposing atmospheric pressure.
7. David rolled down the window on his car while driving on the freeway. An empty plastic bag on the floor promptly flew out the window. Explain why.
8. Based on Bernoulli’s equation, what are three forms of energy in a fluid? (Note that these forms are conservative, unlike heat transfer and other dissipative forms not included in Bernoulli’s equation.)
9. The old rubber boot shown below has two leaks. To what maximum height can the water squirt from Leak 1? How does the velocity of water emerging from Leak 2 differ from that of Leak 1? Explain your responses in terms of energy
1. Water pressure inside a hose nozzle can be less than atmospheric pressure due to the Bernoulli effect. Explain in terms of energy how the water can emerge from the nozzle against the opposing atmospheric pressure.
### 14.7 Viscosity and Turbulence
1. Explain why the viscosity of a liquid decreases with temperature, that is, how might an increase in temperature reduce the effects of cohesive forces in a liquid? Also explain why the viscosity of a gas increases with temperature, that is, how does increased gas temperature create more collisions between atoms and molecules?
2. When paddling a canoe upstream, it is wisest to travel as near to the shore as possible. When canoeing downstream, it is generally better to stay near the middle. Explain why.
3. Plumbing usually includes air-filled tubes near water faucets (see the following figure). Explain why they are needed and how they work.
4. Doppler ultrasound can be used to measure the speed of blood in the body. If there is a partial constriction of an artery, where would you expect blood speed to be greatest: at or after the constriction? What are the two distinct causes of higher resistance in the constriction?
5. Sink drains often have a device such as that shown below to help speed the flow of water. How does this work?
## Problems
### 14.1 Fluids, Density, and Pressure
1. Gold is sold by the troy ounce (31.103 g). What is the volume of 1 troy ounce of pure gold?
2. Mercury is commonly supplied in flasks containing 34.5 kg (about 76 lb.). What is the volume in liters of this much mercury?
3. What is the mass of a deep breath of air having a volume of 2.00 L? Discuss the effect taking such a breath has on your body’s volume and density.
4. A straightforward method of finding the density of an object is to measure its mass and then measure its volume by submerging it in a graduated cylinder. What is the density of a 240-g rock that displaces 89.0 cm3 of water? (Note that the accuracy and practical applications of this technique are more limited than a variety of others that are based on Archimedes’ principle.)
5. Suppose you have a coffee mug with a circular cross-section and vertical sides (uniform radius). What is its inside radius if it holds 375 g of coffee when filled to a depth of 7.50 cm? Assume coffee has the same density as water.
6. A rectangular gasoline tank can hold 50.0 kg of gasoline when full. What is the depth of the tank if it is 0.500-m wide by 0.900-m long? (b) Discuss whether this gas tank has a reasonable volume for a passenger car.
7. A trash compactor can compress its contents to 0.350 times their original volume. Neglecting the mass of air expelled, by what factor is the density of the rubbish increased?
8. A 2.50-kg steel gasoline can holds 20.0 L of gasoline when full. What is the average density of the full gas can, taking into account the volume occupied by steel as well as by gasoline?
9. What is the density of 18.0-karat gold that is a mixture of 18 parts gold, 5 parts silver, and 1 part copper? (These values are parts by mass, not volume.) Assume that this is a simple mixture having an average density equal to the weighted densities of its constituents.
10. The tip of a nail exerts tremendous pressure when hit by a hammer because it exerts a large force over a small area. What force must be exerted on a nail with a circular tip of 1.00-mm diameter to create a pressure of 3.00 x 109 N/m2? (This high pressure is possible because the hammer striking the nail is brought to rest in such a short distance.)
11. A glass tube contains mercury. What would be the height of the column of mercury which would create pressure equal to 1.00 atm?
12. The greatest ocean depths on Earth are found in the Marianas Trench near the Philippines. Calculate the pressure due to the ocean at the bottom of this trench, given its depth is 11.0 km and assuming the density of seawater is constant all the way down.
13. Verify that the SI unit of h$$\rho$$g is N/m2.
14. What pressure is exerted on the bottom of a gas tank that is 0.500-m wide and 0.900-m long and can hold 50.0 kg of gasoline when full?
15. A dam is used to hold back a river. The dam has a height H = 12 m and a width W = 10 m. Assume that the density of the water is $$\rho$$ = 1000 kg/m3. (a) Determine the net force on the dam. (b) Why does the thickness of the dam increase with depth?
### 14.2 Measuring Pressure
1. Find the gauge and absolute pressures in the balloon and peanut jar shown in Figure 14.12, assuming the manometer connected to the balloon uses water and the manometer connected to the jar contains mercury. Express in units of centimeters of water for the balloon and millimeters of mercury for the jar, taking h = 0.0500m for each.
2. How tall must a water-filled manometer be to measure blood pressure as high as 300 mm Hg?
3. Assuming bicycle tires are perfectly flexible and support the weight of bicycle and rider by pressure alone, calculate the total area of the tires in contact with the ground if a bicycle and rider have a total mass of 80.0 kg, and the gauge pressure in the tires is 3.50 x 105 Pa .
### 14.3 Pascal's Principle and Hydraulics
1. How much pressure is transmitted in the hydraulic system considered in Example 14.3? Express your answer in atmospheres.
2. What force must be exerted on the master cylinder of a hydraulic lift to support the weight of a 2000-kg car (a large car) resting on a second cylinder? The master cylinder has a 2.00-cm diameter and the second cylinder has a 24.0-cm diameter.
3. A host pours the remnants of several bottles of wine into a jug after a party. The host then inserts a cork with a 2.00-cm diameter into the bottle, placing it in direct contact with the wine. The host is amazed when the host pounds the cork into place and the bottom of the jug (with a 14.0-cm diameter) breaks away. Calculate the extra force exerted against the bottom if he pounded the cork with a 120-N force.
4. A certain hydraulic system is designed to exert a force 100 times as large as the one put into it. (a) What must be the ratio of the area of the cylinder that is being controlled to the area of the master cylinder? (b) What must be the ratio of their diameters? (c) By what factor is the distance through which the output force moves reduced relative to the distance through which the input force moves? Assume no losses due to friction.
5. Verify that work input equals work output for a hydraulic system assuming no losses due to friction. Do this by showing that the distance the output force moves is reduced by the same factor that the output force is increased. Assume the volume of the fluid is constant. What effect would friction within the fluid and between components in the system have on the output force? How would this depend on whether or not the fluid is moving?
### 14.4 Archimedes’ Principle and Buoyancy
1. What fraction of ice is submerged when it floats in freshwater, given the density of water at 0 °C is very close to 1000 kg/m3?
2. If a person’s body has a density of 995 kg/m3, what fraction of the body will be submerged when floating gently in (a) freshwater? (b) In salt water with a density of 1027 kg/m3?
3. A rock with a mass of 540 g in air is found to have an apparent mass of 342 g when submerged in water. (a) What mass of water is displaced? (b) What is the volume of the rock? (c) What is its average density? Is this consistent with the value for granite?
4. Archimedes’ principle can be used to calculate the density of a fluid as well as that of a solid. Suppose a chunk of iron with a mass of 390.0 g in air is found to have an apparent mass of 350.5 g when completely submerged in an unknown liquid. (a) What mass of fluid does the iron displace? (b) What is the volume of iron, using its density as given in Table 14.1? (c) Calculate the fluid’s density and identify it.
5. Calculate the buoyant force on a 2.00-L helium balloon. (b) Given the mass of the rubber in the balloon is 1.50 g, what is the net vertical force on the balloon if it is let go? Neglect the volume of the rubber.
6. What is the density of a woman who floats in fresh water with 4.00% of her volume above the surface? (This could be measured by placing her in a tank with marks on the side to measure how much water she displaces when floating and when held under water.) (b) What percent of her volume is above the surface when she floats in seawater?
7. A man has a mass of 80 kg and a density of 955 kg/m3 (excluding the air in his lungs). (a) Calculate his volume. (b) Find the buoyant force air exerts on him. (c) What is the ratio of the buoyant force to his weight?
8. A simple compass can be made by placing a small bar magnet on a cork floating in water. (a) What fraction of a plain cork will be submerged when floating in water? (b) If the cork has a mass of 10.0 g and a 20.0-g magnet is placed on it, what fraction of the cork will be submerged? (c) Will the bar magnet and cork float in ethyl alcohol?
9. What percentage of an iron anchor’s weight will be supported by buoyant force when submerged in salt water?
10. Referring to Figure 14.20, prove that the buoyant force on the cylinder is equal to the weight of the fluid displaced (Archimedes’ principle). You may assume that the buoyant force is F2 − F1 and that the ends of the cylinder have equal areas A. Note that the volume of the cylinder (and that of the fluid it displaces) equals (h2 − h1)A.
11. A 75.0-kg man floats in freshwater with 3.00% of his volume above water when his lungs are empty, and 5.00% of his volume above water when his lungs are full. Calculate the volume of air he inhales—called his lung capacity—in liters. (b) Does this lung volume seem reasonable?
### 14.5 Fluid Dynamics
1. What is the average flow rate in cm3/s of gasoline to the engine of a car traveling at 100 km/h if it averages 10.0 km/L?
2. The heart of a resting adult pumps blood at a rate of 5.00 L/min. (a) Convert this to cm3/s. (b) What is this rate in m3/s?
3. The Huka Falls on the Waikato River is one of New Zealand’s most visited natural tourist attractions. On average, the river has a flow rate of about 300,000 L/s. At the gorge, the river narrows to 20-m wide and averages 20-m deep. (a) What is the average speed of the river in the gorge? (b) What is the average speed of the water in the river downstream of the falls when it widens to 60 m and its depth increases to an average of 40 m?
4. (a) Estimate the time it would take to fill a private swimming pool with a capacity of 80,000 L using a garden hose delivering 60 L/min. (b) How long would it take if you could divert a moderate size river, flowing at 5000 m3/s into the pool?
5. What is the fluid speed in a fire hose with a 9.00-cm diameter carrying 80.0 L of water per second? (b) What is the flow rate in cubic meters per second? (c) Would your answers be different if salt water replaced the fresh water in the fire hose?
6. Water is moving at a velocity of 2.00 m/s through a hose with an internal diameter of 1.60 cm. (a) What is the flow rate in liters per second? (b) The fluid velocity in this hose’s nozzle is 15.0 m/s. What is the nozzle’s inside diameter?
7. Prove that the speed of an incompressible fluid through a constriction, such as in a Venturi tube, increases by a factor equal to the square of the factor by which the diameter decreases. (The converse applies for flow out of a constriction into a larger-diameter region.)
8. Water emerges straight down from a faucet with a 1.80-cm diameter at a speed of 0.500 m/s. (Because of the construction of the faucet, there is no variation in speed across the stream.) (a) What is the flow rate in cm3/s? (b) What is the diameter of the stream 0.200 m below the faucet? Neglect any effects due to surface tension.
### 14.6 Bernoulli’s Equation
1. Verify that pressure has units of energy per unit volume.
2. Suppose you have a wind speed gauge like the pitot tube shown in Figure 14.32. By what factor must wind speed increase to double the value of h in the manometer? Is this independent of the moving fluid and the fluid in the manometer?
3. If the pressure reading of your pitot tube is 15.0 mm Hg at a speed of 200 km/h, what will it be at 700 km/h at the same altitude?
4. Every few years, winds in Boulder, Colorado, attain sustained speeds of 45.0 m/s (about 100 mph) when the jet stream descends during early spring. Approximately what is the force due to the Bernoulli equation on a roof having an area of 220m2? Typical air density in Boulder is 1.14 kg/m3, and the corresponding atmospheric pressure is 8.89 x 104 N/m2. (Bernoulli’s principle as stated in the text assumes laminar flow. Using the principle here produces only an approximate result, because there is significant turbulence.)
5. What is the pressure drop due to the Bernoulli Effect as water goes into a 3.00-cm-diameter nozzle from a 9.00-cm-diameter fire hose while carrying a flow of 40.0 L/s? (b) To what maximum height above the nozzle can this water rise? (The actual height will be significantly smaller due to air resistance.)
6. (a) Using Bernoulli’s equation, show that the measured fluid speed v for a pitot tube, like the one in Figure 14.32(b), is given by v = $$\left(\dfrac{2 \rho' gh}{\rho} \right)^{1/2}$$, where h is the height of the manometer fluid, $$\rho′$$ is the density of the manometer fluid, $$\rho$$ is the density of the moving fluid, and g is the acceleration due to gravity. (Note that v is indeed proportional to the square root of h, as stated in the text.) (b) Calculate v for moving air if a mercury manometer’s h is 0.200 m.
7. A container of water has a cross-sectional area of A = 0.1 m2. A piston sits on top of the water (see the following figure). There is a spout located 0.15 m from the bottom of the tank, open to the atmosphere, and a stream of water exits the spout. The cross sectional area of the spout is As = 7.0 x 10−4 m2. (a) What is the velocity of the water as it leaves the spout? (b) If the opening of the spout is located 1.5 m above the ground, how far from the spout does the water hit the floor? Ignore all friction and dissipative forces.
1. A fluid of a constant density flows through a reduction in a pipe. Find an equation for the change in pressure, in terms of v1, A1, A2, and the density.
### 14.7 Viscosity and Turbulence
1. (a) Calculate the retarding force due to the viscosity of the air layer between a cart and a level air track given the following information: air temperature is 20 °C, the cart is moving at 0.400 m/s, its surface area is 2.50 x 10−2 m2, and the thickness of the air layer is 6.00 x 10−5 m. (b) What is the ratio of this force to the weight of the 0.300-kg cart?
2. The arterioles (small arteries) leading to an organ constrict in order to decrease flow to the organ. To shut down an organ, blood flow is reduced naturally to 1.00% of its original value. By what factor do the radii of the arterioles constrict?
3. A spherical particle falling at a terminal speed in a liquid must have the gravitational force balanced by the drag force and the buoyant force. The buoyant force is equal to the weight of the displaced fluid, while the drag force is assumed to be given by Stokes Law, Fs = 6$$\pi \eta$$v. Show that the terminal speed is given by v = $$\frac{2R^{2} g}{9 \eta} (\rho_{s} − \rho_{1})$$, where R is the radius of the sphere, $$\rho_{s}$$ is its density, and $$\rho_{1}$$ is the density of the fluid, and $$\eta$$ the coefficient of viscosity.
4. Using the equation of the previous problem, find the viscosity of motor oil in which a steel ball of radius 0.8 mm falls with a terminal speed of 4.32 cm/s. The densities of the ball and the oil are 7.86 and 0.88 g/mL, respectively.
5. A skydiver will reach a terminal velocity when the air drag equals his or her weight. For a skydiver with a large body, turbulence is a factor at high speeds. The drag force then is approximately proportional to the square of the velocity. Taking the drag force to be FD = $$\frac{1}{2} \rho Av^{2}$$, and setting this equal to the skydiver’s weight, find the terminal speed for a person falling “spread eagle.”
6. (a) Verify that a 19.0% decrease in laminar flow through a tube is caused by a 5.00% decrease in radius, assuming that all other factors remain constant. (b) What increase in flow is obtained from a 5.00% increase in radius, again assuming all other factors remain constant?
7. When physicians diagnose arterial blockages, they quote the reduction in flow rate. If the flow rate in an artery has been reduced to 10.0% of its normal value by a blood clot and the average pressure difference has increased by 20.0%, by what factor has the clot reduced the radius of the artery?
8. An oil gusher shoots crude oil 25.0 m into the air through a pipe with a 0.100-m diameter. Neglecting air resistance but not the resistance of the pipe, and assuming laminar flow, calculate the pressure at the entrance of the 50.0-m-long vertical pipe. Take the density of the oil to be 900 kg/m3 and its viscosity to be 1.00(N/m2) • s (or 1.00 Pa • s). Note that you must take into account the pressure due to the 50.0-m column of oil in the pipe.
9. Concrete is pumped from a cement mixer to the place it is being laid, instead of being carried in wheelbarrows. The flow rate is 200 L/min through a 50.0-m-long, 8.00-cm-diameter hose, and the pressure at the pump is 8.00 x 106 N/m2. (a) Calculate the resistance of the hose. (b) What is the viscosity of the concrete, assuming the flow is laminar? (c) How much power is being supplied, assuming the point of use is at the same level as the pump? You may neglect the power supplied to increase the concrete’s velocity.
10. Verify that the flow of oil is laminar for an oil gusher that shoots crude oil 25.0 m into the air through a pipe with a 0.100-m diameter. The vertical pipe is 50 m long. Take the density of the oil to be 900 kg/m3 and its viscosity to be 1.00(N/m2) • s (or 1.00 Pa • s).
11. Calculate the Reynolds numbers for the flow of water through (a) a nozzle with a radius of 0.250 cm and (b) a garden hose with a radius of 0.900 cm, when the nozzle is attached to the hose. The flow rate through hose and nozzle is 0.500 L/s. Can the flow in either possibly be laminar?
12. A fire hose has an inside diameter of 6.40 cm. Suppose such a hose carries a flow of 40.0 L/s starting at a gauge pressure of 1.62 x 106 N/m2. The hose goes 10.0 m up a ladder to a nozzle having an inside diameter of 3.00 cm. Calculate the Reynolds numbers for flow in the fire hose and nozzle to show that the flow in each must be turbulent.
13. At what flow rate might turbulence begin to develop in a water main with a 0.200-m diameter? Assume a 20 °C temperature.
1. Before digital storage devices, such as the memory in your cell phone, music was stored on vinyl disks with grooves with varying depths cut into the disk. A phonograph used a needle, which moved over the grooves, measuring the depth of the grooves. The pressure exerted by a phonograph needle on a record is surprisingly large. If the equivalent of 1.00 g is supported by a needle, the tip of which is a circle with a 0.200-mm radius, what pressure is exerted on the record in Pa?
2. Water towers store water above the level of consumers for times of heavy use, eliminating the need for high-speed pumps. How high above a user must the water level be to create a gauge pressure of 3.00 x 105 N/m2?
3. The aqueous humor in a person’s eye is exerting a force of 0.300 N on the 1.10-cm2 area of the cornea. What pressure is this in mm Hg?
4. (a) Convert normal blood pressure readings of 120 over 80 mm Hg to newtons per meter squared using the relationship for pressure due to the weight of a fluid (p = h$$\rho$$g) rather than a conversion factor. (b) Explain why the blood pressure of an infant would likely be smaller than that of an adult. Specifically, consider the smaller height to which blood must be pumped.
5. Pressure cookers have been around for more than 300 years, although their use has greatly declined in recent years (early models had a nasty habit of exploding). How much force must the latches holding the lid onto a pressure cooker be able to withstand if the circular lid is 25.0 cm in diameter and the gauge pressure inside is 300 atm? Neglect the weight of the lid.
6. Bird bones have air pockets in them to reduce their weight—this also gives them an average density significantly less than that of the bones of other animals. Suppose an ornithologist weighs a bird bone in air and in water and finds its mass is 45.0 g and its apparent mass when submerged is 3.60 g (assume the bone is watertight). (a) What mass of water is displaced? (b) What is the volume of the bone? (c) What is its average density?
7. In an immersion measurement of a woman’s density, she is found to have a mass of 62.0 kg in air and an apparent mass of 0.0850 kg when completely submerged with lungs empty. (a) What mass of water does she displace? (b) What is her volume? (c) Calculate her density. (d) If her lung capacity is 1.75 L, is she able to float without treading water with her lungs filled with air?
8. Some fish have a density slightly less than that of water and must exert a force (swim) to stay submerged. What force must an 85.0-kg grouper exert to stay submerged in salt water if its body density is 1015 kg/m3 ?
9. The human circulation system has approximately 1 x 109 capillary vessels. Each vessel has a diameter of about 8 $$\mu$$m. Assuming cardiac output is 5 L/min, determine the average velocity of blood flow through each capillary vessel.
10. The flow rate of blood through a 2.00 x 10−6 m-radius capillary is 3.80 x 109 cm3/s. (a) What is the speed of the blood flow? (b) Assuming all the blood in the body passes through capillaries, how many of them must there be to carry a total flow of 90.0 cm3/s?
11. The left ventricle of a resting adult’s heart pumps blood at a flow rate of 83.0 cm3/s, increasing its pressure by 110 mm Hg, its speed from zero to 30.0 cm/s, and its height by 5.00 cm. (All numbers are averaged over the entire heartbeat.) Calculate the total power output of the left ventricle. Note that most of the power is used to increase blood pressure.
12. A sump pump (used to drain water from the basement of houses built below the water table) is draining a flooded basement at the rate of 0.750 L/s, with an output pressure of 3.00 x 105 N/m2. (a) The water enters a hose with a 3.00-cm inside diameter and rises 2.50 m above the pump. What is its pressure at this point? (b) The hose goes over the foundation wall, losing 0.500 m in height, and widens to 4.00 cm in diameter. What is the pressure now? You may neglect frictional losses in both parts of the problem.
13. A glucose solution being administered with an IV has a flow rate of 4.00 cm3/min. What will the new flow rate be if the glucose is replaced by whole blood having the same density but a viscosity 2.50 times that of the glucose? All other factors remain constant.
14. A small artery has a length of 1.1 x 10−3 m and a radius of 2.5 x 10−5 m. If the pressure drop across the artery is 1.3 kPa, what is the flow rate through the artery? (Assume that the temperature is 37 °C.)
15. Angioplasty is a technique in which arteries partially blocked with plaque are dilated to increase blood flow. By what factor must the radius of an artery be increased in order to increase blood flow by a factor of 10?
16. Suppose a blood vessel’s radius is decreased to 90.0% of its original value by plaque deposits and the body compensates by increasing the pressure difference along the vessel to keep the flow rate constant. By what factor must the pressure difference increase? (b) If turbulence is created by the obstruction, what additional effect would it have on the flow rate?
## Challenge Problems
1. The pressure on the dam shown early in the problems section increases with depth. Therefore, there is a net torque on the dam. Find the net torque.
2. The temperature of the atmosphere is not always constant and can increase or decrease with height. In a neutral atmosphere, where there is not a significant amount of vertical mixing, the temperature decreases at a rate of approximately 6.5 K per km. The magnitude of the decrease in temperature as height increases is known as the lapse rate (Γ). (The symbol is the upper case Greek letter gamma.) Assume that the surface pressure is p0 = 1.013 x 105 Pa where T = 293 K and the lapse rate is ($$\Gamma$$ = 6.5 K/km). Estimate the pressure 3.0 km above the surface of Earth.
3. A submarine is stranded on the bottom of the ocean with its hatch 25.0 m below the surface. Calculate the force needed to open the hatch from the inside, given it is circular and 0.450 m in diameter. Air pressure inside the submarine is 1.00 atm.
4. Logs sometimes float vertically in a lake because one end has become water-logged and denser than the other. What is the average density of a uniform-diameter log that floats with 20.0% of its length above water?
5. Scurrilous con artists have been known to represent gold-plated tungsten ingots as pure gold and sell them at prices much below gold value but high above the cost of tungsten. With what accuracy must you be able to measure the mass of such an ingot in and out of water to tell that it is almost pure tungsten rather than pure gold?
6. The inside volume of a house is equivalent to that of a rectangular solid 13.0 m wide by 20.0 m long by 2.75 m high. The house is heated by a forced air gas heater. The main uptake air duct of the heater is 0.300 m in diameter. What is the average speed of air in the duct if it carries a volume equal to that of the house’s interior every 15 minutes?
7. A garden hose with a diameter of 2.0 cm is used to fill a bucket, which has a volume of 0.10 cubic meters. It takes 1.2 minutes to fill. An adjustable nozzle is attached to the hose to decrease the diameter of the opening, which increases the speed of the water. The hose is held level to the ground at a height of 1.0 meters and the diameter is decreased until a flower bed 3.0 meters away is reached. (a) What is the volume flow rate of the water through the nozzle when the diameter is 2.0 cm? (b) What is the speed of the water coming out of the hose? (c) What does the speed of the water coming out of the hose need to be to reach the flower bed 3.0 meters away? (d) What is the diameter of the nozzle needed to reach the flower bed?
8. A frequently quoted rule of thumb in aircraft design is that wings should produce about 1000 N of lift per square meter of wing. (The fact that a wing has a top and bottom surface does not double its area.) (a) At takeoff, an aircraft travels at 60.0 m/s, so that the air speed relative to the bottom of the wing is 60.0 m/s. Given the sea level density of air as 1.29 kg/m3, how fast must it move over the upper surface to create the ideal lift? (b) How fast must air move over the upper surface at a cruising speed of 245 m/s and at an altitude where air density is one-fourth that at sea level? (Note that this is not all of the aircraft’s lift—some comes from the body of the plane, some from engine thrust, and so on. Furthermore, Bernoulli’s principle gives an approximate answer because flow over the wing creates turbulence.)
9. Two pipes of equal and constant diameter leave a water pumping station and dump water out of an open end that is open to the atmosphere (see the following figure). The water enters at a pressure of two atmospheres and a speed of (v1 = 1.0 m/s). One pipe drops a height of 10 m. What is the velocity of the water as the water leaves each pipe?
1. Fluid originally flows through a tube at a rate of 100 cm3/s. To illustrate the sensitivity of flow rate to various factors, calculate the new flow rate for the following changes with all other factors remaining the same as in the original conditions. (a) Pressure difference increases by a factor of 1.50. (b) A new fluid with 3.00 times greater viscosity is substituted. (c) The tube is replaced by one having 4.00 times the length. (d) Another tube is used with a radius 0.100 times the original. (e) Yet another tube is substituted with a radius 0.100 times the original and half the length, and the pressure difference is increased by a factor of 1.50.
2. During a marathon race, a runner’s blood flow increases to 10.0 times her resting rate. Her blood’s viscosity has dropped to 95.0% of its normal value, and the blood pressure difference across the circulatory system has increased by 50.0%. By what factor has the average radii of her blood vessels increased?
3. Water supplied to a house by a water main has a pressure of 3.00 x 105 N/m2 early on a summer day when neighborhood use is low. This pressure produces a flow of 20.0 L/min through a garden hose. Later in the day, pressure at the exit of the water main and entrance to the house drops, and a flow of only 8.00 L/min is obtained through the same hose. (a) What pressure is now being supplied to the house, assuming resistance is constant? (b) By what factor did the flow rate in the water main increase in order to cause this decrease in delivered pressure? The pressure at the entrance of the water main is 5.00 x 105 N/m2, and the original flow rate was 200 L/ min. (c) How many more users are there, assuming each would consume 20.0 L/min in the morning?
4. Gasoline is piped underground from refineries to major users. The flow rate is 3.00 x 10−2 m3/s (about 500 gal/min), the viscosity of gasoline is 1.00 x 10−3 (N/m2) • s, and its density is 680 kg/m3. (a) What minimum diameter must the pipe have if the Reynolds number is to be less than 2000? (b) What pressure difference must be maintained along each kilometer of the pipe to maintain this flow rate?
## Contributors
Samuel J. Ling (Truman State University), Jeff Sanny (Loyola Marymount University), and Bill Moebs with many contributing authors. This work is licensed by OpenStax University Physics under a Creative Commons Attribution License (by 4.0).
| 2019-12-14T21:19:20 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5736237168312073, "perplexity": 840.286824931241}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-51/segments/1575541294513.54/warc/CC-MAIN-20191214202754-20191214230754-00086.warc.gz"}
|
http://dlmf.nist.gov/14.13
|
# §14.13 Trigonometric Expansions
When $0<\theta<\pi$, and $\nu+\mu$ is not a negative integer,
14.13.1 $\displaystyle\mathop{\mathsf{P}^{\mu}_{\nu}\/}\nolimits\!\left(\mathop{\cos\/}% \nolimits\theta\right)$ $\displaystyle=\frac{2^{\mu+1}(\mathop{\sin\/}\nolimits\theta)^{\mu}}{\pi^{1/2}% }\*\sum_{k=0}^{\infty}\frac{\mathop{\Gamma\/}\nolimits\!\left(\nu+\mu+k+1% \right)}{\mathop{\Gamma\/}\nolimits\!\left(\nu+k+\frac{3}{2}\right)}\frac{% \left(\mu+\frac{1}{2}\right)_{k}}{k!}\*\mathop{\sin\/}\nolimits\!\left((\nu+% \mu+2k+1)\theta\right),$ 14.13.2 $\displaystyle\mathop{\mathsf{Q}^{\mu}_{\nu}\/}\nolimits\!\left(\mathop{\cos\/}% \nolimits\theta\right)$ $\displaystyle=\pi^{1/2}2^{\mu}(\mathop{\sin\/}\nolimits\theta)^{\mu}\*\sum_{k=% 0}^{\infty}\frac{\mathop{\Gamma\/}\nolimits\!\left(\nu+\mu+k+1\right)}{\mathop% {\Gamma\/}\nolimits\!\left(\nu+k+\frac{3}{2}\right)}\frac{\left(\mu+\frac{1}{2% }\right)_{k}}{k!}\*\mathop{\cos\/}\nolimits\!\left((\nu+\mu+2k+1)\theta\right).$
These Fourier series converge absolutely when $\realpart{\mu}<0$, and conditionally when $\nu$ is real and $0\leq\mu<\frac{1}{2}$.
In particular,
14.13.3 $\displaystyle\mathop{\mathsf{P}_{n}\/}\nolimits\!\left(\mathop{\cos\/}% \nolimits\theta\right)$ $\displaystyle=\frac{2^{2n+2}(n!)^{2}}{\pi(2n+1)!}\*\sum_{k=0}^{\infty}\frac{1% \cdot 3\cdots(2k-1)}{k!}\*\frac{(n+1)(n+2)\cdots(n+k)}{(2n+3)(2n+5)\cdots(2n+2% k+1)}\*\mathop{\sin\/}\nolimits\!\left((n+2k+1)\theta\right),$ 14.13.4 $\displaystyle\mathop{\mathsf{Q}_{n}\/}\nolimits\!\left(\mathop{\cos\/}% \nolimits\theta\right)$ $\displaystyle=\frac{2^{2n+1}(n!)^{2}}{(2n+1)!}\*\sum_{k=0}^{\infty}\frac{1% \cdot 3\cdots(2k-1)}{k!}\*\frac{(n+1)(n+2)\cdots(n+k)}{(2n+3)(2n+5)\cdots(2n+2% k+1)}\*\mathop{\cos\/}\nolimits\!\left((n+2k+1)\theta\right),$
with conditional convergence for each.
For other trigonometric expansions see Erdélyi et al. (1953a, pp. 146–147).
| 2015-01-31T05:32:09 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 49, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.990111231803894, "perplexity": 1755.7562638712816}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-06/segments/1422115869320.77/warc/CC-MAIN-20150124161109-00099-ip-10-180-212-252.ec2.internal.warc.gz"}
|
https://docs.dea.ga.gov.au/notebooks/01_Getting_started/Getting%20Started.html
|
# Getting Started¶
Requirements:
You need to run the following commands from the command line prior to launching jupyter notebook from the same terminal so that the required libraries and paths are set.
module use /g/data/v10/public/modules/modulefiles
module load dea
## First we need to define how we display plots in our notebooks:¶
[1]:
%matplotlib inline
We use pandas.DataFrame objects to display our tables, so we will set some settings to tweak their formatting:
[2]:
import pandas
pandas.set_option('display.max_colwidth', 200)
pandas.set_option('display.max_rows', None)
Now we load the datacube library:
[3]:
import datacube
Create our datacube object, with a name to help for logging.
[4]:
dc = datacube.Datacube(app='getting-started')
By default, it will connect to the main Digital Earth environment at NCI:
[5]:
dc.index
[5]:
Index<db=PostgresDb<engine=Engine(postgresql://[email protected]:6432/datacube)>>
Now we can query the dc object. The basic API is as follows -
.. currentmodule:: datacube .. autosummary:: Datacube Datacube.list_products Datacube.list_measurements Datacube.load
| 2019-11-20T19:25:48 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.39483901858329773, "perplexity": 9422.791128998706}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-47/segments/1573496670601.75/warc/CC-MAIN-20191120185646-20191120213646-00063.warc.gz"}
|
https://ikariam.fandom.com/wiki/Building:Optician
|
## FANDOM
1,730 Pages
Optician
Function:
Lowers demand
Requirements:
Optics ()
Expansion requirements:
and
Use requirements:
None
## Description
Lenses and magnifying glasses don't only help our scientists to see clearly and find important papers on their desk, they are also necessary in order to invent all the new technologies that make us so proud. The optician keeps everything we need carefully stored in boxes, so less things get lost and the demand for Crystal Glass is decreased per building level.
### Notes
Every level of the Optician lowers demand for by 1% per expansion (only in the town it is built).
## Explanation of Reduction Buildings
All reduction buildings add their deduction percentage to that given by Pulley, Geometry and Spirit Level. This means the actual discount is an additional 1% per level of the reduction building, plus the reduction from the level of research you have completed. For example, a Level 1 reduction building combined with Pulley has a net of 3% reduction, with Geometry there is a net of 7%, and with Spirit Level there is a net of 15%. With the maximum level of reduction buildings (Level 32, 32% reduction) and Spirit Level (14%), the maximum reduction for that resource is 46%. This means you use only 54% of the original cost.
## Expansion Details
The time (in seconds) it takes to upgrade to the next level is determined by the following formula: ${ \text{Building time (seconds)} = \left \lbrack \cfrac{125,660}{37} \times 1.06^\text{Level} - 2,772\right \rbrack }$
The accumulative time (in seconds) it takes to upgrade up to the next level is determined by the following formula: ${ \text{Accumulative building time (seconds)} = \left \lbrack \cfrac{6,659,980}{111} \times \left (\ 1.06^\text{Level} -\ 1\ \right ) - 2,772 \times \text{Level}\right \rbrack}$
## Other Reduction Buildings
Community content is available under CC-BY-SA unless otherwise noted.
| 2020-02-26T23:22:33 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5384142994880676, "perplexity": 1586.2285898161751}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-10/segments/1581875146562.94/warc/CC-MAIN-20200226211749-20200227001749-00289.warc.gz"}
|
http://hitchhikersgui.de/Proportional_approval_voting
|
# Proportional approval voting
Jump to navigation Jump to search
Proportional approval voting (PAV) is an electoral system which is an extension of approval voting to multiple-winner elections. It applies proportional representation principles with a ballot which is no more complicated than ballots for plurality voting. It allows each voter to vote for as many or as few candidates as they choose. It was first developed by Forest Simmons in 2001.[1]
## Description
PAV works by looking at how "satisfied" each voter is with each potential result or outcome of the election. The calculated satisfaction with any particular result for an individual voter is a function of how many of the elected candidates the individual originally voted for.[2] Under PAV, to calculate the satisfaction of an individual, only the elected candidates that the individual voted for are counted - the unsuccessful candidates that they voted for, as well as the elected candidates that they did not vote for are not taken into account. Assuming that an individual voted for n candidates that were successful, their satisfaction would be calculated using the formula[1]
${\displaystyle 1+{\frac {1}{2}}+{\frac {1}{3}}+\cdots +{\frac {1}{n}}}$
Summing the satisfaction across all voters with any potential result gives the population's total satisfaction with that result. The total satisfaction is calculated for every possible set of candidates, and the set of candidates with the highest total satisfaction is deemed to be the winning set.
In an election with only one winner, PAV operates in exactly the same way as normal approval voting. If on the other hand, each voter voted exclusively for all of the candidates within a single party, PAV would function in the same way as the D'Hondt method of party-list proportional representation.
Counting the votes in PAV is NP-hard, making it a very computationally demanding voting method as the number of candidates and seats increase.[3] If there were c candidates and s seats, then there would be
${\displaystyle {\frac {c!}{s!(c-s)!}}}$
combinations of candidates to compare with each election,[4] for example if there were 24 candidates for 4 seats, there would be 10,626 combinations to calculate total satisfaction for. An election requiring this many calculations would necessitate vote counting by computer.
## Example
2 seats to be filled, four candidates: Andrea (A), Brad (B), Carter (C), and Delilah (D), and 30 voters. The ballots are:
• 5: AB
• 17: AC
• 8: D
There are 6 possible results: AB, AC, AD, BC, BD, and CD.
AB AC AD BC BD CD
Voters approving at least 1 successful candidate (satisfaction of 1 for 1st approved candidate) 22 22 30 22 13 25
Voters approving at least 2 successful candidates (satisfaction of 1/2 for 2nd approved candidate) 5 17 0 0 0 0
Total satisfaction 24.5 30.5 30 22 13 25
Andrea and Carter are elected.
## Advantages and disadvantages
Most systems of proportional representation use party lists. The system was designed to have both proportional representation and personal votes (voters vote for candidates, not for a party list). It deserves to be call a "proportional" system because if votes turn out to follow a partisan scheme (each voter votes for all candidates from a party and no other) then the system elects a number of candidates in each party that is proportional to the number of voters who chose this party[5]
## References
1. ^ a b Kilgour, D. Marc (2010). "Approval Balloting for Multi-winner Elections". In Jean-François Laslier; M. Remzi Sanver. Handbook on Approval Voting. Springer. pp. 105–124. ISBN 978-3-642-02839-7.
2. ^ Aziz, Haris; Brill, Markus; Conitzer, Vincent; Elkind, Edith; Freeman, Rupert; Walsh, Toby (2014). "Justified Representation in Approval-Based Committee Voting". arXiv:1407.8269 [cs.MA].
3. ^ Aziz, Haris; Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh. "Computational Aspects of Multi-Winner Approval Voting". Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems. pp. 107–115. arXiv:1407.3247. ISBN 978-1-4503-3413-6.CS1 maint: Multiple names: authors list (link)
4. ^ Enric Plaza: "Technologies for political representation and accountability": p9 [1]
5. ^ Brill, Markus; Laslier, Jean-François; Skowron, Piotr (2016). "Multiwinner Approval Rules as Apportionment Methods". arXiv:1611.08691 [cs.GT].
Retrieved from "https://en.wikipedia.org/w/index.php?title=Proportional_approval_voting&oldid=849759250"
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Proportional_approval_voting
This page is based on the copyrighted Wikipedia article "Proportional approval voting"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA
| 2019-02-24T02:26:52 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 2, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5452660322189331, "perplexity": 4787.132407375626}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-09/segments/1550249569386.95/warc/CC-MAIN-20190224003630-20190224025630-00321.warc.gz"}
|
https://www.usgs.gov/center-news/volcano-watch-more-19000-earthquakes-catalogued-hawaii-1823
|
# Volcano Watch — More than 19,000 earthquakes catalogued in Hawaii since 1823
Release Date:
Earthquakes occur every day on the Island of Hawaii. Most are small, less than magnitude 3, but typically a couple are felt by someone each week. Damaging earthquakes occur every few years, and very large ones take place every few decades or more often.
Earthquakes occur every day on the Island of Hawaii. Most are small, less than magnitude 3, but typically a couple are felt by someone each week. Damaging earthquakes occur every few years, and very large ones take place every few decades or more often. The two largest earthquakes in the past 200 years are those of 1868 (estimated magnitude of 7.9) and 1975 (magnitude of 7.2). These are large by even California standards.
HVO has had a reasonably complete network of seismic stations since about 1960. The network encompasses the entire island and was extended a year ago to include east Maui. Currently about 70 stations are operating. For the past 40 years, the network has enabled the detailed analysis of the earthquakes, including locations, depths, and magnitudes.
What about before 1960? There were plenty of earthquakes then, but the lack of adequate instrumentation made it difficult to estimate locations, depths, and magnitudes very reliably. Yet it is important to know about these historical earthquakes, in order to determine whether seismic patterns of activity have changed with time. Perhaps there are long-term trends that only the study of past earthquakes can reveal.
A stunning new publication--actually a labor of love--by ex-HVO staff members Fred Klein and Tom Wright goes a long way toward making study of the old, historical earthquakes both possible and rewarding. The research publication is titled "Catalog of Hawaiian earthquakes, 1823-1959"; it can be viewed, or a paper copy ordered, on the web at http://geopubs.wr.usgs.gov/prof-paper/pp1623/.
The catalog contains information about 19,464 earthquakes in the Hawaiian Islands, mostly on the Island of Hawaii, since 1823. The information results from a remarkable combination of sleuthing and insight.
The sleuthing involved pouring over newspaper stories, diaries, and other obscure writings, starting with William Ellis' journal of his 1823 trip around Hawaii and ending with newspaper accounts from the 1950s. The Lyman diary (1833-1917), written by the missionary family in Hilo, is a notable but incomplete source. Fourteen different newspapers published in Honolulu, Hilo, and Wailuku, were examined, dating from 1856. Felt reports sent to HVO in 1932-1941 and 1951-1958 proved of great value.
The written accounts provide far more information than has previously been assembled, particularly about 19th-century earthquake activity. Approximate locations for many of the earthquakes can be estimated, and rough magnitudes can, in some cases, be assigned on the basis of the felt reports. However, the information is necessarily limited by the lack of instrumental recordings.
The first seismograph in Hawaii was installed in 1899 at Oahu College (now Punahou School), but the first systematic published recordings were begun in April 1903 at the Honolulu Magnetic Observatory. A seismograph began operation at HVO in 1912. With the advent of these instruments, much more quantitative information became available. Nonetheless, the lack of a network of several stations made the calculation of precise locations and magnitudes virtually impossible.
Klein and Wright devised an insightful method to assign location and magnitude for all earthquakes at a known or reasonably estimated distance from HVO, or for those events that were widely felt. For the instrumental period from 1903 to 1959, they summarize information on location and magnitude for more than 800 earthquakes of magnitude 4 or above; during this same period, they list 17,917 earthquakes in total! The pre-instrumental record is much sparser, but Klein and Wright found 1,547 earthquakes that were felt between 1823 and 1903.
The authors refrain from attempting any interpretations of the data, preferring to publish them separately. They do caution, however, about accepting seemingly obvious trends, owing to the poor quality of the historical record. Such trends, they warn, "are like the shadow of an object that reveals a hint of shape but nothing about its structure."
Take a look at this remarkable catalogue on the web. Though technical, the tables are readily understandable and tell it all.
### Volcano Activity Update
Eruptive activity of Kīlauea Volcano continued unabated during the past week, following a brief surge two weeks ago. Lava is erupting from Puu Oo and flowing southeast through the old tube system for 1.5 km (0.9 mi) to the 2,300-foot elevation. A new tube system within the breakout flows from the 2,300-foot elevation routes the lava down to the coastal flats below Pulama pali and to the coast near Kamokuna. Lava is entering the ocean along a broad, 600-meter (2,000-foot) front located 1.6 km (1 mi) west-southwest of Waha`ula. The public is reminded that the ocean-entry areas are extremely hazardous, with explosions accompanying sudden collapses of the new land. The active lava flows are hot and have places with very thin crust. The steam clouds are highly acidic and laced with glass particles.
There were no earthquakes reported felt during the week ending on October 5.
| 2020-12-01T18:48:22 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3071470856666565, "perplexity": 3638.507979087718}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-50/segments/1606141681209.60/warc/CC-MAIN-20201201170219-20201201200219-00089.warc.gz"}
|
https://www.usgs.gov/center-news/volcano-watch-waiting-pause-refreshes
|
# Volcano Watch — Waiting for the pause that refreshes
Release Date:
What do Kīlauea Volcano's eruption and Hilo's 7:30 a.m. traffic have in common? For one thing, lots of stops and starts. The stops and starts in the eruption at Kīlauea are the by now familiar pauses; the stops and starts in busy Hilo traffic might be referred to in more colorful terms.
What do Kīlauea Volcano's eruption and Hilo's 7:30 a.m. traffic have in common? For one thing, lots of stops and starts. The stops and starts in the eruption at Kīlauea are the by now familiar pauses; the stops and starts in busy Hilo traffic might be referred to in more colorful terms.
The latest pause in Kīlauea's ongoing eruption occurred just over a week ago and was brief. The pause started late on Wednesday, August 23, and ended Saturday, August 26. This was the first Y2K pause but the 30th of the current eruptive episode, which began in February 1997. Eruptive pauses can be short, lasting only a few hours, or long, lasting days or even tens of days. For avid local volcano viewers and once-in-a-lifetime visitors, a pause can be a frustrating experience, since lava stops flowing completely, and there is little, if anything, to see that is red and molten. However, for residents and visitors who are acutely aware of air quality, a pause can be a refreshing experience.
Since the current eruption began in 1983, Kīlauea has released a total of around 8 million tons of toxic sulfur dioxide gas (SO2)—enough to fill 400,000 Goodyear blimps or 350 billion party balloons. This gas, which reacts in the atmosphere to form sulfuric acid and other aerosols, is the principle gas responsible for the formation of volcanic smog (vog). At Kīlauea, the amount of sulfur dioxide gas released is directly proportional to the amount of lava erupted. Therefore, when the lava eruption rate declines, there is generally a decrease in the amount of SO2 discharged.
During a long pause, the amount of SO2 released from the eruption site is usually drastically reduced. For example, during a 25-day break in the eruption in early 1997, so little SO2 was being emitted that it could not be detected downwind of the eruption site using our standard measurement techniques. This abrupt decrease in gas confirmed that, in addition to the absence of lava at the surface, magma had also withdrawn from beneath Puu Oo.
Several months later, SO2 emissions were still only around half their typical value, reflecting the sluggish start-up of the eruption. During this delightful three-month period of very low SO2 emissions, Kona residents reported the return of the clear air that was the norm before 1986, when the eruption became continuous. Residents who had moved off-island to escape the hazy Kona air quality inquired whether the improved conditions were likely to continue and it might be time to move back. The respite was brief however, and as the lava production came up to full volume, so did the SO2 emissions, and thereby the air pollution problem.
During brief pauses, SO2 emissions may decline somewhat but not stop altogether. During the most recent event, measurements showed that the amount of SO2 released during the pause was still around two-thirds of what we had measured prior to the pause. Although no active lava was flowing, residual degassing of cooling lava, tubes, the vent areas, and shallow magma beneath Puu 'Oo continued. It can take many days for all of the gas to escape from the material remaining in the system, so a brief pause may give little chance for chronic volcanic air pollution, such as that in Kona, to clear.
Close to the emission sources, it may also be difficult to detect that a decrease in SO2 has occurred. Under steady trade wind conditions, a compact plume of the residual SO2 from the inactive eruption site can cross the Chain of Craters Road in Hawaii Volcanoes National Park, 9 km (5.5 miles) from the emission source. This plume is concentrated enough so that a person would still experience the pungent smell, taste and ensuing watery eyes associated with SO2 exposure. Although the latest pause in Kīlauea's ongoing eruption was brief, an extended "pause that refreshes" may lie in the future.
### Volcano Activity Update
The eruption of Kīlauea Volcano continues, following a brief pause last week. Lava flows started up late on the 26th, with breakouts occurring from the lava tube at the 2,300-ft elevation, 1.5 km (0.9 mi) southeast of Puu O`o cone. By mid-week, flows had extended about 2 km (1.2 mi) downslope. It appears that the tube is blocked below the 2,300-ft level, and new tubes will have to form before lava once again reaches the ocean. This can be a slow process, so it may be several weeks or longer before lava is visible on the coastal plain. In the meantime, volcano-watchers may see bright glow at night from the new surface flows above the pali.
There were no felt earthquakes on the island during the past week.
| 2020-07-12T23:55:48 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4747740626335144, "perplexity": 3645.214891220621}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-29/segments/1593657140337.79/warc/CC-MAIN-20200712211314-20200713001314-00071.warc.gz"}
|
https://wiki.bnl.gov/eic/index.php?title=BuildTree
|
# BuildTree
BuildTree is a routine in the eic-smear package that processes output from the EIC task-force Monte Carlo generators into ROOT tree files. It supercedes the ROOT macro used for the previous generation of ROOT trees.
## Introduction
The output from most of the Monte Carlo generators used by the EIC task force is in the form of ASCII text files, following a common format. Specifically, PYTHIA, PEPSI, RAPGAP, MILOU, DJANGOH, gmc_trans and DPMJet generate their output in this way. The format of files produced by each is explained in the page for the corresponding generator.
The text files can be processed into a ROOT TTree for analysis by a routine named BuildTree. BuildTree is provided as part of the EIC smearing shared library, and is loaded into and run from ROOT. This library also contains an event class for each of the aforementioned generators, a common particle class shared by each event type, plus numerous other utility classes. This page describes the use of the BuildTree function itself and briefly describes event class. Documentation for the full class structure contained in the library is available here.
## Running
BuildTree takes four arguments, the first of which is mandatory and the rest of which are optional:
1. A character string giving the name of the input ASCII file.
2. The directory in which to write the output file. By default this is the current directory.
3. The maximum number of events to process. The default value will cause the macro to process all events in the input file.
4. The name of a log file, from which it will attempt to extract information about the generated cross section. By default BuildTree will attempt to locate a log file automatically based on the name of the input ASCII file.
Note that you do not need to specify which Monte Carlo generators was used to generate the events; the common ASCII format specifies the generator in the input file. For example, to process the first 100,000 events in the file "myPythiaEvents.txt":
root [1] BuildTree("myPythiaEvents.txt", ".", 100000);
This will generate a ROOT file named "myPythiaEvents.root" in the current directory containing. The total number of events and particles processed and the running time are printed to the screen when the function completes. An example of running BuildTree() is included in the distribution in a macro named build.cxx.
## Data Format
The output file contains a TTree named EICTree. Each entry in the TTree is a single event. The event contains two parts:
1. A collection of event-wise properties, such as event number, process ID and kinematics quantities.
2. A list of all the particles in the event.
The format of the particles is common to all the generators, while the event variables typically differ between generators, though some are common to one or more. Events from each generator are described by their own C++ class. All classes are contained in the erhic namespace to avoid clashing with other code (though the main BuildTree routine remains in the global namespace). For example, erhic::EventPythia describes a PYTHIA event, while erhic::EventDjangoh describes a DJANGOH event. Particles are described by a C++ class named erhic::ParticleMC. A simple way to view descriptions of the variables stored in an event are to create an object of the appropriate type in ROOT and call its Dump() method:
root [0] erhic::EventPythia event
root [1] event.Dump()
==> Dumping object at: 0x000000017e4bf490, name=erhic::EventPythia, class=erhic::EventPythia
nucleon 2147483647 /< PDG code of the hadron beam,
tgtparton 2147483647 /< PDG code of the struck parton
…
Each variable in the event is listed along with a description. Please see the class documentation for full descriptions of the classes.
root[1] EICTree->Draw("theta","id==11 && QSquared>1.");
| 2022-12-06T10:42:28 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.32049551606178284, "perplexity": 1984.3467303611455}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446711077.50/warc/CC-MAIN-20221206092907-20221206122907-00295.warc.gz"}
|
http://lammps.sandia.gov/doc/bond_nonlinear.html
|
bond_style nonlinear/omp command
Syntax
bond_style nonlinear
Examples
bond_style nonlinear
bond_coeff 2 100.0 1.1 1.4
Description
The nonlinear bond style uses the potential
to define an anharmonic spring (Rector) of equilibrium length r0 and maximum extension lamda.
The following coefficients must be defined for each bond type via the bond_coeff command as in the example above, or in the data file or restart files read by the read_data or read_restart commands:
• epsilon (energy)
• r0 (distance)
• lamda (distance)
Styles with a gpu, intel, kk, omp, or opt suffix are functionally the same as the corresponding style without the suffix. They have been optimized to run faster, depending on your available hardware, as discussed in Section 5 of the manual. The accelerated styles take the same arguments and should produce the same results, except for round-off and precision issues.
These accelerated styles are part of the GPU, USER-INTEL, KOKKOS, USER-OMP and OPT packages, respectively. They are only enabled if LAMMPS was built with those packages. See the Making LAMMPS section for more info.
You can specify the accelerated styles explicitly in your input script by including their suffix, or you can use the -suffix command-line switch when you invoke LAMMPS, or you can use the suffix command in your input script.
See Section 5 of the manual for more instructions on how to use the accelerated styles effectively.
Restrictions
This bond style can only be used if LAMMPS was built with the MOLECULE package. See the Making LAMMPS section for more info on packages.
| 2017-10-17T03:45:31 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5036051273345947, "perplexity": 4138.000252791055}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187820700.4/warc/CC-MAIN-20171017033641-20171017053641-00046.warc.gz"}
|
https://pvx.fandom.com/wiki/User_talk:Dandybot/Archive_16
|
## FANDOM
2,129 Pages
This is an archive of past discussions. Do not edit the contents of this page. If you wish to start a new discussion or revive an old one, please do so on the current talk page.
## Dear PvX
I have to confess that my homosexuality is nothing but a low joke, and that I am actually straight and normal like most other normal men are. It started off as a simple inside joke from my "Chaos is gay" signature, but soon grew to epic proportions and running out of hands, stirring a lot of drama around both GWW, and to a lesser extent PvX. Since I'm quite inactive on both sites I figured it doesn't really matter much what I tell people. People thinking I'm homosexual has just created a barrier between me and them, hampering my everyday discussions with people. --Chaos? 09:17, April 1, 2010 (UTC)
I knew this, also first.--GWPirate 09:34, April 1, 2010 (UTC)
Faggot. :o --Chaos? -- 09:47, April 1, 2010 (UTC)
</3 Steamy:> 10:00, April 1, 2010 (UTC)
It was a fucking great pun, appreciate it. --Chaos? -- 10:10, April 1, 2010 (UTC)
You've shattered my hopes and dreams chaos. Steamy:> 10:19, April 1, 2010 (UTC)
"Not that there is anything wrong with that"---XTREME 10:20, April 1, 2010 (UTC)
Homosexuality is a horrible thing and I regret ever fucking another man pretending that I'm gay. --Chaos? -- 14:50, April 1, 2010 (UTC)
Intolerance: 5 energy, 2 second cast time, 15 second recharge| Offend target gay community, if target was under the effects of a hex or condition, you take 999 damage. Steamy:> 14:57, April 1, 2010 (UTC)
Aegis (PvP): 10 energy, 1/4 second cast time, 30 second recharge| Enchantment Spell. For 1...3...3 seconds, hostile spells and attacks against target other party member fail. --GWPirate 15:19, April 1, 2010 (UTC)
I lol'd. Steamy:> 16:17, April 1, 2010 (UTC)
## Epic cool story bro right here
I shit you not! --Chaos? -- 19:57, April 1, 2010 (UTC)
Needs more IGN. Steamy Igloo! 15:12, April 2, 2010 (UTC)
It's kind of "Chaos Messenger" or anything related to Dandy ;o My IGN is mostly useless thogh, I haven't played for at least a month :> --Chaos? -- 15:14, April 2, 2010 (UTC)
Your pissing on my hopes for playing random gimmicky shit with you :< Steamy Igloo! 15:16, April 2, 2010 (UTC)
My MSN is on my userpage, you can always ask me online if you want to come up with something fucked up. My focus will be terrible though because I really gilwor about gil wors <3 --Chaos? -- 15:36, April 2, 2010 (UTC)
This proves how bad players in gw are: Just got to golden gates without skipping with hench backline and 2 PvEers running RoJ. Wut? --Steamy Igloo! 15:55, April 2, 2010 (UTC)
ahahhhahahahahahhahhahaahahahahahaahahahahahahahaha gil wor :> --Chaos? -- 16:05, April 2, 2010 (UTC)
:P now we have a para hench and still winning. This is fucking hillarious.. --Steamy Igloo! 16:48, April 2, 2010 (UTC)
Easter weekend or sth, I don't think serious teams are on atm. --Chaos? -- 17:09, April 2, 2010 (UTC)
Or just guildwars is having the final nail knocked into its coffin.. --Steamy Igloo! 17:15, April 2, 2010 (UTC)
Somebody said they wanted you to have a look at this: [1] --Steamy Igloo! 10:59, April 3, 2010 (UTC)
Olol internet fame :> --Chaos? -- 10:33, April 4, 2010 (UTC)
See if your still smiling when your getting a dozen requests a day :> --Steamy Igloo! 11:47, April 4, 2010 (UTC)
It took me a little eternity to answer to this one. I'm also terrible at PvE :> --Chaos? -- 12:01, April 4, 2010 (UTC)
I used to be half decent but now that i quit it i did like 1 vq a week ago with a friend and i was terribad. --Steamy Igloo! 13:16, April 4, 2010 (UTC)
Everyone on PvX is rusty and terribad <3 --Chaos? -- 13:44, April 4, 2010 (UTC)
I just spent about 3 hours farming gvg zquest with 2 terribad monks and 6 MB ele's in a rank 2000 odd guild. Wtf. So fun though, we kept coming up against hench that balled and spiking down like 4-5 hench in 1 go :P fun times --Steamy Igloo! 15:48, April 4, 2010 (UTC)
Rank 2000 ;p no wonder? --Chaos? -- 17:49, April 4, 2010 (UTC)
Made a random new guild and resigned about 10 or so times at the start to get low rank then resigned every time we came up a guild better than rank 1000 :P we won most games inside a minute from them resigning was actually incredibly fast :P --Steamy Igloo! 22:23, April 4, 2010 (UTC)
That's kinda sad, but farming is farming! :D --Chaos? -- 07:45, April 5, 2010 (UTC)
gogo only working RA rit healer [2] :DOcirne23 10:50, April 5, 2010 (UTC)
I'd drop Rejuv, you don't want to spend so much time casting spirits, since you want to be the only healer, and the healing isn't that strong on Rejuv. Your build is also quite fucked up without a spirit, so then again relying solely on Life is bad, because in really tight situations you won't have time to cast it, but will likely have to. Without Rejuv you can also remove only 1 condition, which also kinda sucks, since getting covered conditions off is cool. It's a vicious circle, not so good ;p --Chaos? -- 11:36, April 5, 2010 (UTC)
Well, Rejuvenvenation is in my opinion the best spirit to have, mainly because its very large amount of health and it usually always lasts its rechage in RA, and having +5 regeneration on everyone is kewl ^.^ its basically an arena version of recuperation in GvG only better xD. Perhaps i should drop a spirit and get some item spellsOcirne23 12:05, April 5, 2010 (UTC)
I'm still damning the PwK nerf, even though the skill was too good. --Chaos? -- 09:02, April 6, 2010 (UTC)
## Musha rain dum a doo, dum a da...
Whack for my daddy, oh!--GWPirate 11:01, April 7, 2010 (UTC)
Reference missed :< --Chaos? -- 12:07, April 7, 2010 (UTC)
Whack for my daddy, oh! Whiskey in the Jarro. $Dandy=Faggotry , Dandy-Faggotry=0$
My god, it's genial. --Chaos? -- 12:33, April 7, 2010 (UTC)
As i was goin' over the Cork and Kerry mountains--GWPirate 14:54, April 7, 2010 (UTC)
I saw Captain Farrell and his money, he was countin'--GWPirate 14:54, April 7, 2010 (UTC)
Wow, just wow... --(Talk) 18:54, April 7, 2010 (UTC)
wat is dis i dont even --Chaos? -- 19:08, April 7, 2010 (UTC)
Somebody should know this songtext.--GWPirate 19:47, April 7, 2010 (UTC)
i hope they're just being retarded. if not, here is a cover version by the cutest band in the world. - AthrunFeya - 20:12, April 7, 2010 (UTC)
Typical faggot band.--GWPirate 20:16, April 7, 2010 (UTC)
## Maybe another time i'll post you a funny pic.
--SteamyIgloo! 19:50, April 7, 2010 (UTC)
## Storeh Tiem
One day there was a homo really cool kid, named Dandy, he disliked his personality so he went on to download a new personality, where he purchsed at the personality shop.
This shop sells one any personality they want, but at the expense of years off the buyer's total life span.
Dandy still disliked his personality and continued downloading more personalities until he realised the person most important to him, disliked the new personality Dandy had, evoking rage from deep within Dandy's small heart.
Going into ragemode, everything around Dandy was crushed by his super-sayan like powers, including the person most important to him. Feeling insane and completely terrible, Dandy rushed to the personality shop and asked to buy a personality with resurrection skills, which would consume all the rest of his life span.
In doing so, Dandy brought back the person most important to him using his new personality, resulting in Dandy's death.
Fortunately, for having such a pure soul, Dandy was given back his years, returned to normal, and everyone had forgotten of what happened.
Also, Saturday night, mmhhmmmmmmmmmmmmmmmmmmmmmmmm
THE END. --68.226.82.66 22:58, April 8, 2010 (UTC)
^ reminds me of that motivational poster we made dandy.. --SteamyIgloo! 23:06, April 8, 2010 (UTC)
I stole the joke :>>>>>>>>>>>>>>>>>>> --Chaos? -- 09:36, April 9, 2010 (UTC)
Also, the now alive Dandy suddenly had a ton of personalities he didn't do shit with :> Beautiful story! --Chaos? -- 09:36, April 9, 2010 (UTC)
Stealin ma joke nigga? --SteamyIgloo! 12:45, April 9, 2010 (UTC)
I PUT IT IN A BETTER WAY THAN YOU EVER WOULD HAVE DONE, AND MOTIVATIONAL POSTERS ARE LOL ANYWAYS. --Chaos? -- 21:34, April 9, 2010 (UTC)
Nevermind, he loves all of his 11+ personalities. I happened to count them today when me and my sister happened to discuss all the acting and lying and double lives we've been living ;o "Double" isn't very accurate though <3 Chaos? -- --21:34, April 9, 2010 (UTC)
Chaos is superman?--GWPirate 20:24, April 10, 2010 (UTC)
It was a symbolical reference to my latex suit and you know it. --Chaos? -- 20:28, April 10, 2010 (UTC)
## The lie must stop
I know who you are. Docta Jenkins 01:53, April 12, 2010 (UTC)
Nobody does. I took care of that years ago, I personally took care of every last one of them. --Chaos? -- 07:06, April 12, 2010 (UTC)
I know of your noodley appendage. You can never kill us all. Docta Jenkins 07:31, April 12, 2010 (UTC)
It doesn't take very much from me to cockslap you all to death. --Chaos? -- 09:12, April 12, 2010 (UTC)
His name is dandyel :D?--GWPirate 15:36, April 12, 2010 (UTC)
Dandyel, Dandybot, Dandycock. It's all the same Dandy. --Chaos? -- 19:32, April 12, 2010 (UTC)
Dandy0r? Dandyer, Dandylaser, Dandygilwor, ChAoS dAnDy, Dandy9281736?--GWPirate 20:53, April 12, 2010 (UTC)
Hes well known in america as The Dandyland Cockslapper. Docta Jenkins 21:46, April 12, 2010 (UTC)
OH, and how is he known in holland?--GWPirate 07:23, April 13, 2010 (UTC)
"One drunk high night in Holland". My god, it was amazing. --Chaos? -- 09:47, April 13, 2010 (UTC)
The last one is a cheap copy. No matter how drunk or high or horny or bored or blackmailed, I would never put numbers behind my names. --Chaos? -- 09:47, April 13, 2010 (UTC)
Seems a lie to me, look to the right of Chaos--GWPirate 13:53, April 13, 2010 (UTC)
Science just won this battle it seems. Vincent Evan [Air Henchman] 20:01, April 13, 2010 (UTC)
;o? --Chaos? -- 06:10, April 14, 2010 (UTC)
Science always does :> --Chaos? -- 06:10, April 14, 2010 (UTC)
standard page is standard, and probably boring too. --SteamyIgloo! 18:03, April 14, 2010 (UTC)
But a bad page is bad. --Chaos? -- 18:51, April 14, 2010 (UTC)
Needs more trolling. --SteamyIgloo! 18:54, April 14, 2010 (UTC)
Alright then, Dandy! You have bad hair! How was that? Vincent Evan [Air Henchman] 19:15, April 14, 2010 (UTC)
In-fucking-credible, because Eddie Izzard told me its like 70% how you look, 20% how you sound and 10% what you say and your sexy with a sexy voice so even though your talking shit your still epic at trolling. --SteamyIgloo! 19:34, April 14, 2010 (UTC)
## That image
How'd you know I made it?--Ikimono...And my Axe! 14:20, April 15, 2010 (UTC)
I actually found it so fucking hilarious that I uploaded it myself there ;o it's a Finnish imageboard for funny shit, and I finally found something epic worth posting. Hope you don't mind? :> I know how you dislike Lilondra using that sig pic ;o --Chaos? -- 15:16, April 15, 2010 (UTC)
Finimgboard? finchan?--GWPirate 15:31, April 15, 2010 (UTC)
Hell no I do not mind one bit. And I didn't mind Lilondra using that image for their sig at all; just wanted them to tell me they were going to use it.--Ikimono...And my Axe! 23:20, April 15, 2010 (UTC)
;p People don't really think it's necessary, but getting credit is always cool. --Chaos? -- 07:53, April 16, 2010 (UTC)
/wave --Steamy..x
^___________^ --Chaos? -- 07:53, April 16, 2010 (UTC)
ups--Relyk talk 23:10, April 18, 2010 (UTC)
;p Will take care of. --Chaos? -- 08:02, April 19, 2010 (UTC)
http://www.youtube.com/watch?v=TKTIfXTd32M Reminded me of you. >_> --Ikimono...And my Axe! 04:48, April 21, 2010 (UTC)
Hilarious. I thought you loved me, though :< --Chaos? -- 07:23, April 21, 2010 (UTC)
## Dandy
I have stuff you might like first off, google images-> dan dyer (dandyer looololololo) second off, http://www.youtube.com/watch?v=phyqA1qTBKk
Amazingly diverse bass beat =/ --Chaos? --
## RE: Msn
14 Forest-Upon-Lake
Somewhere in Finland
P070 7US
DANDY THERE SEEMS TO BE A SEVERE PROBLEM WITH THE PRESENT STATE OF OUR RELATIONSHIP AS I SEEM TO BE VISITING THE CERTAIN COMMUNICATION APPLICATION NAMED WINDOWS LIVE MESSENGER HOWEVER WHEN I VIEW MY CONTACTS I AM CURRENTLY SEEING A SEVERE LACK OF DANDY. I NEED TO REMEDY THIS IMMEDIATELY OTHERWISE MY MSN MAY CONTRACT MANY DISEASES NAMELY AUTISM AND STUPIDITY WHICH IT IS ALREADY IN DANGER OF CATCHING FROM ME. ALSO I WOULD LIKE TO SHARE THIS DEFINITION OF A WALL OF TEXT I WAS LUCKY TO STUMBLE ACROSS LAST NIGHT: A LARGE AND INTIMIDATING PIECE OF WRITING, PARTICULARLY ONE WITH FEW OR NO PARAGRAPH BREAKS.
Love, your dear husband, brother and cousin, Steamy..x
I was afk flipping canoes in (rapid) rivers. Was fucking cold, but thank god for sauna's hypothermia ^___^ --Chaos? -- 14:34, April 24, 2010 (UTC)
You are excused. :> --Steamy..x 14:35, April 24, 2010 (UTC)
Now how comes you're on PvX but not msn? ;< --Chaos? -- 14:40, April 24, 2010 (UTC)
Was in tombz running some funny para spike and msn makes me lagg, was 1 tpiy para with a load of refrains, 1 shatter storm para, 1 PoD para, 1 MoI, 1 magehunter smash war (protknock olol), OoS with CS, LS, HB :> was very VERY cute. --Steamy..x 14:43, April 24, 2010 (UTC)
Steamy so paraspike ;o --Chaos? -- 14:44, April 24, 2010 (UTC)
I received many compliments today and yesterday :> i wonder why? I'm not playing in mAT today though :< this is very upsetting. --Steamy..x 14:50, April 24, 2010 (UTC)
## Dear Dandy and Lurkers
I suggest you check this: http://pvx.wikia.com/wiki/Build:A/P_Critical_Spear_Hero --GWPirate 20:58, April 27, 2010 (UTC)
People keep dragging me to have a look at PvE builds :< --Chaos? -- 10:54, April 28, 2010 (UTC)
Shut up and take your buttrape Internet Fame thankfully--GWPirate 14:49, April 28, 2010 (UTC)
Its just you, hes thankful to me for buttrape Internet Fame. --Steamy..x 14:51, April 28, 2010 (UTC)
When i give him buttrape Internet Fame he never looks thankfully--GWPirate 14:52, April 28, 2010 (UTC)
I'd be thankful if you gave me buttrape Internet Fame :> --Steamy..x 14:54, April 28, 2010 (UTC)
I Guess your Iglo is Steamy because of the hot buttrape Internet Fame--GWPirate 14:54, April 28, 2010 (UTC)
Why Watson, your conclusions on buttrape Internet Fame may just prove right! --Steamy..x 14:56, April 28, 2010 (UTC)
I think Chaos might like all this buttrape Internet Fame on his talk page.--GWPirate 14:57, April 28, 2010 (UTC)
buttrape Internet Fame is a very good thing to have on your talk page. --Steamy..x 15:01, April 28, 2010 (UTC)
I think i'd like some buttrape Internet Fame myself, you think Chaos is willing to give?--GWPirate 15:02, April 28, 2010 (UTC)
Chaos, somebody is begging you for buttrape Internet Fame, please respond? --Steamy..x 15:09, April 28, 2010 (UTC)
Nothing comes free. A favor for a favor, you know? --Chaos? -- 15:13, April 28, 2010 (UTC)
You scratch my back, i rub your cock ye? --Steamy..x 15:15, April 28, 2010 (UTC)
I want buttrape internet fame. MIDOINITRITE? --Amor 15:56, April 28, 2010 (UTC)
Watch the responses. If people laugh, you did it right. If you make yourself seem autistic, well.. it's not exactly like you'll stick out of the crowd. --Chaos? -- 16:01, April 28, 2010 (UTC)
Chaos giving buttrape Internet Fame lessons <33333--GWPirate 16:10, April 28, 2010 (UTC)
Just post 10k comments, it usually does it. --Chaos? -- 16:13, April 28, 2010 (UTC)
KJ told me to use the default whatever it is wiki format so i can no longer check how many you have, are you at 10k yet? --Steamy..x 16:15, April 28, 2010 (UTC)
Monobook is cool, just look around special pages if you really care, but essentially Frosty will be a ton of edits before me for another while, because housekeeping and dat shit. --Chaos? -- 16:25, April 28, 2010 (UTC)
And because im num 1 rc stalk? --Frosty 17:19, April 28, 2010 (UTC)
I contest that, though lately I've been pretty disappointing, so at least now, yes. --Chaos? -- 18:05, April 28, 2010 (UTC)
May Day / Labor Day / Walpurgis Night / the first of May. Good times! --Chaos? -- 08:41, May 1, 2010 (UTC)
And why are you so happy exactly? --(Talk) 19:31, May 1, 2010 (UTC)
In Finland this day basically means that everyone is drunk as hell. --Chaos? -- 23:04, May 1, 2010 (UTC)
Everyone?--Bluetapeboy 00:01, May 2, 2010 (UTC)
Well, I came to Helsinki to find the streets full of shouting and laughing people who can't walk entirely straight. But of course not every single soul. --Chaos? -- 10:42, May 2, 2010 (UTC)
i wasnt drunk Novii 00:12, May 2, 2010 (UTC)
O_______o Why? ;p Serious question too. --Chaos? -- 10:42, May 2, 2010 (UTC)
dumb question. i was playing gildwars ofc Novii 10:57, May 2, 2010 (UTC)
lol --Chaos? -- 11:06, May 2, 2010 (UTC)
i thought that was most days.. - AthrunFeya - 12:44, May 2, 2010 (UTC)
Busted. This is (most days)^3, though. --Chaos? -- 13:07, May 2, 2010 (UTC)
FC Twente winning the eredivisie->Everybody in east holland drunk for at least 1 week--GWPirate 09:08, May 3, 2010 (UTC)
Hahhaha --Chaos? -- 09:09, May 3, 2010 (UTC)
## i just noticed
that the image above your Archives is a Pink Purse. That it was like the top of an Image of some Guy in a Pink Robe and a hood >.> my Stupidity still haunts me--Bluetapeboy 19:43, May 3, 2010 (UTC)
Are you German or something, with randomly capitalizing words? :>
Also, I don't really get what you're saying ;p Random associations? --Chaos? -- 20:38, May 3, 2010 (UTC)
wtf? no. --Steamy..x 20:51, May 3, 2010 (UTC)
Germans capitalize every object (Like: Chaos hat eine schone Dick)--GWPirate 21:50, May 3, 2010 (UTC)
It's called a "Noun", and I know that. I even know that Luther started the habit. Dum nob :< Lost me many points in exams because I, y'no, suck at German for not reading to exams. --Chaos? -- 09:29, May 4, 2010 (UTC)
Also its schöne --(Talk) 15:44, May 4, 2010 (UTC)
I know, but i dont know how to put an umlaut above my o, "o"o"o"o doesnt work D:!--GWPirate 15:50, May 4, 2010 (UTC)
## Srsly
I just had to show you [3] --(Talk) 19:46, May 6, 2010 (UTC)
Should I open that in noscript? Brandnew 20:15, May 6, 2010 (UTC)
No :o --(Talk) 20:22, May 6, 2010 (UTC)
Oh. Wow. It really doesn't end in a goatse, does it? I don't think it needs to, it's pretty funny as it is :> --Chaos? -- 04:39, May 7, 2010 (UTC)
## Dear faggot Dandy faggot
Ris has been epic busy. D: And now has many exams and shit. I will have to update you on my epic wins at life at some point. LessQQ moreQQ 22:45, May 6, 2010 (UTC) Also.
I WANNA BE THE VERY BEST, LIKE NO-ONE EVER WAS. TO CATCH THEM IS MY REAL TEST, TO TRAIN THEM IS MY CAUSE. I WILL TRAVEL ACROSS THE LAND, SEARCHING FAR AND WIDE, EACH POKÉMON TO UNDERSTAND THE POWER THAT'S INSIDE!
POKÉMON! IT'S YOU AND ME! I KNOW IT'S MY DESTINY! OOOH YOU'RE MY BEST FRIEND, IN A WORLD WE MUST DEFEND! POKÉMON! A HEART SO TRUE! OUR COURAGE WILL PULL US THROUGH, YOU TEACH ME AND I'LL TEACH YOU! POKÉMON!
(Gotta catch them all, gotta catch them all! Yeaaaah.)
EVERY CHALLENGE ALONG THE WAY, WITH COURAGE I WILL FACE. I WILL BATTLE EVERYDAY, TO CLAIM MY RIGHTFUL PLACE! COME WITH ME, THE TIME IS RIGHT, THERE'S NO BETTER TEAM! ARM IN ARM WE'LL WIN THE FIGHT, IT'S ALWAYS BEEN OUR DREAM!
POKÉMON! IT'S YOU AND ME! I KNOW IT'S MY DESTINY! OOOH YOU'RE MY BEST FRIEND, IN A WORLD WE MUST DEFEND! POKÉMON! A HEART SO TRUE! OUR COURAGE WILL PULL US THROUGH, YOU TEACH ME AND I'LL TEACH YOU! POKÉMON!
(Gotta catch them all, gotta catch them all.) GOTTA CATCH THEM ALL! GOTTA CATCH THEM ALL! YEEAH!
POKÉMON! IT'S YOU AND ME! I KNOW IT'S MY DESTINY! OOOH YOU'RE MY BEST FRIEND, IN A WORLD WE MUST DEFEND! POKÉMON! A HEART SO TRUE! OUR COURAGE WILL PULL US THROUGH, YOU TEACH ME AND I'LL TEACH YOU! POKÉMON!
GOTTA CATCH THEM ALL! GOTTA CATCH THEM ALL! POKÉMON!
P.S. The hills are lonely without you. D': LessQQ moreQQ 22:45, May 6, 2010 (UTC)
^_______^ I've also missed you, Ris! --Chaos? -- 04:39, May 7, 2010 (UTC)
Dis? --(Talk) 13:09, May 10, 2010 (UTC)
Are you new to the internet or something? Also, don't post that shit on pvx. -Auron 13:16, May 10, 2010 (UTC)
I swear to god, my page is all about the shit that shouldn't be posted on PvX. --Chaos? -- 14:48, May 10, 2010 (UTC)
It gets you your buttrape Internet Fame--GWPirate 20:46, May 10, 2010 (UTC)
We already pounded that butt joke to exhaustion --Steamy..x 20:48, May 10, 2010 (UTC)
Twas fun <3--GWPirate 07:16, May 11, 2010 (UTC)
Blah. --Chaos? -- 10:25, May 11, 2010 (UTC)
▲ ▲--GWPirate 17:05, May 11, 2010 (UTC)
lol --Frosty 17:07, May 11, 2010 (UTC)
I just copyed it from here how can it fail?--GWPirate 17:13, May 11, 2010 (UTC)
because newfags can't triforce! --Frosty 17:15, May 11, 2010 (UTC)
Then the link lied D:--GWPirate 17:17, May 11, 2010 (UTC)
please dont triforce without my permission --Angelus 17:17, May 11, 2010 (UTC)
Its an abomination not a triforce?--GWPirate 17:18, May 11, 2010 (UTC)
please leave --Angelus 17:21, May 11, 2010 (UTC)
I'm gonna call that the link is a rick roll and Mr Pirate is a tool! --Frosty 17:35, May 11, 2010 (UTC)
Gotcha ;D!--GWPirate 17:36, May 11, 2010 (UTC)
didn't even click it. i no longer fall for rock rolls --Angelus 17:37, May 11, 2010 (UTC)
Prove it--GWPirate 17:38, May 11, 2010 (UTC)
▲ ▲
▲
▲ ▲
oh yeahh Vincent Evan [Air Henchman] 19:11, May 11, 2010 (UTC)
ur on pvx but not gw, whore [đarkchaoş] 19:23, May 11, 2010 (UTC)
I have some free time for now, GW can't be played on my computer. You know that rift. Vincent Evan [Air Henchman] 19:26, May 11, 2010 (UTC)
why is your page always so filthy? :< --Steamy..x 20:00, May 11, 2010 (UTC)
Community content is available under CC-BY-NC-SA 2.5 unless otherwise noted.
| 2020-07-10T20:32:42 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4933246076107025, "perplexity": 12270.37238387325}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-29/segments/1593655911896.73/warc/CC-MAIN-20200710175432-20200710205432-00136.warc.gz"}
|
http://publications.jrc.ec.europa.eu/repository/handle/JRC60147
|
Title: Partial order investigation of multiple indicator systems using variance based sensitivity analysis Authors: ANNONI Paola; BRÜGGEMANN Rainer; SALTELLI Andrea Citation: ENVIRONMENTAL MODELLING & SOFTWARE vol. 26 no. 7 p. 950-958 Publisher: ELSEVIER SCI LTD Publication Year: 2011 JRC N°: JRC60147 ISSN: 1364-8152 URI: http://www.elsevier.com/locate/envsofthttp://publications.jrc.ec.europa.eu/repository/handle/JRC60147 DOI: 10.1016/j.envsoft.2011.01.008 Type: Articles in periodicals and books Abstract: Partial order tools can be used in multiple criteria analysis to prioritize and rank a set of objects. In this setting the starting point is generally a matrix $\mathbf{M}_{n \mathrm{x} k}$ of $k$ observed indicators on $n$ objects. Given that indicators are measured at least at the ordinal level, from matrix $\mathbf{M}$ its corresponding partially ordered set - poset - is set up to form the basis of multi-criteria ranking. The partial order may be very complex even when the number of objects to be compared is relatively small. The reason of such complexity is often due to the intrinsic nature of partial order which is exclusively based on the ordinal properties of the data matrix. Incomparabilities between objects can be due even to very small differences in the observed values of indicators thus causing \lq irrelevant' incomparabilities. Also, objects may have been characterized with a redundant set of variables so that the change in the values of some indicators should not seriously affect the structure of the poset. These two opposite conditions are directly linked to the indicator level of influence and call for an indicator value related sensitivity analysis for testing the robustness of posets. In this work we propose a method to carry out a sensitivity analysis for posets by using variance-based sensitivity indices to detect main effects and interactions between indicators. To this aim, we characterize the poset structure with scalar measures and compute variance-based sensitivity indices according to the most recent practice for a fully exploratory sensitivity analysis. These indices allow for detecting least and most influencing indicators. JRC Institute: Institute for the Protection and Security of the Citizen
Files in This Item:
There are no files associated with this item.
| 2016-05-04T04:13:34 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6536813974380493, "perplexity": 924.038889454235}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2016-18/segments/1461860122501.26/warc/CC-MAIN-20160428161522-00125-ip-10-239-7-51.ec2.internal.warc.gz"}
|
https://dust.trainhub.eumetsat.int/docs/exercise_3.html
|
# Exercise 3¶
With exercise #1 and exercise #2, you compared two dust forecast models as well as near real-time monitoring with satellite data. From the results of the assignment, you see that it is difficult to know which forecast can be trusted more. Hence, even though model intercomparison is important, model outcomes also have to be compared with real-world observations. Just by comparing model outcomes with measurements from station data, we can better understand how the model performs.
Today, you will focus on how you can use station observations from AERONET to evaluate model forecasts.
1. Brainstorm
• What observation datasets do you know about?
• Which variables do they measure?
• Which data can you use to evaluate model predictions?
2. Download and plot time-series of AERONET data for Santa Cruz, Tenerife
• Download and visualise AERONET v3.0 measurements of the station Santa Cruz, Tenerife for 21 to 25 February 2020.
• Some questions to reflect on
• Under which name is the station listed in AERONET?
• What average level would you choose?
• Which days do we have observations for?
• Hint
3. Resample AERONET data to a 3-hourly resolution
• Make use of AERONET index and time columns to create a DateTimeIndex in order to resample the observations to a 3-hourly temporal resolution
• Hint
• you have to combine the two columns index and time as one string variable
• you can use the pandas function to_datetime() to create a DateTimeIndex and the function resample().mean() to resample and average the time-series to a given temporal resolution
• Question to reflect on
• How many row entries does the resampled data frame have?
4. Load time-series of the forecasts from CAMS and the MONARCH model and compare it with the AERONET observations
• Interpret the plotting result.
• Can you make a statement of the performance of the two forecast models?
• What is your conclusion regarding AERONET observation data?
| 2023-03-22T04:03:27 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.48227018117904663, "perplexity": 3157.3117124785394}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296943749.68/warc/CC-MAIN-20230322020215-20230322050215-00376.warc.gz"}
|
https://dlmf.nist.gov/36.5
|
# §36.5 Stokes Sets
## §36.5(i) Definitions
Stokes sets are surfaces (codimension one) in $\mathbf{x}$ space, across which $\Psi_{K}(\mathbf{x};k)$ or $\Psi^{(\mathrm{U})}(\mathbf{x};k)$ acquires an exponentially-small asymptotic contribution (in $k$), associated with a complex critical point of $\Phi_{K}$ or $\Phi^{(\mathrm{U})}$. The Stokes sets are defined by the exponential dominance condition:
36.5.1 $\displaystyle\Re\left(\Phi_{K}\left(t_{j}(\mathbf{x});\mathbf{x}\right)-\Phi_{% K}\left(t_{\mu}(\mathbf{x});\mathbf{x}\right)\right)$ $\displaystyle=0,$ $\displaystyle\Re\left(\Phi^{(\mathrm{U})}\left(s_{j}(\mathbf{x}),t_{j}(\mathbf% {x});\mathbf{x}\right)-\Phi^{(\mathrm{U})}\left(s_{\mu}(\mathbf{x}),t_{\mu}(% \mathbf{x});\mathbf{x}\right)\right)$ $\displaystyle=0,$
where $j$ denotes a real critical point (36.4.1) or (36.4.2), and $\mu$ denotes a critical point with complex $t$ or $s,t$, connected with $j$ by a steepest-descent path (that is, a path where $\Re\Phi=\mathrm{constant}$) in complex $t$ or $(s,t)$ space.
In the following subsections, only Stokes sets involving at least one real saddle are included unless stated otherwise.
## §36.5(ii) Cuspoids
### $K=1$. Airy Function
The Stokes set consists of the rays $\operatorname{ph}x=\pm 2\pi/3$ in the complex $x$-plane.
### $K=2$. Cusp
The Stokes set is itself a cusped curve, connected to the cusp of the bifurcation set:
36.5.2 $y^{3}=\tfrac{27}{4}\left(\sqrt{27}-5\right)x^{2}=1.32403x^{2}.$ ⓘ Symbols: $y$: real parameter and $x$: real parameter Permalink: http://dlmf.nist.gov/36.5.E2 Encodings: TeX, pMML, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
### $K=3$. Swallowtail
The Stokes set takes different forms for $z=0$, $z<0$, and $z>0$.
For $z=0$, the set consists of the two curves
36.5.3 $\displaystyle x$ $\displaystyle=B_{\pm}|y|^{4/3},$ $\displaystyle B_{\pm}$ $\displaystyle=10^{-1/3}\left(2x_{\pm}^{4/3}-\tfrac{1}{2}x_{\pm}^{-2/3}\right),$ ⓘ Symbols: $y$: real parameter, $x_{i}$: real parameter and $x$: real parameter Permalink: http://dlmf.nist.gov/36.5.E3 Encodings: TeX, TeX, pMML, pMML, png, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
where $x_{\pm}$ are the two smallest positive roots of the equation
36.5.4 $80x^{5}-40x^{4}-55x^{3}+5x^{2}+20x-1=0,$ ⓘ Symbols: $x$: real parameter Permalink: http://dlmf.nist.gov/36.5.E4 Encodings: TeX, pMML, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
and
36.5.5 $\displaystyle B_{-}$ $\displaystyle=-1.69916,$ $\displaystyle B_{+}$ $\displaystyle=0.33912.$ ⓘ Permalink: http://dlmf.nist.gov/36.5.E5 Encodings: TeX, TeX, pMML, pMML, png, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
For $z\neq 0$, the Stokes set is expressed in terms of scaled coordinates
36.5.6 $\displaystyle X$ $\displaystyle=x/z^{2},$ $\displaystyle Y$ $\displaystyle=y/|z|^{3/2},$ ⓘ Defines: $X$: scaled coordinate (locally) and $Y$: scaled coordinate (locally) Symbols: $y$: real parameter, $z$: real parameter and $x$: real parameter Referenced by: §36.5(ii) Permalink: http://dlmf.nist.gov/36.5.E6 Encodings: TeX, TeX, pMML, pMML, png, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
by
36.5.7 $X=\dfrac{9}{20}+20u^{4}-\frac{Y^{2}}{20u^{2}}+6u^{2}\operatorname{sign}\left(z% \right),$
where $u$ satisfies the equation
36.5.8 $16u^{5}-\frac{Y^{2}}{10u}+4u^{3}\operatorname{sign}\left(z\right)-\frac{3}{10}% |Y|\operatorname{sign}\left(z\right)+4t^{5}+2t^{3}\operatorname{sign}\left(z% \right)+|Y|t^{2}=0,$ ⓘ Symbols: $\operatorname{sign}\NVar{x}$: sign of $x$, $z$: real parameter, $t$: variable and $Y$: scaled coordinate Permalink: http://dlmf.nist.gov/36.5.E8 Encodings: TeX, pMML, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
in which
36.5.9 $t=-u+\left(\dfrac{|Y|}{10u}-u^{2}-\dfrac{3}{10}\operatorname{sign}\left(z% \right)\right)^{1/2}.$ ⓘ Symbols: $\operatorname{sign}\NVar{x}$: sign of $x$, $z$: real parameter, $t$: variable and $Y$: scaled coordinate Referenced by: §36.5(ii) Permalink: http://dlmf.nist.gov/36.5.E9 Encodings: TeX, pMML, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
For $z<0$, there are two solutions $u$, provided that $|Y|>(\frac{2}{5})^{1/2}$. They generate a pair of cusp-edged sheets connected to the cusped sheets of the swallowtail bifurcation set (§36.4).
For $z>0$ the Stokes set has two sheets. The first sheet corresponds to $x<0$ and is generated as a solution of Equations (36.5.6)–(36.5.9). The second sheet corresponds to $x>0$ and it intersects the bifurcation set (§36.4) smoothly along the line generated by $X=X_{1}=6.95643$, $\left|Y\right|=\left|Y_{1}\right|=6.81337$. For $\left|Y\right|>Y_{1}$ the second sheet is generated by a second solution of (36.5.6)–(36.5.9), and for $\left|Y\right| it is generated by the roots of the polynomial equation
36.5.10 $160u^{6}+40u^{4}=Y^{2}.$ ⓘ Symbols: $Y$: scaled coordinate Permalink: http://dlmf.nist.gov/36.5.E10 Encodings: TeX, pMML, png See also: Annotations for §36.5(ii), §36.5(ii), §36.5 and Ch.36
## §36.5(iii) Umbilics
### Elliptic Umbilic Stokes Set (Codimension three)
This consists of three separate cusp-edged sheets connected to the cusp-edged sheets of the bifurcation set, and related by rotation about the $z$-axis by $2\pi/3$. One of the sheets is symmetrical under reflection in the plane $y=0$, and is given by
36.5.11 $\frac{x}{z^{2}}=-1-12u^{2}+8u-\left|\frac{y}{z^{2}}\right|\dfrac{\frac{1}{3}-u% }{\left(u\left(\frac{2}{3}-u\right)\right)^{1/2}}.$ ⓘ Symbols: $y$: real parameter, $z$: real parameter and $x$: real parameter Referenced by: §36.5(iv) Permalink: http://dlmf.nist.gov/36.5.E11 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
Here $u$ is the root of the equation
36.5.12 $8u^{3}-4u^{2}-\left|\frac{y}{3z^{2}}\right|\left(\frac{u}{\tfrac{2}{3}-u}% \right)^{1/2}=\frac{y^{2}}{6wz^{4}}-2w^{3}-2w^{2},$ ⓘ Symbols: $y$: real parameter, $z$: real parameter and $w$: quantity Permalink: http://dlmf.nist.gov/36.5.E12 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
with
36.5.13 $w=u-\tfrac{2}{3}+\left(\left(\tfrac{2}{3}-u\right)^{2}+\left|\frac{y}{6z^{2}}% \right|\left(\frac{\frac{2}{3}-u}{u}\right)^{1/2}\right)^{1/2},$ ⓘ Defines: $w$: quantity (locally) Symbols: $y$: real parameter and $z$: real parameter Permalink: http://dlmf.nist.gov/36.5.E13 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
and such that
36.5.14 $0 ⓘ Permalink: http://dlmf.nist.gov/36.5.E14 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
### Hyperbolic Umbilic Stokes Set (Codimension three)
This consists of a cusp-edged sheet connected to the cusp-edged sheet of the bifurcation set and intersecting the smooth sheet of the bifurcation set. With coordinates
36.5.15 $\displaystyle X$ $\displaystyle=(x-y)/z^{2},$ $\displaystyle Y$ $\displaystyle=\tfrac{1}{2}+\left((x+y)/z^{2}\right),$ ⓘ Defines: $X$: scaled coordinate (locally) Symbols: $y$: real parameter, $z$: real parameter and $x$: real parameter Permalink: http://dlmf.nist.gov/36.5.E15 Encodings: TeX, TeX, pMML, pMML, png, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
the intersection lines with the bifurcation set are generated by $|X|=X_{2}=0.45148$, $Y=Y_{2}=0.59693$. Define
36.5.16 $\displaystyle Y(u,X)$ $\displaystyle=8u-24u^{2}+X\dfrac{u-\tfrac{1}{6}}{\left(u\left(u-\tfrac{1}{3}% \right)\right)^{1/2}},$ $\displaystyle f(u,X)$ $\displaystyle=16u^{3}-4u^{2}-\tfrac{1}{6}|X|\left(\dfrac{u}{u-\tfrac{1}{3}}% \right)^{1/2}.$ ⓘ Symbols: $X$: scaled coordinate Permalink: http://dlmf.nist.gov/36.5.E16 Encodings: TeX, TeX, pMML, pMML, png, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
When $|X|>X_{2}$ the Stokes set $Y_{\mathrm{S}}(X)$ is given by
36.5.17 $Y_{\mathrm{S}}(X)=Y(u,|X|),$ ⓘ Symbols: $X$: scaled coordinate Permalink: http://dlmf.nist.gov/36.5.E17 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
where $u$ is the root of the equation
36.5.18 $f(u,X)=f(-u+\tfrac{1}{3},X),$ ⓘ Symbols: $X$: scaled coordinate Permalink: http://dlmf.nist.gov/36.5.E18 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
such that $u>\tfrac{1}{3}$. This part of the Stokes set connects two complex saddles.
Alternatively, when $|X|
36.5.19 $Y_{\mathrm{S}}(X)=Y(-u,-|X|),$ ⓘ Symbols: $X$: scaled coordinate Permalink: http://dlmf.nist.gov/36.5.E19 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
where $u$ is the positive root of the equation
36.5.20 $f(-u,X)=\dfrac{X^{2}}{12w}+4w^{3}-2w^{2},$ ⓘ Symbols: $w$: quantity and $X$: scaled coordinate Permalink: http://dlmf.nist.gov/36.5.E20 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
in which
36.5.21 $w=(\tfrac{1}{3}+u)\left(1-\left(1-\dfrac{|X|}{12u^{1/2}(\tfrac{1}{3}+u)^{3/2}}% \right)^{1/2}\right).$ ⓘ Symbols: $w$: quantity and $X$: scaled coordinate Referenced by: §36.5(iv) Permalink: http://dlmf.nist.gov/36.5.E21 Encodings: TeX, pMML, png See also: Annotations for §36.5(iii), §36.5(iii), §36.5 and Ch.36
## §36.5(iv) Visualizations
In Figures 36.5.136.5.6 the plane is divided into regions by the dashed curves (Stokes sets) and the continuous curves (bifurcation sets). Red and blue numbers in each region correspond, respectively, to the numbers of real and complex critical points that contribute to the asymptotics of the canonical integral away from the bifurcation sets. In Figure 36.5.4 the part of the Stokes surface inside the bifurcation set connects two complex saddles. The distribution of real and complex critical points in Figures 36.5.5 and 36.5.6 follows from consistency with Figure 36.5.1 and the fact that there are four real saddles in the inner regions.
| 2018-06-25T03:45:15 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 155, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9844456315040588, "perplexity": 8576.98163895181}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267867424.77/warc/CC-MAIN-20180625033646-20180625053646-00352.warc.gz"}
|
http://www.itl.nist.gov/div898/handbook/pmd/section8/pmd8127.htm
|
4. Process Modeling
4.8. Some Useful Functions for Process Modeling
4.8.1. Univariate Functions
4.8.1.2. Rational Functions
## Cubic / Quadratic Rational Function
Function: $$\displaystyle f(x) = \frac{\beta_0 + \beta_1x + \beta_2x^2 + \beta_3x^3}{1 + \beta_4x + \beta_5x^2}, \ \ \beta_3 \neq 0, \ \beta_5 \neq 0$$
Function
Family:
Rational
Statistical
Type:
Nonlinear
Domain: $$\displaystyle (-\infty, \infty)$$
with undefined points at
$$\displaystyle x = \frac{-\beta_4 \pm \sqrt{\beta_4^2 - 4\beta_5}} {2\beta_5}$$
There will be 0, 1, or 2 real solutions to this equation corresponding to whether
$$\displaystyle \beta_4^2 - 4\beta_5$$
is negative, zero, or positive.
Range: $$\displaystyle (-\infty, \infty)$$
Special
Features:
Vertical asymptotes at:
$$\displaystyle x = \frac{-\beta_4 \pm \sqrt{\beta_4^2 - 4\beta_5}} {2\beta_5}$$
There will be 0, 1, or 2 real solutions to this equation corresponding to whether
$$\displaystyle \beta_4^2 - 4\beta_5$$
is negative, zero, or positive.
| 2017-10-17T14:57:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6453832387924194, "perplexity": 3429.7197280792307}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187822116.0/warc/CC-MAIN-20171017144041-20171017164041-00140.warc.gz"}
|
https://phys.libretexts.org/Courses/Muhlenberg_College/MC%3A_Physics_121_-_General_Physics_I/01%3A_Units_and_Measurement
|
$$\require{cancel}$$
1: Units and Measurement
The thumbnail image is of the Whirlpool Galaxy, which we examine in the first section of this chapter. Galaxies are as immense as atoms are small, yet the same laws of physics describe both, along with all the rest of nature—an indication of the underlying unity in the universe. The laws of physics are surprisingly few, implying an underlying simplicity to nature’s apparent complexity. In this text, you learn about the laws of physics. Galaxies and atoms may seem far removed from your daily life, but as you begin to explore this broad-ranging subject, you may soon come to realize that physics plays a much larger role in your life than you first thought, no matter your life goals or career choice.
• 1.1: Prelude to Units and Measurement
The laws of physics are surprisingly few, implying an underlying simplicity to nature’s apparent complexity. In this text, you learn about the laws of physics. Galaxies and atoms may seem far removed from your daily life, but as you begin to explore this broad-ranging subject, you may soon come to realize that physics plays a much larger role in your life than you first thought, no matter your life goals or career choice.
• 1.2: The Scope and Scale of Physics
Physics is about trying to find the simple laws that describe all natural phenomena. It operates on a vast range of scales involving length, mass, and time. Scientists attempt to describe the world by formulating models, theories, and laws. They utilize orders of magnitudes of numbers to track and compare phenomena occurring on particular scales.
• 1.3: Units and Standards
Systems of units are constructed from a small number of fundamental units, which are defined by accurate and precise measurements of conventionally chosen base quantities. Two commonly used systems of units are English units and SI units. SI units are a metric system of units, meaning values can be calculated by factors of 10. The SI base units of length, mass, and time are the meter (m), kilogram (kg), and second (s), respectively.
• 1.4: Unit Conversion
Multiplication by conversion factors allows for quantities to change units. The operation must be done in such a way that the units you want to get rid of are canceled and the units you want to end up with remain. Units obey the rules of algebra so, for example, if a unit is squared two factors are needed to cancel it.
• 1.5: Dimensional Analysis
The dimension of a physical quantity is just an expression of the base quantities from which it is derived. All equations expressing physical laws or principles must be dimensionally consistent. This fact can be used as an aid in remembering physical laws, as a way to check whether claimed relationships between physical quantities are possible, and even to derive new physical laws.
• 1.6: Estimates and Fermi Calculations
An estimate is a rough educated guess at the value of a physical quantity based on prior experience and sound physical reasoning. Some strategies that may help when making an estimate are as follows: 1) Get big lengths from smaller lengths. 2) Get areas and volumes from lengths. 3) Get masses from volumes and densities. 4) If all else fails, bound it. One “sig. fig.” is fine. 5) Ask yourself: Does this make any sense?
• 1.7: Significant Figures
Accuracy of a measured value refers to how close a measurement is to an accepted reference value. Precision of measured values refers to how close the agreement is between repeated measurements. Significant figures express the precision of a measuring tool. When performing mathematical operations with measured values, there are rules to standardize the precision of the final answer.
• 1.8: Solving Problems in Physics
The three stages of the process for solving physics problems used in this textmap are as follows: 1)Strategy: Determine which physical principles are involved and develop a strategy for using them to solve the problem. 2) Solution: Do the math necessary to obtain a numerical solution with the correct units. 3) Significance: Check the solution to make sure it makes sense and assess its significance.
• 1.A: Units and Measurement (Answers)
• 1.E: Units and Measurement (Exercises)
• 1.S: Units and Measurement (Summary)
Thumbnail: This image might be showing any number of things. It might be a whirlpool in a tank of water or perhaps a collage of paint and shiny beads done for art class. Without knowing the size of the object in units we all recognize, such as meters or inches, it is difficult to know what we’re looking at. In fact, this image shows the Whirlpool Galaxy (and its companion galaxy), which is about 60,000 light-years in diameter (about 6 × 1017 km across). (credit: S. Beckwith (STScI) Hubble Heritage Team, (STScI/AURA), ESA, NASA)
• Samuel J. Ling (Truman State University), Jeff Sanny (Loyola Marymount University), and Bill Moebs with many contributing authors. This work is licensed by OpenStax University Physics under a Creative Commons Attribution License (by 4.0).
| 2021-11-30T18:25:45 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6877871751785278, "perplexity": 1047.118140746851}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964359065.88/warc/CC-MAIN-20211130171559-20211130201559-00403.warc.gz"}
|
https://pos.sissa.it/382/218/
|
Volume 382 - The Eighth Annual Conference on Large Hadron Collider Physics (LHCP2020) - Poster session
Search for phenomena beyond the Standard Model in events with large b-jet multiplicity using the ATLAS detector at the LHC
N.H.D. Nguyen* on behalf of the ATLAS collaboration
*corresponding author
Full text: pdf
Pre-published on: October 15, 2020
Published on: January 11, 2021
Abstract
Events with a large number of high-$p_{\text{T}}$ $b$-jets are rare in the Standard Model (SM); an excess of events with such topology would be a signal of phenomena beyond the SM. One phenomenon where a large excess is expected is a variant of Supersymmetry in which R-parity is violated, allowing baryon number violating decays of the super partners of the SM particles. This document presents the search for physics beyond the SM in events with at least eight jets and at least six $b$-jets. It was performed using Run 2 data collected by the ATLAS detector corresponding to an integrated luminosity of 139 fb$^{-1}$ of $pp$ collisions at a center-of-mass energy of $\sqrt{s}=13$ TeV. We consider specifically the production of a pair of heavy top squarks which decay to a $b$-quark and a chargino, which in turn decays into $bbs$ via a virtual top squark. The most dominant source of background is multijet production, estimated using a data-driven technique. A fit is performed to estimate the expected sensitivity of the signal strength. Expected and observed 95$\%$ CL upper limits are set based on the top squark and chargino masses.
DOI: https://doi.org/10.22323/1.382.0218
How to cite
Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2021-04-23T18:31:37 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.670199453830719, "perplexity": 1602.4517043149108}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618039596883.98/warc/CC-MAIN-20210423161713-20210423191713-00591.warc.gz"}
|
http://dlmf.nist.gov/6.21
|
# §6.21(i) Introduction
In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. Citations in bulleted lists refer to papers for which research software has been made available and can be downloaded via the Web. References to research software that is available in other ways is listed separately.
A more complete list of available software for computing these functions is found in the Software Index. For another listing of Web-accessible software for the functions in this chapter, see GAMS Class C5.
# §6.21(ii) $\mathop{E_{1}\/}\nolimits\!\left(x\right)$, $\mathop{\mathrm{Ei}\/}\nolimits\!\left(x\right)$, $\mathop{\mathrm{Si}\/}\nolimits\!\left(x\right)$, $\mathop{\mathrm{Ci}\/}\nolimits\!\left(x\right)$, $\mathop{\mathrm{Shi}\/}\nolimits\!\left(x\right)$, $\mathop{\mathrm{Chi}\/}\nolimits\!\left(x\right)$, $x\in\Real$
• Amos (1980a). Fortran.
• Cody (1993b). Fortran.
• Smith (2011). Fortran.
See also Gautschi (1973), MacLeod (1996b), Paciorek (1970), and Stegun and Zucker (1976).
# §6.21(iii) $\mathop{E_{1}\/}\nolimits\!\left(z\right)$, $\mathop{\mathrm{Si}\/}\nolimits\!\left(z\right)$, $\mathop{\mathrm{Ci}\/}\nolimits\!\left(z\right)$, $\mathop{\mathrm{Shi}\/}\nolimits\!\left(z\right)$, $\mathop{\mathrm{Chi}\/}\nolimits\!\left(z\right)$, $z\in\Complex$
• Amos (1990). Fortran.
| 2015-01-27T22:59:07 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 26, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6760157346725464, "perplexity": 2720.6436286389426}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-06/segments/1422122039674.71/warc/CC-MAIN-20150124175359-00214-ip-10-180-212-252.ec2.internal.warc.gz"}
|
https://www.usgs.gov/center-news/volcano-watch-how-our-capabilities-have-improved-time
|
Volcano Watch — How our capabilities have improved with time
Release Date:
Forty years ago, at 12:36 p.m. on September 21, a swarm of large, shallow earthquakes accompanied by strong harmonic tremor began to emanate from the vicinity of Napau Crater on the east rift zone of Kīlauea Volcano. A rapid deflation of the summit of Kīlauea occurred in conjunction with the earthquake swarm.
These events were precursors to an eruption and were caused by magma draining from the summit storage system and forcefully intruding the rift zone. Personnel at the Hawaiian Volcano Observatory were uncertain about the location of the possible eruption because of the scant monitoring network in place at that time.
HVO directly recorded the signal from only four seismic stations on Kīlauea. Three more stations, one each in Pahoa, Hilo, and Kealakekua, were recorded on site, and their records had to be transported to HVO. One tiltmeter that had to be manually read was the only daily source of information about surface deformation.
The first observation of a possible eruption was a glow over the east rift zone forest at 4:30 a.m. on September 22. At 8:00 a.m., a tourist flight confirmed a breakout near Kalalua Crater. With no immediate access to a helicopter or airplane, HVO personnel had to wait until noon before they were able to take an overflight of the eruption area with the Hawaii National Guard.
The observers found a series of discontinuous fissures stretching 15 km (9 mi) from Napau Crater downrift to Kalalua Crater (the initial phase of the current Puu Oo eruption had nearly an identical breakout). Only copious steam and volcanic fumes were being emitted from the cracks by the time HVO personnel flew over the area. Fresh lava pads surrounded three of the fissures, but no fountaining was observed.
The island was rocked at 5:02 p.m. on September 22 by a large earthquake from the south flank of Kīlauea. The earthquake apparently allowed the eruptive dike to move farther down the rift zone. At about 10:00 a.m. on September 23, a new 4-km-long (2.5-mi-long) fissure broke out about 8.3 km (5 mi) east of the previous day's activity.
The discontinuous curtain of fountains lasted only a few minutes and consolidated to a 200-m-long (700-ft-long) vent located northwest of Heiheiahulu Crater. Activity at this vent produced flows that threatened the Kalapana road, and the Hawaii County Civil Defense Agency ordered the evacuation of homes from Opihikao to Kapaahu. Most of the lava, however, poured down large cracks, and no extensive flow resulted. This eruptive phase lasted 15 hours and produced three distinctive flow fields. The easternmost flow field, Jonika, was named for the rancher who allowed HVO personnel to pass through his property and guided us to the eruption site.
Eruptive activity resumed at 2:15 p.m. on September 24 from a 150-m-long (500-ft-long) fissure located between Kalalua and Heiheiahulu craters. The fountains were low-level and ended by early the next morning. Two small elongated cones resulted from this activity.
During the evening of September 24, a swarm of earthquakes from the south flank shook the area. Three earthquakes were felt throughout the island, with the largest, at 7:30 p.m., having a magnitude of 5.5. This earthquake nearly caused a newly arrived HVO staff member to go back to Oahu, but he stayed on and worked in seismology for another 28 years before retiring from HVO.
The 1961 flank eruption ushered in 40 years of great activity along Kīlauea's middle and upper east rift zone. Since then, HVO has gradually increased our real-time monitoring capabilities to cope with all this activity and that of Mauna Loa. Now the seismic network consists of more than 60 stations on this island and three on Maui, and all of their signals are telemetered and recorded at HVO. A dozen electronic tilt stations, four borehole strainmeters, and nearly two dozen GPS receivers send their signals to HVO. We also have ready access to a number of helicopters. When the first eruptive fissure of the current eruption broke the surface near Napau Crater on January 3, 1983, HVO personnel were standing only a few meters (yards) away. Volcano Activity Update
Eruptive activity of Kīlauea Volcano continued unabated at the Puu Oo vent during the past week. Lavamoves away from the vent toward the ocean in a network of tubes and descends Pulama pali in three separate tubes. Two surface flows from breakouts of the tube system continue to stream down the pali, and many surface flows are active in the coastal flats. Lava enters the ocean in the area east of Kupapau and provides visitors to the viewing area a great show.
The public is reminded that the bench of the ocean entry is very hazardous, with possible collapses of the new land. The steam cloud is extremely hot, highly acidic, and laced with glass particles. Swimming at the black sand beach of the bench can be a blistering or even deadly venture.
There were no earthquakes reported felt during the week ending on September 20. The swarm of earthquakes from Loihi Volcano has subsided. HVO located a total of 57 earthquakes from Loihi since September 10.
| 2020-10-24T09:26:33 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3159506916999817, "perplexity": 6373.020280862471}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-45/segments/1603107882103.34/warc/CC-MAIN-20201024080855-20201024110855-00295.warc.gz"}
|
https://en.wikipedia.org/wiki/User:AndrewKepert
|
# User:AndrewKepert
Andrew's Userboxen
This user comes from Australia.
en This user is a native speaker of English.
${\displaystyle e^{i\pi \ }}$ This user is a mathematician.
UWA This user attends or attended the University of Western Australia.
BSc This user has a Bachelor of Science degree.
ANU This user is a student or graduate of the Australian National University.
PhD This user has a Doctor of Philosophy degree
This user plays the double bass, and thus requires this extra-large userbox to show it.
This user plays the piano.
This user is a proud cyclist.
This user is nearsighted.
V This user is a vegetarian.
This user contributes using Mozilla.
This user runs OS X.
This user contributes using GNU/Linux.
TeX This Wikipedian is a TeX user.
-3 This user is an advanced LaTeX user.
C-2 This user is an intermediate C programmer.
re This user writes regular expressions to find everything around the house.
php This user can program in PHP.
SQL This user can program in SQL.
pas This user can program in Pascal.
ubx-1 This user is a userbox novice.
Andrew's hand
## Me and WikipediA
Previously a sporadic skimmer of wikipedia, I took the plunge on 18:26, 4 Aug 2003 with MetaPost. Not intending to be a hard-core wikipedian, you can look in the usual place for my contributions -- some things on maths, some on music, some on TeX etc. I am too busy to do much to WP nowadays, other than tweak things, revert vandalism, etc.
## How much you can re-use my contributions
As suggested in the Free the rambot Articles project it is useful if wikipedians be a bit more explicit about the licensing of their contributions. So here it is:
Unless otherwise stated, I agree to multi-license all my contributions, with the exception of my user pages, as described below:
Multi-licensed with the Creative Commons Attribution Share-Alike License versions 1.0 and 2.0 I agree to multi-license my text contributions, unless otherwise stated, under Wikipedia's copyright terms and the Creative Commons Attribution Share-Alike license version 1.0 and version 2.0. Please be aware that other contributors might not do the same, so if you want to use my contributions under the Creative Commons terms, please check the CC dual-license and Multi-licensing guides.
| 2016-09-30T08:32:32 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 1, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.22100502252578735, "perplexity": 3911.202466233299}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2016-40/segments/1474738662133.5/warc/CC-MAIN-20160924173742-00241-ip-10-143-35-109.ec2.internal.warc.gz"}
|
https://par.nsf.gov/biblio/10343877-precision-measurement-forward-boson-production-proton-proton-collisions-sqrt-mathrm-tev
|
This content will become publicly available on July 1, 2023
Precision measurement of forward Z boson production in proton-proton collisions at $$\sqrt{\mathrm{s}}$$ = 13 TeV
A bstract A precision measurement of the Z boson production cross-section at $$\sqrt{\mathrm{s}}$$ s = 13 TeV in the forward region is presented, using pp collision data collected by the LHCb detector, corresponding to an integrated luminosity of 5.1 fb − 1 . The production cross-section is measured using Z → μ + μ − events within the fiducial region defined as pseudorapidity 2 . 0 < η < 4 . 5 and transverse momentum p T > 20 GeV /c for both muons and dimuon invariant mass 60 < M μμ < 120 GeV /c 2 . The integrated cross-section is determined to be $$\sigma \left(Z\to {\mu}^{+}{\mu}^{-}\right)=196.4\pm 0.2\pm 1.6\pm 3.9\ \mathrm{pb},$$ σ Z → μ + μ − = 196.4 ± 0.2 ± 1.6 ± 3.9 pb , where the first uncertainty is statistical, the second is systematic, and the third is due to the luminosity determination. The measured results are in agreement with theoretical predictions within uncertainties.
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10343877
Journal Name:
Journal of High Energy Physics
Volume:
2022
Issue:
7
ISSN:
1029-8479
1. Abstract We report on the inclusive $$\text {J}/\psi$$ J / ψ production cross section measured at the CERN Large Hadron Collider in proton–proton collisions at a center-of-mass energy $$\sqrt{s}~=~13$$ s = 13 TeV. The $$\text {J}/\psi$$ J / ψ mesons are reconstructed in the $$\text {e}^{+}\text {e}^{-}$$ e + e - decay channel and the measurements are performed at midrapidity ( $$|y|<0.9$$ | y | < 0.9 ) in the transverse-momentum interval $$0more » 2. (Ed.) Abstract Production cross sections of the Higgs boson are measured in the$${\mathrm{H}} \rightarrow {\mathrm{Z}} {\mathrm{Z}} \rightarrow 4\ell $$H → Z Z → 4 ℓ ($$\ell ={\mathrm{e}},{{{\upmu }}_{\mathrm{}}^{\mathrm{}}} $$ℓ = e , μ ) decay channel. A data sample of proton–proton collisions at a center-of-mass energy of 13$$\,\text {Te}\text {V}$$Te , collected by the CMS detector at the LHC and corresponding to an integrated luminosity of 137$$\,\text {fb}^{-1}$$fb - 1 is used. The signal strength modifier$$\mu $$μ , defined as the ratio of the Higgs boson production rate in the$$4\ellmore »
3. Abstract The production of Z boson pairs in proton–proton ( $${\mathrm{p}} {\mathrm{p}}$$ p p ) collisions, $${{\mathrm{p}} {\mathrm{p}} \rightarrow ({\mathrm{Z}}/\gamma ^*)({\mathrm{Z}}/\gamma ^*) \rightarrow 2\ell 2\ell '}$$ p p → ( Z / γ ∗ ) ( Z / γ ∗ ) → 2 ℓ 2 ℓ ′ , where $${\ell ,\ell ' = {\mathrm{e}}}$$ ℓ , ℓ ′ = e or $${{\upmu }}$$ μ , is studied at a center-of-mass energy of 13 $$\,\text {TeV}$$ TeV with the CMS detector at the CERN LHC. The data sample corresponds to an integrated luminosity of 137 $$\,\text {fb}^{-1}$$ fb - 1more »
4. A bstract Measurement of Z-boson production in p-Pb collisions at $$\sqrt{s_{\mathrm{NN}}}$$ s NN = 8 . 16 TeV and Pb-Pb collisions at $$\sqrt{s_{\mathrm{NN}}}$$ s NN = 5 . 02 TeV is reported. It is performed in the dimuon decay channel, through the detection of muons with pseudorapidity − 4 < η μ < − 2 . 5 and transverse momentum $${p}_{\mathrm{T}}^{\mu }$$ p T μ > 20 GeV/ c in the laboratory frame. The invariant yield and nuclear modification factor are measured for opposite-sign dimuons with invariant mass 60 < m μμ < 120more »
5. A bstract A measurement of inclusive, prompt, and non-prompt J/ ψ production in p-Pb collisions at a nucleon-nucleon centre-of-mass energy $$\sqrt{s_{\mathrm{NN}}}$$ s NN = 5 . 02 TeV is presented. The inclusive J/ ψ mesons are reconstructed in the dielectron decay channel at midrapidity down to a transverse momentum p T = 0. The inclusive J/ ψ nuclear modification factor R pPb is calculated by comparing the new results in p-Pb collisions to a recently measured proton-proton reference at the same centre-of-mass energy. Non-prompt J/ ψ mesons, which originate from the decay of beauty hadrons, are separated frommore »
| 2022-09-26T13:00:19 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9776549339294434, "perplexity": 2645.7464964560563}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-40/segments/1664030334871.54/warc/CC-MAIN-20220926113251-20220926143251-00005.warc.gz"}
|
https://par.nsf.gov/biblio/10104818-early-type-galaxy-density-profiles-from-illustristng-ii-evolutionary-trend-total-density-profile
|
Early-type galaxy density profiles from IllustrisTNG – II. Evolutionary trend of the total density profile
ABSTRACT We study the evolutionary trend of the total density profile of early-type galaxies (ETGs) in IllustrisTNG. To this end, we trace ETGs from z = 0 to 4 and measure the power-law slope γ′ of the total density profile for their main progenitors. We find that their slopes γ′ steepen on average during z ∼ 4–2, then becoming shallower until z = 1, after which they remain almost constant, aside from a residual trend of becoming shallower towards z = 0. We also compare to a statistical sample of ETGs at different redshifts, selected based on their luminosity profiles and stellar masses. Due to different selection effects, the average slopes of the statistical samples follow a modified evolutionary trend. They monotonically decrease since z = 3, and after z ≈ 1, they remain nearly invariant with a mild increase towards z = 0. These evolutionary trends are mass dependent for both samples, with low-mass galaxies having in general steeper slopes than their more massive counterparts. Galaxies that transitioned to ETGs more recently have steeper mean slopes as they tend to be smaller and more compact at any given redshift. By analysing the impact of mergers and AGN feedback on the progenitors’ evolution, we conjecture a multiphase path leading to more »
Authors:
; ; ; ; ; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10104818
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
490
Issue:
4
Page Range or eLocation-ID:
5722 to 5738
ISSN:
0035-8711
1. ABSTRACT We explore the isothermal total density profiles of early-type galaxies (ETGs) in the IllustrisTNG simulation. For the selected 559 ETGs at z = 0 with stellar masses $10^{10.7}\, \mathrm{M}_{\odot } \leqslant M_{\ast } \leqslant 10^{11.9}\, \mathrm{M}_{\odot }$, the total power-law slope has a mean of 〈γ′〉 = 2.011 ± 0.007 and a scatter of $\sigma _{\gamma ^{\prime }} = 0.171$ over the radial range 0.4–4 times the stellar half-mass radius. Several correlations between γ′ and galactic properties including stellar mass, effective radius, stellar surface density, central velocity dispersion, central dark matter fraction, and in situ-formed stellar mass ratio are compared to observations and other simulations, revealing that IllustrisTNG reproduces many correlation trends, and in particular, γ′ is almost constant with redshift below z = 2. Through analysing IllustrisTNG model variations, we show that black hole kinetic winds are crucial to lowering γ′ and matching observed galaxy correlations. The effects of stellar winds on γ′ are subdominant compared to active galactic nucleus (AGN) feedback, and differ due to the presence of AGN feedback from previous works. The density profiles of the ETG dark matter haloes are well described by steeper than NFW profiles, and they are steeper in the full physics (FP) run than their counterpartsmore »
Rotation curves of galaxies probe their total mass distributions, including dark matter. Dwarf galaxies are excellent systems to investigate the dark matter density distribution, as they tend to have larger fractions of dark matter compared to higher mass systems. The core-cusp problem describes the discrepancy found in the slope of the dark matter density profile in the centres of galaxies (β*) between observations of dwarf galaxies (shallower cores) and dark matter-only simulations (steeper cusps). We investigate β* in six nearby spiral dwarf galaxies for which high-resolution CO J = 1–0 data were obtained with ALMA (Atacama Large Millimeter/submillimeter Array). We derive rotation curves and decompose the mass profile of the dark matter using our CO rotation curves as a tracer of the total potential and 4.5 $\mu$m photometry to define the stellar mass distribution. We find 〈β*〉 = 0.6 with a standard deviation of ±0.1 among the galaxies in this sample, in agreement with previous measurements in this mass range. The galaxies studied are on the high stellar mass end of dwarf galaxies and have cuspier profiles than lower mass dwarfs, in agreement with other observations. When the same definition of the slope is used, we observe steeper slopes than predicted bymore »
| 2023-04-01T10:03:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.700600266456604, "perplexity": 2587.324382080432}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949958.54/warc/CC-MAIN-20230401094611-20230401124611-00761.warc.gz"}
|
https://en.wikipedia.org/wiki/Freiman%27s_theorem
|
# Freiman's theorem
Jump to: navigation, search
In mathematics, Freiman's theorem is a combinatorial result in additive number theory. In a sense it accounts for the approximate structure of sets of integers that contain a high proportion of their internal sums, taken two at a time.
The formal statement is:
Let A be a finite set of integers such that the sumset
${\displaystyle A+A}$
is small, in the sense that
${\displaystyle |A+A|
for some constant ${\displaystyle c}$. There exists an n-dimensional arithmetic progression of length
${\displaystyle c'|A|}$
that contains A, and such that c' and n depend only on c.[1]
A simple instructive case is the following. We always have
${\displaystyle |A+A|\geq 2|A|-1}$
with equality precisely when A is an arithmetic progression.
This result is due to Gregory Freiman (1964,1966).[2] Much interest in it, and applications, stemmed from a new proof by Imre Z. Ruzsa (1994). Mei-Chu Chang proved new polynomial estimates for the size of arithmetic progressions arising in the theorem in 2002. [3]
Green and Ruzsa (2007) generalized the theorem for arbitrary abelian groups: here A can be contained in the sum of a generalized arithmetic progression and a subgroup — the name of such sets is coset-progression.
## References
1. ^ Nathanson (1996) p.251
2. ^ Nathanson (1996) p.252
3. ^ Chang, Mei-Chu (2002). "A polynomial bound in Freiman's theorem". Duke Math. J. 113 (3): 399–419. MR 1909605.
This article incorporates material from Freiman's theorem on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.
| 2018-01-19T14:24:49 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 5, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9111512899398804, "perplexity": 1604.9906473325548}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-05/segments/1516084887981.42/warc/CC-MAIN-20180119125144-20180119145144-00200.warc.gz"}
|
https://tjyj.stats.gov.cn/CN/10.19343/j.cnki.11-1302/c.2021.08.004
|
• •
养老保险可携带性、农村劳动力流动与农村反贫困
• 出版日期:2021-08-25 发布日期:2021-08-25
Portable Pension, Rural Labor Migration, and Rural Anti-poverty
Zou Tieding et al
• Online:2021-08-25 Published:2021-08-25
Abstract: This paper extends the H-T model of labor mobility and its economic and social impact by Harris & Todaro (1970) in the three-sector economic framework to study the effect of pension portability on the income growth effect of rural labor migration and the adjustment mechanism of wealth and poverty. The empirical results show that the gradient of economic development and industrial hierarchy between regions and the income gap of 190% ~ 260% between urban and rural areas are the fundamental reasons for the rural labor force to flow to cities. The portability of pension affects the flow efficiency and direction of the rural labor force by changing the flow costs and returns and has a significant effect on income growth and wealth adjustment. From 2000 to 2019, improving the portability of pension can increase the income of rural labor by more than 35% and reduce the income gap between urban and rural labor by 15% ~ 34%. Thus, the Temporary Measures for the Transfer and Continuity of Basic Endowment Insurance of Urban Enterprise Employees are effectively verified, which plays a positive role in coordinating development between urban and rural areas, increasing farmers’ income and narrowing the urban-rural wealth gap, and this paper also shows the necessity and direction to further improve it.
| 2022-07-07T03:09:36 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.25498050451278687, "perplexity": 3063.5751726482454}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104683020.92/warc/CC-MAIN-20220707002618-20220707032618-00611.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?node=Q007CED
|
#### ${\mathit {\mathit t}}$-quark EW Couplings
${{\mathit W}}$ helicity fractions in top decays. ${{\mathit F}_{{0}}}$ is the fraction of longitudinal and ${{\mathit F}_{{+}}}$ the fraction of right-handed ${{\mathit W}}$ bosons. ${{\mathit F}_{{{V+A}}}}$ is the fraction of $\mathit V+\mathit A$ current in top decays. The effective Lagrangian (cited by ABAZOV 2008AI) has terms f${}^{L}_{1}$ and f${}^{R}_{1}$ for $\mathit V−\mathit A$ and $\mathit V+\mathit A$ couplings, f${}^{L}_{2}$ and f${}^{R}_{2}$ for tensor couplings with b$_{R}$ and b$_{L}$ respectively.
#### Chromo-electric dipole moment ${{\mathit d}_{{t}}}$ = ${{\mathit g}_{{s}}}$ $\hat{{\mathit d}}_{t}/{{\mathit m}_{{t}}}$
VALUE CL% DOCUMENT ID TECN COMMENT
• • We do not use the following data for averages, fits, limits, etc. • •
$\vert \hat{{\mathit d}}_{t}\vert <0.03$ 95 1
2020 AM
CMS ${{\mathit \ell}}$ +jets
$-0.020<\hat{{\mathit d}}_{t}<0.012$ 95 2
2019 BX
CMS ${{\mathit \ell}}{{\mathit \ell}}$ + ${}\geq{}$2j (${}\geq{}1{{\mathit b}}$ )
$-0.068<Im(\hat{{\mathit d}}_{t})<0.067$ 95 3
2016 AI
CMS ${{\mathit \ell}}{{\mathit \ell}}$ + ${}\geq{}$2j (${}\geq{}1{{\mathit b}}$ )
1 SIRUNYAN 2020AM based on 35.9 fb${}^{-1}$ of ${{\mathit p}}{{\mathit p}}$ data at $\sqrt {s }$ = 13 TeV. ${{\mathit t}}{{\overline{\mathit t}}}$ with low and high boosts are reconstructed through a fit of the kinematic distributions. The ${{\mathit q}}{{\overline{\mathit q}}}$ initial subprocess is separated using different dependences of the distributions on the initial states, and the linearized forward-backward asymmetry is measured to be $\mathit A{}^{(1)}_{FB}$ = $0.048$ ${}^{+0.095}_{-0.087}{}^{+0.020}_{-0.029}$.
2 SIRUNYAN 2019BX based on 35.9 fb${}^{-1}$ of ${{\mathit p}}{{\mathit p}}$ data at $\sqrt {s }$ = 13 TeV. A set of parton-level normalized differential cross sections is measured to extract coefficients of the spin-dependent ${{\mathit t}}{{\overline{\mathit t}}}$ production density matrix and constrain the anomalous chromomagnetic and chromoelectric dipole moments of the top quark. The coefficients are compared with the NLO MC simulations and with the NLO QCD calculation including EW corrections.
3 KHACHATRYAN 2016AI based on 19.5 fb${}^{-1}$ of ${{\mathit p}}{{\mathit p}}$ data at $\sqrt {s }$ = 8 TeV, using lepton angular distributions as a function of the ${{\mathit t}}{{\overline{\mathit t}}}$ -system kinematical variables.
References:
SIRUNYAN 2020AM
JHEP 2006 146 Measurement of the top quark forward-backward production asymmetry and the anomalous chromoelectric and chromomagnetic moments in pp collisions at $\sqrt{s}$ = 13 TeV
SIRUNYAN 2019BX
PR D100 072002 Measurement of the top quark polarization and $\mathrm{t\bar{t}}$ spin correlations using dilepton final states in proton-proton collisions at $\sqrt{s} =$ 13 TeV
KHACHATRYAN 2016AI
PR D93 052007 Measurements of ${\mathit {\mathit t}}{\mathit {\overline{\mathit t}}}$ Spin Correlations and Top Quark Polarization using Dilepton Final States in ${{\mathit p}}{{\mathit p}}$ Collisions at $\sqrt {s }$ = 8 TeV
| 2023-01-31T19:40:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9535762667655945, "perplexity": 3180.5907778204946}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764499890.39/warc/CC-MAIN-20230131190543-20230131220543-00279.warc.gz"}
|
https://pages.nist.gov/feasst/plugin/system/doc/BondThreeBody.html
|
# BondThreeBody¶
class BondThreeBody
angle 0 - 1 - 2 r01 = r0 - r1, r21 = r2 - r1
Subclassed by feasst::AngleSquareWell
| 2021-02-28T01:34:45 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.49994421005249023, "perplexity": 9230.905250193526}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-10/segments/1614178359624.36/warc/CC-MAIN-20210227234501-20210228024501-00059.warc.gz"}
|
https://www.pnnl.gov/publications/rmap-r-package-plot-and-compare-tabular-data-customizable-maps-across-scenarios-and
|
January 13, 2023
Journal Article
## Abstract
rmap is an R package that allows users to easily plot tabular data (CSV or R data frames) on maps without any Geographic Information Systems (GIS) knowledge. Maps produced by rmap are ggplot objects and thus capitalize on the flexibility and advancements of the ggplot2 package and all elements of each map are thus fully customizable. Additionally rmap automatically detects and produces comparison maps if the data has multiple scenarios or time periods as well as animations for time series data. Advanced users can load their own shapefiles if desired. rmap comes with a range of pre-built color palettes but users can also provide any R color palette or create their own as needed. Four different legend types are available to highlight different kinds of data distributions. The input spatial data can be both gridded or polygon data. rmap is desgined in particular for comparing spatial data across scenarios and time periods and comes preloaded with standard country, state, and basin maps as well as custom maps compatible with the Global Change Analysis Model (GCAM) spatial boundaries. rmap has a growing number of users and its products have been used in multiple multisector dynamics publications as well as a required dependency in other R packages such as rfasst and metis. rmap's automatic processing of tabular data using pre-built map selection, difference map calculations, faceting, and animations offers unique functionality which makes it a powerful and yet simple tool for users looking to explore multi-sector, multi-scenario data across space and time.
Published: January 13, 2023
## Citation
Khan Z., M. Zhao, C.R. Vernon, T. Wild, and B.N. Yarlagadda. 2022. rmap: An R package to plot and compare tabular data on customizable maps across scenarios and time. Journal of Open Source Software 7, no. 77:4015. PNNL-SA-168873. doi:10.21105/joss.04015
| 2023-03-28T08:39:32 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.29172033071517944, "perplexity": 4941.246519657646}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296948817.15/warc/CC-MAIN-20230328073515-20230328103515-00630.warc.gz"}
|
https://mooseframework.inl.gov/modules/phase_field/Actions.html
|
# Custom Phase Field Actions
To simplify the formation of input files that use standard Allen-Cahn and Cahn-Hilliard equations, custom actions have been created that automatically create conserved and nonconserved phase field field variables and all the corresponding kernels. Additional kernels can still be added using standard MOOSE syntax.
The actions are in the phase field block, under the modules block. Nonconserved variables are created using NonconservedAction. For an example, see
[Modules]
[./PhaseField]
[./Nonconserved]
[./eta]
free_energy = F
kappa = 2.0
mobility = 1.0
variable_mobility = false
[../]
[../]
[../]
[]
(modules/phase_field/test/tests/actions/Nonconserved_1var.i)
Conserved variables are created using ConservedAction. For an example, See
[Modules]
[./PhaseField]
[./Conserved]
[./cv]
solve_type = REVERSE_SPLIT
free_energy = F
kappa = 2.0
mobility = 1.0
[../]
[../]
[../]
[]
(modules/phase_field/test/tests/actions/conserved_split_1var.i)
and
[Modules]
[./PhaseField]
[./Conserved]
[./cv]
solve_type = direct
free_energy = F
kappa = 2.0
mobility = 1.0
[../]
[../]
[../]
[]
(modules/phase_field/test/tests/actions/conserved_direct_1var.i)
| 2019-05-23T15:26:57 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.20720110833644867, "perplexity": 9403.068361195448}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-22/segments/1558232257259.71/warc/CC-MAIN-20190523143923-20190523165923-00500.warc.gz"}
|
https://pos.sissa.it/345/034/
|
Highlights from the STAR experiment
S.K. Radhakrishnan* on behalf of the STAR collaboration
*corresponding author
Full text: pdf
Pre-published on: January 15, 2019
Published on: April 24, 2019
Abstract
Studies of the Quark Gluon Plasma (QGP) with hard and electromagnetic probes are a major focus of the STAR experiment at the Relativistic Heavy Ion Collider. The Heavy Flavor Tracker installed at STAR for runs in 2014-2016 has significantly enhanced the precision of open-heavy-flavor hadron measurements at STAR, while the Muon Telescope Detector has greatly improved muon identification and quarkonia measurements. Recent measurements from STAR on the dependence of jet modifications in heavy-ion collisions on the jet properties and medium geometry provide further insights into the parton energy loss in the QGP. The low $p_{\mathrm{T}}$ di-electron production is sensitive to the initial photon flux in heavy-ion collisions and can be a valuable tool to study the initial conditions in heavy-ion collisions. Some of the recent results from STAR on these and other related measurements, presented at the Hard Probes 2018 conference, are discussed in these proceedings.
DOI: https://doi.org/10.22323/1.345.0034
How to cite
Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2020-07-11T01:12:19 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5084895491600037, "perplexity": 2157.867579908614}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-29/segments/1593655919952.68/warc/CC-MAIN-20200711001811-20200711031811-00512.warc.gz"}
|
https://par.nsf.gov/biblio/10361187-implications-rapidly-varying-frb-globular-cluster-m81
|
Implications of a rapidly varying FRB in a globular cluster of M81
ABSTRACT
A repeating source of fast radio bursts (FRBs) is recently discovered from a globular cluster of M81. Association with a globular cluster (or other old stellar systems) suggests that strongly magnetized neutron stars, which are the most likely objects responsible for FRBs, are born not only when young massive stars undergo core-collapse, but also by mergers of old white dwarfs. We find that the fractional contribution to the total FRB rate by old stellar populations is at least a few per cent, and the precise fraction can be constrained by FRB searches in the directions of nearby galaxies, both star-forming and elliptical ones. Using very general arguments, we show that the activity time of the M81-FRB source is between 104 and 106 yr, and more likely of the order of 105 yr. The energetics of radio outbursts put a lower limit on the magnetic field strength of 10$^{13}\,$G, and the spin period $\gtrsim 0.2\,$s, thereby ruling out the source being a milli-second pulsar. The upper limit on the persistent X-ray luminosity (provided by Chandra), together with the high FRB luminosity and frequent repetitions, severely constrains (or rules out) the possibility that the M81-FRB is a scaled-up version of giant pulses from more »
Authors:
; ;
Publication Date:
NSF-PAR ID:
10361187
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
510
Issue:
2
Page Range or eLocation-ID:
p. 1867-1879
ISSN:
0035-8711
Publisher:
Oxford University Press
National Science Foundation
##### More Like this
1. Abstract
The first fast radio burst (FRB) to be precisely localized was associated with a luminous persistent radio source (PRS). Recently, a second FRB/PRS association was discovered for another repeating source of FRBs. However, it is not clear what makes FRBs or PRS or how they are related. We compile FRB and PRS properties to consider the population of FRB/PRS sources. We suggest a practical definition for PRS as FRB associations with luminosity greater than 1029erg s−1Hz−1that are not attributed to star formation activity in the host galaxy. We model the probability distribution of the fraction of FRBs with PRS for repeaters and nonrepeaters, showing there is not yet evidence for repeaters to be preferentially associated with PRS. We discuss how FRB/PRS sources may be distinguished by the combination of active repetition and an excess dispersion measure local to the FRB environment. We use CHIME/FRB event statistics to bound the mean per-source repetition rate of FRBs to be between 25 and 440 yr−1. We use this to provide a bound on the density of FRB-emitting sources in the local universe of between 2.2 × 102and 5.2 × 104Gpc−3assuming a pulsar-like beamwidth for FRB emission. This density implies that PRS maymore »
2. ABSTRACT
The physical properties of fast radio burst (FRB) host galaxies provide important clues towards the nature of FRB sources. The 16 FRB hosts identified thus far span three orders of magnitude in mass and specific star formation rate, implicating a ubiquitously occurring progenitor object. FRBs localized with ∼arcsecond accuracy also enable effective searches for associated multiwavelength and multi-time-scale counterparts, such as the persistent radio source associated with FRB 20121102A. Here we present a localization of the repeating source FRB 20201124A, and its association with a host galaxy (SDSS J050803.48+260338.0, z = 0.098) and persistent radio source. The galaxy is massive (${\sim}3\times 10^{10}\, \text{M}_{\odot }$), star-forming (few solar masses per year), and dusty. Very Large Array and Very Long Baseline Array observations of the persistent radio source measure a luminosity of 1.2 × 1029 erg s−1 Hz−1, and show that is extended on scales ≳50 mas. We associate this radio emission with the ongoing star formation activity in SDSS J050803.48+260338.0. Deeper, high-resolution optical observations are required to better utilize the milliarcsecond-scale localization of FRB 20201124A and determine the origin of the large dispersion measure (150–220 pc cm−3) contributed by the host. SDSS J050803.48+260338.0 is an order of magnitude more massive than any galaxy or stellar system previously associated with a repeating FRB source, butmore »
3. ABSTRACT
We investigate archival Hubble Space Telescope ACS/SBC F140LP observations of NGC 1399 to search for evidence of multiple stellar populations in extragalactic globular clusters. Enhanced far-ultraviolet (FUV) populations are thought to be indicators of He-enhanced second generation populations in globular clusters, specifically extreme/blue horizontal branch stars. Out of 149 globular clusters in the field of view, 58 have FUV counterparts with magnitudes brighter than 28.5. Six of these FUV-detected globular clusters are also detected in X-rays, including one ultraluminous X-ray source (LX > 1039 erg/s). While optically bright clusters corresponded to brighter FUV counterparts, we observe FUV emission from both metal-rich and metal-poor clusters, which implies that the FUV excess is not dependent on optical colour. We also find no evidence that the cluster size influences the FUV emission. The clusters with X-ray emission are not unusually FUV bright, which suggests that even the ultraluminous X-ray source does not provide significant FUV contributions. NGC 1399 is only the fourth galaxy to have its globular cluster system probed for evidence of FUV-enhanced populations, and we compare these clusters to previous studies of the Milky Way, M31, M87, and the brightest cluster in M81. These sources indicate that many globular clusters likelymore »
4. Abstract
Since the discovery of the first fast radio burst (FRB) in 2007, and their confirmation as an abundant extragalactic population in 2013, the study of these sources has expanded at an incredible rate. In our 2019 review on the subject, we presented a growing, but still mysterious, population of FRBs—60 unique sources, 2 repeating FRBs, and only 1 identified host galaxy. However, in only a few short years, new observations and discoveries have given us a wealth of information about these sources. The total FRB population now stands at over 600 published sources, 24 repeaters, and 19 host galaxies. Higher time resolution data, sustained monitoring, and precision localisations have given us insight into repeaters, host galaxies, burst morphology, source activity, progenitor models, and the use of FRBs as cosmological probes. The recent detection of a bright FRB-like burst from the Galactic magnetar SGR 1935 + 2154 provides an important link between FRBs and magnetars. There also continue to be surprising discoveries, like periodic modulation of activity from repeaters and the localisation of one FRB source to a relatively nearby globular cluster associated with the M81 galaxy. In this review, we summarise the exciting observational results from the past few years.more »
5. Abstract We present the localization and host galaxies of one repeating and two apparently nonrepeating fast radio bursts (FRBs). FRB 20180301A was detected and localized with the Karl G. Jansky Very Large Array to a star-forming galaxy at z = 0.3304. FRB20191228A and FRB20200906A were detected and localized by the Australian Square Kilometre Array Pathfinder to host galaxies at z = 0.2430 and z = 0.3688, respectively. We combine these with 13 other well-localized FRBs in the literature, and analyze the host galaxy properties. We find no significant differences in the host properties of repeating and apparently nonrepeating FRBs. FRB hosts are moderately star forming, with masses slightly offset from the star-forming main sequence. Star formation and low-ionization nuclear emission-line region emission are major sources of ionization in FRB host galaxies, with the former dominant in repeating FRB hosts. FRB hosts do not track stellar mass and star formation as seen in field galaxies (more than 95% confidence). FRBs are rare in massive red galaxies, suggesting that progenitor formation channels are not solely dominated by delayed channels which lag star formation by gigayears. The global properties of FRB hosts are indistinguishable from core-collapse supernovae and short gamma-ray bursts hosts, andmore »
| 2023-03-26T16:00:18 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4978896677494049, "perplexity": 3008.437653296766}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945473.69/warc/CC-MAIN-20230326142035-20230326172035-00308.warc.gz"}
|
https://par.nsf.gov/biblio/10227256-erratum-measurement-differential-cross-sections-single-diffractive-dissociation-sqrt-tev-pp-collisions-using-atlas-alfa-spectrometer
|
skip to main content
Erratum to: Measurement of differential cross sections for single diffractive dissociation in $$\sqrt{s}$$ = 8 TeV pp collisions using the ATLAS ALFA spectrometer
Figure 5b of the paper [1] contained a misinterpretation in the comparison between the reported new ATLAS measurement of the process pp → Xp and previously published CMS data [2]. The ATLAS measurement corresponds to cases where either proton dissociates.
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
| 2022-09-26T13:10:48 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8877562284469604, "perplexity": 4691.996044213035}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-40/segments/1664030334871.54/warc/CC-MAIN-20220926113251-20220926143251-00631.warc.gz"}
|
https://www.bnl.gov/event.php?q=11686
|
# RIKEN Lunch Seminar
## "CME in Chiral Viscous Hydrodynamics"
#### Presented by Shuzhe Shi, Indiana University
Thursday, July 14, 2016, 12:30 pm — Building 510, Room 2-160
Anomalous chiral transport processes, with the notable examples of Chiral Magnetic Effect (CME) and Chiral Magnetic Wave (CMW), are remarkable phenomena that stem from highly nontrivial interplay of QCD chiral symmetry, axial anomaly, and gluonic topology. The heavy ion collisions, in which topological fluctuations generate chirality imbalance, and very strong magnetic fields $|\vec{\bf B}|\sim m_\pi^2$ are present during the early stage of such collisions, provide a unique environment to study these anomalous chiral transport processes.
Significant experimental efforts have been made to look for signals of CME and various other signals of anomalous chiral transport effects in heavy ion collisions. Crucial for such efforts, is the theoretical development of quantitative simulations based on hydrodynamics that incorporates chiral anomaly, implements realistic initial conditions and properly accounts for possible backgrounds. We will introduce our recent progress to understand CME qualitatively, based on a 2+1D viscous hydrodynamics framework
Hosted by: Hiroshi Ohki
11686 | INT/EXT | Events Calendar
| 2021-11-30T12:26:43 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4243312478065491, "perplexity": 3370.931671425401}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964358973.70/warc/CC-MAIN-20211130110936-20211130140936-00311.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Ahu.yi
|
# zbMATH — the first resource for mathematics
## Hu, Yi
Compute Distance To:
Author ID: hu.yi Published as: Hu, Y.; Hu, Yi Homepage: http://math.arizona.edu/~yhu/ External Links: MGP · Wikidata
Documents Indexed: 62 Publications since 1987
all top 5
#### Co-Authors
16 single-authored 3 Li, Xiaochun 2 Li, Jun 2 Li, Wei-Ping 2 Shao, Yijun 2 Yau, Shing-Tung 1 Boden, Hans U. 1 Burns, Daniel M. jun. 1 Dolgachev, Igor’ Vladimirovich 1 Foth, Philip A. 1 Keel, Sean 1 Kim, Sangjib 1 Lin, Jiayuan 1 Liu, Chien-Hao 1 Luo, Tie
all top 5
#### Serials
3 International Journal of Mathematics 3 Pure and Applied Mathematics Quarterly 2 Duke Mathematical Journal 2 Journal of Differential Geometry 2 Mathematische Annalen 2 Proceedings of the American Mathematical Society 2 Advances in Theoretical and Mathematical Physics 1 Compositio Mathematica 1 Publications Mathématiques 1 Journal of Algebra 1 Michigan Mathematical Journal 1 Transactions of the American Mathematical Society 1 Discrete & Computational Geometry 1 Revista Matemática Iberoamericana 1 The Journal of Geometric Analysis 1 Communications in Analysis and Geometry 1 Mathematical Research Letters 1 The Asian Journal of Mathematics 1 Analysis & PDE
all top 5
#### Fields
28 Algebraic geometry (14-XX) 7 Differential geometry (53-XX) 3 Harmonic analysis on Euclidean spaces (42-XX) 3 Convex and discrete geometry (52-XX) 2 Combinatorics (05-XX) 2 Several complex variables and analytic spaces (32-XX) 2 Partial differential equations (35-XX) 2 Quantum theory (81-XX) 1 Number theory (11-XX) 1 Commutative algebra (13-XX) 1 Associative rings and algebras (16-XX) 1 Category theory; homological algebra (18-XX) 1 Group theory and generalizations (20-XX) 1 Topological groups, Lie groups (22-XX) 1 Functional analysis (46-XX) 1 Operator theory (47-XX) 1 Manifolds and cell complexes (57-XX)
#### Citations contained in zbMATH Open
28 Publications have been cited 384 times in 336 Documents Cited by Year
Mori dream spaces and GIT. Zbl 1077.14554
Hu, Yi; Keel, Sean
2000
Variation of geometric invariant theory quotients. (With an appendix: “An example of a thick wall” by Nicolas Ressayre). Zbl 1001.14018
Dolgachev, Igor V.; Hu, Yi
1998
A compactification of open varieties. Zbl 1083.14004
Hu, Yi
2003
Variations of moduli of parabolic bundles. Zbl 0821.14007
Boden, Hans U.; Hu, Yi
1995
The geometry and topology of quotient varieties of torus actions. Zbl 0812.14031
Hu, Yi
1992
Stable configurations of linear subspaces and quotient coherent sheaves. Zbl 1100.14039
Hu, Yi
2005
Discrete Fourier restriction associated with Schrödinger equations. Zbl 1314.42010
Hu, Yi; Li, Xiaochun
2014
Discrete Fourier restriction associated with KdV equations. Zbl 1280.35125
Hu, Yi; Li, Xiaochun
2013
Genus-one stable maps, local equations, and Vakil-Zinger’s desingularization. Zbl 1201.14019
Hu, Yi; Li, Jun
2010
HyperKähler manifolds and birational transformations in dimension 4. Zbl 1080.14508
Burns, Dan; Hu, Yi; Luo, Tie
2003
Relative geometric invariant theory and universal moduli spaces. Zbl 0889.14005
Hu, Yi
1996
On the homology of complements of arrangements of subspaces and spheres. Zbl 0810.57017
Hu, Yi
1994
HyperKähler manifolds and birational transformations. Zbl 1044.81105
Hu, Y.; Yau, S.-T.
2002
Toric morphisms and fibrations of toric Calabi-Yau hypersurfaces. Zbl 1033.81069
Hu, Yi; Liu, Chien-Hao; Yau, Shing-Tung
2002
Toric degenerations of weight varieties and applications. Zbl 1098.14037
Foth, Philip; Hu, Yi
2005
Topological aspects of Chow quotients. Zbl 1087.14032
Hu, Yi
2005
Moduli spaces of stable polygons and symplectic structures on $$\overline{\mathcal M}_{0,n}$$. Zbl 1054.14018
Hu, Yi
1999
Variation of the Gieseker and Uhlenbeck compactifications. Zbl 0877.14009
Hu, Yi; Li, Wei-Ping
1995
A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems. Zbl 1365.65241
Fu, Hongsun; Liu, Hongbo; Han, Bo; Yang, Yu; Hu, Yi
2017
Local well-posedness of periodic fifth-order KdV-type equations. Zbl 1321.35200
Hu, Yi; Li, Xiaochun
2015
Adaptive backstepping control for flexible-joint manipulator using interval type-2 fuzzy neural network approximator. Zbl 1430.93112
Dian, Songyi; Hu, Yi; Zhao, Tao; Han, Jixia
2019
Numerical study on the dissipation of water waves over a viscous fluid-mud layer. Zbl 1390.76143
Deng, Bing-Qing; Hu, Yi; Guo, Xin; Dalrymple, Robert A.; Shen, Lian
2017
Entanglement and decoherence of coupled superconductor qubits in contact with a common environment. Zbl 1245.81010
Ji, Y. H.; Hu, Y.; Yu, Y. X.
2011
Controlling on entangled decoherence by the interaction model between qubit and environment. Zbl 1225.81013
Ji, Y. H.; Lai, H. F.; Hu, Y.
2011
Toric degenerations of GIT quotients, Chow quotients, and $$\overline {M}_{0,n}$$. Zbl 1144.14006
Hu, Yi
2008
Quotients by reductive group, Borel subgroup, unipotent group and maximal torus. Zbl 1110.14041
Hu, Yi
2006
$$(W,R)$$-matroids and thin Schubert-type cells attached to algebraic torus actions. Zbl 0867.14020
Hu, Yi
1995
Erratum to: The geometry and topology of quotient varieties of torus actions. Zbl 0812.14032
Hu, Yi
1992
Adaptive backstepping control for flexible-joint manipulator using interval type-2 fuzzy neural network approximator. Zbl 1430.93112
Dian, Songyi; Hu, Yi; Zhao, Tao; Han, Jixia
2019
A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems. Zbl 1365.65241
Fu, Hongsun; Liu, Hongbo; Han, Bo; Yang, Yu; Hu, Yi
2017
Numerical study on the dissipation of water waves over a viscous fluid-mud layer. Zbl 1390.76143
Deng, Bing-Qing; Hu, Yi; Guo, Xin; Dalrymple, Robert A.; Shen, Lian
2017
Local well-posedness of periodic fifth-order KdV-type equations. Zbl 1321.35200
Hu, Yi; Li, Xiaochun
2015
Discrete Fourier restriction associated with Schrödinger equations. Zbl 1314.42010
Hu, Yi; Li, Xiaochun
2014
Discrete Fourier restriction associated with KdV equations. Zbl 1280.35125
Hu, Yi; Li, Xiaochun
2013
Entanglement and decoherence of coupled superconductor qubits in contact with a common environment. Zbl 1245.81010
Ji, Y. H.; Hu, Y.; Yu, Y. X.
2011
Controlling on entangled decoherence by the interaction model between qubit and environment. Zbl 1225.81013
Ji, Y. H.; Lai, H. F.; Hu, Y.
2011
Genus-one stable maps, local equations, and Vakil-Zinger’s desingularization. Zbl 1201.14019
Hu, Yi; Li, Jun
2010
Toric degenerations of GIT quotients, Chow quotients, and $$\overline {M}_{0,n}$$. Zbl 1144.14006
Hu, Yi
2008
Quotients by reductive group, Borel subgroup, unipotent group and maximal torus. Zbl 1110.14041
Hu, Yi
2006
Stable configurations of linear subspaces and quotient coherent sheaves. Zbl 1100.14039
Hu, Yi
2005
Toric degenerations of weight varieties and applications. Zbl 1098.14037
Foth, Philip; Hu, Yi
2005
Topological aspects of Chow quotients. Zbl 1087.14032
Hu, Yi
2005
A compactification of open varieties. Zbl 1083.14004
Hu, Yi
2003
HyperKähler manifolds and birational transformations in dimension 4. Zbl 1080.14508
Burns, Dan; Hu, Yi; Luo, Tie
2003
HyperKähler manifolds and birational transformations. Zbl 1044.81105
Hu, Y.; Yau, S.-T.
2002
Toric morphisms and fibrations of toric Calabi-Yau hypersurfaces. Zbl 1033.81069
Hu, Yi; Liu, Chien-Hao; Yau, Shing-Tung
2002
Mori dream spaces and GIT. Zbl 1077.14554
Hu, Yi; Keel, Sean
2000
Moduli spaces of stable polygons and symplectic structures on $$\overline{\mathcal M}_{0,n}$$. Zbl 1054.14018
Hu, Yi
1999
Variation of geometric invariant theory quotients. (With an appendix: “An example of a thick wall” by Nicolas Ressayre). Zbl 1001.14018
Dolgachev, Igor V.; Hu, Yi
1998
Relative geometric invariant theory and universal moduli spaces. Zbl 0889.14005
Hu, Yi
1996
Variations of moduli of parabolic bundles. Zbl 0821.14007
Boden, Hans U.; Hu, Yi
1995
Variation of the Gieseker and Uhlenbeck compactifications. Zbl 0877.14009
Hu, Yi; Li, Wei-Ping
1995
$$(W,R)$$-matroids and thin Schubert-type cells attached to algebraic torus actions. Zbl 0867.14020
Hu, Yi
1995
On the homology of complements of arrangements of subspaces and spheres. Zbl 0810.57017
Hu, Yi
1994
The geometry and topology of quotient varieties of torus actions. Zbl 0812.14031
Hu, Yi
1992
Erratum to: The geometry and topology of quotient varieties of torus actions. Zbl 0812.14032
Hu, Yi
1992
all top 5
#### Cited by 394 Authors
15 Hausen, Jürgen 8 Keicher, Simon 8 Laface, Antonio 7 Gonzalez, Jose Luis 6 Casagrande, Cinzia 6 Gallardo, Patricio 5 Favero, David 5 Fujita, Kento 5 Greb, Daniel 5 Hu, Yi 5 Karu, Kalle 5 Katzarkov, Ludmil 5 Lahyane, Mustapha 5 Laza, Radu 5 Massarenti, Alex 5 Medina, Juan Bosco Frias 5 Park, Jinhyung 4 Ballard, Matthew Robert 4 de la Rosa Navarro, Brenda Leticia 4 Giansiracusa, Noah 4 Gibney, Angela 4 Howard, Benjamin J. 4 Hughes, Kevin J. 4 Jensen, David W. 4 Kurano, Kazuhiko 4 Moon, Han-Bom 4 Velasco, Mauricio 4 Wiśńiewski, Jarosław Antoni 3 Ahmadinezhad, Hamid 3 Alper, Jarod 3 Altmann, Klaus 3 Arzhantsev, Ivan Vladimirovich 3 Bäker, Hendrik 3 Berchtold, Florian 3 Bourqui, David 3 Choi, Sung Rak 3 Coskun, Izzet 3 Diemer, Colin 3 Fedorchuk, Maksym 3 Fu, Baohua 3 Gaiffi, Giovanni 3 Hacon, Christopher Derek 3 Halpern-Leistner, Daniel 3 Hassett, Brendan 3 Hering, Milena 3 Macrì, Emanuele 3 Martinez-Garcia, Jesus 3 McKernan, James 3 Payne, Sam 3 Ross, Julius 3 Rossi, Michele 3 Swinarski, David 3 Toma, Matei 2 Alexeev, Valery A. 2 Araujo, Carolina 2 Bahri, Anthony P. 2 Battistella, Luca 2 Bayer, Arend 2 Bendersky, Martin 2 Boden, Hans U. 2 Braun, Volker 2 Callegaro, Filippo 2 Carocci, Francesca 2 Casalaina-Martin, Sebastian 2 Castravet, Ana-Maria 2 Chen, Dawei 2 Cohen, Frederick Ronald 2 Craw, Alastair 2 Deliu, Dragos 2 Derenthal, Ulrich 2 Dong, Dong 2 Dumitrescu, Olivia 2 Elizondo, E. Javier 2 Fahrner, Anne 2 Fan, Huijun 2 Galindo Pastor, Carlos 2 Gitler Hammer, Samuel Carlos 2 Gongyo, Yoshinori 2 González Anaya, Javier 2 Hochenegger, Andreas 2 Hwang, Dongseon 2 Ito, Atsushi M. 2 Jarvis, Tyler J. 2 Jow, Shin-Yao 2 Kedzierski, Oskar 2 Keel, Sean 2 Kerr, Gabriel 2 Kiem, Young-Hoon 2 Kim, Bumsig 2 Kirwan, Frances Clare 2 Knutsen, Andreas Leopold 2 Kumar, Shrawan 2 Lehmann, Brian 2 Li, Li 2 Manolache, Cristina 2 Martens, Johan 2 Martinengo, Elena 2 Millson, John J. 2 Monserrat, Francisco 2 Morrison, Ian ...and 294 more Authors
all top 5
#### Cited in 103 Serials
27 Advances in Mathematics 25 Journal of Algebra 21 Transactions of the American Mathematical Society 15 Mathematische Annalen 13 Mathematische Zeitschrift 12 Journal of Pure and Applied Algebra 10 Michigan Mathematical Journal 9 Duke Mathematical Journal 8 Geometriae Dedicata 7 Annales de l’Institut Fourier 7 Proceedings of the American Mathematical Society 7 Journal of the American Mathematical Society 7 International Journal of Mathematics 7 Journal of Algebraic Geometry 6 Manuscripta Mathematica 5 Compositio Mathematica 5 Inventiones Mathematicae 5 Journal für die Reine und Angewandte Mathematik 5 Transformation Groups 4 Communications in Algebra 4 Proceedings of the London Mathematical Society. Third Series 4 Selecta Mathematica. New Series 4 Geometry & Topology 4 Journal of High Energy Physics 4 European Journal of Mathematics 3 Mathematics of Computation 3 Journal of the Mathematical Society of Japan 3 Nagoya Mathematical Journal 3 Publications of the Research Institute for Mathematical Sciences, Kyoto University 3 Topology and its Applications 3 Journal of the European Mathematical Society (JEMS) 3 Comptes Rendus. Mathématique. Académie des Sciences, Paris 2 Communications in Mathematical Physics 2 Israel Journal of Mathematics 2 Acta Mathematica Vietnamica 2 Journal of the London Mathematical Society. Second Series 2 Mathematische Nachrichten 2 Proceedings of the Edinburgh Mathematical Society. Series II 2 Journal de Mathématiques Pures et Appliquées. Neuvième Série 2 Bulletin of the American Mathematical Society. New Series 2 Experimental Mathematics 2 Revista Matemática Complutense 2 Acta Mathematica Sinica. English Series 2 Journal of Evolution Equations 2 Algebra & Number Theory 1 Computers and Fluids 1 Computer Physics Communications 1 International Journal of Theoretical Physics 1 Mathematical Notes 1 Mathematical Proceedings of the Cambridge Philosophical Society 1 Chaos, Solitons and Fractals 1 Beiträge zur Algebra und Geometrie 1 Bulletin of the London Mathematical Society 1 Canadian Journal of Mathematics 1 Canadian Mathematical Bulletin 1 Collectanea Mathematica 1 Glasgow Mathematical Journal 1 Illinois Journal of Mathematics 1 Publications Mathématiques 1 Journal of Differential Equations 1 Osaka Journal of Mathematics 1 Pacific Journal of Mathematics 1 Rendiconti del Circolo Matemàtico di Palermo. Serie II 1 Rendiconti del Seminario Matematico della Università di Padova 1 Tohoku Mathematical Journal. Second Series 1 Transactions of the Moscow Mathematical Society 1 Chinese Annals of Mathematics. Series B 1 Applied Numerical Mathematics 1 Journal of Complexity 1 Revista Matemática Iberoamericana 1 International Journal of Algebra and Computation 1 Differential Geometry and its Applications 1 The Journal of Geometric Analysis 1 Geometric and Functional Analysis. GAFA 1 Linear Algebra and its Applications 1 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 1 Expositiones Mathematicae 1 Indagationes Mathematicae. New Series 1 Journal of Algebraic Combinatorics 1 Journal de Théorie des Nombres de Bordeaux 1 Journal of Mathematical Sciences (New York) 1 Annales Mathématiques Blaise Pascal 1 Computational and Applied Mathematics 1 Journal of Lie Theory 1 Nonlinear Dynamics 1 Taiwanese Journal of Mathematics 1 Algebras and Representation Theory 1 Wuhan University Journal of Natural Sciences (WUJNS) 1 Annals of Mathematics. Second Series 1 LMS Journal of Computation and Mathematics 1 Advances in Geometry 1 Journal of the Australian Mathematical Society 1 Central European Journal of Mathematics 1 International Journal of Quantum Information 1 Mediterranean Journal of Mathematics 1 International Journal of Number Theory 1 SIGMA. Symmetry, Integrability and Geometry: Methods and Applications 1 Japanese Journal of Mathematics. 3rd Series 1 Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM 1 Forum of Mathematics, Sigma ...and 3 more Serials
all top 5
#### Cited in 38 Fields
294 Algebraic geometry (14-XX) 31 Commutative algebra (13-XX) 23 Several complex variables and analytic spaces (32-XX) 19 Differential geometry (53-XX) 18 Convex and discrete geometry (52-XX) 15 Associative rings and algebras (16-XX) 13 Number theory (11-XX) 12 Category theory; homological algebra (18-XX) 12 Quantum theory (81-XX) 11 Group theory and generalizations (20-XX) 11 Harmonic analysis on Euclidean spaces (42-XX) 11 Algebraic topology (55-XX) 8 Partial differential equations (35-XX) 7 Manifolds and cell complexes (57-XX) 6 Combinatorics (05-XX) 6 Operator theory (47-XX) 6 Global analysis, analysis on manifolds (58-XX) 5 Topological groups, Lie groups (22-XX) 4 Dynamical systems and ergodic theory (37-XX) 4 Fluid mechanics (76-XX) 3 Nonassociative rings and algebras (17-XX) 3 Numerical analysis (65-XX) 2 Order, lattices, ordered algebraic structures (06-XX) 2 $$K$$-theory (19-XX) 2 General topology (54-XX) 2 Biology and other natural sciences (92-XX) 2 Systems theory; control (93-XX) 1 Measure and integration (28-XX) 1 Functions of a complex variable (30-XX) 1 Special functions (33-XX) 1 Difference and functional equations (39-XX) 1 Integral equations (45-XX) 1 Functional analysis (46-XX) 1 Computer science (68-XX) 1 Mechanics of particles and systems (70-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Relativity and gravitational theory (83-XX) 1 Operations research, mathematical programming (90-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-05-18T21:05:14 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3517937958240509, "perplexity": 6260.990408538393}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-21/segments/1620243991514.63/warc/CC-MAIN-20210518191530-20210518221530-00401.warc.gz"}
|
https://par.nsf.gov/biblio/10379708-dust-temperature-uncertainties-hamper-inference-dust-molecular-gas-masses-from-dust-continuum-emission-quiescent-high-redshift-galaxies
|
Dust Temperature Uncertainties Hamper the Inference of Dust and Molecular Gas Masses from the Dust Continuum Emission of Quiescent High-redshift Galaxies
Abstract
Single flux density measurements at observed-frame submillimeter and millimeter wavelengths are commonly used to probe dust and gas masses in galaxies. In this Letter, we explore the robustness of this method to infer dust mass, focusing on quiescent galaxies, using a series of controlled experiments on four massive halos from the Feedback in Realistic Environments project. Our starting point is four star-forming central galaxies at seven redshifts betweenz= 1.5 andz= 4.5. We generate modified quiescent galaxies that have been quenched for 100 Myr, 500 Myr, or 1 Gyr prior to each of the studied redshifts by reassigning stellar ages. We derive spectral energy distributions for each fiducial and modified galaxy using radiative transfer. We demonstrate that the dust mass inferred is highly dependent on the assumed dust temperature,Tdust, which is often unconstrained observationally. Motivated by recent work on quiescent galaxies that assumedTdust∼ 25 K, we show that the ratio between dust mass and 1.3 mm flux density can be higher than inferred by up to an order of magnitude, due to the considerably lower dust temperatures seen in non-star-forming galaxies. This can lead to an underestimation of dust mass (and, when submillimeter flux density is used as a proxy more »
Authors:
; ;
Publication Date:
NSF-PAR ID:
10379708
Journal Name:
The Astrophysical Journal Letters
Volume:
939
Issue:
2
Page Range or eLocation-ID:
Article No. L27
ISSN:
2041-8205
Publisher:
DOI PREFIX: 10.3847
1. ABSTRACT The infrared (IR) spectral energy distributions (SEDs) of main-sequence galaxies in the early Universe (z > 4) is currently unconstrained as IR continuum observations are time-consuming and not feasible for large samples. We present Atacama Large Millimetre Array Band 8 observations of four main-sequence galaxies at z ∼ 5.5 to study their IR SED shape in detail. Our continuum data (rest-frame 110 $\rm \mu m$, close to the peak of IR emission) allows us to constrain luminosity-weighted dust temperatures and total IR luminosities. With data at longer wavelengths, we measure for the first time the emissivity index at these redshifts to provide more robust estimates of molecular gas masses based on dust continuum. The Band 8 observations of three out of four galaxies can only be reconciled with optically thin emission redward of rest-frame $100\, {\rm \mu m}$. The derived dust peak temperatures at z ∼ 5.5 ($30\!-\!43\, {\rm K}$) are elevated compared to average local galaxies, however, $\sim 10\, {\rm K}$ below what would be predicted from an extrapolation of the trend at z < 4. This behaviour can be explained by decreasing dust abundance (or density) towards high redshifts, which would cause the IR SED at the peakmore »
3. ABSTRACT We present the first detailed study of the spatially resolved dust continuum emission of simulated galaxies at 1 < z < 5. We run the radiative transfer code skirt on a sample of submillimetre-bright galaxies drawn from the Feedback In Realistic Environments (FIRE) project. These simulated galaxies reach Milky Way masses by z = 2. Our modelling provides predictions for the full rest-frame far-ultraviolet-to-far-infrared spectral energy distributions of these simulated galaxies, as well as 25-pc resolution maps of their emission across the wavelength spectrum. The derived morphologies are notably different in different wavebands, with the same galaxy often appearing clumpy and extended in the far-ultraviolet yet an ordered spiral at far-infrared wavelengths. The observed-frame 870-$\mu$m half-light radii of our FIRE-2 galaxies are ${\sim} 0.5\rm {-}4\, \rm {kpc}$, consistent with existing ALMA observations of galaxies with similarly high redshifts and stellar masses. In both simulated and observed galaxies, the dust continuum emission is generally more compact than the cold gas and the dust mass, but more extended than the stellar component. The most extreme cases of compact dust emission seem to be driven by particularly compact recent star formation, which generates steep dust temperature gradients. Our results confirm that the spatial extent of the dust continuummore »
| 2023-02-08T14:48:17 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6879186630249023, "perplexity": 2664.835577724573}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500813.58/warc/CC-MAIN-20230208123621-20230208153621-00383.warc.gz"}
|
https://par.nsf.gov/biblio/10055516-objective-approach-quantification-strain-three-dimensions-consideration-error-assessment
|
An objective approach to the quantification of strain in three-dimensions with consideration of error assessment
The quantification of strain in three-dimensions is a powerful tool for structural investigations, allowing for the direct consideration of the localization and delocalization of deformation in space, and potentially, in time. Furthermore, characterization of the distribution of strain in three-dimensions may yield information concerning large-scale kinematics that may not be obtained through the traditional use of asymmetric fabrics. In this contribution, we present a streamlined methodology for the calculation of three-dimensional strain using objective approaches that allow for consideration of error assessment. This approach begins with the collection of suitable samples for strain analysis following either the Rf/ϕ or normalized Fry techniques. Samples are cut along three mutually perpendicular orientations using a set of jigs designed for use in a large oil saw. Cut faces are polished and scanned in high resolution. Scanned images are processed following a standard convention. The boundaries of objects are outlined as “Regions Of Interest” in the open-source program ImageJ and saved. A script reads the saved files of object outlines and statistically fits an ellipse to each digitized object. The parameters of fitted objects are then extracted and saved. Two-dimensional strain analyses are completed following the normalized Fry method or the Rf/ϕ technique following more »
Authors:
;
Award ID(s):
Publication Date:
NSF-PAR ID:
10055516
Journal Name:
Abstracts with programs - Geological Society of America
Volume:
50
Issue:
2
ISSN:
0016-7592
National Science Foundation
##### More Like this
1. Abstract Background
Prior work described an approach for mapping the two-dimensional spatial distribution of biaxial residual stress in plate-like samples, the approach combining multiple slitting measurements with elastic stress analysis.
Objective
This paper extends the prior work by applying a new variation of the slitting method that uses measurements of cut mouth opening displacement (CMOD) rather than back-face strain (BFS).
Methods
First, CMOD slitting is validated using an experiment where: BFS and CMOD are measured simultaneously on the same sample during incremental slitting; two residual stress profiles are computed, one from the BFS data and a second from the CMOD data; and the two residual stress profiles are compared. Following validation, multiple adjacent CMOD slitting measurements are used to construct two-dimensional maps of residual stress in plates cut from quenched aluminum.
Results
The two residual stress versus depth profiles, each computed separately from BFS or CMOD data, are in agreement, with compression near the plate boundaries (-150 MPa) and tension near the plate center (100 MPa); differences between the two stress profiles have a maximum of 25 MPa and a RMS of 7.2 MPa. Repeated biaxial residual stress mapping measurements show the CMOD technique is repeatable, and complementary contour method measurements show the mappingsmore »
2. (Ed.)
The Neural Engineering Data Consortium (NEDC) is developing the Temple University Digital Pathology Corpus (TUDP), an open source database of high-resolution images from scanned pathology samples [1], as part of its National Science Foundation-funded Major Research Instrumentation grant titled “MRI: High Performance Digital Pathology Using Big Data and Machine Learning” [2]. The long-term goal of this project is to release one million images. We have currently scanned over 100,000 images and are in the process of annotating breast tissue data for our first official corpus release, v1.0.0. This release contains 3,505 annotated images of breast tissue including 74 patients with cancerous diagnoses (out of a total of 296 patients). In this poster, we will present an analysis of this corpus and discuss the challenges we have faced in efficiently producing high quality annotations of breast tissue. It is well known that state of the art algorithms in machine learning require vast amounts of data. Fields such as speech recognition [3], image recognition [4] and text processing [5] are able to deliver impressive performance with complex deep learning models because they have developed large corpora to support training of extremely high-dimensional models (e.g., billions of parameters). Other fields that do notmore »
3. This paper presents a data-processing technique that improves the accuracy and precision of absorption-spectroscopy measurements by isolating the molecular absorbance signal from errors in the baseline light intensity ($Io$) using cepstral analysis. Recently, cepstral analysis has been used with traditional absorption spectrometers to create a modified form of the time-domain molecular free-induction decay (m-FID) signal, which can be analyzed independently from$Io$. However, independent analysis of the molecular signature is not possible when the baseline intensity and molecular response do not separate well in the time domain, which is typical when using injection-current-tuned lasers [e.g., tunable diode and quantum cascade lasers (QCLs)] and other light sources with pronounced intensity tuning. In contrast, the method presented here is applicable to virtually all light sources since it determines gas properties by least-squares fitting a simulated m-FID signal (comprising an estimated$Io$and simulated absorbance spectrum) to the measured m-FID signal in the time domain. This method is insensitive to errors in the estimated$Io$, which vary slowly with optical frequency and, therefore, decay rapidly in the time domain. The benefits provided by this method are demonstrated via scanned-wavelength direct-absorption-spectroscopy measurements acquired with a distributed-feedback (DFB) QCL. The wavelength ofmore »
4. Three-dimensional objects are commonly represented as 3D boxes in a point-cloud. This representation mimics the well-studied image-based 2D bounding-box detection but comes with additional challenges. Objects in a 3D world do not follow any particular orientation, and box-based detectors have difficulties enumerating all orientations or fitting an axis-aligned bounding box to rotated objects. In this paper, we instead propose to represent, detect, and track 3D objects as points. Our framework, CenterPoint, first detects centers of objects using a keypoint detector and regresses to other attributes, including 3D size, 3D orientation, and velocity. In a second stage, it refines these estimates using additional point features on the object. In CenterPoint, 3D object tracking simplifies to greedy closest-point matching. The resulting detection and tracking algorithm is simple, efficient, and effective. CenterPoint achieved state-of-the-art performance on the nuScenes benchmark for both 3D detection and tracking, with 65.5 NDS and 63.8 AMOTA for a single model. On the Waymo Open Dataset, CenterPoint outperforms all previous single model methods by a large margin and ranks first among all Lidar-only submissions.
5. The recent development of three-dimensional graphic statics (3DGS) has greatly increased the ease of designing complex and efficient spatial funicular structural forms [1]. The reciprocal diagram based 3DGS approaches not only generate highly efficient funicular structures [2], but also result in planarity constraints due to the polyhedron nature of the reciprocal diagrams [3]. Our previous research has shown the feasibility of leveraging this planarity by using planar glass sheets to materialize the 10m-span, double-layer glass bridge [3]. This paper is framed as a proof of concept for the 10m bridge and explores the form-finding, detail configuration, fabrication constraints, and assembly logic by designing and constructing a small-scale bridge prototype with a span of 2.5m. The prototype is designed in a modular approach, where each polyhedral cell of the form is materialized using a hollow glass unit (HGU) (Figure 1a), which can be prefabricated and preassembled, and therefore, greatly simplifies the assembly of the whole bridge. The compression-only form of the prototype is generated using the PolyFrame beta [4] plug-in for Rhinoceros [5]. The form-finding is carried out with a comprehensive consideration of a variety of parameters, including fabrication constraints, assembly ease, construction cost, and practicality. To start the form-finding process,more »
| 2023-02-04T22:42:31 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 5, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3762851059436798, "perplexity": 2770.67564436901}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500154.33/warc/CC-MAIN-20230204205328-20230204235328-00057.warc.gz"}
|
https://math.animations.fossee.in/contents/calculus-of-several-variables/div-grad-curl-and-all-that/vec-f-is-conservative-implies-curl-f=0
|
# Theorem
If $\vec F$ is a conservative vector field, then curl $\vec F = 0$
1
# Motivation
Imagine rowing a boat inside a whirlpool. You don't have to expend energy doing physical work in order to increase your speed; the velocity of fluid flow increases as you move closer to the centre of the whirlpool. Would you say the velocity field of the whirlpool resembles a conservative field or a non-conservative one? Another associated property of the whirlpool is its curl. What is the nature of the curl of the whirlpool? What is the relationship between its curl and its conservative property?
2
3
Figure 1: A whirlpool
# Bird's Eye View
In our discussion regarding conservative vector fields in the previous lecture, one aspect was strikingly absent. What is the nature of the curl associated with a conservative vector field?
We know that the curl of a vector field indicates the degree of rotation of the vector field. Picture moving along an arbitrary circular path around the vector field. The total work done in going one round depends on the instantaneous rotation, or curl of the vector field. For a vector field that is conservative, the curl is zero. Conversely, for a field that is non-conservative, we obtain a non-zero curl.
Why is this so?
Additionally, can there exist vector fields which are seemingly conservative, but possess a non-zero curl?
These questions are dealt with in the following sections.
4
5
Animation 1: Work done along a closed loop in a conservative field is zero
# Context of the Definition
"If $\vec F$ is conservative, it implies that curl $\vec F = 0$ "
The statement of the theorem deals with a couple of concepts we have encountered in the past. Let's do a quick review of them.
### The curl of a vector field
Curl can be thought of as an operator that takes in one vector field and spits out another, The resultant vector field gives us an idea about the instantaneous rotation at a point in the vector field.
6
7
Animation 2: Recall from the lecture on curl, how a metaphorical paddle wheel is used to determine the components of curl
### The relationship between the curl and the line integral
The curl of a vector field is given by $\nabla \times \vec F$. The line integral of a vector field is computed using $\oint \vec F \cdot \vec dr$. What's interesting is that both the curl operator and the line integral are measuring the same thing - the circulation of the vector field. In certain cases, it might be more accurate to suggest that the curl measures the microscopic circulation at a particular point (or the limit of the region), while the line integral measures the macroscopic circulation along a curve.
8
9
Animation 3: Both the line integral and the curl operator can be used to measure circulation
### Conservative fields
As discussed in the previous lecture note, the conservative field is a vector field in which the line integral along a curve is path independent. Physically, this indicates that the work done in the field is dependent only on the end points and not the path that is taken. This also implies that a conservative field has zero curl, whereas going around a non-conservative field would give you some value of curl.
Recall also, that if a field is conservative, it is also the gradient of some scalar function. In that sense, the words "conservative field" and "gradient field" are synonymous.
10
Equipped with these two concepts, we attempt to answer the following question -
### What is the curl of a gradient field?
Let F be a vector field of the form $\vec F = \vec P\hat i + \vec Q\hat j + \vec R\hat k$
$\vec F$ may be written as the gradient of function f if the line integral $\oint_{C} \vec F \cdot \vec dr$ along a curve C is independent of its path.
Hence,
$\vec F = \nabla f$
That brings us to the theorem in consideration -
Theorem: If $\vec F = \nabla f$, curl $\vec F = 0$
Proof:
Since $\vec F = \nabla f$, $\vec F = \left \langle \frac{\partial f}{\partial x}, \frac{\partial f}{\partial y}, \frac{\partial f}{\partial z} \right \rangle$
Curl is calculated using the cross product notation
$\begin{vmatrix} i & j & k\\ \frac{\partial }{\partial x}& \frac{\partial }{\partial y} & \frac{\partial }{\partial z}\\ \frac{\partial f}{\partial x}& \frac{\partial f}{\partial y} & \frac{\partial f}{\partial z} \end{vmatrix}$
$= (\frac{\partial^{2} f}{\partial y \partial z} - \frac{\partial^{2} f}{\partial z \partial y} ) \hat i - (\frac{\partial^{2} f}{\partial x \partial z} - \frac{\partial^{2} f}{\partial z \partial x} ) \hat j + (\frac{\partial^{2} f}{\partial x \partial y} - \frac{\partial^{2} f}{\partial y \partial x} ) \hat k$
= 0
Note: The above results derives from Clairuat's Theorem, which speaks about the symmetry of second derivatives. This is why each component reduces to zero.
We have successfully proved that the curl of a conservative field is zero. The converse of this theorem proposes is equally interesting; if the curl of the field is zero, does it imply that the field is conservative?
Is curl $\vec F = 0$ a necessary condition for $\vec F$ to be conservative?
### Necessary, but not sufficient
Consider a vector field $\vec F$ with curl $\vec F = 0$. The circulation around a closed loop in this field is equal to zero. In other words, for a curve that begins and ends at the same point A,
$\oint_{C} \vec F \cdot \vec dr = f(A) - f(A) = 0$
As discussed in the previous lecture, this is one of the properties of a conservative field.
We may conclude that a vanishing curl is a necessary condition for the vector field to be considered conservative. However, this condition is not sufficient. We will see why using an example.
11
Example 1: Consider the vector field,
$\vec F = \frac{1}{x^2 + y^2} \begin{bmatrix} -y\\ x\\ 0 \end{bmatrix}$
popularly known as the vortex vector field. The vortex vector field resembles a whirlpool, which was used as an example in the Motivation section.
curl $\vec F = \begin{bmatrix} 0\\ 0\\ \frac{\partial }{\partial x}(\frac{x}{x^2 + y^2}) - \frac{\partial }{\partial y}(\frac{-y}{x^2 + y^2}) \end{bmatrix}$
$= \frac{(x^2 + y^2) -2x^2}{(x^2 + y^2)^2} + \frac{(x^2 + y^2) -2y^2}{(x^2 + y^2)^2}$
= 0
Given curl $\vec F = 0$, we should be able to write $\vec F = \nabla f$ for some function f. However, this is not possible, as we will see below.
Consider a circle in the vector field,
$g(t) = \begin{pmatrix} cos t\\ sin t\\ \end{pmatrix}$
The work done along the circle oriented counter-clockwise is
$\int \vec F \cdot \vec dr = \int_{0}^{2 \pi} \vec F (g(t)) \cdot g'(t) dt$
$= \int \vec F \cdot \vec dr = \int_{0}^{2 \pi} \frac{1}{cos^{2} t + sin^{2} t} \begin{bmatrix} -sint\\ cos t\\ 0 \end{bmatrix} \cdot \begin{bmatrix} -sin t\\ cos t\\ 0 \end{bmatrix} dt$
= $2 \pi$
For a conservative field, the work done around a closed path must be zero. Clearly, that is not the case above. We have found a vector field F with vanishing curl, which is not conservative.
We cannot write $\vec F = \nabla f$, since $\vec F$ is not conservative. This conclusion is not very consistent, as the curl of the vector field is still 0.
A work-around -
There is one way in which $\vec F$ can be represented as a gradient field.
Check
$\vec F = \nabla (arctan \frac{y}{x})$
This equation satisfies the condition above. How is this possible?
13
14
Figure 3: Streamplot of the vortex vector field
### Connected Regions
With regards to the example taken above, the reason the line integration of $\vec F = \nabla (arctan \frac{y}{x})$ gives $2\pi$ despite having a vanishing curl is that f cannot be considered a function at all. In other words, the domain of f has holes in it when it is defined on $U = \left\{(x,y) \neq (0,0) \right\}$. If we restrict the domain of f such that the vector field is defined on the set $U' =\left\{x > 0 \right\}$ instead, the vector field has a corresponding potential function $f = arctan(\frac{y}{x})$
In geometrical terms, U' is simply connected, whereas U is not. The formal definition of the term simply connected is given below -
Simply Connected:
A region is simply connected if one can connect any two points in the region with a path and every path in the region can be deformed to a point within the region.
15
16
`Animation 4: Examples of simply connected regions
17
Animation 5: Examples of regions that are not simply connected
# Pause and Ponder
In the movie A Beautiful Mind based on the life of American mathematician John Nash, Nash challenges his class to a problem in vector calculus in which the region is not simply connected -
Find a region X of $R^3$ with the property that if
V is the set of vector fields F on $R^3$/X which satisfy curl(F) = 0 and,
W is the set of vector fields F which are conservative: $F = \nabla f$,
then, the space $V/W$ should be 8 dimensional.
Although in the movie, Nash hopes the given problem will take his students the rest of their natural lives to solve it, giving it some thought is sure to bring us valuable insights.
The concept of simply connected regions features in other interesting problems as well. Take for example the Poincare Conjecture, which is one of the Millenium Prize Problems. The conjecture deals with whether any three-dimensional space which is simply connected is deformable to a sphere.
18
19
Figure 3: Still from $\textit{A Beautiful Mind}$
• De Rham Cohomology
• Green's Theorem
# References
• Hubbard, John Hamal. Hubbard, Barbara Burke. Vector Calculus, Linear Algebra and Differential Forms: A Unified Approach. Matrix Additions, 2009 - p.568 to p.573 - Chapter 6.11: Forms and Vector Calculus - Potentials
• Notes on Multivariable Calculus by Prof Oliver Knill, Department of Mathematics, Harvard University, available at URL: http://people.math.harvard.edu/~knill
20
Contributor: Mentor & Editor: Verified by: Approved On:
The following notes and their corrosponding animations were created by the above-mentioned contributor and are freely avilable under CC (by SA) licence. The source code for the said animations is avilable on GitHub and is licenced under the MIT licence.
The work under this website is licenced under a Creative Commons Attribution-Share Alike 4.0 International License CC BY-SA
| 2021-04-14T04:38:48 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.703594982624054, "perplexity": 359.72037953626545}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038076819.36/warc/CC-MAIN-20210414034544-20210414064544-00048.warc.gz"}
|
https://www.pnnl.gov/news?news%5B0%5D=research-topic%3AAdvanced%20Hydrocarbon%20Conversion&news%5B1%5D=research-topic%3AEarth%20System%20Science&news%5B2%5D=research-topic%3AEmergency%20Response&news%5B3%5D=research-topic%3AExplosives%20Detection&news%5B4%5D=research-topic%3AFuel%20Cycle%20Research&news%5B5%5D=research-topic%3AHuman%20Health&news%5B6%5D=research-topic%3AHydrogen%20%26%20Fuel%20Cells&news%5B7%5D=research-topic%3AIntegrative%20Omics&news%5B8%5D=research-topic%3APlant%20Science&news%5B9%5D=research-topic%3AReactor%20Operations&news%5B10%5D=research-topic%3ATransportation
|
# News & Media
## Featured Stories
SUBSCRIBE TO PNNL NEWS
## Latest Stories
337 results found
Filtered by Advanced Hydrocarbon Conversion, Earth System Science, Emergency Response, Explosives Detection, Fuel Cycle Research, Human Health, Hydrogen & Fuel Cells, Integrative Omics, Plant Science, Reactor Operations, and Transportation
JUNE 30, 2020
Web Feature
JUNE 25, 2020
Web Feature
### Mapping the Molecular Health Benefits of Exercise
Researchers from 25 institutions around the country, including PNNL, are working to find out how exercise changes the molecular makeup of our cells to generate health benefits.
JUNE 9, 2020
Web Feature
MAY 19, 2020
News Release
### New Study Confirms Important Clues to Fight Ovarian Cancer
A new study using proteogenomics to compare cancerous tissue with normal fallopian tube samples advances insights about the molecular machinery that underlies ovarian cancer.
MAY 15, 2020
Web Feature
### Staying Ahead of Antibiotic Resistance
The recent coronavirus pandemic shows just how quickly a deadly pathogen can sweep across the globe, killing tens of thousands in the U.S. and disrupting daily life for millions more in the span of a few months.
APRIL 28, 2020
News Release
### A Leap in Using Silicon for Battery Anodes
Researchers at PNNL have come up with a novel way to use silicon as an energy storage ingredient, replacing the graphite in electrodes. Silicon can hold 10 times the electrical charge per gram, but it comes with problems of its own.
APRIL 21, 2020
Web Feature
### A Tree-mendous Study: Biomass from Forest Restoration
PNNL and the U.S. Forest Service used a combination of data, models, analytical techniques and software to evaluate forest restoration impacts on the environment, while also assessing the economics of resulting biomass.
APRIL 21, 2020
Web Feature
### Detecting Toxic PFAS with a Chip-Sized Sensor
PNNL has patented an instant, accurate and portable way to detect minuscule amounts of troublesome toxic PFAS chemicals in water samples.
APRIL 21, 2020
Web Feature
### Beneath It All
At PNNL, subsurface science inhabits two separate but interlocking worlds. One looks at basic science, the other at applied science and engineering. Both are funded by the U.S. Department of Energy (DOE).
APRIL 17, 2020
Web Feature
### Identifying the Dark Matter of the Molecular World
Artificial intelligence helps researchers identify metabolites, the small molecules that underlie life.
APRIL 16, 2020
Web Feature
### Rad Revelations from Noble Metals
Nuclear Process Science Initiative researchers at PNNL gain insights into the formation and rupture of high-pressure gas bubbles in nuclear fuel.
MARCH 31, 2020
Web Feature
### Scientists Take Aim at the Coronavirus Toolkit
A PNNL scientist is studying the structures of the proteins on the surface of the novel coronavirus, using NMR spectroscopy to reveal information about the molecular toolkit that holds the keys to a vaccine or treatment.
MARCH 23, 2020
Web Feature
### Defense against Coronavirus Starts with Prevention
PNNL scientists are on the front lines fighting against biological threats through early detection, diagnosis, and prevention strategies.
| 2020-07-04T03:44:57 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.2598773241043091, "perplexity": 14124.732304613959}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-29/segments/1593655883961.50/warc/CC-MAIN-20200704011041-20200704041041-00002.warc.gz"}
|
https://par.nsf.gov/biblio/10361966-vla-alma-nascent-disk-multiplicity-vandam-survey-orion-protostars-characterization-protostellar-multiplicity
|
skip to main content
The VLA/ALMA Nascent Disk And Multiplicity (VANDAM) Survey of Orion Protostars. V. A Characterization of Protostellar Multiplicity
Abstract
We characterize protostellar multiplicity in
Current address: Niels Bohr Institute, University of Copenhagen, Øster Voldgade 5â7, DK-1350, Copenhagen K, Denmark.
the Orion molecular clouds using Atacama Large Millimeter/submillimeter Array 0.87 mm and Very Large Array 9 mm continuum surveys toward 328 protostars. These observations are sensitive to projected spatial separations as small as ∼20 au, and we consider source separations up to 104au as potential companions. The overall multiplicity fraction (MF) and companion fraction (CF) for the Orion protostars are 0.30 ± 0.03 and 0.44 ± 0.03, respectively, considering separations from 20 to 104au. The MFs and CFs are corrected for potential contamination by unassociated young stars using a probabilistic scheme based on the surface density of young stars around each protostar. The companion separation distribution as a whole is double peaked and inconsistent with the separation distribution of solar-type field stars, while the separation distribution of Flat Spectrum protostars is consistent solar-type field stars. The multiplicity statistics and companion separation distributions of the Perseus star-forming region are consistent with those of Orion. Based on the observed peaks in the Class 0 separations at ∼100 au and ∼103au, we argue that multiples with separations <500 au are likely produced by more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10361966
Journal Name:
The Astrophysical Journal
Volume:
925
Issue:
1
Page Range or eLocation-ID:
Article No. 39
ISSN:
0004-637X
Publisher:
DOI PREFIX: 10.3847
Sponsoring Org:
National Science Foundation
##### More Like this
1. Context. HD 113337 is a main-sequence F6V field star more massive than the Sun. This star hosts one confirmed giant planet and possibly a second candidate, detected by radial velocities (RVs). The star also hosts a cold debris disc detected through the presence of an infrared excess, making it an interesting system to explore. Aims. We aim to bring new constraints on the star’s fundamental parameters, debris disc properties, and planetary companion(s) by combining complementary techniques. Methods. We used the VEGA interferometer on the CHARA array to measure the angular diameter of HD 113337. We derived its linear radius using the parallax from the Gaia Second Data Release. We computed the bolometric flux to derive its effective temperature and luminosity, and we estimated its mass and age using evolutionary tracks. Then, we used Herschel images to partially resolve the outer debris disc and estimate its extension and inclination. Next, we acquired high-contrast images of HD 113337 with the LBTI to probe the ~10–80 au separation range. Finally, we combined the deduced contrast maps with previous RVs of the star using the MESS2 software to bring upper mass limits on possible companions at all separations up to 80 au. We tookmore »
2. Abstract We present Markov Chain Monte Carlo radiative transfer modeling of a joint ALMA 345 GHz and spectral energy distribution data set for a sample of 97 protostellar disks from the VLA and ALMA Nascent Disk and Multiplicity Survey of Orion Protostars. From this modeling, we derive disk and envelope properties for each protostar, allowing us to examine the bulk properties of a population of young protostars. We find that disks are small, with a median dust radius of 29.4 − 2.7 + 4.1 au and a median dust mass of 5.8 − 2.7 + 4.6 M ⊕ . We find no statistically significant difference between most properties of Class 0, Class I, and flat-spectrum sources with the exception of envelope dust mass and inclination. The distinction between inclination is an indication that the Class 0/I/flat-spectrum system may be difficult to tie uniquely to the evolutionary state of protostars. When comparing with Class II disk dust masses in Taurus from similar radiative transfer modeling, we further find that the trend of disk dust mass decreasing from Class 0 to Class II disks is no longer present, though it remains unclear whether such a comparison is fair owing to differences inmore »
3. Abstract We present preliminary results from our long-baseline interferometry (LBI) survey to constrain the multiplicity properties of intermediate-mass A-type stars within 80 pc. Previous multiplicity studies of nearby stars exhibit orbital separation distributions well fitted with a lognormal with peaks >15 au, increasing with primary mass. The A-star multiplicity survey of De Rosa et al., sensitive beyond 30 au but incomplete below 100 au, found a lognormal peak around 390 au. Radial velocity surveys of slowly rotating, chemically peculiar Am stars identified a significant number of very close companions with periods ≤5 days, ∼0.1 au, a result similar to surveys of O- and B-type primaries. With the improved performance of LBI techniques, we can probe these close separations for normal A-type stars where other surveys are incomplete. Our initial sample consists of 27 A-type primaries with estimated masses between 1.44 and 2.49 M ⊙ and ages 10–790 Myr, which we observed with the MIRC-X instrument at the CHARA Array. We use the open-source software CANDID to detect five companions, three of which are new, and derive a companion frequency of 0.19 − 0.06 + 0.11 over mass ratios of 0.25–1.0 and projected separations of 0.288–5.481 au. We find a probabilitymore »
4. Abstract
In order to assess the multiplicity statistics of stars across spectral types and populations in a volume-limited sample, we censused nearby stars for companions with Robo-AO. We report on observations of 1157 stars of all spectral types within 25 pc with decl. >−13° searching for tight companions. We detected 154 companion candidates with separations ranging from ∼0.″15 to 4.″0 and magnitude differences up to Δm$i′≤7$using the robotic adaptive optics instrument Robo-AO. We confirmed physical association from Gaia EDR3 astrometry for 53 of the companion candidates, 99 remain to be confirmed, and two were ruled out as background objects. We complemented the high-resolution imaging companion search with a search for comoving objects with separations out to 10,000 au in Gaia EDR3, which resulted in an additional 147 companions registered. Of the 301 total companions reported in this study, 49 of them are new discoveries. Out of the 191 stars with significant acceleration measurements in the Hipparcos–Gaia catalog of accelerations, we detect companions around 115 of them, with the significance of the acceleration increasing as the companion separation decreases. From this survey, we report the following multiplicity fractions (compared to literature values): 40.9% ± 3.0% (44%) formore »
5. ABSTRACT
We search for additional companions in the GJ 367 exoplanet system and aim to better constrain its age and evolutionary status. We analyse high-contrast direct imaging observations obtained with HST/NICMOS, VLT/NACO, and VLT/SPHERE. We investigate and critically discuss conflicting age indicators based on theoretical isochrones and models for Galactic dynamics. A comparison of GAIA EDR3 parallax and photometric measurements with theoretical isochrones suggests a young age ≤60 Myr for GJ 367. The star’s Galactic kinematics exclude membership to any nearby young moving group or stellar stream. Its highly eccentric Galactic orbit, however, is atypical for a young star. Age estimates considering Galactic dynamical evolution are most consistent with an age of 1–8 Gyr. We find no evidence for a significant mid-infrared excess in the WISE bands, suggesting the absence of warm dust in the GJ 367 system. The direct imaging data provide significantly improved detection limits compared to previous studies. At 530 mas (5 au) separation, the SPHERE data achieve a 5σ contrast of 2.6 × 10−6. The data exclude the presence of a stellar companion at projected separations ≥0.4 au. At projected separations ≥5 au we can exclude substellar companions with a mass ≥1.5 MJup for an age of 50 Myr, and ≥20 MJup for an age of 5 Gyr. By applying themore »
| 2023-03-21T08:01:46 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 1, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6313605308532715, "perplexity": 4467.655996804574}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296943637.3/warc/CC-MAIN-20230321064400-20230321094400-00525.warc.gz"}
|
https://nroer.gov.in/55ab34ff81fccb4f1d806025/file/57c6eae916b51c1d3087a4a4
|
### Demonstration of Verification of the Identity:
This is a program on demonstration of verification of the identity
License:[Source CIET, NCERT ]Aug. 11, 2020, 4:41 p.m.
| 2021-06-25T01:22:22 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9747537970542908, "perplexity": 7131.854952675837}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623488560777.97/warc/CC-MAIN-20210624233218-20210625023218-00509.warc.gz"}
|
https://asd.gsfc.nasa.gov/Rubab.Khan/YHG/ms/node6.html
|
Next: Implications Up: Characterizing the Candidates Previous: The 18 Stars and
## SED Modeling
We fit the SEDs of the 18 self-obscured stars using DUSTY (Elitzur & Ivezic2001; Ivezic & Elitzur1997; Ivezic et al.1999) to model radiation transfer through a spherical dusty medium surrounding a star and Figure7 shows the best fit models. We estimate the properties of a black-body source obscured by a surrounding dusty shell that would produce the best fit to the observed SED (see Figure6 for an example). We considered models with either graphitic or silicate (Draine & Lee1984) dust. We distributed the dust in a shell with a density distribution. The models are defined by the stellar luminosity (), stellar temperature (), the total (absorption plus scattering) -band optical depth (), the dust temperature at the inner edge of the dust distribution (), and the shell thickness . The exact value of has little effect on the results, and after a series of experiments with , we fixed for the final results. We embedded DUSTY inside a Markov Chain Monte Carlo (MCMC) driver to fit each SED by varying , , and . We limit to a maximum value of 30,000K to exclude unrealistic temperature regimes.
The parameters of the best fit model determine the radius of the inner edge of the dust distribution (). The mass of the shell is
(1)
where we simply scale the mass for a band dust opacity of cmg and the result can be rescaled for other choices as . Despite using a finite width shell, we focus on because it is well-constrained while (or ) is not. We can also estimate an age for the shell as
(2)
where we scale the results to kms.
For a comparison sample, we followed the same procedures for the SEDs of three well-studied dust obscured stars: Car (Humphreys & Davidson1994); the Galactic OH/IR star IRC+10420 (Jones et al.1993; Humphreys et al.1997; Tiffany et al.2010); and M33's VariableA, which had a brief period of high mass loss leading to dust obscuration over the last years (Humphreys et al.2006; Hubble & Sandage1953; Humphreys et al.1987). We use the same SEDs for these stars as in Khan et al. (2013). In Table3, we report , , , , , , (Equation1), and (Equation2) for the best fit models for these three sources as well as the newly identified stars. The stellar luminosities required for both dust types are mutually consistent because the optically thick dust shell acts as a calorimeter. However, because the stars are heavily obscured and we have limited optical/near-IR SEDs, the stellar temperatures generally are not well constrained. In some cases, for different dust types, equally good models can be obtained for either a hot (, such as a LBV in quiescence) or a relatively cooler (, such as a LBV in outburst) star. Indeed, for many of our 18 sources, the best fit is near the fixed upper limit of . To address this issue, we also tabulated the models on a grid of three fixed stellar temperatures, , for each dust type. The resulting best fit parameters are reported in Tables 4 and 5.
Figure9 shows the integrated luminosities of the newly identified self-obscured stars described in Section3.2 as a function of for the best fit graphitic models of each source. ObjectX, IRC, M33VarA, and Car are shown for comparison. Figure10 shows the same quantities, but for various dust models and temperature assumptions. It is apparent from Figure10 and Tables 3, 4 and 5 that the integrated luminosity and ejecta mass estimates are robust to these uncertainties. The exceptions are N2403-4 and N7793-3. Without any optical or near-IR data, many of the models of N7793-3 are unstable so we simply drop it. The only models having a luminosity in significant excess of are some of the fixed temperature models of N2403-4. These models have a poor goodness of fit and can be ignored.
One check on our selection methods is to examine the distribution of shell radii. Crudely, we can see a shell until it either becomes optically thin or too cold, so the probability distribution of a shell's radius assuming a constant expansion velocity is
(3)
for . An ensemble of shells with similar should then show this distribution. Figure11 shows the cumulative histogram (excluding N7793-3) of the inner shell radii (). The curves show the expected distribution where we simply normalized to the point where . The agreement shows that our sample should be relatively complete up to -cm which corresponds to a maximum age of
(4)
Figure12 shows the age ( ) of the shells as a function of . We also show lines corresponding to optical depths of . As expected, we see no sources with very low or high optical depths, as we should have trouble finding sources with due to a lack of mid-IR emission and due to the dust photosphere being too cold (peak emission in the far-IR). Indeed, most of the dusty stars have and none has . The large estimate for Car when scaled by is due to its unusually large ejecta velocities (kms along the long axis (Smith2006; Cox et al.1995) compared to typical LBV shells (kms, Tiffany et al.2010).
Next: Implications Up: Characterizing the Candidates Previous: The 18 Stars and
Rubab Khan 2014-10-23
| 2018-02-23T18:16:06 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.809065043926239, "perplexity": 1921.9757199189012}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-09/segments/1518891814827.46/warc/CC-MAIN-20180223174348-20180223194348-00149.warc.gz"}
|
https://ouci.dntb.gov.ua/en/?publisher=10.30970&p=9
|
Exclude from search results
Specify ISSN to exclude from search results.
1177
5 728 publications · Export
I.E. Chyzhykov, A.Z. Mokhon'ko
We established new sharp estimates outside exceptional sets for of the logarithmic derivatives $\frac{d^ {k} \log f(z)}{dz^k}$ and its generalization $\frac{f^{(k)}(z)}{f^{(j)}(z)}$, where $f$ is a meromorphic function $f$ in the upper half-plane, $k>j\ge0$ are integers. These estimates improve known estimates due to the second author in the class of meromorphic functions of finite order.Examples show that size of exceptional sets are best possible in some sense.
2020, № 2, p. 172-187
Scopus
A.I. Bandura
We introduce a concept of entire functions having bounded index in a variable direction, i.e. in a frame. An entire function $F\colon\ \mathbb{C}^n\to \mathbb{C}$ is called a function of bounded frame index in a frame $\mathbf{b}(z)$,if~there exists $m_{0} \in\mathbb{Z}_{+}$ such that for every $m \in\mathbb{Z}_{+}$ and for all $z\in \mathbb{C}^{n}$one has $\displaystyle\frac{|{\partial^{m}_{\mathbf{b}(z)}F(z)}|}{m!}\leq\max_{0\leq k \leq m_{0}} \frac{|{\partial^{k}_{\mathbf{b}(z)}F(z)}|}{k!},$where $\partial^{0}_{\mathbf{b}(z)}F(z)=F(z),$ $\partial^{1}_{\mathbf{b}(z)}F(z)=\sum_{j=1}^n \frac{\partial F}{\partial z_j}(z)\cdot b_j(z),$ \ $\partial^{k}_{\mathbf{b}(z)}F(z)=\partial_{\mathbf{b}(z)}(\partial^{k-1}_{\mathbf{b}(z)}F(z))$ for $k\ge 2$ and $\mathbf{b}\colon\ \mathbb{C}^n\to\mathbb{C}^n$ is a entire vector-valued function.There are investigated properties of these functions. We established analogs of propositions known for entire functions of bounded index in direction. The main idea of proof is usage the slice $\{z+t\mathbf{b}(z)\colon\ t\in\mathbb{C}\}$ for given $z\in\mathbb{C}^n.$We proved the following criterion (Theorem 1) describing local behavior of modulus $\partial_{\mathbf{b}(z)}^kF(z+t\mathbf{b}(z))$ on the circle $|t|=\eta$: {\it An entire~function$F\colon\ \mathbb{C}^n\to\mathbb{C}$ is of bounded frame index in the frame $\mathbf{b}(z)$ if and only iffor each $\eta>0$ there exist$n_{0}=n_{0}(\eta)\in \mathbb{Z}_{+}$ and $P_{1}=P_{1}(\eta)\geq 1$such that for every $z\in \mathbb{C}^{n}$ there exists $k_{0}=k_{0}(z)\in \mathbb{Z}_{+},$\$0\leq k_{0}\leq n_{0},$ for which inequality$$\max\left\{\left|{\partial_{\mathbf{b}(z)}^{k_{0}} F(z+t\mathbf{b}(z))}\right|\colon\ |t|\leq\eta \right\}\leqP_{1}\left|\partial_{\mathbf{b}(z)}^{k_{0}}{F(z)}\right|$$holds.
2020, № 2, p. 193-202
Scopus
B.N. Khabibullin
Let $E$ be a measurable subset in a segment $[0,r]$ in the positive part of the real axis in the complex plane, and $U=u-v$ be the difference of subharmonic functions $u\not\equiv -\infty$ and $v\not\equiv -\infty$ on the complex plane. An integral of the maximum on circles centered at zero of $U^+:=\sup\{0,U\}$ or $|u|$ over $E$ with a function-multiplier $g\in L^p(E)$ in the integrand is estimated, respectively, in terms of the characteristic function $T_U$ of $U$ or the maximum of $u$ on circles centered at zero, and also in terms of the linear Lebesgue measure of $E$ and the $L^p$-norm of $g$. Our main theorem develops the proof of one of the classical theorems of Rolf Nevanlinna in the case $E=[0,R]$, given in the classical monograph by Anatoly A. Goldberg and Iossif V. Ostrovsky, and also generalizes analogs of the Edrei\,--\,Fuchs Lemma on small arcs for small intervals from the works of A.\,F.~Grishin, M.\,L.~Sodin, T.\,I.~Malyutina. Our estimates are uniform in the sense that the constants in these estimates do not depend on $U$ or $u$, provided that $U$ has an integral normalization near zero or $u(0)\geq 0$, respectively.
2020, № 2, p. 162-171
Scopus
K.G. Malyutin, A.A. Revenko
The extremal problems in the space of meromorphic functions of order $\rho>0$ in upper half-plane are studed.The method for studying is based on the theory of Fourier coefficients of meromorphic functions. The concept of just meromorphic function of order $\rho>0$ in upper half-plane is introduced. Using Lemma on the P\'olya peaks and the Parseval equality, sharp estimate from below of the upper limits of relations Nevanlinna characteristics of meromorphic functions in the upper half plane are obtained.
2020, № 2, p. 154-161
Scopus
A. O. Kuryliak, O. B. Skaskiv, S. I. Panchuk
In the article is obtained an analogue of Wiman-Bitlyan-Gol'dberg type inequality for entire $f\colon\mathbb{C}^p\to \mathbb{C}$ from the class $\mathcal{E}^{p}(\lambda)$ of functions represented by gap power series of the form$$f(z)=\sum\limits_{k=0}^{+\infty} P_k(z),\quadz\in\mathbb{C}^p.$$Here $P_0(z)\equiv a_{0}\in\mathbb{C},$ $P_k(z)=\sum_{\|n\|=\lambda_k} a_{n}z^{n}$ is homogeneouspolynomial of degree $\lambda_k\in\mathbb{Z}_+,$ ànd $0=\lambda_0<\lambda_k\uparrow +\infty$\ $(1\leq k\uparrow +\infty ),$$\lambda=(\lambda_k)$.\ We consider the exhaustion of thespace\ $\mathbb{C}^{p}$\by the system $(\mathbf{G}_{r})_{r\geq 0}$ of a bounded complete multiple-circular domains $\mathbf{G}_{r}$with the center at the point $\mathbf{0}=(0,\ldots,0)\in \mathbb{C}^{p}$. Define $M(r,f)=\max\{|f(z)|\colon z\in\overline{G}_r\}$, $\mu(r,f)=\max\{|P_k(z))|\colon z\in\overline{G}_r\}$.Let $\mathcal{L}$ be the class of positive continuous functions $\psi\colon \mathbb{R}_{+}\to\mathbb{R}_{+}$ such that $\int_{0}^{+\infty}\frac{dx}{\psi(x)}<+\infty$, $n(t)=\sum_{\lambda_k\leq t}1$ counting function of the sequence $(\lambda_k)$ for $t\geq 0$. The following statement is proved:{\it If a sequence $\lambda=(\lambda_{k})$ satisfy the condition\begin{equation*}(\exists p_1\in (0,+\infty))(\exists t_0>0)(\forall t\geq t_0)\colon\quad n(t+\sqrt{\psi(t)})-n(t-\sqrt{\psi(t)})\leq t^{p_1}\end{equation*}for some function $\psi\in \mathcal{L}$,then for every entire function $f\in\mathcal{E}^{p}(\lambda)$, $p\geq 2$ and for any$\varepsilon>0$ there exist a constant $C=C(\varepsilon, f)>0$ and a set $E=E(\varepsilon, f)\subset [1,+\infty)$ of finite logarithmic measure such that the inequality\begin{equation*}M(r, f)\leq C m(r,f)(\ln m(r, f))^{p_1}(\ln\ln m(r, f))^{p_1+\varepsilon}\end{equation*}holds for all $r\in[1,+\infty]\setminus E$.}The obtained inequality is sharp in general.At $\lambda_k\equiv k$, $p=2$ we have $p_1=1/2+\varepsilon$ and the Bitlyan-Gol'dberg inequality (1959) it follows. In the case $\lambda_k\equiv k$, $p=2$ we have $p_1=1/2+\varepsilon$ and from obtained statement we get the assertion on the Bitlyan-Gol'dberg inequality (1959), and at $p=1$ about the classical Wiman inequality it follows.
2020, № 2, p. 135-145
Scopus
O Bohoslavets, Educational and Scientific Centre Institute of Biology and Medicine Taras Shevchenko National University of Kyiv, A Atamanchuk, V Dzhagan, M Shevchenko, Educational and Scientific Centre Institute of Biology and Medicine Taras Shevchenko National University of Kyiv, M.G. Kholodny Institute of Botany, NAS of Ukraine, Educational and Scientific Centre Institute of Biology and Medicine Taras Shevchenko National University of Kyiv
The paper provides the first information about the mycobiota of 1-8 quarters of Nadvirna forestry, located on the slopes of Horodyshche (598 m above sea level) and Potoky (584 m above sea level) mountains. As a result of the conducted researches on the territory of the forestry there were revealed 107 species of fungi and fungi-like organisms belonging to 92 genera, 49 families, 21 orders, 7 classes and 3 divisions. All the species are listed for the study area for the first time. Particular attention was paid to wood-inhabiting fungi, of which most of the species (68) were recorded on wood of European beech. Seven species (Butyriboletus appendiculatus (Schaeff.) D.Arora & J.L.Frank, Clathrus archeri (Berk.) Dring, Hericium cirrhatum (Pers.) Nikol., Hericium coralloides (Scop.) Pers., Ischnoderma resinosum (Schrad.) P. Karst., Mutinus caninus (Huds.) Fr., Strobilomyces strobilaceus (Scop.) Berk.) appeared to be rare for the study area and the territory of Ukraine as a whole. Four of them (Clathrus archeri, Hericium coralloides, Mutinus caninus, Strobilomyces strobilaceus) are listed in the Red Book of Ukraine and three species (Butyriboletus appendiculatus, Hericium cirrhatum and Ischnoderma resinosum) being recorded with the European Red List and red lists of other countries. Hericium cirrhatum and Ischnoderma resinosum are indicator species of phytocenoses that are of conservation value. Upon finding the rare and sozologically valuable species of fungi, indicating the significant conservation value of the surveyed phytocenoses, and the increase of anthropogenic pressure on the studied forest, the expediency of expanding the existing network of protected areas, strengthening the conservation regime and control over its observance is substantiated. As the surveyed area is characterized by a significant variety of not only mycological but also botanical, zoological and geological objects in need of protection, it is proposed to create a regional landscape park “Nadvirnianskyi lis” throughout the massif, which will protect a large part of the Hvizd structural-erosive low mountain massif, which combines the features of both Pre-Carpathian and Mountain Carpathian landscape complexes.
2020, № 83, p. 39-48
Yu. Shelyuk, Zhitomir Ivan Franko State University
Stable functioning of the ecosystem of the Zhytomir reservoir, which is indicated by the absence of directed changes in the primary production over a long period, is probably supported by the alterations of the algae groups at the level of their structure, by the high speed of incorporation of organic matter into the bio-water cycle, and by large areas of water levels. Over the last 10 years, the role of blue-green algae has decreased in the taxonomic composition of the phytoplankton of the Zhytomir reservoir, while the species richness of green, euglenic and golden ones has increased; there were minor alterations to the phytoplankton structure at the class level and more noticeable changes at the order, family, and birth levels. Over a period of almost ten years the species saturation of the genus Chlamydomonas Ehrenb., Euglena Ehrenb., Cyclotella Kützing., Peridinium Ehrenb. Generally, the generic coefficients and the saturation of species with intraspecific taxa increased (which was also observed for the small Denyshivske reservoir), whereas for large reservoirs of the Dnipro and Volga there is a tendency to simplify the taxonomic structure of phytoplankton with their age. Phytoplankton biomass indicators remained unchanged for almost ten years, however, there was a shift in biomass peaks from summer to autumn. The number of algae cells decreased. Phytoplankton alignment decreased. Inadequacy has been established in the trophic status of the Zhytomir Reservoir, determined by biomass and primary phytoplankton production. The higher trophic level, determined by the intensity of photosynthesis, is probably due to the predominance in the dominant complexes of small-cell highly productive species that support the high trophic status of aquatic ecosystems with relatively low phytoplankton biomass. At the present stage, there is a tendency to improve the water quality of the reservoir according to the saprobiological indicators of phytoplankton development in comparison with 2003–2007.
2020, № 83, p. 49-57
D Miroshnik, VN Karazin Kharkiv National University, Research Institute of Biology, Y Shckorbatov, VN Karazin Kharkiv National University, Research Institute of Biology
The combined effect of doxorubicin and magnetic field on the viability of isolated buccal epithelial cells two donors was investigated. Doxorubicin is an effective antitumor antibiotic, but this drug has a large amount of side effects. This significantly reduces the number of cases when you can change the drug. To reduce the toxic effect or to increase the effectiveness of anticancer therapy, the introduction of additional substances is used. For a long time, magnetic and electromagnetic fields have been used as a therapeutic factor by three therapies for cancer alone, or as an adjunct. Doxorubicin at a concentration of 2 μg/ml for 2 hours has been shown to increase of cell membrane permeability and heterochromatin granule quantity in cell nuclei. Exposure of cells to 25 mT magnetic field for 30 and 60 minutes results in decrease in cell viability and increase in cell membrane permeability and the number of heterochromatin granules in nuclei. Combined exposure to static magnetic field and doxorubicin results in decrease of the number of heterochromatin granules in the nuclei of cells from one of the donors, as compared to the variant of exposure only to doxorubicin, which indicates the protective effect of the magnetic field. A possible mechanism of the protective action of the magnetic field in our experiments is that the stress under the influence of the magnetic field activates the protective mechanisms of the cell (including the transition of chromatin to a heterochromatinized state). That way, been pre-activated due to the action of the magnetic field, the defense mechanisms of the cell reduce the toxic effects caused by doxorubicin.
2020, № 83, p. 14-23
T. Segin, Ivan Franko National University of Lviv, S. Hnatush, O. Maslovska, S. Komplikevych, Ivan Franko National University of Lviv, Ivan Franko National University of Lviv, Ivan Franko National University of Lviv
Due to the high content of organic compounds, the distillery wastewater can be a good substrate for the production of glycogen during cultivation of green photosynthetic bacteria. Green photosynthetic bacteria Chlorobium limicola IMV K-8 are producers of glycogen and show exoelectrogenic properties when grown alone or inside the co-culture with heterotrophic bacteria-exoelectrogens in wastewater of various origins. In our previous works it was found that due to the phototrophic growth of C. limicola IMV K-8 in the distillery wastewater significantly reduces the content of compounds of nitrogen, sulfur, Ca2+, Mg2+ and others. The study of the patterns of glycogen synthesis by green photosynthetic bacteria during growth in such an extreme environment as the wastewater of a distillery has prospects for the development of biotechnology for the production of this polysaccharide. The aim of the study was to investigate the glycogen content in C. limicola IMV K-8 cells under different growth conditions in the wastewater of the distillery. Bacteria were grown in the wastewater of the distillery under light (phototrophic growth) and without light exposure (heterotrophic growth). Bacterial cells grown on GSB medium under light (phototrophic growth) and without light (heterotrophic growth) exposure were used as controls. Glycogen content was determined at 7, 14, 21 and 30 days of growth by the glucose oxidase method. Glucose or glycogen in the wastewater of the distillery without the introduction of bacteria was not detected. It was found that the content of glycogen in cells of C. limicola IMV K-8 grown in the wastewater of the distillery, under light exposure increased from 3.8 % to 39.8 % of cells dry weight from the seventh to third day of growth during 30 days of cultivation and was 2 times higher the glycogen content of cells on GSB medium. It is assumed that the bacteria C. limicola IMV K-8 use available in the water sources of carbon and other compounds necessary for cell metabolism along with glycogen biosynthesis and bioremediation of wastewater. During C. limicola IMV K-8 growth in the darkness there is an assimilation of organic sources of carbon (acetate, pyruvate and probably organic compounds of wastewater), which allows cells to remain viable for 30 days without additional sources of carbon, nitrogen, etc., but significant glycogen synthesis does not occur. The glycogen formed under phototrophic conditions can be further a source of carbon or a substrate for electric current generation by exoelectrogenic bacteria.
2020, № 83, p. 67-73
O Bilonoha, Ivan Franko National University of Lviv, B.O. Manko, V Manko, Ivan Franko National University of Lviv, Ivan Franko National University of Lviv
Insulin increases the basal and agonist-stimulated secretion of pancreatic acinar cells, which leads to increase of energy demand and requires sufficient oxidative substrates supply. Cholecystokinin substantially increases the respiration rate of pancreatic acinar cells upon pyruvate oxidation. However, it is not clear how insulin affects mitochondrial oxidative processes at rest and upon secretory stimulation. Experiments were carried out on male Wistar rats (250–300 g) kept on standard diet. Animals were fasted 12 h before the experiment. Pancreatic acini were isolated with collagenase. Basal and FCCP-stimulated respiration of rat pancreatic acini was measured with Clark electrode. Adaptive capacity of mitochondria was assessed by the maximal rate of uncoupled respiration. Statistical significance (P) of differenced between the means was assessed either with a paired t-test or with repeated measures two-way ANOVA and post-hoc Turkey test. Adaptive capacity of pancreatic acinar mitochondria was significantly higher when pyruvate (2 mM) was used as oxidative substrate comparing with glucose (10 mM). Incubation with insulin (100 nM) for 20 minutes elevated the basal respiration and adaptive capacity of pancreatic acinar mitochondria upon glucose, but not pyruvate, oxidation. Cholecystokinin (0.1 nM, 30 min) stimulated the rate of basal and maximal uncoupled respiration of acinar cells upon pyruvate oxidation, but insulin completely negated this increase of mitochondrial adaptive capacity. Thus, insulin increases the glucose oxidation in pancreatic acinar cells at resting state, but suppresses pyruvate oxidation upon secretory stimulation with cholecystokinin. The mechanisms of insulin action of pyruvate metabolism in pancreatic acinar cells require further elucidation.
2020, № 83, p. 24-30
| 2021-04-11T01:32:36 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.46446147561073303, "perplexity": 4241.038937882902}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618038060603.10/warc/CC-MAIN-20210411000036-20210411030036-00613.warc.gz"}
|
https://science.iea.gov.ua/en/general-secondary-education22022-2/
|
# GENERAL SECONDARY EDUCATION2’2022
Valentyna Gapon
https://orcid.org/0000-0001-7521-5450
Liudmyla Chymbay
https://orcid.org/0000-0002-4647-2471
#### ASSESSMENT OF THE ACCURACY OF THE DEVELOPED FORECAST OF THE STUDENT POPULATION IN FULL-TIME GENERAL SECONDARY EDUCATION INSTITUTIONS
Full text (pdf)
Language: Ukrainian
Abstract. In recent years, the development trends of the general secondary education in Ukraine formed under the influence of the negative demographic situation, have particularly highlighted the problem of defining and implementing a strategy for further reform and development faced by the education management authorities. Solving issues is impossible without planning for the future and forecasting calculations of statistical and analytical indicators requiring continuous improvement of economic and mathematical models, as well as mathematical and statistical methods of analysis. As the initial data for forecasting, the information from the State Statistics Service on the birth rate of children in Ukraine for the years 2008-2015, the information from the statistical reporting form № 76-RVK “Consolidated Report of General Secondary Education Institutions” for the period of 2014/2015-2020/2021 academic years was used. The article presents the results of calculating the accuracy of forecast estimation of the number of first-graders and the contingent of students in full-time general secondary education institutions (excluding special institutions) for the 2020/2021 academic year. In the course of the research, the analysis of scientific publications was carried out, which proved the relevance of developing methods for calculating forecast values of key indicators of the general secondary education, assessing the accuracy of the forecast and the need for further study. Actual values of indicators obtained as a result of processing statistical data for the beginning of the 2020/2021 academic year made it possible to verify the adequacy of the developed forecasting model and calculate mathematical features of the accuracy of forecasting (absolute and relative deviation between the actual and projected values of the studied indicators). The obtained results show that the numerical values of the forecast estimate for most regions are within the statistical error and prove a high level of accuracy of the forecast of these indicators. In our opinion, a promising area of further research is to improve the methodology for forecasting key indicators of the general secondary education system, taking into account the challenges of martial law and the aggression of the russian federation in Ukraine (destroyed and damaged secondary schools, forced migration of students and teachers, etc.). To do this, it is necessary to develop economic and mathematical models taking into account a number of factors and define additional criteria for optimal models.
Keywords: forecasting, number of first-graders, contingent of students, forecast assessment, mathematical features of forecasting accuracy, prognostic model, general secondary education.
https://doi.org/10.32987/2617-8532-2022-2-72-87
References:
1. Heiets, V. M. (2011). Consequences of demographic challenges for economic growth in Ukraine. Demography and social economy, 1(15), 3-23. Retrieved from http://www.dse.org.ua/arhcive/15/1.pdf [in Ukrainian].
2. Libanova, E. M. (2007). Forecast of demographic development of Ukraine for the period up to 2050. Demography and social economy, 2, 260-268. Retrieved from http://dspace.nbuv.gov.ua/bitstream/handle/123456789/9895/34-Libanova.pdf [in Ukrainian].
3. Makarova, O. V. (2007). Demographic policy: current realities and prospects. Demography and social economy, 1, 3–11. Retrieved from http://dspace.nbuv.gov.ua/bitstream/handle/123456789/11688/01-Makarova.pdf?sequence=1 [in Ukrainian].
4. Ponomarenko, V. S. (2012). Problems of training competent economists and managers in Ukraine. Retrieved from http://competence.in.ua/1-1-forecasting-quantitative-indices-dynamics-education-system-ukraine [in Ukrainian].
5. Telizhenko, O. M., & Melnyk, O. V. (2016). World experience in forecasting the needs of the national economy in qualified personnel. Scientific works of the Petro Mohyla Black Sea State University of the Kyiv-Mohyla Academy complex. Series: governance, 281(269), 103-111. Retrieved from http://nbuv.gov.ua/UJRN/Npchdu_2016_281_269_18 [in Ukrainian].
6. Dybach, I. P. (2020). Determining the required number of research and teaching staff of domestic higher education institutions. Scientific Bulletin of Kherson State University. Series: economic sciences, 37, 50-55. DOI: https://doi.org/10.32999/ksu2307-8030/2020-37-9 [in Ukrainian].
7. Ilich, L. M. (2016). Methodical approaches to forecasting a skilled workforce: the experience of the EU and Ukraine. Ukraine: aspects of work, 5-6, 3–10 [in Ukrainian].
8. Heiets, V. M., Klebanova, T. S., & Cherniak, O. I. (2005). Models and methods of socio-economic forecasting. Kharkiv: VD “INZhEK” [in Ukrainian].
9. Londar, S. L., Tereshchenko, H. M., Gapon, V. V., Melnyk, S. V., Barabash, O. A., Chimbay, L. L. …& Shevchenko, N. A. (2020). Monitoring the provision of pedagogical staff of educational institutions: methodological approaches to forecasting. Retrieved from https://iea.gov.ua/wp-content/uploads/2020/06/1-na_sajt_AZ_Monitoring_potrebi_ZO_u_pedpratsivnikah-final.pdf [in Ukrainian].
10. Gapon, V. V., Barabash, O. A., & Chimbay, L. L. (2021). Analysis of the demographic situation and forecast estimation of the number of first grade students. Educational Analytics of Ukraine, 2, 101-116. DOI: https://doi.org/10.32987/2617-8532-2021-2-101-116 [in Ukrainian].
11. Hrabovetskyi, B. Ie. (2000). Fundamentals of economic forecasting. Vinnytsya: VF TANH. Retrieved from https://buklib.net/books/21986/ [in Ukrainian].
12. State Statistics Service of Ukraine. (n. d.). The current population of Ukraine on January 1. Retrieved from http://database.ukrcensus.gov.ua/PXWEB2007/ukr/publ_new1/index.asp [in Ukrainian].
13. SSI “Institute of Educational Analytics”. (2021). Information bulletin “General secondary education institutions of the Ministry of Education and Science of Ukraine, other ministries and departments and private institutions (2019/2020 academic year and 2020/2021 academic year)”. Retrieved from https://iea.gov.ua/wp-content/uploads/2021/01/BYULETEN-76-RVK-19-20_-20-21.pdf [in Ukrainian].
| 2022-11-28T09:21:16 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8239984512329102, "perplexity": 4845.351252334602}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446710488.2/warc/CC-MAIN-20221128070816-20221128100816-00302.warc.gz"}
|
https://www.aimsciences.org/article/doi/10.3934/proc.2011.2011.1015
|
Article Contents
Article Contents
# The existence of weak solutions for a general class of mixed boundary value problems
• This paper shows the existence of weak solutions for a generalized class of boundary value problems with indefinite potentials which remain outside the general scope of the classical theorems of L. G a rding [3] and P. D. Lax and A. N. Milgram [6].
Mathematics Subject Classification: Primary: 35J25, 35D30; Secondary: 35J20.
Citation:
Open Access Under a Creative Commons license
| 2023-03-20T16:47:38 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 1, "x-ck12": 0, "texerror": 0, "math_score": 0.18826818466186523, "perplexity": 681.4574137594927}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296943484.34/warc/CC-MAIN-20230320144934-20230320174934-00396.warc.gz"}
|
https://malegislature.gov/Laws/GeneralLaws/PartI/TitleXV/Chapter106/Article7/Section7-602
|
# General Laws
## Section 7-602 Attachment of Goods Covered by a Negotiable Document
[ Text of section effective until July 1, 2013. For text effective July 1, 2013, see below.]
Section 7-602. Except where the document was originally issued upon delivery of the goods by a person who had no power to dispose of them, no lien attaches by virtue of any judicial process to goods in the possession of a bailee for which a negotiable document of title is outstanding unless the document be first surrendered to the bailee or its negotiation enjoined, and the bailee shall not be compelled to deliver the goods pursuant to process until the document is surrendered to him or impounded by the court. One who purchases the document for value without notice of the process or injunction takes free of the lien imposed by judicial process.
Chapter 106: Section 7-602. Judicial Process Against Goods Covered By Negotiable Document Of Title
[ Text of section as recodified by 2013, 30, Sec. 45 effective July 1, 2013 applicable as provided by 2013, 30, Sec. 116. For text effective until July 1, 2013, see above.]
Section 7-602. Unless a document of title was originally issued upon delivery of the goods by a person that did not have power to dispose of them, a lien does not attach by virtue of any judicial process to goods in the possession of a bailee for which a negotiable document of title is outstanding unless possession or control of the document is first surrendered to the bailee or the document's negotiation is enjoined. The bailee may not be compelled to deliver the goods pursuant to process until possession or control of the document is surrendered to the bailee or to the court. A purchaser of the document for value without notice of the process or injunction takes free of the lien imposed by judicial process.
| 2015-04-02T01:31:11 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8420981168746948, "perplexity": 4703.214469180217}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-14/segments/1427131309986.49/warc/CC-MAIN-20150323172149-00158-ip-10-168-14-71.ec2.internal.warc.gz"}
|
https://mooseframework.inl.gov/getting_started/installation/hpc_install_moose.html
|
# HPC Cluster
The following instructions aims at setting up a baseline single-user environment for building MOOSE based applications in a job scheduling capable environment.
If instead, you are here interested in allowing MOOSE-based development to be made avaialable to multiple users, please see our Multi-User setup instructions (requires administrative rights). Normal users: please ingore the previous sentence, and continue on...
## Pre-Reqs
What ever compiler you choose to use on your cluster (GCC/Clang, MPICH/OpenMPI), the minimum requirement, is that it must be C++11 compatible. If you are unsure, please consult with your system admins for your cluster on which compiler to use (and how to use it).
• CMake. A modern version of CMake (>2.8) is required to build some of the meta packages we need to include in PETSc.
• Python 2.7.x Development libraries.
Your cluster will most likely have these two requirements available via some form of environment management software. If you are unfamiliar with how to manage your environment, please consult with your cluster administrators.
## PREFIX Setup
export STACK_SRC=mktemp -d /tmp/stack_temp.XXXXXX
export PACKAGES_DIR=$HOME/moose-compilers note • The $PACKAGES_DIR directory must reside in a location where all the compute nodes can access.
• We need the above two environment variables to exist throughout these instructions. Please use the one and only one, terminal you executed those two commands with.
## PETSc
cd $STACK_SRC curl -L -O http://ftp.mcs.anl.gov/pub/petsc/release-snapshots/petsc-__PETSC_DEFAULT__.tar.gz tar -xf petsc-__PETSC_DEFAULT__.tar.gz -C . Now we configure, build, and install it cd$STACK_SRC/petsc-__PETSC_DEFAULT__
./configure \
--prefix=$PACKAGES_DIR/petsc-__PETSC_DEFAULT__ \ --download-hypre=1 \ --with-ssl=0 \ --with-debugging=no \ --with-pic=1 \ --with-shared-libraries=1 \ --with-cc=mpicc \ --with-cxx=mpicxx \ --with-fc=mpif90 \ --download-fblaslapack=1 \ --download-metis=1 \ --download-parmetis=1 \ --download-superlu_dist=1 \ --download-mumps=1 \ --download-scalapack=1 \ --CC=mpicc --CXX=mpicxx --FC=mpif90 --F77=mpif77 --F90=mpif90 \ --CFLAGS='-fPIC -fopenmp' \ --CXXFLAGS='-fPIC -fopenmp' \ --FFLAGS='-fPIC -fopenmp' \ --FCFLAGS='-fPIC -fopenmp' \ --F90FLAGS='-fPIC -fopenmp' \ --F77FLAGS='-fPIC -fopenmp' \ PETSC_DIR=pwd Once configure is done, we build PETSc make PETSC_DIR=$STACK_SRC/petsc-__PETSC_DEFAULT__ PETSC_ARCH=arch-linux2-c-opt all
Everything good so far? PETSc should be asking to run more make commands
make PETSC_DIR=$STACK_SRC/petsc-__PETSC_DEFAULT__ PETSC_ARCH=arch-linux2-c-opt install And now after the install, we can run some built-in tests make PETSC_DIR=$PACKAGES_DIR/petsc-__PETSC_DEFAULT__ PETSC_ARCH="" test
Running the tests should produce some output like the following:
[moose@centos-7 petsc-__PETSC_DEFAULT__]$make PETSC_DIR=$PACKAGES_DIR/petsc-__PETSC_DEFAULT__ PETSC_ARCH="" test
Running test examples to verify correct installation
Using PETSC_DIR=/opt/moose/petsc-__PETSC_DEFAULT__ and PETSC_ARCH=
C/C++ example src/snes/examples/tutorials/ex19 run successfully with 1 MPI process
C/C++ example src/snes/examples/tutorials/ex19 run successfully with 2 MPI processes
Fortran example src/snes/examples/tutorials/ex5f run successfully with 1 MPI process
Completed test examples
=========================================
## Create MOOSE Profile
Use an editor to add the following contents to $HOME/.moose_profile PACKAGES_DIR=$HOME/moose-compilers
export CC=mpicc
export CXX=mpicxx
export F90=mpif90
export F77=mpif77
export FC=mpif90
export PETSC_DIR=$PACKAGES_DIR/petsc-__PETSC_DEFAULT__ ## Source the MOOSE Profile source$HOME/.moose_profile
By sourcing the above file, you are now ready to begin MOOSE-based development.
note:Remember to source the profile!
You will need to perform the above (source $HOME/.moose_profile) for every new terminal session for which you perform work with MOOSE. If you want this to be automatic, add the above to your ~/.bash_profile (or ~/.bashrc or, which ever profile you use on your system) ## Cleanup Whith everything finished, it is now safe to remove the temporary directory containing the source tree: if [ -d "$STACK_SRC" ]; then rm -rf "\$STACK_SRC"; fi
Head back over to the Getting Started page to continue your tour of MOOSE.
| 2018-12-17T18:04:49 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.29473283886909485, "perplexity": 10027.095574691773}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-51/segments/1544376828697.80/warc/CC-MAIN-20181217161704-20181217183704-00551.warc.gz"}
|
https://tjyj.stats.gov.cn/CN/Y2014/V31/I2/75
|
• 论文 •
### 房价波动对物价水平影响的动态模拟
• 出版日期:2014-02-15 发布日期:2014-02-08
### Dynamic Simulation of Impact of Housing Price Volatility on Price Level of National Economy
Yamin Liang & Jun Han
• Online:2014-02-15 Published:2014-02-08
Abstract: Input-output model and SVAR model simulate that the housing price fluctuations impact on the price level of other industrial sector of national economy and each link of social reproduction. The research results demonstrate that: From the horizontal perspective, there is not only a stable positive correlation between house price fluctuations and sectoral price fluctuations; but also a characteristic of regular distribution which the housing price fluctuations impact on the degree of price fluctuations of various industrial sectors. From the vertical perspective, there is not only a coincident change between the house price and the production price, the consumption price; but also a mechanism which the impact of housing price fluctuations is transmitted to the production price in the first place, then the impact is transmitted to the consumption price by the production price.
| 2022-07-05T05:47:34 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.286138117313385, "perplexity": 1857.6434315378806}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104514861.81/warc/CC-MAIN-20220705053147-20220705083147-00142.warc.gz"}
|
https://finalfantasy.fandom.com/wiki/Arithmetician
|
## FANDOM
36,408 Pages
Arithmetician, also known as Calculator, is a job from Final Fantasy Tactics. A high-level magick class, the Arithmetician uses Arithmeticks ("Math Skill" in the PlayStation version) which can cast most magick for free and without a Charge Time, assuming they already know the spell and can do the right calculations for it. Calculations are done by choosing a condition, like level, then choosing a number, like 5. With those conditions, Arithmeticians will cast a selected spell targeting all units (allies and foes) whose level is a multiple of 5.
To counter their powerful abilities, Arithmeticians suffer from having fairly low Magick attack power among the mage jobs and the lowest Speed rating. Other units may take many turns before the Arithmetician's even comes up. One way to counter this is to send the unit on errands. Another viable tactic to raise JP for them is to have their secondary action ability set to Dance for females and Bardsong for males; this will increase the turns they gain JP since they'll perform their Bardsong or Dance action more often than their turn will come up. It costs 4,200 JP to master this job.
To make the Arithmetician's skillset more useful, it is a good idea to switch to a class with better base Magick Power after obtaining enough JP for the abilities the player wants. The Black Mage class has the highest base MA and a diverse selection of attacks, meaning that using the Arithmeticks skillset with one is a force to be reckoned with.
## StatsEdit
A learned warrior who uses Arithmeticks to analyze natural phenomena and pinpoint magickal attacks.
Prerequisite Weapons Helmet Armor Equip Shields?
Lv. 5 White Mage, Lv. 5 Black Mage, Lv. 4 Mystic, Lv. 4 Time Mage
Lv. 4 Priest, Lv. 4 Wizard, Lv. 3 Oracle, Lv. 3 Time MagePS version
Poles, Books Hats Clothes, Robes No
Move Rate Jump Rate Speed Physical Evasion Rate Base Attack Base Magic Base HP Base MP
3 3 3 5 Low Low Low Average
## AbilitiesEdit
### ArithmeticksEdit
Arithmetician job command. Employs arithmetick algorithms to pinpoint targets for magickal attacks.
The damage/healing formula for Arithmeticks is as follows:
$Magick Attack \times PWR \times (Faith/100) \times (Target Faith/100)$
The success rate of inflicting statuses is as follows:
$(Magick Attack + PWR) \times (Faith/100) \times (Target Faith/100)$
Name Range Effect Speed JP Needed
CT 250
Base arithmetick algorithm on the target's CT.
Level 350
Base arithmetick algorithm on the target's level.
EXP 200
Base arithmetick algorithm on the target's EXP.
Height 250
Base arithmetick algorithm on the height of the target's current tile.
Prime 300
An algorithm for targeting units whose specified attribute is a prime number. A prime number is a number only divisible by 1 and itself. A list of the prime numbers under 100 follows. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.
Multiple of 5
(5)
200
An algorithm for targeting units whose specified attribute is a multiple of 5.
Multiple of 4
(4)
400
An algorithm for targeting units whose specified attribute is a multiple of 4.
Multiple of 3
(3)
600
An algorithm for targeting units whose specified attribute is a multiple of 3.
### Reaction abilitiesEdit
Name Description Trigger JP Needed
Cup of Life
(Distribute)
When HP is restored, distribute any excess among one's allies. HP Restored 200
Soulbind
(Damage Split)
Split any damage taken with the opponent who inflicted it. HP Loss 300
### Support abilitiesEdit
Name Description JP Needed
EXP Boost
(Gained Exp UP)
Earn more EXP for the same actions. 350
### Movement abilitiesEdit
Name Description JP Needed
Accrue EXP
(Move-Get Exp)
Obtain EXP upon moving. 400
Accrue JP
(Move-Get JP)
Obtain JP upon moving. 400
## Other appearancesEdit
### Pictlogica Final FantasyEdit
Arithmetician appears as a job.
This article or section is a stub in Pictlogica Final Fantasy. You can help the Final Fantasy Wiki by expanding it.
### Final Fantasy ArtniksEdit
This article or section is a stub in Final Fantasy Artniks. You can help the Final Fantasy Wiki by expanding it.
### Final Fantasy Trading Card GameEdit
Arithmetician appears with two Ice-elemental cards.
## Non-Final Fantasy guest appearancesEdit
### Knights of the CrystalsEdit
Arithmetician appears as a card in the Ivalice Special Arena has a limited-time special arena with eighteen floors. Generic Arithmetician also appears on a gold card.
## EtymologyEdit
Arithmetic or arithmetics (from Greek arithmos) is the oldest and most elementary branch of mathematics used for tasks ranging from simple day-to-day counting to advanced science and business calculations. It involves the study of quantity, especially as the result of operations that combine numbers.
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-06-26T17:53:31 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.40790727734565735, "perplexity": 9750.756114344305}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-26/segments/1560628000414.26/warc/CC-MAIN-20190626174622-20190626200622-00124.warc.gz"}
|
https://portlandpress.com/emergtoplifesci/article/5/6/729/230519/Artificial-intelligence-machine-learning-and-deep?searchresult=1
|
AI is a broad concept, grouping initiatives that use a computer to perform tasks that would usually require a human to complete. AI methods are well suited to predict clinical outcomes. In practice, AI methods can be thought of as functions that learn the outcomes accompanying standardized input data to produce accurate outcome predictions when trialed with new data. Current methods for cleaning, creating, accessing, extracting, augmenting, and representing data for training AI clinical prediction models are well defined. The use of AI to predict clinical outcomes is a dynamic and rapidly evolving arena, with new methods and applications emerging. Extraction or accession of electronic health care records and combining these with patient genetic data is an area of present attention, with tremendous potential for future growth. Machine learning approaches, including decision tree methods of Random Forest and XGBoost, and deep learning techniques including deep multi-layer and recurrent neural networks, afford unique capabilities to accurately create predictions from high dimensional, multimodal data. Furthermore, AI methods are increasing our ability to accurately predict clinical outcomes that previously were difficult to model, including time-dependent and multi-class outcomes. Barriers to robust AI-based clinical outcome model deployment include changing AI product development interfaces, the specificity of regulation requirements, and limitations in ensuring model interpretability, generalizability, and adaptability over time.
In the modern era, the volume and variability of data available to understand and predict clinical outcomes are beyond the scope of singular human comprehension. For this reason, artificial intelligence (AI) methods are well-positioned to meaningfully assist in the clinical practice of medicine. AI is a broad concept, grouping together many initiatives that use a computer to perform tasks that would usually require a human to complete [1]. Examples of computational solutions which fall under the category of AI include perceiving visual stimuli, understanding speech, making decisions based on input data, and language translation [2]. ML is a sub-concept of AI, which focuses on having a machine perform an otherwise intelligent task by learning based on its errors to improve its capabilities with experience [3]. ML adapts and learns iteratively, without human feedback, by applying statistical models that identify patterns in data and draw useful inferences [4]. Finally, deep learning (DL) is a specific category within ML that uses various artificial neural network architectures to extract and process features within data. This hierarchy, narrowing in from broad to specific, can be appreciated in Figure 1, adapted from Min et al. [5]. The tangible products in the field of AI have evolved greatly over the last 30 years. We point the reader here for historical [6,7,8,9], technical [10], medically focused [11], and failure highlighting [12], reviews on the evolution of AI methods. This review will outline the progress, uses, and barriers to comprehensively integrating these emerging statistical and machine learning (ML) tools into clinical practice.
### Representation of concepts: artificial intelligence, machine learning, and deep learning.
Figure 1.
Representation of concepts: artificial intelligence, machine learning, and deep learning.
Figure 1.
Representation of concepts: artificial intelligence, machine learning, and deep learning.
### Conceptual framework
Clinical outcome predictive models can be generalized down to the following concept. A model, represented as a function ‘f’ is applied to input data X to represent a known outcome variable y [13]
$f(X)→y$
The model f is ‘fit,’ or trained on the input data X so that when it encounters new data it can predict what y will be, or ŷ [13]. The goal of creating a clinical outcome predictor is for your f to work well enough so that predicted values of ŷ on new data would be correct if the actual status or value of y was known. Input data X can take many forms. However, usually input information is cleaned and processed into matrix form [14]. In this data object, each row, or ‘instance,’ represents a single entity or observation of the data (i.e. an individual patient), and each column, or ‘feature,’ represents a property of the data (i.e. the patient's age, or blood type). Models where only linear operations (f) act on input features (X) to predict an outcome (y) are referred to as generalized linear models, or GLMs [15]. Various non-linear, or other operations, however, may be implemented on these data (X). In general, a weight, w, is given to each feature as the features are combined. Using matrix notation, our general equation can be conceptualized as follows [13]:
$f(w⋅X)→y$
While the exact weighting and feature manipulation methods (f) are unique per ML method, generally, models are built through iterative training [13]. The ML method f is initiated with random parameter weights w0, the model is fit to the input f(w0·X), and an initial outcome prediction ŷ0 is generated. Then a loss function is created, which can take various forms (i.e. root mean squared error [16] or cross-entropy loss [17]) to compare each ŷ prediction to the known outcome y. Loss functions (L) operate such that the closer the ŷ prediction comes to accurately getting the real value of y, the smaller the function output is [18]. It is then relatively straightforward to optimize an algorithm by minimizing your defined loss function. During iterative training, the gradient of the loss function dictates how the weights of features (w) should be changed so that the loss function is minimized. The goal of loss optimization is for the models’ predictions (ŷ) to get closer and closer to their actual outcome value (y), which is observed as loss function converges to 0 or is minimized:
$L(y,y^)|w→0,min$
### What is an outcome, and how will you measure it?
With a general framework established, it is next necessary to consider the outcome, y, and decide how it should appropriately be measured. This step is essential as different ML methods lend themselves most appropriately to modeling differing outcome types. For example, the most straightforward clinical outcome that can be observed is that of a binary outcome. A binary outcome variable can only take two values and often represents a ‘yes’/’no’ event [19]. Clinically, these could include an outcome describing treatment failure versus success or patient mortality within a defined time period from an intervention. Almost all ML methods can be used to perform binary classification [13] However, perhaps you are interested in an outcome with more than two classes and need to create a multi-class classifier [20,21]. This could be the case when trying to differentiate among multiple types of dermatological lesions, including benign, melanoma, basal cell, and squamous cell carcinoma lesions. The next step up from a multi-class classifier is creating an ML model that can predict a continuous [22] clinical outcome. Perhaps you wish to predict the expected level for a biomarker or hope to predict the length of stay for patients who receive a procedure. An important consideration for a classifier is understanding if an outcome occurs over a time horizon. Is there a time component to incorporate into the model? For example, when looking at cancer recurrence after chemotherapy, recurrence rates are only an interesting if you know the period of remission, after chemotherapy but before recurrence. ML models can perform ‘survival analysis’ [23] tasks. Utilizing a time-dependent outcome variable comes with constraints, however. Instances where patients are in your data but have not yet experienced an outcome must be ‘censored’ appropriately. Censoring is accomplished in a nonparametric manor in classical statistics through the Kaplan–Meier [24] method. This compensatory method is imperfect, however, and fails to appropriately account for the informative censoring of competing risks [25], where patient dropout may be non-random and censored individuals have risk factors influencing the survival outcome of interest. Other survival analysis specific analyses requirements include assessing the informative missingness [26] of covariates [27], the impact of confounders [28], and latent heterogeneity of patient cohorts [29]. These considerations can be handled to a degree with advanced statistical methods, but not yet by ML methods. Further detailed insights into survival analysis are available in the literature [30,31].
#### AI PubMed searches per 100 000 citations by Year.
Figure 2.
AI PubMed searches per 100 000 citations by Year.
Figure 2.
AI PubMed searches per 100 000 citations by Year.
#### Example of a decision tree to predict coronary artery narrowing (1, red) vs no narrowing (0, blue) using input features of age, gender, and type of chest pain.
Figure 3.
Example of a decision tree to predict coronary artery narrowing (1, red) vs no narrowing (0, blue) using input features of age, gender, and type of chest pain.
Figure 3.
Example of a decision tree to predict coronary artery narrowing (1, red) vs no narrowing (0, blue) using input features of age, gender, and type of chest pain.
ML methods are rapidly being applied in novel avenues to predict clinical outcomes. To visualize, we have generated Figure 2 charting AI related PubMed searches by year. In Supplementary Table S1, we have complied recent review articles detailing emerging examples of how statistical and ML methods are being utilized for clinical outcome prediction in major medical specialities. Applications are found in the fields of Anesthesiology [32,33,34], Dermatology [35,36,37], Emergency Medicine [38,39], Family Medicine [40,40], Internal Medicine [41,42,43], Interventional Radiology [44,45], Medical Genetics [46], Neurological Surgery [47], Neurology [48,49,50], Obstetrics and Gynecology [51,52], Ophthalmology [53,54,55], Orthopaedic Surgery [56], Otorhinolaryngology [57,58], Pathology [59,60,61], Pediatrics [62], Physical Medicine and Rehabilitation [63,64], Plastic and Reconstructive Surgery [65,66], Psychiatry [67,68], Radiation Oncology [69,70], Radiology [71,72], General Surgery [73,74], Cardiothoracic Surgery [75,76], Urology [77,78], Vascular Surgery [79,80]. These papers introduce terms describing ML models as ‘supervised’ or ‘unsupervised’. Supervised ML methods are trained to predict a specified outcome, while unsupervised models are given no outcome target and seek to identify patterns in data unguided [81]. Almost all clinical outcome statistical and ML models are supervised models [82] where a target is set beforehand. Let's investigate these methods mentioned individually.
1. Linear Models. Logistic and linear regression (LR) are the most straightforward predictive models. These are classical statistical techniques and are most accurately regarded as statistical learning methods [13]. LR methods combine input features in a linear combination to predict an outcome. When input features are independently correlated with the outcome, linear models perform very well, on par or even better than new ML methods [83,84]. LR methods do not capture non-linear relationships between variables, and, without specific feature construction, treat all features independently [85]. LR models will continue to provide excellent insight into clinical outcome predictions as LR models are both computationally efficient and highly interpretable [15]. LR feature weights can be tested for individual significance and be understood as feature multipliers in relation to an outcome metric [86]. It is standard practice to benchmark performance of ML models to that of statistical learning LR methods to critically evaluate the need for a more complex, often less interpretable ML model [87]. As example, LR methods are recently being used to predict clinical outcomes of COVID-19 mortality [88], the development of chronic diseases such as HTN and DM [84], stroke risk [89], and predicting acute myeloid leukemia outcomes from patient gene signatures [90]. When outcomes evolve over time, linear cox-proportional hazards statistical models are used to estimate baseline and feature specific hazard ratios of an outcome continuously [91]. Cox models are statistically entrenched due to interpretability, simplicity, and enduring widespread incorporation [92]. Although not a regression technique, the Naïve Bayes (NB) ML method also appreciates data features independently toward an outcome of interest [93]. For binary outcome prediction, NB calculates the posterior probability of the positive outcome class for each numerical feature and each sub-category within categorical features totaling probabilities [94]. NB has been recently used to predict responses to chemotherapy [95] and to predict the development of Alzheimer's disease from genomic data [96].
2. Decision Tree Methods. An individual decision tree is a top-down flowchart-like structure in which nodes represent a decision point, determined by a single input feature, and branches from nodes continue to diverge reaching more terminal nodes (Figure 3). Node decision points are created from features through information theory in which features are split based on entropy or variance regarding the known outcome of interest. After training the outcomes into a decision tree, then a new data instance of information can be fed into the tree, and the node decisions can be followed to predict the likely clinical outcome.
The method may be used to create both Classification and Regression Trees, which produces the acronym CART [97] for brevity. Many tree-based methods exist. A random forest trains multiple decision trees on input data, with each subtree having only a subset of the total column feature variables to consider. After training, all trees of the forest are run in parallel on new data entries, and the majority prediction opinion of the forest determines the model's final prediction. This method has the advantage of making decision nodes to be created at minor features, forcing their appreciation, and avoiding a few strong predictors driving prediction in all scenarios. This ability has led to excellent clinical outcome predictions, including recently to predict stroke outcomes [98], drug response from clinical and serological markers [99], or mortality after traumatic brain injury [100]. On small datasets with only a few highly correlated features, a random forest model may not perform better than simpler methods [101]. Two key concepts are introduced with the random forest. Combining several individual models to create one is known as ensemble modeling. Training multiple base models in parallel is known as ‘bootstrap aggregation,’ or ‘bagging’ [102]. Bagging is used in various statistical applications and does not require decision trees to exclusively serve as the underlying base models [103]. Boosting ensemble methods [61], by contrast, take a different strategy and train multiple models in series. By training sequentially, boosting affords later models the opportunity to learn from the previous models, or ‘learners,’ weaknesses. Popular boosting methods used in clinical modeling include XGBoost [104,105] and AdaBoost [106,107], which are often multi-decision tree ensemble methods [108,109]. Finally, when a time horizon outcome variable is used, novel random survival forest [110] methods can be used for time-dependent clinical predictions [111]. In general, tree-based methods are interpretable, can appropriately model non-linear relationships, and feature rankings of relative importance can be readily retrieved [112]. Tree-based methods are limited in that they require manual feature construction to appreciate multiple variables concurrently [113].
3. Clustering, Kernel and Non-deterministic methods. Clustering methods, in general, are unsupervised.
ML methods, however, they can be used for clinical outcome predictions. In the k-Nearest Neighbor (kNN) approach, clusters are found within data through ‘k’ number of random centroid placements, iterative Euclidian distance calculation between all data and centroids, recentering centroids to be in the center of ‘nearest points’, and reassignment of data cluster labels. KNNs have been utilized to cluster large-scale microRNA expression profiles into correctly classified human cancers [114,115,116]. Support vector machines [117] (SVM) are a kernel-based ML method that attempts to represent data into a higher dimensional feature space and find a hyperplane to separate samples by their outcome status [13]. SVM has limited utility when your input data has a large number of dimensions, as projecting all features into a higher dimensional space is computationally intensive, especially when using a non-linear kernels. They are used to predict outcomes when datasets are manageable [118]. Non-Deterministic methods are machine learning methods where a model is not constrained to create predictions in the context of the known outcome. For example, a non-deterministic classifier [119] trained to predict a binary outcome may be allowed to predict three or more states. The advantage of this is that the model has more ‘options’ to bucket borderline negative instances into when it is unsure of the appropriate class designation. This principle can ultimately lead to more correct classifications of the positive class. Such methods have been applied to clinical outcome prediction [120], where they demonstrated utility in predicting clinical cancer type [119]. More information on non-deterministic algorithms may be found here [121].
• 4. Deep Learning. Deep learning is a sub-category within ML, defined by the use of neural network architectures [5,122]. The most basic neural network architecture is a fully connected, or ‘dense’ [123], feed-forward network, or a ‘multi-layer perceptron’ [125]. In Figure 5 we can see how a deep neural network [124] simply refers to having more than one hidden layer of interconnected nodes. In a general neural network architecture, the value of circles, or nodes, is the weighted sum of the outputs of nodes connected to it [125]. Line connections each have a weight, which is an individual parameter that is tuned during model training, modulated by optimizing your determined loss function [126]. To introduce non-linearity into the network, an activation function (ReLu [127], Sigmoid [128]) acts on threshold weighted inputs into a node. Feedforward neural networks are useful for clinical outcome prediction [129]. Deep neural networks (Figure 4) increase the number of hidden layers [130] between input and output and add advantages of more abstract feature representations [5]. Deep learning methods are being used extensively to predict clinical outcomes [131,132,133] When limited training instances are available, transfer learning [134] is appropriate. In transfer learning, a deep neural network model is pre-trained on a large adjacent type dataset, such as the ImageNet [135] database of 3.2 million images. This pre-trained model is then transferred and refitted with your smaller dataset. During this second step, the early hidden node layers of the network are ‘frozen,’ and only deep layer parameter weights can be iteratively modified. Freezing the weights and values of nodes in the first few layers protects fundamental information learned on the large dataset and only allows for ‘fine tuning’ of later nodes so that your desired outcome can be predicted. Transfer learning is widely utilized for clinical outcome prediction [136,137,138]. To facilitate transfer learning, initiatives exist to train large general base models on broad datasets to be utilized for future downstream tasks [139]. An example of such a foundational model includes Med-BERT [140] which is deep neural network model with pre-trained contextual embeddings specific for predicting disease from electronic health records. While experimental, and seemingly poised for powerful clinical modeling, caution prior to implementation is rightfully being taken to understand limitations of the foundational model which would be inherited by all downstream functions [139]. Dropout [141], or randomly removing nodes temporarily during training iterations, can prevent overfitting and improve model performance [142]. Survival neural networks [143,144] exist and are used for predicting time-dependent and censored clinical outcomes [145].
Recurrent neural networks allow for information stored in a node at a previous time point to connect with nodes at later time points. This historical feedback is the hallmark of a recurrent neural network, which allows for sequence or time-series data to be captured. RNNs are used to time-dependent outcomes such as epileptic siezures [146] and cancer treatment response [147]. Two common types of RNN are long short term memory (LSTM [148]) and gated recurrent units (GRU [149]) RNNs which allow for information to be carried and accessed for longer periods without information loss. Convolutional neural networks uniquely capture spatial information within data, and adjacent inputs must be related for CNN to be useful. CNNs have been utilized to predict malignancies from pulmonary nodules [150]. Overall, deep neural networks demonstrate superior performance on nearly all multimodal and image-based classification tasks, but are on par with other methods in regard to purely tabular inputs [151]. A limitation is their interpretability, as no singular features or direct feature weights are carried forward.
### Fully connected (Dense) neural network versus deep neural network.
Figure 4.
Fully connected (Dense) neural network versus deep neural network.
Figure 4.
Fully connected (Dense) neural network versus deep neural network.
### Healthcare data extraction standard pipeline.
Figure 5.
Healthcare data extraction standard pipeline.
Figure 5.
Healthcare data extraction standard pipeline.
Each of these emerging methods requires access to reliable, standardized data input (X) that is appropriately captured to model an outcome of interest (y) [152]. To obtain and maintain X, extraction pipelines and preprocessing steps much be carefully attended. Often, this is the most time-consuming step in developing an ML model [153]. To predict our outcome ŷ accurately on new seen data, we will need to ensure that our training data X is generalizable [154] and representative of the population for which we aim to perform clinical outcome predictions.
1. Data Accession and Extraction. A convenient method of data storage is a clinical repository. Here data is stored in a data frame or table such that X is already formatted with patients listed as rows, and relevant feature variables for each patient are listed as columns. However, the necessary data will often not be available in this format and must be collated and transformed into the proper input format. The 2010 passage of the Affordable Care Act [155] included a mandate for health care providers to adopt electronic health record (EHR) systems. EHR records require a large amount of storage space, and due to their nature, cannot be recorded as one data table. Instead, data is often decentralized and made available through encrypted linking of data lakes [156] (raw unstructured) or data warehouses [157] (semi-structured or structured) data storage. Figure 5 shows how information is stored by hospital systems and can be collated on request or query. To perform clinical predictions, interfacing with these raw outputs, data lakes, and warehouses is required, and currently, several modalities exist to do so. One popular standard is FHIR [158] or the fast healthcare interoperability resource. This API Python coding tool provides a standard format in which, as a researcher, you can submit a query to FHIR, which provides the correct back-end commands to retrieve a properly formatted output table [158]. These tools become particularly useful when trying to concatenate clinical data with genetic sampling data and other individual lab or other biomarker values that might exist in various datasets. In general, such processes outside of FHIR can be accomplished on multiple platforms through merging datasets [159] with overlapping patient instances or concatenating data instances to an already existing data set. FHIR [160] directed EHR extraction to clinical outcome prediction pipelines [161] are incipient, and examples include predicting opioid use after spine surgery [162], outcomes and superiority of chronic disease treatment methods [163], and others [164]. Data extraction, or accession pipelines [162] far more complex than these, are also being explored and implemented to conduct clinical outcome predictions. To circumnavigate inter-institutional competition, privacy, permission, and remote storage issues, the use of blockchain technology for data accession rather than extraction is an emerging method being pursued [165]. Specifically, ‘swarm learning’ allows for decentralization and confidentiality of data to be maintained, which may increase intra-institution EHR center participation, and the overall sample sizes available for clinical outcome predictions [165].
3. Optimizing row instances. Generally, increasing your training data strengthens final model performance in predicting outcomes [176]. If you have few training instances, it may be appropriate to increase your data set size through resampling methods or synthetic data generation. Resampling methods [177] include different cross-validation procedures which involve more complex partitioning and reuse of training and testing samples. To increase the sample size, you could also create synthetic data. Many statistical methods exist for generating synthetic data [178], such as SMOTE [179], and all of which serve to produce new synthetic samples that are similar but plausibly different from the original ‘true’ samples. Synthetic data allows the model to improve performance by giving additional samples to iterate over while optimizing feature weights. Adding synthetic data can improve the number of minority class samples in the dataset. It is a common challenge of ML modeling for a model to underweight rare minority classes [180]. To force the model to more reliably predict the minority class, you can up-sample that class through synthetic data generation. Alternatively, if your sample size is sufficient, you may down sample the majority class [181] to better balance your input data, although care should be taken not to exclude relevant subgroups. An important distinction is that while synthetic or resampled can be applied to model training data, it is generally not acceptable to include synthetic or resampled data in testing datasets.
Similar to synthetic data generation, the statistical imputation [182] of missing values is a powerful tool during data preprocessing. You may have nearly complete data, where a variable may not be populated for a few samples. Depending on the data type, you can impute the missing data. Imputing is the idea of using the context clues from the surrounding features and what has been observed elsewhere in the dataset to estimate what the missing value or parameter should be. Imputation is common in biological contexts [182].
• 4.
Optimizing column features. Metrics such as information gain [183] either through the GINI index, or the information gain ratio [184] are statistical metrics that can be used to determine how much information from a potential input feature is given to the outcome. Features giving relatively no information gain may be candidates for removal. Several methods can capture the information stored in multiple features but convey them in fewer features. This concept is known as dimensionality reduction [185], and it can be useful when consistent standardized data are inaccessible and features are abundant. Statistical methods, such as principal component analysis [186], and unsupervised ML methods, including t-SNE [187], and UMAP [188], can serve this purpose. Also useful for clustering analysis, these methods can reduce high dimensional data into a lower-dimensional representation, to accomplish the dimension reduction goal. These methods can be described as ‘representation learning’ or identifying a lower-dimensional feature to represent higher dimensional data
A common challenge arises when dealing with categorical variables, such as blood type that lack ordinal relationships. Unaltered input of this feature as integer representations (1, 2, 3, etc.) would falsely convey a natural ordering to these data that is not present biologically. To address this, the statistical method of one hot encoding [189] exists, which converts categorical variable features into individual columns for each of its subcomponents. One hot encoding is useful, but it can lead to expansive datasets. As a consequence of training a neural network on a categorical variable, the network ‘embedding’ representation of the categorical variable holds representational value. These categorical embeddings [190] can be extracted from the trained neural network and used in place of a categorical variable to represent the feature, uniquely capturing unobvious inter-feature relationships accurately [191], improving the end trained ML model's performance [192].
With our outcome identified, method selected, and input data preprocessed, it is time to train our model. We need to separate the data set X into training and testing data. An 80%: 20% training to testing split ratio of the total data is common [193]. In sectioning data, it is useful to ensure that all output classes are represented and any sub-type demographics of interest in both the testing and training sections. ML development occurs on the 80% training set. Model training should never involve the test set [13]. We want the test set to be an objective example of what new data would look like if given to the model. Cross validation [194] and random sampling with replacement [195] are useful repeated sampling metrics to estimate average model performance, in the case your initial train-test split happened to be unusually favorable or unfavorable toward model generation.
During training, the ML method will iteratively attempt to minimize the loss function. Training will stop after a preset number of training iterations, or when a certain loss function threshold is reached. At this point, your model can be trialed against the test data, and the difference between predictions generated on the test data ŷ and the ground truth y can be compared. For classification problems, ML models will output a class probability score.
Many performance evaluation metrics are available for understanding how ŷ compares to y. This class probability score can be visualized as an area under the receiver operator curve (AUC –ROC [196,197]) or an area under the precision-recall curve (AUC-PR [198]). Thresholding the probability score will allow for a class prediction to be made. A confusion matrix can next be generated, indicating how many of the test set instances were correctly classified as positive (true positive) or negative (true negative) and incorrectly classified as false positive and false negative outcomes. Figure 6 shows how to calculate relevant outcome summary evaluation metrics from these findings. F1, which is the harmonic mean of precision and recall, is commonly used to compare ML methods, including in cases of class imbalance [199].
### Confusion matrix for model evaluation and formulas for calculating summary statistics.
Figure 6.
Confusion matrix for model evaluation and formulas for calculating summary statistics.
Figure 6.
Confusion matrix for model evaluation and formulas for calculating summary statistics.
• AI methods are well suited to predict clinical outcomes.
• Current methods for cleaning, creating, accessing, extracting, augmenting, and representing data for the use of AI clinical prediction are well defined and ready for implementation.
• The use of AI to predict clinical outcomes is a dynamic and rapidly evolving arena, with new methods and applications emerging.
• Barriers to robust AI clinical outcome prediction include changing AI development interfaces, regulation requirements, and limitations in model interpretability, generalizability, and adaptability over time.
The authors declare that there are no competing interests associated with the manuscript.
Cancer Prevention Research Interest of Texas (CPRIT) award: RR170048 (CIA); National Institutes of Health (NIH) for INTEGRAL consortium: U19CA203654 (CIA); National Institutes of Health (NIH): R01CA139020 (MLB); NIH T32ES027801 (RWP).
All authors contributed to the writing and editing of the manuscript.
The authors would like to thank the Baylor College of Medicine Medical Scientist M.D./Ph.D. Training Program for their support (RWP). The authors would like to thank BRASS: Baylor Research Advocates for Student Scientists for their support (RWP).
• AI
Artificial Intelligence
•
• AUC-PR
Area under precision-recall curve
•
• AUC-ROC
•
• CNN
Convolutional Neural Network
•
• DL
Deep Learning
•
• EHR
Electronic Health record
•
• FDA
The U.S. Food and Drug Administration
•
• FHIR
Fast Healthcare Interoperability Resources
•
• FN
False Negative
•
• FP
False Positive
•
• GRU
Gated recurrent units recurrent neural network
•
• IoMT
Internet of Medical Things
•
• IoT
Internet of Things
•
• kNN
k-Nearest neighbor
•
• LR
Linear regression
•
• LSTM
Long short term memory recurrent neural network
•
• ML
Machine Learning
•
• NB
Naïve Bayes
•
• PCA
principal component analysis
•
• RNN
Recurrent neural network
•
• SVM
Support vector machines
•
• TN
True Negative
•
• TP
True Positive
•
• t-SNE
t-stochastic neighbor embedding
•
• UMAP
Uniform Manifold Approximation and Projection
1
Dobrev D. A Definition of Artificial Intelligence. Published online October 3, 2012. Accessed September 26, 2021
. https://arxiv.org/abs/1210.1568v1
2
McCracken
,
J.
(
2003
)
Oxford dictionary of English. In:123.
3
Lv
,
H.
and
Tang
,
H.
(
2011
)
Machine learning methods and their application research. Proceedings - 2011 International Symposium on Intelligence Information Processing and Trusted Computing, IPTC. Published online 2011:108–110
.
4
Wang
,
H.
,
Ma
,
C.
and
Zhou
,
L.
(
2009
)
A brief review of machine learning and its application. Proceedings - 2009 International Conference on Information Engineering and Computer Science, ICIECS 2009. Published online 2009
.
5
Min
,
S.
,
Lee
,
B.
and
Yoon
,
S.
(
2017
)
Deep learning in bioinformatics
.
Brief. Bioinformatics
18
,
851
869
6
Haenlein
,
M.
and
Kaplan
,
A.
(
2019
)
A Brief History of Artificial Intelligence: On the Past, Present, and Future of Artificial Intelligence; 61(4):5–14
.
7
Benko
,
A.
and
Sik Lányi
,
C.
(
2009
)
History of Artificial Intelligence. Encyclopedia of Information Science and Technology, Second Edition. 1759–1762
.
8
Nilsson
,
N.
(
2009
)
The Quest for Artificial Intelligence
.
United States, Cambridge University Press
. Accessed December 2, 2021. https://www.google.com/books/edition/The_Quest_for_Artificial_Intelligence/nUJdAAAAQBAJ?hl=en&gbpv=0
9
Dick
,
S.
(
2019
)
Artificial intelligence
.
Harvard Data Sci. Rev.
1
, 1
10
Coolen
,
ACC
,
Keuhn
,
R
and
Sollich
,
P
. (2005)
Theory of Neural Information Processing Systems
.
11
Kaul
,
V.
,
Enslin
,
S.
and
Gross
,
S.A.
(
2020
)
History of artificial intelligence in medicine
.
Gastrointest. Endosc.
92
,
807
812
12
Smith
,
B.
(
2019
)
The Promise of Artificial Intelligence Reckoning and Judgment
.
Cambridge, MA, United States, MIT Press
13
Hastie
,
T.
,
Tibshirani
,
R.
and
Friedman
,
J.
(
2009
)
The Elements of Statistical Learning. Published online 2009
.
14
El Naqa
,
I.
and
Murphy
,
M.J.
(
2015
)
What Is Machine Learning? Machine Learning in Radiation Oncology. Published online:3–11
.
15
Nelder
,
J.A.
and
Wedderburn
,
R.W.M.
(
1972
)
Generalized linear models
.
J. R. Stat. Soc. A (Gen)
135
,
370
384
16
Wallach
,
D.
and
Goffinet
,
B.
(
1989
)
Mean squared error of prediction as a criterion for evaluating and comparing system models
.
Ecol. Model.
44
,
299
306
17
Li
,
L.
,
Doroslovacki
,
M.
and
Loew
,
M.H.
(
2020
)
Approximating the gradient of cross-entropy loss function
.
IEEE Access
8
,
111626
111635
18
Bottou
,
L.
(
2010
)
Large-scale machine learning with stochastic gradient descent. Proceedings of COMPSTAT 2010 - 19th International Conference on Computational Statistics, Keynote, Invited and Contributed Papers. Published online 177–186
.
19
Koyejo
,
O.
,
Natarajan
,
N.
,
Ravikumar
,
P.
and
Dhillon
,
I.S.
Consistent Binary Classification with Generalized Performance Metrics
20
Aly, M. (2005) undefined. Survey on multiclass classification methods. Citeseer. Published online 2005. Accessed December 11, 2021.
21
Grandini M, Bagli E, Visani G. Metrics for Multi-Class Classification: an Overview. Published online August 13, 2020. Accessed December 11, 2021. https://arxiv.org/abs/2008.05756v1
22
Wang
,
Y.
and
Witten
,
I.H.
(
1997
)
Induction of model trees for predicting continuous classes. Proceedings of the 9th European Conference on Machine Learning Poster Papers. Published online 1997:128–137. Accessed September 30, 2021
. https://researchcommons.waikato.ac.nz/handle/10289/1183
23
,
L.
(
2001
)
Modeling medical prognosis: survival analysis techniques
.
J. Biomed. Inform.
34
,
428
439
24
Bland
,
J.M.
and
Altman
,
D.G.
(
1998
)
Survival probabilities (the kaplan-Meier method)
.
BMJ
317
,
1572
1580
25
Satagopan
,
J.M.
,
Ben-Porat
,
L.
,
Berwick
,
M.
,
Robson
,
M.
,
Kutler
,
D.
and
Auerbach
,
A.D.
(
2004
)
A note on competing risks in survival data analysis
.
Br. J. Cancer
91
,
1229
1235
26
Ghassemi
,
M.
,
Naumann
,
T.
,
Schulam
,
P.
,
Beam
,
A.L.
,
Chen
,
I.Y.
and
Ranganath
,
R.
(
2020
)
A Review of Challenges and Opportunities in Machine Learning for Health. AMIA Summits on Translational Science Proceedings. 2020;2020:191. Accessed December 1, 2021. /pmc/articles/PMC7233077/
27
Katki H, LyX SMUS with, 2008 undefined. Survival analysis for cohorts with missing covariate information. 19221812911. Accessed December 1, 2021
28
Nieto
,
F.J.
and
Coresh
,
J.
(
1996
)
Adjusting survival curves for confounders: a review and a new method
.
Am. J. Epidemiol.
143
,
1059
1068
29
Aalen
,
O.O.
(
1988
)
Heterogeneity in survival analysis
.
Stat. Med.
7
,
1121
1137
30
Flynn
,
R.
(
2012
)
Survival analysis
.
J. Clin. Nurs.
21
,
2789
2797
31
Kleinbaum
,
D.
and
Klein
,
M.
(
2010
)
Survival Analysis. Accessed December 1, 2021
32
Chae
,
D.
(
2020
)
Data science and machine learning in anesthesiology
.
Korean J. Anesthesiol.
73
,
285
33
Alexander
,
J.C.
,
Romito
,
B.T.
and
Çobanoǧlu
,
M.C.
(
2020
)
The present and future role of artificial intelligence and machine learning in anesthesiology
.
Int. Anesthesiol. Clin.
58
,
7
16
34
Hashimoto
,
D.A.
,
Witkowski
,
E.
,
Gao
,
L.
,
Meireles
,
O.
and
Rosman
,
G.
(
2020
)
Artificial intelligence in anesthesiology current techniques, clinical applications, and limitations
.
Anesthesiology
132
,
379
394
35
Du
,
A.X.
,
Emam
,
S.
and
,
R.
(
2020
)
Review of machine learning in predicting dermatological outcomes
.
Front. Med.
7
,
266
36
Thomsen
,
K.
,
Iversen
,
L.
,
,
T.L.
and
Winther
,
O.
(
2019
)
Systematic review of machine learning for diagnosis and prognosis in dermatology
.
J. Dermatolog. Treat.
31
,
496
510
37
Chan
,
S.
,
Reddy
,
V.
,
Myers
,
B.
,
Thibodeaux
,
Q.
,
Brownstone
,
N.
and
Liao
,
W.
(
2020
)
Machine learning in dermatology: current applications, opportunities, and limitations
.
Dermatol. Ther.
10
,
365
386
38
Stewart
,
J.
,
Lu
,
J.
,
Goudie
,
A.
,
Bennamoun
,
M.
,
Sprivulis
,
P.
,
Sanfillipo
,
F.
et al (
2021
)
Applications of machine learning to undifferentiated chest pain in the emergency department: a systematic review
.
PLoS ONE
16
,
e0252612
39
Tang
,
K.J.W.
,
Ang
,
C.K.E.
,
Constantinides
,
T.
,
Rajinikanth
,
V.
,
Acharya
,
U.R.
and
Cheong
,
K.H.
(
2021
)
Artificial intelligence and machine learning in emergency medicine
.
Biocybernet. Biomed. Eng
41
,
156
172
40
Kueper
,
J.K.
,
Terry
,
A.L.
,
Zwarenstein
,
M.
and
Lizotte
,
D.J.
(
2020
)
Artificial intelligence and primary care research: a scoping review
.
Ann. Fam. Med.
18
,
250
258
41
Ben-Israel
,
D.
,
Jacobs
,
W.B.
,
Casha
,
S.
,
Lang
,
S.
,
Ryu
,
W.H.A.
,
de Lotbiniere-Bassett
,
M.
et al (
2020
)
The impact of machine learning on patient care: a systematic review
.
Artif. Intell. Med.
103
,
101785
42
Pandit
,
A.
and
,
T.R.D.J.
(
2020
)
Machine learning in rheumatology approaches the clinic
.
Nat. Rev. Rheumatol.
16
,
69
70
43
Stafford
,
I.S.
,
Kellermann
,
M.
,
Mossotto
,
E.
,
Beattie
,
R.M.
,
MacArthur
,
B.D.
and
Ennis
,
S.
(
2020
)
A systematic review of the applications of artificial intelligence and machine learning in autoimmune diseases
.
NPJ Digit. Med.
3
,
1
11
44
Mazaheri
,
S.
,
Loya
,
M.F.
,
Newsome
,
J.
,
Lungren
,
M.
and
Gichoya
,
J.W.
(
2021
)
Challenges of implementing artificial intelligence in interventional radiology
.
38
,
554
559
45
Desai
,
S.B.
,
Pareek
,
A.
and
Lungren
,
M.P.
(
2021
)
Current and emerging artificial intelligence applications for pediatric interventional radiology
.
2021
,
1
5
46
Rauschert
,
S.
,
Raubenheimer
,
K.
,
Melton
,
P.E.
and
Huang
,
R.C.
(
2020
)
Machine learning and clinical epigenetics: a review of challenges for diagnosis and classification
.
Clin. Epigenet.
12
,
1
11
47
Buchlak
,
Q.D.
,
Esmaili
,
N.
,
Leveque
,
J.C.
,
Farrokhi
,
F.
,
Bennett
,
C.
,
Piccardi
,
M.
et al (
2019
)
Machine learning applications to clinical decision support in neurosurgery: an artificial intelligence augmented systematic review
.
Neurosurg. Rev.
43
,
1235
1253
48
Myszczynska
,
M.A.
,
Ojamies
,
P.N.
,
Lacoste
,
A.M.B.
,
Neil
,
D.
,
Saffari
,
A.
,
,
R.
et al (
2020
)
Applications of machine learning to diagnosis and treatment of neurodegenerative diseases
.
Nat. Rev. Neurol.
16
,
440
456
49
Sirsat
,
M.S.
,
Fermé
,
E.
and
Câmara
,
J.
(
2020
)
Machine learning for brain stroke: a review
.
J. Stroke Cerebrovasc. Dis.
29
,
105162
50
Yuan J, Ran X, Liu K, et al. Machine Learning Applications on Neuroimaging for Diagnosis and Prognosis of Epilepsy: A Review. Published online February 5, 2021. Accessed December 1, 2021
. https://arxiv.org/abs/2102.03336v3
51
Iftikhar
,
P.M.
,
Kuijpers
,
M.V.
,
Khayyat
,
A.
,
Iftikhar
,
A.
and
DeGouvia De Sa
,
M.
(
2020
)
Artificial intelligence: a new paradigm in obstetrics and gynecology research and clinical practice
.
Cureus
12
,
e7124
52
Sone
,
K.
,
Toyohara
,
Y.
,
Taguchi
,
A.
,
Miyamoto
,
Y.
,
Tanikawa
,
M.
,
Uchino-Mori
,
M.
et al (
2021
)
Application of artificial intelligence in gynecologic malignancies: a review
.
J. Obstet. Gynaecol. Res.
47
,
2577
2585
53
Sengupta
,
S.
,
Singh
,
A.
,
Leopold
,
H.A.
,
Gulati
,
T.
and
Lakshminarayanan
,
V.
(
2020
)
Ophthalmic diagnosis using deep learning with fundus images–a critical review
.
Artif. Intell. Med.
102
,
101758
54
Sarhan
,
M.H.
,
Nasseri
,
M.A.
,
Zapp
,
D.
,
Maier
,
M.
,
Lohmann
,
C.P.
,
Navab
,
N.
et al (
2020
)
Machine learning techniques for ophthalmic data processing: a review
.
IEEE J. Biomed. Health Inform.
24
,
3338
3350
55
Armstrong
,
G.W.
and
Lorch
,
A.C.
(
2020
)
A(eye): a review of current applications of artificial intelligence and machine learning in ophthalmology
.
Int. Ophthalmol. Clin.
60
,
57
71
56
Ogink
,
P.T.
,
Groot
,
O.Q.
,
,
A.V.
,
Bongers
,
M.E.R.
,
Oner
,
F.C.
,
Verlaan
,
J.J.
et al (
2021
)
Wide range of applications for machine-learning prediction models in orthopedic surgical outcome: a systematic review
.
Acta Orthop.
92
,
526
531
57
Standiford
,
T.C.
,
Farlow
,
J.L.
,
Brenner
,
M.J.
,
Conte
,
M.L.
and
Terrell
,
J.E.
(
2021
)
Clinical decision support systems in otolaryngology–head and neck surgery: a state of the art review
.
165
,
1
227
58
Crowson
,
M.G.
,
Ranisau
,
J.
,
Eskander
,
A.
,
Babier
,
A.
,
Xu
,
B.
,
Kahmke
,
R.R.
et al (
2020
)
A contemporary review of machine learning in otolaryngology–head and neck surgery
.
Laryngoscope
130
,
45
51
59
Thakur
,
N.
,
Yoon
,
H.
and
Chong
,
Y.
(
2020
)
Current trends of artificial intelligence for colorectal cancer pathology image analysis: a systematic review
.
Cancers
12
,
1884
60
Sultan
,
A.S.
,
Elgharib
,
M.A.
,
Tavares
,
T.
,
Jessri
,
M.
and
Basile
,
J.R.
(
2020
)
The use of artificial intelligence, machine learning and deep learning in oncologic histopathology
.
J. Oral Pathol. Med.
49
,
849
856
61
McAlpine
,
E.D.
,
Michelow
,
P.
and
Celik
,
T.
(
2021
)
The utility of unsupervised machine learning in anatomic pathology
.
Am. J. Clin. Pathol.
156
,
1
166
62
Hoodbhoy
,
Z.
,
Jeelani
,
S.M.
,
Aziz
,
A.
,
Habib
,
M.I.
,
Iqbal
,
B.
,
Akmal
,
W.
et al (
2021
)
Machine learning for child and adolescent health: a systematic review
.
Pediatrics
147
,
e2020011833
63
Khera
,
P.
and
Kumar
,
N.
(
2020
)
Role of machine learning in gait analysis: a review
.
J. Med. Eng. Technol.
44
,
441
467
64
Amorim
,
P.
,
Paulo
,
J.R.
,
Silva
,
P.A.
,
Peixoto
,
P.
,
Castelo-Branco
,
M.
and
Martins
,
H.
(
2021
)
Machine learning applied to low back pain rehabilitation–a systematic review
.
Int. J. Digit. Health
1
,
10
65
Mantelakis
,
A.
,
Assael
,
Y.
,
Sorooshian
,
P.
and
Khajuria
,
A.
(
2021
)
Machine learning demonstrates high accuracy for disease diagnosis and prognosis in plastic surgery
.
Plastic Reconstr. Surg. Glob. Open.
9
,
e3638
66
Huang
,
S.
,
Dang
,
J.
,
Sheckter
,
C.C.
,
Yenikomshian
,
H.A.
and
Gillenwater
,
J.
(
2021
)
A systematic review of machine learning and automation in burn wound evaluation: a promising but developing frontier
.
Burns
47
,
1691
1704
67
Le Glaz
,
A.
,
Haralambous
,
Y.
,
Kim-Dufor
,
D.H.
,
Lenca
,
P.
,
Billot
,
R.
,
Ryan
,
T.C.
et al (
2021
)
Machine learning and natural language processing in mental health: systematic review
.
J. Med. Internet. Res.
23
,
e15708
68
Bracher-Smith
,
M.
,
Crawford
,
K.
and
Escott-Price
,
V.
(
2020
)
Machine learning for genetic prediction of psychiatric disorders: a systematic review
.
Mol. Psychiatry
26
,
70
79
69
Field
,
M.
,
Hardcastle
,
N.
,
Jameson
,
M.
,
Aherne
,
N.
and
Holloway
,
L.
(
2021
)
Machine learning applications in radiation oncology
.
19
,
13
24
70
el Naqa
,
I.
(
2021
)
Prospective clinical deployment of machine learning in radiation oncology
.
Nat. Rev. Clin. Oncol.
18
,
605
606
71
Rajkumar
,
D.
Applications of Machine Learning in Radiology-A review. Journal For Innovative Development in Pharmaceutical and Technical Science (JIDPTS). Published online 2020:8. Accessed December 1, 2021
. www.jidps.com
72
Wichmann
,
J.L.
,
Willemink
,
M.J.
and
de Cecco
,
C.N.
(
2020
)
Artificial intelligence and machine learning in radiology: current state and considerations for routine clinical implementation
.
55
,
619
627
73
Elfanagely
,
O.
,
Toyoda
,
Y.
,
Othman
,
S.
,
Bormann
,
B.
,
Mellia
,
J.A.
,
Broach
,
R.B.
et al (
2021
)
Machine learning and surgical outcomes prediction: a systematic review
.
J. Surg. Res.
264
,
346
361
74
Henn
,
J.
,
Buness
,
A.
,
Schmid
,
M.
,
Kalff
,
J.C.
and
Matthaei
,
H.
(
2021
)
Machine learning to guide clinical decision-making in abdominal surgery—a systematic literature review
.
Langenbeck's Arch. Surg.
1
,
1
11
75
Kilic
,
A.
(
2020
)
Artificial intelligence and machine learning in cardiovascular health care
.
Ann. Thorac. Surg.
109
,
1323
1329
76
Dias
,
R.D.
,
Shah
,
J.A.
and
Zenati
,
M.A.
(
2020
)
Artificial intelligence in cardiothoracic surgery
.
Miner. Cardioangiol.
68
,
532
77
Suarez-Ibarrola
,
R.
,
Hein
,
S.
,
Reis
,
G.
,
Gratzke
,
C.
and
Miernik
,
A.
(
2019
)
Current and future applications of machine and deep learning in urology: a review of the literature on urolithiasis, renal cell carcinoma, and bladder and prostate cancer
.
World J. Urol.
38
,
2329
2347
78
Salem
,
H.
,
Soria
,
D.
,
Lund
,
J.N.
and
,
A.
(
2021
)
A systematic review of the applications of expert systems (ES) and machine learning (ML) in clinical urology
.
BMC Med. Inform. Decis. Mak.
21
,
1
36
79
Zarkowsky
,
D.S.
and
Stonko
,
D.P.
Artificial intelligence's role in vascular surgery decision-making. Seminars in Vascular Surgery. Published online October 27, 2021
.
80
Boyd
,
C.
,
Brown
,
G.
,
Kleinig
,
T.
,
Dawson
,
J.
,
McDonnell
,
M.D.
,
Jenkinson
,
M.
et al (
2021
)
Machine learning quantitation of cardiovascular and cerebrovascular disease: a systematic review of clinical applications
.
Diagnostics
11
,
551
81
Alloghani
,
M.
,
Al-Jumeily
,
D.
,
Mustafina
,
J.
,
Hussain
,
A.
and
Aljaaf
,
A.J.
A Systematic Review on Supervised and Unsupervised Machine Learning Algorithms for Data Science. Published online 2020:3–21
.
82
Lo Vercio
,
L.
,
,
K.
,
Bannister
,
J.J.
,
Crites
,
S.
,
Gutierrez
,
A.
,
MacDonald
,
M.E.
et al (
2020
)
Supervised machine learning tools: a tutorial for clinicians
.
J. Neural Eng.
17
,
062001
83
Matloff N. Statistical regression and classification: From linear models to machine learning. Statistical Regression and Classification: From Linear Models to Machine Learning. Published online January 1, 2017:1–493
.
84
Nusinovici
,
S.
,
Tham
,
Y.C.
,
Chak Yan
,
M.Y.
,
Wei Ting
,
D.S.
,
Li
,
J.
,
Sabanayagam
,
C.
et al (
2020
)
Logistic regression was as good as machine learning for predicting major chronic diseases
.
J. Clin. Epidemiol.
122
,
56
69
85
Pregibon
,
D.
(1981) Logistic Regression Diagnostics. 9, 705–724 https://doi.org/101214/aos/1176345513
86
Searle
,
S.R.
and
Gruber
,
M.H.J.
(
2016
)
Linear Models
,
Wiley, New Jersey, United States
87
Mehryar
,
M.
,
,
A.
and
Talwalkar
,
A.
(
2018
)
Foundations of Machine Learning
,
MIT Press
,
88
Ghosal
,
S.
,
Sengupta
,
S.
,
Majumder
,
M.
and
Sinha
,
B.
(
2020
)
Linear regression analysis to predict the number of deaths in India due to SARS-CoV-2 at 6 weeks from day 0 (100 cases - March 14th 2020)
.
Diabetes Metab. Syndr.
14
,
311
315
89
Lip
,
G.Y.H.
,
Genaidy
,
A.
,
Tran
,
G.
,
Marroquin
,
P.
,
Estes
,
C.
and
Sloop
,
S.
(
2021
)
Improving stroke risk prediction in the general population: a comparative assessment of common clinical rules, a new multimorbid index, and machine-learning-based algorithms
.
Thromb. Haemost.
19
,
603
883
90
Sha
,
K.
,
Lu
,
Y.
,
Zhang
,
P.
,
Pei
,
R.
,
Shi
,
X.
,
Fan
,
Z.
et al (
2020
)
Identifying a novel 5-gene signature predicting clinical outcomes in acute myeloid leukemia
.
Clin. Transl. Oncol.
23
,
648
656
91
Lin
,
D.Y.
and
Wei
,
L.J.
(
1989
)
The robust inference for the cox proportional hazards model
.
J. Am. Stat. Assoc.
84
,
1074
1078
92
Zhao
,
X.
and
Zhou
,
X.
(
2006
)
Proportional hazards models for survival data with long-term survivors
.
Stat. Probab. Lett.
76
,
1685
1693
93
Wolfson
,
J.
,
,
S.
,
Elidrisi
,
M.
,
Vazquez-Benitez
,
G.
,
Vock
,
D.M.
,
Musgrove
,
D.
et al (
2015
)
A Naive Bayes machine learning approach to risk prediction using censored, time-to-event data
.
Stat. Med.
34
,
2941
2957
94
Murphy KP. Naive Bayes classifiers
95
Yang
,
L.
,
Fu
,
B.
,
Li
,
Y.
,
Liu
,
Y.
,
Huang
,
W.
,
Feng
,
S.
et al (
2020
)
Prediction model of the response to neoadjuvant chemotherapy in breast cancers by a Naive Bayes algorithm
.
Comput. Methods Prog. Biomed.
192
,
105458
96
Wei
,
W.
,
Visweswaran
,
S.
and
Cooper
,
G.F.
(
2011
)
The application of naive Bayes model averaging to predict Alzheimer's disease from genome-wide data
.
J. Am. Med. Inform. Assoc.
18
,
370
375
97
Lewis R. An introduction to classification and regression tree (CART) analysis. 2000 Annual Meeting of the Society for Academic Emergency Medicine. Published online 2000. Accessed November 30, 2021
98
Fernandez-Lozano
,
C.
,
Hervella
,
P.
,
,
V.
,
Rodríguez-Yáñez
,
M.
,
Suárez-Garaboa
,
S.
,
López-Dequidt
,
I.
et al (
2021
)
Random forest-based prediction of stroke outcome
.
Sci. Rep.
11
,
1
12
99
Li
,
Y.
,
Pan
,
J.
,
Zhou
,
N.
,
Fu
,
D.
,
Lian
,
G.
,
Yi
,
J.
et al (
2021
)
A random forest model predicts responses to infliximab in Crohn's disease based on clinical and serological parameters
.
Scand. J. Gastroenterol.
56
,
1030
1039
100
Hanko
,
M.
,
Grendár
,
M.
,
Snopko
,
P.
,
Opšenák
,
R.
,
Šutovský
,
J.
,
Benčo
,
M.
et al (
2021
)
Random forest–based prediction of outcome and mortality in patients with traumatic brain injury undergoing primary decompressive craniectomy
.
World Neurosurg.
148
,
e450
e458
101
Couronné
,
R.
,
Probst
,
P.
and
Boulesteix
,
A.L.
(
2018
)
Random forest versus logistic regression: a large-scale benchmark experiment
.
BMC Bioinformatics
19
,
1
14
102
Breiman
,
L.
(
1996
)
Bagging predictors
.
Mach. Learn.
24
,
123
140
103
Bühlmann
,
P.
and
Yu
,
B.
(
2002
)
Analyzing bagging
.
Ann. Statist.
30
,
927
961
104
Chen
,
T.
and
Guestrin
,
C.
(
2016
)
XGBoost: a scalable tree boosting system. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 13–17-August-2016:785–794
.
105
Jiang
,
Y.Q.
,
Cao
,
S.E.
,
Cao
,
S.
,
Chen
,
J.N.
,
Wang
,
G.Y.
,
Shi
,
W.Q.
et al (
2021
)
Preoperative identification of microvascular invasion in hepatocellular carcinoma by XGBoost and deep learning
.
J. Cancer Res. Clin. Oncol.
147
,
821
833
106
Schapire RE. Explaining AdaBoost. Empirical Inference: Festschrift in Honor of Vladimir N Vapnik. Published online January 1, 2013:37–52
.
107
Huang
,
Q.
,
Chen
,
Y.
,
Liu
,
L.
,
Tao
,
D.
and
Li
,
X.
(
2020
)
On combining biclustering mining and adaboost for breast tumor classification
.
IEEE Trans. Knowl. Data Eng.
32
,
728
738
108
Hyoungju
,
C.J.
and
Park
,
J.H.
(
2021
)
Prediction of critical care outcome for adult patients presenting to emergency department using initial triage information: an XGBoost algorithm analysis
.
JMIR Med. Inform.
9
,
e30770
109
Varghese
,
B.A.
,
Shin
,
H.
,
Desai
,
B.
,
Hwang
,
D.H.
,
Aron
,
M.
,
Siddiqui
,
I.
et al (
2021
)
.
94
,
20210221
110
Ishwaran
,
H.
(
2008
)
UKEBML. random survival forests
.
Ann. Appl. Stat.
2
,
841
860
111
Akai
,
H.
,
Yasaka
,
K.
,
Kunimatsu
,
A.
,
Nojima
,
M.
,
Kokudo
,
T.
,
Kokudo
,
N.
et al (
2018
)
Predicting prognosis of resected hepatocellular carcinoma by radiomics analysis with random survival forest
.
Diagn. Interv. Imaging
99
,
643
651
112
Deng
,
H.
(
2018
)
Interpreting tree ensembles with in trees
.
Int. J. Data Sci. Anal.
7
,
277
287
113
Breiman
,
L.
(
2001
)
Random forests
.
Mach. Learn.
45
,
5
32
114
Parry
,
R.M.
,
Jones
,
W.
,
Stokes
,
T.H.
,
Phan
,
J.H.
,
Moffitt
,
R.A.
,
Fang
,
H.
et al (
2010
)
k-Nearest neighbor models for microarray gene expression analysis and clinical outcome prediction
.
Pharmacogenomics J.
10
,
292
309
115
Rosenfeld
,
N.
,
Aharonov
,
R.
,
Meiri
,
E.
,
Rosenwald
,
S.
,
Spector
,
Y.
,
Zepeniuk
,
M.
et al (
2008
)
MicroRNAs accurately identify cancer tissue origin
.
Nat. Biotechnol.
26
,
462
469
116
Miller
,
L.D.
,
Smeds
,
J.
,
George
,
J.
,
Vega
,
V.B.
,
Vergara
,
L.
,
Ploner
,
A.
et al (
2005
)
An expression signature for p53 status in human breast cancer predicts mutation status, transcriptional effects, and patient survival
.
102
,
13550
13555
117
Pisner,
D.A
and
Schnyer,
D.M
.
Support vector machine. Machine Learning: Methods and Applications to Brain Disorders. Published online January 1, 2020:101–121
.
118
Cui
,
S.
,
Wang
,
D.
,
Wang
,
Y.
,
Yu
,
P.W.
and
Jin
,
Y.
(
2018
)
An improved support vector machine-based diabetic readmission prediction
.
Comput. Methods Prog. Biomed.
166
,
123
135
119
José Del Coz
,
J.
,
Díez
,
J.
and
Bahamonde
,
A.
(
2009
)
Learning nondeterministic classifiers
.
J. Mach. Learn. Res.
10
,
2273
2293
120
Žohar
,
P.
,
Kovačič
,
M.
,
Brezocnik
,
M.
and
Podbregar
,
M.
(
2005
)
Prediction of maintenance of sinus rhythm after electrical cardioversion of atrial fibrillation by non-deterministic modelling
.
Europace
7
,
500
507
121
Floyd
,
R.W.
(
1967
)
Nondeterministic algorithms
.
J. ACM (JACM)
14
,
636
644
122
Guo
,
Y.
,
Liu
,
Y.
,
Oerlemans
,
A.
,
Lao
,
S.
,
Wu
,
S.
and
Lew
,
M.S.
(
2016
)
Deep learning for visual understanding: a review
.
Neurocomputing
187
,
27
48
123
Wang
,
S.
,
Tang
,
C.
,
Sun
,
J.
and
Zhang
,
Y.
(
2019
)
Cerebral micro-bleeding detection based on densely connected neural network
.
Front. Neurosci.
13
,
422
124
Sharma
,
P.
and
Singh
,
A.
Era of deep neural networks: A review. 8th International Conference on Computing, Communications and Networking Technologies, ICCCNT 2017. Published online December 13, 2017
.
125
Voulodimos
,
A.
,
Doulamis
,
N.
,
Doulamis
,
A.
and
,
E.
(
2018
)
Deep learning for computer vision: a brief review
.
Comput. Intell. Neurosci.
2018
,
7068349
126
Janocha
,
K.
and
Czarnecki
,
W.M.
(
2016
)
On loss functions for deep neural networks in classification
.
Schedae Informaticae
25
,
49
59
127
Agarap AF. Deep Learning using Rectified Linear Units (ReLU). <arXiv. Published online March 2018
128
Narayan
,
S.
(
1997
)
The generalized sigmoid activation function: competitive supervised learning
.
Inform. Sci.
99
,
69
82
129
Abbasi
,
S.F.
,
,
J.
,
Tahir
,
A.
,
Awais
,
M.
,
Chen
,
C.
,
Irfan
,
M.
et al (
2020
)
EEG-based neonatal sleep-wake classification using multilayer perceptron neural network
.
IEEE Access
8
,
183025
183034
130
Waldrop
,
M.M.
(
2019
)
News feature: what are the limits of deep learning?
116
,
1074
1077
131
Diamant
,
A.
,
Chatterjee
,
A.
,
Vallières
,
M.
,
Shenouda
,
G.
and
Seuntjens
,
J.
(
2019
)
Deep learning in head & neck cancer outcome prediction
.
Sci. Rep.
9
,
1
10
132
Tjepkema-Cloostermans
,
M.C.
,
da Silva Lourenço
,
C.
,
Ruijter
,
B.J.
,
Tromp
,
S.C.
,
Drost
,
G.
,
Kornips
,
F.H.M.
et al (
2019
)
Outcome prediction in postanoxic coma with deep learning
.
Crit. Care Med.
47
,
1424
1432
133
Che
,
Z.
,
Purushotham
,
S.
,
Khemani
,
R.
and
Liu
,
Y.
(
2016
)
Interpretable Deep Models for ICU Outcome Prediction. AMIA Annual Symposium Proceedings; 2016:371. Accessed September 30, 2021. /pmc/articles/PMC5333206/
134
Morid
,
M.A.
,
Borjali
,
A.
and
del Fiol
,
G.
(
2021
)
A scoping review of transfer learning research on medical image analysis using imageNet
.
Comput. Biol. Med.
128
,
104115
135
Krizhevsky A, Sutskever I, Hinton GE. ImageNet Classification with Deep Convolutional Neural Networks. Accessed September 25, 2021
136
López-García
,
G.
,
Jerez
,
J.M.
,
Franco
,
L.
and
Veredas
,
F.J.
(
2020
)
Transfer learning with convolutional neural networks for cancer survival prediction using gene-expression data
.
PLoS ONE
15
,
e0230536
137
He
,
L.
,
Li
,
H.
,
Wang
,
J.
,
Chen
,
M.
,
Gozdas
,
E.
,
Dillman
,
J.R.
et al (
2020
)
A multi-task, multi-stage deep transfer learning model for early prediction of neurodevelopment in very preterm infants
.
Sci. Rep.
10
,
1
13
138
Han
,
W.
,
Qin
,
L.
,
Bay
,
C.
,
Chen
,
X.
,
Yu
,
K.H.
,
Miskin
,
N.
et al (
2020
)
Deep transfer learning and radiomics feature prediction of survival of patients with high-grade gliomas
.
41
,
40
48
139
Bommasani R. On the opportunities and risks of foundation models. arxiv.org. Published online 2021. Accessed December 1, 2021
. https://arxiv.org/abs/2108.07258
140
Rasmy
,
L.
,
Xiang
,
Y.
,
Xie
,
Z.
,
Tao
,
C.
and
Zhi
,
D.
(
2021
)
Med-BERT: pretrained contextualized embeddings on large-scale structured electronic health records for disease prediction
.
NPJ Digit. Med.
4
,
1
13
141
Wager
,
S.
,
Wang
,
S.
and
Liang
,
P.
(
2013
)
Dropout training as adaptive regularization. In: Advances in Neural Information Processing Systems. Accessed September 30, 2021
142
Wei
,
C.
,
,
S.
and
Ma
,
T.
(
2020
)
The implicit and explicit regularization effects of dropout. In: 37th International Conference on Machine Learning, ICML 2020. Vol PartF16814: 10112–10123. Accessed September 30, 2021
. http://proceedings.mlr.press/v119/wei20d.html
143
Zhu
,
X.
,
Yao
,
J.
and
Huang
,
J.
(
2016
)
Deep convolutional neural network for survival analysis with pathological images. Proceedings - 2016 IEEE International Conference on Bioinformatics and Biomedicine, BIBM Published online January 17, 2017:544–547
.
144
de Laurentiis
,
M.
and
Ravdin
,
P.M.
(
1994
)
A technique for using neural network analysis to perform survival analysis of censored data
.
Cancer Lett.
77
,
127
138
145
Ryu
,
S.M.
,
Seo
,
S.W.
and
Lee
,
S.H.
(
2020
)
Novel prognostication of patients with spinal and pelvic chondrosarcoma using deep survival neural networks
.
BMC Med. Inform. Decis. Mak.
20
,
1
10
146
Buteneers
,
P.
,
Verstraeten
,
D.
,
van Mierlo
,
P.
,
Wyckhuys
,
T.
,
Stroobandt
,
D.
,
Raedt
,
R.
et al (
2011
)
Automatic detection of epileptic seizures on the intra-cranial electroencephalogram of rats using reservoir computing
.
Artif. Intell. Med.
53
,
215
223
147
Xu
,
Y.
,
Hosny
,
A.
,
Zeleznik
,
R.
,
Parmar
,
C.
,
Coroller
,
T.
,
Franco
,
I.
et al (
2019
)
Deep learning predicts lung cancer treatment response from serial medical imaging
.
Clin. Cancer Res.
25
,
3266
3275
148
Reddy
,
B.K.
and
Delen
,
D.
(
2018
)
Predicting hospital readmission for lupus patients: an RNN-LSTM-based deep-learning methodology
.
Comput. Biol. Med.
101
,
199
209
149
Wang
,
J.M.
,
Liu
,
W.
,
Chen
,
X.
,
McRae
,
M.P.
,
McDevitt
,
J.T.
and
Fenyö
,
D.
Predictive modeling of morbidity and mortality in COVID-19 hospitalized patients and its clinical implications. medRxiv. Published online March 29, 2021
.
150
Baldwin
,
D.R.
,
Gustafson
,
J.
,
Pickup
,
L.
,
Arteta
,
C.
,
Novotny
,
P.
,
Declerck
,
J.
et al (
2020
)
External validation of a convolutional neural network artificial intelligence tool to predict malignancy in pulmonary nodules
.
Thorax
75
,
306
312
151
Sahoo
,
A.K.
,
,
C.
and
Das
,
H.
(
2020
)
Performance evaluation of different machine learning methods and deep-learning based convolutional neural network for health decision making. In: Studies in Computational Intelligence. Vol SCI 871. Springer, Cham; 201–212
.
152
García
,
S.
,
Luengo
,
J.
and
Herrera
,
F.
(
2015
)
Data Preprocessing in Data Mining. Accessed September 30, 2021
153
Kotsiantis S, Kanellopoulos D, of PPI journal, 2006 undefined. Data preprocessing for supervised leaning. Citeseer. Published online 2006. Accessed September 30, 2021
154
Therrien
,
R.
and
Doyle
,
S.
(
2018
)
Role of training data variability on classifier performance and generalizability. In: Https://Doi.Org/10.1117/12.2293919. Vol 10581. SPIE; 5
.
155
Kocher
,
R.
,
Emanuel
,
E.J.
and
DeParle
,
N.A.M.
(
2010
)
The affordable care act and the future of clinical medicine: The opportunities and challenges
.
Ann. Intern. Med.
153
,
536
539
156
Mathis
,
C.
(
2017
)
Data lakes
.
Datenbank-Spektrum
17
,
289
293
157
Matthias
,
J.
,
Lenzerini
,
M.
,
Vassiliou
,
Y.
,
,
P.
and
Hoffner
,
V.
(
2003
)
Fundamentals of data warehouses
.
SIGMOD Record
32
,
55
56
158
Bender D, Sartipi K. HL7 FHIR: An agile and RESTful approach to healthcare information exchange. In: Proceedings of CBMS 2013 - 26th IEEE International Symposium on Computer-Based Medical Systems; 2013:326–331
.
159
Liu
,
R.
,
Simon
,
E.
,
Amann
,
B.
and
Gançarski
,
S.
(
2020
)
Discovering and merging related analytic datasets
.
Inform. Syst.
91
,
101495
160
Huber L, Honeder T, dHealth WH. 2020 undefined. FHIR Analytics-Pragmatic Review of Recent Studies. books.google.com. 2020;271:110–112
.
161
Sun H, Depraetere K, Meesseman L, … JDRJ of B, 2021 undefined. A scalable approach for developing clinical risk prediction applications in different hospitals. Elsevier. Accessed September 30, 2021
. https://www.sciencedirect.com/science/article/pii/S153204642100112X
162
Franz,
L.
,
Shrestha,
Y.R
and
Paudel,
B.
A Deep Learning Pipeline for Patient Diagnosis Prediction Using Electronic Health Records. 2020;10. Accessed September 30, 2021
. http://arxiv.org/abs/2006.16926
163
Tarumi
,
S.
,
Takeuchi
,
W.
,
Chalkidis
,
G.
,
Rodriguez-Loya
,
S.
,
Kuwata
,
J.
,
Flynn
,
M.
et al (
2021
)
Leveraging artificial intelligence to improve chronic disease care: methods and application to pharmacotherapy decision support for type-2 diabetes mellitus
.
Methods Inf. Med.
60
,
E32
E43
164
Kawaler
,
E.
,
Cobian
,
A.
,
Peissig
,
P.
,
Cross
,
D.
,
Yale
,
S.
and
Craven
,
M.
(
2012
)
Learning to Predict Post-Hospitalization VTE Risk from EHR Data. AMIA Annual Symposium Proceedings. 2012; 436. Accessed September 30, 2021. /pmc/articles/PMC3540493/
165
Warnat-Herresthal
,
S.
,
Schultze
,
H.
,
Shastry
,
K.L.
,
Manamohan
,
S.
,
Mukherjee
,
S.
,
Garg
,
V.
et al (
2021
)
Swarm learning for decentralized and confidential clinical machine learning
.
Nature
594
,
265
270
166
Cai
,
J.
,
Luo
,
J.
,
Wang
,
S.
and
Yang
,
S.
(
2018
)
Feature selection in machine learning: a new perspective
.
Neurocomputing
300
,
70
79
167
Larrazabal
,
A.J.
,
Nieto
,
N.
,
Peterson
,
V.
,
Milone
,
D.H.
and
Ferrante
,
E.
(
2020
)
Gender imbalance in medical imaging datasets produces biased classifiers for computer-aided diagnosis
.
117
,
12592
12594
168
Sondhi
,
P.
(
2010
)
Feature construction methods: a survey. sifaka cs uiuc edu. 69:70–71
169
Piramuthu
,
S.
,
Ragavan
,
H.
and
Shaw
,
M.J.
(
1998
)
Using feature construction to improve the performance of neural networks
.
Manag. Sci.
44
,
416
430
170
Liu H, Appl HMIIST, 1998 undefined. Feature transformation and subset selection. Citeseer. Accessed September 30, 2021
171
Hautamäki
,
V.
,
Cherednichenko
,
S.
,
Kärkkäinen
,
I.
,
Kinnunen
,
T.
and
Fränti
,
P.
(
2005
)
Improving K-means by outlier removal
.
Lect. Notes Comput. Sci.
3540
,
978
987
172
Choi
,
Y.S.
(
2009
)
Least squares one-class support vector machine
.
Pattern Recognit. Lett.
30
,
1236
1240
173
Hardin
,
J.
and
Rocke
,
D.M.
(
2004
)
Outlier detection in the multiple cluster setting using the minimum covariance determinant estimator
.
Comput. Stat. Data Anal.
44
,
625
638
174
Cheng
,
Z.
,
Zou
,
C.
and
Dong
,
J.
(
2019
)
Outlier detection using isolation forest and local outlier. In: Proceedings of the 2019 Research in Adaptive and Convergent Systems, RACS 2019. Association for Computing Machinery, Inc; 161–168
.
175
Juszczak, P., Tax, D. asci RDProc, 2002 undefined. Feature scaling in support vector data description. Citeseer. Accessed September 30, 2021
176
Figueroa
,
R.L.
,
Zeng-Treitler
,
Q.
,
Kandula
,
S.
and
Ngo
,
L.H.
(
2012
)
Predicting sample size required for classification performance
.
BMC Med. Inform. Decis. Mak.
12
,
1
10
177
Batuwita
,
R.
and
,
V.
(
2010
)
Efficient resampling methods for training support vector machines with imbalanced datasets. In: Proceedings of the International Joint Conference on Neural Networks
.
178
Nikolenko
,
S.I.
(
2021
)
Synthetic data for deep learning. In: Springer Optimization and Its Applications. Vol 174. Springer Optimization and Its Applications. Springer International Publishing; 1–54
.
179
Chawla
,
N.V.
,
Bowyer
,
K.W.
,
Hall
,
L.O.
and
Kegelmeyer
,
W.P.
(
2002
)
SMOTE: synthetic minority over-sampling technique
.
J. Artif. Intell. Res.
16
,
321
357
180
Weng
,
C.G.
and
Poon
,
J.
A New Evaluation Measure for Imbalanced Datasets
181
Lin
,
H.I.
and
Nguyen
,
M.C.
(
2020
)
Boosting minority class prediction on imbalanced point cloud data
.
Appl. Sci. (Switzerland)
10
,
973
182
Jiang
,
Y.
,
Chen
,
S.
,
McGuire
,
D.
,
Chen
,
F.
,
Liu
,
M.
,
Iacono
,
W.G.
et al (
2018
)
Proper conditional analysis in the presence of missing data: Application to large scale meta-analysis of tobacco use phenotypes
.
PLoS Genet.
14
,
e1007452
183
Kent
,
J.T.
(
1983
)
Information gain and a general measure of correlation
.
Biometrika
70
,
163
173
184
Raileanu
,
L.E.
and
Stoffel
,
K.
(
2004
)
Theoretical comparison between the gini index and information gain criteria
.
Ann. Math. Artif. Intell.
41
,
77
93
185
Pratihar
,
D.K.
(
2011
)
Non-Linear Dimensionality Reduction Techniques. In: Encyclopedia of Data Warehousing and Mining, Second Edition. Springer; 308
.
186
Wold
,
S.
and
Esbensen
,
K.
Laboratory PGC and intelligent, 1987 U. Principal component analysis. Elsevier. Accessed September 30, 2021
. https://www.sciencedirect.com/science/article/pii/0169743987800849
187
Zhu
,
W.
,
Webb
,
Z.T.
,
Mao
,
K.
and
Romagnoli
,
J.
(
2019
)
A deep learning approach for process data visualization using t-distributed stochastic neighbor embedding
.
Ind. Eng. Chem. Res.
58
,
9564
9575
188
McInnes
,
L.
,
Healy
,
J.
,
Saul
,
N.
and
Großberger
,
L.
(
2018
)
UMAP: uniform manifold approximation and projection
.
J. Open Source Softw.
3
,
861
189
Seger
,
C.
An investigation of categorical variable encoding techniques in machine learning: binary versus one-hot and feature hashing. DEGREE PROJECT TECHNOLOGY. Published online 2018. Accessed September 30, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-237426
190
Guo
,
C.
and
Berkhahn
,
F.
Entity Embeddings of Categorical Variables. Published online April 22, 2016. Accessed September 30, 2021
. https://arxiv.org/abs/1604.06737v1
191
Hill
,
F.
,
Cho
,
K.H.
,
Jean
,
S.
,
Devin
,
C.
and
Bengio
,
Y.
(
2015
)
Embedding word similarity with neural machine translation. In: 3rd International Conference on Learning Representations, ICLR 2015 - Workshop Track Proceedings. International Conference on Learning Representations, ICLR. Accessed September 30, 2021
. https://arxiv.org/abs/1412.6448v4
192
Jian
,
S.
,
Cao
,
L.
,
Pang
,
G.
,
Lu
,
K.
and
Gao
,
H.
(
2017
)
Embedding-based representation of categorical data by hierarchical value coupling learning. IJCAI International Joint Conference on Artificial Intelligence;0:1851-1857. Accessed September 30, 2021.
https://opus.lib.uts.edu.au/handle/10453/126349
193
Larsen
,
J.
and
Goutte
,
C.
(
1999
)
On optimal data split for generalization estimation and model selection. In: Neural Networks for Signal Processing - Proceedings of the IEEE Workshop. IEEE; 225–234
.
194
Schaffer,
C
. (
1993
)
Selecting a classification method by cross-validation
.
Mach. Learn.
13
:
135
143
.
195
Pathak
,
P.K.
(
1962
)
On simple random sampling with replacement. Sankhyā: The Indian Journal of Statistics; Series A:287–302. Accessed September 30, 2021.
https://www.jstor.org/stable/25049220
196
Fawcett
,
T.
(
2006
)
An introduction to ROC analysis
.
Pattern Recognit. Lett.
27
,
861
874
197
Muschelli
,
J.
(
2019
)
ROC and AUC with a binary predictor: a potentially misleading metric
.
J. Classif.
37
,
696
708
198
Boyd
,
K.
,
Eng
,
K.H.
and
Page
,
C.D.
(
2013
)
Area under the Precision-Recall Curve: Point Estimates and Confidence Intervals. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8190 LNAI(PART 3):451–466
.
199
Yacouby
,
R.
and
Axman
,
D.
(
2020
)
Probabilistic Extension of Precision, Recall, and F1 Score for More Thorough Evaluation of Classification Models. In: Association for Computational Linguistics (ACL); 79–91
.
200
Cerulli
,
G.
Machine Learning using Stata/Python. Published online March 3, 2021. Accessed September 30, 2021
. https://arxiv.org/abs/2103.03122v1
201
Kolosova
,
T.
and
Berestizhevsky
,
S.
(
2016
)
Supervised Machine Learning: Optimization Framework and Applications with SAS and R. Vol 4. Accessed September 30, 2021
202
Paluszek
,
M.
and
Thomas
,
S.
(
2020
)
MATLAB Machine Learning Toolboxes. In: Practical MATLAB Deep Learning 25–41
.
203
Lantz
,
B.
(
2019
)
Machine Learning with R: Expert Techniques for Predictive Modeling. Accessed September 30, 2021
204
Oliphant
,
T.E.
(
2007
)
Python for scientific computing
.
Comput. Sci. Eng.
9
,
10
20
205
Demšar
,
J.
,
Zupan
,
B.
,
Leban
,
G.
and
Curk
,
T.
(
2004
)
Orange: From experimental machine learning to interactive data mining
.
Lect. Notes Comput. Sci.
3202
,
537
539
206
Berthold
,
M.
,
Cebron
,
N.
,
Dill
,
F.
,
Gabriel
,
R.
,
Kötter
,
T.
,
Meini
,
T.
et al
2009
.
KNIME-the Konstanz information miner: version 2.0 and beyond. dl.acm.org. Published online 2006:58–61
.
207
Gerke
,
S.
,
Babic
,
B.
,
Evgeniou
,
T.
and
Cohen
,
I.G.
(
2020
)
The need for a system view to regulate artificial intelligence/machine learning-based software as medical device
.
NPJ Digit. Med.
3
,
1
4
This is an open access article published by Portland Press Limited on behalf of the Biochemical Society and the Royal Society of Biology and distributed under the Creative Commons Attribution License 4.0 (CC BY).
| 2022-01-18T02:11:40 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 3, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3298479914665222, "perplexity": 5285.546041957118}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-05/segments/1642320300658.84/warc/CC-MAIN-20220118002226-20220118032226-00434.warc.gz"}
|
https://par.nsf.gov/biblio/10370444-zwicky-transient-facility-phase-sample-hydrogen-rich-superluminous-supernovae-without-strong-narrow-emission-lines
|
The Zwicky Transient Facility phase I sample of hydrogen-rich superluminous supernovae without strong narrow emission lines
ABSTRACT
We present a sample of 14 hydrogen-rich superluminous supernovae (SLSNe II) from the Zwicky Transient Facility (ZTF) between 2018 and 2020. We include all classified SLSNe with peaks Mg < −20 mag with observed broad but not narrow Balmer emission, corresponding to roughly 20 per cent of all hydrogen-rich SLSNe in ZTF phase I. We examine the light curves and spectra of SLSNe II and attempt to constrain their power source using light-curve models. The brightest events are photometrically and spectroscopically similar to the prototypical SN 2008es, while others are found spectroscopically more reminiscent of non-superluminous SNe II, especially SNe II-L. 56Ni decay as the primary power source is ruled out. Light-curve models generally cannot distinguish between circumstellar interaction (CSI) and a magnetar central engine, but an excess of ultraviolet (UV) emission signifying CSI is seen in most of the SNe with UV data, at a wide range of photometric properties. Simultaneously, the broad H α profiles of the brightest SLSNe II can be explained through electron scattering in a symmetric circumstellar medium (CSM). In other SLSNe II without narrow lines, the CSM may be confined and wholly overrun by the ejecta. CSI, possibly involving mass lost in recent eruptions, is implied to be the dominant power source in more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Publication Date:
NSF-PAR ID:
10370444
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
516
Issue:
1
Page Range or eLocation-ID:
p. 1193-1218
ISSN:
0035-8711
Publisher:
Oxford University Press
1. ABSTRACT ASASSN-18am/SN 2018gk is a newly discovered member of the rare group of luminous, hydrogen-rich supernovae (SNe) with a peak absolute magnitude of MV ≈ −20 mag that is in between normal core-collapse SNe and superluminous SNe. These SNe show no prominent spectroscopic signatures of ejecta interacting with circumstellar material (CSM), and their powering mechanism is debated. ASASSN-18am declines extremely rapidly for a Type II SN, with a photospheric-phase decline rate of ∼6.0 mag (100 d)−1. Owing to the weakening of H i and the appearance of He i in its later phases, ASASSN-18am is spectroscopically a Type IIb SN with a partially stripped envelope. However, its photometric and spectroscopic evolution shows significant differences from typical SNe IIb. Using a radiative diffusion model, we find that the light curve requires a high synthesized 56Ni mass $M_{\rm Ni} \sim 0.4\, \rm {M_{\odot }}$ and ejecta with high kinetic energy Ekin = (7–10) × 1051 erg. Introducing a magnetar central engine still requires $M_{\rm Ni} \sim 0.3\, \rm {M_{\odot }}$ and Ekin = 3 × 1051 erg. The high 56Ni mass is consistent with strong iron-group nebular lines in its spectra, which are also similar to several SNe Ic-BL with high 56Ni yields. The earliest spectrum shows ‘flash ionization’ features, from which we estimatemore »
2. ABSTRACT We present and discuss the optical spectrophotometric observations of the nearby (z = 0.087) Type I superluminous supernova (SLSN I) SN 2017gci, whose peak K-corrected absolute magnitude reaches Mg = −21.5 mag. Its photometric and spectroscopic evolution includes features of both slow- and of fast-evolving SLSN I, thus favoring a continuum distribution between the two SLSN-I subclasses. In particular, similarly to other SLSNe I, the multiband light curves (LCs) of SN 2017gci show two re-brightenings at about 103 and 142 d after the maximum light. Interestingly, this broadly agrees with a broad emission feature emerging around 6520 Å after ∼51 d from the maximum light, which is followed by a sharp knee in the LC. If we interpret this feature as Hα, this could support the fact that the bumps are the signature of late interactions of the ejecta with a (hydrogen-rich) circumstellar material. Then we fitted magnetar- and CSM-interaction-powered synthetic LCs on to the bolometric one of SN 2017gci. In the magnetar case, the fit suggests a polar magnetic field Bp ≃ 6 × 1014 G, an initial period of the magnetar Pinitial ≃ 2.8 ms, an ejecta mass $M_{\rm ejecta}\simeq 9\, \mathrm{M}_\odot$ and an ejecta opacity $\kappa \simeq 0.08\, \mathrm{cm}^{2}\, \rm{g}^{-1}$. A CSM-interactionmore »
We present photometric and spectroscopic observations of the nearby (D≈ 28 Mpc) interacting supernova (SN) 2019esa, discovered within hours of explosion and serendipitously observed by the Transiting Exoplanet Survey Satellite (TESS). Early, high-cadence light curves from both TESS and the DLT40 survey tightly constrain the time of explosion, and show a 30 day rise to maximum light followed by a near-constant linear decline in luminosity. Optical spectroscopy over the first 40 days revealed a reddened object with narrow Balmer emission lines seen in Type IIn SNe. The slow rise to maximum in the optical light curve combined with the lack of broad Hαemission suggest the presence of very optically thick and close circumstellar material (CSM) that quickly decelerated the SN ejecta. This CSM was likely created from a massive star progenitor with an$Ṁ$∼ 0.2Myr−1lost in a previous eruptive episode 3–4 yr before eruption, similar to giant eruptions of luminous blue variable stars. At late times, strong intermediate-width Caii, Fei, and Feiilines are seen in the optical spectra, identical to those seen in the superluminous interacting SN 2006gy. The strong CSM interaction masks the underlying explosion mechanism in SN 2019esa, but the combination of the luminosity,more »
| 2023-03-26T16:49:30 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 1, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6655641198158264, "perplexity": 7161.572400453289}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945473.69/warc/CC-MAIN-20230326142035-20230326172035-00478.warc.gz"}
|
https://pos.sissa.it/334/070/
|
Volume 334 - The 36th Annual International Symposium on Lattice Field Theory (LATTICE2018) - Hadron Spectroscopy and Interactions
Scattering phase shift determinations from atwo-scalar field theory
D. Darvish*, R. Brett, J. Bulava, J. Fallica, A. Hanlon and C. Morningstar
Full text: pdf
Published on: May 29, 2019
Abstract
A field theory involving two interacting scalar fields, previously studied by Rummukainen and Gottlieb, is revisited. Our study is not restricted to the limit of large quartic couplings, and a Symanzik-improved action is used so that continuum dispersion relations work well. The Metropolis method, combined with a local microcanonical updating algorithm, is employed in our Monte Carlo calculations. Isotropic lattices ranging from $16^3 \times 48$ to $53^3 \times 48$ are used, and scattering phase shifts are determined using a L\"uscher analysis with multiple partial waves.
DOI: https://doi.org/10.22323/1.334.0070
How to cite
Metadata are provided both in "article" format (very similar to INSPIRE) as this helps creating very compact bibliographies which can be beneficial to authors and readers, and in "proceeding" format which is more detailed and complete.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2023-02-01T05:28:19 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3210117220878601, "perplexity": 2696.2292892493}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764499911.86/warc/CC-MAIN-20230201045500-20230201075500-00200.warc.gz"}
|
https://www.usgs.gov/centers/california-water-science-center/science/statistical-evaluation-factors-affecting-occurrence
|
# Statistical Evaluation of Factors Affecting Occurrence of Organic Constituents from Fuels in Public-Supply Wells in Southern California Completed
December 14, 2018
| 2022-08-14T13:05:02 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8912637829780579, "perplexity": 13254.482394851528}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-33/segments/1659882572033.91/warc/CC-MAIN-20220814113403-20220814143403-00185.warc.gz"}
|
https://www.scstatehouse.gov/sess123_2019-2020/sj19/20190319.htm
|
South Carolina General Assembly
123rd Session, 2019-2020
Journal of the Senate
NO. 41
JOURNAL
OF THE
SENATE
OF THE
STATE OF SOUTH CAROLINA
REGULAR SESSION BEGINNING TUESDAY, JANUARY 8, 2019
_________
TUESDAY, MARCH 19, 2019
Tuesday, March 19, 2019
(Statewide Session)
Indicates Matter Stricken
Indicates New Matter
The Senate assembled at 2:00 P.M., the hour to which it stood adjourned, and was called to order by the PRESIDENT.
A quorum being present, the proceedings were opened with a devotion by the acting Chaplain, Senator ALEXANDER as follows:
Proverbs 19:17
"Kindness to the poor, is a loan to the Lord, and He will give a great reward to the lender."
Let us pray. Dear heavenly Father, we come to You this legislative session day with thanksgiving for all Your blessings and the opportunity to serve You and the citizens of this great state. We look to You for Your direction and guidance as we go about the work before us. I pray for each member of the Senate and our staff who so abily assist us day in and day out. Let us all act out of kindness to each other and the less fortunate of our State. To Thee be the glory and honor. In Your name we pray, Amen.
The PRESIDENT called for Petitions, Memorials, Presentments of Grand Juries and such like papers.
Call of the Senate
Senator CROMER moved that a Call of the Senate be made. The following Senators answered the Call:
Alexander Allen Bennett
Campbell Campsen Cash
Climer Corbin Cromer
Davis Fanning Gambrell
Goldfinch Gregory Grooms
Harpootlian Hembree Johnson
Malloy Martin Massey
Nicholson Peeler Rice
Sabb Scott Senn
Setzler Shealy Sheheen
Talley Turner Verdin
Williams Young
A quorum being present, the Senate resumed.
On motion of Senator CLIMER, with unanimous consent, Senator CLIMER was granted leave to attend a subcommittee meeting and were granted leave to vote from the balcony.
The following was received and referred to the appropriate committee for consideration:
Document No. 4873
Agency: Department of Health and Environmental Control
Chapter: 61
Statutory Authority: 1976 Code Sections 48-1-10 et seq.
SUBJECT: Air Pollution Control Regulations and Standards
Received by Lieutenant Governor March 14, 2019
Referred to Committee on Agriculture and Natural Resources
REGULATION RESUBMITTED
Document No. 4819
Agency: State Board of Education
Chapter: 43
Statutory Authority: 1976 Code Sections 59-21-540(11), 59-33-20(c), and 59-33-30
SUBJECT: Medical Homebound Instruction
Received by Lieutenant Governor January 8, 2019
Referred to Committee on Education
Legislative Review Expiration May 8, 2019
Resubmitted March 19, 2019
REGULATIONS WITHDRAWN AND RESUBMITTED
Document No. 4824
Agency: Department of Labor, Licensing and Regulation - Manufactured Housing Board
Chapter: 79
Statutory Authority: 1976 Code Section 40-2-10(D)(3)-(7)
SUBJECT: Manufactured Home Installation Requirements
Received by Lieutenant Governor January 8, 2019
Referred to Committee on Labor, Commerce and Industry
Legislative Review Expiration May 8, 2019
Withdrawn and Resubmitted March 19, 2019
Document No. 4833
Agency: State Board of Education
Chapter: 43
Statutory Authority: 1976 Code Sections 56-5-180, 56-5-190, 56-5-195, 56-5-196, 59-5-60, 59-67-10, 59-67-20, 59-67-30, 59-67-40, 59-67-160, 59-67-240,
59-67-410, 59-67-470, 59-67-520, 59-67-535, and 59-67-570
SUBJECT: Operation of Public Pupil Transportation Services
Received by Lieutenant Governor January 8, 2019
Referred to Committee on Education
Legislative Review Expiration May 8, 2019
Withdrawn and Resubmitted March 19, 2019
Leave of Absence
On motion of Senator ALEXANDER, at 2:06 P.M., Senator LEATHERMAN was granted a leave of absence until 3:00 P.M.
S. 11 (Word version) Sens. McElveen and Bennett
S. 259 (Word version) Sen. Campbell
S. 298 (Word version) Sen. Hutto
S. 663 (Word version) Sens. Campsen and Talley
S. 675 (Word version) Sen. Allen
RECALLED
S. 661 (Word version) -- Senator Fanning: A CONCURRENT RESOLUTION TO REQUEST THAT THE DEPARTMENT OF TRANSPORTATION NAME THE BRIDGE ON WATEREE ROAD WHERE IT CROSSES THE WATEREE CREEK "JERRY NEALY BRIDGE" AND ERECT APPROPRIATE MARKERS OR SIGNS AT THIS LOCATION CONTAINING THE DESIGNATION.
Senator GROOMS asked unanimous consent to make a motion to recall the Concurrent Resolution from the Committee on Transportation.
The Concurrent Resolution was recalled from the Committee on Transportation and ordered placed on the Calendar for consideration tomorrow.
RECALLED AND COMMITTED
S. 551 (Word version) -- Senator Gambrell: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 56-5-2774 SO AS TO ALLOW THE DEPARTMENT OF PUBLIC SAFETY TO ISSUE A CIVIL PENALTY CITATION AGAINST THE REGISTERED OWNER OF A VEHICLE THAT UNLAWFULLY PASSES A SCHOOL BUS, TO PROVIDE A METHOD TO APPEAL THE CITATION, AND TO PROVIDE FOR THE REPEAL OF THIS SECTION.
Senator GROOMS asked unanimous consent to make a motion to recall the Bill from the Committee on Transportation.
There was no objection and the Bill was recalled from the Committee on Transportation.
On the motion of Senator GROOMS, with unanimous consent, the Bill was committed to the Committee on Judiciary.
INTRODUCTION OF BILLS AND RESOLUTIONS
The following were introduced:
S. 670 (Word version) -- Senator M. B. Matthews: A SENATE RESOLUTION TO CONGRATULATE ROBERT HEYWARD, SR. ON THE OCCASION OF HIS EIGHTIETH BIRTHDAY AND TO WISH HIM A JOYOUS BIRTHDAY CELEBRATION AND MUCH HAPPINESS IN THE DAYS AHEAD.
l:\s-res\mbm\007past.kmm.mbm.docx
S. 671 (Word version) -- Senator Jackson: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 5-25-60 SO AS TO PROVIDE THAT CERTAIN NEW AND REMODELED MANUFACTURED HOMES MUST BE EQUIPPED WITH CARBON MONOXIDE DETECTORS.
l:\council\bills\rt\17599sa19.docx
Read the first time and referred to the Committee on Labor, Commerce and Industry.
S. 672 (Word version) -- Senator Grooms: A BILL TO AMEND CHAPTER 40, TITLE 59 OF THE 1976 CODE, RELATING TO CHARTER SCHOOLS, BY ADDING SECTION 59-40-95, TO AUTHORIZE PARTNERSHIPS TO CREATE CHARTER SCHOOLS IN THE WORKPLACE IN CERTAIN CIRCUMSTANCES.
l:\s-res\lkg\020char.kmm.lkg.docx
Read the first time and referred to the Committee on Education.
S. 673 (Word version) -- Agriculture and Natural Resources Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL, RELATING TO REQUIREMENTS FOR STATE WATER POLLUTION CONTROL REVOLVING FUND LOAN ASSISTANCE, DESIGNATED AS REGULATION DOCUMENT NUMBER 4838, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
l:\council\bills\dbs\31539cz19.docx
Read the first time and ordered placed on the Calendar without reference.
S. 674 (Word version) -- Senator Jackson: A SENATE RESOLUTION TO HONOR AND CONGRATULATE BENEDICT COLLEGE ON RECEIVING A 2019 ACE/FIDELITY INVESTMENTS AWARD FOR INSTITUTIONAL TRANSFORMATION.
l:\council\bills\rm\1219vr19.docx
S. 675 (Word version) -- Senators Turner and Allen: A BILL TO AMEND ACT 745 OF 1967, RELATING TO RENEWABLE WATER RESOURCES (REWA), FORMERLY KNOWN AS THE WESTERN CAROLINA REGIONAL SEWER AUTHORITY, TO ADD THE "SOUTHERN GREENVILLE" AREA OF GREENVILLE COUNTY TO REWA'S SERVICE TERRITORY, TO EXPRESS THE GENERAL ASSEMBLY'S INTENT TO DESIGNATE A MAP AS THE DOCUMENT OF RECORD ON WHICH REWA'S AMENDED BOUNDARY LINES ARE DELINEATED, AND TO PROVIDE THAT NO RESIDENTIAL OR COMMERCIAL ENTITY LOCATED WITHIN THE SOUTHERN GREENVILLE EXTENDED TERRITORY IS REQUIRED TO TAP INTO THE SERVICES PROVIDED BY REWA UNLESS THE ENTITY DOES SO VOLUNTARILY OR HAS NO OTHER DHEC-APPROVED METHOD FOR DISPOSAL.
l:\s-res\rt\012rene.kmm.rt.docx
Read the first time and ordered placed on the Local and Uncontested Calendar.
S. 676 (Word version) -- Senator M. B. Matthews: A CONCURRENT RESOLUTION TO REQUEST THAT THE DEPARTMENT OF TRANSPORTATION NAME MITCHELLVILLE ROAD IN JASPER COUNTY "COUNCILMAN LEROY SNEED ROAD" AND ERECT APPROPRIATE MARKERS OR SIGNS AT THIS LOCATION CONTAINING THE DESIGNATION.
l:\s-res\mbm\006coun.kmm.mbm.docx
The Concurrent Resolution was introduced and referred to the Committee on Transportation.
S. 677 (Word version) -- Senator Fanning: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 27-8-85 SO AS TO REQUIRE A PERSON EMPOWERED BY LAW TO CONDEMN REAL PROPERTY MUST CONSIDER PRUDENT AND FEASIBLE ALTERNATIVES TO CONDEMNING PROPERTY SUBJECT TO A CONSERVATION EASEMENT REGISTERED WITH THE NATIONAL CONSERVATION EASEMENT DATABASE BY THE HOLDER OF A CONSERVATION EASEMENT OR OWNER OF LAND SUBJECT TO A CONSERVATION EASEMENT.
l:\council\bills\jn\3049cz19.docx
Read the first time and referred to the Committee on Judiciary.
H. 3845 (Word version) -- Reps. Elliott and Loftis: A JOINT RESOLUTION TO AUTHORIZE THE SOUTH CAROLINA PUBLIC CHARTER SCHOOL DISTRICT TO PROVIDE CERTAIN FUNDS FOR THREE- AND FOUR-YEAR-OLD CHILDREN WITH A DISABILITY WHO ARE ELIGIBLE FOR SERVICES UNDER THE INDIVIDUALS WITH DISABILITIES EDUCATION ACT AND ATTENDED SCHOOLS THAT DID NOT RECEIVE CERTAIN FUNDING.
Read the first time and referred to the Committee on Education.
H. 4237 (Word version) -- Reps. Henegan, Alexander, Allison, Anderson, Atkinson, Bailey, Bales, Ballentine, Bamberg, Bannister, Bennett, Bernstein, Blackwell, Bradley, Brawley, Brown, Bryant, Burns, Calhoon, Caskey, Chellis, Chumley, Clary, Clemmons, Clyburn, Cobb-Hunter, Cogswell, Collins, B. Cox, W. Cox, Crawford, Daning, Davis, Dillard, Elliott, Erickson, Felder, Finlay, Forrest, Forrester, Fry, Funderburk, Gagnon, Garvin, Gilliam, Gilliard, Govan, Hardee, Hart, Hayes, Henderson-Myers, Herbkersman, Hewitt, Hill, Hiott, Hixon, Hosey, Howard, Huggins, Hyde, Jefferson, Johnson, Jordan, Kimmons, King, Kirby, Ligon, Loftis, Long, Lowe, Lucas, Mace, Mack, Magnuson, Martin, McCoy, McCravy, McDaniel, McGinnis, McKnight, Moore, Morgan, D. C. Moss, V. S. Moss, Murphy, B. Newton, W. Newton, Norrell, Ott, Parks, Pendarvis, Pope, Ridgeway, Rivers, Robinson, Rose, Rutherford, Sandifer, Simmons, Simrill, G. M. Smith, G. R. Smith, Sottile, Spires, Stavrinakis, Stringer, Tallon, Taylor, Thayer, Thigpen, Toole, Trantham, Weeks, West, Wheeler, White, Whitmire, R. Williams, S. Williams, Willis, Wooten, Young and Yow: A CONCURRENT RESOLUTION TO RECOGNIZE AND CELEBRATE THE 107TH ANNIVERSARY OF GIRL SCOUTS OF THE UNITED STATES OF AMERICA AND TO HONOR GIRL SCOUTS OF EASTERN SOUTH CAROLINA, GIRL SCOUTS OF SOUTH CAROLINA, MOUNTAINS TO MIDLANDS, AND THE GIRL SCOUT MOVEMENT FOR PROVIDING GIRLS WITH A SAFE, INCLUSIVE, ALL-GIRL SPACE TO ENHANCE THEIR SKILLS AND DEVELOP LEADERSHIP ABILITIES BY DECLARING THE WEEK OF MARCH 10, 2019, TO BE "GIRL SCOUTS' WEEK".
The Concurrent Resolution was adopted, ordered returned to the House.
REPORTS OF STANDING COMMITTEES
Senator CAMPBELL from the Committee on Agriculture and Natural Resources submitted a favorable with amendment report on:
S. 107 (Word version) -- Senators Campbell and Campsen: A BILL TO AMEND SECTION 49-11-120(4) OF THE 1976 CODE, RELATING TO THE DEFINITION OF "DAM," TO INCLUDE THE ERECTION OF AN ARTIFICIAL BARRIER FOR THE PURPOSE OF CREATING A RESERVOIR, TO CLARIFY THAT FAILURE OF A DAM MUST CAUSE DANGER TO HUMAN LIFE OR THE PROPERTY OF OTHERS, AND TO ADD NEW EXCEPTIONS TO THE DEFINITION; TO AMEND ARTICLE 3, CHAPTER 11, TITLE 49 OF THE 1976 CODE, RELATING TO THE DAMS AND RESERVOIRS SAFETY ACT, TO PROVIDE THAT OWNERS OF EXISTING DAMS OR PROPERTY OWNERS INTENDING TO CONSTRUCT OR ENLARGE A DAM MAY RECEIVE FROM THE DEPARTMENT A DETERMINATION CONCERNING WHETHER THE DAM IS SUBJECT TO THE PROVISIONS OF ARTICLE 3; TO AMEND SECTION 49-11-150 OF THE 1976 CODE, RELATING TO AN OWNER'S RESPONSIBILITY FOR THE SAFE MAINTENANCE OF A DAM OR RESERVOIR, TO PROVIDE THAT THE OWNER OF A DAM OR RESERVOIR MUST PROVIDE CONTACT INFORMATION AND A COMPLETED DAM OWNER CHECKLIST TO THE DEPARTMENT ON A CERTAIN SCHEDULE, TO PROVIDE FOR A CURRENT EMERGENCY ACTION PLAN, AND TO PROVIDE FOR NOTICE OF POTENTIAL OR ACTUAL FAILURES; TO AMEND SECTION 49-11-160 OF THE 1976 CODE, RELATING TO ORDERS TO MAINTAIN, ALTER, REPAIR, OR REMOVE A DAM OR RESERVOIR, TO CHANGE THE CIRCUMSTANCES UNDER WHICH THE DEPARTMENT MAY ISSUE AN ORDER DIRECTING THE OWNER OF A DAM OR RESERVOIR TO UNDERTAKE NECESSARY MAINTENANCE, ALTERATIONS, REPAIRS, OR REMOVAL; TO AMEND SECTION 49-11-170 OF THE 1976 CODE, RELATING TO BRINGING UNSAFE DAMS TO THE ATTENTION OF THE DEPARTMENT, TO PROVIDE THAT THE DEPARTMENT CANNOT REQUIRE CHANGES TO A DAM OR RESERVOIR DUE TO RECLASSIFICATION UNLESS NECESSARY TO PREVENT THE LOSS OF HUMAN LIFE; TO AMEND SECTION 49-11-200 OF THE 1976 CODE, RELATING TO THE DEPARTMENT APPROVAL REQUIRED FOR CONSTRUCTION OR ALTERATION, TO PROVIDE THAT CONSTRUCTION OF A NEW DAM OR RESERVOIR OR THE ENLARGEMENT, REMOVAL, OR REPAIR OF AN EXISTING DAM OR RESERVOIR MAY NOT BEGIN UNLESS APPROVED BY THE DEPARTMENT AND TO PROVIDE FOR EXCEPTIONS; AND TO AMEND SECTION 12-6-3370 OF THE 1976 CODE, RELATING TO TAX CREDITS FOR THE CONSTRUCTION, INSTALLATION, OR RESTORATION OF WATER IMPOUNDMENTS AND WATER CONTROL STRUCTURES, TO PROVIDE THAT A TAXPAYER MAY CLAIM A CREDIT OF UP TO FIFTY THOUSAND DOLLARS FOR REPAIRS REQUIRED AS A RESULT OF THE DEPARTMENT RECLASSIFYING THE DAM.
Ordered for consideration tomorrow.
Senator ALEXANDER from the Committee on Labor, Commerce and Industry submitted a favorable with amendment report on:
S. 109 (Word version) -- Senator Massey: A BILL TO AMEND SECTION 40-79-20 OF THE 1976 CODE, RELATING TO THE SOUTH CAROLINA ALARM SYSTEM BUSINESS ACT, TO ADD A DEFINITION FOR "ELECTRIC FENCE," AND TO MAKE TECHNICAL CORRECTIONS.
Ordered for consideration tomorrow.
Senator CROMER from the Committee on Banking and Insurance submitted a favorable report on:
S. 133 (Word version) -- Senator Davis: A BILL TO AMEND SECTION 38-75-485 OF THE 1976 CODE, RELATING TO THE SOUTH CAROLINA HURRICANE DAMAGE MITIGATION PROGRAM, TO EXPAND THE PROGRAM TO INCLUDE FLOOD DAMAGE.
Ordered for consideration tomorrow.
Senator CROMER from the Committee on Banking and Insurance submitted a favorable report on:
S. 573 (Word version) -- Senator Cromer: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTIONS 34-39-310 AND 34-41-140 SO AS TO PROVIDE THAT THE STATE BOARD OF FINANCIAL INSTITUTIONS MAY PARTICIPATE IN A NATIONWIDE MULTISTATE LICENSING SYSTEM; TO AMEND SECTION 34-39-120, RELATING TO DEFINITIONS, SO AS TO PROVIDE A DEFINITION FOR "NATIONWIDE MULTISTATE LICENSING SYSTEM" AND "UNIQUE IDENTIFIER"; TO AMEND SECTION 34-39-150, RELATING TO LICENSURE APPLICATIONS, SO AS TO PROVIDE THAT AN APPLICATION MUST BE ACCOMPANIED WITH CERTAIN ACTUAL COSTS OF OBTAINING CREDIT REPORTS AND CRIMINAL HISTORY RECORD CHECKS; TO AMEND SECTION 34-39-260, RELATING TO THE PROMULGATION OF REGULATIONS, SO AS TO PROVIDE THAT THE BOARD MAY WAIVE OR MODIFY CERTAIN REQUIREMENTS; TO AMEND SECTION 34-41-10, RELATING TO DEFINITIONS, SO AS TO PROVIDE A DEFINITION FOR "NATIONWIDE MULTISTATE LICENSING SYSTEM" AND "UNIQUE IDENTIFIER"; TO AMEND SECTION 34-41-40, RELATING TO LICENSURE APPLICATIONS, SO AS TO PROVIDE THAT AN APPLICATION MUST BE ACCOMPANIED WITH CERTAIN ACTUAL COSTS OF OBTAINING CREDIT REPORTS AND CRIMINAL HISTORY RECORD CHECKS; AND TO AMEND SECTION 34-41-130, RELATING TO THE PROMULGATION OF REGULATIONS, SO AS TO PROVIDE THAT THE BOARD MAY WAIVE OR MODIFY CERTAIN REQUIREMENTS.
Ordered for consideration tomorrow.
Senator CROMER from the Committee on Banking and Insurance submitted a favorable with amendment report on:
S. 579 (Word version) -- Senator Gambrell: A BILL TO AMEND SECTION 38-73-920, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO REQUIRED RATE FILINGS FOR INSURERS, SO AS TO PROVIDE THAT AUTOMOBILE INSURANCE RATE INCREASES MAY NOT BE APPROVED FOR AN INSURER OR RATING ORGANIZATION WHO HAS BEEN GRANTED A RATE INCREASE IN THE PRECEDING SIX MONTHS.
Ordered for consideration tomorrow.
Senator CROMER from the Committee on Banking and Insurance submitted a favorable with amendment report on:
S. 580 (Word version) -- Senator Gambrell: A BILL TO AMEND CHAPTER 29, TITLE 38, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE SOUTH CAROLINA LIFE AND ACCIDENT AND HEALTH INSURANCE GUARANTY ASSOCIATION, SO AS TO DEFINE NECESSARY TERMS, TO PROVIDE THE PURPOSE OF THE CHAPTER, TO ALTER THE APPLICATION OF THE CHAPTER, TO ESTABLISH CERTAIN POWERS AND DUTIES FOR THE ASSOCIATION IN RELATION TO IMPAIRED OR INSOLVENT MEMBER INSURERS, TO PROVIDE THAT THE BOARD OF DIRECTORS OF THE ASSOCIATION MAY CALL AN ASSESSMENT OF THE MEMBERS AND TO PROVIDE CLASSES FOR THE ASSESSMENTS, TO REQUIRE THE ASSOCIATION TO ESTABLISH A PLAN OF OPERATION AND REQUIRE THE PLAN TO CREATE PROCEDURES FOR REMOVING A MEMBER OF THE BOARD UNDER CERTAIN CIRCUMSTANCES AND TO ADDRESS CONFLICTS OF INTEREST, TO PROSCRIBE CERTAIN DUTIES FOR THE DIRECTOR OF THE DEPARTMENT OF INSURANCE TO AID IN THE DETECTION AND PREVENTION OF INSURER IMPAIRMENTS AND INSOLVENCIES, TO PROVIDE THAT NO PERSON MAY USE THE EXISTENCE OF THE SOUTH CAROLINA LIFE AND ACCIDENT AND HEALTH INSURANCE GUARANTY ASSOCIATION FOR THE PURPOSE OF INSURANCE SALES, AND TO REQUIRE THE ASSOCIATION TO PREPARE A DOCUMENT DESCRIBING THE GENERAL PURPOSES AND LIMITATIONS OF THIS CHAPTER.
Ordered for consideration tomorrow.
Senator ALEXANDER from the Committee on Labor, Commerce and Industry submitted a favorable report on:
H. 3732 (Word version) -- Reps. Hewitt, Fry, West, Sandifer and Murphy: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 40-69-255 SO AS TO REQUIRE VETERINARIANS TO COMPLETE CONTINUING EDUCATION RELATED TO PRESCRIBING AND MONITORING CERTAIN CONTROLLED SUBSTANCES.
Ordered for consideration tomorrow.
Senator CAMPBELL from the Committee on Agriculture and Natural Resources submitted a favorable report on:
H. 4112 (Word version) -- Regulations and Administrative Procedures Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE DEPARTMENT OF LABOR, LICENSING AND REGULATION - BOARD OF VETERINARY MEDICAL EXAMINERS, RELATING TO VETERINARY MEDICINE AND ANIMAL SHELTERS, DESIGNATED AS REGULATION DOCUMENT NUMBER 4859, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
Ordered for consideration tomorrow.
HOUSE CONCURRENCE
S. 552 (Word version) -- Senators Shealy and Young: A CONCURRENT RESOLUTION TO RECOGNIZE WEDNESDAY, MARCH 20, 2019 AS "NATIONAL GUARD DAY" IN SOUTH CAROLINA TO HONOR THE MANY SACRIFICES AND VALUABLE CONTRIBUTIONS THAT THE SOUTH CAROLINA NATIONAL GUARD MAKES TO PROTECT THE FREEDOM, DEMOCRACY, AND SECURITY OF OUR STATE AND NATION.
Returned with concurrence.
THE SENATE PROCEEDED TO A CALL OF THE UNCONTESTED LOCAL AND STATEWIDE CALENDAR.
CARRIED OVER
S. 475 (Word version) -- Senator Campsen: A BILL TO AMEND SECTION 50-5-1705 OF THE 1976 CODE, RELATING TO CATCH LIMITS FOR ESTUARINE AND SALTWATER FINFISH, TO PROVIDE THAT IT IS UNLAWFUL FOR A PERSON TO TAKE OR HAVE IN POSSESSION MORE THAN THREE TRIPLETAIL IN ANY ONE DAY, NOT TO EXCEED NINE TRIPLETAIL IN ANY ONE DAY ON ANY BOAT; AND TO AMEND SECTION 50-5-1710(B) OF THE 1976 CODE, RELATING TO SIZE LIMITS FOR ESTUARINE AND SALTWATER FINFISH, TO PROVIDE THAT IT IS UNLAWFUL TO TAKE, POSSESS, LAND, SELL, PURCHASE, OR ATTEMPT TO SELL OR PURCHASE TRIPLETAIL OF LESS THAN EIGHTEEN INCHES IN TOTAL LENGTH.
On motion of Senator KIMPSON, the Bill was carried over.
SENT TO THE HOUSE
The following Bills were read the third time and ordered sent to the House of Representatives:
S. 463 (Word version) -- Senator Martin: A BILL TO AMEND SECTION 40-43-86 OF THE 1976 CODE, RELATING TO FACILITY REQUIREMENTS FOR PHARMACIES, THE PRESENCE OF PHARMACISTS-IN-CHARGE, CONSULTANT PHARMACISTS, PRESCRIPTION DRUG ORDERS, THE TRANSFERRING OF PRESCRIPTIONS, THE SUBSTITUTION OF AN EQUIVALENT DRUG OR INTERCHANGEABLE BIOLOGICAL PRODUCT, LABEL REQUIREMENTS, PATIENT RECORDS AND COUNSELING, POLICIES AND REQUIREMENTS FOR AUTOMATED SYSTEMS, UNLAWFUL PRACTICES, SALES TO OPTOMETRISTS AND HOME MEDICAL EQUIPMENT PROVIDERS, THE CODE OF ETHICS, THE SALE OF POISONS AND RETURNED MEDICATIONS, PERMIT FEES, AND COMPOUNDING REGULATIONS AND RESTRICTIONS, TO PROVIDE THAT A PHARMACIST MAY EXERCISE HIS PROFESSIONAL JUDGMENT TO DISPENSE UP TO A NINETY-DAY SUPPLY OF MEDICATION PER REFILL UP TO THE TOTAL NUMBER OF DOSAGE UNITS AS AUTHORIZED BY THE PRESCRIBER ON THE ORIGINAL PRESCRIPTION, TO PROVIDE CERTAIN REQUIREMENTS, AND TO PROVIDE EXCEPTIONS.
S. 440 (Word version) -- Senators Talley and Reese: A BILL TO AMEND SECTION 12-65-20(4) AND (8) OF THE 1976 CODE, RELATING TO DEFINITIONS FOR THE SOUTH CAROLINA TEXTILES COMMUNITIES REVITALIZATION ACT, TO PROVIDE THAT A CERTAIN CAP ON REHABILITATION EXPENSES ONLY APPLIES TO CERTAIN REHABILITATED BUILDINGS ON CONTIGUOUS PARCELS.
OBJECTION
H. 3449 (Word version) -- Reps. Hiott, Lucas, Kirby, Forrest, Young, Hixon, B. Newton, Erickson, Bradley, Mace, Atkinson, Ligon, Magnuson, Hill, Johnson and Hardee: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 46-55-70 SO AS TO PROVIDE THAT THE SOUTH CAROLINA DEPARTMENT OF AGRICULTURE IS RESPONSIBLE FOR THE REGULATION OF HEMP IN SOUTH CAROLINA IN STRICT COMPLIANCE WITH THE STANDARDS AND PRACTICES ESTABLISHED BY THE UNITED STATES DEPARTMENT OF AGRICULTURE; AND TO REPEAL SECTIONS 46-55-20 THROUGH 46-55-60, ALL RELATING TO INDUSTRIAL HEMP.
Senator SHEALY objects to the consideration of the Bill.
OBJECTION
S. 162 (Word version) -- Senators Bennett, Johnson and Climer: A BILL TO AMEND SECTION 12-37-2615 OF THE 1976 CODE, RELATING TO PENALTIES FOR FAILURE TO REGISTER A MOTOR VEHICLE, TO PROVIDE THAT A PERSON WHO FAILS TO REGISTER A MOTOR VEHICLE IS GUILTY OF A MISDEMEANOR AND, UPON CONVICTION, SHALL BE FINED NOT MORE THAN FIVE HUNDRED DOLLARS OR IMPRISONED FOR A PERIOD NOT TO EXCEED THIRTY DAYS, OR BOTH.
Senator GROOMS objects to the consideration of the Bill.
OBJECTION
H. 3595 (Word version) -- Reps. Elliott, G.M. Smith, Simrill, Stavrinakis, Loftis, Clemmons, Erickson, West, Bannister and Forrest: A BILL TO AMEND SECTION 12-6-3585, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE INDUSTRY PARTNERSHIP FUND TAX CREDIT, SO AS TO INCREASE THE AGGREGATE ANNUAL CREDIT AMOUNT.
Senator SHEALY objects to the consideration of the Bill.
OBJECTION
H. 3985 (Word version) -- Reps. Lucas, G.M. Smith and Stavrinakis: A BILL TO AMEND SECTION 12-6-40, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE APPLICATION OF THE INTERNAL REVENUE CODE TO STATE INCOME TAX LAWS, SO AS TO UPDATE THE REFERENCE TO THE INTERNAL REVENUE CODE TO THE YEAR 2018 AND TO PROVIDE THAT IF THE INTERNAL REVENUE CODE SECTIONS ADOPTED BY THIS STATE ARE EXTENDED, THEN THESE SECTIONS ALSO ARE EXTENDED FOR SOUTH CAROLINA INCOME TAX PURPOSES.
Senator SHEALY objects to the consideration of the Bill.
CARRIED OVER
S. 474 (Word version) -- Senator Campsen: A BILL TO AMEND SECTION 50-5-1705 OF THE 1976 CODE, RELATING TO CATCH LIMITS FOR ESTUARINE AND SALTWATER FINFISH, TO PROVIDE THAT IT IS UNLAWFUL FOR A PERSON TO TAKE OR HAVE IN POSSESSION MORE THAN TEN SPADEFISH IN ANY ONE DAY, NOT TO EXCEED THIRTY SPADEFISH IN ANY ONE DAY ON ANY BOAT; AND TO AMEND SECTION 50-5-1710(B) OF THE 1976 CODE, RELATING TO SIZE LIMITS FOR ESTUARINE AND SALTWATER FINFISH, TO PROVIDE THAT IT IS UNLAWFUL TO TAKE, POSSESS, LAND, SELL, PURCHASE, OR ATTEMPT TO SELL OR PURCHASE SPADEFISH OF LESS THAN FOURTEEN INCHES IN TOTAL LENGTH.
On motion of Senator KIMPSON, the Bill was carried over.
OBJECTION
Senator JACKSON objects to the consideration of the Bill.
S. 259 (Word version) -- Senators Goldfinch, Campsen, Kimpson and Campbell: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING CHAPTER 61 TO TITLE 48 SO AS TO ENACT THE "SOUTH CAROLINA RESILIENCE REVOLVING FUND ACT"; TO ESTABLISH THE "SOUTH CAROLINA RESILIENCE REVOLVING FUND" TO PROVIDE LOW INTEREST LOANS TO PERFORM FLOODED-HOME BUYOUTS AND FLOODPLAIN RESTORATION, TO AUTHORIZE THE BANK TO UNDERTAKE CERTAIN ACTIONS IN ORDER TO PROPERLY FUNCTION, TO ESTABLISH CERTAIN CRITERIA FOR LOANS AND ELIGIBLE FUND RECIPIENTS, TO PROVIDE CERTAIN REQUIREMENTS FOR THE MONIES WITHIN THE FUND, TO AUTHORIZE THE DEPARTMENT OF NATURAL RESOURCES TO UNDERTAKE CERTAIN ACTIONS TO EFFECTIVELY OPERATE THE FUND.
The Senate proceeded to the consideration of the Bill.
The Committee on Agriculture and Natural Resources proposed the following amendment (259R002.SP.SLG), which was adopted:
Amend the bill, as and if amended, by striking all after the enacting words and inserting:
/ SECTION 1. Title 48 of the 1976 Code is amended by adding:
"CHAPTER 61
South Carolina Resilience Revolving Fund Act
Section 48-61-10. This chapter may be cited as the 'South Carolina Resilience Revolving Fund Act'.
Section 48-61-20. As used in this chapter:
(1) 'Authority' means the Department of Administration's South Carolina Disaster Recovery Office.
(2) 'Conservation easement' means an interest in real property as defined in Chapter 8, Title 27, the South Carolina Conservation Easement Act of 1991.
(3) 'Department' means the Department of Administration.
(4) 'Eligible fund recipient' means:
(a) the State of South Carolina and any agency, commission, or instrumentality of the State;
(b) local governments of the State and any agency, commission, or instrumentality of the local government; and
(c) land trusts operating within the State accredited by the Land Trust Accreditation Commission, an independent program of the Land Trust Alliance that provides independent verification that land trusts meet the high standards of land conservation, stewardship, and nonprofit management in the nationally recognized Land Trust Standards and Practices.
(5) 'Floodplain restoration' means any activity undertaken to reestablish the hydrology and ecology of the floodplain to its natural state.
(6) 'Fund' means the South Carolina Resilience Revolving Fund.
(7) 'Loan' means a loan from the authority to an eligible fund recipient for the purpose of financing all or a portion of the cost of a project.
(8) 'Loan agreement' means a written agreement between the authority and a project sponsor with respect to a loan.
(9) 'Loan obligation' means a bond, note, or other evidence of obligation issued by a project sponsor to evidence its indebtedness under a loan agreement with respect to a loan.
(10) 'Local government' means any county, city, town, municipal corporation, authority, district, commission, or political subdivision created by the General Assembly or established pursuant to the laws of this State.
(11) 'Multi-family residence' means a building with multiple separate residential housing units.
(12) 'Primary single family residence' means a single detached dwelling that is occupied as the main home by the owners for the majority of the year.
(13) 'Proposed project' means a plan submitted to the authority by an eligible fund recipient for the use of loan funds.
(14) 'Repetitive loss' means a residence that sustained two or more incidents of weather-related flooding causing damages over one thousand dollars each within a period of ten consecutive years.
Section 48-61-30. There is created the South Carolina Resilience Revolving Fund. The fund is governed by the authority. The authority is a public instrumentality of this State, and the exercise by it of a power conferred in this chapter is the performance of an essential public function. The director and staff of the South Carolina Disaster Recovery Office comprise the authority, under the supervision and review of the director of the department and the Governor.
Section 48-61-40. (A) With regard to the fund, the authority is authorized to:
(1) make and service below-market interest rate loans and grants as financial incentives to eligible fund recipients meeting the criteria of Section 48-61-50 for the purchase of flooded properties and land to complete floodplain restorations, so long as the loans advance the purposes of this chapter and meet applicable criteria;
(2) enter into loan agreements and accept and enforce loan obligations, so long as the loans advance the purposes of this chapter and meet applicable criteria;
(3) receive and collect the inflow of payments on loan amounts;
(4) apply for and receive additional funding for the fund from federal, state, private, and other sources;
(5) receive charitable contributions and donations to the fund;
(6) receive contributions to the fund in satisfaction of any public or private obligation for flooding mitigation, whether such obligation arises out of law, equity, contract, regulation, administrative proceeding, or judicial proceeding. Such contributions must be used as provided for in this chapter;
(7) make and execute contracts and all other instruments and agreements necessary or convenient for the performance of its duties and the exercise of its powers and functions;
(8) establish policies and procedures for the making and administration of loans, fiscal controls, and accounting procedures to ensure proper accounting and reporting; and
(9) exercise its discretion in determining what portion of funds must be disbursed and awarded in any particular year and what portion of funds shall remain in the fund from one fiscal year to the next. Sums within the fund must be invested or deposited into interest-bearing instruments or accounts, and the accrued interest must be credited to the fund.
(B) To carry out these functions, the authority shall:
(1) operate a program in order to implement the purposes of this chapter;
(2) receive final approval from the State Fiscal Accountability Authority for fund disbursements prior to the issuance of a loan;
(3) develop additional guidelines and prescribe procedures, consistent with the criteria and purposes of this chapter;
(4) submit an annual report to the Governor, Lieutenant Governor, State Treasurer, and General Assembly that:
(a) accounts for fund receipts and disbursements;
(b) briefly describes applications submitted to the fund and, in greater detail, describes grants and loans that were approved or funded during the current year and the public benefits, including increased flood retention resulting from such grants and loans;
(c) describes recipients of fund loans and grant monies; and
(d) sets forth a list and description of all loans and grants approved and all acquisitions of homes and lands obtained since the fund's inception; and
(5) have an annual audit of the fund conducted by outside independent certified public accountants and submitted to the Governor, Lieutenant Governor, State Treasurer, and General Assembly. The accounting of fund receipts and expenditures required above must be part of this annual audit.
Section 48-61-50. (A) In the issuing of loans, the authority must:
(1) prioritize the buyout of blocks or groups of homes rather than individual homes so that no more than fifteen percent of funds disbursed in a fiscal year go toward individual home buyouts;
(2) prioritize buyouts of single-family primary residences and multi-family residences;
(3) consider the availability of additional funding sources leveraged by a project;
(4) prevent the use of the fund for homes built after July 1, 2020; and
(5) prevent the use of the fund for proposed projects that involve the use of eminent domain.
(B) The authority must issue loans using the following criteria and conditions:
(1) offer a funding package of grants and loans for a particular project that carries an overall effective interest rate equivalent to no higher than forty percent of the market interest rate as defined by the ten-year United States Treasury Yield Curve;
(2) make a portion of each loan available as a grant not requiring payment as a financial incentive to reduce the loan amount, that portion being no greater than twenty-five percent and no less than five percent of the total project disbursement, to incrementally reward those eligible fund recipients that execute beneficial flood mitigation practices. To qualify for a grant, eligible fund recipients must execute one or more of the following beneficial flood mitigation practices:
(a) ensuring residents relocate outside of the floodplain;
(b) aiding residents in relocating outside of the floodplain and within the tax base;
(c) aiding residents in relocating outside of the floodplain within an area designated as an opportunity zone;
(d) conducting floodplain restoration after the property is converted to open space to reestablish the full water storing benefits of the floodplain;
(e) completing a buyout of an area larger than ten acres; and
(f) other activities as deemed appropriate by the authority so long as they contribute to flood resilience in the community of the buyout;
(3) require that acquired properties are returned to open space and that all future development on the parcel is prohibited in perpetuity through easement; and
(4) prohibit the use of more than five hundred thousand dollars for each housing unit receiving loan funds.
(C) Eligible fund recipients may apply for loans from the fund to complete:
(1) buyouts of repetitive loss properties;
(2) buyouts of repetitive loss properties with land intended for floodplain restoration; and
(3) floodplain restoration in connection with buyouts funded through other mechanisms.
(D) In order to qualify for a loan, eligible fund recipients must apply to the authority and, at a minimum, meet the following criteria:
(1) for buyouts of repetitive loss properties:
(a) identify specific properties included in the proposed project;
(b) demonstrate how the properties qualify as repetitive loss properties;
(c) identify a plan and timeline for returning the property to open space within six months following the completion of the buyout and holding an easement on the land in perpetuity;
(d) complete an economic assessment to show the costs and benefits of the project; and
(e) identify any beneficial flood mitigation practices planned for the project;
(2) for buyouts of repetitive loss properties with land intended for floodplain restoration:
(a) identify specific properties included in the proposed project;
(b) demonstrate how the properties qualify as repetitive loss properties;
(c) identify a plan and timeline for returning the property to open space within six months following the completion of the buyout and holding an easement on the land in perpetuity;
(d) complete an economic assessment to show the costs and benefits of the project;
(e) submit a plan for conducting floodplain restoration; and
(f) identify any additional beneficial flood mitigation practices planned for the project;
(3) for other floodplain restoration:
(a) submit a plan and timeline for conducting floodplain restoration;
(b) identify a plan and timeline for holding an easement on the land in perpetuity;
(c) complete an economic assessment to show the costs and benefits of the project; and
(d) identify any additional beneficial flood mitigation practices planned for the project; and
(4) any additional criteria required by external grants contributing to the fund.
(E) Financial criteria also must be met pursuant to the standards set by the authority. The authority may require additional criteria and exercise discretion in issuing loans.
Section 48-61-60. (A) The fund must be held and administered by the authority in accordance with the provisions of this chapter and policies, rules, regulations, directives, and agreements as may be promulgated or entered into by the authority pursuant to this chapter. Earnings on balances in the fund must be credited to the fund. Amounts remaining in the fund at the end of the fiscal year accrue only to the credit of the fund. Amounts in the fund must be available in perpetuity for the purpose of providing financial assistance in accordance with the provisions of this chapter.
(B) The authority is authorized to deposit the following into the fund:
(1) federal capitalization grants, awards, or other federal assistance received by the department for the purposes of the fund;
(2) funds appropriated by the General Assembly for deposit to the fund;
(3) payments received from a recipient in repayment of a loan;
(4) interest or other income earned on the investment of monies in the fund; and
(5) additional monies made available from public or private sources for the purposes of which the fund has been established.
(C) Monies in the fund may only be used to:
(1) make loans to eligible fund recipients in accordance with the provisions of this chapter; and
(2) earn interest on fund accounts.
(D) The authority may establish accounts and subaccounts within the fund as considered desirable to effectuate the purposes of this chapter.
Section 48-61-70. In the annual general appropriations act for Fiscal Year 2019-2020, the General Assembly shall appropriate two million dollars to establish the fund. The department will seek out additional sources of funding to sustain the fund, including federal dollars from the Department of Housing and Urban Development Community Development Block Grant Disaster Recovery appropriations. Additional appropriations to the fund may be requested from the General Assembly so as to expand the capabilities of the fund.
Section 48-61-80. The Department of Administration may:
(1) promulgate regulations to effectuate the provisions of this chapter;
(2) establish an operational structure within its authority to administer the fund;
(3) develop priority systems that ensure consistency with the provisions of this chapter;
(4) prepare annual plans in accordance with this chapter;
(5) receive monies from the fund for program administration and project management activities of the fund; and
(6) hire staff and employ agents, advisers, consultants, and other employees, including attorneys, financial advisers, engineers, and other technical advisers and public accountants and determine their duties and compensation.
Section 48-61-90. The provisions of this chapter must be liberally construed to the end that its beneficial purposes may be effectuated. No proceeding, notice, or approval is required for loan obligations by a project sponsor or instruments or the security for the loan obligation, except as provided in this chapter. If the provisions of this chapter are inconsistent with the provisions of any other law, whether general, special, or local, then the provisions of this chapter are controlling."
SECTION 2. This act takes effect upon approval by the Governor. /
Renumber sections to conform.
Amend title to conform.
Senator GOLDFINCH explained the committee amendment.
Senator GOLDFINCH proposed the following amendment (259R003.SP.SLG), which was adopted:
Amend the bill, as and if amended, by striking Section 48-61-60(C) and inserting:
/ (C) Monies in the fund may only be used to:
(1) make loans to eligible fund recipients in accordance with the provisions of this chapter;
(2) earn interest on fund accounts; and
(3) provide for the program administration and project management activities of the fund. /
Renumber sections to conform.
Amend title to conform.
Senator GOLDFINCH explained the amendment.
Senator SCOTT proposed the following amendment (CZ\ 259C001.JN.CZ19), which was adopted:
Amend the bill, as and if amended, SECTION 1, by striking Section 48-61-50(A) and inserting:
/ (A) In the issuing of loans, the authority must:
(1) prioritize the buyout of blocks or groups of homes rather than individual homes so that no more than fifteen percent of funds disbursed in a fiscal year go toward individual home buyouts;
(2) prioritize buyouts of single-family primary residences and multi-family residences;
(3) consider the availability of additional funding sources leveraged by a project;
(4) prevent the use of the fund for homes built after July 1, 2020;
(5) prevent the use of the fund for proposed projects that involve the use of eminent domain; and
(6) prioritize the use of the fund for low and moderate income households making less than one hundred twenty five percent of the median household income in the jurisdiction of the eligible fund recipient. /
Renumber sections to conform.
Amend title to conform.
Senator SCOTT explained the amendment.
The question being the second reading of the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 44; Nays 1
AYES
Alexander Allen Bennett
Campbell Campsen Cash
Climer Cromer Davis
Fanning Gambrell Goldfinch
Gregory Grooms Harpootlian
Hembree Hutto Jackson
Johnson Kimpson Leatherman
Malloy Martin Massey
Matthews, John Matthews, Margie McElveen
McLeod Nicholson Peeler
Rankin Reese Rice
Sabb Scott Senn
Setzler Shealy Sheheen
Talley Turner Verdin
Williams Young
Total--44
NAYS
Corbin
Total--1
There being no further amendments, the Bill, as amended, was read the second time, passed and ordered to a third reading.
OBJECTION
S. 136 (Word version) -- Senators Davis and Shealy: A BILL TO AMEND SECTION 44-53-360(j) OF THE 1976 CODE, RELATING TO CONTROLLED SUBSTANCE PRESCRIPTIONS, TO REQUIRE THE USE OF ELECTRONIC PRESCRIPTIONS AND TO PROVIDE EXCEPTIONS.
Senator WILLIAMS objects to the consideration of the Bill.
S. 509 (Word version) -- Senator Grooms: A BILL TO AMEND ARTICLE 4, CHAPTER 15, TITLE 56 OF THE 1976 CODE, RELATING TO NONFRANCHISE AUTOMOBILE DEALER PRE-LICENSING, BY ADDING SECTION 56-15-415, TO PROVIDE THAT AN APPLICANT FOR AN INITIAL NONFRANCHISE AUTOMOBILE DEALER LICENSE MUST COMPLETE PRELICENSING EDUCATION COURSES BEFORE HE MAY BE ISSUED A LICENSE, TO PROVIDE THAT CERTAIN EDUCATIONAL REQUIREMENTS MUST BE SATISFIED BEFORE A LICENSE MAY BE RENEWED, AND TO PROVIDE THAT A PERSON WHO PROVIDES EDUCATION COURSES MUST BE AFFILIATED WITH A NATIONAL OR STATE INDUSTRY TRADE ASSOCIATION; AND TO AMEND SECTIONS 56-15-430, 56-15-440, AND 56-15-450 OF THE 1976 CODE, RELATING TO THE APPLICABILITY OF THE PROVISIONS THAT REGULATE NONFRANCHISE AUTOMOBILE DEALER PRELICENSING TO FRANCHISED AUTOMOBILE DEALERS, NONFRANCHISED AUTOMOBILE DEALERS OWNED AND OPERATED BY A FRANCHISED AUTOMOBILE DEALER, NONFRANCHISED AUTOMOBILE DEALERS WHOSE PRIMARY BUSINESS IS MOTOR VEHICLE SALVAGE, AND NONFRANCHISED AUTOMOBILE DEALERS WHOSE PRIMARY BUSINESS OBJECTIVE AND SUBSTANTIAL BUSINESS ACTIVITY IS IN THE RENTAL OF MOTOR VEHICLES, TO PROVIDE THAT CERTAIN EDUCATION REQUIREMENTS DO NOT APPLY TO THESE AUTOMOBILE DEALERS.
The Senate proceeded to the consideration of the Bill.
The Committee on Transportation proposed the following amendment (509R001.KMM.LKG), which was adopted:
Amend the bill, as and if amended, page 3, by striking lines 4 through 7 and inserting:
/ SECTION 5. This act takes effect January 1, 2020. /
Renumber sections to conform.
Amend title to conform.
Senator GROOMS explained the committee amendment.
The question being the second reading of the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 38; Nays 4
AYES
Allen Bennett Campbell
Campsen Corbin Cromer
Davis Fanning Gambrell
Goldfinch Gregory Grooms
Harpootlian Hembree Hutto
Jackson Johnson Leatherman
Malloy Martin Massey
Matthews, Margie McElveen McLeod
Nicholson Peeler Rankin
Reese Rice Sabb
Scott Shealy Sheheen
Talley Turner Verdin
Williams Young
Total--38
NAYS
Alexander Cash Climer
Senn
Total--4
There being no further amendments, the Bill, as amended, was read the second time, passed and ordered to a third reading.
S. 11 (Word version) -- Senators Peeler, McElveen and Bennett: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 1-1-30 SO AS TO PROVIDE THAT THE SOUTH CAROLINA GENERAL ASSEMBLY INTENDS FOR DAYLIGHT SAVING TIME TO BE THE YEAR-ROUND STANDARD TIME OF THE ENTIRE STATE SHOULD THE UNITED STATES CONGRESS AMEND CERTAIN RELATED FEDERAL LAW TO ALLOW STATES TO OBSERVE DAYLIGHT SAVING TIME YEAR ROUND.
The Senate proceeded to the consideration of the Bill.
Senator YOUNG explained the Bill.
The question being the second reading of the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 43; Nays 0
AYES
Alexander Allen Bennett
Campbell Campsen Cash
Climer Corbin Cromer
Davis Fanning Gambrell
Goldfinch Gregory Grooms
Harpootlian Hembree Hutto
Jackson Johnson Kimpson
Leatherman Malloy Martin
Massey Matthews, John Matthews, Margie
McElveen Nicholson Peeler
Rankin Reese Rice
Sabb Scott Senn
Setzler Shealy Talley
Turner Verdin Williams
Young
Total--43
NAYS
Total--0
The Bill was read the second time, passed and ordered to a third reading.
OBJECTION
S. 189 (Word version) -- Senators Shealy, Hutto and Jackson: A BILL TO AMEND SECTION 63-7-1640(C)(1)(d) OF THE 1976 CODE, RELATING TO FAMILY PRESERVATION AND REUNIFICATION, TO ALLOW THE DEPARTMENT OF SOCIAL SERVICES TO FOREGO REASONABLE EFFORTS TO REUNIFY A FAMILY IN THE CASE OF TORTURE; TO AMEND SECTION 63-7-2570 OF THE 1976 CODE, RELATING TO GROUNDS FOR TERMINATION OF PARENTAL RIGHTS, TO ADD TORTURE, OR CONSPIRING TO COMMIT TORTURE, AS A GROUND FOR TERMINATING A PARENT'S RIGHTS; TO AMEND SECTION 16-3-85 (A) AND (C) OF THE 1976 CODE, RELATING TO HOMICIDE BY CHILD ABUSE, TO ADD DEATH OF A CHILD BY TORTURE, OR BY CONSPIRING TO TORTURE, AS ACTIONS CONSTITUTING THE OFFENSE, AND TO ESTABLISH CRIMINAL PENALTIES; TO AMEND ARTICLE 1, CHAPTER 3, TITLE 16 OF THE 1976 CODE, RELATING TO HOMICIDE, BY ADDING SECTION 16-3-100, TO PROVIDE THAT TORTURING A CHILD, OR ALLOWING ANOTHER TO TORTURE A CHILD, IS A CRIMINAL OFFENSE, AND TO ESTABLISH PENALTIES; AND TO DEFINE NECESSARY TERMS.
Senator WILLIAMS objects to the consideration of the Bill.
S. 206 (Word version) -- Senator Young: A BILL TO AMEND SECTION 13-7-810 OF THE 1976 CODE, RELATING TO THE NUCLEAR ADVISORY COUNCIL, TO RENAME THE COUNCIL; AND TO AMEND SECTION 1-5-40(A)(70) AND SECTION 1-11-10(A)(15) OF THE 1976 CODE, RELATING TO THE SECRETARY OF STATE'S MONITORING OF STATE BOARDS AND COMMISSIONS AND TO OFFICES, DIVISIONS, AND OTHER AGENCIES WITHIN THE DEPARTMENT OF ADMINISTRATION, RESPECTIVELY, TO MAKE CONFORMING CHANGES.
The Senate proceeded to the consideration of the Bill.
The question being the second reading of the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 44; Nays 0
AYES
Alexander Allen Bennett
Campbell Campsen Cash
Climer Corbin Cromer
Davis Fanning Gambrell
Goldfinch Gregory Grooms
Harpootlian Hembree Hutto
Jackson Johnson Kimpson
Leatherman Malloy Martin
Massey Matthews, John Matthews, Margie
McElveen Nicholson Peeler
Rankin Reese Rice
Sabb Scott Senn
Setzler Shealy Sheheen
Talley Turner Verdin
Williams Young
Total--44
NAYS
Total--0
The Bill was read the second time, passed and ordered to a third reading.
S. 252 (Word version) -- Senator Fanning: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 53-3-215 SO AS TO DESIGNATE THE MONTH OF JUNE OF EVERY YEAR AS "SALKEHATCHIE SUMMER SERVICE MONTH" IN SOUTH CAROLINA.
The Senate proceeded to the consideration of the Bill.
The question being the second reading of the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 44; Nays 0
AYES
Alexander Allen Bennett
Campbell Campsen Cash
Climer Corbin Cromer
Davis Fanning Gambrell
Goldfinch Gregory Grooms
Harpootlian Hembree Hutto
Jackson Johnson Kimpson
Leatherman Malloy Martin
Massey Matthews, John Matthews, Margie
McElveen Nicholson Peeler
Rankin Reese Rice
Sabb Scott Senn
Setzler Shealy Sheheen
Talley Turner Verdin
Williams Young
Total--44
NAYS
Total--0
The Bill was read the second time, passed and ordered to a third reading.
OBJECTION
S. 413 (Word version) -- Senator Shealy: A BILL TO AMEND SECTION 23-1-212 OF THE 1976 CODE, RELATING TO THE ENFORCEMENT OF STATE CRIMINAL LAWS BY FEDERAL LAW ENFORCEMENT OFFICERS, TO PROVIDE THAT NAVAL CRIMINAL INVESTIGATIVE SERVICE AGENTS ARE AUTHORIZED TO ENFORCE THE STATE'S CRIMINAL LAWS.
Senator WILLIAMS objects to the consideration of the Bill.
S. 486 (Word version) -- Senators Talley and Reese: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING CHAPTER 4 TO TITLE 26 SO AS TO ENACT THE "SOUTH CAROLINA REMOTE ONLINE NOTARIZATION ACT", TO PROVIDE A CITATION, TO PROVIDE NECESSARY DEFINITIONS, TO PROVIDE FOR THE APPLICABILITY OF THE CHAPTER, TO PROVIDE THE SECRETARY OF STATE BY RULE SHALL DEVELOP AND MAINTAIN STANDARDS FOR CREDENTIAL ANALYSIS AND IDENTITY PROOFING AND TO PROVIDE REQUIREMENTS FOR THE DEVELOPMENT OF THESE STANDARDS, TO PROVIDE NOTARIES PUBLIC COMMISSIONED IN THIS STATE MAY REGISTER AS REMOTE ONLINE NOTARIES PUBLIC UPON SATISFYING CERTAIN REQUIREMENTS, TO ENUMERATE NOTARIAL ACTS THAT MAY BE PERFORMED BY REMOTE ONLINE NOTARIES USING ELECTRONIC TECHNOLOGY, TO PROVIDE REQUIREMENTS FOR CONDUCTING ONLINE NOTARIAL ACTS, TO PROVIDE REMOTE ONLINE NOTARIES PUBLIC MAY CHARGE FEES FOR PERFORMING REMOTE ONLINE NOTARIAL ACTS, TO PROVIDE LIABILITY, SANCTIONS, AND REMEDIES FOR THE IMPROPER PERFORMANCE OF REMOTE ONLINE NOTARIAL ACTS OR FOR PROVIDING FALSE OR MISLEADING INFORMATION IN REGISTERING TO PERFORM REMOTE ONLINE NOTARIAL ACTS ARE THE SAME AS PROVIDED BY LAW FOR THE IMPROPER PERFORMANCE OF NONELECTRONIC NOTARIAL ACTS, TO SPECIFY CERTAIN RECORDING REQUIREMENTS THAT ARE CONSIDERED SATISFIED BY REMOTE NOTARIAL ACTS, AND TO PROVIDE REMOTE ONLINE NOTARY PUBLIC APPLICATIONS WILL NOT BE ACCEPTED FOR PROCESSING UNTIL THE ADMINISTRATIVE RULES ARE IN EFFECT AND VENDORS OF TECHNOLOGY ARE APPROVED BY THE SECRETARY OF STATE, AMONG OTHER THINGS.
The Senate proceeded to the consideration of the Bill.
The Committee on Family & Veterans' Services proposed the following amendment (486R002.KM.KS), which was adopted:
Amend the bill, as and if amended, page 12, by striking line 22 and inserting:
/ SECTION 2. Title 26 of the 1976 Code is amended by adding:
"CHAPTER 2
South Carolina Electronic Notary Public Act
Section 26-2-305. (A) This chapter may be cited as the 'South Carolina Electronic Notary Public Act'.
(B) This chapter provides procedures and requirements for electronic notarization.
(1) 'Electronic' means relating to technology and having electrical, digital, magnetic, wireless, optical, electromagnetic, or similar capabilities.
(2) 'Electronic document' or 'electronic record' means information that is created, generated, sent, communicated, received, or stored by electronic means.
(3) 'Electronic journal of notarial acts' and 'electronic journal' means a chronological electronic record of notarizations that is maintained by the electronic notary public who performed the notarizations.
(4) 'Electronic notarial act' and 'electronic notarization' means an official act by an electronic notary public that involves electronic documents.
(5) 'Electronic notarial certificate' means the part of, or attachment to, an electronic record that is completed by the electronic notary public, bears that electronic notary's electronic signature and electronic seal, and states the facts attested to by the electronic notary in an electronic notarization.
(6) 'Electronic notarization system' means a set of applications, programs, hardware, software, or technologies designed to enable an electronic notary public to perform electronic notarizations.
(7) 'Electronic notary public' and 'electronic notary' means a notary public who has registered with the Secretary of State with the capability to perform electronic notarial acts in conformance with this chapter.
(8) 'Electronic notary seal' and 'electronic seal' means information within a notarized electronic document that includes the electronic notary's name, jurisdiction, registration number, and commission expiration date and generally corresponds to data in notary seals used on paper documents.
(9) 'Electronic signature' means an electronic symbol or process attached to or logically associated with an electronic document and executed or adopted by a person with the intent to sign the document.
(10) 'Public key certificate' means an electronic credential that is used to identify an individual who signed an electronic record with the certificate.
(11) 'Record' means information that is inscribed on a tangible medium or that is stored in an electronic or other medium and is retrievable in perceivable form.
(12) 'Sole control' means at all times being in the direct physical custody of the electronic notary public or safeguarded by the electronic notary with a password or other secure means of authentication.
(13) 'Tamper evident' means that any change to a record shall provide evidence of the change.
(14) 'Verification of fact' means a notarial act in which a notary reviews public or vital records, or other legally accessible data, to ascertain or confirm any of the following facts:
(a) date of birth, death, marriage, or divorce;
(b) name of parent, marital partner, offspring, or sibling; or
(c) any matter authorized for verification by a notary by other law or rule of this State.
Section 26-2-320. The provisions of Chapters 1 and 3 of this title apply to all acts authorized pursuant to this chapter unless the provisions of Chapters 1 and 3 directly conflict with the provisions of this chapter. In that case, the provisions of this chapter control when applied to electronic notaries public and electronic notarial acts.
Section 26-2-330. (A) A notary public commissioned in this State may become an electronic notary public in accordance with this section. Before a notary public performs an electronic notarization, the notary public must register with the Secretary of State in accordance with rules for registration as an electronic notary public and must identify the technology that he intends to use, which must conform to any rules or regulations adopted by the Secretary of State. A registration fee of fifty dollars must be submitted to the Secretary of State with the registration form to be used by the Secretary of State to administer the provisions of this chapter.
(B) Unless terminated pursuant to Section 26-2-450, the term of registration to perform electronic notarial acts shall begin on the registration starting date set by the Secretary of State and shall continue as long as the notary public's current commission remains valid.
(C) An individual registering to perform electronic notarial acts shall submit to the Secretary of State an application in a format prescribed by the Secretary of State that includes:
(1) proof of successful completion of the course and examination required pursuant to Section 26-2-340;
(2) disclosure of any and all license or commission revocations or other disciplinary actions against the individual; and
(3) any other information, evidence, or declaration required by the Secretary of State.
(D) Upon the individual's fulfillment of the requirements for registration under this chapter, the Secretary of State shall approve the registration and issue to the individual a unique registration number.
(E) The Secretary of State may reject a registration application if the individual fails to comply with any section of this chapter.
Section 26-2-340. (A) Before performing electronic notary acts, an electronic notary public shall take a course of instruction of sufficient length to ensure that the electronic notary public understands his duties and responsibilities, as determined and approved by the Secretary of State, and shall pass an examination of this course.
(B) The content of the course and the basis of the examination must be notarial laws, procedures, technology, and ethics as they pertain to notarizations and electronic notarizations.
Section 26-2-350. (A) The following notarial acts may be performed electronically:
(1) acknowledgments;
(2) oaths and affirmations;
(3) attestations and jurats;
(4) signature witnessing;
(5) verifications of fact;
(6) certification that a tangible copy of an electronic record is an accurate copy of the electronic record; and
(7) any other acts authorized by law.
Section 26-2-360. (A) An electronic notary public shall perform an electronic notarization only if the principal:
(1) appears in person before the electronic notary public at the time of notarization; and
(2) is personally known to the electronic notary or identified by the electronic notary through satisfactory evidence as defined in Chapter 1 of this title.
(B) In performing electronic notarial acts, an electronic notary public shall adhere to all applicable rules governing notarial acts provided in Chapter 1 of this title.
Section 26-2-370. (A) When performing an electronic notarial act, an electronic notarial certificate must be attached to, or logically associated with, the electronic document by the electronic notary public and must include:
(1) the electronic notary public's name exactly as stated on the commission issued by the Secretary of State;
(2) the electronic notary public's electronic seal;
(3) the expiration date of the electronic notary public's commission;
(4) the electronic notary public's electronic signature; and
(5) completed wording appropriate to the particular electronic notarial act, as prescribed by law.
(B) All components in subsection (A)(2) through (5) must be immediately perceptible and reproducible in the electronic record to which the electronic notary public's electronic signature is attached, such that removal or alteration of a component is tamper evident and will render evidence of alteration of the document containing the electronic notarial certificate, which may invalidate the electronic notarial act. If an electronic seal is not used, then the words 'Electronic Notary Public' and the words 'State of South Carolina' must still be attached.
(C) An electronic notary public's electronic signature or electronic seal is considered to be reliable if it is:
(1) unique to the electronic notary public;
(2) capable of independent verification;
(3) retained under the electronic notary public's sole control;
(4) attached to or logically associated with the electronic document; and
(5) linked to the data in such a manner that any subsequent alterations to the underlying document or electronic notarial certificate are tamper evident and may invalidate the electronic notarial act.
(D) The electronic seal of an electronic notary public shall contain the:
(1) name of the electronic notary public exactly as it is spelled on the electronic notary public's commission;
(2) title 'Notary Public';
(3) words 'State of South Carolina';
(4) registration number indicating the electronic notary public may perform electronic notarial acts; and
(5) expiration date of the electronic notary public's commission.
(E) The electronic seal of an electronic notary public may be a digital image that appears in the likeness or representation of a traditional physical notary public seal. The electronic seal of an electronic notary public may not be used for any purpose other than performing electronic notarizations under this chapter.
(F) Only the electronic notary public whose name and registration number appear on an electronic seal shall generate that electronic seal.
Section 26-2-380. (A) An electronic notary public may charge the maximum fee for performing an electronic notarial act specified in subsection (B), charge less than the maximum fee, or waive the fee.
(B) The maximum fees that may be charged by an electronic notary public for performing electronic notarial acts are:
(1) for acknowledgments, ten dollars per signature;
(2) for oaths and affirmations, ten dollars per signature;
(3) for attestations and jurats, ten dollars per signature;
(4) for signature witnessing, ten dollars per signature;
(5) for verifications of fact, ten dollars per signature; and
(6) for any other acts authorized by law, ten dollars per signature.
(C) An electronic notary public may charge a travel fee when traveling to perform an electronic notarial act if:
(1) the electronic notary public and the person requesting the electronic notarial act agree upon the travel fee in advance of the travel; and
(2) the electronic notary public explains to the person requesting the electronic notarial act that the travel fee is both separate from the notarial fee prescribed by subsection (B) and neither specified nor mandated by law.
(D) An electronic notary public who charges fees for performing electronic notarial acts shall conspicuously display in all of the electronic notary public's places of business and Internet websites, or present to each principal or requester of fact when outside these places of business, an English-language schedule of maximum fees for electronic notarial acts, as specified in subsection (B). A notarial fee schedule may not appear or be printed in smaller than ten-point type.
Section 26-2-390. (A) The electronic notary public's electronic signature, in combination with his electronic seal, must be used only for the purpose of performing electronic notarial acts.
(B) An electronic notary public shall use an electronic notarization system that complies with this chapter and has been registered with the Secretary of State to produce the electronic notary's electronic signature and electronic seal in a manner that is capable of independent verification.
(C) An electronic notary public shall take reasonable steps to ensure that no other individual may possess or access an electronic notarization system in order to produce the electronic notary public's electronic signature or electronic seal.
(D) An electronic notary public shall keep in his sole control all or any part of an electronic notarization system for which the exclusive purpose is to produce the electronic notary public's electronic signature and electronic seal.
(E) For the purposes of this section, 'capable of independent verification' means that any interested person may confirm through the Secretary of State that an electronic notary public who signed an electronic record in an official capacity had the authority at that time to perform electronic notarial acts.
(F) The Secretary of State shall promulgate regulations necessary to establish standards, procedures, practices, forms, and records relating to an electronic notary public's electronic signature and electronic seal. The electronic notary public's electronic seal and electronic signature must conform to all standards adopted by the Secretary of State.
Section 26-2-400. (A) An electronic notary public shall create and maintain an electronic journal of each electronic notarial act. For every electronic notarial act, the electronic notary public shall record the following information in the electronic journal:
(1) the date and time of the electronic notarial act;
(2) the type of electronic notarial act;
(3) the title or a description of the record being notarized, if any;
(4) the printed full name of each principal;
(5) if identification of the principal is based on personal knowledge, a statement to that effect;
(6) if identification of the principal is based on satisfactory evidence of identity pursuant to Section 26-1-5(17), a description of the evidence relied upon and the name of any credible witness or witnesses;
(8) if the notarial act is performed electronically, a description of the electronic notarization system used; and
(9) the fee, if any, charged by the electronic notary.
(B) An electronic notary public may not record a Social Security number in the electronic journal.
(C) An electronic notary public may not allow the electronic journal to be used by any other notary public and may not surrender the electronic journal to an employer upon termination of employment.
(D) Any party to the notarized transaction or party with a legitimate interest in the transaction may inspect or request a copy of an entry or entries in the electronic notary public's electronic journal, provided that:
(1) the party specifies the month, year, type of record, and name of the principal for the electronic notarial act, in a signed physical or electronic request;
(2) the electronic notary public does not surrender possession or control of the electronic journal;
(3) the party is shown or given a copy of only the entry or entries specified; and
(4) a separate new entry is made in the electronic journal, explaining the circumstances of the request and noting any related act of copy certification by the electronic notary public.
(E) An electronic notary public may charge a reasonable fee to recover any cost of providing a copy of an entry in the electronic journal of notarial acts. An electronic notary who has a reasonable and explainable belief that a person requesting information from the electronic notary's electronic journal has a criminal or other inappropriate purpose may deny access to any entry or entries.
(F) All electronic notarial records required by statute or regulation may be examined and copied without restriction by a law enforcement officer in the course of an official investigation, subpoenaed by court order, or surrendered at the direction of the Secretary of State.
(G) The Secretary of State will establish commercially reasonable standards for preservation of electronic journals in the event of a resignation, revocation, or expiration of an electronic notary commission, or upon the death of the electronic notary. The provisions of this subsection do not apply to a former electronic notary whose commission has expired if within three months the electronic notary commission is renewed.
Section 26-2-410. (A) An electronic notary public shall keep his electronic journal, public key certificate, and electronic seal secure. The electronic notary public may not allow another person to use his electronic journal, public key certificate, or electronic seal.
(B) An electronic notary public shall attach his public key certificate and electronic seal to the electronic notarial certificate of an electronic record in a manner that renders any subsequent change or modification to the electronic record to be evident.
(C) An electronic notary public shall immediately notify the appropriate law enforcement agency and the Secretary of State of the theft or vandalism of the electronic notary public's electronic journal, public key certificate, or electronic seal. An electronic notary public shall immediately notify the Secretary of State of the loss or use by another person of the electronic notary public's electronic journal, public key certificate, or electronic seal.
(D) Upon resignation, revocation, or expiration of an electronic notary commission or death of the electronic notary, the electronic notary or his personal representative shall erase, delete, or destroy the coding, disk, certificate, card software, file or program that enables electronic affixation of the electronic notary's official electronic signature. The provisions of this subsection do not apply to a former electronic notary who renews his commission within three months of the expiration of his previous commission.
Section 26-2-420. (A) An electronic notarization system shall comply with this chapter and any regulations promulgated by the Secretary of State pursuant to Section 26-2-500.
(B) An electronic notarization system shall require access to the system by a password or other secure means of authentication.
(C) An electronic notarization system shall enable an electronic notary public to affix the electronic notary public's electronic signature in a manner that attributes such signature to the electronic notary public.
(D) An electronic notarization system shall render every electronic notarial act tamper evident.
(E) Except as provided in subsection (F), when the commission of a notary public who is registered to notarize electronically expires or is resigned or revoked, or when such electronic notary dies or is adjudicated as incompetent, the electronic notary public or his personal representative or guardian shall, within three months, dispose of all or any part of an electronic notarization system that had been in the electronic notary's sole control for which the exclusive purpose was to perform electronic notarial acts.
(F) A former electronic notary public whose previous commission expired need not comply with subsection (E) if this individual, within three months after commission expiration, is recommissioned as a notary public and reregistered to perform electronic notarial acts.
Section 26-2-430. (A) Any person or entity wishing to provide an electronic notarization system to electronic notaries public in this State must complete and submit a registration form to the Secretary of State for review.
(B) An electronic notarization system shall comply with all regulations promulgated by the Secretary of State.
(C) An electronic notary solution provider must be registered with the Secretary of State pursuant to this chapter before making available to South Carolina electronic notaries public any updates or subsequent versions of the provider's electronic notarization system.
Section 26-2-440. (A) An electronic notary public shall take reasonable steps to ensure that any registered device used to create the electronic notary public's electronic signature is current and has not been revoked or terminated by its issuing or registering authority.
(B) If the registration of the device used to create electronic signatures either expires or is changed during the electronic notary public's term of office, then the notary public shall cease performing electronic notarizations until:
(1) a new device is duly issued or registered to the electronic notary public; and
(2) an electronically signed notice is sent to the Secretary of State that includes the starting and expiration dates of any new registration term and any other new information at variance with information in the most recently executed electronic registration form.
Section 26-2-450. (A) The liability, sanctions, and remedies for the improper performance of electronic notarial acts, or for providing false or misleading information in registering to perform electronic notarial acts, by an electronic notary public are the same as provided by law for the improper performance of non-electronic notarial acts.
(B)(1) The Secretary of State may terminate an electronic notary public's registration for one or more of the following reasons:
(a) submission of an electronic registration form containing a material misstatement or omission of fact;
(b) failure to maintain the capability to perform electronic notarial acts; or
(c) official misconduct by the electronic notary public.
(2) Before terminating an electronic notary public's registration, the Secretary of State will inform the electronic notary public of the basis for the termination, and the termination will take place on a particular date unless a proper appeal is filed with the Administrative Law Court before that date.
(3) Neither resignation nor expiration of a notary commission or of an electronic notary public registration precludes or terminates an investigation by the Secretary of State into an electronic notary public's conduct. The investigation may be pursued to a conclusion, when it must be made a matter of public record whether the finding would have been grounds for termination of the electronic notary public's commission or registration.
Section 26-2-460. (A) It is unlawful for a person to knowingly:
(1) act as or otherwise impersonate an electronic notary public, if that person is not an electronic notary public;
(2) obtain, conceal, damage, or destroy the coding, disk, certificate, card, token, program, software, or hardware that is intended exclusively to enable an electronic notary public to produce a registered electronic signature, electronic seal, or single element combining the required features of an electronic signature and electronic seal; or
(3) solicit, coerce, or in any way influence an electronic notary public to commit official misconduct.
(B) A person who violates the provisions of subsection (A) is guilty of a misdemeanor and, upon conviction, must be fined not more than five thousand dollars, imprisoned for not more than one year, or both.
(C) The sanctions of this chapter do not preclude other sanctions and remedies provided by law.
Section 26-2-470. The provisions contained in Chapter 1 of this title, with regard to notarial certificates, are applicable for the purposes of this chapter.
Section 26-2-480. Electronic evidence of the authenticity of the official electronic signature and electronic seal of an electronic notary public of this State, if required, must be attached to, or logically associated with, a notarized electronic document transmitted to another state or nation and must be in the form of an electronic certificate of authority signed by the Secretary of State in conformance with any current and pertinent international treaties, agreements, and conventions subscribed to by the government of the United States.
Section 26-2-490. (A) An electronic certificate of authority evidencing the authenticity of the official electronic signature and electronic seal of an electronic notary public of this State shall substantially contain the following words:
'Certificate of Authority for an Electronic Notarial Act
I, ______________ (name, title, jurisdiction of commissioning official) certify that ________________ (name of electronic notary), the person named as an electronic notary public in the attached or associated document, was indeed registered as an electronic notary public for the State of South Carolina and authorized to act as such at the time of the document's electronic notarization.
To verify this Certificate of Authority for an Electronic Notarial Act, I have included herewith my electronic signature this _________ day of ___________, 20__.
[Electronic signature (and electronic seal) of the commissioning official]'.
(B) The Secretary of State may charge ten dollars for issuing an electronic certificate of authority.
Section 26-2-500. The Secretary of State is authorized to promulgate and enforce any regulations and create and enforce any policies and procedures necessary for the administration of this chapter, including rules to facilitate remote online notarizations."
SECTION 3. Nothing in this act contravenes South Carolina law that requires a licensed South Carolina attorney to supervise a closing.
SECTION 4. This act does not apply to wills and trusts in South Carolina.
SECTION 5. This act takes effect upon approval by the Governor. Remote online notary public applications and electronic online notary public applications will not be accepted for processing until the administrative rules are in effect and vendors of technology are approved by the Secretary of State. /
Renumber sections to conform.
Amend title to conform.
Senator TALLEY explained the committee amendment.
Senator TALLEY proposed the following amendment (486R003.KMM.SFT), which was adopted:
Amend the bill, as and if amended, page 8, by striking line 20 and inserting:
/ (c) identity proofing; or
(3) oath or affirmation of a credible witness who personally knows the individual if the electronic notary public has personal knowledge of the credible witness or has reasonably verified the identity of the credible witness under item (2). /
Amend the bill further, as and if amended, page 8, line 32, by inserting:
/ (F) A credible witness under subsection (B) may be a remotely located individual if the credible witness, principal, and electronic notary public communicate by means of communication technology.
(G) An electronic notary public's verification of an individual's identity under Section 26-4-100(B) constitutes satisfactory evidence of the identity of the individual and satisfies any requirement of law of this State that the notary verify the identity of the individual.
(H) For the purposes of this chapter:
(1) any requirement that an instrument be signed in the presence of two subscribing witnesses may be satisfied by witnesses being present and electronically signing by means of communication technology, as defined in Section 26-4-20(2); and
(2) the act of witnessing an electronic signature is satisfied if a witness is present either in the physical presence of the principal or present through audio-visual communication technology at the time the principal affixes his electronic signature and sees and hears the principal make a statement acknowledging that the principal has signed the electronic record. /
Amend the bill further, as and if amended, page 9, by striking line 25 and inserting:
/ online notary public's employer may charge a fee of not more than twenty-five dollars for performance /
Renumber sections to conform.
Amend title to conform.
Senator TALLEY explained the amendment.
The question being the second reading of the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 44; Nays 0
AYES
Alexander Allen Bennett
Campbell Campsen Cash
Climer Corbin Cromer
Davis Fanning Gambrell
Goldfinch Gregory Grooms
Harpootlian Hembree Hutto
Jackson Johnson Kimpson
Leatherman Malloy Martin
Massey Matthews, John Matthews, Margie
McElveen Nicholson Peeler
Rankin Reese Rice
Sabb Scott Senn
Setzler Shealy Sheheen
Talley Turner Verdin
Williams Young
Total--44
NAYS
Total--0
There being no further amendments, the Bill, as amended, was read the second time, passed and ordered to a third reading.
CARRIED OVER
S. 498 (Word version) -- Senators Shealy and Climer: A BILL TO AMEND ARTICLE 9, CHAPTER 11, TITLE 63 OF THE 1976 CODE, RELATING TO THE SOUTH CAROLINA CHILDREN'S TRUST FUND, BY ADDING SECTION 63-11-970, TO PROVIDE THAT THE CHILDREN'S TRUST FUND SHALL HAVE ACCESS AT ANY AND ALL REASONABLE TIMES TO ALL ELECTRONIC INFORMATION SYSTEMS, RECORDS, REPORTS, AND MATERIALS MAINTAINED BY THE DEPARTMENT OF SOCIAL SERVICES IN CERTAIN CIRCUMSTANCES; AND TO AMEND SECTION 63-7-1990(B), RELATING TO CONFIDENTIALITY AND THE RELEASE OF RECORDS AND INFORMATION, TO PROVIDE THAT THE DEPARTMENT OF SOCIAL SERVICES IS AUTHORIZED TO GRANT ACCESS TO THE RECORDS OF INDICATED CASES TO THE CHILDREN'S TRUST FUND OF SOUTH CAROLINA.
On motion of Senator WILLIAMS, the Bill was carried over.
CARRIED OVER
S. 651 (Word version) -- Judiciary Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE SOUTH CAROLINA HUMAN AFFAIRS COMMISSION, RELATING TO HEARING PROCEDURES (REVIEW AND ENFORCEMENT), DESIGNATED AS REGULATION DOCUMENT NUMBER 4830, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
The Senate proceeded to the consideration of the Resolution.
Senator SHEALY explained the Resolution.
On motion of Senator SHEALY, the Resolution was carried over.
CARRIED OVER
S. 652 (Word version) -- Judiciary Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE SOUTH CAROLINA HUMAN AFFAIRS COMMISSION, RELATING TO NOTICES TO BE POSTED, DESIGNATED AS REGULATION DOCUMENT NUMBER 4828, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
The Senate proceeded to the consideration of the Resolution.
Senator SHEALY explained the Resolution.
On motion of Senator SHEALY, the Resolution was carried over.
CARRIED OVER
H. 3180 (Word version) -- Reps. G.M. Smith, Erickson, Yow, Huggins, R. Williams and Jefferson: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 21 TO CHAPTER 1, TITLE 25 SO AS TO ENACT THE "SOUTH CAROLINA SERVICEMEMBERS CIVIL RELIEF ACT"; TO DEFINE THE ACT'S RELEVANT TERMS; TO ENUMERATE CERTAIN RIGHTS, BENEFITS, AND OBLIGATIONS OF SERVICEMEMBERS AND THEIR DEPENDENTS; TO AUTHORIZE THE ATTORNEY GENERAL TO BRING A CIVIL ACTION FOR INTENTIONAL VIOLATIONS OF THE ACT; TO ESTABLISH REMEDIES AND PENALTIES; AND TO REQUIRE THE ADJUTANT GENERAL TO POST CERTAIN INFORMATION REGARDING THE ACT ON THE SOUTH CAROLINA NATIONAL GUARD WEBSITE.
The Senate proceeded to the consideration of the Bill.
The Committee on Family and Veterans' Services proposed the following amendment (3180R001.KMM.KS), which was adopted:
Amend the bill, as and if amended, page 4, by striking line 17 and inserting:
/ Section 25-1-4070. (A) A servicemember, the dependent of a servicemember, or the South Carolina Attorney General /
Renumber sections to conform.
Amend title to conform.
Senator McELVEEN explained the committee amendment.
On motion of Senator MASSEY, the Bill was carried over.
OBJECTION
H. 3420 (Word version) -- Reps. Bernstein, Finlay, Thayer, West, Clemmons and Simmons: A BILL TO AMEND SECTION 16-17-500, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE "YOUTH ACCESS TO TOBACCO PREVENTION ACT OF 2006", SO AS TO PROHIBIT MINORS FROM ENTERING RETAIL ESTABLISHMENTS THAT PRIMARILY SELL TOBACCO PRODUCTS, ALTERNATIVE NICOTINE PRODUCTS, OR BOTH; AND TO AMEND SECTION 16-17-501, RELATING IN PART TO THE DEFINITION OF "ALTERNATIVE NICOTINE PRODUCT", SO AS TO CHANGE THE DEFINITION.
Senator SHEALY objects to the consideration of the Bill.
CARRIED OVER
H. 3438 (Word version) -- Reps. Pitts, McCravy, B. Cox, Huggins, Cobb-Hunter, Hixon, W. Cox, Taylor, Davis, Caskey and Mace: A BILL TO AMEND SECTION 25-11-10, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DIVISION OF VETERANS AFFAIRS, SO AS TO ESTABLISH THE DIVISION WITHIN THE EXECUTIVE BRANCH OF GOVERNMENT, TO PROVIDE THAT THE DIRECTOR MUST BE APPOINTED BY THE GOVERNOR AND CONFIRMED BY THE GENERAL ASSEMBLY, AND TO ENUMERATE THE DIVISION'S POWERS AND DUTIES; TO AMEND SECTION 25-11-20, RELATING TO THE DIRECTOR OF THE DIVISION OF VETERANS AFFAIRS, SO AS TO ENUMERATE SPECIFIC DUTIES; AND TO AMEND SECTION 25-11-40, RELATING TO THE APPOINTMENT, REMOVAL, TRAINING, AND ACCREDITATION OF COUNTY VETERANS AFFAIRS OFFICERS, SO AS TO REVISE THE DEFINITION OF "VETERAN" FOR PURPOSES OF APPOINTING COUNTY VETERANS AFFAIRS OFFICERS, TO ELIMINATE THE AUTHORITY TO APPOINT NONVETERANS TO SERVE AS COUNTY VETERANS AFFAIRS OFFICERS, TO PROVIDE AN EXCEPTION FOR PERSONS CURRENTLY SERVING AS COUNTY VETERANS AFFAIRS OFFICERS, AND TO REMOVE LOCAL NONCONFORMING PROVISIONS.
On motion of Senator CORBIN, the Bill was carried over.
POINT OF ORDER
S. 203 (Word version) -- Senator Young: A BILL TO AMEND CHAPTER 17, TITLE 59 OF THE 1976 CODE, RELATING TO SCHOOL DISTRICTS, BY ADDING SECTION 59-17-45, TO PROVIDE CRITERIA FOR SCHOOL DISTRICT CONSOLIDATION, AND TO PROVIDE FOR AN EXCEPTION.
Point of Order
Senator MARTIN raised a Point of Order under Rule 39 that the Bill had not been on the desks of the members at least one day prior to second reading.
The PRESIDENT sustained the Point of Order.
POINT OF ORDER
S. 283 (Word version) -- Senator Talley: A BILL TO AMEND TITLE 59 OF THE 1976 CODE, RELATING TO EDUCATION, BY ADDING CHAPTER 157, TO ENACT THE "STATE INSTITUTION OF HIGHER EDUCATION ENTERPRISE ACT," TO ALLOW THE BOARD OF TRUSTEES OF AN INSTITUTION OF HIGHER EDUCATION TO ESTABLISH BY RESOLUTION AN ENTERPRISE DIVISION AS PART OF THE COLLEGE OR UNIVERSITY, TO PROVIDE THAT CERTAIN ASSETS, PROGRAMS, AND OPERATIONS OF THE COLLEGE OR UNIVERSITY MAY BE TRANSFERRED TO THE ENTERPRISE DIVISION, TO PROVIDE THAT THE ENTERPRISE DIVISION IS EXEMPT FROM VARIOUS STATE LAWS GOVERNING PROCUREMENT, HUMAN RESOURCES, PERSONNEL, AND THE DISPOSITION OF REAL AND PERSONAL PROPERTY, WITH SOME SUCH EXEMPTIONS APPLYING AUTOMATICALLY AND OTHERS REQUIRING ADDITIONAL ACTIONS BY THE BOARD OF TRUSTEES, TO PROVIDE THAT BONDS, NOTES, OR OTHER EVIDENCE OF INDEBTEDNESS MAY BE ISSUED FOR THE ENTERPRISE DIVISION, AND TO PROVIDE AUDIT AND REPORTING REQUIREMENTS; AND TO AMEND SECTION 11-35-710, RELATING TO EXEMPTIONS FROM THE SOUTH CAROLINA CONSOLIDATED PROCUREMENT CODE, TO PROVIDE THAT THE STATE FISCAL ACCOUNTABILITY AUTHORITY MAY EXEMPT AN ENTERPRISE DIVISION, IF A DIVISION IS ESTABLISHED PURSUANT TO CHAPTER 157, TITLE 59 AND THE BOARD OF TRUSTEES HAS ADOPTED A PROCUREMENT POLICY FOR THE DIVISION THAT WAS APPROVED BY THE STATE FISCAL ACCOUNTABILITY AUTHORITY.
Point of Order
Senator MARTIN raised a Point of Order under Rule 39 that the Bill had not been on the desks of the members at least one day prior to second reading.
The PRESIDENT sustained the Point of Order.
POINT OF ORDER
S. 659 (Word version) -- Labor, Commerce and Industry Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE DEPARTMENT OF LABOR, LICENSING AND REGULATION - AUCTIONEERS' COMMISSION, RELATING TO AUCTIONEERS' COMMISSION (REPEAL SPECIFIC REGULATIONS), DESIGNATED AS REGULATION DOCUMENT NUMBER 4846, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
Point of Order
Senator MARTIN raised a Point of Order under Rule 39 that the Resolution had not been on the desks of the members at least one day prior to second reading.
The PRESIDENT sustained the Point of Order.
OBJECTION
H. 3576 (Word version) -- Reps. White, Cobb-Hunter, Garvin, Rose, Loftis, Gilliard, Moore, Clemmons and Jefferson: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 59-150-365 SO AS TO ESTABLISH THE SOUTH CAROLINA WORKFORCE INDUSTRY NEEDS SCHOLARSHIP (SC WINS), TO PROVIDE THAT CERTAIN STUDENTS ATTENDING A TWO-YEAR TECHNICAL COLLEGE ARE ELIGIBLE FOR THE SCHOLARSHIP, AND TO PROVIDE ELIGIBILITY REQUIREMENTS.
Senator MASSEY objects to the consideration of the Bill.
RATIFICATION OF ACTS
Pursuant to an invitation the Honorable Speaker and House of Representatives appeared in the Senate Chamber on March 19, 2019, at 3:00 P.M. and the following Acts and Joint Resolutions were ratified:
(R6, S. 75 (Word version)) -- Senator Cromer: AN ACT TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 9 TO CHAPTER 13, TITLE 38 SO AS TO REQUIRE AN INSURER OR AN INSURANCE GROUP TO SUBMIT A CORPORATE GOVERNANCE ANNUAL DISCLOSURE AND ESTABLISH CERTAIN REQUIREMENTS FOR THE DISCLOSURE, TO DEFINE NECESSARY TERMS, TO AUTHORIZE THE DIRECTOR OF THE DEPARTMENT OF INSURANCE TO PROMULGATE REGULATIONS RELATED TO THE DISCLOSURE, TO PROVIDE CERTAIN CONFIDENTIALITY REQUIREMENTS FOR INFORMATION SUBMITTED TO THE DIRECTOR AND TO PROHIBIT THE DIRECTOR OR A PERSON WHO RECEIVES INFORMATION RELATED TO THE ANNUAL DISCLOSURE FROM TESTIFYING IN A PRIVATE CIVIL ACTION CONCERNING THE CONFIDENTIAL INFORMATION, TO AUTHORIZE THE DIRECTOR TO RETAIN THIRD-PARTY CONSULTANTS AND PRESCRIBE CERTAIN RULES FOR THE CONSULTANTS, TO PROVIDE A PENALTY FOR AN INSURER WHO FAILS TO FILE THE CORPORATE GOVERNANCE ANNUAL DISCLOSURE, AND TO SET AN EFFECTIVE DATE; BY ADDING SECTION 38-21-295 SO AS TO AUTHORIZE THE DIRECTOR TO ACT AS THE GROUP-WIDE SUPERVISOR FOR AN INTERNATIONALLY ACTIVE INSURANCE GROUP UNDER CERTAIN CIRCUMSTANCES, TO ESTABLISH A PROCEDURE FOR THE DIRECTOR TO DETERMINE WHETHER HE MAY ACT AS THE GROUP-WIDE SUPERVISOR OR ACKNOWLEDGE ANOTHER REGULATORY OFFICIAL TO ACT AS THE GROUP-WIDE SUPERVISOR, TO AUTHORIZE THE DIRECTOR TO ENGAGE IN CERTAIN ACTIVITIES AS GROUP-WIDE SUPERVISOR, AND TO AUTHORIZE THE DIRECTOR TO PROMULGATE REGULATIONS; AND TO AMEND SECTION 38-21-10 SO AS TO DEFINE THE TERMS "DIRECTOR", "GROUP-WIDE SUPERVISOR", AND "INTERNATIONALLY ACTIVE INSURANCE GROUP".
L:\COUNCIL\ACTS\75CZ19.DOCX
(R7, S. 80 (Word version)) -- Senator Sheheen: A JOINT RESOLUTION TO AMEND SECTIONS 1 AND 3 OF ACT 289 OF 2018, RELATING TO THE SOUTH CAROLINA AMERICAN REVOLUTION SESTERCENTENNIAL COMMISSION, SO AS TO PROVIDE THE OBSERVANCE MUST INCLUDE THE ROLE OF PERSONS OF AFRICAN-AMERICAN DESCENT IN THE AMERICAN REVOLUTION AND TO MAKE SIMILAR CHANGES TO THE MEMBERSHIP OF THE COMMISSION, RESPECTIVELY.
L:\COUNCIL\ACTS\80AHB19.DOCX
(R8, S. 326 (Word version)) -- Senators Massey, Setzler, Malloy, Turner, Alexander and Young: A JOINT RESOLUTION TO DIRECT THE STATE LAW ENFORCEMENT DIVISION TO DISTRIBUTE TWO HUNDRED FIFTY THOUSAND DOLLARS TO THE SOUTH CAROLINA STATE FIREFIGHTERS ASSOCIATION TO PROVIDE FOR POST TRAUMATIC STRESS DISORDER INSURANCE AND PROGRAMS.
L:\COUNCIL\ACTS\326SA19.DOCX
(R9, S. 327 (Word version)) -- Senator Shealy: AN ACT TO AMEND SECTION 1-25-60, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE STATE INTERAGENCY PLANNING AND EVALUATION ADVISORY COMMITTEE, SO AS TO REDESIGNATE THE NAME OF THE SENATE GENERAL COMMITTEE AS THE FAMILY AND VETERANS SERVICES' COMMITTEE.
L:\COUNCIL\ACTS\327SD19.DOCX
(R10, S. 358 (Word version)) -- Senator Cromer: AN ACT TO AMEND SECTION 38-31-30, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE APPLICATION OF THE SOUTH CAROLINA PROPERTY AND CASUALTY INSURANCE GUARANTY ASSOCIATION, SO AS TO APPLY THE PROVISIONS OF CHAPTER 31, TITLE 38 TO A CLAIM OR LOSS COVERED BY SELF-INSURANCE THAT OCCURRED PRIOR TO THE ACQUISITION OF A BLOCK OF BUSINESS BY A LICENSED INSURER; AND TO AMEND SECTION 42-5-20, RELATING TO INSURANCE REQUIREMENTS FOR WORKERS' COMPENSATION, SO AS TO PROHIBIT A SELF-INSURER FROM PARTICIPATING IN OR OBTAINING BENEFITS FROM THE SOUTH CAROLINA PROPERTY AND CASUALTY INSURANCE GUARANTY ASSOCIATION AND TO REQUIRE THE SOUTH CAROLINA WORKERS' COMPENSATION COMMISSION TO SECURE AN ACTUARIAL OPINION BEFORE APPROVING THE TRANSFER OF A SELF-INSURER TO A LICENSED INSURER.
L:\COUNCIL\ACTS\358CZ19.DOCX
L:\COUNCIL\ACTS\360CZ19.DOCX
(R12, S. 428 (Word version)) -- Senators Gambrell and Cash: AN ACT TO AMEND SECTION 7-7-80, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN ANDERSON COUNTY, SO AS TO DELETE THE GROVE SCHOOL AND ANDERSON 5/A PRECINCTS AND ADD THE SOUTH FANT PRECINCT, AND TO REDESIGNATE THE MAP NUMBER ON WHICH THE NAMES OF THESE PRECINCTS MAY BE FOUND AND MAINTAINED BY THE REVENUE AND FISCAL AFFAIRS OFFICE.
L:\COUNCIL\ACTS\428ZW19.DOCX
(R13, S. 441 (Word version)) -- Senator Nicholson: AN ACT TO AMEND SECTION 7-7-290, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN GREENWOOD COUNTY, SO AS TO REDESIGNATE THE MAP NUMBER ON WHICH THE NAMES OF THESE PRECINCTS MAY BE FOUND AND MAINTAINED BY THE REVENUE AND FISCAL AFFAIRS OFFICE.
L:\COUNCIL\ACTS\441ZW19.DOCX
(R14, S. 482 (Word version)) -- Senators Campbell and Bennett: AN ACT TO AMEND SECTION 7-7-230, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN DORCHESTER COUNTY, SO AS TO REDESIGNATE THE MAP NUMBER ON WHICH THE NAMES OF THESE PRECINCTS MAY BE FOUND AND MAINTAINED BY THE REVENUE AND FISCAL AFFAIRS OFFICE.
L:\COUNCIL\ACTS\482ZW19.DOCX
(R15, S. 504 (Word version)) -- Senators Hutto and M.B. Matthews: AN ACT TO AMEND ACT 372 OF 2008, RELATING TO THE ALLENDALE COUNTY AERONAUTICS AND DEVELOPMENT COMMISSION, SO AS TO ABOLISH THE EXISTING NINE-MEMBER COMMISSION, TO TERMINATE THE TERMS OF ITS MEMBERS, TO RECONSTITUTE THE COMMISSION AS THE ALLENDALE COUNTY AERONAUTICS COMMISSION, AND TO REVISE THE COMPOSITION OF THE COMMISSION'S MEMBERSHIP.
L:\COUNCIL\ACTS\504ZW19.DOCX
(R16, H. 3127 (Word version)) -- Reps. Dillard, Henderson-Myers, Clyburn, Weeks, Robinson and Gilliard: A JOINT RESOLUTION TO ESTABLISH THE MOLD ABATEMENT AND REMEDIATION STUDY COMMITTEE TO STUDY THE IMPACT OF MOLD IN PUBLIC AREAS AND TO ASCERTAIN THE BEST METHOD OF ABATEMENT FOR MOLD IN PUBLIC AREAS; TO PROVIDE FOR THE MEMBERSHIP OF THE STUDY COMMITTEE, TO ESTABLISH CERTAIN GOALS FOR THE STUDY COMMITTEE, TO REQUIRE THE STUDY COMMITTEE TO PREPARE A REPORT FOR THE GENERAL ASSEMBLY, AND TO DISSOLVE THE STUDY COMMITTEE.
L:\COUNCIL\ACTS\3127CZ19.DOCX
(R17, H. 3639 (Word version)) -- Reps. Taylor, Allison, Felder and Huggins: AN ACT TO AMEND SECTION 59-112-50, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO MILITARY PERSONNEL AND THEIR DEPENDENTS WHO ARE ENTITLED TO PAY IN-STATE TUITION AND FEES WITHOUT REGARD TO THE LENGTH OF TIME THEY HAVE RESIDED IN THIS STATE, SO AS TO EXPAND THE CATEGORIES OF INDIVIDUALS COVERED BY THESE PROVISIONS TO CONFORM WITH CERTAIN CHANGES IN FEDERAL LAW.
L:\COUNCIL\ACTS\3639WAB19.DOCX
(R18, H. 3697 (Word version)) -- Reps. Taylor, Allison, Gilliard, Simmons, Bales, Moore and Govan: A JOINT RESOLUTION TO PROVIDE THAT NOTWITHSTANDING THE PROVISIONS OF REGULATION 62-6-(D), SOUTH CAROLINA CODE OF REGULATIONS, RELATING TO THE REQUIREMENT THAT AT LEAST TWENTY-FIVE PERCENT OF CURRICULUM REQUIREMENTS FOR CERTAIN ACADEMIC PROGRAMS MUST BE EARNED THROUGH INSTRUCTION BY THE INSTITUTION AWARDING THE DEGREE, THE COMMISSION ON HIGHER EDUCATION MAY GRANT ALTERNATE PROGRAM COMPLETION OPTIONS TO STUDENTS IMPACTED BY THE CLOSURE OF SIX EDUCATION CORPORATION OF AMERICA, INC., HIGHER EDUCATION PROVIDERS IN SOUTH CAROLINA IN 2018.
L:\COUNCIL\ACTS\3697WAB19.DOCX
(R19, H. 3798 (Word version)) -- Reps. Clary, Hiott, Collins and W. Cox: AN ACT TO AMEND SECTION 7-7-450, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN PICKENS COUNTY, SO AS TO REDESIGNATE THE MAP NUMBER ON WHICH THE NAMES OF THESE PRECINCTS MAY BE FOUND AND MAINTAINED BY THE REVENUE AND FISCAL AFFAIRS OFFICE.
L:\COUNCIL\ACTS\3798ZW19.DOCX
(R20, H. 3849 (Word version)) -- Reps. G.M. Smith and Toole: A JOINT RESOLUTION TO PROVIDE A GRACE PERIOD ON THE ENFORCEMENT OF SECTION 12-21-735 OF THE 1976 CODE, RELATING TO THE STAMP TAX ON CIGARETTES, AGAINST UNSTAMPED PACKAGES OF CIGARETTES FOR WHICH APPLICABLE TAXES HAVE BEEN PAID.
L:\COUNCIL\ACTS\3849DG19.DOCX
(R21, H. 3987 (Word version)) -- Reps. Gagnon and West: AN ACT TO AMEND SECTION 7-7-30, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN ABBEVILLE COUNTY, SO AS TO REDESIGNATE THE MAP NUMBER ON WHICH THE NAMES OF THESE PRECINCTS MAY BE FOUND AND MAINTAINED BY THE REVENUE AND FISCAL AFFAIRS OFFICE.
L:\COUNCIL\ACTS\3987ZW19.DOCX
THE CALL OF THE UNCONTESTED CALENDAR HAVING BEEN COMPLETED, THE SENATE PROCEEDED TO THE MOTION PERIOD.
At 3:03 P.M., on motion of Senator MASSEY, the Senate agreed to dispense with the balance of the Motion Period.
| 2019-06-18T07:27:38 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4514632821083069, "perplexity": 11870.48031406407}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-26/segments/1560627998690.87/warc/CC-MAIN-20190618063322-20190618085322-00160.warc.gz"}
|
https://www.zbmath.org/authors/?q=ai%3Aljung.lennart
|
# zbMATH — the first resource for mathematics
## Ljung, Lennart
Compute Distance To:
Author ID: ljung.lennart Published as: L’jung, L.; Ljung, L.; Ljung, Lennart Homepage: http://users.isy.liu.se/en/rt/ljung/ External Links: MGP · Wikidata · ORCID · ResearchGate · dblp · GND
Documents Indexed: 182 Publications since 1972, including 4 Books
all top 5
#### Co-Authors
42 single-authored 15 Kailath, Thomas 11 Chen, Tianshi 9 Ohlsson, Henrik 8 Söderström, Torsten 7 Gustavsson, Ivar 7 Hjalmarsson, Håkan 7 Morf, Martin 6 Forssell, Urban 6 Guo, Lei 5 Glad, Torkel 5 Pillonetto, Gianluigi 5 Schön, Thomas B. 5 Zhang, Qinghua 4 Levy, Bernard C. 4 McKelvey, Tomas 4 Sjöberg, Jonas 4 Wahlberg, Bo 4 Wills, Adrian G. 4 Yuan, Zhendong 3 Akçay, Hüseyin 3 Chiuso, Alessandro 3 Friedlander, Benjamin 3 Gillberg, Jonas 3 Priouret, Pierre 3 Tjärnström, Fredrik 2 Benveniste, Albert 2 Boyd, Stephen Poythress 2 Caines, Peter Edwin 2 Carli, Francesca Paolo 2 Casti, John L. 2 De Nicolao, Giuseppe 2 Delyon, Bernard 2 Enqvist, Martin 2 Gerdin, Markus 2 Glover, Keith J. 2 Gunnarsson, Svante 2 Gustafsson, Fredrik 2 Hu, Xiaoli 2 Juditsky, Anatoli B. 2 Lind, Ingela 2 Ljung, Stefan 2 Mu, Biqiang 2 Nazin, Alexander V. 2 Reinelt, Wolfgang 2 Rissanen, Jorma J. 2 Roll, Jacob 2 van Overbeek, A. J. M. 2 Verhaegen, Michel 2 Wang, Ke 2 Xie, Liangliang 1 Abrahamsson, Thomas 1 Ahlén, Anders 1 Andersen, Martin S. 1 Anderson, Peter D. 1 Aravkin, Aleksandr Y. 1 Ardeshiri, Tohid 1 Åström, Karl Johan 1 Bauer, Dietmar 1 Bemporad, Alberto 1 Bernhardsson, Bo M. 1 Björklund, Svante 1 Borisson, U. 1 Burke, James V. 1 Dinuzzo, Francesco 1 Fnaiech, Farhat 1 Forsman, Klas 1 Garnier, Hugues 1 Garulli, Andrea 1 Gevers, Michel R. 1 Glad, S. Torkel 1 Glorennec, Pierre-Yves 1 Gonçalves, Jorge M. 1 Hagenblad, Anna 1 Helmersson, Anders 1 Janot, Alexandre 1 Lin, Weilu 1 Lindahl, Sture 1 Lindskog, Peter 1 Lozano, Aurélie C. 1 Lyzell, Christian 1 Millner, Mille 1 Ninness, Brett M. 1 Pakazad, Sina Khoshfetrat 1 Pan, Wei 1 Pascu, Valentin 1 Pflug, Georg Ch. 1 Pintelon, Rik 1 Poznyak, Aleksandr Semënovich 1 Qin, S. Joe 1 Sastry, S. Shankar 1 Skeppstedt, Anders 1 Solbrand, Göte 1 Stan, Guy-Bart 1 Trulsson, Eva 1 Van den Hof, Paul M. J. 1 Verdult, Vincent 1 Vicino, Antonio 1 Walk, Harro 1 Wang, Guanjun 1 Wang, Jiandong ...and 3 more Co-Authors
all top 5
#### Serials
57 Automatica 32 IEEE Transactions on Automatic Control 12 International Journal of Control 5 International Journal of Adaptive Control and Signal Processing 5 European Journal of Control 3 IEEE Transactions on Information Theory 3 IEEE Transactions on Signal Processing 2 Systems & Control Letters 2 Automation and Remote Control 2 Prentice Hall Information and System Sciences Series 1 Advances in Applied Probability 1 Journal of the Franklin Institute 1 Stochastics 1 The Annals of Statistics 1 BIT 1 Journal of Econometrics 1 IMA Journal of Mathematical Control and Information 1 Signal Processing 1 Annales des Télécommunications 1 IEEE Transactions on Acoustics, Speech, and Signal Processing 1 IEEE Transactions on Systems, Man, and Cybernetics 1 Linear Algebra and its Applications 1 SIAM Journal on Applied Mathematics 1 International Journal of Robust and Nonlinear Control 1 Journal of Computer and Systems Sciences International 1 Mathematical Modelling of Systems 1 Modeling, Identification and Control 1 SIAM Journal on Control 1 DMV Seminar 1 IEEE Transactions on Control of Network Systems
all top 5
#### Fields
170 Systems theory; control (93-XX) 42 Statistics (62-XX) 14 Probability theory and stochastic processes (60-XX) 12 Numerical analysis (65-XX) 8 Operations research, mathematical programming (90-XX) 7 Computer science (68-XX) 5 Information and communication theory, circuits (94-XX) 3 Linear and multilinear algebra; matrix theory (15-XX) 3 Mechanics of particles and systems (70-XX) 3 Biology and other natural sciences (92-XX) 2 Integral equations (45-XX) 2 Calculus of variations and optimal control; optimization (49-XX) 2 Mechanics of deformable solids (74-XX) 1 General and overarching topics; collections (00-XX) 1 Field theory and polynomials (12-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Approximations and expansions (41-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Operator theory (47-XX)
#### Citations contained in zbMATH
157 Publications have been cited 4,139 times in 2,759 Documents Cited by Year
System identification: theory for the user. Zbl 0615.93004
Ljung, Lennart
1987
Comments on model validation as set membership identification. Zbl 0949.93509
Ljung, Lennart
1999
Theory and practice of recursive identification. Zbl 0548.93075
Ljung, Lennart; Söderström, Torsten
1983
Analysis of recursive stochastic algorithms. Zbl 0362.93031
Ljung, Lennart
1977
Nonlinear black-box modeling in system identification: A unified overview. Zbl 0846.93018
Sjöberg, Jonas; Zhang, Qinghua; Ljung, Lennart; Benveniste, Albert; Delyon, Bernard; Glorennec, Pierre-Yves; Hjalmarsson, Håkan; Juditsky, Anatoli
1995
Theory and applications of selftuning regulators. Zbl 0374.93024
Aström, K. J.; Borisson, U.; Ljung, L.; Wittenmark, B.
1977
On global identifiability for arbitrary model parametrizations. Zbl 0795.93026
1994
Asymptotic behavior of the extended Kalman filter as a parameter estimator for linear systems. Zbl 0399.93054
Ljung, Lennart
1979
Convergence analysis of parametric identification methods. Zbl 0392.93038
Ljung, Lennart
1978
On positive real transfer functions and the convergence of some recursive schemes. Zbl 0361.93063
Ljung, Lennart
1977
Closed-loop identification revisited. Zbl 0934.93019
1999
Kernel methods in system identification, machine learning and function estimation: a survey. Zbl 1298.93342
Pillonetto, Gianluigi; Dinuzzo, Francesco; Chen, Tianshi; De Nicolao, Giuseppe; Ljung, Lennart
2014
Stochastic approximation and optimization of random systems. Zbl 0747.62090
Ljung, Lennart; Pflug, Georg; Walk, Harro
1992
On the estimation of transfer functions, regularizations and Gaussian processes-revisited. Zbl 1269.93126
Chen, Tianshi; Ohlsson, Henrik; Ljung, Lennart
2012
A theoretical analysis of recursive identification methods. Zbl 0418.93084
Söderström, Torsten; Ljung, L.; Gustavsson, Ivar
1978
Identification of processes in closed loop-identifiability and accuracy aspects. Zbl 0346.93012
Gustavsson, Ivar; Ljung, L.; Söderström, Torsten
1977
New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices. Zbl 0414.15005
Friedlander, B.; Morf, M.; Kailath, T.; Ljung, L.
1979
Adaptation and tracking in system identification - a survey. Zbl 0714.93053
1990
System identification: Design variables and the design objective. Zbl 0639.93059
Ljung, L.
1987
Asymptotic variance expressions for identified black-box transfer function models. Zbl 0568.93065
Ljung, Lennart
1985
Identification of piecewise affine systems via mixed-integer programming. Zbl 1037.93023
Roll, Jacob; Bemporad, Alberto; Ljung, Lennart
2004
Consistency of the least-squares identification method. Zbl 0334.93048
Ljung, Lennart
1976
Asymptotic normality of prediction error estimators for approximate system models. Zbl 0437.93044
Ljung, Lennart; Caines, Peter E.
1979
Maximum likelihood identification of Wiener models. Zbl 1152.93508
2008
Strong convergence of a stochastic approximation algorithm. Zbl 0402.62060
Ljung, Lennart
1978
Hard frequency-domain model error bounds from least-squares like identification techniques. Zbl 0767.93021
Wahlberg, Bo; Ljung, Lennart
1992
Nonlinear black-box models in system identification: Mathematical foundations. Zbl 0846.93019
Juditsky, Anatoli; Hjalmarsson, Håkan; Benveniste, Albert; Delyon, Bernard; Ljung, Lennart; Sjöberg, Jonas; Zhang, Qinghua
1995
Identification of linear multivariable systems operating under linear feedback control. Zbl 0302.93032
Ljung, Lennart; Gustavsson, Ivar; Söderström, Torsten
1974
Identification of Hammerstein-Wiener models. Zbl 1257.93109
Wills, Adrian; Schön, Thomas B.; Ljung, Lennart; Ninness, Brett
2013
Nonlinear system identification via direct weight optimization. Zbl 1127.93060
Roll, Jacob; Nazin, Alexander; Ljung, Lennart
2005
Subspace-based multivariable system identification from frequency response data. Zbl 0855.93020
McKelvey, Tomas; Akçay, Hüseyin; Ljung, Lennart
1996
Performance analysis of general tracking algorithms. Zbl 0834.93050
Guo, Lei; Ljung, Lennart
1995
Asymptotic properties of black-box identification of transfer functions. Zbl 0632.93075
Ljung, Lennart; Yuan, Zhen-Dong
1985
Design variables for bias distribution in transfer function estimation. Zbl 0582.93065
Wahlberg, Bo; Ljung, Lennart
1986
Scattering theory and linear least squares estimation. II: Discrete-time problems. Zbl 0329.93031
Friedlander, B.; Kailath, T.; Ljung, L.
1976
Counterexamples to general convergence of a commonly used recursive identification method. Zbl 0316.93034
Ljung, Lennart; Söderström, Torsten; Gustavsson, Ivar
1975
System identification via sparse multiple kernel-based regularization using sequential convex optimization techniques. Zbl 1360.93720
Chen, Tianshi; Andersen, Martin S.; Ljung, Lennart; Chiuso, Alessandro; Pillonetto, Gianluigi
2014
Linear approximations of nonlinear FIR systems for separable input processes. Zbl 1079.93015
Enqvist, Martin; Ljung, Lennart
2005
Estimating linear time-invariant models of nonlinear time-varying systems. Zbl 1293.93754
Ljung, Lennart
2001
Adaptive control based on explicit criterion minimization. Zbl 0568.93046
Trulsson, Eva; Ljung, Lennart
1985
Asymptotic properties of the least-squares method for estimating transfer functions and disturbance spectra. Zbl 0761.93074
Ljung, Lennart; Wahlberg, Bo
1992
Comparing different approaches to model error modeling in robust identification. Zbl 1004.93014
Reinelt, Wolfgang; Garulli, Andrea; Ljung, Lennart
2002
A unified approach to smoothing formulas. Zbl 0323.93043
Ljung, Lennart; Kailath, Thomas
1976
Subspace identification from closed loop data. Zbl 0875.93565
Ljung, Lennart; McKelvey, Tomas
1996
Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems. Zbl 0381.93044
Friedlander, B.; Kailath, T.; Morf, M.; Ljung, L.
1978
Identification of switched linear regression models using sum-of-norms regularization. Zbl 1285.93100
Ohlsson, Henrik; Ljung, Lennart
2013
Asymptotic variance expressions for closed-loop identification. Zbl 1153.93520
Gevers, Michel; Ljung, Lennart; Van den Hof, Paul
2001
Construction of composite models from observed data. Zbl 0742.93003
Skeppstedt, Anders; Ljung, Lennart; Millner, Mille
1992
On line structure selection for multivariable state-space models. Zbl 0497.93052
Van Overbeek, A. J. M.; Ljung, L.
1982
Some facts about the choice of the weighting matrices in Larimore type of subspace algorithms. Zbl 1007.93015
Bauer, Dietmar; Ljung, Lennart
2002
Some results on optimal experiment design. Zbl 0945.93528
2000
Overtraining, regularization and searching for a minimum, with application to neural networks. Zbl 0919.93080
Sjöberg, J.; Ljung, L.
1995
Identifiability conditions for linear multivariable systems operating under feedback. Zbl 0344.93023
Söderström, Torsten; Ljung, L.; Gustavsson, Ivar
1976
Modeling of dynamic systems. Zbl 0843.93001
1994
Identification for control. – What is there to learn? Zbl 0926.93003
Ljung, Lennart
1998
Recursive identification of bilinear systems. Zbl 0619.93024
Fnaiech, Farhat; Ljung, Lennart
1987
Error propagation properties of recursive least-squares adaptation algorithms. Zbl 0575.93068
Ljung, Stefan; Ljung, Lennart
1985
Frequency domain versus time domain methods in system identification. Zbl 0451.93025
Ljung, Lennart; Glover, Keith
1981
Some basic ideas in recursive identification. Zbl 0499.93060
Ljung, L.
1980
Backwards Markovian models for second-order stochastic processes. Zbl 0334.93037
Ljung, L.; Kailath, T.
1976
Identifiability conditions for linear systems operating in closed loop. Zbl 0296.93011
Söderström, Torsten; Gustavsson, Ivar; Ljung, L.
1975
Implementation of algorithms for tuning parameters in regularized least squares problems in system identification. Zbl 1364.93825
Chen, Tianshi; Ljung, Lennart
2013
Asymptotic variance expressions for estimated frequency functions. Zbl 1008.93064
Xie, Liang-Liang; Ljung, Lennart
2001
The role of model validation for assessing the size of the unmodeled dynamics. Zbl 0889.93018
Ljung, Lennart; Guo, Lei
1997
On the estimation of transfer functions. Zbl 0585.93061
Ljung, Lennart
1985
Revisiting Hammerstein system identification through the two-stage algorithm for bilinear parameter estimation. Zbl 1180.93031
Wang, Jiandong; Zhang, Qinghua; Ljung, Lennart
2009
Letters to the editor on the paper “Dynamic wavelet and equivalent models”. Zbl 1293.93538
Ljung, L.
2000
Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint. Zbl 1338.93121
Pillonetto, Gianluigi; Chen, Tianshi; Chiuso, Alessandro; De Nicolao, Giuseppe; Ljung, Lennart
2016
Segmentation of ARX-models using sum-of-norms regularization. Zbl 1191.93139
Ohlsson, Henrik; Ljung, Lennart; Boyd, Stephen
2010
A basic convergence result for particle filtering. Zbl 1390.94218
Hu, Xiao-Li; Schön, Thomas B.; Ljung, Lennart
2008
Regressor selection with the analysis of variance method. Zbl 1061.93094
Lind, Ingela; Ljung, Lennart
2005
Identification of unstable systems using output error and Box-Jenkins model structures. Zbl 0971.93075
2000
Performance analysis of the forgetting factor RLS algorithm. Zbl 0787.93102
Guo, Lei; Ljung, Lennart; Priouret, Pierre
1993
Analysis of a general recursive prediction error identification algorithm. Zbl 0451.93064
Ljung, Lennart
1981
The factorization and representation of operators in the algebra generated by Toeplitz operators. Zbl 0437.47018
Kailath, T.; Levy, B.; Ljung, L.; Morf, M.
1979
Generalized Krein-Levinson equations for efficient calculation of Fredholm resolvents of nondisplacement kernels. Zbl 0441.45007
Kailath, Thomas; Ljung, Lennart; Morf, Martin
1978
Fast time-invariant implementations of Gaussian signal detectors. Zbl 0389.94002
Kailath, Thomas; Levy, Bernard C.; Ljung, Lennart; Morf, Martin
1978
Maximum entropy kernels for system indentification. Zbl 1366.93669
Carli, Francesca Paolo; Chen, Tianshi; Ljung, Lennart
2017
Maximum entropy properties of discrete-time first-order stable spline kernel. Zbl 1335.93131
Chen, Tianshi; Ardeshiri, Tohid; Carli, Francesca P.; Chiuso, Alessandro; Ljung, Lennart; Pillonetto, Gianluigi
2016
$$L_{2}$$ model reduction and variance reduction. Zbl 1008.93016
Tjärnström, F.; Ljung, L.
2002
Exponential stability of general tracking algorithms. Zbl 0834.93059
Guo, Lei; Ljung, Lennart
1995
Identification of structured state-space models. Zbl 1388.93017
Yu, Chengpu; Ljung, Lennart; Verhaegen, Michel
2018
Using the bootstrap to estimate the variance in the case of undermodeling. Zbl 1364.93130
Tjärnström, Fredrik; Ljung, Lennart
2002
Black-box identification of multivariable transfer functions - asymptotic properties and optimal input design. Zbl 0545.93075
Yuan, Zhendong; Ljung, Lennart
1984
A scattering theory framework for fast least-squares algorithms. Zbl 0361.93052
Kailath, T.; Ljung, L.
1977
Efficient change of initial conditions, dual Chandrasekhar equations, and some applications. Zbl 0354.93066
Ljung, Lennart; Kailath, Thomas
1977
The asymptotic behavior of constant-coefficient Riccati differential equations. Zbl 0324.93041
Kailath, T.; Ljung, L.
1976
Smoothed state estimates under abrupt changes using sum-of-norms regularization. Zbl 1238.93105
Ohlsson, Henrik; Gustafsson, Fredrik; Ljung, Lennart; Boyd, Stephen
2012
Subspace-based identification of infinite-dimensional multivariable systems from frequency-response data. Zbl 0859.93017
McKelvey, Tomas; Akçay, Hüseyin; Ljung, Lennart
1996
Generalized Kalman smoothing: modeling and algorithms. Zbl 1375.93144
Aravkin, Aleksandr; Burke, James V.; Ljung, Lennart; Lozano, Aurelie; Pillonetto, Gianluigi
2017
Four encounters with system identification. Zbl 1259.93044
Ljung, Lennart; Hjalmarsson, Håkan; Ohlsson, Henrik
2011
Frequency domain identification of continuous-time output error models. II: Non-uniformly sampled data and B-spline output approximation. Zbl 1214.93114
Gillberg, Jonas; Ljung, Lennart
2010
Regressor and structure selection in NARX models using a structured ANOVA approach. Zbl 1283.93294
Lind, Ingela; Ljung, Lennart
2008
On the choice of norms in system identification. Zbl 0863.93083
Akçay, Hüseyin; Hjalmarsson, Håkan; Ljung, Lennart
1996
Estimating model variance in the case of undermodeling. Zbl 0767.93003
1992
Frequency domain tracking characteristics of adaptive algorithms. Zbl 0699.93092
1989
Analysis of stochastic gradient algorithms for linear regression problems. Zbl 0589.65097
Ljung, Lennart
1984
On canonical forms, parameter identifiability and the concept of complexity. Zbl 0387.93016
Ljung, Lennart; Rissanen, Jorma
1978
On consistency and identifiability. Zbl 0369.93038
Ljung, Lennart
1976
On asymptotic properties of hyperparameter estimators for kernel-based regularization methods. Zbl 1401.93197
Mu, Biqiang; Chen, Tianshi; Ljung, Lennart
2018
Identification of structured state-space models. Zbl 1388.93017
Yu, Chengpu; Ljung, Lennart; Verhaegen, Michel
2018
On asymptotic properties of hyperparameter estimators for kernel-based regularization methods. Zbl 1401.93197
Mu, Biqiang; Chen, Tianshi; Ljung, Lennart
2018
Identification of nonlinear state-space systems from heterogeneous datasets. Zbl 06989032
Pan, Wei; Yuan, Ye; Ljung, Lennart; Gonçalves, Jorge; Stan, Guy-Bart
2018
Maximum entropy kernels for system indentification. Zbl 1366.93669
Carli, Francesca Paolo; Chen, Tianshi; Ljung, Lennart
2017
Generalized Kalman smoothing: modeling and algorithms. Zbl 1375.93144
Aravkin, Aleksandr; Burke, James V.; Ljung, Lennart; Lozano, Aurelie; Pillonetto, Gianluigi
2017
From structurally independent local LTI models to LPV model. Zbl 1375.93039
Zhang, Qinghua; Ljung, Lennart
2017
Regularized linear system identification using atomic, nuclear and kernel-based norms: the role of the stability constraint. Zbl 1338.93121
Pillonetto, Gianluigi; Chen, Tianshi; Chiuso, Alessandro; De Nicolao, Giuseppe; Ljung, Lennart
2016
Maximum entropy properties of discrete-time first-order stable spline kernel. Zbl 1335.93131
Chen, Tianshi; Ardeshiri, Tohid; Carli, Francesca P.; Chiuso, Alessandro; Ljung, Lennart; Pillonetto, Gianluigi
2016
Kernel methods in system identification, machine learning and function estimation: a survey. Zbl 1298.93342
Pillonetto, Gianluigi; Dinuzzo, Francesco; Chen, Tianshi; De Nicolao, Giuseppe; Ljung, Lennart
2014
System identification via sparse multiple kernel-based regularization using sequential convex optimization techniques. Zbl 1360.93720
Chen, Tianshi; Andersen, Martin S.; Ljung, Lennart; Chiuso, Alessandro; Pillonetto, Gianluigi
2014
Scalable anomaly detection in large homogeneous populations. Zbl 1296.93041
Ohlsson, Henrik; Chen, Tianshi; Pakazad, Sina Khoshfetrat; Ljung, Lennart; Shankar Sastry, S.
2014
Identification of Hammerstein-Wiener models. Zbl 1257.93109
Wills, Adrian; Schön, Thomas B.; Ljung, Lennart; Ninness, Brett
2013
Identification of switched linear regression models using sum-of-norms regularization. Zbl 1285.93100
Ohlsson, Henrik; Ljung, Lennart
2013
Implementation of algorithms for tuning parameters in regularized least squares problems in system identification. Zbl 1364.93825
Chen, Tianshi; Ljung, Lennart
2013
On the estimation of transfer functions, regularizations and Gaussian processes-revisited. Zbl 1269.93126
Chen, Tianshi; Ohlsson, Henrik; Ljung, Lennart
2012
Smoothed state estimates under abrupt changes using sum-of-norms regularization. Zbl 1238.93105
Ohlsson, Henrik; Gustafsson, Fredrik; Ljung, Lennart; Boyd, Stephen
2012
Weight determination by manifold regularization. Zbl 1328.93274
Ohlsson, Henrik; Ljung, Lennart
2012
Four encounters with system identification. Zbl 1259.93044
Ljung, Lennart; Hjalmarsson, Håkan; Ohlsson, Henrik
2011
Decentralized particle filter with arbitrary state decomposition. Zbl 1391.93229
Chen, Tianshi; Schön, Thomas B.; Ohlsson, Henrik; Ljung, Lennart
2011
Difference algebra and system identification. Zbl 1227.93122
Lyzell, Christian; Glad, Torkel; Enqvist, Martin; Ljung, Lennart
2011
A general convergence result for particle filtering. Zbl 1391.93242
Hu, Xiao-Li; Schön, Thomas B.; Ljung, Lennart
2011
Segmentation of ARX-models using sum-of-norms regularization. Zbl 1191.93139
Ohlsson, Henrik; Ljung, Lennart; Boyd, Stephen
2010
Frequency domain identification of continuous-time output error models. II: Non-uniformly sampled data and B-spline output approximation. Zbl 1214.93114
Gillberg, Jonas; Ljung, Lennart
2010
Issues in sampling and estimating continuous-time models with stochastic disturbances. Zbl 1191.93137
2010
Semi-supervised regression and system identification. Zbl 1234.93117
Ohlsson, Henrik; Ljung, Lennart
2010
Frequency domain identification of continuous-time output error models. I: Uniformly sampled data and frequency function approximation. Zbl 1214.93113
Gillberg, Jonas; Ljung, Lennart
2010
Wiener system identification using the maximum likelihood method. Zbl 1216.93106
2010
Revisiting Hammerstein system identification through the two-stage algorithm for bilinear parameter estimation. Zbl 1180.93031
Wang, Jiandong; Zhang, Qinghua; Ljung, Lennart
2009
Frequency-domain identification of continuous-time ARMA models from sampled data. Zbl 1166.93027
Gillberg, Jonas; Ljung, Lennart
2009
An improved phase method for time-delay estimation. Zbl 1183.93048
Björklund, Svante; Ljung, Lennart
2009
Maximum likelihood identification of Wiener models. Zbl 1152.93508
2008
A basic convergence result for particle filtering. Zbl 1390.94218
Hu, Xiao-Li; Schön, Thomas B.; Ljung, Lennart
2008
Regressor and structure selection in NARX models using a structured ANOVA approach. Zbl 1283.93294
Lind, Ingela; Ljung, Lennart
2008
On parameter and state estimation for linear differential–algebraic equations. Zbl 1137.93052
Gerdin, Markus; Schön, Thomas B.; Glad, Torkel; Gustafsson, Fredrik; Ljung, Lennart
2007
Frequency domain versus time domain methods in system identification – revisited. Zbl 1118.93310
Ljung, Lennart
2006
Nonlinear system identification via direct weight optimization. Zbl 1127.93060
Roll, Jacob; Nazin, Alexander; Ljung, Lennart
2005
Linear approximations of nonlinear FIR systems for separable input processes. Zbl 1079.93015
Enqvist, Martin; Ljung, Lennart
2005
Regressor selection with the analysis of variance method. Zbl 1061.93094
Lind, Ingela; Ljung, Lennart
2005
A novel subspace identification approach with enforced causal models. Zbl 1100.93522
Qin, S. Joe; Lin, Weilu; Ljung, Lennart
2005
Guest editorial: special issue on system identification. Zbl 1365.93007
Ljung, Lennart (ed.); Vicino, Antonio (ed.)
2005
Identification of piecewise affine systems via mixed-integer programming. Zbl 1037.93023
Roll, Jacob; Bemporad, Alberto; Ljung, Lennart
2004
Variance expressions for spectra estimated using auto-regressions. Zbl 1033.62090
Xie, Liang-Liang; Ljung, Lennart
2004
Robustness guarantees for linear control designs with an estimated nonlinear model error model. Zbl 1057.93007
2004
Variance properties of a two-step ARX estimation procedure. Zbl 1293.93727
Tjärnström, Fredrik; Ljung, Lennart
2003
Linear system identification as curve fitting. Zbl 1054.93017
Ljung, Lennart
2003
Comparing different approaches to model error modeling in robust identification. Zbl 1004.93014
Reinelt, Wolfgang; Garulli, Andrea; Ljung, Lennart
2002
Some facts about the choice of the weighting matrices in Larimore type of subspace algorithms. Zbl 1007.93015
Bauer, Dietmar; Ljung, Lennart
2002
$$L_{2}$$ model reduction and variance reduction. Zbl 1008.93016
Tjärnström, F.; Ljung, L.
2002
Using the bootstrap to estimate the variance in the case of undermodeling. Zbl 1364.93130
Tjärnström, Fredrik; Ljung, Lennart
2002
Identification of composite local linear state-space models using a projected gradient search. Zbl 1022.93012
Verdult, Vincent; Ljung, Lennart; Verhaegen, Michel
2002
Estimating linear time-invariant models of nonlinear time-varying systems. Zbl 1293.93754
Ljung, Lennart
2001
Asymptotic variance expressions for closed-loop identification. Zbl 1153.93520
Gevers, Michel; Ljung, Lennart; Van den Hof, Paul
2001
Asymptotic variance expressions for estimated frequency functions. Zbl 1008.93064
Xie, Liang-Liang; Ljung, Lennart
2001
Recursive least-squares and accelerated convergence in stochastic approximation schemes. Zbl 1153.93536
Ljung, Lennart
2001
On-line identification and adaptive trajectory tracking for nonlinear stochastic continuous time systems using differential neural networks. Zbl 0988.93039
Poznyak, Alex S.; Ljung, Lennart
2001
Some results on optimal experiment design. Zbl 0945.93528
2000
Letters to the editor on the paper “Dynamic wavelet and equivalent models”. Zbl 1293.93538
Ljung, L.
2000
Identification of unstable systems using output error and Box-Jenkins model structures. Zbl 0971.93075
2000
A projection method for closed-loop identification. Zbl 0989.93022
2000
Ensuring monotonic gain characteristics in estimated models by fuzzy model structures. Zbl 0941.93509
Lindskog, Peter; Ljung, Lennart
2000
Comments on model validation as set membership identification. Zbl 0949.93509
Ljung, Lennart
1999
Closed-loop identification revisited. Zbl 0934.93019
1999
An alternative motivation for the indirect approach to closed-loop identification. Zbl 0958.93027
1999
Identification for control. – What is there to learn? Zbl 0926.93003
Ljung, Lennart
1998
Bias, variance and optimal experiment design: Some comments on closed loop identification. Zbl 0971.93076
1998
The role of model validation for assessing the size of the unmodeled dynamics. Zbl 0889.93018
Ljung, Lennart; Guo, Lei
1997
Classical model validation for control design purposes. Zbl 0875.93152
Ljung, Lennart; Guo, Lei
1997
Necessary and sufficient conditions for stability of LMS. Zbl 0886.93073
Guo, Lei; Ljung, Lennart; Wang, Guan-Jun
1997
Subspace-based multivariable system identification from frequency response data. Zbl 0855.93020
McKelvey, Tomas; Akçay, Hüseyin; Ljung, Lennart
1996
Subspace identification from closed loop data. Zbl 0875.93565
Ljung, Lennart; McKelvey, Tomas
1996
Subspace-based identification of infinite-dimensional multivariable systems from frequency-response data. Zbl 0859.93017
McKelvey, Tomas; Akçay, Hüseyin; Ljung, Lennart
1996
On the choice of norms in system identification. Zbl 0863.93083
Akçay, Hüseyin; Hjalmarsson, Håkan; Ljung, Lennart
1996
On neural network model structures in system identification. Zbl 0856.93025
Ljung, L.; Sjöberg, J.; Hjalmarsson, H.
1996
Vibration data analysis for a commercial aircraft. Zbl 0875.93065
McKelvey, T.; Abrahamsson, T.; Ljung, L.
1996
Nonlinear black-box modeling in system identification: A unified overview. Zbl 0846.93018
Sjöberg, Jonas; Zhang, Qinghua; Ljung, Lennart; Benveniste, Albert; Delyon, Bernard; Glorennec, Pierre-Yves; Hjalmarsson, Håkan; Juditsky, Anatoli
1995
Nonlinear black-box models in system identification: Mathematical foundations. Zbl 0846.93019
Juditsky, Anatoli; Hjalmarsson, Håkan; Benveniste, Albert; Delyon, Bernard; Ljung, Lennart; Sjöberg, Jonas; Zhang, Qinghua
1995
Performance analysis of general tracking algorithms. Zbl 0834.93050
Guo, Lei; Ljung, Lennart
1995
Overtraining, regularization and searching for a minimum, with application to neural networks. Zbl 0919.93080
Sjöberg, J.; Ljung, L.
1995
Exponential stability of general tracking algorithms. Zbl 0834.93059
Guo, Lei; Ljung, Lennart
1995
On global identifiability for arbitrary model parametrizations. Zbl 0795.93026
1994
Modeling of dynamic systems. Zbl 0843.93001
1994
System identification in a MIC perspective. Zbl 0850.93188
Ljung, Lennart
1994
Performance analysis of the forgetting factor RLS algorithm. Zbl 0787.93102
Guo, Lei; Ljung, Lennart; Priouret, Pierre
1993
Stochastic approximation and optimization of random systems. Zbl 0747.62090
Ljung, Lennart; Pflug, Georg; Walk, Harro
1992
Hard frequency-domain model error bounds from least-squares like identification techniques. Zbl 0767.93021
Wahlberg, Bo; Ljung, Lennart
1992
Asymptotic properties of the least-squares method for estimating transfer functions and disturbance spectra. Zbl 0761.93074
Ljung, Lennart; Wahlberg, Bo
1992
Construction of composite models from observed data. Zbl 0742.93003
Skeppstedt, Anders; Ljung, Lennart; Millner, Mille
1992
Estimating model variance in the case of undermodeling. Zbl 0767.93003
1992
On the precision of a model in system identitification. Zbl 0832.93017
Ljung, L.
1992
A discussion of model accuracy in system identification. Zbl 0782.93029
Ljung, Lennart
1992
A result on the mean square error obtained using general tracking algorithms. Zbl 0741.93050
Ljung, Lennart; Priouret, Pierre
1991
Remarks on the mean square tracking error. Zbl 0781.93102
Ljung, Lennart; Priouret, Pierre
1991
Adaptation and tracking in system identification - a survey. Zbl 0714.93053
1990
Frequency domain tracking characteristics of adaptive algorithms. Zbl 0699.93092
1989
Wang, Ke; Ljung, Lennart
1989
System identification: theory for the user. Zbl 0615.93004
Ljung, Lennart
1987
System identification: Design variables and the design objective. Zbl 0639.93059
Ljung, L.
1987
Recursive identification of bilinear systems. Zbl 0619.93024
Fnaiech, Farhat; Ljung, Lennart
1987
Parametric methods for identification of transfer functions of linear systems. Zbl 0652.93057
Ljung, Lennart
1987
Design variables for bias distribution in transfer function estimation. Zbl 0582.93065
Wahlberg, Bo; Ljung, Lennart
1986
...and 57 more Documents
all top 5
#### Cited by 3,951 Authors
77 Ljung, Lennart 63 Ding, Feng 51 Hjalmarsson, Håkan 38 Söderström, Torsten 35 Schoukens, Johan 29 Bai, Erwei 29 Pintelon, Rik 26 Billings, Stephen A. 26 Goodwin, Graham Clifford 26 Pillonetto, Gianluigi 25 Gevers, Michel R. 25 Van den Hof, Paul M. J. 23 Stoica, Petre Gheorghe 22 Anderson, Brian David Outram 22 Kailath, Thomas 21 Chen, Hanfu 20 Makila, Pertti M. 19 Rojas, Cristian R. 19 Verhaegen, Michel 18 Wang, Leyi 17 Milanese, Mario 16 Akçay, Hüseyin 16 Chiuso, Alessandro 16 Novara, Carlo 16 Yin, Gang George 15 Campi, Marco Claudio 15 Landau, Ioan Doré 15 Zheng, Wei Xing 14 Bombois, Xavier 14 Chen, Tianshi 14 Guo, Lei 13 De Moor, Bart L. R. 13 Gerencsér, László 13 Wahlberg, Bo 12 Bittanti, Sergio 12 Ninness, Brett M. 12 Rolain, Yves 11 Agüero, Juan-Carlos 11 Dumont, Guy A. 11 Garnier, Hugues 11 Karimi, Alireza 11 Kárný, Miroslav 11 Moore, John Barratt 11 Piga, Dario 11 Poznyak, Aleksandr Semënovich 11 Zhou, Tong 10 Åström, Karl Johan 10 Bitmead, Robert R. 10 Gilson, Marion 10 Mercère, Guillaume 10 Tóth, Roland 10 Weyer, Erik 10 Zhao, Wen-Xiao 9 Bernstein, Dennis S. 9 Bottegal, Giulio 9 Kovačević, Branko D. 9 Mårtensson, Jonas 9 Partington, Jonathan R. 9 Savaresi, Sergio M. 9 Yin, George Gang 9 Zhang, Qinghua 8 Bauer, Dietmar 8 Fkirin, Mohamed Ahmed 8 Li, Kang 8 Liu, Yanjun 8 McKelvey, Tomas 8 Morf, Martin 8 Picci, Giorgio 8 Scorletti, Gérard 8 Wang, Xuehai 8 Watanabe, Keigo 8 Xiao, Yongsong 8 Yi, Zhang 7 Bako, Laurent 7 Bemporad, Alberto 7 Benveniste, Albert 7 Bobtsov, Alexey A. 7 Chappell, Michael J. 7 Chen, Sheng 7 Deng, Zili 7 Fisher, D. Grant 7 Garatti, Simone 7 Johnson, Charles Richard jun. 7 Mahata, Kaushik 7 Meshkat, Nicolette 7 Ortega, Romeo S. 7 Piroddi, Luigi 7 Schön, Thomas B. 7 Shieh, Leang-San 7 Wei, Ching-Zong 7 Wigren, Torbjörn 7 Zhang, Jifeng 7 Zhu, Quanmin 6 Aknouche, Abdelhakim 6 Aravkin, Aleksandr Y. 6 Bazanella, Alexandre Sanfelice 6 Borkar, Vivek Shripad 6 Chen, Tongwen 6 de Callafon, Raymond A. 6 Ding, Jie ...and 3,851 more Authors
all top 5
#### Cited in 283 Serials
844 Automatica 212 International Journal of Control 104 International Journal of Adaptive Control and Signal Processing 94 Systems & Control Letters 90 International Journal of Systems Science 62 Journal of the Franklin Institute 58 European Journal of Control 44 Linear Algebra and its Applications 36 International Journal of Robust and Nonlinear Control 35 Circuits, Systems, and Signal Processing 33 Nonlinear Dynamics 30 Applied Mathematics and Computation 28 Automation and Remote Control 27 Mathematical Problems in Engineering 26 Mathematical Biosciences 25 Applied Mathematical Modelling 21 Information Sciences 20 Computers & Mathematics with Applications 19 Neural Networks 18 Journal of Economic Dynamics & Control 18 Mathematical and Computer Modelling 18 International Journal of Systems Science. Principles and Applications of Systems and Integration 17 Stochastic Processes and their Applications 17 International Journal of Applied Mathematics and Computer Science 16 Fuzzy Sets and Systems 16 Journal of Optimization Theory and Applications 15 Kybernetika 15 Mathematics and Computers in Simulation 15 Journal of Time Series Analysis 14 Journal of Mathematical Analysis and Applications 14 European Journal of Operational Research 13 Optimal Control Applications & Methods 13 Signal Processing 13 Asian Journal of Control 12 Chaos, Solitons and Fractals 12 Journal of Econometrics 11 Journal of Computational and Applied Mathematics 11 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 11 Mathematical and Computer Modelling of Dynamical Systems 11 Journal of Systems Science and Complexity 10 Computer Methods in Applied Mechanics and Engineering 10 Stochastic Analysis and Applications 10 MCSS. Mathematics of Control, Signals, and Systems 10 Journal of Vibration and Control 10 Chaos 9 Journal of Mathematical Biology 9 Journal of Multivariate Analysis 9 Cybernetics and Systems Analysis 9 Nonlinear Analysis. Hybrid Systems 8 Biological Cybernetics 8 The Annals of Statistics 8 Journal of Statistical Planning and Inference 8 Statistics & Probability Letters 8 Economics Letters 8 Computational Statistics and Data Analysis 8 Algorithms 7 Journal of Fluid Mechanics 7 Bulletin of Mathematical Biology 7 Journal of Economic Theory 7 International Journal of Computer Mathematics 7 Journal of Statistical Computation and Simulation 7 Complexity 6 Journal of Computational Physics 6 Integral Equations and Operator Theory 6 SIAM Journal on Control and Optimization 6 Acta Mathematicae Applicatae Sinica. English Series 6 Sequential Analysis 6 Communications in Statistics. Theory and Methods 6 Soft Computing 6 Journal of Applied Mathematics 6 Journal of Theoretical Biology 5 International Journal of General Systems 5 Stochastics 5 Journal of Mathematical Psychology 5 Machine Learning 5 Neural Computation 5 Discrete Event Dynamic Systems 5 Games and Economic Behavior 5 Communications in Statistics. Simulation and Computation 5 Pattern Recognition 5 SIAM Journal on Optimization 5 Journal of Computer and Systems Sciences International 5 SIAM Journal on Scientific Computing 4 Cybernetics and Systems 4 International Journal of Production Research 4 International Journal of Approximate Reasoning 4 The Annals of Applied Probability 4 Archive of Applied Mechanics 4 Mathematical Methods of Statistics 4 Bernoulli 4 Communications in Nonlinear Science and Numerical Simulation 4 Econometric Theory 4 Sādhanā 4 Journal of Control Theory and Applications 4 Science in China. Series F 4 Journal of Control Science and Engineering 4 Science China. Information Sciences 3 Artificial Intelligence 3 Metrika 3 Physics Letters. A ...and 183 more Serials
all top 5
#### Cited in 51 Fields
2,092 Systems theory; control (93-XX) 516 Statistics (62-XX) 225 Numerical analysis (65-XX) 192 Computer science (68-XX) 171 Operations research, mathematical programming (90-XX) 166 Probability theory and stochastic processes (60-XX) 166 Biology and other natural sciences (92-XX) 91 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 90 Information and communication theory, circuits (94-XX) 64 Dynamical systems and ergodic theory (37-XX) 58 Linear and multilinear algebra; matrix theory (15-XX) 58 Ordinary differential equations (34-XX) 54 Calculus of variations and optimal control; optimization (49-XX) 37 Mechanics of particles and systems (70-XX) 37 Mechanics of deformable solids (74-XX) 31 Fluid mechanics (76-XX) 22 Partial differential equations (35-XX) 22 Operator theory (47-XX) 21 Approximations and expansions (41-XX) 19 Optics, electromagnetic theory (78-XX) 18 Classical thermodynamics, heat transfer (80-XX) 13 Integral equations (45-XX) 10 Geophysics (86-XX) 9 Harmonic analysis on Euclidean spaces (42-XX) 9 Functional analysis (46-XX) 8 Commutative algebra (13-XX) 8 Difference and functional equations (39-XX) 7 Combinatorics (05-XX) 7 Field theory and polynomials (12-XX) 7 Statistical mechanics, structure of matter (82-XX) 6 Real functions (26-XX) 5 Functions of a complex variable (30-XX) 4 General and overarching topics; collections (00-XX) 4 History and biography (01-XX) 4 Mathematical logic and foundations (03-XX) 4 Special functions (33-XX) 4 Quantum theory (81-XX) 3 Number theory (11-XX) 3 Integral transforms, operational calculus (44-XX) 2 Algebraic geometry (14-XX) 2 Global analysis, analysis on manifolds (58-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Associative rings and algebras (16-XX) 1 Nonassociative rings and algebras (17-XX) 1 Potential theory (31-XX) 1 Several complex variables and analytic spaces (32-XX) 1 Sequences, series, summability (40-XX) 1 Abstract harmonic analysis (43-XX) 1 Differential geometry (53-XX) 1 Algebraic topology (55-XX) 1 Manifolds and cell complexes (57-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-01-28T13:10:28 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5352717638015747, "perplexity": 14233.419486550845}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-04/segments/1610704843561.95/warc/CC-MAIN-20210128102756-20210128132756-00067.warc.gz"}
|
https://read.dukeupress.edu/demography/article/59/5/1713/318087/A-Bayesian-Cohort-Component-Projection-Model-to
|
## Abstract
Accurate estimates of subnational populations are important for policy formulation and monitoring population health indicators. For example, estimates of the number of women of reproductive age are important to understand the population at risk of maternal mortality and unmet need for contraception. However, in many low-income countries, data on population counts and components of population change are limited, and so subnational levels and trends are unclear. We present a Bayesian constrained cohort component model for the estimation and projection of subnational populations. The model builds on a cohort component projection framework, incorporates census data and estimates from the United Nation's World Population Prospects, and uses characteristic mortality schedules to obtain estimates of population counts and the components of population change, including internal migration. The data required as inputs to the model are minimal and available across a wide range of countries, including most low-income countries. The model is applied to estimate and project populations by county in Kenya for 1979–2019 and is validated against the 2019 Kenyan census.
## Introduction
Reliable estimates of demographic and health indicators at the subnational level are essential for monitoring trends and inequalities over time. As part of monitoring progress toward global health targets such as the Sustainable Development Goals (SDGs), there has been increasing recognition of the substantial differences that can occur across regions within a country (He et al. 2017; Lim et al. 2016; World Health Organization 2016). The analysis of national-level trends is often inadequate, and subnational patterns should be considered to fully understand likely future trajectories. Indeed, estimates and projections of important indicators such as child mortality and contraceptive use are now being published at the subnational level (New et al. 2017; Wakefield et al. 2019).
To effectively measure health indicators of interest, we need to be able to accurately estimate the size of the population at risk. In order to convert the rate of incidence of a particular demographic or health outcome to the number of people affected by that outcome, we need a good estimate of the denominator of those rates. Hence population counts are essential knowledge for policy planning and resource allocation purposes. However, even something as seemingly simple as the number of people in an area of a certain age is relatively unknown in many countries, particularly low-income countries that do not have well-functioning vital registration systems. And as previously reported outcomes have shown, differences in estimates of the population at risk can have a large effect on the resulting estimates of key indicators. For example, in 2017 the United Nations Inter-agency Group for Child Mortality Estimation (UN-IGME) and the Institute for Health Metrics and Evaluation (IHME) both published estimates of under-five child mortality in countries worldwide (UN-IGME 2017; Wang et al. 2017). However, estimates for 2016 differed markedly, with IHME's estimate being 642,000 deaths lower than the UN-IGME estimate. The main reason for the discrepancy was the different sets of estimates of live births: IHME assumed there were 128.8 million live births in 2016, which was 12.2 million lower than the 141 million used by UN-IGME.
Data on population counts by age and sex at the subnational level vary substantially by country, and often data availability and quality are the worst in countries where outcomes are also relatively poor. For example, many low-income countries may have only one or two historical censuses available, and very little data available on internal migration or mortality rates at the subnational level. This situation is in stark contrast to many high-income countries, where multiple data sources on population counts, mortality, and migration may exist. These varying data availability contexts present challenges in estimates of both population and the components of population change. In data-rich contexts, the challenge is to reconcile multiple data sources that may be measuring the same outcome. In data-sparse contexts, the challenge is to obtain reasonable estimates without many observations. In both cases, traditional demographic models are often utilized, which often center around a cohort component projection framework and take advantage of the fact that patterns in populations often exhibit strong regularities across age and time. However, these classical methods do not give any indication of uncertainty around the estimates or projections, and incorporating information from different data sources often requires ad hoc adjustments to ensure consistency. To overcome these limitations, we propose a method that builds on classical demographic estimation of subnational populations by incorporating these techniques within a probabilistic framework.
In particular, we present a Bayesian constrained cohort component model to estimate subnational populations, focusing on women of reproductive age (WRA)—that is, women aged 15–49. This subgroup forms the population at risk for many important health indicators, such as fertility rates, maternal mortality, and measures of contraceptive prevalence. The model presented embeds a cohort component projection setup in a Bayesian framework, allowing uncertainty in data and population processes to be taken into account. At a minimum, the model uses data on population and migration counts from censuses, as well as national-level information on mortality and population trends, taken from the United Nations World Population Prospects (United Nations 2019a). Because data requirements are relatively modest, the methodology is applicable across a wide range of countries and overcomes limitations of previous subnational cohort component methods, which require relatively large amounts of data. Estimates and projections of population by age are produced, as well as estimates of subnational mortality schedules and in- and out-migration flows. Hence, results from the model are helpful in understanding populations at risk of demographic and health outcomes at the subnational level, but also in understanding the drivers of population change and how these may in turn affect trends in indicators of interest.
The following section gives a brief overview of existing methods of subnational population estimation and outlines the contributions of the model proposed here. We then describe the main data sources typically available for subnational population estimation in low-income countries, using counties in Kenya as an example, followed by a detailed description of the proposed methodology. Next, we present results of fitting the model to data in Kenya and validate its out-of-sample projections against the 2019 census. Finally, possible extensions are discussed.
## Existing Methods of Subnational Population Estimation
Methods to estimate population at the subnational level are similar to estimation methods at the national level. However, there are several notable challenges of subnational population estimation that do not exist at a country level. First, migration flows are more important at the subnational level. While migration flows are often assumed to be negligible at the national level, they are usually larger as a proportion of total population size at the regional level. In addition, migration flows at the subnational level are also often more difficult to estimate. Any particular region could have net in- or out-migration, and flows to and from different regions can differ markedly in magnitude. In some contexts, international migration can also be an important component of demographic change, particularly in regions of armed conflict. Second, when estimating subnational populations, it is important to ensure that the sum of all regions agrees with national estimates produced elsewhere. In practice, this usually involves a process of calibration against a known national population so that they match the total. Lastly, data quality and availability are often poorer at the subnational level. Populations at the regional level are smaller and data are often more volatile, and data on key indicators of mortality and internal migration are often lacking or unreliable. This means that it is particularly important at the subnational level to address and quantify uncertainty in population counts and components of change.
Perhaps the simplest and least data-intensive methods of subnational population estimation involve interpolation and extrapolation of regional shares of the total population (Swanson and Tayman 2012). Given two (or more) censuses, one can calculate the relevant shares of the population by age, sex, and region and see how they have changed over time. Intercensal estimations of populations assume constant increase (or decrease) over time. Projection of populations into the future can then be made on the basis of assumptions of constant levels or trends in shares. For example, the U.S. Census Bureau produces subnational population estimates for the majority of countries worldwide (U.S. Census Bureau 2017). The methods used to produce such estimates involve making assumptions such as constant or logistic growth and iteratively calculating population proportions by age, sex, and region such that they match the country's total population (Leddy 2016).
The most commonly used methods of population estimation and projection are cohort component methods. These center on the demographic accounting identity, which states that the population size ($P$) at time $t$ is equal to the population size at $t−1$, plus births ($B$) and in-migrants ($I$), minus deaths ($D$) and out-migrants ($O$) (Wachter 2014):
(1)
This equation is for a total population, but the same accounting equation holds for each age-group separately (where births affect only the first age-group). The cohort component method of population projection (Leslie 1945) takes a baseline population with a certain age structure and projects it forward using age-specific mortality, fertility, and migration rates. Cohort component methods are important because they allow for overall population change to be related to the main components of that change. By estimating population size on the basis of the components of fertility, mortality, and migration, the method allows changes in these components to be taken into account. However, cohort component methods are more data-intensive than extrapolation methods, which is particularly an issue at the subnational level. Especially for developing countries, where well-functioning vital registration systems do not exist, sufficient data on mortality, fertility, and migration are often lacking.
Other methods of subnational estimation involve building regression models that relate other variables of interest to changes in population over time. For example, one could regress the ratio of census populations (area of interest / total population) against the ratio of some other indicator, such as births, deaths, voters, or school enrollments (for a detailed review, see Swanson and Tayman 2012). However, given the lack of data available in many developing countries—on population counts, let alone other indicators of growth—these methods have limited use in our context.
These traditional methods of population estimation are deterministic and do not account for random variation in demographic processes and possible measurement errors that may exist in the data. In practice, the population data that are available in developing countries are often sparse and may suffer from various types of errors. When estimating and projecting population sizes through time, it is particularly important in developing country contexts to give some indication of the level of uncertainty around those estimates, based on stochastic error, measurement error, and uncertainties in the underlying modeling process.
### Bayesian Methods
The use of Bayesian methods in demography has become increasingly common, as it provides a useful framework to incorporate different data sources in the same model, account for various types of uncertainty, and allow for information exchange across time and space (Bijak and Bryant 2016). Bayesian methods have been used to model and forecast national populations (Raftery et al. 2014; Raftery et al. 2012; United Nations 2019a), fertility (Alkema et al. 2011), mortality (Alexander and Alkema 2018; Alkema and New 2014; Girosi and King 2008), and migration (Bijak 2008). In terms of estimating the full demographic accounting identity, Wheldon et al. (2013) proposed a method for the reconstruction of past populations. The model embeds the demographic accounting equation within a Bayesian hierarchical framework, using information from available censuses to reconstruct historical populations via a cohort component projection framework. The authors showed that the method works well to estimate populations and quantify uncertainty in a wide range of countries with varying data availability (Wheldon et al. 2016). The method presented in Wheldon et al. (2013) is designed for population reconstruction at the national level, and as such, accounting for internal migration is not an issue. In addition, their method relies on and calibrates to national population estimates produced as part of the UN World Population Prospects.
In the field of subnational estimation, Bayesian methods have also been used in many different contexts. For subnational mortality estimation, many researchers have used Bayesian hierarchical frameworks to share information about mortality trends across space and time, in contexts where the available data are both reliable (Alexander et al. 2017; Congdon et al. 1997) and sparse (Schmertmann and Gonzaga 2018). For subnational fertility estimation, Sevcikova et al. (2018) proposed a Bayesian model that produces estimates and projections of subnational total fertility rates (TFRs) that are consistent with national estimates of TFR produced by the UN. Building from the local level up, Schmertmann et al. (2013) proposed a method that uses empirical Bayesian methods to smooth volatile fertility data at the regional level, before modeling using a Brass relational model variant.
In terms of population estimation at the subnational level, John Bryant and colleagues have shown how the demographic accounting equation can be placed within a Bayesian framework to account for and reconcile different data sources, population counts, and the components of population change (Bryant and Graham 2013; Bryant and Zhang 2018). Bryant and Zhang (2018) showed how the underlying demographic processes can be captured through a process or system model, and different types of uncertainty around data inputs are captured through data models. The focus of Bryant and Graham (2013) was producing subnational population estimates for New Zealand—reconciling and incorporating information about the population from sources such as censuses and school and voting enrollments. The approach that we take in this article is similar to the Bryant et al. approach, in that we model population change with a process model, the components of which are described by system models, and different sources of information are combined through the use of data models. However, whereas Bryant et al. tried to overcome challenges of combining multiple data sources that may be measuring the same outcome, we are trying to overcome the challenges of estimating subnational populations in contexts where there are extremely limited amounts of data available.
There has been an increasing amount of research using geolocated data and satellite imagery to estimate population sizes and flows in developing countries (Leasure et al. 2020; Wardrop et al. 2018). Led by the WorldPop project at the University of Southampton (WorldPop 2018), researchers have used information from satellite imagery to identify areas of settlements and combined this information with census data to obtain highly granular population density estimates across Africa (Leasure et al. 2020; Linard et al. 2012). While this work contributes to information about subnational populations, the focus and goals of this estimation work are different from our goals in this study. In particular, the goal of much of the WorldPop work is primarily to obtain estimates of total population and population density at a very granular level, rather than to obtain population estimates by age and sex. The results have then been combined with data on age and sex distributions from censuses (or more recent surveys) to map the distribution of populations by age and sex. More recently, WorldPop's “bottom-up” approach starts with a census or survey for a particular country and uses spatial models to produce spatially granular estimates of populations by age and sex for a single year (Wardrop et al. 2018). However, less attention has been paid to how age distributions across regions change over time. But changes in age distributions are important in understanding broader population change and how this will impact global health indicators of interest. In addition, our approach is grounded in understanding the main components of demographic change—mortality and migration—over time and how they affect population sizes, rather than just estimating the population size as a single outcome.
The methodology proposed here incorporates a cohort component projection model into a Bayesian hierarchical framework to understand changes in population structures over time. It allows estimates to be driven by available data and for uncertainty to be incorporated around estimates and projections. The approach has similarities with methodologies described in Wheldon et al. (2013) (but with a focus on subnational estimation) and in Bryant and Graham (2013) and Bryant and Zhang (2018) (but with a focus on data-sparse situations).
In particular, we introduce a framework to estimate subnational population counts and components of population change that relies on a minimal amount of data that are available for the vast majority of countries worldwide. Observations on subnational population counts and internal migration movements are taken from censuses, but no information on subnational mortality patterns is required. We instead use a mortality model approach based on principal components derived from national mortality schedules. Using principal components for demographic modeling and forecasting first gained popularity after Lee and Carter used the technique as a basis for forecasting U.S. mortality rates (Lee and Carter 1992). More recently, principal components has become increasingly used in demographic modeling, in both fertility and mortality settings (Alexander et al. 2017; Clark 2016; Schmertmann et al. 2014).
While one strength of our approach is being able to estimate components of subnational population change with limited data, another strength of the proposed framework is that it can be readily extended to include other data or estimates. For example, gridded estimates produced as part of the WorldPop project could conceivably be treated as an additional data input to the model. Conversely, subnational population estimates and uncertainty bounds using our approach may be useful as inputs to help inform WorldPop's estimates.
## Data
We aim to estimate female population counts for ages 15–49 per five-year age-group for subnational areas that are the second administrative level down. This data description focuses on Kenya, for which the model is applied in later sections. However, the data and methods are more broadly applicable to other countries that have similar data available. Inputs used to obtain estimates come from two main sources: micro-level data from censuses, and national population and mortality estimates from the 2019 World Population Prospects. These data sources are outlined in the following sections.
### Overview of Kenyan Geography
In Kenya, the first administrative units are provinces, and the second administrative units are counties. There are eight provinces, including the capital, Nairobi, and 47 counties. The county boundaries have changed over time but have been stable since the 2009 census. We aim to produce estimates of populations of women of reproductive age at the county level based on county boundaries in 2009. Within the model, we also make use of harmonized district boundaries (see the following description), which are slightly larger than counties. There are a total of 35 districts.
### Census Data
Data inputs on subnational population counts and internal migration flows come from national censuses. The census data are available through Integrated Public Use Microdata Series (IPUMS) International (Minnesota Population Center 2017). IPUMS International contains samples of microdata for 305 censuses from 85 different countries. The majority of countries of interest have relatively recent censuses available through IPUMS International. Kenya has decennial censuses available from 1979 to 2009, and we use data from these years to fit the model in the Kenyan context. Micro-level data are not available for the 2019 Kenyan census, but population counts by sex and five-year age-group and county are available through the national statistics office. While we do not use the 2019 data in model fitting, it is used for model evaluation and validation, as detailed in the Model Evaluation section in Results.
In the micro-level IPUMS data, location of residence is reported at the first (province) and second (county) administrative levels, as well as at a harmonized district level. For Kenya, the provinces are stable over time, but before 2009 the county boundaries changed. Hence, we only have data at the county level for Kenya for 2009. However, we can make use of the harmonized districts for data in years prior to 2009. The districts represent slightly larger groups than the 47 Kenyan counties, which are harmonized and temporally stable (IPUMS 2018). In all cases, each 2009 county is completely contained in one unique district.
We use census data to obtain information on two different quantities: observed population counts and observed patterns of in- and out-migration. Female population counts by five-year age-groups for ages 15–49 and subnational administrative region are obtained directly from the IPUMS International microdata. Because these data are samples (most commonly 10%), the microdata are multiplied by the person weights to obtain counts by age and area.1
Information on internal migration between counties and districts is also obtained from national censuses. This is based on questions about a migrant's location of residence one year ago. We calculated in- and out-migration counts by age-group, for each region and each census. For the 2009 census, the calculations were based on counties; for all earlier years, the calculations were based on districts.
### National Estimates from World Population Prospects
The World Population Prospects (WPP) are the official population estimates and projections produced by the United Nations. WPP is revised every two years, with the latest revision being in 2019 (United Nations 2019a). WPP estimates are produced using a combination of census and survey data and demographic and statistical methods. Both population counts and mortality estimates from WPP are used in the model.
We use estimates from WPP 2019 in two ways. First, we would like to ensure that the sum of population estimates at the regional level agrees with published estimates at the national level. Hence, the standard national population counts produced by WPP are used as a constraint in the model, subject to uncertainty. The WPP models populations of five-year age-groups every five years from 1950 to 2100.
In addition, national mortality estimates produced by WPP are used as the basis of a mortality model for patterns at the regional level, capturing HIV/AIDS-related patterns of mortality. To generate these patterns, we use estimates from multiple countries in the sub-Saharan region. WPP uses the relationship between infant mortality and the probability of dying between ages 15 and 60, that is, $45q15$, to estimate a life table based on Coale–Demeny model life tables (United Nations 2019b). We use estimates of the probability of dying between ages $x$ and $x+5$, or $5qx$.
### Other Potential Data Sources
We use census data and WPP estimates as inputs to the model. There are other available data sources that could be used as inputs. These sources and the reasons for not including them are discussed in online Appendix A.
## Model
### Overview
In this section, we describe the modeling framework to estimate female populations by five-year age-group and county. The model is outlined for the situation where, as in the Kenyan case, we do not observe county-level information for every census, but we have information on larger, harmonized districts that fully encapsulate the counties. This situation is common for many low-income countries, where geographic boundaries may vary over time but there exist other stably defined boundaries through the microdata on IPUMS.
There are many components and several types of data going into the model at different stages. The overall model framework is summarized visually in Figure 1. We define $ηa,t,c$ to be the underlying “true” population of women in age-group $a$, year $t,$ and county $c$. Our main modeling goal is to obtain estimates and projections of these quantities. The population counts follow a cohort component projection (CCP) model, which assumes that population counts in the current time period are those from the previous period, after taking into account expected changes in mortality and migration. The CCP model also includes an additional age–time multiplier that captures any other variation not already captured by expected changes in mortality or migration. Our setup allows for changes in mortality and migration to be projected forward even if there are no data on these components, and is useful in data-sparse contexts where there is limited information available on the individual components of population change. Note that the goal is to estimate adult populations only and hence the model does not include a fertility component. More details on how estimates in the first age-group are derived are discussed in the following.
As illustrated in Figure 1, the mortality, the migration, and the additional age–time multipliers have additional “process models” (shown in the third row), and data on population counts and migration are related to the underlying process through data models (shown in the top row). The following sections broadly describe each component of the model. The full model specification and details can be found in online Appendix B.
### Population Model
The model for population includes the cohort component project model; the data model, which relates observations of population counts from the census to the underlying quantities of interest; and the national-level constraint, which relates the sum of the county-level populations to WPP estimates.
#### Cohort Component Projection Model
The underlying population $ηa,t,c$ can be expressed as
(2)
where $γa,t,c$ is the expected conditional probability of death in age-group $a$, year $t,$ and county $c$; $ϕa,t,c$ is expected net migration (i.e., in- minus out-migration) as a proportion of population size; and $εa,t,c$ is an additional age–year–county multiplier. The multiplier allows for additional changes in age that may not have already been captured by the constrained mortality and migration components.
Note that this is a form of a cohort component projection framework. As mentioned previously, our main modeling goal is to obtain estimates of the $ηa,t,c$, but we are also interested in estimates of expected mortality ($γa,t,c$) and expected migration ($ϕa,t,c$), and, if nonzero, the log multipliers ($logεa,t,c$).
#### Data Model
Define $yi$ to be the $i$th observed population count. Depending on the year of the census, $yi$ is observed at either the county $c$ level or district $d$ level. The data model is
(3)
where $sy2$ is the sampling error based on the fact that the microdata in IPUMS are a 10% sample.2 The second case of this equation dictates that if we have observations prior to 2009, we can relate these only to $ηa,t,c$s that have been summed to the district level.
#### Constraints on National Population
We would like to ensure that the county-level populations $ηa,t,c$ imply a national-level population that is consistent with previously published estimates in WPP. We would like to use WPP estimates; however, these do not have associated uncertainty published, so we assume the following. We constrain the sum of the county populations by age and year to be within the interval $(Λa,t,Ωa,t)$:
$Λa,t<∑cηa,t,c≤Ωa,t,$
(4)
with lower bound $Λa,t$ and upper bound $Ωa,t$ determined by the national estimates produced by WPP. Specifically, for the lower bound $Λa,t,$ we assume the following prior:
(5)
This prior dictates that the prior probability of is 50%. The standard deviation of 0.1 on the log scale captures the uncertainty associated with the lower bound. We assign a WPP-informed prior to upper bound $Ωa,t$ in a similar manner:
(6)
Note that in this setup, we do not use WPP estimates as “data” to directly inform the sum of the county estimates as in other work (e.g., WorldPop estimates). Instead, we use the WPP estimates to exclude combinations that are extreme as compared to the WPP estimates.
#### Priors on First Year and Age-group
Because we are interested in estimating and projecting adult populations, the cohort component projection framework does not explicitly take fertility into account. However, the projection framework still requires an initial population of 15-year-olds from which to project populations forward. Additionally, the model requires initial populations in the first year of reconstruction. We place priors on the size of these initial populations using information about the national populations from WPP and the county population proportions from the censuses.
In particular, we use the following priors:
(7)
(8)
where $WPPa,t$ is the national-level population count from WPP in the relevant age-group and year, and $propa,t,c$ is the proportion of the total population in the relevant age-group, year, and county, which was calculated by interpolating census-year proportions and assuming the proportion of a district's population in each county was constant at a level equal to 2009.
### Mortality Model
Equation (2) requires estimates of the expected conditional probability of death in each age-group, year, and county. As discussed in the Data section and the online appendix, we do not have reliable information about mortality by age at the county level, and hence we use information about mortality trends at the national level as the basis for a mortality model at the subnational level. A semiparametric model is used to capture the shape of national mortality through age and time, while allowing for differences by county. In particular, we model county mortality on the logit scale as
$logit(γa,t,c)=Ya,0+βt,c,1⋅Ya,1+βt,c,2⋅Ya,2,$
(9)
where $Ya,0$ is the mean age-specific logit mortality schedule of the national mortality curves and $Y1:A,1$ and $Y1:A,2$ are the first two principal components derived from national-level mortality schedules. Modeling on the logit scale ensures that the death probabilities are between zero and one.
The county-specific coefficients $βt,c,k$ are modeled as fluctuations around a national mean:
$βt,c,k=Bt,knat+δt,c,k,$
(10)
(11)
where $Bt,knat$ are the national coefficients on principal components, derived from WPP data. The county-specific fluctuations are modeled as a random walk.
Principal components create an underlying structure of the model in which regularities in age patterns of human mortality can be expressed. Many different kinds of shapes of mortality curves can be expressed as a combination of the components. Incorporating more than one principal component allows for greater flexibility in the underlying shape of the mortality age schedule.
Principal components were obtained from a decomposition of a matrix that contains a set of standard mortality curves. We used national life tables published in the World Population Prospects 2019 for a set of 26 countries in sub-Saharan Africa.3 These countries were chosen because, like Kenya, they experienced substantial increases in mortality owing to HIV/AIDS.
In particular, let $X$ be a $N×G$ matrix of logit mortality rates, where $N$ is the number of years and $G$ is the number of age-groups. In this case, we had $N=16$ years (estimates every five years from 1950 to 2025) of $G=7$ age-groups (15–19, 20–24, . . . , 45–49). The singular value decomposition (SVD) of $X$ is
$X=UDV′,$
(12)
where $U$ is a $N×N$ matrix, $D$ is a $N×G$ matrix, and $V$ is a $G×G$ matrix. The first two columns of $V$ (the first two right-singular values of $X$) are $Y1:A,1$ and $Y1:A,2$.
The mean mortality schedule and the first two principal components for Kenyan national mortality curves between ages 15–49 from 1950 to 2020 are shown in Figure 2. The mean logit mortality schedule shows a standard age-specific mortality curve, with mortality increasing over age. The first two principal components have demographic interpretations. The first shows the average contribution of each age to mortality improvement over time. This interpretation is similar to the $bx$ term in a Lee–Carter model (Lee and Carter 1992). For the case of Kenya, the second principal component most likely represents the relative effect of HIV/AIDS mortality by age (Sharrow et al. 2014).
### Migration Model
The second population change component of Eq. (2) refers to the net-migration rate in a particular age-group, year, and county. Specifically, define the net-migration rate as
(13)
where $ψa,t,cin$ is the number of in-migrants and $ψa,t,cout$ is the number of out-migrants.
For the migration component, we use observed data from the census. In a similar way to the population model, we have a process model, which defines the underlying migration process for the “true” migrant parameters, and a data model, which relates observations from the census to the underlying truth.
#### Process Model
The model form for the number of in-migrants and out-migrants is informed by patterns observed in the raw census data. In particular, looking at the age distribution of both in- and out-migration (i.e., the proportion of total migrants who are in age-group $a$) suggests that, while the overall magnitude of migration changes over time, the age patterns in migration are fairly constant (see figures in online Appendix C). This observation is consistent with the large body of migration estimation literature, where strong age patterns of migration motivate both parametric and semiparametric models (e.g., Rogers 1988; Rogers and Castro 1981; Wisniowski et al. 2015). This observation allows us to simplify the expression for the number of in-migrants and out-migrants, which are modeled as
$ψa,t,cin=Ψt,cin⋅Πa,cin,$
(14)
$ψa,t,cout=Ψt,cout⋅Πa,cout,$
(15)
where $Ψt,cin$ and $Ψt,cout$ are the total number of in- and out-migrants, respectively, and $Πa,cin$ and $Πa,cout$ are the relevant age distributions. In this way, the age distributions are assumed to be constant over time while the total counts vary.
The total number of in-migrants and out-migrants are estimated for each county–period. We model the total counts as a second-order random walk to impose a certain level of smoothness in the counts over time. As the model captures internal migration flows in and out of each county, it must be the case that the sum of all in-migration flows minus the sum of all out-migration flows equals international net-migration. Lacking sufficient reliable information on international migration for Kenya, we constrain the absolute difference between the sum of all estimated in- and out-migration flows to be less than 10% of the total population for that age-group and period. See online Appendix B for further details.
#### Data Model
Finally, we relate the observed age-specific in- and out-migration counts in the censuses, denoted $Miin$ and $Miout$, respectively, to the underlying true counts $ψa,t,cin$ and $ψa,t,cout$ through the following data model:
(16)
(17)
In a fashion similar to the data model for population, data observed prior to 2009 can only be related to the migration counts that have been summed to the district level. In addition, the $sin2$ and $sout2$ are the sampling errors based on the fact that the microdata in IPUMS are a 10% sample.
### Additional Age–Time Multiplier $εa,t,c$
In the models for expected mortality and migration discussed in the foregoing, constraints are imposed on the age-specific effects. In particular, the use of the SVD approach to model mortality results in mortality age patterns that are linear combinations of the mean schedule and the components of change (the $Y$'s). Additionally, the migration model assumes a constant age pattern of migration over time with varying magnitudes of in- and out-migration. We assume these forms in order to greatly reduce the number of parameters that need to be estimated in each model, such that reasonable estimates of mortality and migration rates can still be obtained in data-sparse settings.
To allow for county-specific age and time variation that may not have already been captured by other components, we introduced an additional age–time multiplier $εa,t,c$ in the population cohort component model (see Eq. (2)). We model these multipliers on the log scale, and to ensure identifiability we assume that the mean of the sum of the log multipliers over all age-groups is zero. See online Appendix B for more details.
This setup assumes that in general, patterns of population change are well captured by the mortality and migration components, and hence, in the absence of more information, we expect the multiplier terms to be close to zero. Observing many estimated nonzero multiplier terms may suggest that the mortality and migration components need to be reformulated.
### Computation
The model was fitted in a Bayesian framework using the statistical software R. Samples were taken from the posterior distributions of the parameters via a Markov Chain Monte Carlo (MCMC) algorithm. This was performed using JAGS software (Plummer 2003). Standard diagnostic checks using trace plots and the $R^$ diagnostic (Gelman et al. 2020) were used to check convergence.
Best estimates of all parameters of interest were taken to be the median of the relevant posterior samples. The 95% Bayesian credible intervals were calculated by finding the 2.5% and 97.5% quantiles of the posterior samples.
Data and code are available at https://github.com/MJAlexander/subnational-bayes-ccp.
## Results
We illustrate some key results of population counts, mortality, and migration. Additional results are presented in online Appendix E.
### Population Estimates and Projections
Population estimates and projections are shown in Figure 3. Part a shows the population of women of reproductive age by province in 1979–2019. The black lines and associated shaded area represent the model estimates and associated 95% credible intervals, respectively. The red dots indicate decennial censuses. Populations of WRA increase in every province, with the largest province being Rift Valley. While Northeastern is the smallest province by population size, the growth rate is relatively rapid, likely owing to the relatively high fertility rates in this province (Kenya National Bureau of Statistics 2015; Westoff and Cross 2006), whereas rapid population increases in Nairobi are driven by in-migration.
Part b of Figure 3 illustrates populations over age and time for three counties. Note the different y-axis scales for each county. For Nairobi, populations are much larger and the presence of net in-migration far surpasses the effects of mortality, leading to an inverted U-shaped age distribution. For Wajir, a relatively rural county in the northeast, population growth seems rapid over time. For Baringo, populations are relatively small and decline regularly over age owing to mortality.
### Mortality
In addition to getting estimates of population counts, we also obtain estimates of the components of population change, namely, mortality and migration. Regarding mortality, there is evidence of variation across the counties. Focusing on three counties as above, mortality profiles are quite different, with Nairobi's estimates being higher than those of the other two counties shown (Figure 4).
### Migration
In addition to mortality, there is substantial variation in patterns in migration across Kenyan counties. Figure 5 shows estimates of all migration components in the three case study counties. For total in-migration and out-migration estimates (part a), flows into and out of Nairobi are much larger, with net in-migration reaching over 200,000 people per year. Flows into Wajir are much smaller (<10,000 people), and in 2019 Baringo had net out-migration of around 10,000. The estimated age patterns of migration for the three counties are also shown in part b. Some differences exist, with Nairobi's immigrants much more concentrated around ages 20–24.
### Age–Time Multiplier
Figure 6 shows the age–time multipliers $ε$ for the three example counties. For Baringo, the multipliers are essentially always zero on the log scale. This observation is true for the majority of counties (see online Appendix E for plots for additional counties), which suggests that most of the patterns over age and time are captured well by the mortality and migration components. For county–years for which multipliers do deviate from zero, estimates are at most around 10% of the total population magnitude, and usually between 0% and 5%. For example, for Nairobi, the estimated multiplier suggests that, after accounting for the expected mortality and migration components, in 2009, we see an additional increase around age 20 (of around 10%) and an additional decrease of almost 10% for the oldest age-group.
### Model Evaluation
A national census was conducted in Kenya in 2019. While the micro-level data are not yet publicly available (e.g., via IPUMS), the resulting population counts by age, sex, and county have been published by the Kenya National Bureau of Statistics (Kenya National Bureau of Statistics 2019). We can therefore evaluate the 2019 projections from our model with the actual counts from the 2019 census.
We extracted census population counts by age, sex, and county from a PDF file containing the results following code provided by Alexander (2022). We compared the 2019 projections from the Bayesian cohort component projection model (referred to as Bayes CCP) with these counts and calculated several summary metrics. We define the relative error $eg$ for a particular group $g$ as
(18)
where $yg,2019$ refers to the census-based population count for that population and $η^g,2019$ to the model-based projection. A group $g$ can refer to an age–county or age–district group, for example.
On the basis of the errors, we calculated mean, median, and root-mean-squared errors (RMSEs) by age-group and for the total population. We compared these results to the results of a similar linear extrapolation model, where the population in 2019 was estimated by applying the same proportion change seen between the 1999–2009 censuses. Errors were summarized over districts, as estimates by county are not possible with the linear extrapolation method (as we have only one previous set of census observations by county).
Error summaries by age-group and for the total population are shown in Table 1. In general, the Bayesian model projections are within ∼1% of the census populations. The magnitudes of the RMSEs for the simple linear interpolation are 3–4 times as high as those of the Bayes CCP. The bias results suggest that the point estimate from the Bayes CCP is often slightly lower than the census observation, whereas linear interpolation substantially overestimates population counts.
We also calculated the coverage of the 95% prediction intervals of the Bayesian CCP model estimates for 2019, compared to the observed 2019 census counts, and the proportion of census counts above and below the prediction intervals. If the model is well calibrated, on average around 90% of the observed census counts should fall within the 90% prediction intervals, and 5% of observations should fall above and below the interval. Table 2 reports coverage by age-group and suggests that in general the coverage of the credible intervals matches expectations. However, in some age-groups, there is a relative bias toward observations falling below the interval rather than above.
We also calculated the probability integral transform (Angus 1994) to assess the consistency between the 2019 projections and observed counts. Results are presented in online Appendix F.
## Discussion
In this article, we proposed a Bayesian cohort component projection framework for estimating the population of women of reproductive age when limited amounts of data are available. The model uses information on population and migration counts from censuses, as well as mortality patterns from national schedules, to reconstruct populations from cohorts moving through time. The modeling framework also naturally extends to allow the projection of populations. In addition, the model ensures that the national populations implied by the sum of subnational areas agree with national prepublished UN WPP estimates.
The model was used to estimate and project populations of women of reproductive age for counties in Kenya over the period 1979–2019. Results suggested continued growth of WRA populations in all districts, and accelerated growth in particular in areas such as Nairobi and Northeastern. The mortality component of the modeling framework highlighted the stagnating progress of longevity seen through the 1990s and 2000s, largely due to HIV/AIDS, but also indicated more recent mortality declines. The estimates from the Kenyan example also highlighted substantial differences in internal migration patterns across the nation.
The model requires inputs only from national censuses and WPP estimates, which are available for the majority of countries. Thus, while the model was tested on estimation in Kenya, the methodology is applicable to a wide range of countries with very little alteration. For example, there are currently census microdata available for almost 100 counties on the IPUMS International website. At a minimum, in addition to WPP estimates, data on population counts and in- and out-migration flows by subnational area are ideally required for two census years. These could be obtained via IPUMS as in our case, or using summary aggregate counts if these are available. Such counts at two time points are the minimum requirement, but the more data that are available, the less uncertain estimates are likely to be. The amount of uncertainty and decisions about when it would be appropriate to implement this model are context specific. For example, a country that has relatively stable population growth (with relatively constant or uniformly changing demographic rates) is likely to have less uncertainty around estimates than a country that has experienced fluctuating rates over time. Censuses can be available for any year, as historical, intermediate, and future populations can be reconstructed and projected. However, note that the longer the projection period (i.e., the more historical the censuses), the larger the projection uncertainty. For countries with substantial international migration, we recommend extending the model to account for this component of population change. For example, if the size of the net-migration flows is known, the constraint on net-migration, which is currently set to be approximately zero, could be updated.
After we ran a series of validation measures, the proposed model outperformed a benchmark model of linear interpolation. In addition to having lower performance than Bayes CCP, with the simple interpolation method it is not possible to easily get estimates by county, because 2009 was the first year that the current geographic boundaries of counties were established. Another advantage of the Bayesian model is that the population estimates also have an associated uncertainty level, and that estimating not only population counts but also mortality and migration rates allows us to better understand the drivers of population change by county.
There are several other advantages and contributions of this modeling framework to the estimation of subnational populations. The model is governed by a cohort component projection model, tracking cohorts as they move through time. This has advantages over more aggregate techniques, such as interpolation and extrapolation, because it allows us to understand trends in overall population as a process governed by separate components that add or remove population. This process takes into account intercensal events, such as trends in HIV/AIDS mortality, and produces estimates and projections with uncertainty.
Second, the modeling framework proposes a parsimonious model for internal net-migration across subnational areas. In cohort component models, migration components are often assumed to be negligible or considered to just be the residual once mortality has been taken into account. Very few data usually exist on migration patterns, and estimation of all migration components by age, region, and year becomes very intensive. After observing key patterns in the data, we proposed a net-migration model that separates migration patterns into independent age and time components. The result is an age-specific net-migration model with parameters that are easier to estimate when data are limited.
More broadly, one of the contributions of our proposed framework over existing work in this area is the use of mortality and migration models that have relatively strong functional forms, which allow plausible estimates to be produced even in the absence of good-quality data. Our approach to modeling mortality through the use of characteristic age patterns is inspired by the long demographic tradition of using model life tables when information on mortality is sparse.
While we have illustrated the utility of this approach in data-limited contexts, the framework can naturally be extended to include additional sources of data. For example, if there exist observations of age-specific mortality rates at the subnational level (even at some ages), these data could be used as inputs to the mortality model. If more reliable data on internal migration flows were available, the existing migration process model—which assumes a fixed age schedule with varying magnitude over time—could be reformulated to be more flexible. In general, to be able to handle population projection in a context of low data availability, the model proposed here includes mortality and mortality process models that separate age and time trends into independent effects. Additional specific age–time effects were then captured by the multiplier $ε$. If more data are available, the underlying process models could be extended to better understand these age–time effects and how they relate to either mortality or migration.
Another possible extension of this framework is to include other total population estimates, such as those from WorldPop, as additional “data” that could be used to inform estimates. We view this methodology and subnational population estimates produced from it as complementary to estimates produced by efforts such as the WorldPop project. As mentioned earlier, the primary goal of the WorldPop estimates is to produce extremely fine-grained estimates of total population, whereas we are more interested in understanding population patterns by age and sex and the underlying components of population change within larger subnational areas.
This model was developed to estimate and project adult populations only, and in particular, women of reproductive age. The model appears to perform well for this subpopulation. Notably, a limitation of the model is that we do not estimate populations from birth or at older age populations. We do not explicitly model fertility within the cohort component projection framework, but rather use information from censuses and WPP to place plausible prior distributions on the initial age-group of interest (in this case, ages 15–19). A possible extension to the framework proposed here would be the modeling of a larger set of age-groups, starting at birth, and explicitly incorporating fertility rates. As for mortality and migration models, a model for fertility would need to be motivated by the type and amount of data available at the subnational level.
While this model framework has the advantage of explicitly including a component to estimate internal migration flows, a limitation is that we assume there are no biases in the observed migration data. In practice, this may not be true: one can imagine recall biases and “heaping” biases creating underreporting. From exploration of other migration-related data from censuses and Demographic and Health Surveys, it appears these data are the least likely to exhibit such biases. Thus, in the absence of better quality data on migration, we make the assumption that the observations from this census question have no bias.
Another limitation is related to the national constraint in the model. We set the national totals to be between approximately 90% and 110% of the WPP national population estimates. Ideally, we would be able to use uncertainty around the WPP estimates within this model, however, currently this is not available.
The incorporation of a cohort component projection model into a probabilistic setting allows for different sources of uncertainty, such as sampling and nonsampling error, to be included in the modeling process. The Bayesian hierarchical framework allows information from different data sources to be consolidated without the need for postestimation redistribution changes, as is often the case with subnational population estimation (Swanson and Tayman 2012). In addition, compared with traditional deterministic techniques, it allows for increased flexibility in modeling population processes while still keeping the basis of an underlying demographic process.
## Notes
1
The sampling error introduced by considering sampled microdata is accounted for in the data model; refer to Methods for details.
2
Sampling errors were calculated assuming a binomial distribution and using the delta method.
3
Benin, Burkina Faso, Burundi, Cameroon, Central African Republic, Chad, Comoros, Democratic Republic of the Congo, Ethiopia, Ghana, Guinea, Guinea-Bissau, Kenya, Madagascar, Mali, Mauritania, Niger, Nigeria, Senegal, Sierra Leone, South Africa, Togo, Uganda, United Republic of Tanzania, Zambia, and Zimbabwe.
## References
Alexander, M., & Alkema, L. (
2018
).
Global estimation of neonatal mortality using a Bayesian hierarchical splines regression model
.
Demographic Research
,
38
,
335
372
. https://doi.org/10.4054/DemRes.2018.38.15
Alexander, M., Zagheni, E., & Barbieri, M. (
2017
).
A flexible Bayesian model for estimating subnational mortality
.
Demography
,
54
,
2025
2041
.
Alexander, R. (
2022
).
Telling stories with data: Extracting data from PDFs
Alkema, L., & New, J. R. (
2014
).
Global estimation of child mortality using a Bayesian b-spline bias-reduction model
.
Annals of Applied Statistics
,
8
,
2122
2149
.
Alkema, L., Raftery, A. E., Gerland, P., Clark, S. J., Pelletier, F., Buettner, T., & Heilig, G. K. (
2011
).
Probabilistic projections of the total fertility rate for all countries
.
Demography
,
48
,
815
839
.
Angus, J. E. (
1994
).
The probability integral transform and related results
.
SIAM Review
,
36
,
652
654
.
Bijak, J. (
2008
).
Bayesian methods in international migration forecasting
. In Raymer, J. & Willekens, F. (Eds.),
International migration in Europe: Data, models and estimates
(pp.
255
282
).
Chichester, UK
:
John Wiley & Sons
.
Bijak, J., & Bryant, J. (
2016
).
Bayesian demography 250 years after Bayes
.
Population Studies
,
70
,
1
19
.
Bryant, J., & Zhang, J. L. (
2018
).
Bayesian demographic estimation and forecasting
.
Boca Raton, FL
:
CRC Press
.
Bryant, J. R., & Graham, P. J. (
2013
).
Bayesian demographic accounts: Subnational population estimation using multiple data sources
.
Bayesian Analysis
,
8
,
591
622
.
Clark, S. J. (
2016
).
A general age-specific mortality model with an example indexed by child or child/adult mortality
(ArXiv preprint). https://doi.org/10.48550/arXiv.1612.01408
Congdon, P., Shouls, S., & Curtis, S. (
1997
).
A multi-level perspective on small-area health and mortality: A case study of England and Wales
.
Population, Space and Place
,
3
,
243
263
.
Gelman, A., Vehtari, A., Simpson, D., Margossian, C. C., Carpenter, B., Yao, Y., . . . Modrák, M. (
2020
).
Bayesian workflow
(ArXiv preprint). https://doi.org/10.48550/arXiv.2011.01808
Girosi, F., & King, G. (
2008
).
Demographic forecasting
.
Princeton, NJ
:
Princeton University Press
.
He, C., Liu, L., Chu, Y., Perin, J., Dai, L., Li, X., . . . Zhu, J. (
2017
).
National and subnational all-cause and cause-specific child mortality in China, 1996–2015: A systematic analysis with implications for the Sustainable Development Goals
.
Lancet Global Health
,
5
,
e186
e197
. https://doi.org/10.1016/S2214-109X(16)30334-5
Kenya National Bureau of Statistics
. (
2015
).
Kenya Demographic and Health Survey 2014
.
Rockville, MD
:
The DHS Program, ICF International
Kenya National Bureau of Statistics
. (
2019
).
2019 Kenya population and housing census volume I: Population by county and sub-county
Leasure, D. R., Jochem, W. C., Weber, E. M., Seaman, V., & Tatem, A. J. (
2020
).
National population mapping from sparse survey data: A hierarchical Bayesian modeling framework to account for uncertainty
.
Proceedings of the National Academy of Sciences
,
117
,
24173
24179
.
Leddy, R. M. (
2016
).
Methods for calculating 5-year age group population estimates by sex for subnational areas
(Population Division Paper, Version 2).
Washington, DC
:
U.S. Census Bureau
Lee, R. D., & Carter, L. R. (
1992
).
Modeling and forecasting U.S. mortality
.
Journal of the American Statistical Association
,
87
,
659
671
.
Leslie, P. H. (
1945
).
On the use of matrices in certain population mathematics
.
Biometrika
,
33
,
183
212
.
Lim, S. S., Allen, K., Bhutta, Z. A., Dandona, L., Forouzanfar, M. H., Fullman, N., . . . Murray, C. J. L. (
2016
).
Measuring the health-related Sustainable Development Goals in 188 countries: A baseline analysis from the Global Burden of Disease Study 2015
.
Lancet
,
388
,
1813
1850
.
Linard, C., Gilbert, M., Snow, R. W., Noor, A. M., & Tatem, A. J. (
2012
).
Population distribution, settlement patterns and accessibility across Africa in 2010
.
PloS One
,
7
,
e31743
. https://doi.org/10.1371/journal.pone.0031743
Minnesota Population Center
. (
2017
).
Integrated Public Use Microdata Series, International: Version 6.5
[Data set].
Minneapolis
:
University of Minnesota
. https://doi.org/10.18128/D020.V6.5
New, J. R., Cahill, N., Stover, J., Gupta, Y. P., & Alkema, L. (
2017
).
Levels and trends in contraceptive prevalence, unmet need, and demand for family planning for 29 states and union territories in India: A modelling study using the family planning estimation tool
.
Lancet Global Health
,
5
,
e350
e358
. https://doi.org/10.1016/S2214-109X(17)30033-5
Plummer, M. (
2003
,
March
).
JAGS: A program for analysis of Bayesian graphical models using Gibbs sampling
.
Paper presented at the Third International Workshop on Distributed Statistical Computing
,
Vienna, Austria
Raftery, A. E., Alkema, L., & Gerland, P. (
2014
).
Bayesian population projections for the United Nations
.
Statistical Science
,
29
,
58
68
.
Raftery, A. E, Li, N., Sevcikova, H., Gerland, P., & Heilig, G. K. (
2012
).
Bayesian probabilistic population projections for all countries
.
Proceedings of the National Academy of Sciences
,
109
,
13915
13921
.
Rogers, A. (
1988
).
Age patterns of elderly migration: An international comparison
.
Demography
,
25
,
355
370
.
Rogers, A., & Castro, L. J. (
1981
).
Model migration schedules
(IIASA Research Report, No. RR-81-030).
Laxenburg, Austria
:
International Institute for Applied System Analysis
.
Schmertmann, C., Zagheni, E., Goldstein, J. R., & Myrskylä, M. (
2014
).
Bayesian forecasting of cohort fertility
.
Journal of the American Statistical Association
,
109
,
500
513
.
Schmertmann, C. P., Cavenaghi, S. M., Assunção, R. M., & Potter, J. E. (
2013
).
Bayes plus brass: Estimating total fertility for many small areas from sparse census data
.
Population Studies
,
67
,
255
273
.
Schmertmann, C. P., & Gonzaga, M. R. (
2018
).
Bayesian estimation of age-specific mortality and life expectancy for small areas with defective vital records
.
Demography
,
55
,
1363
1388
.
Sevcikova, H., Raftery, A. E., & Gerland, P. (
2018
).
Probabilistic projection of subnational total fertility rates
.
Demographic Research
,
38
,
1843
1884
. https://doi.org/10.4054/DemRes.2018.38.60
Sharrow, D. J., Clark, S. J., & Raftery, A. E. (
2014
).
Modeling age-specific mortality for countries with generalized HIV epidemics
.
PloS One
,
9
,
e96447
. https://doi.org/10.1371/journal.pone.0096447
Swanson, D. A., & Tayman, J. (
2012
).
Springer series on demographic methods and population analysis: Vol. 31. Subnational population estimates
.
Dordrecht, the Netherlands
:
UN-IGME
. (
2017
).
Levels and trends in child mortality: Report 2017
.
New York, NY
:
United Nations Children's Fund
United Nations
. (
2019a
).
World population prospects: 2019
(Report).
New York, NY
:
United Nations, Department of Economic and Social Affairs, Population Division
. Available from http://esa.un.org/wpp/
United Nations
. (
2019b
).
World population prospects 2019: Methodology of the United Nations population estimates and projections
(Report).
New York, NY
:
United Nations, Department of Economic and Social Affairs, Population Division
U.S. Census Bureau
. (
2017
).
Subnational population by sex, age, and geographic area
[Data set]. Available from https://www.census.gov/geographies/mapping-files/time-series/demo/international-programs/subnationalpopulation.html
Wachter, K. W. (
2014
).
Essential demographic methods
.
Cambridge, MA
:
Harvard University Press
.
Wakefield, J., Fuglstad, G.-A., Riebler, A., Godwin, J., Wilson, K., & Clark, S. J. (
2019
).
Estimating under-five mortality in space and time in a developing world context
.
Statistical Methods in Medical Research
,
28
,
2614
2634
.
Wang, H., Abajobir, A. A., Abate, K. H., Abbafati, C., Abbas, K. M., Abd-Allah, F., . . . Murray, C. J. L. (
2017
).
Global, regional, and national under-5 mortality, adult mortality, age-specific mortality, and life expectancy, 1970–2016: A systematic analysis for the Global Burden of Disease Study 2016
.
Lancet
,
390
,
1084
1150
.
Wardrop, N. A., Jochem, W. C., Bird, T. J., Chamberlain, H. R., Clarke, D., Kerr, D., . . . Tatem, A. J. (
2018
).
Spatially disaggregated population estimates in the absence of national population and housing census data
.
Proceedings of the National Academy of Sciences
,
115
,
3529
3537
.
Westoff, C. F., & Cross, A. R. (
2006
).
The stall in the fertility transition in Kenya
(DHS Analytical Studies No. 9).
Calverton
,
MD: ORC Macro
.
Wheldon, M. C., Raftery, A. E., Clark, S. J., & Gerland, P. (
2013
).
Reconstructing past populations with uncertainty from fragmentary data
.
Journal of the American Statistical Association
,
108
,
96
110
.
Wheldon, M. C., Raftery, A. E., Clark, S. J., & Gerland, P. (
2016
).
Bayesian population reconstruction of female populations for less developed and more developed countries
.
Population Studies
,
70
,
21
37
.
Wisniowski, A., Smith, P. W., Bijak, J., Raymer, J., & Forster, J. J. (
2015
).
Bayesian population forecasting: Extending the Lee-Carter method
.
Demography
,
52
,
1035
1059
.
World Health Organization
. (
2016
).
World health statistics 2016: Monitoring health for the SDGs, Sustainable Development Goals
.
Geneva, Switzerland
:
World Health Organization
.
WorldPop
. (
2018
).
Population movements: Mapping population mobility and connectivity
[Data set]. Available from www.worldpop.org
This is an open access article distributed under the terms of a Creative Commons license (CC BY-NC-ND 4.0).
| 2022-12-07T06:30:45 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 94, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6306703686714172, "perplexity": 2152.0542342381186}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-49/segments/1669446711150.61/warc/CC-MAIN-20221207053157-20221207083157-00212.warc.gz"}
|
https://www.usgs.gov/center-news/volcano-watch-tidal-lunacy
|
# Volcano Watch — Tidal lunacy
Release Date:
Everybody is familiar with ocean tides that cause the ocean level to go up and down, usually twice a day. We can go down to the beach and watch this tidal action along any coast in the world. On a global level, the ocean tides are actually waves whose crests are half a world apart and traveling from east to west. At most points on the globe, the tidal crest comes by about every 12.5 hours.
The engine driving this phenomenon is the gravitational attraction of, primarily, the moon, but also the sun. The earth completes one rotation every 24 hours, and the ocean tides can be imagined as a watery bulge that remains relatively stationary while the planet rotates inside. The biggest tides occur about every two weeks when the sun and moon are aligned (either full or new moon). Hence they are called the "fortnightly" tides.
Few realize that the solid earth also exhibits tidal behavior with bulges on opposite sides of the globe, also driven by the moon. At HVO, we can actually measure these tides with our tiltmeters and strainmeters. The earth's surface tilts up to 0.03 microradians in response to the apparent passage of the moon overhead. A tilt of one microradian is the tilt of a solid bar one kilometer (0.6 miles) long with one end raised by the thickness of a dime. To emphasize how small the tidal tilts are, our tiltmeters automatically alert us to the possibility of volcanic activity when tilts change more than 0.5 microradians in 5 minutes.
Who would have thought that the moon had that kind of power, not only to be able to cause the world's oceans to bulge, but also to squeeze terra firma twice a day? But it does, so it should not come as a complete shock that reputable scientists have suggested that these squeezings might influence whether a volcano will erupt or not.
The idea is that if a volcano is full of magma, the squeezing at the fortnightly tidal maximum might be just enough to overcome the resistance of the crust, push magma out, and get an eruption going. Once started, the eruption would continue on its own.
More than 25 years ago, a pair of earth scientists compared the records for 680 eruptions that occurred since 1900 and found that "the probability of an eruption is greatest at times of maximum tidal amplitude." In plainer language, volcanoes are more likely to erupt at the fortnightly (or 14-day) "high" tide.
A specific look at 52 Hawaiian eruptions since January 1832 shows the same sort of pattern. "Nearly twice as many eruptions have occurred nearer fortnightly tidal maximum than tidal minimum." HVO scientists have noted that the Pu'u 'O'o fountaining episodes each occurred remarkably close to fortnightly tidal maximums and that the first set of eruption pauses in 1990 (periods where the eruption turned off for up to a few days) occurred remarkably close to fortnightly tidal minimums.
Great! Now let's start predicting eruptions based only on this information. The fortnightly tidal maximum occurs at full and new moons, every 14 or so days. The next tidal maximum will be the new moon on November 15—will Mauna Loa erupt then? Almost certainly not.
Although this is a fascinating correlation, there are just too many tidal maximums and too many volcanoes to base predictions on tidal cycle alone. In the Hawai'i example of 52 eruptions since January 1832, there have been nearly 3,900 tidal maximums, of which roughly 3,850 of them went by without causing an eruption. Statistically, this is about a one percent chance that any tidal maximum will affect the start of an eruption.
The correlation is more important as a clue to how volcanoes work. The effect of the tides suggests that a volcano can remain in a state of near eruption for a period of time before some threshold is exceeded and an eruption starts. There are probably many possible mechanisms for exceeding that threshold—the lunar tides are but one.
### Volcano Activity Update
Eruptive activity of Kīlauea Volcano continued unabated at the Puu Oo vent during the past week. Lavamoves away from the vent toward the ocean in a network of tubes and descends Pulama pali in several separate tubes. Breakouts persist from the Kamoamoa tube system and feed surface flows above and on the pali. Many surface flows, supplied mainly from leaks in the ocean entry tubes, are also observed in the coastal flats near the ocean. Lava continues to enter the ocean in three locations: Kamoamoa, Kupapau and the area east of Kupapa`u.
The public is reminded that the benches of the ocean entries are very hazardous, with possible collapses of the unstable new land. The steam clouds are extremely hot, highly acidic, and laced with glass particles. Swimming at the black sand beaches of the benches can be a blistering or even deadly venture.
One earthquake was reported felt during the week ending on November 8. A resident of Mauna Loa Estates subdivision felt an earthquake at 2:45 p.m. on Thursday, November 8. The magnitude-3.1 earthquake was located 12 km (7.2 mi) southeast of the summit of Kīlauea Volcano at a depth of 6 km (3.6 mi).
| 2019-12-12T08:25:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4626035988330841, "perplexity": 2618.6881840706424}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-51/segments/1575540542644.69/warc/CC-MAIN-20191212074623-20191212102623-00048.warc.gz"}
|
https://par.nsf.gov/biblio/10232671-optical-near-infrared-observations-spt2349-proto-cluster-core
|
Optical and near-infrared observations of the SPT2349-56 proto-cluster core at z = 4.3
ABSTRACT We present Gemini-S and Spitzer-IRAC optical-through-near-IR observations in the field of the SPT2349-56 proto-cluster at z = 4.3. We detect optical/IR counterparts for only 9 of the 14 submillimetre galaxies (SMGs) previously identified by ALMA in the core of SPT2349-56. In addition, we detect four z ∼ 4 Lyman-break galaxies (LBGs) in the 30 arcsec-diameter region surrounding this proto-cluster core. Three of the four LBGs are new systems, while one appears to be a counterpart of one of the nine observed SMGs. We identify a candidate brightest cluster galaxy (BCG) with a stellar mass of $(3.2^{+2.3}_{-1.4})\times 10^{11}$ M⊙. The stellar masses of the eight other SMGs place them on, above, and below the main sequence of star formation at z ≈ 4.5. The cumulative stellar mass for the SPT2349-56 core is at least (12.2 ± 2.8) × 1011 M⊙, a sizeable fraction of the stellar mass in local BCGs, and close to the universal baryon fraction (0.19) relative to the virial mass of the core (1013 M⊙). As all 14 of these SMGs are destined to quickly merge, we conclude that the proto-cluster core has already developed a significant stellar mass at this early stage, comparable to z = 1 BCGs. Importantly, we also find more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10232671
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
502
Issue:
2
Page Range or eLocation-ID:
1797 to 1815
ISSN:
0035-8711
4. ABSTRACT We study the escape fraction of ionizing photons (fesc) in two cosmological zoom-in simulations of galaxies in the reionization era with halo mass Mhalo ∼ 1010 and $10^{11}\, \mathrm{ M}_{\odot }$ (stellar mass M* ∼ 107 and $10^9\, \mathrm{ M}_{\odot }$) at z = 5 from the Feedback in Realistic Environments project. These simulations explicitly resolve the formation of proto-globular clusters (GCs) self-consistently, where 17–39 per cent of stars form in bound clusters during starbursts. Using post-processing Monte Carlo radiative transfer calculations of ionizing radiation, we compute fesc from cluster stars and non-cluster stars formed during a starburst over ∼100 Myr in each galaxy. We findmore »
| 2022-08-16T18:44:44 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.737921953201294, "perplexity": 3889.343714702695}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-33/segments/1659882572515.15/warc/CC-MAIN-20220816181215-20220816211215-00399.warc.gz"}
|
https://www.zbmath.org/authors/?q=ai%3Amather.john-n
|
# zbMATH — the first resource for mathematics
## Mather, John N.
Compute Distance To:
Author ID: mather.john-n Published as: Mather, J.; Mather, J. N.; Mather, John; Mather, John N. External Links: MGP · Wikidata
Documents Indexed: 80 Publications since 1965
all top 5
#### Co-Authors
70 single-authored 2 Yau, Stephen Shing-Toung 1 Bott, Raoul Harry 1 Chaperon, Marc 1 Fathi, Albert 1 Fell, Harriet J. 1 Forni, Giovanni 1 Kaloshin, Vadim Yu. 1 Laudenbach, François 1 McGehee, Richard P. 1 McKean, Henry P. jun. 1 Nirenberg, Louis 1 Rabinowitz, Paul Henry 1 Valdinoci, Enrico
all top 5
#### Serials
9 Commentarii Mathematici Helvetici 5 Uspekhi Matematicheskikh Nauk [N. S.] 5 Ergodic Theory and Dynamical Systems 3 Publications Mathématiques 3 Topology 3 Annals of Mathematics. Second Series 2 Communications in Mathematical Physics 2 Advances in Mathematics 2 Annales de l’Institut Fourier 2 Bulletin of the American Mathematical Society 1 American Mathematical Monthly 1 Communications on Pure and Applied Mathematics 1 Bulletin de la Société Mathématique de France 1 Gazette des Mathématiciens 1 Inventiones Mathematicae 1 Mathematische Zeitschrift 1 Proceedings of the American Mathematical Society 1 Journal of the American Mathematical Society 1 Proceedings of the National Academy of Sciences of the United States of America 1 Bulletin of the American Mathematical Society. New Series 1 Notices of the American Mathematical Society 1 Boletim da Sociedade Brasileira de Matemática. Nova Série 1 Journal of Mathematical Sciences (New York) 1 Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, Série A 1 Nederlandse Akademie van Wetenschappen. Proceedings. Series A. Indagationes Mathematicae
all top 5
#### Fields
30 Dynamical systems and ergodic theory (37-XX) 29 Manifolds and cell complexes (57-XX) 29 Global analysis, analysis on manifolds (58-XX) 6 Mechanics of particles and systems (70-XX) 5 Algebraic geometry (14-XX) 5 Measure and integration (28-XX) 5 Algebraic topology (55-XX) 3 Several complex variables and analytic spaces (32-XX) 3 Differential geometry (53-XX) 3 General topology (54-XX) 2 History and biography (01-XX) 2 Group theory and generalizations (20-XX) 1 Real functions (26-XX) 1 Functions of a complex variable (30-XX) 1 Partial differential equations (35-XX) 1 Functional analysis (46-XX) 1 Calculus of variations and optimal control; optimization (49-XX)
#### Citations contained in zbMATH Open
69 Publications have been cited 1,954 times in 1,294 Documents Cited by Year
Action minimizing invariant measures for positive definite Lagrangian systems. Zbl 0696.58027
Mather, John N.
1991
Existence of quasi-periodic orbits for twist homeomorphisms of the annulus. Zbl 0506.58032
Mather, John N.
1982
Variational construction of connecting orbits. Zbl 0803.58019
Mather, John N.
1993
Stability of $$C^ \infty$$ mappings. III: Finitely determined map germs. Zbl 0159.25001
Mather, J. N.
1968
Stability of $$C^ \infty$$ mappings. V: Transversality. Zbl 0207.54303
Mather, J. N.
1970
Stability of $$C^\infty$$ mappings. II: Infinitesimal stability implies stability. Zbl 0177.26002
Mather, J. N.
1969
Stability of $$C^ \infty$$ mappings. IV: Classification of stable germs by R-algebras. Zbl 0202.55102
Mather, J. N.
1969
Stratifications and mappings. Zbl 0286.58003
Mather, John N.
1973
Stability of $$C^ \infty$$ mappings. I: The division theorem. Zbl 0159.24902
Mather, John N.
1968
Classification of isolated hypersurface singularities by their moduli algebras. Zbl 0499.32008
Mather, John N.; Yau, Stephen S.-T.
1982
Characterization of Anosov diffeomorphisms. Zbl 0165.57001
Mather, J. N.
1968
Notes on topological stability. Zbl 1260.57049
Mather, John
2012
A criterion for the non-existence of invariant circles. Zbl 0603.58028
Mather, John
1986
Generic projections. Zbl 0242.58001
Mather, John N.
1973
Commutators of diffeomorphisms. Zbl 0289.57014
Mather, John N.
1974
Action minimizing orbits in Hamiltonian systems. Zbl 0822.70011
Mather, John N.; Forni, Giovanni
1994
Non-existence of invariant circles. Zbl 0557.58019
Mather, John N.
1984
Glancing billiards. Zbl 0525.58021
Mather, John N.
1982
Variational construction of orbits of twist diffeomorphisms. Zbl 0737.58029
Mather, John N.
1991
Stability of $$C^ \infty$$-mappings. VI: The nice dimensions. Zbl 0211.56105
Mather, J. N.
1971
More Denjoy minimal sets for area preserving diffeomorphisms. Zbl 0597.58015
Mather, John N.
1985
Differentiable invariants. Zbl 0376.58002
Mather, John N.
1977
Differentiability of the minimal average action as a function of the rotation number. Zbl 0766.58033
Mather, John N.
1990
The vanishing of the homology of certain groups of homeomorphisms. Zbl 0207.21903
Mather, John N.
1971
Minimal measures. Zbl 0689.58025
Mather, John N.
1989
Integrability in codimension 1. Zbl 0284.57016
Mather, John N.
1973
Arnold diffusion. I: Announcement of results. Zbl 1069.37044
Mather, J. N.
2003
Destruction of invariant circles. Zbl 0688.58024
Mather, John N.
1988
Commutators of diffeomorphisms. II. Zbl 0299.58008
Mather, John N.
1975
How to stratify mappings and jet spaces. Zbl 0398.58008
Mather, John N.
1976
Solutions of the collinear four body problem which become unbounded in finite time. Zbl 0331.70005
Mather, J. N.; McGehee, R.
1975
On Thom-Boardman singularities. Zbl 0292.58004
Mather, John N.
1973
Examples of Aubry sets. Zbl 1090.37047
Mather, John N.
2004
Failure of convergence of the Lax-Oleinik semi-group in the time-periodic case. Zbl 0989.37035
Fathi, Albert; Mather, John N.
2000
Topological proofs of some purely topological consequences of Caratheodory’s theory of prime ends. Zbl 0506.57005
Mather, John N.
1982
Invariant subsets for area preserving homeomorphisms of surfaces. Zbl 0505.58027
Mather, John N.
1981
On Haefliger’s classifying space. I. Zbl 0224.55022
Mather, John N.
1971
Modulus of continuity for Peierls’s barrier. Zbl 0658.58013
Mather, John N.
1987
Commutators of diffeomorphisms. III: A group which is not perfect. Zbl 0575.58011
Mather, John N.
1985
Total disconnectedness of the quotient Aubry set in low dimensions. Zbl 1046.37039
Mather, John N.
2003
Arnold diffusion by variational methods. Zbl 1350.37067
Mather, John N.
2012
Amount of rotation about a point and the Morse index. Zbl 0558.58010
Mather, John N.
1984
Criterion for biholomorphic equivalence of isolated hypersurface singularities. Zbl 0477.32005
Mather, John N.; Yau, Stephen S.-T.
1981
On Nirenberg’s proof of Malgrange’s preparation theorem. Zbl 0211.56102
Mather, J. N.
1971
Invariance of the homology of a lattice. Zbl 0147.42102
Mather, J.
1966
Distance from a submanifold in euclidean space. Zbl 0519.58015
Mather, John N.
1983
On the homology of Haefliger’s classifying space. Zbl 0469.57021
Mather, John N.
1979
Simplicity of certain groups of diffeomorphisms. Zbl 0275.58007
Mather, John N.
1974
Instability of resonant totally elliptic points of symplectic maps in dimension 4. Zbl 1156.37313
Kaloshin, Vadim; Mather, John N.; Valdinoci, Enrico
2004
Minimal action measures for positive-definite Lagrangian systems. Zbl 0850.70195
Mather, John N.
1989
Non-uniqueness of solutions of Percival’s Euler-Lagrange equation. Zbl 0553.58011
Mather, John N.
1982
Solutions of generic linear equations. Zbl 0272.26008
Mather, John N.
1973
A curious remark concerning the geometric transfer map. Zbl 0535.58006
Mather, John N.
1984
Stable map-germs and algebraic geometry. Zbl 0217.04903
Mather, J. N.
1971
A property of compact, connected, laminated subsets of manifolds. Zbl 1079.37057
Mather, John N.
2002
Stratifications and mappings. Zbl 0253.58005
Mather, John N.
1972
Concavity of the Lagrangian for quasi-periodic orbits. Zbl 0508.58037
Mather, John N.
1982
Foliations and local homology of groups of diffeomorphisms. Zbl 0333.57015
Mather, John N.
1975
Structural stability of mappings. Zbl 0216.20801
Mather, J.
1968
Topics in topology and differential geometry. Zbl 0177.26001
Bott, Raoul; Mather, J.
1968
Order structure on action minimizing orbits. Zbl 1211.37076
Mather, John N.
2010
Dynamics of area preserving maps. Zbl 0674.58026
Mather, John N.
1987
Stability of $$C^\infty$$ mappings. V: Transversality. Zbl 0286.58006
Mather, John N.
1974
Stability of $$C^\infty$$ mappings. VI: The nice dimensions. Zbl 0286.58005
Mather, J. N.
1974
Characterization of stable mappings. Zbl 0167.51803
Mather, J. N.
1968
Area preserving twist homeomorphism of the annulus. Zbl 0414.57002
Mather, John N.
1979
Loops and foliations. Zbl 0309.57009
Mather, John N.
1975
Stability of $$C^ \infty$$ mappings. III: Finitely determined map germs. Zbl 0208.52001
Mather, J. N.
1970
Some non-finitely determined map-germs. Zbl 0187.20504
Mather, J. N.
1969
Notes on topological stability. Zbl 1260.57049
Mather, John
2012
Arnold diffusion by variational methods. Zbl 1350.37067
Mather, John N.
2012
Order structure on action minimizing orbits. Zbl 1211.37076
Mather, John N.
2010
Examples of Aubry sets. Zbl 1090.37047
Mather, John N.
2004
Instability of resonant totally elliptic points of symplectic maps in dimension 4. Zbl 1156.37313
Kaloshin, Vadim; Mather, John N.; Valdinoci, Enrico
2004
Arnold diffusion. I: Announcement of results. Zbl 1069.37044
Mather, J. N.
2003
Total disconnectedness of the quotient Aubry set in low dimensions. Zbl 1046.37039
Mather, John N.
2003
A property of compact, connected, laminated subsets of manifolds. Zbl 1079.37057
Mather, John N.
2002
Failure of convergence of the Lax-Oleinik semi-group in the time-periodic case. Zbl 0989.37035
Fathi, Albert; Mather, John N.
2000
Action minimizing orbits in Hamiltonian systems. Zbl 0822.70011
Mather, John N.; Forni, Giovanni
1994
Variational construction of connecting orbits. Zbl 0803.58019
Mather, John N.
1993
Action minimizing invariant measures for positive definite Lagrangian systems. Zbl 0696.58027
Mather, John N.
1991
Variational construction of orbits of twist diffeomorphisms. Zbl 0737.58029
Mather, John N.
1991
Differentiability of the minimal average action as a function of the rotation number. Zbl 0766.58033
Mather, John N.
1990
Minimal measures. Zbl 0689.58025
Mather, John N.
1989
Minimal action measures for positive-definite Lagrangian systems. Zbl 0850.70195
Mather, John N.
1989
Destruction of invariant circles. Zbl 0688.58024
Mather, John N.
1988
Modulus of continuity for Peierls’s barrier. Zbl 0658.58013
Mather, John N.
1987
Dynamics of area preserving maps. Zbl 0674.58026
Mather, John N.
1987
A criterion for the non-existence of invariant circles. Zbl 0603.58028
Mather, John
1986
More Denjoy minimal sets for area preserving diffeomorphisms. Zbl 0597.58015
Mather, John N.
1985
Commutators of diffeomorphisms. III: A group which is not perfect. Zbl 0575.58011
Mather, John N.
1985
Non-existence of invariant circles. Zbl 0557.58019
Mather, John N.
1984
Amount of rotation about a point and the Morse index. Zbl 0558.58010
Mather, John N.
1984
A curious remark concerning the geometric transfer map. Zbl 0535.58006
Mather, John N.
1984
Distance from a submanifold in euclidean space. Zbl 0519.58015
Mather, John N.
1983
Existence of quasi-periodic orbits for twist homeomorphisms of the annulus. Zbl 0506.58032
Mather, John N.
1982
Classification of isolated hypersurface singularities by their moduli algebras. Zbl 0499.32008
Mather, John N.; Yau, Stephen S.-T.
1982
Glancing billiards. Zbl 0525.58021
Mather, John N.
1982
Topological proofs of some purely topological consequences of Caratheodory’s theory of prime ends. Zbl 0506.57005
Mather, John N.
1982
Non-uniqueness of solutions of Percival’s Euler-Lagrange equation. Zbl 0553.58011
Mather, John N.
1982
Concavity of the Lagrangian for quasi-periodic orbits. Zbl 0508.58037
Mather, John N.
1982
Invariant subsets for area preserving homeomorphisms of surfaces. Zbl 0505.58027
Mather, John N.
1981
Criterion for biholomorphic equivalence of isolated hypersurface singularities. Zbl 0477.32005
Mather, John N.; Yau, Stephen S.-T.
1981
On the homology of Haefliger’s classifying space. Zbl 0469.57021
Mather, John N.
1979
Area preserving twist homeomorphism of the annulus. Zbl 0414.57002
Mather, John N.
1979
Differentiable invariants. Zbl 0376.58002
Mather, John N.
1977
How to stratify mappings and jet spaces. Zbl 0398.58008
Mather, John N.
1976
Commutators of diffeomorphisms. II. Zbl 0299.58008
Mather, John N.
1975
Solutions of the collinear four body problem which become unbounded in finite time. Zbl 0331.70005
Mather, J. N.; McGehee, R.
1975
Foliations and local homology of groups of diffeomorphisms. Zbl 0333.57015
Mather, John N.
1975
Loops and foliations. Zbl 0309.57009
Mather, John N.
1975
Commutators of diffeomorphisms. Zbl 0289.57014
Mather, John N.
1974
Simplicity of certain groups of diffeomorphisms. Zbl 0275.58007
Mather, John N.
1974
Stability of $$C^\infty$$ mappings. V: Transversality. Zbl 0286.58006
Mather, John N.
1974
Stability of $$C^\infty$$ mappings. VI: The nice dimensions. Zbl 0286.58005
Mather, J. N.
1974
Stratifications and mappings. Zbl 0286.58003
Mather, John N.
1973
Generic projections. Zbl 0242.58001
Mather, John N.
1973
Integrability in codimension 1. Zbl 0284.57016
Mather, John N.
1973
On Thom-Boardman singularities. Zbl 0292.58004
Mather, John N.
1973
Solutions of generic linear equations. Zbl 0272.26008
Mather, John N.
1973
Stratifications and mappings. Zbl 0253.58005
Mather, John N.
1972
Stability of $$C^ \infty$$-mappings. VI: The nice dimensions. Zbl 0211.56105
Mather, J. N.
1971
The vanishing of the homology of certain groups of homeomorphisms. Zbl 0207.21903
Mather, John N.
1971
On Haefliger’s classifying space. I. Zbl 0224.55022
Mather, John N.
1971
On Nirenberg’s proof of Malgrange’s preparation theorem. Zbl 0211.56102
Mather, J. N.
1971
Stable map-germs and algebraic geometry. Zbl 0217.04903
Mather, J. N.
1971
Stability of $$C^ \infty$$ mappings. V: Transversality. Zbl 0207.54303
Mather, J. N.
1970
Stability of $$C^ \infty$$ mappings. III: Finitely determined map germs. Zbl 0208.52001
Mather, J. N.
1970
Stability of $$C^\infty$$ mappings. II: Infinitesimal stability implies stability. Zbl 0177.26002
Mather, J. N.
1969
Stability of $$C^ \infty$$ mappings. IV: Classification of stable germs by R-algebras. Zbl 0202.55102
Mather, J. N.
1969
Some non-finitely determined map-germs. Zbl 0187.20504
Mather, J. N.
1969
Stability of $$C^ \infty$$ mappings. III: Finitely determined map germs. Zbl 0159.25001
Mather, J. N.
1968
Stability of $$C^ \infty$$ mappings. I: The division theorem. Zbl 0159.24902
Mather, John N.
1968
Characterization of Anosov diffeomorphisms. Zbl 0165.57001
Mather, J. N.
1968
Structural stability of mappings. Zbl 0216.20801
Mather, J.
1968
Topics in topology and differential geometry. Zbl 0177.26001
Bott, Raoul; Mather, J.
1968
Characterization of stable mappings. Zbl 0167.51803
Mather, J. N.
1968
Invariance of the homology of a lattice. Zbl 0147.42102
Mather, J.
1966
all top 5
#### Cited by 1,206 Authors
26 de la Llave, Rafael 16 Damon, James Norman 16 Mather, John N. 15 Yau, Stephen Shing-Toung 14 Izumiya, Shyuichi 14 MacKay, Robert Sinclair 14 Yan, Jun 13 Cheng, Chong-Qing 13 Cui, Xiaojun 13 Sorrentino, Alfonso 12 Cheng, Wei 11 Bernard, Patrick 11 Gomes, Diogo Luís Aguiar 11 Meiss, James D. 10 Arnaud, Marie-Claude 10 Kaloshin, Vadim Yu. 10 Rabinowitz, Paul Henry 10 Soares Ruas, Maria Aparecida 10 Wang, Kaizhi 9 Bruce, James William 9 Rybicki, Tomasz 9 Valdinoci, Enrico 9 Wall, Charles Terence Clegg 8 Barreira, Luis Manuel 8 Bessi, Ugo 8 Celletti, Alessandra 8 Fathi, Albert 8 Isaev, Alexander 8 Ishikawa, Goo 8 Iturriaga, Renato 8 Mitake, Hiroyoshi 8 Saeki, Osamu 8 Valls Anglés, Cláudia 7 Bangert, Victor 7 Li, Xia 7 Nishimura, Takashi 7 Pei, Donghe 7 Qin, Wenxin 7 Sánchez-Morgado, Héctor 7 Tran Vinh Hung 7 Trotman, David John Angelo 6 Berger, Pierre 6 Bialy, Misha 6 Chierchia, Luigi 6 Delshams, Amadeu 6 Dragičević, Davor 6 Gaffney, Terence 6 Gidea, Marian 6 Greenberg, Peter 6 Greuel, Gert-Martin 6 Koropecki, Andres 6 Massart, Daniel 6 Michor, Peter Wolfram 6 Moser, Jürgen K. 6 M-Seara, Tere 6 Shiota, Masahiro 6 Wang, Yanan 6 Zuo, Huaiqing 5 Bernardi, Olga 5 Chen, Hao 5 Chen, Qinbo 5 Contreras, Gonzalo 5 Dias Carneiro, Mario Jorge 5 Dubois, Jean-Guy 5 Franks, John M. 5 Fukuda, Takuo 5 Goresky, Robert Mark 5 Gutkin, Eugene 5 Handel, Michael 5 Haro, Àlex 5 Ishii, Hitoshi 5 Le Calvez, Patrice 5 Lopes, Artur Oscar 5 Marò, Stefano 5 Mond, David Michael Quentin 5 Paternain, Gabriel Pedro 5 Pnevmatikos, Spyros N. 5 Su, Xifeng 5 Thieullen, Philippe 5 Wang, Lin 5 Wang, Lin 5 Zhang, Jianlu 4 Ando, Yoshifumi 4 Baesens, Claude 4 Bierstone, Edward 4 Bolotin, Sergeĭ Vladimirovich 4 Boyland, Philip L. 4 Cannarsa, Piermarco 4 Cardin, Franco 4 du Plessis, Andrew Allan 4 Dufour, Jean-Paul 4 Figalli, Alessio 4 Fuchs, Dmitry Borisovich 4 Fukui, Kazuhiko 4 Galligo, André 4 Golubitsky, Martin A. 4 Guzzo, Massimiliano 4 Hauser, Herwig 4 Knill, Oliver 4 Latushkin, Yuri ...and 1,106 more Authors
all top 5
#### Cited in 245 Serials
49 Communications in Mathematical Physics 49 Journal of Differential Equations 41 Inventiones Mathematicae 41 Transactions of the American Mathematical Society 39 Annales de l’Institut Fourier 38 Physica D 34 Topology and its Applications 34 Ergodic Theory and Dynamical Systems 29 Advances in Mathematics 29 Proceedings of the American Mathematical Society 27 Mathematische Annalen 24 Mathematische Zeitschrift 23 Compositio Mathematica 19 Duke Mathematical Journal 17 Journal of Statistical Physics 17 Geometry & Topology 16 Calculus of Variations and Partial Differential Equations 15 Journal of Mathematical Analysis and Applications 14 Mathematical Proceedings of the Cambridge Philosophical Society 14 Annales Scientifiques de l’École Normale Supérieure. Quatrième Série 14 Geometriae Dedicata 14 Publications Mathématiques 14 Discrete and Continuous Dynamical Systems 13 Israel Journal of Mathematics 13 Manuscripta Mathematica 13 Annales de l’Institut Henri Poincaré. Analyse Non Linéaire 13 Bulletin of the American Mathematical Society 12 Journal of Geometry and Physics 12 Journal of Pure and Applied Algebra 12 Chaos 11 Annali di Matematica Pura ed Applicata. Serie Quarta 11 Science China. Mathematics 10 Boletim da Sociedade Brasileira de Matemática 10 Journal of Algebra 10 Regular and Chaotic Dynamics 9 Communications on Pure and Applied Mathematics 9 Nonlinearity 9 Functional Analysis and its Applications 9 Journal of Functional Analysis 9 Science in China. Series A 9 Differential Geometry and its Applications 8 Journal of Mathematical Physics 8 Geometric and Functional Analysis. GAFA 8 Boletim da Sociedade Brasileira de Matemática. Nova Série 8 Algebraic & Geometric Topology 8 Bulletin of the Brazilian Mathematical Society. New Series 7 Archive for Rational Mechanics and Analysis 7 Proceedings of the Japan Academy. Series A 7 Annals of Global Analysis and Geometry 7 Communications in Partial Differential Equations 7 Bulletin of the American Mathematical Society. New Series 7 Acta Mathematica Sinica. English Series 7 Comptes Rendus. Mathématique. Académie des Sciences, Paris 6 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 6 Journal of Mathematical Sciences (New York) 6 Annales Henri Poincaré 5 Communications in Algebra 5 ZAMP. Zeitschrift für angewandte Mathematik und Physik 5 Journal of the Mathematical Society of Japan 5 Kodai Mathematical Journal 5 Memoirs of the American Mathematical Society 5 Publications of the Research Institute for Mathematical Sciences, Kyoto University 5 Tohoku Mathematical Journal. Second Series 5 Chinese Annals of Mathematics. Series B 5 International Journal of Mathematics 5 Journal of Dynamics and Differential Equations 5 Journal of Nonlinear Science 5 Annals of Mathematics. Second Series 5 Advanced Nonlinear Studies 4 Journal d’Analyse Mathématique 4 Acta Mathematica 4 Annales de l’Institut Henri Poincaré. Nouvelle Série. Section A. Physique Théorique 4 Journal of Mathematical Economics 4 Journal of Soviet Mathematics 4 The Journal of Geometric Analysis 4 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 4 NoDEA. Nonlinear Differential Equations and Applications 4 European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations 4 Journal of the European Mathematical Society (JEMS) 4 Qualitative Theory of Dynamical Systems 4 Proceedings of the Steklov Institute of Mathematics 4 Journal of Topology and Analysis 4 Journal of Singularities 3 Letters in Mathematical Physics 3 Mathematical Notes 3 Mathematics of Computation 3 Chaos, Solitons and Fractals 3 Bulletin de la Société Mathématique de France 3 Cahiers de Topologie et Géométrie Différentielle Catégoriques 3 Monatshefte für Mathematik 3 Rendiconti del Seminario Matematico della Università di Padova 3 Discrete & Computational Geometry 3 Journal of the American Mathematical Society 3 Journal de Mathématiques Pures et Appliquées. Neuvième Série 3 Acta Mathematica Sinica. New Series 3 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 3 Experimental Mathematics 3 St. Petersburg Mathematical Journal 3 Bulletin des Sciences Mathématiques 3 Electronic Research Announcements of the American Mathematical Society ...and 145 more Serials
all top 5
#### Cited in 59 Fields
546 Dynamical systems and ergodic theory (37-XX) 320 Global analysis, analysis on manifolds (58-XX) 246 Manifolds and cell complexes (57-XX) 171 Several complex variables and analytic spaces (32-XX) 151 Algebraic geometry (14-XX) 143 Mechanics of particles and systems (70-XX) 141 Differential geometry (53-XX) 116 Partial differential equations (35-XX) 75 Ordinary differential equations (34-XX) 71 Calculus of variations and optimal control; optimization (49-XX) 47 Algebraic topology (55-XX) 35 Statistical mechanics, structure of matter (82-XX) 31 Operator theory (47-XX) 30 Commutative algebra (13-XX) 29 Group theory and generalizations (20-XX) 29 General topology (54-XX) 28 Quantum theory (81-XX) 27 Topological groups, Lie groups (22-XX) 20 Real functions (26-XX) 19 Functional analysis (46-XX) 18 Measure and integration (28-XX) 16 Numerical analysis (65-XX) 15 Probability theory and stochastic processes (60-XX) 14 Nonassociative rings and algebras (17-XX) 13 Category theory; homological algebra (18-XX) 13 Computer science (68-XX) 12 Mechanics of deformable solids (74-XX) 12 Fluid mechanics (76-XX) 12 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 10 Convex and discrete geometry (52-XX) 9 Combinatorics (05-XX) 9 Linear and multilinear algebra; matrix theory (15-XX) 9 Associative rings and algebras (16-XX) 8 History and biography (01-XX) 8 Operations research, mathematical programming (90-XX) 7 Functions of a complex variable (30-XX) 7 Difference and functional equations (39-XX) 7 Optics, electromagnetic theory (78-XX) 7 Systems theory; control (93-XX) 6 Order, lattices, ordered algebraic structures (06-XX) 6 Number theory (11-XX) 5 Mathematical logic and foundations (03-XX) 5 Abstract harmonic analysis (43-XX) 5 Relativity and gravitational theory (83-XX) 5 Biology and other natural sciences (92-XX) 4 $$K$$-theory (19-XX) 4 Geometry (51-XX) 3 Approximations and expansions (41-XX) 2 Harmonic analysis on Euclidean spaces (42-XX) 2 Classical thermodynamics, heat transfer (80-XX) 2 Astronomy and astrophysics (85-XX) 1 General and overarching topics; collections (00-XX) 1 Field theory and polynomials (12-XX) 1 Potential theory (31-XX) 1 Special functions (33-XX) 1 Integral equations (45-XX) 1 Statistics (62-XX) 1 Geophysics (86-XX) 1 Information and communication theory, circuits (94-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-05-08T08:46:45 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5832871198654175, "perplexity": 4841.941424502144}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-21/segments/1620243988850.21/warc/CC-MAIN-20210508061546-20210508091546-00124.warc.gz"}
|
https://zbmath.org/authors/?q=ai:minsky.marvin-l
|
## Minsky, Marvin Lee
Compute Distance To:
Author ID: minsky.marvin-l Published as: Minsky, M.; Minsky, Marvin L.; Minsky, M. L.; Minsky, Marvin more...less External Links: MGP · Wikidata · dblp · GND · IdRef Awards: Turing Award (1969)
Documents Indexed: 16 Publications since 1956, including 9 Books 1 Further Contribution Co-Authors: 11 Co-Authors with 7 Joint Publications 76 Co-Co-Authors
all top 5
### Co-Authors
9 single-authored 5 Papert, Seymour Aubrey 1 Ashby, William Ross 1 Brown, Richard Henry 1 Cocke, John 1 Culbertson, James T. 1 de Kleer, Johan 1 deLeeuw, Karel 1 Fahlman, Scott E. 1 Goldstein, I. P. 1 Kleene, Stephen Cole 1 Mackay, D. M. 1 Marcus, Mitchell P. 1 McCarthy, John 1 Miller, Matt L. 1 Moore, Edward F. 1 Rich, Charles 1 Shannon, Claude Elwood 1 Shrobe, Howard E. 1 Sidner, Candace L. 1 Stallman, Richard M. 1 Stansfield, J. L. 1 Steele, Guy Lewis jun. 1 Sussman, Gerald Jay 1 Uttley, Albert M. 1 von Neumann, John 1 Winston, Patrick Henry
### Serials
3 Journal of the Association for Computing Machinery 1 International Journal of Theoretical Physics 1 Annals of Mathematics. Second Series 1 Annals of Mathematics Studies
all top 5
### Fields
8 Computer science (68-XX) 3 Mathematical logic and foundations (03-XX) 2 General and overarching topics; collections (00-XX) 1 Mechanics of particles and systems (70-XX) 1 Quantum theory (81-XX) 1 Relativity and gravitational theory (83-XX)
### Citations contained in zbMATH Open
16 Publications have been cited 1,087 times in 1,025 Documents Cited by Year
Computation: finite and infinite machines. Zbl 0195.02402
Minsky, Marvin L.
1967
Perceptrons. An introduction to computational geometry. Zbl 0197.43702
Minsky, M.; Papert, S.
1969
Recursive unsolvability of Post’s problem of ”Tag” und other topics in theory of Turing machines. Zbl 0105.00802
Minsky, Marvin L.
1961
Perceptrons. expanded ed. Zbl 0794.68104
Minsky, Marvin L.; Papert, Seymour A.
1988
Size and structure of universal Turing machines using Tag systems. Zbl 0192.06601
Minsky, M. L.
1962
Unrecognizable sets of numbers. Zbl 0166.00601
Minsky, M.; Papert, S.
1966
Automata studies. Zbl 0074.11204
Kleene, S. C.; von Neumann, J.; Culbertson, James T.; Minsky, M. L.; Moore, Edward F.; Shannon, Claude E.; McCarthy, John; Davis, M. D.; de Leeuw, K.; Shapiro, N.; Ashby, W. Ross; MacKay, D. M.; Uttley, Albert M.
1956
Universality of Tag systems with $$P = 2$$. Zbl 0149.12405
Cocke, J.; Minsky, M.
1964
Semantic information processing. Zbl 0187.13301
Minsky, M.
1968
Problems of formulation for artificial intelligence. Zbl 0116.11803
Minsky, M. L.
1962
Form and content in computer science (1970 ACM Turing lecture). Zbl 0195.17701
Minsky, Marvin
1970
Linearly unrecognizable patterns. Zbl 0183.22204
Minsky, M.; Papert, S.
1967
Berechnungen und Automaten. Zbl 0214.26101
Minsky, M. L.
1971
Berechnung: Endliche und unendliche Maschinen. (Computation: Finite and infinite machines). Aus dem Amerikanischen übersetzt von Werner von Grünau, unter Mitwirkung von Michael von Grünau. Zbl 0222.02033
Minsky, Marvin L.
1971
Artificial intelligence: an MIT perspective. Vol. 1: Expert problem solving; natural language understanding; intelligent computer coaches; representation and learning. Zbl 0495.68079
1979
Cellular vacuum. Zbl 0497.68028
Minsky, Marvin
1982
Perceptrons. expanded ed. Zbl 0794.68104
Minsky, Marvin L.; Papert, Seymour A.
1988
Cellular vacuum. Zbl 0497.68028
Minsky, Marvin
1982
Artificial intelligence: an MIT perspective. Vol. 1: Expert problem solving; natural language understanding; intelligent computer coaches; representation and learning. Zbl 0495.68079
1979
Berechnungen und Automaten. Zbl 0214.26101
Minsky, M. L.
1971
Berechnung: Endliche und unendliche Maschinen. (Computation: Finite and infinite machines). Aus dem Amerikanischen übersetzt von Werner von Grünau, unter Mitwirkung von Michael von Grünau. Zbl 0222.02033
Minsky, Marvin L.
1971
Form and content in computer science (1970 ACM Turing lecture). Zbl 0195.17701
Minsky, Marvin
1970
Perceptrons. An introduction to computational geometry. Zbl 0197.43702
Minsky, M.; Papert, S.
1969
Semantic information processing. Zbl 0187.13301
Minsky, M.
1968
Computation: finite and infinite machines. Zbl 0195.02402
Minsky, Marvin L.
1967
Linearly unrecognizable patterns. Zbl 0183.22204
Minsky, M.; Papert, S.
1967
Unrecognizable sets of numbers. Zbl 0166.00601
Minsky, M.; Papert, S.
1966
Universality of Tag systems with $$P = 2$$. Zbl 0149.12405
Cocke, J.; Minsky, M.
1964
Size and structure of universal Turing machines using Tag systems. Zbl 0192.06601
Minsky, M. L.
1962
Problems of formulation for artificial intelligence. Zbl 0116.11803
Minsky, M. L.
1962
Recursive unsolvability of Post’s problem of ”Tag” und other topics in theory of Turing machines. Zbl 0105.00802
Minsky, Marvin L.
1961
Automata studies. Zbl 0074.11204
Kleene, S. C.; von Neumann, J.; Culbertson, James T.; Minsky, M. L.; Moore, Edward F.; Shannon, Claude E.; McCarthy, John; Davis, M. D.; de Leeuw, K.; Shapiro, N.; Ashby, W. Ross; MacKay, D. M.; Uttley, Albert M.
1956
all top 5
### Cited by 1,422 Authors
50 Ibarra, Oscar H. 27 Pan, Linqiang 17 Freund, Rudolf 16 Alhazov, Artiom 16 Verlan, Sergey 15 Păun, Gheorghe 13 Margenstern, Maurice 13 Păun, Andrei 13 Zeng, Xiangxiang 11 Busi, Nadia 10 Dang, Zhe 10 Sherstov, Alexander A. 10 Zavattaro, Gianluigi 9 Demri, Stéphane P. 9 Song, Bosheng 8 Pérez-Jiménez, Mario J. 8 Sangnier, Arnaud 8 Servedio, Rocco A. 8 Sosík, Petr 7 Bozzelli, Laura 7 Cienciala, Luděk 7 Ciencialová, Lucie 7 Kanovich, Max Iosifovich 7 McQuillan, Ian 7 Oswald, Marion 7 Rogozhin, Yurii 7 Rosier, Louis E. 7 Yen, Hsuchun 6 Börger, Egon 6 Csuhaj-Varjú, Erzsébet 6 Leporati, Alberto 6 Peron, Adriano 6 Rodríguez-Patón, Alfonso 6 Wu, Tingfang 5 André, Étienne 5 Bouyer, Patricia 5 Bun, Mark 5 Cabessa, Jérémie 5 Finkel, Alain 5 Frisco, Pierluigi 5 Gorrieri, Roberto 5 Hoogeboom, Hendrik Jan 5 Ivanov, Sergiu 5 Kari, Lila 5 Krishna, Shankara Narayanan 5 Marchenkov, Sergeĭ Serafimovich 5 Mauduit, Christian 5 O’Donnell, Ryan 5 Raskin, Jean-François 5 Srba, Jiří 5 Su, Jianwen 5 Thaler, Justin 4 Albin, Peter S. 4 Boker, Udi 4 Ciobanu, Gabriel 4 Crutchfield, James P. 4 Ehrenfeucht, Andrzej 4 Eremondi, Joey 4 Goles Chacc, Eric 4 Jiang, Suxia 4 La Torre, Salvatore 4 Lime, Didier 4 Martínez, Genaro J. 4 Matiyasevich, Yuriĭ Vladimirovich 4 Mauri, Giancarlo 4 Mayr, Richard M. 4 Mazowiecki, Filip 4 Mitrana, Victor 4 Montanari, Angelo 4 Mycielski, Jan 4 Podol’skiĭ, Vladimir Vladimirovich 4 Potapov, Igor 4 Song, Tao 4 Takimoto, Eiji 4 Uchizawa, Kei 4 Wolfram, Stephen 4 Zandron, Claudio 4 Zhang, Xingyi 4 Zhang, Zhiqiang 3 Aanderaa, Stål Olav 3 Abdulla, Parosh Aziz 3 Abelson, Harold 3 Adamatzky, Andrew I. 3 Amaldi, Edoardo 3 Angluin, Dana 3 Anthony, Martin H. G. 3 Aspnes, James 3 Bergstra, Jan A. 3 Cabarle, Francis George C. 3 Cazzaniga, Paolo 3 Chatterjee, Krishnendu 3 Culik, Karel II 3 De Mol, Liesbeth 3 Dershowitz, Nachum 3 Egecioglu, Omer 3 Fernau, Henning 3 Ferretti, Claudio 3 Gheorghe, Marian 3 Ginsburg, Seymour 3 Gurari, Eitan M. ...and 1,322 more Authors
all top 5
### Cited in 198 Serials
182 Theoretical Computer Science 43 Journal of Computer and System Sciences 38 Information and Computation 31 International Journal of Foundations of Computer Science 21 Information Processing Letters 20 Natural Computing 18 Acta Informatica 17 Mathematical Systems Theory 17 Neural Computation 16 The Journal of Symbolic Logic 15 Artificial Intelligence 15 Information Sciences 11 Physica D 11 MSCS. Mathematical Structures in Computer Science 11 International Journal of Computer Mathematics 10 Mathematical Social Sciences 10 Neural Networks 10 Journal of Membrane Computing 9 Discrete Applied Mathematics 8 Biological Cybernetics 8 Mathematical Biosciences 8 Applied Mathematics and Computation 8 Annals of Pure and Applied Logic 8 Pattern Recognition 8 Theory of Computing Systems 7 Archiv für Mathematische Logik und Grundlagenforschung 7 Journal of Mathematical Psychology 7 Journal of Soviet Mathematics 7 SIAM Journal on Computing 7 Logical Methods in Computer Science 6 Discrete Mathematics 6 Journal of Pure and Applied Algebra 6 Machine Learning 5 European Journal of Operational Research 5 Formal Methods in System Design 5 Journal of Mathematical Sciences (New York) 5 RAIRO. Theoretical Informatics and Applications 4 Journal of Statistical Physics 4 Physics Letters. A 4 Journal of Algebra 4 Journal of Number Theory 4 Proceedings of the American Mathematical Society 4 Programming and Computer Software 4 Transactions of the American Mathematical Society 4 Combinatorica 4 New Generation Computing 4 Journal of Automated Reasoning 4 Mathematical and Computer Modelling 4 Bulletin of the American Mathematical Society. New Series 4 Distributed Computing 4 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 4 Journal of Applied Non-Classical Logics 4 Journal de Théorie des Nombres de Bordeaux 4 The Bulletin of Symbolic Logic 4 Annals of Mathematics and Artificial Intelligence 4 Fundamenta Informaticae 4 ACM Transactions on Computational Logic 3 Computers & Mathematics with Applications 3 International Journal of General Systems 3 International Journal of Systems Science 3 Journal of the Franklin Institute 3 Bulletin of Mathematical Biology 3 Kybernetes 3 Moscow University Computational Mathematics and Cybernetics 3 Advances in Applied Mathematics 3 Journal of Complexity 3 International Journal of Intelligent Systems 3 International Journal of Approximate Reasoning 3 Mathematical Logic Quarterly (MLQ) 3 Journal of Computational Neuroscience 2 International Journal of Theoretical Physics 2 Problems of Information Transmission 2 The Mathematical Intelligencer 2 Algebra and Logic 2 Automatica 2 Fuzzy Sets and Systems 2 International Journal of Computer & Information Sciences 2 Journal of Approximation Theory 2 Studia Logica 2 Theory and Decision 2 Computers & Operations Research 2 Journal of Economic Dynamics & Control 2 Linear Algebra and its Applications 2 RAIRO. Informatique Théorique et Applications 2 Journal of Mathematical Imaging and Vision 2 Cybernetics and Systems Analysis 2 Computational Complexity 2 Doklady Mathematics 2 Soft Computing 2 Journal of the ACM 2 Data Mining and Knowledge Discovery 2 International Journal of Modern Physics C 2 Journal of Applied Logic 2 Bulletin of the American Mathematical Society 2 Proceedings of the Steklov Institute of Mathematics 2 Advances in Data Analysis and Classification. ADAC 2 Journal of Cellular Automata 2 Studies in History and Philosophy of Science. Part B. Studies in History and Philosophy of Modern Physics 2 Journal of Logical and Algebraic Methods in Programming 1 Communications in Mathematical Physics ...and 98 more Serials
all top 5
### Cited in 47 Fields
835 Computer science (68-XX) 186 Mathematical logic and foundations (03-XX) 78 Biology and other natural sciences (92-XX) 54 Information and communication theory, circuits (94-XX) 45 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 31 Number theory (11-XX) 30 Dynamical systems and ergodic theory (37-XX) 22 Statistics (62-XX) 19 Operations research, mathematical programming (90-XX) 18 Combinatorics (05-XX) 18 Systems theory; control (93-XX) 17 Group theory and generalizations (20-XX) 14 Numerical analysis (65-XX) 13 Order, lattices, ordered algebraic structures (06-XX) 13 Quantum theory (81-XX) 10 History and biography (01-XX) 10 Probability theory and stochastic processes (60-XX) 10 Statistical mechanics, structure of matter (82-XX) 8 Convex and discrete geometry (52-XX) 6 General algebraic systems (08-XX) 6 Approximations and expansions (41-XX) 4 Linear and multilinear algebra; matrix theory (15-XX) 4 Category theory; homological algebra (18-XX) 4 Fluid mechanics (76-XX) 3 General and overarching topics; collections (00-XX) 3 Commutative algebra (13-XX) 3 Nonassociative rings and algebras (17-XX) 3 Functions of a complex variable (30-XX) 3 Partial differential equations (35-XX) 3 Algebraic topology (55-XX) 3 Manifolds and cell complexes (57-XX) 3 Mechanics of deformable solids (74-XX) 2 Associative rings and algebras (16-XX) 2 Real functions (26-XX) 2 Measure and integration (28-XX) 2 Ordinary differential equations (34-XX) 2 Harmonic analysis on Euclidean spaces (42-XX) 2 Geometry (51-XX) 2 General topology (54-XX) 2 Mechanics of particles and systems (70-XX) 2 Classical thermodynamics, heat transfer (80-XX) 2 Astronomy and astrophysics (85-XX) 1 Integral equations (45-XX) 1 Functional analysis (46-XX) 1 Global analysis, analysis on manifolds (58-XX) 1 Optics, electromagnetic theory (78-XX) 1 Relativity and gravitational theory (83-XX)
### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2022-09-25T02:50:44 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.43999654054641724, "perplexity": 11825.454761534724}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-40/segments/1664030334332.96/warc/CC-MAIN-20220925004536-20220925034536-00660.warc.gz"}
|
https://ikariam.fandom.com/wiki/Building:Stonemason
|
## FANDOM
2,054 Pages
Stonemason
Function:
Increases production
Requirements:
Research: Improved Resource Gathering ()
Expansion requirements:
and
Use requirements:
Have workers in the Quarry
## Description
A trained stonemason always quarries the right blocks of marble with his strong arms. He breaks less and our builders always have the material they need.
Note:
• Every level of the Stonemason increases Marble production by 2% per expansion (only in the town it is built).
## Expansion Details
The time (in seconds) it takes to upgrade to the next level is determined by the following formula: ${ \text{Building time (seconds)} = \left \lbrack \cfrac{72,000}{11} \times 1.1^\text{Level} - 6,120\right \rbrack }$
The accumulative time (in seconds) it takes to upgrade up to the next level is determined by the following formula: ${ \text{Accumulative building time (seconds)} = \left \lbrack 72,000 \times \left (\ 1.1^\text{Level} -\ 1\ \right ) - 6,120 \times \text{Level}\right \rbrack}$
## Other Production Buildings
Community content is available under CC-BY-SA unless otherwise noted.
| 2020-09-29T04:46:51 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.49664565920829773, "perplexity": 4624.2202120402335}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-40/segments/1600401624636.80/warc/CC-MAIN-20200929025239-20200929055239-00497.warc.gz"}
|
https://gea.esac.esa.int/archive/documentation/GDR2/Catalogue_consolidation/chap_cu9val_cu9val/sec_cu9val_947/ssec_cu9val_947_bprp947.html
|
# 10.6.2 Photometry: BP, RP magnitudes
We assess the quality of the $G_{\rm BP}$, $G_{\rm RP}$ photometry by estimating the width of the sequence in the CMD of clusters with secure membership. A downside of having to rely on secure membership means that it is difficult to provide diagnostics for stars fainter than $G\sim 18$, as the astrometry (and thus our ability to tell cluster stars apart from field stars) strongly decreases in quality at that magnitude.
To avoid differential reddening artificially increasing the width of the sequence, we limited our diagnostics to clusters with little extinction variations across the field (e.g., Figure 10.47). We use a LOWESS fitting to follow the sequence, and remove binary stars and stars deviating from the main sequence by clipping out sources with $G_{\rm BP}$ fluxes two error bars lower and $G_{\rm RP}$ fluxes higher than the fitted relation.
We obtain very clean sequences for all the OCs. An illustration is shown Figure 10.48 for NGC 2682. The typical dispersion in both $G_{\rm BP}$ and $G_{\rm RP}$ is of the order of 0.02 mag. Scaling the difference to the fitted relation by the individual error bars of each star we find a dispersion of, on the average, 1.7 for $G_{\rm BP}$ and 2 for $G_{\rm RP}$, suggesting that the errors on magnitudes in both filters tend to be underestimated. By limiting the sample to stars well below the turn off, those numbers decrease to 1.3 and 1.5, respectively. The turnoff region is affected by evolutive effects and might have the presence of rapidly rotating stars.
In all cases, the dispersion in units of nominal errors always appears slightly larger in the $G_{\rm RP}$ filter than in $G_{\rm BP}$.
| 2019-03-19T19:15:39 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 14, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.47928333282470703, "perplexity": 1100.7371096040688}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-13/segments/1552912202125.41/warc/CC-MAIN-20190319183735-20190319205735-00010.warc.gz"}
|
http://indico.vecc.gov.in/confAuthorIndex.py%3Fview=full&letter=s&confId=1.html
|
# ICPAQGP-2010
5-10 December 2010
6th International Conference on Physics and Astrophysics of Quark Gluon Plasma (ICPAQGP 2010)
Home > Author Index
Display options View mode use contribution ids and titlesuse contribution ids
Authors a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | [all] SAHA, Prosenjit 18-Searching for Ring-like and Jet-like substructure in 24Mg-Ag/Br interactions at 4.5 A GeV SAHOO, Gourishankar 57-Simulation of some astrophysical processes in the laboratory using plasma gun95-Simulation of magnetic stroms generated from solar flares in a laboratory set up SAHOO, NIHAR RANJAN 45-Probing the QCD Critical Point by Higher Moments of Net-Charge Distribution SAHOO, Raghunath 87-QGP Phase Boundary and Plasma Lifetime From Thermal Properties of $\phi$ Mesons SAHU, Pradip Kumar 146-Nuclear matter and neutron star matter with quark gluon phase transition in the effective chiral model147-Infuence of symmetry energy on protons flow in Pb + Pb collisions at 40 $A$.GeV energy SAMANTARAY, Subrat 95-Simulation of magnetic stroms generated from solar flares in a laboratory set up SAMANTARAY, Subrat 57-Simulation of some astrophysical processes in the laboratory using plasma gun SANDHIR, Radha Pyari 138-Fuzzy Clustering for High Energy Physics Data SANJAY K. GHOSH, Sanjay 40-QCD phase diagram using PNJL model with eight-quark interactions SANYASI, Amuya 57-Simulation of some astrophysical processes in the laboratory using plasma gun SARKAR, Anjishnu 49-CP violation from QCD Z (3) domains SARKAR, sourav 106-The rho meson in hot hadronic matter and low mass dilepton spectra107-Nucleon propagation in hot and dense nuclear matter SARKAR, Sreemoyee 39-Energy and momentum relaxation of heavy fermion in dense and warm plasma SARMA, Jayanta 16-Unpolarized and polarized Gluon Distribution Functions in Leading Order and Next-to-Leading Order at small-x SASINI, Narayan Chandra 57-Simulation of some astrophysical processes in the laboratory using plasma gun SASINI, Narayan 95-Simulation of magnetic stroms generated from solar flares in a laboratory set up SCHRAMM, Stefan 21-Hot and dense matter in quark-hadron models SEIXAS, Joao 129-Observation of Long-Range, Near-Side Angular Correlations in Proton-Proton Collisions at the LHC SENYUKOV, Serhiy 72-Reconstruction of Ds mesons in the ALICE Experiment at LHC SHAH, Neha 50-The experimental study of pp eta dynamics with WASA-at-COSY SHARMA, Monika 34-Estimation of viscosity based on transverse momentum correlations SHARMA, Natasha 98-PRODUCTION OF ANTINUCLEI IN pp COLLISIONS AT $\sqrt{s}$ = 7 TeV WITH ALICE AT LHC SHARMA, RAKESH 66-EFFECT OF DARK MATTER PARAMETERS ON INTERACTION AND STRUCTURE FORMATION SHARMA, Sayantan 140-Towards faster computation of higher order quark number susceptibilities in QCD SHI, Shusu 101-The elliptic flow of Multi-strange hadrons in sqrt{s_{NN}} = 200 GeV Au + Au collisions at STAR SHOUGAIJAM, somorendro singh 82-PHOTON RADIATION AT FINITE BARYONIC QUARK-GLUON PLASMA128-Nucleation rate of Quark-Gluon-Plasma at small finite chemical potential SHUKLA, Prashant 121-$K^*$ meson production in $p+p$ and $d$+Au collisions at $\sqrt s_{NN}$ = 200 GeV with PHENIX experiment at RHIC109-Meson spectra and $m_T$ scaling in pp, dAu and Au Au collisions at $\sqrt s_{NN}$ = 200 GeV122-$J/\psi$ enhancement in heavy ion collisions: Statistical and kinetic approach SHUKLA, Prashant 102-Dimuon Mass Continuum in Pb Pb collisions at $\sqrt(s_{NN})$=2.76 TeV SHUKLA, Praveen Prakash 79-some aspects of multiparticle production in 4.5 GeV 12C-nucleus interactions80-Effect of grey particles multiplicity on cluster size in 4.5GeV 12C-nucleus collisions SIMONETTO, franco 154-Upsilon production cross section in pp collisions at sqrt(s) = 7 TeV SINGH, B.K. 114-Performance studies of the PHENIX Hadron Blind Detector at RHIC SINGH, Bhartendu Kumar 59-Di-muon measurements in CBM experiment at FAIR SINGH, C. P. 12-On Locating the Critical End Point in the QCD Phase Diagram25-A New Equation of State for a Hot Hadronic Matter SINGH, Lakhwinder 62-Probing Physics beyond the Standard Model with Reactor Neutrinos SINGH, M.K. 62-Probing Physics beyond the Standard Model with Reactor Neutrinos SINGH, Manoj 9-Target Fragmentation in Interaction of 84Kr at Relativistic Energy SINGH, prithipal 79-some aspects of multiparticle production in 4.5 GeV 12C-nucleus interactions80-Effect of grey particles multiplicity on cluster size in 4.5GeV 12C-nucleus collisions SINGH, Raghavendra 57-Simulation of some astrophysical processes in the laboratory using plasma gun SINGH, S 65-A Phenomenological Quark-Gluon Density of States and its Implications for QGP-Hadron Phase Properties SINGH, V. 62-Probing Physics beyond the Standard Model with Reactor Neutrinos SINGH, Venktesh 109-Meson spectra and $m_T$ scaling in pp, dAu and Au Au collisions at $\sqrt s_{NN}$ = 200 GeV SINGH, Venktesh 9-Target Fragmentation in Interaction of 84Kr at Relativistic Energy SINGHA, Subhash 30-Energy dependence of anti-proton/proton ratio in p+p collisions SLODKOWSKI, Marcin 155-Status and future perspective of the NA61/SHINE experiment SOMA, A.K. 62-Probing Physics beyond the Standard Model with Reactor Neutrinos SRIVASTAVA, Ajit 133-Using CMBR analysis tools for flow anisotropies in relativistic heavy-ion collisions SRIVASTAVA, Ajit M. 49-CP violation from QCD Z (3) domains77-Effect of quarks on the formation and evolution of Z(3) walls and strings in relativistic heavy-ion collisions SRIVASTAVA, Dinesh 19-Interference of thermal photons in relativistic heavy ion collisions SRIVASTAVA, Dinesh K. 85-Nuclear suppression of heavy quark production at forward rapidities at RHIC and LHC SRIVASTAVA, Dinesh Kumar 47-Equation of state of strongly interacting matter: spectra for thermal particles and intensity correlation of thermal photons SRIVASTAVA, Prashant Kumar 12-On Locating the Critical End Point in the QCD Phase Diagram25-A New Equation of State for a Hot Hadronic Matter STEINHEIMER, Jan 21-Hot and dense matter in quark-hadron models STöCKER, Horst 21-Hot and dense matter in quark-hadron models
| 2021-09-25T21:24:08 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.82015460729599, "perplexity": 12135.07934674732}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-39/segments/1631780057775.50/warc/CC-MAIN-20210925202717-20210925232717-00685.warc.gz"}
|
https://finalfantasy.fandom.com/wiki/Holy_Breath_(ability)
|
## FANDOM
36,921 Pages
Relm: I couldn't miss the chance to practice my drawing!
Attack with breath of sacred power.
Final Fantasy Tactics description
Holy Breath (ホーリーブレス, Hōrī Buresu?), also known as Holy Bracelet or Banish Breath, is a recurring ability in the series. It is a powerful Holy-elemental ability often used by Dragons or Dragoons.
## Appearances Edit
### Final Fantasy V Edit
Holy Breath is an ability only usable through the Mix command by mixing together a Holy Water and Dragon Fang. It inflicts heavy Holy-elemental damage to one enemy.
### Final Fantasy Tactics Edit
Holy Breath is an ability of the Dragonkin class, usable only by Reis. It requires 900 JP to learn and inflicts Holy-elemental damage in a random space within a range of 4, and has an effect of 3.
The damage formula is:
$0.5 \times Magick Attack \times (Magick Attack + PWR)$
### Bravely Default Edit
Holy Breath is an enemy ability used by Shinryu. It deals heavy physical Light-elemental damage to the entire party with a chance to inflict Blind. Typically, Shinryu will use Celestial Eye to make the party weak to Light before using Holy Breath.
### Final Fantasy Dimensions Edit
Holy Breath is the level 18 ability of the Dragoon class, which costs 510 AP to learn and 48 MP to use. It deals heavy Light damage to all enemies.
### Final Fantasy Dimensions II Edit
Holy Breath I-III were abilities in the original free-to-play versions and could be used by any party member equipped with the Alexander α summon. The ability dealt magic based light-damage to all enemies. Each version of the spell dealt more damage depending on the summon's rank and had increased MP costs for each version of the spell.
In the premium versions, the Holy Breath abilities were removed and were replaced with the Banish Breath (バニシュブレス, Banishu Burseu?) abilities.
### Dissidia Final Fantasy Opera Omnia Edit
This article or section is a stub about an ability in Dissidia Final Fantasy Opera Omnia. You can help the Final Fantasy Wiki by expanding it.
### Pictlogica Final FantasyEdit
This article or section is a stub about an ability in Pictlogica Final Fantasy. You can help the Final Fantasy Wiki by expanding it.
### Final Fantasy Airborne Brigade Edit
This article or section is a stub about an ability in Final Fantasy Airborne Brigade. You can help the Final Fantasy Wiki by expanding it.
### Final Fantasy Brave ExviusEdit
This article or section is a stub about an ability in Final Fantasy Brave Exvius. You can help the Final Fantasy Wiki by expanding it.
## Gallery Edit
This gallery is incomplete and requires Bravely Default added. You can help the Final Fantasy Wiki by uploading images.
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-12-14T08:57:03 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.22589947283267975, "perplexity": 12557.137311286204}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-51/segments/1575540585566.60/warc/CC-MAIN-20191214070158-20191214094158-00451.warc.gz"}
|
https://par.nsf.gov/biblio/10110193-adaptive-anonymization-data-using-edge-cover
|
Adaptive Anonymization of Data Using b-Edge Cover
We explore the problem of sharing data that pertains to individuals with anonymity guarantees, where each user requires a desired level of privacy. We propose the first shared-memory as well as distributed memory parallel algorithms for the k-anonimity problem that achieves this goal, and produces high quality anonymized datasets. The new algorithm is based on an optimization procedure that iteratively computes weights on the edges of a dissimilarity matrix, and at each iteration computes a minimum weighted b-edgecover in the graph. We describe how a 2-approximation algorithm for computing the b-edgecover can be used to solve the adaptive anonymity problem in parallel. We are able to solve adaptive anonymity problems with hundreds of thousands of instances and hundreds of features on a supercomputer in under five minutes. Our algorithm scales up to 8000 cores on a distributed memory supercomputer, while also providing good speedups on shared memory multiprocessors. On smaller problems where an a Belief Propagation algorithm is feasible, our algorithm is two orders of magnitude faster.
Authors:
Award ID(s):
Publication Date:
NSF-PAR ID:
10110193
Journal Name:
Proceedings of ACM/IEEE Supercomputing Conference (SC18)
3. We describe a paradigm for designing parallel algorithms via approximation, and illustrate it on the b-edgecover problem. A b-edgecover of minimum weight in a graph is a subset $C$ of its edges such that at least a specified number $b(v)$ of edges in $C$ is incident on each vertex $v$, and the sum of the edge weights in $C$ is minimum. The Greedy algorithm and a variant, the LSE algorithm, provide $3/2$-approximation guarantees in the worst-case for this problem, but these algorithms have limited parallelism. Hence we design two new $2$-approximation algorithms with greater concurrency. The MCE algorithm reduces the computation of a b-edgecover to that of finding a b'-matching, by exploiting the relationship between these subgraphs in an approximation context. The LSE-NW is derived from the LSEalgorithm using static edge weights rather than dynamically computing effective edge weights. This relaxation gives LSE a worse approximation guarantee but makes it more amenable to parallelization. We prove that both the MCE and LSE-NW algorithms compute the same b-edgecover with at most twice the weight of the minimum weight edge cover. In practice, the $2$-approximation and $3/2$-approximation algorithms compute edge covers of weight within $10\%$ the optimal. We implement three of themore »
| 2023-03-27T20:48:04 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6484698057174683, "perplexity": 717.3873048447548}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296948684.19/warc/CC-MAIN-20230327185741-20230327215741-00249.warc.gz"}
|
https://lammps.sandia.gov/doc/improper_class2.html
|
# improper_style class2/kk command
## Syntax
improper_style class2
## Examples
improper_style class2
improper_coeff 1 100.0 0
improper_coeff * aa 0.0 0.0 0.0 115.06 130.01 115.06
## Description
The class2 improper style uses the potential
where Ei is the improper term and Eaa is an angle-angle term. The 3 X terms in Ei are an average over 3 out-of-plane angles.
The 4 atoms in an improper quadruplet (listed in the data file read by the read_data command) are ordered I,J,K,L. X_IJKL refers to the angle between the plane of I,J,K and the plane of J,K,L, and the bond JK lies in both planes. Similarly for X_KJLI and X_LJIK. Note that atom J appears in the common bonds (JI, JK, JL) of all 3 X terms. Thus J (the 2nd atom in the quadruplet) is the atom of symmetry in the 3 X angles.
The subscripts on the various theta’s refer to different combinations of 3 atoms (I,J,K,L) used to form a particular angle. E.g. Theta_IJL is the angle formed by atoms I,J,L with J in the middle. Theta1, theta2, theta3 are the equilibrium positions of those angles. Again, atom J (the 2nd atom in the quadruplet) is the atom of symmetry in the theta angles, since it is always the center atom.
Since atom J is the atom of symmetry, normally the bonds J-I, J-K, J-L would exist for an improper to be defined between the 4 atoms, but this is not required.
See (Sun) for a description of the COMPASS class2 force field.
Coefficients for the Ei and Eaa formulas must be defined for each improper type via the improper_coeff command as in the example above, or in the data file or restart files read by the read_data or read_restart commands.
These are the 2 coefficients for the Ei formula:
• X0 (degrees)
X0 is specified in degrees, but LAMMPS converts it to radians internally; hence the units of K are in energy/radian^2.
For the Eaa formula, each line in a improper_coeff command in the input script lists 7 coefficients, the first of which is “aa” to indicate they are AngleAngle coefficients. In a data file, these coefficients should be listed under a “AngleAngle Coeffs” heading and you must leave out the “aa”, i.e. only list 6 coefficients after the improper type.
• aa
• M1 (energy/distance)
• M2 (energy/distance)
• M3 (energy/distance)
• theta1 (degrees)
• theta2 (degrees)
• theta3 (degrees)
The theta values are specified in degrees, but LAMMPS converts them to radians internally; hence the units of M are in energy/radian^2.
Styles with a gpu, intel, kk, omp, or opt suffix are functionally the same as the corresponding style without the suffix. They have been optimized to run faster, depending on your available hardware, as discussed on the Speed packages doc page. The accelerated styles take the same arguments and should produce the same results, except for round-off and precision issues.
These accelerated styles are part of the GPU, USER-INTEL, KOKKOS, USER-OMP and OPT packages, respectively. They are only enabled if LAMMPS was built with those packages. See the Build package doc page for more info.
You can specify the accelerated styles explicitly in your input script by including their suffix, or you can use the -suffix command-line switch when you invoke LAMMPS, or you can use the suffix command in your input script.
See the Speed packages doc page for more instructions on how to use the accelerated styles effectively.
## Restrictions
This improper style can only be used if LAMMPS was built with the CLASS2 package. See the Build package doc page for more info.
| 2018-08-18T00:25:20 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7231561541557312, "perplexity": 4154.346958103758}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-34/segments/1534221213247.0/warc/CC-MAIN-20180818001437-20180818021437-00328.warc.gz"}
|
https://par.nsf.gov/biblio/10128010-a3cosmos-dust-attenuation-star-forming-galaxies-from-cosmos-alma-archive
|
A3COSMOS: the dust attenuation of star-forming galaxies at z = 2.5–4.0 from the COSMOS-ALMA archive
ABSTRACT
We present an analysis of the dust attenuation of star-forming galaxies at z = 2.5–4.0 through the relationship between the UV spectral slope (β), stellar mass (M*), and the infrared excess (IRX = LIR/LUV) based on far-infrared continuum observations from the Atacama Large Millimeter/sub-millimeter Array (ALMA). Our study exploits the full ALMA archive over the COSMOS field processed by the A3COSMOS team, which includes an unprecedented sample of ∼1500 galaxies at z ∼ 3 as primary or secondary targets in ALMA band 6 or 7 observations with a median continuum sensitivity of 126 $\rm {\mu Jy\, beam}^{-1}$ (1σ). The detection rate is highly mass dependent, decreasing drastically below log (M*/M⊙) = 10.5. The detected galaxies show that the IRX–β relationship of massive (log M*/M⊙ > 10) main-sequence galaxies at z = 2.5–4.0 is consistent with that of local galaxies, while starbursts are generally offset by $\sim 0.5\, {\rm dex}$ to larger IRX values. At the low-mass end, we derive upper limits on the infrared luminosities through stacking of the ALMA data. The combined IRX–M* relation at $\rm {log\, ({\it M}_{\ast }/\mathrm{M}_{\odot })\gt 9}$ exhibits a significantly steeper slope than reported in previous studies at similar redshifts, implying little dust obscuration at log M*/M⊙ < 10. more »
Authors:
; ; ; ; ; ; ; ; ;
Publication Date:
NSF-PAR ID:
10128010
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
491
Issue:
4
Page Range or eLocation-ID:
p. 4724-4734
ISSN:
0035-8711
Publisher:
Oxford University Press
1. ABSTRACT We report the serendipitous discovery of a dust-obscured galaxy observed as part of the Atacama Large Millimeter Array (ALMA) Large Program to INvestigate [C ii] at Early times (ALPINE). While this galaxy is detected both in line and continuum emissions in ALMA Band 7, it is completely dark in the observed optical/near-infrared bands and only shows a significant detection in the UltraVISTA Ks band. We discuss the nature of the observed ALMA line, that is [C ii] at $z$ ∼ 4.6 or high-J CO transitions at $z$ ∼ 2.2. In the first case, we find a [C ii]/FIR luminosity ratio of $\mathrm{log}{(L_{[\mathrm{more » 2. Abstract We present ALMA [C ii] line and far-infrared (FIR) continuum observations of three$z \gt 6$low-luminosity quasars ($M_{\rm 1450} \gt -25$mag) discovered by our Subaru Hyper Suprime-Cam (HSC) survey. The [C ii] line was detected in all three targets with luminosities of$(2.4\mbox{--}9.5) \times 10^8\, L_{\odot }$, about one order of magnitude smaller than optically luminous ($M_{\rm 1450} \lesssim -25$mag) quasars. The FIR continuum luminosities range from$\lt 9 \times 10^{10}\, L_{\odot }$(3$\sigma$limit) to${\sim } 2 \times 10^{12}\, L_{\odot }$, indicating a wide range in star formation rates in these galaxies. Most of the HSC quasars studiedmore » 3. ABSTRACT We present predictions for high redshift (z = 2−10) galaxy populations based on the IllustrisTNG simulation suite and a full Monte Carlo dust radiative transfer post-processing. Specifically, we discuss the H α and H β +$[\rm O \,{\small III}]$luminosity functions up to z = 8. The predicted H β +$[\rm O \,{\small III}]$luminosity functions are consistent with present observations at z ≲ 3 with${\lesssim} 0.1\, {\rm dex}$differences in luminosities. However, the predicted H α luminosity function is${\sim }0.3\, {\rm dex}\$ dimmer than the observed one at z ≃ 2. Furthermore, we explore continuum spectral indices, the Balmer break at 4000 Å; (D4000)more »
| 2022-05-16T08:32:37 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9114532470703125, "perplexity": 10349.979282262211}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652662510097.3/warc/CC-MAIN-20220516073101-20220516103101-00063.warc.gz"}
|
https://www.usgs.gov/media/images/life-a-tsunami-0
|
# Life of a tsunami
### Detailed Description
Life of a tsunami: Panel 3—Amplification
Several things happen as the local tsunami travels over the continental slope. Most obvious is that the amplitude increases. In addition, the wavelength decreases. This results in steepening of the leading wave--an important control of wave runup at the coast. Note that the first part of the wave reaching the local shore is a trough, which will appear as the sea receeding far from shore. This is a common natural warning sign for tsunamis. Note also that the deep ocean tsunami has traveled much farther than the local tsunami because of the higher propagation speed. As the deep ocean tsunami approaches a distant shore, amplification and shortening of the wave will occur.
Public Domain.
| 2023-02-03T07:25:07 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8225541114807129, "perplexity": 1564.8790445006107}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500044.16/warc/CC-MAIN-20230203055519-20230203085519-00185.warc.gz"}
|
https://dlmf.nist.gov/24.7
|
# §24.7 Integral Representations
## §24.7(i) Bernoulli and Euler Numbers
The identities in this subsection hold for $n=1,2,\dotsc$. (24.7.6) also holds for $n=0$.
24.7.1 $\displaystyle B_{2n}$ $\displaystyle=(-1)^{n+1}\frac{4n}{1-2^{1-2n}}\int_{0}^{\infty}\frac{t^{2n-1}}{% e^{2\pi t}+1}\mathrm{d}t=(-1)^{n+1}\frac{2n}{1-2^{1-2n}}\int_{0}^{\infty}t^{2n% -1}e^{-\pi t}\operatorname{sech}\left(\pi t\right)\mathrm{d}t,$ 24.7.2 $\displaystyle B_{2n}$ $\displaystyle=(-1)^{n+1}4n\int_{0}^{\infty}\frac{t^{2n-1}}{e^{2\pi t}-1}% \mathrm{d}t=(-1)^{n+1}2n\int_{0}^{\infty}t^{2n-1}e^{-\pi t}\operatorname{csch}% \left(\pi t\right)\mathrm{d}t,$ 24.7.3 $\displaystyle B_{2n}$ $\displaystyle=(-1)^{n+1}\frac{\pi}{1-2^{1-2n}}\int_{0}^{\infty}t^{2n}{% \operatorname{sech}}^{2}\left(\pi t\right)\mathrm{d}t,$ 24.7.4 $\displaystyle B_{2n}$ $\displaystyle=(-1)^{n+1}\pi\int_{0}^{\infty}t^{2n}{\operatorname{csch}}^{2}% \left(\pi t\right)\mathrm{d}t,$ 24.7.5 $\displaystyle B_{2n}$ $\displaystyle=(-1)^{n}\frac{2n(2n-1)}{\pi}\*\int_{0}^{\infty}t^{2n-2}\ln\left(% 1-e^{-2\pi t}\right)\mathrm{d}t.$ 24.7.6 $\displaystyle E_{2n}$ $\displaystyle=(-1)^{n}2^{2n+1}\int_{0}^{\infty}t^{2n}\operatorname{sech}\left(% \pi t\right)\mathrm{d}t.$
## §24.7(ii) Bernoulli and Euler Polynomials
The following four equations hold for $0<\Re x<1$.
24.7.7 $\displaystyle B_{2n}\left(x\right)$ $\displaystyle=(-1)^{n+1}2n\*\int_{0}^{\infty}\frac{\cos\left(2\pi x\right)-e^{% -2\pi t}}{\cosh\left(2\pi t\right)-\cos\left(2\pi x\right)}t^{2n-1}\mathrm{d}t,$ $n=1,2,\dots$, 24.7.8 $\displaystyle B_{2n+1}\left(x\right)$ $\displaystyle=(-1)^{n+1}(2n+1)\*\int_{0}^{\infty}\frac{\sin\left(2\pi x\right)% }{\cosh\left(2\pi t\right)-\cos\left(2\pi x\right)}t^{2n}\mathrm{d}t.$ 24.7.9 $\displaystyle E_{2n}\left(x\right)$ $\displaystyle=(-1)^{n}4\int_{0}^{\infty}\frac{\sin\left(\pi x\right)\cosh\left% (\pi t\right)}{\cosh\left(2\pi t\right)-\cos\left(2\pi x\right)}t^{2n}\mathrm{% d}t,$ 24.7.10 $\displaystyle E_{2n+1}\left(x\right)$ $\displaystyle=(-1)^{n+1}4\*\int_{0}^{\infty}\frac{\cos\left(\pi x\right)\sinh% \left(\pi t\right)}{\cosh\left(2\pi t\right)-\cos\left(2\pi x\right)}t^{2n+1}% \mathrm{d}t.$
### Mellin–Barnes Integral
24.7.11 $B_{n}\left(x\right)=\frac{1}{2\pi i}\int_{-c-i\infty}^{-c+i\infty}(x+t)^{n}% \left(\frac{\pi}{\sin\left(\pi t\right)}\right)^{2}\mathrm{d}t,$ $0.
## §24.7(iii) Compendia
For further integral representations see Prudnikov et al. (1986a, §§2.3–2.6) and Gradshteyn and Ryzhik (2000, Chapters 3 and 4).
| 2022-05-19T03:04:53 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 120, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9933324456214905, "perplexity": 6997.562313641135}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652662522741.25/warc/CC-MAIN-20220519010618-20220519040618-00161.warc.gz"}
|
https://control.com/textbook/programmable-logic-controllers/human-machine-interfaces/
|
# Human-Machine Interfaces (HMIs)
## Chapter 29 - Basics of Programmable Logic Controllers (PLCs)
Programmable logic controllers are built to input various signal types (discrete, analog), execute control algorithms on those signals, and then output signals in response to control processes. By itself, a PLC generally lacks the capability of displaying those signal values and algorithm variables to human operators. A technician or engineer with access to a personal computer and the requisite software for editing the PLC’s program may connect to the PLC and view the program’s status “online” to monitor signal values and variable states, but this is not a practical way for operations personnel to monitor what the PLC is doing on a regular basis. In order for operators to monitor and adjust parameters inside the PLC’s memory, we need a different sort of interface allowing certain variables to be read and written without compromising the integrity of the PLC by exposing too much information or allowing any unqualified person to alter the program itself.
One solution to this problem is a dedicated computer display programmed to provide selective access to certain variable’s in the PLC’s memory, generally referred to as Human-Machine Interface, or HMI.
HMIs may take the form of general-purpose (“personal”) computers running special graphic software to interface with a PLC, or as special-purpose computers designed to be mounted in sheet metal panel fronts to perform no task but the operator-PLC interface. This first photograph shows an example of an ordinary personal computer (PC) with HMI software running on it:
The display shown here happens to be for monitoring a vacuum swing adsorption (VSA) process for purifying oxygen extracted from ambient air. Somewhere, a PLC (or collection of PLCs) is monitoring and controlling this VSA process, with the HMI software acting as a “window” into the PLC’s memory to display pertinent variables in an easy-to-interpret form for operations personnel. The personal computer running this HMI software connects to the PLC(s) via digital network cables such as Ethernet.
This next photograph shows an example of a special-purpose HMI panel designed and built expressly to be used in industrial operating environments:
These HMI panels are really nothing more than “hardened” personal computers built ruggedly and in a compact format to facilitate their use in industrial environments. Most industrial HMI panels come equipped with touch-sensitive screens, allowing operators to press their fingertips on displayed objects to change screens, view details on portions of the process, etc.
Technicians and/or engineers program HMI displays to read and write data via a digital network to one or more PLCs. Graphical objects arrayed on the display screen of an HMI often mimic real-world indicators and switches, in order to provide a familiar interface for operations personnel. A “pushbutton” object on the face of an HMI panel, for example, would be configured to write one bit of data to the PLC, in a manner similar to a real-world switch writing one bit of data to the PLC’s input register.
Modern HMI panels and software are almost exclusively tag-based, with each graphic object on the screen associated with at least one data tag name, which in turn is associated to data points (bits, or words) in the PLC by way of a tag name database file resident in the HMI. Graphic objects on the HMI screen either accept (read) data from the PLC to present useful information to the operator, send (write) data to the PLC from operator input, or both. The task of programming an HMI unit consists of building a tag name database and then drawing screens to illustrate the process to as good a level of detail as operators will need to run it.
An example screenshot of a tag name database table for a modern HMI is shown here:
The tag name database is accessed and edited using the same software to create graphic images in the HMI. In this particular example you can see several tag names (e.g. START_PUSHBUTTON, MOTOR_RUN_TIMER, ERROR_MESSAGE, MOTOR_SPEED) associated with data points within the PLC’s memory (in this example, the PLC addresses are shown in Modbus register format). In many cases the tag name editor will be able to display corresponding PLC memory points in the same manner as they appear in the PLC programming editor software (e.g. I:5/10, SM0.4, C11, etc.).
An important detail to note in this tag name database display is the read/write attributes of each tag. Note in particular how four of the tags shown are read-only: this means the HMI only has permission to read the values of those four tags from the PLC’s memory, and not to write (alter) those values. The reason for this in the case of these four tags is that those tags refer to PLC input data points. The START_PUSHBUTTON tag, for instance, refers to a discrete input in the PLC energized by a real pushbutton switch. As such, this data point gets its state from the energization of the discrete input terminal. If the HMI were to be given write permission for this data point, there would likely be a conflict. Suppose input terminal on the PLC were energized (setting the START_PUSHBUTTON bit to a “1” state) and the HMI simultaneously attempted to write a “0” state to the same tag. One of these two data sources would win, and other would lose, possibly resulting in unexpected behavior from the PLC program. For this reason, data points in the PLC linked to real-world inputs should always be limited as “read-only” permission in the HMI’s database, so the HMI cannot possibly generate a conflict.
The potential for data conflict also exists for some of the other points in the database, however. A good example of this is the MOTOR_RUN bit, which is the bit within the PLC program telling the real-world motor to run. Presumably, this bit gets its data from a coil in the PLC’s Ladder Diagram program. However, since it also appears in the HMI database with read/write permission, the potential exists for the HMI to over-write (i.e. conflict) that same bit in the PLC’s memory. Suppose someone programmed a toggling “pushbutton” screen object in the HMI linked to this tag: pushing this virtual “button” on the HMI screen would attempt to set the bit (1), and pushing it again would attempt to reset the bit (0). If this same bit is being written to by a coil in the PLC’s program, however, there exists the distinct possibility that the HMI’s “pushbutton” object and the PLC’s coil will conflict, one trying to tell the bit to be a “0” while the other tries to tell that bit to be a “1”. This situation is quite similar to the problem experienced when multiple coils in a Ladder Diagram program are addressed to the same bit.
The general rule to follow here is never allow more than one element to write to any data point. In my experience teaching PLC and HMI programming, this is one of the more common errors students make when first learning to program HMIs: they will try to have both the HMI and the PLC writing to the same memory locations, with weird results.
One of the lessons you will learn when programming large, complex systems is that it is very beneficial to define all the necessary tag names before beginning to lay out graphics in an HMI. The same goes for PLC programming: it makes the whole project go faster with less confusion if you take the time to define all the necessary I/O points (and tag names, if the PLC programming software supports tag names in the programming environment) before you begin to create any code specifying how those inputs and outputs will relate to each other.
Maintaining a consistent convention for tag names is important, too. For example, you may wish to begin the tag name of every hard-wired I/O point as either INPUT or OUTPUT (e.g. INPUT_PRESSURE_SWITCH_HIGH, OUTPUT_SHAKER_MOTOR_RUN, etc.). The reason for maintaining a strict naming convention is not obvious at first, since the whole point of tag names is to give the programmer the freedom to assign arbitrary names to data points in the system. However, you will find that most tag name editors list the tags in alphabetical order, which means a naming convention organized in this way will present all the input tags contiguously (adjacent) in the list, all the output tags contiguously in the list, and so on.
Another way to leverage the alphabetical listing of tag names to your advantage is to begin each tag name with a word describing its association to a major piece of equipment. Take for instance this example of a process with several data points defined in a PLC control system and displayed in an HMI:
If we list all these tags in alphabetical order, the association is immediately obvious:
• Exchanger_effluent_pump
• Exchanger_effluent_temp_out
• Exchanger_preheat_pump
• Exchanger_preheat_temp_in
• Exchanger_preheat_valve
• Reactor_bed_temp
• Reactor_feed_flow
• Reactor_feed_temp
• Reactor_jacket_valve
As you can see from this tag name list, all the tags directly associated with the heat exchanger are located in one contiguous group, and all the tags directly associated with the reactor are located in the next contiguous group. In this way, judicious naming of tags serves to group them in hierarchical fashion, making them easy for the programmer to locate at any future time in the tag name database.
You will note that all the tag names shown here lack space characters between words (e.g. instead of “Reactor bed temp”, a tag name should use hyphens or underscore marks as spacing characters: “Reactor_bed_temp”), since spaces are generally assumed by computer programming languages to be delimiters (separators between different variable names).
Like programmable logic controllers themselves, the capabilities of HMIs have been steadily increasing while their price decreases. Modern HMIs support graphic trending, data archival, advanced alarming, and even web server ability allowing other computers to easily access certain data over wide-area networks. The ability of HMIs to log data over long periods of time relieves the PLC of having to do this task, which is very memory-intensive. This way, the PLC merely “serves” current data to the HMI, and the HMI is able to keep a record of current and past data using its vastly larger memory reserves.
Some modern HMI panels even have a PLC built inside the unit, providing control and monitoring in the same device. Such panels provide terminal strip connection points for discrete and even analog I/O, allowing all control and interface functions to be located in a single panel-mount unit.
• Share
Published under the terms and conditions of the Creative Commons Attribution 4.0 International Public License
| 2020-01-20T23:05:01 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.19298343360424042, "perplexity": 2178.9850203572437}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-05/segments/1579250601040.47/warc/CC-MAIN-20200120224950-20200121013950-00088.warc.gz"}
|
https://arrow.fandom.com/wiki/User_talk:Carpe_Universum
|
6,582 Pages
# Carpe Universum
My favorite wikis
Welcome, to My Talk Page!
❖ Post what ever you want here (within this wiki's guidelines)
❖ I will do my best to respond to everyone's messages on my talk page. I will post my responses to your own talk page.
❖ Please make sure to sign your message with four tilds (~~~~).
Thanks,
## Welcome
Hi, I'm an admin for the Arrowverse Wiki community. Welcome and thank you for your edit to Pestilence! If you need help getting started, check out our policies and guidelines, or contact me or another admin here. For general help, you could also stop by Community Central to explore the forums and blogs.
Please leave me a message if I can help with anything. Enjoy your time at the Arrowverse Wiki!
IHHeroes (talk) 01:59, September 7, 2019 (UTC)
## Spoilers
Hey, please be sure to follow our Spoiler Policy regarding content on the wiki that is not from completely aired content. As well, you have edited your blog post at least 30 times today. That clutters up the Recent Changes page, so please do not mass edit pages in a single day. Try to do all of your editing in one sitting. Thanks, $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
Sorry about the Spoilers Policy! Won't happen again. Also about blog post, its complete nowz so wont be editing it again and again, unless a new COIE cast is released!
Again, we cannot have any information on an episode until after it airs completely. Please abide by our policies. $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
## Blog
Please do not create blogs if you're just going to copy and paste things from other pages.User:TimeShade/sig 23:30, October 16, 2019 (UTC)
That is not what I was doing AT ALL! Sure, I copied some things, but only related stuff. I'll remove it. This plog post took me 8 or so hours to complete, adding the full list, and find/add all the sources.
Not sure why you're putting in so much work in that when there's already the actual page, which I know you're aware of since you've sourced it.User:TimeShade/sig 00:38, October 17, 2019 (UTC)
Of course I'm aware of it. But, the Crisis on Infinite Earths page doesnt include the series regular casts.
## Talk pages
Hey, just to make you aware of common practice with wiki editing. A user's talk page is meant for users other than themselves. For example, if you respond to someone on your own talk page, said someone may never see that because it doesn't alert them. To respond to someone, please respond on their talk page. (As well, you don't have to reply to this, just wanted to make you aware) $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
Please see our image policy regarding jpgs. Also, anytime you leave a comment on someone's talk page, please leave your signature following your comment. You can do so by placing 4 ~ marks with no spaces in between. Thanks, $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
## Message walls
Theres a thresd discussing the matter here. As for article comments, they tend to get spammed with discussions on the subject rather than thr actual article.User:TimeShade/sig 21:28, October 18, 2019 (UTC)
## RE: Talk Pages
I'd say just be careful with which quote of the day you use so you abide by the spoiler policy and don't change the talk page anymore than you have.
--Xandermcc (talk) 06:06, October 22, 2019 (UTC)
Overall everything seems to be in good standing! Good job.User:TimeShade/sig 06:28, October 22, 2019 (UTC)
We do not have any policy for the talk page, just signatures (though that would be obsolete if we do migrate to message walls). I'd also like to add that it's great you're really proactive with ensuring you are following editing guidelines. Keep it up!User:TimeShade/sig 22:54, October 22, 2019 (UTC)
## Signature Test
It's fine but the emojis are unreadable on some devices.User:TimeShade/sig 05:42, October 25, 2019 (UTC)
## Profile
The profile is cool, just a little hard to read. The colors do not go well together. Tsukiakari1203Secunda (talk) 04:24, October 25, 2019 (UTC)Tsukiakari1203
I appreciate your opinion on the Monitor but I didn't ask you. Tsukiakari1203Secunda (talk) 02:30, October 28, 2019 (UTC)Tsukiakari1203Secunda
Okay, please lead with the admins told me, next time. Sorry. Tsukiakari1203Secunda (talk) 06:41, October 28, 2019 (UTC)Tsukiakari1203Secunda
## RE:Elseworlds
It's a tricky situation since originally it was named as the Hours but later changed to simply Part 1, Part 2, etc. Netflix is a third party site technically so we stick with what the final press release gave us.User:TimeShade/sig 23:43, October 29, 2019 (UTC)
## Deceased/Mar Novu
First off, spoilers dude. I have yet to watch this newest Arrow. Thankfully in this case, I really don't care about her too much. I believe the procedure would be if we have actually seen her die, then we would put in the status "Alive (as of ____)<br>Deceased (as of____)" with the appropriate small functions. However, you must then be sure to add the Deceased category to her page. As for Mar Novu, I have serious doubts about him being a God despite people thinking he is. (Or even himself thinking he is). As for time travel; if he has time traveled, then he is a time traveler. Hope this helps, $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
Don't feel too bad. Like I said, I don't really care in this case, but it is something to keep in mind. Usually you can track my user sub pages if you would like to see if I have watched a given episode, haha. $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
## Moving Pages
Hey, please just place the move template on pages that needs to be removed. However, the title you're referring to is not the official press release title. SpoilerTV is not a reliable source of information. $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
## Spam Editing
Hey, please try to refrain from clogging up the recent changes section with so many edits in one sitting. The recent changes page is just filled with random edits you have made. If you are going through pages and doing the same edit on things, these are things that administrators should do with the use of a bot. Clogging things up isn't typically helpful. —Preceding unsigned comment added by IHHeroes (talkcontribs)
Number One, people have to check other peoples' edits and this is not going to get done now because of this. Number two, you have some edits where you have only removed one line of white space which maybe wasn't necessary but neither was your edit. The whitespace could have stayed. Further, if a link is maybe done incorrectly, like say [[CBS|CBS]] it doesn't really need to be fixed. And that flags to us as an inappropriate user who is only interested in badge hoarding or trying to have the most edits. And that will get you blocked. —Preceding unsigned comment added by IHHeroes (talkcontribs)
I don't want to limit you. I'm also not saying to stop fixing links. Those are good things to do, but a whole for just that is not necessary. What I'm saying is "Be a smart editor". These practices you've been doing, while under the guise of being helpful is not signs of a smart editor. (It does show that you know a little coding and how things should be, but it's not the smartest practice of that knowledge) —Preceding unsigned comment added by IHHeroes (talkcontribs)
what's up? —Preceding unsigned comment added by ThatChickenHead (talkcontribs)
Kamilla having Art-Based Powers
(ThatChickenHead (talk) 05:27, November 13, 2019 (UTC))
## IHBot
Hey, just now got your message about my bot. Soon the page parameter will no longer be accepted in the Ep template. So I am attempting to remove all of those. Because of our new set-up in Ep, having the page parameter is causing this "ugliness" you are referring to. I think once all of the pages get removed, then I can take out this and hopefully things go back to how they should. I know several mainspace pages are doing the same and I apologize for any inconvenience. But we have no need for the page parameter in Ep moving forward. $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
No. The Ep/Episode is not to be used on any pages. I believe the template documentation states that. $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
No big deal! Don't worry too much! It will all be made right in a short amount of time. This removal of the page parameter has been taking way too long. But the end is in sight! $\int$ IHH dt 22:07, Nov 13, 2019 (UTC)
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-11-14T03:26:37 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.346019983291626, "perplexity": 2023.412560595213}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-47/segments/1573496667945.28/warc/CC-MAIN-20191114030315-20191114054315-00273.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Achandrasekhar.subrahmanyan
|
# zbMATH — the first resource for mathematics
## Chandrasekhar, Subrahmanyan
Compute Distance To:
Author ID: chandrasekhar.subrahmanyan Published as: Chandrasekhar, S.; Chandrasekhar, Subrahmanyan External Links: MGP · Wikidata · GND · MacTutor Awards: Nobel Prize in Physics (1983)
Documents Indexed: 242 Publications since 1929, including 28 Books Biographic References: 12 Publications
all top 5
#### Co-Authors
185 single-authored 8 Elbert, Donna D. 8 Xanthopoulos, Basilis C. 6 Lebovitz, Norman R. 5 Ferrari, Valeria 3 Kaufman, Allan N. 3 von Neumann, John 3 Watson, Kenneth M. 2 Contopoulos, Georg 2 Henrich, Louis R. 2 Kac, Mark 2 Milne, Edward Arthur 2 Smart, William Marshall 2 Swings, Pol 2 Williamson, Ralph E. 1 Backus, George E. 1 Cesco, Carlos Ulrrico 1 Donnelly, Russell J. 1 Doob, Joseph Leonard 1 Franklin, Ann 1 Krogdahl, Wasley S. 1 Lee, Edward P. 1 Møller, Christian Max 1 Ornstein, Leonard Salomon 1 Prendergast, Kevin H. 1 Reid, William H. 1 Rice, Stephen O. 1 Sahade, J. 1 Smoluchowski, Roman 1 Tooper, Robert F. 1 Uhlenbeck, George Eugene 1 Wax, Nelson 1 Woltjer, Lodewijk 1 Wright, James P.
all top 5
#### Serials
47 The Astrophysical Journal 44 Monthly Notices of the Royal Astronomical Society 39 Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences 15 Proceedings of the National Academy of Sciences of the United States of America 7 The Philosophical Magazine, VII. Series 6 Proceedings of the Cambridge Philosophical Society 6 Zeitschrift für Astrophysik 4 Proceedings of the Royal Society of London. Series A 3 Reviews of Modern Physics 3 Annals of Physics 3 Physical Review, II. Series 3 International Series of Monographs on Physics 2 Mathematika 2 Philosophical Transactions of the Royal Society of London. Ser. A 2 Physical Review Letters 1 American Mathematical Monthly 1 Astronomicheskiĭ Zhurnal 1 Communications on Pure and Applied Mathematics 1 Journal of Mathematical Analysis and Applications 1 Quarterly Journal of Mechanics and Applied Mathematics 1 Dialectica 1 The Journal of the Indian Mathematical Society. New Series 1 Journal of the Madras University. Section B: Mathematics, Physical and Biological Sciences 1 Notes and Records of the Royal Society of London 1 Proceedings of the London Mathematical Society. Third Series 1 Proceedings of the Indian National Science Academy. Part A. Physical Sciences 1 Canadian Journal of Physics 1 Bulletin of the American Mathematical Society 1 Journal of Mathematics and Mechanics 1 Proceedings of the Indian Academy of Sciences 1 Indian Journal of Physics 1 Nature, London 1 Annals of the New York Academy of Sciences 1 Journal of Rational Mechanics and Analysis
all top 5
#### Fields
24 Relativity and gravitational theory (83-XX) 18 Differential geometry (53-XX) 17 Astronomy and astrophysics (85-XX) 15 History and biography (01-XX) 8 Fluid mechanics (76-XX) 4 Partial differential equations (35-XX) 3 Mechanics of particles and systems (70-XX) 3 Statistical mechanics, structure of matter (82-XX) 1 Probability theory and stochastic processes (60-XX) 1 Mechanics of deformable solids (74-XX) 1 Classical thermodynamics, heat transfer (80-XX)
#### Citations contained in zbMATH
151 Publications have been cited 4,244 times in 3,801 Documents Cited by Year
Hydrodynamic and hydromagnetic stability. Zbl 0142.44103
Chandrasekhar, S.
1961
The mathematical theory of black holes. Zbl 0511.53076
Chandrasekhar, S.
1983
Chandrasekhar, S.
1950
Stochastic problems in physics and astronomy. Zbl 0061.46403
Chandrasekhar, S.
1943
An introduction to the study of stellar structure. Zbl 0022.19207
Chandrasekhar, S.
1939
An introduction to the study of stellar structure. Zbl 0079.23901
Chandrasekhar, S.
1957
The mathematical theory of black holes. Reprint of the 1st ed. ’83. Zbl 0912.53053
Chandrasekhar, S.
1998
Ellipsoidal figures of equilibrium. Zbl 0213.52304
Chandrasekhar, S.
1969
An introduction to the study of stellar structure. JFM 65.1543.02
Chandrasekhar, S.
1939
Selected papers on noise and stochastic processes. Zbl 0059.11903
Wax, N.; Doob, Joseph L.; Chandrasekhar, S.; Rice, S. O.; Uhlenbeck, G. E.; Kac, M.; Ornstein, L. S.
1954
Ellipsoidal figures of equilibrium. An historical account. Zbl 0149.24301
Chandrasekhar, S.
1967
Propagation of elastic waves in liquid crystals. Zbl 0127.41403
Chandrasekhar, S.
1964
Principles of stellar dynamics. JFM 68.0655.03
Chandrasekhar, S.
1942
The dynamical instability of gaseous masses approaching the Schwarzschild limit in general relativity. Zbl 0151.47102
Chandrasekhar, S.
1964
The maximum mass of ideal white dwarfs. Zbl 0002.23502
Chandrasekhar, S.
1931
A new type of singularity created by colliding gravitational waves. Zbl 0624.53051
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1986
The stability of non-dissipative Couette flow in hydromagnetics. Zbl 0094.40401
Chandrasekhar, S.
1960
Dynamical friction. I. General considerations; the coefficient of dynamical friction. II. The rate of escape of stars from clusters and the evidence for the operation of dynamical friction. III. A more exact theory of the rate of escape of stars form clusters. Zbl 0060.46306
Chandrasekhar, S.
1943
On force-free magnetic fields. Zbl 0074.22001
Chandrasekhar, S.
1956
The instability of a layer of fluid heated below and subject to Coriolis forces. Zbl 0053.19102
Chandrasekhar, S.
1953
The stability of a rotating liquid drop. Zbl 0137.23004
Chandrasekhar, S.
1965
Dynamical instability of gaseous masses approaching the Schwarzschild limit in general relativity. Zbl 0116.21704
Chandrasekhar, S.
1964
The geodesics in Gödel’s universe. Zbl 0097.21901
Chandrasekhar, S.; Wright, James P.
1961
Newton’s $$Principia$$ for the common reader. Zbl 0821.01012
Chandrasekhar, S.
1995
The Einstein pseudo-tensor and the flux integral for perturbed static space-times. Zbl 0744.53038
Chandrasekhar, Subrahmanyan; Ferrari, Valeria
1991
On the Nutku-Halil solution for colliding impulsive gravitational waves. Zbl 0548.53036
Chandrasekhar, Subrahmanyan; Ferrari, Valeria
1984
The stability of viscous flow between rotating cylinders in the presence of a magnetic field. Zbl 0050.19603
Chandrasekhar, S.
1953
The invariant theory of isotropic turbulence in magneto-hydrodynamics. I. II. Zbl 0043.19110
Chandrasekhar, S.
1951
The theory of axisymmetric turbulence. Zbl 0037.40602
Chandrasekhar, S.
1950
On the inhibition of convection by a magnetic field. Zbl 0046.24002
Chandrasekhar, S.
1952
A theory of turbulence. Zbl 0064.43702
Chandrasekhar, S.
1955
On colliding waves in the Einstein-Maxwell theory. Zbl 0561.53065
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1985
On colliding waves that develop time-like singularities: a new class of solutions of the Einstein-Maxwell equations. Zbl 0621.53068
Chandrasekhar, Subrahmanyan; Xantopoulos, Basilis C.
1987
On the collision of impulsive gravitational waves when coupled with fluid motions. Zbl 0574.53054
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1985
A general variational principle governing the radial and the non-radial oscillations of gaseous masses. Zbl 0151.47403
Chandrasekhar, S.
1964
On the equilibrium configurations of an incompressible fluid with axisymmetric motions and magnetic fields. Zbl 0082.20502
Chandrasekhar, S.
1958
The equilibrium of magnetic stars. Zbl 0074.22002
Chandrasekhar, S.; Prendergast, Kevin H.
1956
Brownian motion, dynamical friction, and stellar dynamics. Zbl 0036.43003
Chandrasekhar, S.
1949
The statistics of the gravitational field arising from a random distribution of stars. 1. The speed of fluctuations. Zbl 0028.28501
Chandrasekhar, S.; von Neumann, J.
1942
The hydrodynamic stability of viscid flow between coaxial cylinders. Zbl 0095.21704
Chandrasekhar, S.
1960
The statistics of the gravitational field arising from a random distribution of stars. II. The speed of fluctuations; dynamical friction; spatial correlations. III. The correlations in the forces acting at two points separated by a finite distance. IV. The stochastic variation of the force acting on a star. Zbl 0060.46305
Chandrasekhar, S.; von Neumann, J.
1944
Ionization and recombination in the theory of stellar absorption lines and nebular luminosity. JFM 64.1471.02
Chandrasekhar, S.
1938
The equilibrium of distorted polytropes. I. The rotational problem. Zbl 0007.03901
Chandrasekhar, S.
1933
The stability of spiral flow between rotating cylinders. Zbl 0112.41902
Chandrasekhar, S.
1962
The hydrodynamic stability of inviscid flow between coaxial cylinders. Zbl 0095.21703
Chandrasekhar, S.
1960
The character of the equilibrium of an incompressible heavy viscous fluid of variable density. Zbl 0074.42306
Chandrasekhar, S.
1955
The transfer of radiation in stellar atmospheres. Zbl 0031.23603
Chandrasekhar, S.
1947
The oscillations of a viscous liquid globe. Zbl 0085.20403
Chandrasekhar, S.
1959
On force-free magnetic fields. Zbl 0080.41201
Chandrasekhar, S.; Woltjer, L.
1958
The highly collapsed configurations of a stellar mass. II. Zbl 0011.08503
Chandrasekhar, S.
1935
The two-centre problem in general relativity: The scattering of radiation by two extreme Reissner-Nordström black-holes. Zbl 0687.53063
Chandrasekhar, Subrahmanyan
1989
Cylindrical waves in general relativity. Zbl 0612.53052
Chandrasekhar, Subrahmanyan
1986
Post-Newtonian equations of hydrodynamics and the stability of gaseous masses in general relativity. Zbl 0131.43104
Chandrasekhar, S.
1965
Plasma physics. Zbl 0098.22705
Chandrasekhar, S.
1960
The stability of viscous flow between rotating cylinders. Zbl 0082.18901
Chandrasekhar, S.
1958
On cosmic magnetic fields. Zbl 0123.23604
Chandrasekhar, S.
1957
On the expansion of functions which satisfy four boundary conditions. Zbl 0078.07504
Chandrasekhar, S.; Reid, W. H.
1957
On the stability of the simplest solution of the equations of hydromagnetics. Zbl 0072.22905
Chandrasekhar, S.
1956
The stability of viscous flow between rotating cylinders. Zbl 0056.42904
Chandrasekhar, S.
1954
Principles of stellar dynamics. Zbl 0060.46307
Chandrasekhar, S.
1942
On the non-radial oscillations of slowly rotating stars induced by the Lense-Thirring effect. Zbl 0729.70018
Chandrasekhar, Subrahmanyan; Ferrari, Valeria
1991
The stability of the pinch. Zbl 0080.41202
Chandrasekhar, S.; Kaufman, A. N.; Watson, K. M.
1958
Theory of turbulence. Zbl 0070.43001
Chandrasekhar, S.
1956
The instability of a layer of fluid heated below and subject to the simultaneous action of a magnetic field and rotation. Zbl 0055.45306
Chandrasekhar, S.
1954
On Heisenberg’s elementary theory of turbulence. Zbl 0036.25502
Chandrasekhar, S.
1949
On the radiative equilibrium of a stellar atmosphere. I-III. Zbl 0060.46301
Chandrasekhar, S.
1944
On a post-Galilean transformation appropriate to the post-Newtonian theory of Einstein, Infeld and Hoffmann. Zbl 0158.43101
Chandrasekhar, S.; Contopoulos, G.
1967
On the diffuse reflection of a pencil of radiation by a plane-parallel atmosphere. Zbl 0082.40602
Chandrasekhar, S.
1958
On Cowling’s theorem on the impossibility of self-maintained axisymmetric homogeneous dynamos. Zbl 0072.22904
Backus, G. E.; Chandrasekhar, S.
1956
On characteristic value problems in high order differential equations which arise in studies on hydrodynamic and hydromagnetic stability. Zbl 0056.08303
Chandrasekhar, S.
1954
A statistical basis for the theory of stellar scintillation. Zbl 0048.43303
Chandrasekhar, S.
1952
Selected papers. Vol. 6: The mathematical theory of black holes and of colliding plane waves. With a foreword by Basilis C. Xanthopoulos. Zbl 1036.01529
Chandrasekhar, S.
1991
A perturbation analysis of the Bell-Szekeres space-time. Zbl 0656.53071
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1988
Ellipsoidal figures of equilibrium. (Ellipsoidal’nye figury ravnovesija.) Übersetzung aus dem Englischen von V. N. Rubanovskii. Herausgegeben von V. V. Rumjancev. Zbl 0257.76012
Chandrasekhar, S.
1973
The stability of viscous flow between rotating cylinders. II. Zbl 0115.21305
Chandrasekhar, S.; Elbert, D. D.
1962
The fluctuations of density in isotropic turbulence. Zbl 0044.21203
Chandrasekhar, S.
1951
The highly collapsed configurations of a stellar mass. Zbl 0002.10101
Chandrasekhar, S.
1931
Marian Smoluchowski: his life and scientific work. Chronological table and bibliography compiled by Alojzy Burnicki. Edited and with a preface by Roman Stanisław Ingarden. Zbl 0963.01036
Chandrasekhar, S.; Kac, M.; Smoluchowski, R.
2000
Selected papers. Vol. 1: Stellar structure and stellar atmospheres. Zbl 1098.01519
Chandrasekhar, S.
1989
On the collision of impulsive gravitational waves when coupled with null dust. Zbl 0582.53051
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1986
Non-radial oscillations and convective instability of gaseous masses. Zbl 0117.45701
Chandrasekhar, S.; Lebovitz, N. R.
1963
The instability of a layer of fluid heated below and subject to the simultaneous action of a magnetic field and rotation. II. Zbl 0071.44801
Chandrasekhar, S.
1956
The gravitational instability of an infinite homogeneous turbulent medium. Zbl 0043.45205
Chandrasekhar, S.
1951
New methods in stellar dynamics. Zbl 0060.46401
Chandrasekhar, S.
1943
An attempt to interpret the relative abundances of the elements and their isotopes. Zbl 0028.38402
Chandrasekhar, S.; Henrich, Louis R.
1942
The statistics of the gravitational field arising from a random distribution of stars. I. The speed of fluctuations. JFM 68.0657.04
Chandrasekhar, S.; von Neumann, J.
1942
The highly collapsed configurations of a stellar mass. JFM 57.1275.05
Chandrasekhar, S.
1931
The flux integral for axisymmetric perturbations of static space-times. Zbl 0705.53037
Chandrasekhar, Subrahmanyan; Ferrari, V.
1990
Selected papers. Volume 2: Radiative transfer and negative ion of hydrogen. Zbl 0749.01014
Chandrasekhar, S.
1989
The dynamical instability of the white-dwarf configurations approaching the limiting mass. Zbl 0124.22102
Chandrasekhar, S.; Tooper, R. F.
1964
The equilibrium and the stability of the Roche ellipsoids. Zbl 0135.23506
Chandrasekhar, S.
1963
The instability of a layer of fluid heated below and subject to coriolis forces. II. Zbl 0065.45604
Chandrasekhar, S.; Elbert, Donna D.
1955
The decay of axisymmetric turbulence. Zbl 0038.38301
Chandrasekhar, S.
1950
The formation of absorption lines in a moving atmosphere. Zbl 0060.46514
Chandrasekhar, S.
1945
The density of white dwarf stars. Zbl 0001.11103
Chandrasekhar, S.
1931
Eddington. The most distinguished astrophysicist of this time. Reprint of the 1983 hardback ed. Zbl 1178.85001
Chandrasekhar, S.
2009
Selected papers. Volume 3: Stochastic, statistical, and hydromagnetic problems in physics and astronomy. With a foreword by Norman R. Lebovitz. Zbl 0734.01025
Chandrasekhar, S.
1989
On the ellipsoidal figures of equilibrium of homogeneous masses. Zbl 0151.47501
Chandrasekhar, S.; Lebovitz, N. R.
1964
On the oscillations of the Maclaurin spheroid belonging to the third harmonics. Zbl 0129.47004
Chandrasekhar, S.; Lebovitz, N. R.
1963
On the stability of the Jacobi ellipsoids. Zbl 0129.47003
Chandrasekhar, S.; Lebovitz, N. R.
1963
A scientific autobiography: S. Chandrasekhar. With selected correspondence. Edited by Kameshwar C. Wali. Zbl 1237.01005
Chandrasekhar, Subrahmanyan
2010
Eddington. The most distinguished astrophysicist of this time. Reprint of the 1983 hardback ed. Zbl 1178.85001
Chandrasekhar, S.
2009
Marian Smoluchowski: his life and scientific work. Chronological table and bibliography compiled by Alojzy Burnicki. Edited and with a preface by Roman Stanisław Ingarden. Zbl 0963.01036
Chandrasekhar, S.; Kac, M.; Smoluchowski, R.
2000
The mathematical theory of black holes. Reprint of the 1st ed. ’83. Zbl 0912.53053
Chandrasekhar, S.
1998
Newton’s $$Principia$$ for the common reader. Zbl 0821.01012
Chandrasekhar, S.
1995
The Einstein pseudo-tensor and the flux integral for perturbed static space-times. Zbl 0744.53038
Chandrasekhar, Subrahmanyan; Ferrari, Valeria
1991
On the non-radial oscillations of slowly rotating stars induced by the Lense-Thirring effect. Zbl 0729.70018
Chandrasekhar, Subrahmanyan; Ferrari, Valeria
1991
Selected papers. Vol. 6: The mathematical theory of black holes and of colliding plane waves. With a foreword by Basilis C. Xanthopoulos. Zbl 1036.01529
Chandrasekhar, S.
1991
The flux integral for axisymmetric perturbations of static space-times. Zbl 0705.53037
Chandrasekhar, Subrahmanyan; Ferrari, V.
1990
The two-centre problem in general relativity: The scattering of radiation by two extreme Reissner-Nordström black-holes. Zbl 0687.53063
Chandrasekhar, Subrahmanyan
1989
Selected papers. Vol. 1: Stellar structure and stellar atmospheres. Zbl 1098.01519
Chandrasekhar, S.
1989
Selected papers. Volume 2: Radiative transfer and negative ion of hydrogen. Zbl 0749.01014
Chandrasekhar, S.
1989
Selected papers. Volume 3: Stochastic, statistical, and hydromagnetic problems in physics and astronomy. With a foreword by Norman R. Lebovitz. Zbl 0734.01025
Chandrasekhar, S.
1989
Two black holes attached to strings. Zbl 0687.53064
Chandrasekhar, Subrahmanyan; Xanthopoulos, B. C.
1989
A one-to-one correspondence between the static Einstein-Maxwell and stationary Einstein-vacuum space-times. Zbl 0683.53072
Chandrasekhar, Subrahmanyan
1989
Selected papers. Volume 4: Plasma physics, hydrodynamic and hydromagnetic stability, and applications of the tensor-virial theorem. With a foreword by Norman R. Lebovitz. Zbl 0734.01026
Chandrasekhar, S.
1989
A perturbation analysis of the Bell-Szekeres space-time. Zbl 0656.53071
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1988
On Ramanujan. Zbl 0641.01021
Chandrasekhar, S.
1988
On colliding waves that develop time-like singularities: a new class of solutions of the Einstein-Maxwell equations. Zbl 0621.53068
Chandrasekhar, Subrahmanyan; Xantopoulos, Basilis C.
1987
A new type of singularity created by colliding gravitational waves. Zbl 0624.53051
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1986
Cylindrical waves in general relativity. Zbl 0612.53052
Chandrasekhar, Subrahmanyan
1986
On the collision of impulsive gravitational waves when coupled with null dust. Zbl 0582.53051
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1986
On colliding waves in the Einstein-Maxwell theory. Zbl 0561.53065
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1985
On the collision of impulsive gravitational waves when coupled with fluid motions. Zbl 0574.53054
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1985
Some exact solutions of gravitational waves coupled with fluid motions. Zbl 0582.53052
Chandrasekhar, Subrahmanyan; Xanthopoulos, Basilis C.
1985
On the Nutku-Halil solution for colliding impulsive gravitational waves. Zbl 0548.53036
Chandrasekhar, Subrahmanyan; Ferrari, Valeria
1984
The mathematical theory of black holes. Zbl 0511.53076
Chandrasekhar, S.
1983
Ellipsoidal figures of equilibrium. (Ellipsoidal’nye figury ravnovesija.) Übersetzung aus dem Englischen von V. N. Rubanovskii. Herausgegeben von V. V. Rumjancev. Zbl 0257.76012
Chandrasekhar, S.
1973
Ellipsoidal figures of equilibrium. Zbl 0213.52304
Chandrasekhar, S.
1969
A tensor virial-equation for stellar dynamics. Zbl 0164.55004
Chandrasekhar, S.; Lee, Edward P.
1968
Ellipsoidal figures of equilibrium. An historical account. Zbl 0149.24301
Chandrasekhar, S.
1967
On a post-Galilean transformation appropriate to the post-Newtonian theory of Einstein, Infeld and Hoffmann. Zbl 0158.43101
Chandrasekhar, S.; Contopoulos, G.
1967
The equilibrium and the stability of the Riemann ellipsoids. II. Zbl 0147.44402
Chandrasekhar, S.
1966
The stability of a rotating liquid drop. Zbl 0137.23004
Chandrasekhar, S.
1965
Post-Newtonian equations of hydrodynamics and the stability of gaseous masses in general relativity. Zbl 0131.43104
Chandrasekhar, S.
1965
The equilibrium and the stability of the Riemann ellipsoids. I. Zbl 0147.44401
Chandrasekhar, S.
1965
Propagation of elastic waves in liquid crystals. Zbl 0127.41403
Chandrasekhar, S.
1964
The dynamical instability of gaseous masses approaching the Schwarzschild limit in general relativity. Zbl 0151.47102
Chandrasekhar, S.
1964
Dynamical instability of gaseous masses approaching the Schwarzschild limit in general relativity. Zbl 0116.21704
Chandrasekhar, S.
1964
A general variational principle governing the radial and the non-radial oscillations of gaseous masses. Zbl 0151.47403
Chandrasekhar, S.
1964
The dynamical instability of the white-dwarf configurations approaching the limiting mass. Zbl 0124.22102
Chandrasekhar, S.; Tooper, R. F.
1964
On the ellipsoidal figures of equilibrium of homogeneous masses. Zbl 0151.47501
Chandrasekhar, S.; Lebovitz, N. R.
1964
Non-radial oscillations and convective instability of gaseous masses. Zbl 0117.45701
Chandrasekhar, S.; Lebovitz, N. R.
1963
The equilibrium and the stability of the Roche ellipsoids. Zbl 0135.23506
Chandrasekhar, S.
1963
On the oscillations of the Maclaurin spheroid belonging to the third harmonics. Zbl 0129.47004
Chandrasekhar, S.; Lebovitz, N. R.
1963
On the stability of the Jacobi ellipsoids. Zbl 0129.47003
Chandrasekhar, S.; Lebovitz, N. R.
1963
The virial theorem in general relativity in the post-Newtonian approximation. Zbl 0114.21107
Chandrasekhar, S.; Contopoulos, G.
1963
The points of bifurcation along the Maclaurin, the Jacobi, and the Jeans sequences. Zbl 0117.45606
Chandrasekhar, S.
1963
The stability of spiral flow between rotating cylinders. Zbl 0112.41902
Chandrasekhar, S.
1962
The stability of viscous flow between rotating cylinders. II. Zbl 0115.21305
Chandrasekhar, S.; Elbert, D. D.
1962
Hydrodynamic and hydromagnetic stability. Zbl 0142.44103
Chandrasekhar, S.
1961
The geodesics in Gödel’s universe. Zbl 0097.21901
Chandrasekhar, S.; Wright, James P.
1961
The stability of viscous flow between rotating cylinders in the presence of a magnetic field. II. Zbl 0104.21101
Chandrasekhar, S.; Elbert, Donna D.
1961
The stability of viscous flow in a curved channel in the presence of a magnetic field. Zbl 0108.20602
Chandrasekhar, S.; Elbert, D. D.; Lebovitz, N. R.
1961
The stability of non-dissipative Couette flow in hydromagnetics. Zbl 0094.40401
Chandrasekhar, S.
1960
The hydrodynamic stability of viscid flow between coaxial cylinders. Zbl 0095.21704
Chandrasekhar, S.
1960
The hydrodynamic stability of inviscid flow between coaxial cylinders. Zbl 0095.21703
Chandrasekhar, S.
1960
Plasma physics. Zbl 0098.22705
Chandrasekhar, S.
1960
The virial theorem in hydromagnetics. Zbl 0094.43703
Chandrasekhar, S.
1960
Magnetohydrodynamics. Zbl 0105.40201
Chandrasekhar, S.
1960
The oscillations of a viscous liquid globe. Zbl 0085.20403
Chandrasekhar, S.
1959
On the equilibrium configurations of an incompressible fluid with axisymmetric motions and magnetic fields. Zbl 0082.20502
Chandrasekhar, S.
1958
On force-free magnetic fields. Zbl 0080.41201
Chandrasekhar, S.; Woltjer, L.
1958
The stability of viscous flow between rotating cylinders. Zbl 0082.18901
Chandrasekhar, S.
1958
The stability of the pinch. Zbl 0080.41202
Chandrasekhar, S.; Kaufman, A. N.; Watson, K. M.
1958
On the diffuse reflection of a pencil of radiation by a plane-parallel atmosphere. Zbl 0082.40602
Chandrasekhar, S.
1958
Properties of an ionized gas of low density in a magnetic field. IV. Zbl 0082.45203
Chandrasekhar, Subrahmanyan; Kaufman, Allan N.; Watson, Kenneth M.
1958
An introduction to the study of stellar structure. Zbl 0079.23901
Chandrasekhar, S.
1957
On cosmic magnetic fields. Zbl 0123.23604
Chandrasekhar, S.
1957
On the expansion of functions which satisfy four boundary conditions. Zbl 0078.07504
Chandrasekhar, S.; Reid, W. H.
1957
The hydrodynamic stability of helium II between rotating cylinders. I. Zbl 0090.42003
Chandrasekhar, S.; Donnelly, R. J.
1957
Properties of an ionized gas of a low density in a magnetic field. III. Zbl 0081.45001
Chandrasekhar, S.; Kaufman, A. N.; Watson, K. M.
1957
On force-free magnetic fields. Zbl 0074.22001
Chandrasekhar, S.
1956
The equilibrium of magnetic stars. Zbl 0074.22002
Chandrasekhar, S.; Prendergast, Kevin H.
1956
On the stability of the simplest solution of the equations of hydromagnetics. Zbl 0072.22905
Chandrasekhar, S.
1956
Theory of turbulence. Zbl 0070.43001
Chandrasekhar, S.
1956
On Cowling’s theorem on the impossibility of self-maintained axisymmetric homogeneous dynamos. Zbl 0072.22904
Backus, G. E.; Chandrasekhar, S.
1956
The instability of a layer of fluid heated below and subject to the simultaneous action of a magnetic field and rotation. II. Zbl 0071.44801
Chandrasekhar, S.
1956
A theory of turbulence. Zbl 0064.43702
Chandrasekhar, S.
1955
The character of the equilibrium of an incompressible heavy viscous fluid of variable density. Zbl 0074.42306
Chandrasekhar, S.
1955
The instability of a layer of fluid heated below and subject to coriolis forces. II. Zbl 0065.45604
Chandrasekhar, S.; Elbert, Donna D.
1955
The character of the equilibrium of an incompressible fluid sphere of variable density and viscosity subject to radial acceleration. Zbl 0068.39005
Chandrasekhar, S.
1955
Selected papers on noise and stochastic processes. Zbl 0059.11903
Wax, N.; Doob, Joseph L.; Chandrasekhar, S.; Rice, S. O.; Uhlenbeck, G. E.; Kac, M.; Ornstein, L. S.
1954
The stability of viscous flow between rotating cylinders. Zbl 0056.42904
Chandrasekhar, S.
1954
The instability of a layer of fluid heated below and subject to the simultaneous action of a magnetic field and rotation. Zbl 0055.45306
Chandrasekhar, S.
1954
On characteristic value problems in high order differential equations which arise in studies on hydrodynamic and hydromagnetic stability. Zbl 0056.08303
Chandrasekhar, S.
1954
Examples of the instability of fluid motion in the presence of a magnetic field. Zbl 0058.22501
Chandrasekhar, S.
1954
The stability of viscous flow between rotating cylinders in the presence of a radial temperature gradient. Zbl 0055.18604
Chandrasekhar, S.
1954
The roots of $${Y_n(\lambda\eta)J_n(\lambda)- J_n(\lambda\eta)Y_n(\lambda)=0}$$. Zbl 0055.11904
Chandrasekhar, S.; Elbert, Donna
1954
The instability of a layer of fluid heated below and subject to Coriolis forces. Zbl 0053.19102
Chandrasekhar, S.
1953
The stability of viscous flow between rotating cylinders in the presence of a magnetic field. Zbl 0050.19603
Chandrasekhar, S.
1953
Problems of stability in hydrodynamics and hydromagnetics. Zbl 0053.19103
Chandrasekhar, S.
1953
Theoretical interpretation of the optical activity of quartz. Zbl 0051.43204
Chandrasekhar, S.
1953
The onset of convection by thermal instability in spherical shells. Zbl 0051.23903
Chandrasekhar, S.
1953
On the inhibition of convection by a magnetic field. Zbl 0046.24002
Chandrasekhar, S.
1952
A statistical basis for the theory of stellar scintillation. Zbl 0048.43303
Chandrasekhar, S.
1952
The $$X$$- and $$Y$$-functions for isotropic scattering. I. Zbl 0047.37206
Chandrasekhar, S.; Elbert, Donna; Franklin, Ann
1952
The thermal instability of a fluid sphere heated within. Zbl 0048.23903
Chandrasekhar, S.
1952
The invariant theory of isotropic turbulence in magneto-hydrodynamics. I. II. Zbl 0043.19110
Chandrasekhar, S.
1951
The fluctuations of density in isotropic turbulence. Zbl 0044.21203
Chandrasekhar, S.
1951
...and 51 more Documents
all top 5
#### Cited by 5,357 Authors
31 Argyros, Ioannis Konstantinos 23 Hod, Shahar 21 Sharma, R. C. 19 Ueno, Sueo 18 Rionero, Salvatore 17 Banaś, Józef 16 Hashim, Ishak 16 Mulone, Giuseppe 16 Radwan, Ahmed Elazab 15 Nath Das, Rabindra 15 Sakalli, Izzet 15 Zecca, Antonio 14 Ducomet, Bernard 14 Straughan, Brian 14 Wazwaz, Abdul-Majid Abdul-Rahman 13 Pavlov, Yuri V. 12 Siddheshwar, Pradeep G. 11 Bellman, Richard Ernest 11 Bini, Donato 11 Ernst, Frederick J. jun. 11 Hilout, Saïd 10 Van der Mee, Cornelis Victor Maria 10 Wang, Anzhong 10 Yuen, Manwai 9 Banerjee, Mihir B. 9 Chandrasekhar, Subrahmanyan 9 Chavanis, Pierre-Henri 9 Geralico, Andrea 9 Grib, Andrey A. 9 Hauser, Isidore 9 Holm, Darryl D. 9 Sadarangani, Kishin B. 9 Siddiqi, Shahid Saeed 9 Sunil, Bharti P. K. 9 Wang, Alan Ping-I 8 Bal, Guillaume 8 Chhajlani, R. K. 8 Fernando, Sharmanthie 8 Geroyannis, V. S. 8 Jang, Juhi 8 Mahajan, Amit 8 Rahaman, Farook 8 Ratiu, Tudor Stefan 8 Santos, Nilton O. 8 Shandil, R. G. 8 Smoller, Joel A. 8 Xanthopoulos, Basilis C. 7 Akram, Ghazala 7 Băleanu, Dumitru I. 7 Busse, Friedrich Hermann 7 Caimmi, Roberto 7 Gupta, J. R. P. 7 Herron, Isom H. jun. 7 Jiang, Fei 7 Khalique, Chaudry Masood 7 Kuznetsov, Aleksandr V. 7 López-Ortega, A. 7 Lueptow, Richard M. 7 Luo, Tao 7 Marsden, Jerrold Eldon 7 Moatimid, Galal M. 7 Nečasová, Šárka 7 Rajagopal, Kumbakonam Ramamani 7 Riahi, Daniel N. 7 Rosensteel, George 7 Siewert, C. E. 6 Al Badawi, Ahmad 6 Bag, Bidhan Chandra 6 Bogoyavlenskij, Oleg Igorevich 6 El-Dib, Yusry O. 6 Elhefnawy, Abdel Raouf F. 6 García, Alberto A. 6 Goudon, Thierry 6 Grib, Andrei A. 6 Izumiya, Shyuichi 6 Kadem, Abdelouahab 6 Kalaba, Robert E. 6 Karanjai, S. 6 Kholshevnikov, Konstantin Vladislavovich 6 Knobloch, Edgar 6 Makino, Tetu 6 Malik, S. K. 6 Mattei, Giulio 6 Muatjetjeja, Ben 6 Nguyen Huy Tuan 6 Park, Dae Kil 6 Roberts, Paul H. 6 Sastry, V. U. K. 6 Sharif, Muhammad 6 Shen, Yougen 6 Shivakumara, I. S. 6 Srivastava, Krishna M. 6 Vasudevan, Ramabhadra 6 Yamazaki, Kazuo 5 Agrawal, G. S. 5 Barletta, Andrea 5 Capone, Florinda 5 Chen, Cha’o-Kuang 5 Darwish, Mohamed Abdalla 5 Dymnikova, Irina Gavriilovna ...and 5,257 more Authors
all top 5
#### Cited in 417 Serials
200 General Relativity and Gravitation 187 Astrophysics and Space Science 155 Journal of Mathematical Analysis and Applications 144 Journal of Mathematical Physics 143 Journal of Computational Physics 109 Applied Mathematics and Computation 87 International Journal of Engineering Science 84 Physica D 84 International Journal of Modern Physics D 64 Journal of Fluid Mechanics 63 International Journal of Theoretical Physics 61 Physical Review, II. Series 52 Physics Letters. A 51 Journal of Statistical Physics 51 European Journal of Mechanics. B. Fluids 50 Acta Mechanica 50 Annals of Physics 48 Modern Physics Letters A 47 Computers & Mathematics with Applications 45 Physics Letters. B 44 Archive for Rational Mechanics and Analysis 44 Journal of Differential Equations 43 Journal of Computational and Applied Mathematics 36 Physica A 35 International Journal of Heat and Mass Transfer 34 ZAMP. Zeitschrift für angewandte Mathematik und Physik 34 Chaos, Solitons and Fractals 33 Physics of Fluids 33 Journal of High Energy Physics 31 Communications in Mathematical Physics 30 Transport Theory and Statistical Physics 29 International Journal of Modern Physics A 29 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 28 Computers and Fluids 27 Nuclear Physics. B 23 Astronomische Nachrichten 23 Classical and Quantum Gravity 23 Applied Mathematical Modelling 23 Celestial Mechanics and Dynamical Astronomy 22 Fluid Dynamics 21 Computer Physics Communications 20 Theoretical and Mathematical Physics 20 Transactions of the American Mathematical Society 20 Communications in Nonlinear Science and Numerical Simulation 19 Physics Reports 19 Theoretical and Computational Fluid Dynamics 19 Living Reviews in Relativity 18 Mathematical and Computer Modelling 18 Gravitation & Cosmology 18 Nonlinear Analysis. Real World Applications 17 Reviews of Modern Physics 17 Applied Mathematics Letters 16 Applied Numerical Mathematics 16 Mathematical Problems in Engineering 16 Advances in High Energy Physics 15 Computer Methods in Applied Mechanics and Engineering 15 Geophysical and Astrophysical Fluid Dynamics 15 Journal of Functional Analysis 15 Journal of Statistical Mechanics: Theory and Experiment 14 Mathematical Biosciences 14 Journal of Mathematical Chemistry 13 Reports on Mathematical Physics 13 Meccanica 13 International Journal of Applied and Computational Mathematics 12 Journal of Engineering Mathematics 12 Physics of Fluids 12 Journal of Geometry and Physics 11 Numerical Algorithms 11 Continuum Mechanics and Thermodynamics 10 Wave Motion 10 Annali di Matematica Pura ed Applicata. Serie Quarta 10 Acta Applicandae Mathematicae 10 Abstract and Applied Analysis 10 Journal of Applied Mathematics 10 Foundations of Physics 9 Mathematical Methods in the Applied Sciences 9 Annales de l’Institut Henri Poincaré. Analyse Non Linéaire 9 Calculus of Variations and Partial Differential Equations 9 International Journal of Geometric Methods in Modern Physics 9 Nonlinear Analysis. Theory, Methods & Applications 8 Journal of Applied Mathematics and Mechanics 8 Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 8 Journal of Scientific Computing 8 Celestial Mechanics 8 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 8 Journal of Mathematical Fluid Mechanics 8 Applied Scientific Research, Section A 7 Earth, Moon, and Planets 7 Journal of the Franklin Institute 7 Mathematics of Computation 7 Bulletin of Mathematical Biology 7 Quarterly of Applied Mathematics 7 Ricerche di Matematica 7 M$$^3$$AS. Mathematical Models & Methods in Applied Sciences 7 Historia Mathematica 7 Journal of Nonlinear Science 7 Chaos 7 Regular and Chaotic Dynamics 7 Annales Henri Poincaré 7 Journal of Applied Mathematics and Computing ...and 317 more Serials
all top 5
#### Cited in 53 Fields
1,401 Fluid mechanics (76-XX) 834 Relativity and gravitational theory (83-XX) 648 Partial differential equations (35-XX) 439 Numerical analysis (65-XX) 439 Astronomy and astrophysics (85-XX) 337 Statistical mechanics, structure of matter (82-XX) 233 Ordinary differential equations (34-XX) 223 Classical thermodynamics, heat transfer (80-XX) 192 Quantum theory (81-XX) 188 Integral equations (45-XX) 188 Differential geometry (53-XX) 186 Probability theory and stochastic processes (60-XX) 170 Mechanics of particles and systems (70-XX) 126 Dynamical systems and ergodic theory (37-XX) 119 Operator theory (47-XX) 108 Biology and other natural sciences (92-XX) 99 Optics, electromagnetic theory (78-XX) 72 Mechanics of deformable solids (74-XX) 55 Geophysics (86-XX) 48 Global analysis, analysis on manifolds (58-XX) 37 Calculus of variations and optimal control; optimization (49-XX) 32 Special functions (33-XX) 29 History and biography (01-XX) 24 Statistics (62-XX) 21 Systems theory; control (93-XX) 21 Information and communication theory, circuits (94-XX) 19 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 18 Real functions (26-XX) 18 Functional analysis (46-XX) 15 Integral transforms, operational calculus (44-XX) 12 Computer science (68-XX) 9 Functions of a complex variable (30-XX) 9 Approximations and expansions (41-XX) 9 Harmonic analysis on Euclidean spaces (42-XX) 8 General and overarching topics; collections (00-XX) 7 Mathematical logic and foundations (03-XX) 7 Potential theory (31-XX) 7 Operations research, mathematical programming (90-XX) 6 Linear and multilinear algebra; matrix theory (15-XX) 5 Combinatorics (05-XX) 4 Topological groups, Lie groups (22-XX) 4 Measure and integration (28-XX) 4 Sequences, series, summability (40-XX) 4 General topology (54-XX) 3 Algebraic geometry (14-XX) 3 Nonassociative rings and algebras (17-XX) 3 Several complex variables and analytic spaces (32-XX) 2 Manifolds and cell complexes (57-XX) 1 Associative rings and algebras (16-XX) 1 Group theory and generalizations (20-XX) 1 Difference and functional equations (39-XX) 1 Geometry (51-XX) 1 Mathematics education (97-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-03-02T10:48:26 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.48237189650535583, "perplexity": 4378.6109733259855}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-10/segments/1614178363809.24/warc/CC-MAIN-20210302095427-20210302125427-00338.warc.gz"}
|
http://dlmf.nist.gov/6.13
|
§6.13 Zeros
The function $\mathop{\mathrm{Ei}\/}\nolimits\!\left(x\right)$ has one real zero $x_{0}$, given by
6.13.1 $x_{0}=0.37250\;74107\;81366\;63446\;19918\;66580\dots.$ Notes: For more digits see OEIS Sequence A091723; see also Sloane (2003). Symbols: $x$: real variable Referenced by: §6.13 Permalink: http://dlmf.nist.gov/6.13.E1 Encodings: TeX, pMML, png
$\mathop{\mathrm{Ci}\/}\nolimits\!\left(x\right)$ and $\mathop{\mathrm{si}\/}\nolimits\!\left(x\right)$ each have an infinite number of positive real zeros, which are denoted by $c_{k}$, $s_{k}$, respectively, arranged in ascending order of absolute value for $k=0,1,2,\dots$. Values of $c_{1}$ and $c_{2}$ to 30D are given by MacLeod (1996b).
As $k\to\infty$,
6.13.2 $c_{k},s_{k}\sim\alpha+\frac{1}{\alpha}-\frac{16}{3}\frac{1}{\alpha^{3}}+\frac{% 1673}{15}\frac{1}{\alpha^{5}}-\frac{5\;07746}{105}\frac{1}{\alpha^{7}}+\cdots,$
where $\alpha=k\pi$ for $c_{k}$, and $\alpha=(k+\frac{1}{2})\pi$ for $s_{k}$. For these results, together with the next three terms in (6.13.2), see MacLeod (2002a). See also Riekstynš (1991, pp. 176–177).
| 2014-07-29T18:50:02 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 23, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9431694149971008, "perplexity": 1271.7308766608646}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2014-23/segments/1406510267824.47/warc/CC-MAIN-20140728011747-00105-ip-10-146-231-18.ec2.internal.warc.gz"}
|
https://rpm.physics.lbl.gov/event/gaosong-li-shanghai-jiao-tong-university-daya-bay-experiment/
|
• This event has passed.
# Gaosong Li (Shanghai Jiao Tong University) – "Daya Bay Experiment"
## January 26, 2016 @ 4:00 pm - 5:00 pm
Abstract:
The Daya Bay Reactor Neutrino Experiment is designed to measure the neutrino mixing angle with unprecedented precision. The experiment utilizes multiple pairs of identical antineutrino detectors (ADs) at different baselines from three pairs of reactor cores to minimize systematic uncertainties. In 2012, Daya Bay made the first definitive measurement of a non-zero value for $\theta_{13}$ using the first 55 days of data collected with six ADs by measuring the antineutrino rate deficit. With the final two ADs installed, Daya Bay resumed data taking in full 8-AD configuration in late 2012. More than 1 (0.15) million electron antineutrino candidates had been collected with the near (far) site detectors by the end of 2013, significantly improving the precision on . In addition to precision measurement of neutrino oscillation parameters, analyses exploring various other physics potential are carried out.
In this talk, I will focus on the calibration system. I will present calibration related works I have been working on to improve the detector absolute efficiency and neutrino oscillation analysis. I will also present the results on neutrino oscillation parameters from an independent analysis.
## Details
Date:
January 26, 2016
Time:
4:00 pm - 5:00 pm
## Venue
Zoom Talk
50A-5132
Berkeley, ca 94720
| 2022-08-09T10:07:06 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5542568564414978, "perplexity": 3036.797866043579}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-33/segments/1659882570921.9/warc/CC-MAIN-20220809094531-20220809124531-00196.warc.gz"}
|
https://par.nsf.gov/biblio/10363274
|
The MOSFIRE Deep Evolution Field Survey: Implications of the Lack of Evolution in the Dust Attenuation–Mass Relation to z ∼ 2*
Abstract
We investigate the relationship between dust attenuation and stellar mass (M*) in star-forming galaxies over cosmic time. For this analysis, we compare measurements from the MOSFIRE Deep Evolution Field survey atz∼ 2.3 and the Sloan Digital Sky Survey (SDSS) atz∼ 0, augmenting the latter optical data set with both UV Galaxy Evolution Explorer (GALEX) and mid-infrared Wide-field Infrared Survey Explorer (WISE) photometry from the GALEX-SDSS-WISE Catalog. We quantify dust attenuation using both spectroscopic measurements of Hαand Hβemission lines, and photometric measurements of the rest-UV stellar continuum. The Hα/Hβratio is used to determine the magnitude of attenuation at the wavelength of Hα,AHα. Rest-UV colors and spectral energy distribution fitting are used to estimateA1600, the magnitude of attenuation at a rest wavelength of 1600 Å. As in previous work, we find a lack of significant evolution in the relation between dust attenuation andM*over the redshift rangez∼ 0 toz∼ 2.3. Folding in the latest estimates of the evolution ofMdust, (Mdust/Mgas), and gas surface density at fixedM*, we find that the expectedMdustand dust mass surface density are both significantly higher atz∼ 2.3 than atz∼ 0. These differences appear at odds with the lack of evolution in dust attenuation. To explain the striking constancy more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10363274
Journal Name:
The Astrophysical Journal
Volume:
926
Issue:
2
Page Range or eLocation-ID:
Article No. 145
ISSN:
0004-637X
Publisher:
DOI PREFIX: 10.3847
We report the discovery of a double-peaked Lyman-α (Ly α) emitter (LAE) at z = 3.2177 ± 0.0001 in VLT/MUSE data. The galaxy is strongly lensed by the galaxy cluster RXC J0018.5+1626 recently observed in the RELICS survey, and the double-peaked Ly α emission is clearly detected in the two counter images in the MUSE field of view. We measure a relatively high Ly α rest-frame equivalent width (EW) of EWLy α, 0 = (63 ± 2) Å. Additional spectroscopy with Gemini/GNIRS in the near-infrared (NIR) allows us to measure the H β, [O iii] λ4959 Å, and [O iii] λ5007 Å emission lines, which show moderate rest-frame EWs of the order of a few ∼10–100 Å, an [O iii] λ5007 Å/H β ratio of 4.8 ± 0.7, and a lower limit on the [O iii]/[O ii] ratio of >9.3. The galaxy has very blue UV-continuum slopes of βFUV = −2.23 ± 0.06 and βNUV = −3.0 ± 0.2, and is magnified by factors μ ∼ 7–10 in each of the two images, thus enabling a view into a low-mass ($M_{\star }\simeq 10^{7.5}\, \mathrm{M}_{\odot }$) high-redshift galaxy analogue. Notably, the blue peak of the Ly α profile is significantly stronger than the red peak, which suggests an inflow of matter and possibly very low H i column densities in its circumgalactic gas. To the best of our knowledge, this is the first detection of suchmore »
| 2023-02-03T05:16:30 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5538589358329773, "perplexity": 3173.199761191395}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500042.8/warc/CC-MAIN-20230203024018-20230203054018-00875.warc.gz"}
|
https://designfils.eba.gov.tr/blog/index.php?entryid=88772
|
## V-Ray Next Build 4.00.03 For Revit 2015-2020 Win
Please see the readme attached for further details. V-Ray Next Build 4.00.03 for Revit 2015-2020. Install Windows 7/8/8.1/10. VrayNext Revit 2020 Windows Hello-Face Authentication.. First, install the Chaos Group's vray_next_build. Previous. With VrayV-Ray Next Build 4.00.03 for Revit 2015-2020 Win crack, you can create sophisticated Virtual Environment...[Periventricular white matter lesions in asymptomatic patients with mixed dementia and dementia with Lewy bodies]. To examine whether periventricular white matter lesions (PVL) correlate with neuropsychological impairments in patients with mixed dementia and dementia with Lewy bodies. Thirty patients with dementia (21 mixed dementia and 9 dementia with Lewy bodies) and 30 age-matched normal controls were enrolled in the study. Quantitative volumetric magnetic resonance imaging (MRI) and neuropsychological examinations were done. PVL were measured in the deep white matter. PVL were present in 13 (65%) of the patients with dementia, but in only one control. PVL volume was correlated with the Hasegawa dementia score, the Clinical Dementia Rating scale and the mini-mental state examination score in patients with mixed dementia and dementia with Lewy bodies. However, PVL did not correlate with the neuropsychological tests in any patient group. These findings suggest that PVL are associated with dementia in patients with mixed dementia and dementia with Lewy bodies, even in the absence of overt dementia.Q: What is the sub property of this isomorphism? I would like to know the subset of the following isomorphism. $$\iota_p: \text{Hom}(A, B) \to \text{Hom}(B, B)$$ where $\iota_p(f) = f\circ p: B\to B$, $\forall f\in \text{Hom}(A, B)$. My attempt: I think $\iota_p$ is the map $$\iota_p: \text{Hom}(A, B) \to \text{Hom}(B, B)$$ such that $$\iota_p(f)(b) = f(p(b))$$ for $\forall b\in B$. Is this correct?
| 2022-10-05T08:19:35 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.45861420035362244, "perplexity": 8585.643151660168}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-40/segments/1664030337595.1/warc/CC-MAIN-20221005073953-20221005103953-00067.warc.gz"}
|
https://math.libretexts.org/TextMaps/Calculus_TextMaps/Map%3A_Calculus_(Apex)/8%3A_Sequences_and_Series/8.2%3A_Infinite_Series
|
# 8.2: Infinite Series
Given the sequence $$\{a_n\} = \{1/2^n\} = 1/2,\ 1/4,\ 1/8,\ \ldots$$, consider the following sums:
$\begin{array}{ccccc} a_1 &=& 1/2 &=& 1/2\\ a_1+a_2 &=& 1/2+1/4 &=& 3/4\\ a_1+a_2+a_3 &=& 1/2+1/4+1/8 &=& 7/8\\ a_1+a_2+a_3+a_4 &=& 1/2+1/4+1/8+1/16 & =& 15/16 \end{array}$
In general, we can show that
$a_1+a_2+a_3+\cdots +a_n = \frac{2^n-1}{2^n} = 1-\frac{1}{2^n}.$
Let $$S_n$$ be the sum of the first $$n$$ terms of the sequence $$\{1/2^n\}$$. From the above, we see that $$S_1=1/2$$, $$S_2 = 3/4$$, etc. Our formula at the end shows that $$S_n = 1-1/2^n$$.
Now consider the following limit:
$\lim\limits_{n\to\infty}S_n = \lim\limits_{n\to\infty}\big(1-1/2^n\big) = 1.$
This limit can be interpreted as saying something amazing: the sum of all the terms of the sequence $$\{1/2^n\}$$ is 1.}
This example illustrates some interesting concepts that we explore in this section. We begin this exploration with some definitions.
Definition 31 Infinite Series, $$n^\text{th}$$ Partial Sums, Convergence, Divergence
Let $$\{a_n\}$$ be a sequence.
1. The sum $$\sum\limits_{n=1}^\infty a_n$$ is an infinite series (or, simply series).
2. Let $$S_n = \sum\limits_{i=1}^n a_i$$; the sequence $$\{S_n\}$$ is the sequence of $$n^\text{th}$$ partial sums of $$\{a_n\}$$.
3. If the sequence $$\{S_n\}$$ converges to $$L$$, we say the series $$\sum\limits_{n=1}^\infty a_n$$ converges to $$L$$, and we write $$\sum\limits_{n=1}^\infty a_n = L$$.
4. If the sequence $$\{S_n\}$$ diverges, the series $$\sum\limits_{n=1}^\infty a_n$$ diverges.
Using our new terminology, we can state that the series $$\sum\limits_{n=1}^\infty 1/2^n$$ converges, and $$\sum\limits_{n=1}^\infty 1/2^n = 1.$$
We will explore a variety of series in this section. We start with two series that diverge, showing how we might discern divergence.
Example $$\PageIndex{1}$$: Showing series diverge
1. Let $$\{a_n\} = \{n^2\}$$. Show $$\sum\limits_{n=1}^\infty a_n$$ diverges.
2. Let $$\{b_n\} = \{(-1)^{n+1}\}$$. Show $$\sum\limits_{n=1}^\infty b_n$$ diverges.
SOLUTION
1. Consider $$S_n$$, the $$n^\text{th}$$ partial sum.
\begin{align*} S_n &= a_1+a_2+a_3+\cdots+a_n \\ &= 1^2+2^2+3^2\cdots + n^2.\end{align*}
By Theorem 37, this is
$= \frac{n(n+1)(2n+1)}{6}.$
Since $$\lim\limits_{n\to\infty}S_n = \infty$$, we conclude that the series $$\sum\limits_{n=1}^\infty n^2$$ diverges. It is instructive to write $$\sum\limits_{n=1}^\infty n^2=\infty$$ for this tells us how the series diverges: it grows without bound.
A scatter plot of the sequences $$\{a_n\}$$ and $$\{S_n\}$$ is given in Figure 8.7(a). The terms of $$\{a_n\}$$ are growing, so the terms of the partial sums $$\{S_n\}$$ are growing even faster, illustrating that the series diverges.
2. The sequence $$\{b_n\}$$ starts with 1, $$-1$$, 1, $$-1$$, $$\ldots$$. Consider some of the partial sums $$S_n$$ of $$\{b_n\}$$:
\begin{align*}S_1 &= 1\\S_2 &= 0\\S_3 &= 1\\S_4 &= 0\end{align*}
This pattern repeats; we find that $$S_n = \left\{\begin{array}{cc} 1 & n \text{ is odd}\\ 0 & n \text{ is even} \end{array}\right.$$
As $$\{S_n\}$$ oscillates, repeating 1, 0, 1, 0, $$\ldots$$, we conclude that $$\lim\limits_{n\to\infty}S_n$$ does not exist, hence $$\sum\limits_{n=1}^\infty (-1)^{n+1}$$ diverges.
A scatter plot of the sequence $$\{b_n\}$$ and the partial sums $$\{S_n\}$$ is given in Figure 8.7(b). When $$n$$ is odd, $$b_n = S_n$$ so the marks for $$b_n$$ are drawn oversized to show they coincide.
Figure 8.7:
Scatter plots relating to Example 8.2.1.
While it is important to recognize when a series diverges, we are generally more interested in the series that converge. In this section we will demonstrate a few general techniques for determining convergence; later sections will delve deeper into this topic.
#### Geometric Series
One important type of series is a geometric series.
Definition 32 geometric series
A geometric series is a series of the form
$\sum\limits_{n=0}^\infty r^n = 1+r+r^2+r^3+\cdots+r^n+\cdots$
Note that the index starts at $$n=0$$, not $$n=1$$.
We started this section with a geometric series, although we dropped the first term of $$1$$. One reason geometric series are important is that they have nice convergence properties.
theorem 60 convergence of geometric series
Consider the geometric series $$\sum\limits_{n=0}^\infty r^n$$.
1. The $$n^\text{th}$$ partial sum is: $$S_n = \frac{1-r\,^{n+1}}{1-r}$$.
2. The series converges if, and only if, $$|r| < 1$$. When $$|r|<1$$,
$\sum\limits_{n=0}^\infty r^n = \frac{1}{1-r}.$
According to Theorem 60, the series
$\sum\limits_{n=0}^\infty \frac{1}{2^n} =\sum\limits_{n=0}^\infty \left(\frac 12\right)^2= 1+\frac12+\frac14+\cdots$
converges as $$r=1/2$$, and $$\sum\limits_{n=0}^\infty \frac{1}{2^n} = \frac{1}{1-1/2} = 2.$$ This concurs with our introductory example; while there we got a sum of 1, we skipped the first term of 1.
Example $$\PageIndex{2}$$: Exploring geometric series
Check the convergence of the following series. If the series converges, find its sum.
$$1. \sum\limits_{n=2}^\infty \left(\frac34\right)^n \qquad 2. \sum\limits_{n=0}^\infty \left(\frac{-1}{2}\right)^n \qquad 3. \sum\limits_{n=0}^\infty 3^n$$
SOLUTION
Figure 8.8:
Scatter plots relating to the series in Example 8.2.2
1. Since $$r=3/4<1$$, this series converges. By Theorem 60, we have that
$\sum\limits_{n=0}^\infty \left(\frac34\right)^n = \frac{1}{1-3/4} = 4.$
However, note the subscript of the summation in the given series: we are to start with $$n=2$$. Therefore we subtract off the first two terms, giving:
$\sum\limits_{n=2}^\infty \left(\frac34\right)^n = 4 - 1 - \frac34 = \frac94.$
This is illustrated in Figure 8.8.
2. Since $$|r| = 1/2 < 1$$, this series converges, and by Theorem 60,
$\sum\limits_{n=0}^\infty \left(\frac{-1}{2}\right)^n = \frac{1}{1-(-1/2)} = \frac23.$
The partial sums of this series are plotted in Figure 8.9(a). Note how the partial sums are not purely increasing as some of the terms of the sequence $$\{(-1/2)^n\}$$ are negative.
3. Since $$r>1$$, the series diverges. (This makes "common sense''; we expect the sum
$1+3+9+27 + 81+243+\cdots$
to diverge.) This is illustrated in Figure 8.9(b).
Figure 8.9:
Scatter plots relating to the series in Example 8.2.2.
#### p-Series
Another important type of series is the p-series.
Definition 33: $$p$$-Series, General $$P$$-Series
1. A $$p$$--series is a series of the form $\sum\limits_{n=1}^\infty \frac{1}{n^p}, \qquad \text{where $$p>0$$.}$
2. A general $$p$$--series} is a series of the form
$\sum\limits_{n=1}^\infty \frac{1}{(an+b)^p}, \qquad \text{where $$p>0$$ and $$a$$, $$b$$ are real numbers.}$
Like geometric series, one of the nice things about p--series is that they have easy to determine convergence properties.
theorem 61: convergence of general $$P$$--Series
A general $$p$$--series $$\sum\limits_{n=1}^\infty \frac{1}{(an+b)^p}$$ will converge if, and only if, $$p>1$$.
Note: Theorem 61 assumes that $$an+b\neq 0$$ for all $$n$$. If $$an+b=0$$ for some $$n$$, then of course the series does not converge regardless of $$p$$ as not all of the terms of the sequence are defined.
Example $$\PageIndex{3}$$: Determining convergence of series
Determine the convergence of the following series.
1. $$\sum\limits_{n=1}^\infty \frac{1}{n}$$
2. $$\sum\limits_{n=1}^\infty \frac{1}{n^2}$$
3. $$\sum\limits_{n=1}^\infty \frac{1}{\sqrt{n}}$$
4. $$\sum\limits_{n=1}^\infty \frac{(-1)^n}{n}$$
5. $$\sum\limits_{n=11}^\infty \frac{1}{(\frac12n-5)^3}$$
6. $$\sum\limits_{n=1}^\infty \frac{1}{2^n}$$
SOLUTION
1. This is a $$p$$--series with $$p=1$$. By Theorem 61, this series diverges.
This series is a famous series, called the Harmonic Series, so named because of its relationship to harmonics in the study of music and sound.
2. This is a $$p$$--series with $$p=2$$. By Theorem 61, it converges. Note that the theorem does not give a formula by which we can determine what the series converges to; we just know it converges. A famous, unexpected result is that this series converges to $${\pi^2}/{6}$$.
3. This is a $$p$$--series with $$p=1/2$$; the theorem states that it diverges.
4. This is not a $$p$$--series; the definition does not allow for alternating signs. Therefore we cannot apply Theorem 61. (Another famous result states that this series, the Alternating Harmonic Series, converges to $$\ln 2$$.)
5. This is a general $$p$$--series with $$p=3$$, therefore it converges.
6. This is not a $$p$$--series, but a geometric series with $$r=1/2$$. It converges.
Later sections will provide tests by which we can determine whether or not a given series converges. This, in general, is much easier than determining what a given series converges to. There are many cases, though, where the sum can be determined.
Example $$\PageIndex{4}$$: Telescoping series
Evaluate the sum $$\sum\limits_{n=1}^\infty \left(\frac1n-\frac1{n+1}\right)$$.
SOLUTION
It will help to write down some of the first few partial sums of this series.
\begin{align*} S_1 &= \frac11-\frac12 & & = 1-\frac12\\ S_2 &= \left(\frac11-\frac12\right) + \left(\frac12-\frac13\right) & & = 1-\frac13\\ S_3 &= \left(\frac11-\frac12\right) + \left(\frac12-\frac13\right)+\left(\frac13-\frac14\right) & &= 1-\frac14\\ S_4 &= \left(\frac11-\frac12\right) + \left(\frac12-\frac13\right)+\left(\frac13-\frac14\right) +\left(\frac14-\frac15\right)& &= 1-\frac15 \end{align*}
Note how most of the terms in each partial sum are canceled out! In general, we see that $$S_n = 1-\frac{1}{n+1}$$. The sequence $$\{S_n\}$$ converges, as $$\lim\limits_{n\to\infty}S_n = \lim\limits_{n\to\infty}\left(1-\frac1{n+1}\right) = 1$$, and so we conclude that $$\sum\limits_{n=1}^\infty \left(\frac1n-\frac1{n+1}\right) = 1$$. Partial sums of the series are plotted in Figure 8.10.
Figure 8.10:
Scatter plots relating to the series of Example 8.2.4.
The series in Example 8.2.4 is an example of a telescoping series. Informally, a telescoping series is one in which the partial sums reduce to just a finite number of terms. The partial sum $$S_n$$ did not contain $$n$$ terms, but rather just two: 1 and $$1/(n+1)$$.
When possible, seek a way to write an explicit formula for the $$n^\text{th}$$ partial sum $$S_n$$. This makes evaluating the limit $$\lim\limits_{n\to\infty} S_n$$ much more approachable. We do so in the next example.
Note on notation: Most of the series we encounter will start with $$n=1$$. For ease of notation, we will often write $$\sum\limits a_n$$ instead of writing $$\sum\limits_{n=1}^\infty a_n$$.
Example $$\PageIndex{5}$$: Evaluating series
Evaluate each of the following infinite series.
1. $$\sum\limits_{n=1}^\infty \frac{2}{n^2+2n} \qquad 2. \sum\limits_{n=1}^\infty \ln\left(\frac{n+1}{n}\right)$$
SOLUTION
1. We can decompose the fraction $$2/(n^2+2n)$$ as $\frac2{n^2+2n} = \frac1n-\frac1{n+2}.$ (See Section 6.5, Partial Fraction Decomposition, to recall how this is done, if necessary.)
Expressing the terms of $$\{S_n\}$$ is now more instructive:
\begin{align*}S_1 &= 1-\frac13 &&= 1-\frac13\\S_2 &= \left(1-\frac13\right) + \left(\frac12-\frac14\right) &&= 1+\frac12-\frac13-\frac14\\S_3 &= \left(1-\frac13\right) + \left(\frac12-\frac14\right)+\left(\frac13-\frac15\right) &&= 1+\frac12-\frac14-\frac15\\S_4 &= \left(1-\frac13\right) + \left(\frac12-\frac14\right)+\left(\frac13-\frac15\right)+\left(\frac14-\frac16\right) &&= 1+\frac12-\frac15-\frac16\\S_5 &= \left(1-\frac13\right) + \left(\frac12-\frac14\right)+\left(\frac13-\frac15\right)+\left(\frac14-\frac16\right)+\left(\frac15-\frac17\right) &&= 1+\frac12-\frac16-\frac17\\\end{align*}
We again have a telescoping series. In each partial sum, most of the terms cancel and we obtain the formula $$S_n = 1+\frac12-\frac1{n+1}-\frac1{n+2}.$$ Taking limits allows us to determine the convergence of the series:$\lim\limits_{n\to\infty}S_n = \lim\limits_{n\to\infty} \left(1+\frac12-\frac1{n+1}-\frac1{n+2}\right) = \frac32,\quad \text{so } \sum\limits_{n=1}^\infty \frac1{n^2+2n} = \frac32.$
This is illustrated in Figure 8.11(a).
2. We begin by writing the first few partial sums of the series:
\begin{align*}S_1 &= \ln\left(2\right) \\S_2 &= \ln\left(2\right)+\ln\left(\frac32\right) \\S_3 &= \ln\left(2\right)+\ln\left(\frac32\right)+\ln\left(\frac43\right) \\S_4 &= \ln\left(2\right)+\ln\left(\frac32\right)+\ln\left(\frac43\right)+\ln\left(\frac54\right) \end{align*}
At first, this does not seem helpful, but recall the logarithmic identity: $$\ln x+\ln y = \ln (xy).$$ Applying this to $$S_4$$ gives:$S_4 = \ln\left(2\right)+\ln\left(\frac32\right)+\ln\left(\frac43\right)+\ln\left(\frac54\right) = \ln\left(\frac21\cdot\frac32\cdot\frac43\cdot\frac54\right) = \ln\left(5\right).$
We can conclude that $$\{S_n\} = \big\{\ln (n+1)\big\}$$. This sequence does not converge, as $$\lim\limits_{n\to\infty}S_n=\infty$$. Therefore $$\sum\limits_{n=1}^\infty \ln\left(\frac{n+1}{n}\right)=\infty$$; the series diverges. Note in Figure 8.11(b) how the sequence of partial sums grows slowly; after 100 terms, it is not yet over 5. Graphically we may be fooled into thinking the series converges, but our analysis above shows that it does not.
Figure 8.11:
Scatter plots relating to the series in Example 8.2.5
We are learning about a new mathematical object, the series. As done before, we apply "old'' mathematics to this new topic.
THEOREM 62 PROPERTIES OF INFINITE SERIES
Let $$\quad \sum\limits_{n=1}^\infty a_n = L,\quad \sum\limits_{n=1}^\infty b_n = K$$, and let $$c$$ be a constant.
1. Constant Multiple Rule: $$\sum\limits_{n=1}^\infty c\cdot a_n = c\cdot\sum\limits_{n=1}^\infty a_n = c\cdot L.$$
2. Sum/Difference Rule: $$\sum\limits_{n=1}^\infty \big(a_n\pm b_n\big) = \sum\limits_{n=1}^\infty a_n \pm \sum\limits_{n=1}^\infty b_n = L \pm K.$$
Before using this theorem, we provide a few "famous'' series.
KEY IDEA 31 IMPORTANT SERIES
1. $$\sum\limits_{n=0}^\infty \frac1{n!} = e$$. (Note that the index starts with $$n=0$$.)
2. $$\sum\limits_{n=1}^\infty \frac1{n^2} = \frac{\pi^2}{6}$$.
3. $$\sum\limits_{n=1}^\infty \frac{(-1)^{n+1}}{n^2} = \frac{\pi^2}{12}$$.
4. $$\sum\limits_{n=0}^\infty \frac{(-1)^{n}}{2n+1} = \frac{\pi}{4}$$.
5. $$\sum\limits_{n=1}^\infty \frac{1}{n} \quad \text{diverges}$$. (This is called the Harmonic Series.)
6. $$\sum\limits_{n=1}^\infty \frac{(-1)^{n+1}}{n} = \ln 2$$. (This is called the Alternating Harmonic Series.)
Example $$\PageIndex{6}$$: Evaluating series
Evaluate the given series.
$$1. \sum\limits_{n=1}^\infty \frac{(-1)^{n+1}\big(n^2-n\big)}{n^3}\qquad 2. \sum\limits_{n=1}^\infty \frac{1000}{n!}\qquad 3. \frac1{16}+\frac1{25}+\frac1{36}+\frac1{49}+\cdots$$
SOLUTION
1. We start by using algebra to break the series apart:
\begin{align*}\sum\limits_{n=1}^\infty \frac{(-1)^{n+1}\big(n^2-n\big)}{n^3} &= \sum\limits_{n=1}^\infty\left(\frac{(-1)^{n+1}n^2}{n^3}-\frac{(-1)^{n+1}n}{n^3}\right) \\&= \sum\limits_{n=1}^\infty\frac{(-1)^{n+1}}{n}-\sum\limits_{n=1}^\infty\frac{(-1)^{n+1}}{n^2} \\&= \ln(2) - \frac{\pi^2}{12} \approx -0.1293.\end{align*}
This is illustrated in Figure 8.12(a).
2. This looks very similar to the series that involves $$e$$ in Key Idea 31. Note, however, that the series given in this example starts with $$n=1$$ and not $$n=0$$. The first term of the series in the Key Idea is $$1/0! = 1$$, so we will subtract this from our result below:
\begin{align*}\sum\limits_{n=1}^\infty \frac{1000}{n!} &= 1000\cdot\sum\limits_{n=1}^\infty \frac{1}{n!} \\ &= 1000\cdot (e-1) \approx 1718.28. \end{align*}
This is illustrated in Figure 8.12(b). The graph shows how this particular series converges very rapidly.
3. The denominators in each term are perfect squares; we are adding $$\sum\limits_{n=4}^\infty \frac{1}{n^2}$$ (note we start with $$n=4$$, not $$n=1$$). This series will converge. Using the formula from Key Idea 31, we have the following:
\begin{align*}\sum\limits_{n=1}^\infty \frac1{n^2} &= \sum\limits_{n=1}^3 \frac1{n^2} +\sum\limits_{n=4}^\infty \frac1{n^2} \\ \sum\limits_{n=1}^\infty \frac1{n^2} - \sum\limits_{n=1}^3 \frac1{n^2} &=\sum\limits_{n=4}^\infty \frac1{n^2} \\ \frac{\pi^2}{6} - \left(\frac11+\frac14+\frac19\right) &= \sum\limits_{n=4}^\infty \frac1{n^2} \\ \frac{\pi^2}{6} - \frac{49}{36} &= \sum\limits_{n=4}^\infty \frac1{n^2} \\ 0.2838&\approx \sum\limits_{n=4}^\infty \frac1{n^2} \end{align*}
Figure 8.12:
Scatter plots relating to the series in Example 8.2.6
It may take a while before one is comfortable with this statement, whose truth lies at the heart of the study of infinite series: it is possible that the sum of an infinite list of nonzero numbers is finite. We have seen this repeatedly in this section, yet it still may "take some getting used to.''
As one contemplates the behavior of series, a few facts become clear.
1. In order to add an infinite list of nonzero numbers and get a finite result, "most'' of those numbers must be "very near'' 0.
2. If a series diverges, it means that the sum of an infinite list of numbers is not finite (it may approach $$\pm \infty$$ or it may oscillate), and:
1. The series will still diverge if the first term is removed.
2. The series will still diverge if the first 10 terms are removed.
3. The series will still diverge if the first $$1,000,000$$ terms are removed.
4. The series will still diverge if any finite number of terms from anywhere in the series are removed.
These concepts are very important and lie at the heart of the next two theorems.
theorem 63 $$n^\text{th}$$--Term Test for Convergence/Divergence
Consider the series $$\sum\limits_{n=1}^\infty a_n$$.
1. If $$\sum\limits_{n=1}^\infty a_n$$ converges, then $$\lim\limits_{n\to\infty}a_n =0$$.
2. If $$\lim\limits_{n\to\infty}a_n \neq 0$$, then $$\sum\limits_{n=1}^\infty a_n$$ diverges.
Note that the two statements in Theorem 63 are really the same. In order to converge, the limit of the terms of the sequence must approach 0; if they do not, the series will not converge.
Looking back, we can apply this theorem to the series in Example 8.2.1. In that example, the $$n^\text{th}$$ terms of both sequences do not converge to 0, therefore we can quickly conclude that each series diverges.
Important! This theorem does not state that if $$\lim\limits_{n\to\infty} a_n = 0$$ then $$\sum\limits_{n=1}^\infty a_n$$ converges. The standard example of this is the Harmonic Series, as given in Key Idea 31. The Harmonic Sequence, $$\{1/n\}$$, converges to 0; the Harmonic Series, $$\sum\limits_{n=1}^\infty 1/n$$, diverges.
theorem 64 infinite nature of series
The convergence or divergence remains unchanged by the addition or subtraction of any finite number of terms. That is:
1. A divergent series will remain divergent with the addition or subtraction of any finite number of terms.
2. A convergent series will remain convergent with the addition or subtraction of any finite number of terms. (Of course, the sum will likely change.)
Consider once more the Harmonic Series $$\sum\limits_{n=1}^\infty \frac1n$$ which diverges; that is, the sequence of partial sums $$\{S_n\}$$ grows (very, very slowly) without bound. One might think that by removing the "large'' terms of the sequence that perhaps the series will converge. This is simply not the case. For instance, the sum of the first 10 million terms of the Harmonic Series is about 16.7. Removing the first 10 million terms from the Harmonic Series changes the $$n^\text{th}$$ partial sums, effectively subtracting 16.7 from the sum. However, a sequence that is growing without bound will still grow without bound when 16.7 is subtracted from it.
The equations below illustrate this. The first line shows the infinite sum of the Harmonic Series split into the sum of the first 10 million terms plus the sum of "everything else.'' The next equation shows us subtracting these first 10 million terms from both sides. The final equation employs a bit of "psuedo--math'': subtracting 16.7 from "infinity'' still leaves one with "infinity.''
\begin{align*}\sum\limits_{n=1}^\infty \frac1n &= \sum\limits_{n=1}^{10,000,000}\frac1n \quad + \sum\limits_{n=10,000,001}^\infty \frac1n \\ \sum\limits_{n=1}^\infty \frac1n - \sum\limits_{n=1}^{10,000,000}\frac1n &= \sum\limits_{n=10,000,001}^\infty \frac1n \\ \infty - 16.7 &= \infty.\end{align*}
This section introduced us to series and defined a few special types of series whose convergence properties are well known: we know when a $$p$$-series or a geometric series converges or diverges. Most series that we encounter are not one of these types, but we are still interested in knowing whether or not they converge. The next three sections introduce tests that help us determine whether or not a given series converges.
### Contributors
• Gregory Hartman (Virginia Military Institute). Contributions were made by Troy Siemers and Dimplekumar Chalishajar of VMI and Brian Heinold of Mount Saint Mary's University. This content is copyrighted by a Creative Commons Attribution - Noncommercial (BY-NC) License. http://www.apexcalculus.com/
| 2018-05-23T00:58:46 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9982527494430542, "perplexity": 561.84637501274}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-22/segments/1526794865023.41/warc/CC-MAIN-20180523004548-20180523024548-00368.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Aarnaud.marie-claude
|
# zbMATH — the first resource for mathematics
## Arnaud, Marie-Claude
Compute Distance To:
Author ID: arnaud.marie-claude Published as: Arnaud, M-C; Arnaud, M. C.; Arnaud, M.-C.; Arnaud, Marie-Claude Homepage: http://www.univ-avignon.fr/en/research/annuaire-chercheurs/membrestruc/personnel... External Links: MGP · Wikidata
Documents Indexed: 45 Publications since 1989, including 1 Book
all top 5
#### Co-Authors
38 single-authored 1 Arcostanzo, Marc 1 Audin, Michèle 1 Béguin, François 1 Berger, Pierre 1 Bolle, Philippe 1 Bonatti, Christian 1 Chéritat, Arnaud 1 Crovisier, Sylvain 1 Eliasson, L. Hakan 1 Ghys, Étienne 1 Hofer, Helmut H. W. 1 Kaloshin, Vadim Yu. 1 Le Calvez, Patrice 1 Le Roux, Frédéric 1 Lhuissier, Marie 1 Massot, Patrick 1 Rollet, Laurent 1 Venturelli, Andrea 1 Yoccoz, Jean-Christophe 1 Zavidovique, Maxime
all top 5
#### Serials
6 Nonlinearity 5 Ergodic Theory and Dynamical Systems 3 Comptes Rendus de l’Académie des Sciences. Série I. Mathématique 2 Mémoires de la Société Mathématique de France. Nouvelle Série 2 Comptes Rendus de l’Académie des Sciences. Série I 1 Communications in Mathematical Physics 1 Annales de l’Institut Fourier 1 Annales Scientifiques de l’École Normale Supérieure. Quatrième Série 1 Bulletin de la Société Mathématique de France 1 Gazette des Mathématiciens 1 Publications Mathématiques 1 Journal of Differential Equations 1 Mathematische Zeitschrift 1 Annales de l’Institut Henri Poincaré. Analyse Non Linéaire 1 Revista Matemática Iberoamericana 1 Geometric and Functional Analysis. GAFA 1 Boletim da Sociedade Brasileira de Matemática. Nova Série 1 Calculus of Variations and Partial Differential Equations 1 Discrete and Continuous Dynamical Systems 1 Publicaciones Matemáticas del Uruguay 1 Annals of Mathematics. Second Series 1 Regular and Chaotic Dynamics 1 Annales Henri Poincaré 1 Comptes Rendus. Mathématique. Académie des Sciences, Paris 1 Bulletin of the Brazilian Mathematical Society. New Series 1 Journal of the Institute of Mathematics of Jussieu 1 Oberwolfach Reports 1 Journal of Modern Dynamics
all top 5
#### Fields
40 Dynamical systems and ergodic theory (37-XX) 10 Differential geometry (53-XX) 10 Mechanics of particles and systems (70-XX) 4 Manifolds and cell complexes (57-XX) 3 Global analysis, analysis on manifolds (58-XX) 2 General and overarching topics; collections (00-XX) 1 History and biography (01-XX) 1 Combinatorics (05-XX) 1 Group theory and generalizations (20-XX) 1 Real functions (26-XX) 1 Partial differential equations (35-XX)
#### Citations contained in zbMATH Open
33 Publications have been cited 153 times in 100 Documents Cited by Year
The $$C^1$$ closing lemma. Zbl 0920.58039
Arnaud, Marie-Claude
1998
On a theorem due to Birkhoff. Zbl 1216.37020
Arnaud, Marie-Claude
2010
Generic symplectic dynamics. Zbl 1084.37017
Arnaud, Marie-Claude; Bonatti, Christian; Crovisier, Sylvain
2005
The link between the shape of the irrational Aubry-Mather sets and their Lyapunov exponents. Zbl 1257.37028
Arnaud, Marie-Claude
2011
Creation of connections in $$C^1$$-topology. Zbl 0997.37007
Arnaud, Marie-Claude
2001
The generic symplectic $$C^1$$-diffeomorphisms of four-dimensional symplectic manifolds are hyperbolic, partially hyperbolic or have a completely elliptic periodic point. Zbl 1030.37037
Arnaud, Marie-Claude
2002
Green bundles and regularity of $$C^0$$-Lagrangians invariant graphs of Tonelli flows. Zbl 1143.70009
Arnaud, Marie-Claude
2008
Green bundles, Lyapunov exponents and regularity along the supports of the minimizing measures. Zbl 1269.37031
Arnaud, M.-C.
2012
Tonelli Hamiltonians without conjugate points and $$C^0$$ integrability. Zbl 1345.37063
Arcostanzo, M.; Arnaud, M.-C.; Bolle, P.; Zavidovique, M.
2015
Three results on the regularity of the curves that are invariant by an exact symplectic twist map. Zbl 1177.53070
Arnaud, M.-C.
2009
The non-hyperbolicity of irrational invariant curves for twist maps and all that follows. Zbl 1361.37046
Arnaud, Marie-Claude; Berger, Pierre
2016
Lower and upper bounds for the Lyapunov exponents of twisting dynamics: a relationship between the exponents and the angle of Oseledets’ splitting. Zbl 1269.37032
Arnaud, M.-C.
2013
A nondifferentiable essential irrational invariant curve for a $$C^1$$ symplectic twist map. Zbl 1276.37034
Arnaud, Marie-Claude
2011
The tiered Aubry set for autonomous Lagrangian functions. Zbl 1152.37025
Arnaud, Marie-Claude
2008
Pseudographs and the Lax-Oleinik semi-group: a geometric and dynamical interpretation. Zbl 1284.05120
Arnaud, M-C
2011
Boundaries of instability zones for symplectic twist maps. Zbl 1290.37024
Arnaud, M.-C.
2014
$$C^1$$-generic billiard tables have a dense set of periodic points. Zbl 1417.37094
Arnaud, Marie-Claude
2013
Green bundles and related topics. Zbl 1243.37037
Arnaud, Marie-Claude
2011
A particular minimization property implies $$C^{0}$$-integrability. Zbl 1214.37044
Arnaud, M.-C.
2011
Hyperbolic periodic orbits and Mather sets in certain symmetric cases. Zbl 1118.37030
Arnaud, M.-C.
2006
Convergence of the semi-group of Lax-Oleinik: a geometric point of view. Zbl 1181.37018
Arnaud, M. C.
2005
Approximation des ensembles $$\omega$$-limites des difféomorphismes par des orbites pério-diques. (Approximation of $$\omega$$-limit sets of diffeomorphisms by periodic orbits). Zbl 1024.37011
Arnaud, Marie-Claude
2003
Symplectic $$C^1$$-diffeomorphisms of 4-dimensional manifolds. Zbl 0964.37034
Arnaud, Marie-Claude
2000
Existence of completely elliptic periodic orbits of symmetric and convex Hamiltonians. Zbl 0943.37029
Arnaud, Marie-Claude
1999
On the type of certain periodic orbits minimizing the Lagrangian action. Zbl 0901.58013
Arnaud, Marie-Claude
1998
Creation of periodic points of all types in the neighbourhood of K.A.M. tori. Zbl 0853.58046
Arnaud, Marie-Claude
1995
Types of fixed points of symplectic diffeomorphisms on $$\mathbb{T}^ n\times \mathbb{R}^ n$$. Zbl 0758.58009
Arnaud, Marie-Claude
1992
Sur les points fixes des difféomorphismes exacts symplectiques de $$T^ n\times R^ n$$. (Fixed points of exact symplectic diffeomorphisms of $$T^ n\times R^ n)$$. Zbl 0696.57017
Arnaud, Marie-Claude
1989
Hyperbolicity for conservative twist maps of the 2-dimensional annulus. Zbl 1372.37087
Arnaud, Marie-Claude
2016
Lyapunov exponents for conservative twisting dynamics: a survey. Zbl 1362.37117
Arnaud, Marie-Claude
2016
When are the invariant submanifolds of symplectic dynamics Lagrangian? Zbl 1308.37026
Arnaud, Marie-Claude
2014
An “orbit closing lemma”. Zbl 0867.58040
Arnaud, Marie-Claude
1996
Type of critical points of Hamiltonian functions and of fixed points of symplectic diffeomorphisms. Zbl 0811.58022
Arnaud, Marie-Claude
1994
The non-hyperbolicity of irrational invariant curves for twist maps and all that follows. Zbl 1361.37046
Arnaud, Marie-Claude; Berger, Pierre
2016
Hyperbolicity for conservative twist maps of the 2-dimensional annulus. Zbl 1372.37087
Arnaud, Marie-Claude
2016
Lyapunov exponents for conservative twisting dynamics: a survey. Zbl 1362.37117
Arnaud, Marie-Claude
2016
Tonelli Hamiltonians without conjugate points and $$C^0$$ integrability. Zbl 1345.37063
Arcostanzo, M.; Arnaud, M.-C.; Bolle, P.; Zavidovique, M.
2015
Boundaries of instability zones for symplectic twist maps. Zbl 1290.37024
Arnaud, M.-C.
2014
When are the invariant submanifolds of symplectic dynamics Lagrangian? Zbl 1308.37026
Arnaud, Marie-Claude
2014
Lower and upper bounds for the Lyapunov exponents of twisting dynamics: a relationship between the exponents and the angle of Oseledets’ splitting. Zbl 1269.37032
Arnaud, M.-C.
2013
$$C^1$$-generic billiard tables have a dense set of periodic points. Zbl 1417.37094
Arnaud, Marie-Claude
2013
Green bundles, Lyapunov exponents and regularity along the supports of the minimizing measures. Zbl 1269.37031
Arnaud, M.-C.
2012
The link between the shape of the irrational Aubry-Mather sets and their Lyapunov exponents. Zbl 1257.37028
Arnaud, Marie-Claude
2011
A nondifferentiable essential irrational invariant curve for a $$C^1$$ symplectic twist map. Zbl 1276.37034
Arnaud, Marie-Claude
2011
Pseudographs and the Lax-Oleinik semi-group: a geometric and dynamical interpretation. Zbl 1284.05120
Arnaud, M-C
2011
Green bundles and related topics. Zbl 1243.37037
Arnaud, Marie-Claude
2011
A particular minimization property implies $$C^{0}$$-integrability. Zbl 1214.37044
Arnaud, M.-C.
2011
On a theorem due to Birkhoff. Zbl 1216.37020
Arnaud, Marie-Claude
2010
Three results on the regularity of the curves that are invariant by an exact symplectic twist map. Zbl 1177.53070
Arnaud, M.-C.
2009
Green bundles and regularity of $$C^0$$-Lagrangians invariant graphs of Tonelli flows. Zbl 1143.70009
Arnaud, Marie-Claude
2008
The tiered Aubry set for autonomous Lagrangian functions. Zbl 1152.37025
Arnaud, Marie-Claude
2008
Hyperbolic periodic orbits and Mather sets in certain symmetric cases. Zbl 1118.37030
Arnaud, M.-C.
2006
Generic symplectic dynamics. Zbl 1084.37017
Arnaud, Marie-Claude; Bonatti, Christian; Crovisier, Sylvain
2005
Convergence of the semi-group of Lax-Oleinik: a geometric point of view. Zbl 1181.37018
Arnaud, M. C.
2005
Approximation des ensembles $$\omega$$-limites des difféomorphismes par des orbites pério-diques. (Approximation of $$\omega$$-limit sets of diffeomorphisms by periodic orbits). Zbl 1024.37011
Arnaud, Marie-Claude
2003
The generic symplectic $$C^1$$-diffeomorphisms of four-dimensional symplectic manifolds are hyperbolic, partially hyperbolic or have a completely elliptic periodic point. Zbl 1030.37037
Arnaud, Marie-Claude
2002
Creation of connections in $$C^1$$-topology. Zbl 0997.37007
Arnaud, Marie-Claude
2001
Symplectic $$C^1$$-diffeomorphisms of 4-dimensional manifolds. Zbl 0964.37034
Arnaud, Marie-Claude
2000
Existence of completely elliptic periodic orbits of symmetric and convex Hamiltonians. Zbl 0943.37029
Arnaud, Marie-Claude
1999
The $$C^1$$ closing lemma. Zbl 0920.58039
Arnaud, Marie-Claude
1998
On the type of certain periodic orbits minimizing the Lagrangian action. Zbl 0901.58013
Arnaud, Marie-Claude
1998
An “orbit closing lemma”. Zbl 0867.58040
Arnaud, Marie-Claude
1996
Creation of periodic points of all types in the neighbourhood of K.A.M. tori. Zbl 0853.58046
Arnaud, Marie-Claude
1995
Type of critical points of Hamiltonian functions and of fixed points of symplectic diffeomorphisms. Zbl 0811.58022
Arnaud, Marie-Claude
1994
Types of fixed points of symplectic diffeomorphisms on $$\mathbb{T}^ n\times \mathbb{R}^ n$$. Zbl 0758.58009
Arnaud, Marie-Claude
1992
Sur les points fixes des difféomorphismes exacts symplectiques de $$T^ n\times R^ n$$. (Fixed points of exact symplectic diffeomorphisms of $$T^ n\times R^ n)$$. Zbl 0696.57017
Arnaud, Marie-Claude
1989
all top 5
#### Cited by 120 Authors
16 Arnaud, Marie-Claude 6 Crovisier, Sylvain 4 Bessa, Mário 3 Bochi, Jairo 3 Bonatti, Christian 3 Le Calvez, Patrice 3 Qin, Wenxin 3 Wang, Kaizhi 3 Wang, Yanan 3 Yan, Jun 2 Abdenur, Flavio 2 Arbieto, Alexander 2 Arcostanzo, Marc 2 Avila Cordeiro de Melo, Artur 2 Berger, Pierre 2 Bernard, Patrick 2 Bolle, Philippe 2 Catalan, Thiago 2 Contreras, Gonzalo 2 Figalli, Alessio 2 Gorodetski, Anton 2 Kaloshin, Vadim Yu. 2 Lopes Dias, João 2 Oliveira Dos Santos, Joana 2 Rifford, Ludovic 2 Sorrentino, Alfonso 2 Tahzibi, Ali 2 Turaev, Dmitry V. 2 Visscher, Daniel A. 2 Wang, Xiaodong 1 Abbondandolo, Alberto 1 Abreu, Miguel 1 Alishah, Hassan Najafi 1 Amorim, Lino 1 Anosov, Dmitriĭ Viktorovich 1 Azevedo, Assis 1 Azevedo, Davide 1 Bahabadi, Alireza Zamani 1 Bernardi, Olga 1 Berti, Massimiliano 1 Bialy, Misha 1 Butler, Leo T. 1 Buzzi, Jérôme 1 Cardin, Franco 1 Dias Carneiro, Mario Jorge 1 Duarte, Pedro 1 Ferreira, Célia 1 Fisher, Todd L. 1 Florio, Anna 1 Gan, Shaobo 1 Garcia, Fortino 1 Ginzburg, Viktor L’vovich 1 Gourmelon, Nicolas 1 Guihéneuf, Pierre-Antoine 1 Gürel, Basak Zehra 1 Horita, Vanderlei 1 Huang, Guan 1 Katić, Jelena 1 Khanin, Konstantin M. 1 Klempnauer, Stefan 1 Koropecki, Andres 1 Kovaleva, A. M. 1 Labrousse, Clémence 1 Lee, Manseob 1 Leguil, Martin 1 Li, Xinxiang 1 Li, Yong 1 Liu, Qihuai 1 Lomelí, Héctor E. 1 Lopes, Artur Oscar 1 Louati, Hanen 1 Macarini, Leonardo 1 Marco, Jean-Pierre 1 Margaliot, Michael 1 Markarian, Roberto 1 Meiss, James D. 1 Melguizo Padial, M. A. 1 Mengue, Jairo K. 1 Milinković, Darko 1 Nassiri, Meysam 1 Nikolić, Jovana 1 Obata, Davi 1 Oh, Yong-Geun 1 Oliffson Kamphorst, Sylvie 1 Passeggi, Alejandro 1 Pinto de Carvalho, Sônia 1 Polterovich, Leonid Viktorovich 1 Potrie, Rafael 1 Rapoport, Anna 1 Ribeiro, Raquel 1 Ríos-Zertuche, Rodolfo 1 Roberts, Gareth E. 1 Rocha, Alexandre 1 Rocha, Jorge 1 Rodriguez-Hertz, Federico 1 Rodriguez Hertz, Jana 1 Rom-Kedar, Vered 1 Roos, Valentine 1 Rouleux, Michel 1 Saghin, Radu ...and 20 more Authors
all top 5
#### Cited in 52 Serials
10 Ergodic Theory and Dynamical Systems 6 Communications in Mathematical Physics 5 Discrete and Continuous Dynamical Systems 4 Journal of Differential Equations 4 Mathematische Zeitschrift 4 Proceedings of the American Mathematical Society 3 Nonlinearity 3 Transactions of the American Mathematical Society 3 Annals of Mathematics. Second Series 3 Dynamical Systems 2 Mathematical Proceedings of the Cambridge Philosophical Society 2 Chaos, Solitons and Fractals 2 Advances in Mathematics 2 Annales Scientifiques de l’École Normale Supérieure. Quatrième Série 2 Duke Mathematical Journal 2 Annales de l’Institut Henri Poincaré. Analyse Non Linéaire 2 Mémoires de la Société Mathématique de France. Nouvelle Série 2 Journal of Dynamics and Differential Equations 2 Calculus of Variations and Partial Differential Equations 2 Comptes Rendus. Mathématique. Académie des Sciences, Paris 2 Journal of the Institute of Mathematics of Jussieu 2 Science China. Mathematics 1 Communications on Pure and Applied Mathematics 1 Israel Journal of Mathematics 1 Journal of Mathematical Analysis and Applications 1 Journal of Statistical Physics 1 Mathematical Notes 1 Journal of Geometry and Physics 1 Annales de l’Institut Fourier 1 Automatica 1 Bulletin de la Société Mathématique de France 1 Geometriae Dedicata 1 Publications Mathématiques 1 Inventiones Mathematicae 1 Mathematische Annalen 1 Physica D 1 Revista Matemática Iberoamericana 1 L’Enseignement Mathématique. 2e Série 1 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 1 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 1 Selecta Mathematica. New Series 1 Abstract and Applied Analysis 1 Geometry & Topology 1 Regular and Chaotic Dynamics 1 Communications in Nonlinear Science and Numerical Simulation 1 Communications in Contemporary Mathematics 1 Differential Equations 1 Advanced Nonlinear Studies 1 Theoretical and Applied Mechanics 1 Proceedings of the Steklov Institute of Mathematics 1 Journal of Geometric Mechanics 1 Philosophical Transactions of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences
all top 5
#### Cited in 17 Fields
89 Dynamical systems and ergodic theory (37-XX) 17 Differential geometry (53-XX) 12 Mechanics of particles and systems (70-XX) 5 Partial differential equations (35-XX) 4 Calculus of variations and optimal control; optimization (49-XX) 3 Ordinary differential equations (34-XX) 3 Manifolds and cell complexes (57-XX) 2 Measure and integration (28-XX) 2 General topology (54-XX) 2 Global analysis, analysis on manifolds (58-XX) 2 Statistical mechanics, structure of matter (82-XX) 1 Real functions (26-XX) 1 Functional analysis (46-XX) 1 Operator theory (47-XX) 1 Probability theory and stochastic processes (60-XX) 1 Operations research, mathematical programming (90-XX) 1 Systems theory; control (93-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-05-06T06:51:13 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5401442050933838, "perplexity": 6020.642679803593}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-21/segments/1620243988741.20/warc/CC-MAIN-20210506053729-20210506083729-00428.warc.gz"}
|
https://drupal.star.bnl.gov/STAR/presentations/dnp-2019/measurement-longitudinal-spin-asymmetries-weak-boson-production-polarized-pro
|
# Measurement of the longitudinal spin asymmetries for weak boson production in polarized proton-proton collisions at $\sqrt{s}=510$ GeV at RHIC
Under:
Author : Bernd Surrow Meeting : DNP 2019 - Fall Meeting of the Division of Nuclear Physics of the American Physical Society - Arlington, VA, Oct. 14-17, 2019 Format : abstract File(s) : PDF
| 2019-11-21T04:37:40 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8108229041099548, "perplexity": 7174.977604976371}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-47/segments/1573496670729.90/warc/CC-MAIN-20191121023525-20191121051525-00160.warc.gz"}
|
https://www.detailedpedia.com/wiki-Jonas_Salk
|
# Jonas Salk
Jonas Salk
Jonas Salk at Copenhagen Airport (May 1959)
Born
Jonas Salk
October 28, 1914
DiedJune 23, 1995 (aged 80)
Resting placeEl Camino Memorial Park
San Diego, California
NationalityAmerican
Alma materCity College of New York
New York University
Known forFirst polio vaccine
Spouse(s)
Donna Lindsay
(m. 1939; div. 1968)
(m. 1970)
Children3
Awards
Scientific career
FieldsMedical research,
virology, and epidemiology
InstitutionsUniversity of Pittsburgh
Salk Institute
University of Michigan
Signature
Jonas Edward Salk (/sɔːlk/; born Jonas Salk; October 28, 1914 – June 23, 1995) was an American virologist and medical researcher who developed one of the first successful polio vaccines. He was born in New York City and attended the City College of New York and New York University School of Medicine.
In 1947, Salk accepted a professorship in the School of Medicine at the University of Pittsburgh. It was there that he undertook a project to determine the number of different types of poliovirus, starting in 1948. For the next seven years, Salk devoted himself towards developing a vaccine against polio.
Salk was immediately hailed as a "miracle worker" when the vaccine's success was first made public in April 1955, and chose to not patent the vaccine or seek any profit from it in order to maximize its global distribution. The National Foundation for Infantile Paralysis and the University of Pittsburgh looked into patenting the vaccine but, since Salk's techniques were not novel, their patent attorney said "If there were any patentable novelty to be found in this phase it would lie within an extremely narrow scope and would be of doubtful value." An immediate rush to vaccinate began in both the United States and around the world. Many countries began polio immunization campaigns using Salk's vaccine, including Canada, Sweden, Denmark, Norway, West Germany, the Netherlands, Switzerland, and Belgium. By 1959, the Salk vaccine had reached about 90 countries. An attenuated live oral polio vaccine was developed by Albert Sabin, coming into commercial use in 1961. Less than 25 years after the release of Salk's vaccine, domestic transmission of polio had been eliminated in the United States.
In 1963, Salk founded the Salk Institute for Biological Studies in La Jolla, California, which is today a center for medical and scientific research. He continued to conduct research and publish books in his later years, focusing in his last years on the search for a vaccine against HIV. Salk also campaigned vigorously for mandatory vaccination throughout the rest of his life, calling the universal vaccination of children against disease a "moral commitment". Salk's personal papers are today stored in Geisel Library at the University of California, San Diego.
## Early life and education
Jonas Salk was born in New York City to Daniel and Dora (née Press) Salk. His parents were Ashkenazi Jewish; Daniel was born in New Jersey to immigrant parents and Dora, who was born in Minsk, emigrated when she was twelve. Salk's parents did not receive extensive formal education. Jonas had two younger brothers, Herman and Lee, a renowned child psychologist. The family moved from East Harlem to 853 Elsmere Place, the Bronx, with some time spent in Queens at 439 Beach 69th Street, Arverne.
When he was 13, Salk entered Townsend Harris High School, a public school for intellectually gifted students. Named after the founder of City College of New York (CCNY), it was, wrote his biographer, Dr. David Oshinsky, "a launching pad for the talented sons of immigrant parents who lacked the money—and pedigree—to attend a top private school." In high school "he was known as a perfectionist ... who read everything he could lay his hands on," according to one of his fellow students. Students had to cram a four-year curriculum into just three years. As a result, most dropped out or flunked out, despite the school's motto "study, study, study." Of the students who graduated, however, most had the grades to enroll in CCNY, noted for being a highly competitive college.: 96
### Education
Salk enrolled in CCNY, from which he earned a Bachelor of Science degree in chemistry in 1934. Oshinsky writes that "for working-class immigrant families, City College represented the apex of public higher education. Getting in was tough, but tuition was free. Competition was intense, but the rules were fairly applied. No one got an advantage based on an accident of birth."
At his mother's urging, he put aside aspirations of becoming a lawyer and instead concentrated on classes necessary for admission to medical school. However, according to Oshinsky, the facilities at City College were "barely second rate." There were no research laboratories. The library was inadequate. The faculty contained few noted scholars. "What made the place special," he writes, "was the student body that had fought so hard to get there... driven by their parents.... From these ranks, of the 1930s and 1940s, emerged a wealth of intellectual talent, including more Nobel Prize winners—eight—and PhD recipients than any other public college except the University of California at Berkeley." Salk entered CCNY at the age of 15, a "common age for a freshman who had skipped multiple grades along the way.": 98
As a child, Salk did not show any interest in medicine or science in general. He said in an interview with the Academy of Achievement, "As a child I was not interested in science. I was merely interested in things human, the human side of nature, if you like, and I continue to be interested in that."
### Medical school
After City College, Salk enrolled in New York University to study medicine. According to Oshinsky, NYU based its modest reputation on famous alumni, such as Walter Reed, who helped conquer yellow fever. Tuition was "comparatively low, better still, it did not discriminate against Jews... while most of the surrounding medical schools—Cornell, Columbia, University of Pennsylvania, and Yale—had rigid quotas in place." Yale, for example, accepted 76 applicants in 1935 out of a pool of 501. Although 200 of the applicants were Jewish, only five got in.: 98 During his years at New York University Medical School, Salk worked as a laboratory technician during the school year and as a camp counselor in the summer.
During Salk's medical studies, he stood out from his peers, according to Bookchin, "not just because of his continued academic prowess—he was Alpha Omega Alpha, the Phi Beta Kappa Society of medical education—but because he had decided he did not want to practice medicine." Instead, he became absorbed in research, even taking a year off to study biochemistry. He later focused more of his studies on bacteriology, which had replaced medicine as his primary interest. He said his desire was to help humankind in general rather than single patients. "It was the laboratory work, in particular, that gave new direction to his life."
Salk has said: "My intention was to go to medical school, and then become a medical scientist. I did not intend to practice medicine, although in medical school, and in my internship, I did all the things that were necessary to qualify me in that regard. I had opportunities along the way to drop the idea of medicine and go into science. At one point at the end of my first year of medical school, I received an opportunity to spend a year in research and teaching in biochemistry, which I did. And at the end of that year, I was told that I could, if I wished, switch and get a Ph.D. in biochemistry, but my preference was to stay with medicine. And, I believe that this is all linked to my original ambition, or desire, which was to be of some help to humankind, so to speak, in a larger sense than just on a one-to-one basis."
Concerning his last year of medical school, Salk said: "I had an opportunity to spend time in elective periods in my last year in medical school, in a laboratory that was involved in studies on influenza. The influenza virus had just been discovered about a few years before that. And, I saw the opportunity at that time to test the question as to whether we could destroy the virus infectivity and still immunize. And so, by carefully designed experiments, we found it was possible to do so."
### Postgraduate research and early laboratory work
In 1941, during his postgraduate work in virology, Salk chose a two-month elective to work in the Thomas Francis' laboratory at the University of Michigan. Francis had recently joined the faculty of the medical school after working for the Rockefeller Foundation, where he had discovered the type B influenza virus. According to Bookchin, "the two-month stint in Francis's lab was Salk's first introduction to the world of virology—and he was hooked.": 25 After graduating from medical school, Salk began his residency at New York's prestigious Mount Sinai Hospital, where he again worked in Francis's laboratory. Salk then worked at the University of Michigan School of Public Health with Francis, on an army-commissioned project in Michigan to develop an influenza vaccine. He and Francis eventually perfected a vaccine that was soon widely used at army bases, where Salk discovered and isolated one of the strains of influenza that was included in the final vaccine.: 26
## Polio research
President Franklin D. Roosevelt meeting with Basil O'Connor
In 1947, Salk became ambitious for his own lab and was granted one at the University of Pittsburgh School of Medicine, but the lab was smaller than he had hoped and he found the rules imposed by the university restrictive. In 1948, Harry Weaver, the director of research at the National Foundation for Infantile Paralysis, contacted Salk. He asked Salk to find out if there were more types of polio than the three then known, offering additional space, equipment and researchers. For the first year he gathered supplies and researchers including Julius Youngner, Byron Bennett, L. James Lewis, and secretary Lorraine Friedman joined Salk's team, as well. As time went on, Salk began securing grants from the Mellon family and was able to build a working virology laboratory. He later joined the National Foundation for Infantile Paralysis's polio project established by President Franklin D. Roosevelt.
Extensive publicity and fear of polio led to much increased funding, $67 million by 1955, but research continued on dangerous live vaccines.: 85–87 Salk decided to use the safer 'killed' virus, instead of weakened forms of strains of polio viruses like the ones used contemporaneously by Albert Sabin, who was developing an oral vaccine. After successful tests on laboratory animals, on July 2, 1952, assisted by the staff at the D.T. Watson Home for Crippled Children (now the Watson Institute), Salk injected 43 children with his killed-virus vaccine. A few weeks later, Salk injected children at the Polk State School for the Retarded and Feeble-minded. He vaccinated his own children in 1953. In 1954 he tested the vaccine on about one million children, known as the polio pioneers. The vaccine was announced as safe on April 12, 1955. Salk in 1955 at the University of Pittsburgh Magazine photo of Jonas Salk to O'Neill, "the most elaborate program of its kind in history, involving 20,000 physicians and public health officers, 64,000 school personnel, and 220,000 volunteers," with over 1.8 million school children participating in the trial. A 1954 Gallup poll showed that more Americans knew about the polio field trials than could give the full name of the President. March of Dimes poster circa 1957 The project became large, involving 100 million contributors to the March of Dimes, and 7 million volunteers.: 54 The foundation allowed itself to go into debt to finance the final research required to develop the Salk vaccine. Salk worked incessantly for two-and-a-half years. Salk's inactivated polio vaccine came into use in 1955. It is on the World Health Organization's List of Essential Medicines. ## Becoming a public figure ### Celebrity versus privacy Salk preferred not to have his career as a scientist affected by too much personal attention, as he had always tried to remain independent and private in his research and life, but this proved to be impossible. "Young man, a great tragedy has befallen you—you've lost your anonymity", the television personality Ed Murrow said to Salk shortly after the onslaught of media attention. When Murrow asked him, "Who owns this patent?", Salk replied, "Well, the people I would say. There is no patent. Could you patent the sun?" The vaccine is calculated to be worth$7 billion had it been patented. However, lawyers from the National Foundation for Infantile Paralysis did look into the possibility of a patent, but ultimately determined that the vaccine was not a patentable invention because of prior art.
Salk served on the board of directors of the John D. and Catherine T. MacArthur Foundation.
Author Jon Cohen noted, "Jonas Salk made scientists and journalists alike go goofy. As one of the only living scientists whose face was known the world over, Salk, in the public's eye, had a superstar aura. Airplane pilots would announce that he was on board and passengers would burst into applause. Hotels routinely would upgrade him into their penthouse suites. A meal at a restaurant inevitably meant an interruption from an admirer, and scientists approached him with drop-jawed wonder as though some of the stardust might rub off."
For the most part, however, Salk was "appalled at the demands on the public figure he has become and resentful of what he considers to be the invasion of his privacy", wrote The New York Times, a few months after his vaccine announcement. The Times article noted, "at 40, the once obscure scientist ... was lifted from his laboratory almost to the level of a folk hero." He received a presidential citation, a score of awards, four honorary degrees, half a dozen foreign decorations, and letters from thousands of fellow citizens. His alma mater, City College of New York, gave him an honorary degree as Doctor of Laws. But "despite such very nice tributes", The New York Times wrote, "Salk is profoundly disturbed by the torrent of fame that has descended upon him. ... He talks continually about getting out of the limelight and back to his laboratory ... because of his genuine distaste for publicity, which he believes is inappropriate for a scientist."
During a 1980 interview, 25 years later, he said, "It's as if I've been a public property ever since, having to respond to external, as well as internal, impulses. ... It's brought me enormous gratification, opened many opportunities, but at the same time placed many burdens on me. It altered my career, my relationships with colleagues; I am a public figure, no longer one of them."
### Maintaining his individuality
"If Salk the scientist sounds austere", wrote The New York Times, "Salk the man is a person of great warmth and tremendous enthusiasm. People who meet him generally like him." A Washington newspaper correspondent commented, "He could sell me the Brooklyn Bridge, and I never bought anything before." Award-winning geneticist Walter Nelson-Rees called him "a renaissance scientist: brilliant, sophisticated, driven ... a fantastic creature.": 127
He enjoys talking to people he likes, and "he likes a lot of people", wrote the Times. "He talks quickly, articulately, and often in complete paragraphs." And "He has very little perceptible interest in the things that interest most people—such as making money." That belongs "in the category of mink coats and Cadillacs—unnecessary", he said.
## Establishing the Salk Institute
The Salk Institute at La Jolla
In the years after Salk's discovery, many supporters, in particular the National Foundation, "helped him build his dream of a research complex for the investigation of biological phenomena 'from cell to society'." Called the Salk Institute for Biological Studies, it opened in 1963 in the San Diego neighborhood of La Jolla, in a purpose-built facility designed by the architect Louis Kahn. Salk believed that the institution would help new and upcoming scientists along in their careers, as he said himself, "I thought how nice it would be if a place like this existed and I was invited to work there."
In 1966, Salk described his "ambitious plan for the creation of a kind of Socratic academy where the supposedly alienated two cultures of science and humanism will have a favorable atmosphere for cross-fertilization." Author and journalist Howard Taubman explained:
Although he is distinctly future-oriented, Dr. Salk has not lost sight of the institute's immediate aim, which is the development and use of the new biology, called molecular and cellular biology, described as part physics, part chemistry and part biology. The broad-gauged purpose of this science is to understand man's life processes.
There is talk here of the possibility, once the secret of how the cell is triggered to manufacture antibodies is discovered, that a single vaccine may be developed to protect a child against many common infectious diseases. There is speculation about the power to isolate and perhaps eliminate genetic errors that lead to birth defects.
Dr. Salk, a creative man himself, hopes that the institute will do its share in probing the wisdom of nature and thus help enlarge the wisdom of man. For the ultimate purpose of science, humanism and the arts, in his judgment, is the freeing of each individual to cultivate his full creativity, in whichever direction it leads. ... As if to prepare for Socratic encounters such as these, the institute's architect, Louis Kahn, has installed blackboards in place of concrete facings on the walls along the walks.
The New York Times, in a 1980 article celebrating the 25th anniversary of the Salk vaccine, described the current workings at the facility:
At the institute, a magnificent complex of laboratories and study units set on a bluff overlooking the Pacific, Dr. Salk holds the titles of founding director and resident fellow. His own laboratory group is concerned with the immunologic aspects of cancer and the mechanisms of autoimmune disease, such as multiple sclerosis, in which the immune system attacks the body's own tissues.
In an interview about his future hopes at the institute, he said, "In the end, what may have more significance is my creation of the institute and what will come out of it, because of its example as a place for excellence, a creative environment for creative minds."
Francis Crick, codiscoverer of the structure of the DNA molecule, was a leading professor at the institute until his death in 2004.
The institute also served as the basis for Bruno Latour and Steve Woolgar's 1979 book Laboratory Life: The Construction of Scientific Facts.
## AIDS vaccine work
Beginning in the mid-1980s, Salk engaged in research to develop a vaccine for AIDS. He cofounded The Immune Response Corporation (IRC) with Kevin Kimberlin and patented Remune, an immunologic therapy, but was unable to secure liability insurance for the product. The project was discontinued in 2007, twelve years after Salk's death.[citation needed]
## Salk's "biophilosophy"
Jonas Salk during a 1988 Centers for Disease Control visit
In 1966, The New York Times referred to him as the "Father of Biophilosophy." According to Times journalist and author Howard Taubman, "he never forgets ... there is a vast amount of darkness for man to penetrate. As a biologist, he believes that his science is on the frontier of tremendous new discoveries; and as a philosopher, he is convinced that humanists and artists have joined the scientists to achieve an understanding of man in all his physical, mental and spiritual complexity. Such interchanges might lead, he would hope, to a new and important school of thinkers he would designate as biophilosophers." Salk told his cousin, Joel Kassiday, at a meeting of the Congressional Clearinghouse on the Future on Capitol Hill in 1984 that he was optimistic that ways to prevent most human and animal diseases would eventually be developed. Salk said people must be prepared to take prudent risks, since "a risk-free society would become a dead-end society" without progress.
Salk describes his "biophilosophy" as the application of a "biological, evolutionary point of view to philosophical, cultural, social and psychological problems." He went into more detail in two of his books, Man Unfolding, and The Survival of the Wisest. In an interview in 1980, he described his thoughts on the subject, including his feeling that a sharp rise and an expected leveling off in the human population would take place and eventually bring a change in human attitudes:
I think of biological knowledge as providing useful analogies for understanding human nature. ... People think of biology in terms of such practical matters as drugs, but its contribution to knowledge about living systems and ourselves will in the future be equally important. ... In the past epoch, man was concerned with death, high mortality; his attitudes were antideath, antidisease", he says. "In the future, his attitudes will be expressed in terms of prolife and prohealth. The past was dominated by death control; in the future, birth control will be more important. These changes we're observing are part of a natural order and to be expected from our capacity to adapt. It's much more important to cooperate and collaborate. We are the co-authors with nature of our destiny.
His definition of a "biophilosopher" is "Someone who draws upon the scriptures of nature, recognizing that we are the product of the process of evolution, and understands that we have become the process itself, through the emergence and evolution of our consciousness, our awareness, our capacity to imagine and anticipate the future, and to choose from among alternatives."
Just prior to his death, Salk was working on a new book along the theme of biophilosophy, privately reported to be titled Millennium of the Mind.
## Personal life and death
The day after his graduation from medical school in 1939, Salk married Donna Lindsay, a master's candidate at the New York College of Social Work. David Oshinsky writes that Donna's father, Elmer Lindsay, "a wealthy Manhattan dentist, viewed Salk as a social inferior, several cuts below Donna's former suitors." Eventually, her father agreed to the marriage on two conditions: first, Salk must wait until he could be listed as an official M.D. on the wedding invitations, and second, he must improve his "rather pedestrian status" by giving himself a middle name.": 99
They had three children: Peter (who also became a physician and is now a part-time professor of infectious diseases at the University of Pittsburgh), Darrell, and Jonathan Salk. In 1968, they divorced and, in 1970, Salk married French painter Françoise Gilot.
Jonas Salk died from heart failure at the age of 80 on June 23, 1995, in La Jolla, and was buried at El Camino Memorial Park in San Diego.
## Honors and recognition
... in recognition of his 'historical medical' discovery ... Dr. Salk's achievement is meritorious service of the highest magnitude and dimension for the commonwealth, the country and mankind." The governor, who had three children, said that "as a parent he was 'humbly thankful to Dr. Salk,' and as Governor, 'proud to pay him tribute'.
• 1955, City University of New York creates the Salk Scholarship fund which it awards to multiple outstanding pre-med students each year
• 1956, awarded the Lasker Award
• 1957, the Municipal Hospital building, where Salk conducted his polio research at the University of Pittsburgh, is renamed Jonas Salk Hall and is home to the university's School of Pharmacy and Dentistry.
• 1958, awarded the James D. Bruce Memorial Award
Salk's bronze bust in the Polio Hall of Fame
Because of Doctor Jonas E. Salk, our country is free from the cruel epidemics of poliomyelitis that once struck almost yearly. Because of his tireless work, untold hundreds of thousands who might have been crippled are sound in body today. These are Doctor Salk's true honors, and there is no way to add to them. This Medal of Freedom can only express our gratitude, and our deepest thanks.
### Documentary films
• In early 2009, the American Public Broadcasting Service aired its new documentary film, American Experience: The Polio Crusade. The documentary, available on DVD, can also be viewed online at PBS's website.
• On April 12, 2010, to help celebrate the 55th anniversary of the Salk vaccine, a new 66-minute documentary, The Shot Felt 'Round the World, had its world premiere. Directed by Tjardus Greidanus and produced by Laura Davis, the documentary was conceived by Hollywood screenwriter and producer Carl Kurlander to bring "a fresh perspective on the era."
• In 2014, actor and director Robert Redford, who was once struck with a mild case of polio when he was a child, directed a documentary about the Salk Institute in La Jolla.
• In Chapter 10 of the 2018 season of Genius Michael McElhatton portrays Salk in a short cameo where he is on a date with Françoise Gilot.
## Salk's book publications
• Man Unfolding (1972)
• Survival of the Wisest (1973)
• World Population and Human Values: A New Reality (1981)
• Anatomy of Reality: Merging of Intuition and Reason (1983)
This page was last updated at 2022-02-21 14:22 UTC. . View original page.
All our content comes from Wikipedia and under the Creative Commons Attribution-ShareAlike License.
Contact
Top
| 2022-07-05T11:57:01 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.17769062519073486, "perplexity": 5263.2226332715845}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-27/segments/1656104576719.83/warc/CC-MAIN-20220705113756-20220705143756-00674.warc.gz"}
|
https://atlaswww.hep.anl.gov/hepsim/doc/doku.php?id=hepsim:dev_hepsim
|
Monte Carlo files from any location can be published on HepSim. HepSim is not a storage, but a catalog of files stored in multiple URL locations. It is your responsibility to maintain Monte Carlo data visible from HepSim. HepSim tools allow:
• to index files so they will be available from HepSim;
If the dataset is new, you will see a new entry in the HepSim database. Your authorship will be preserved on the HepSim web page. If you have made a mirror of the existing data, your server will be added as a mirror for a given dataset.
If you created Monte Carlo files, you can publish them using hepsim#petrel project, and link such files to HepSim after you index them as explained below. In this case you do not need to maintain a web server.
# What do you need
If you decide to publish Monte Carlo files (or make a mirror of the existing files), you need the following:
• A web server that can hold your data (>1 TB for /var/www/html is recommended). It is advisable to create a separate partition with RAID10, say, /data, and link this directory to /var/www/html/.
• Linux OS (any flavor)
• Apache2 with PHP module that can serve/var/www/html/
• Java 8 JDK or JRE (optionally, for tools to check data)
You there is no web server, one can add files to the “petrel#hepsim” project using Globus. See the description later.
The root directory of a typical HepSim repository has the name “events”. This directory should be served by Apache, i.e. it should be visible from /var/www/html. You will need to make the directory structure such as:
|-events # HepSim root directory
| |-pp # process type: pp, ee, ep, misc (single particles)
| | |-14tev # CM energy. Can be 100tev, 250gev, 500gev
| | | |-qcd_pythia8 # this directory contains ProMC files for EVGEN
| | | | |-rfast001 # subdirectory with ROOT/Delphes files
| | | | |-rfull001 # subdirectory with SLCIO files
| | | | |-macros # files for truth validation (optional)
(it shows a data sample for 14 TeV pp with the name “qcd_pythia8”). The directory “events/pp/14tev/qcd_pythia8” should contain truth-level ProMC files. The sub-directories “rfast001” contains fast simulation files (tag “rfast001”), while “rfull001” should contain LCIO files with full simulation. The directory “macros” contains macro files written in Jython for validation, as well as images (optional).
After populating the directory “events/pp/14tev/qcd_pythia8” with ProMC files, you will need to index all files (including reconstruction tags). Install the needed packages as explained below. Download the example from hepsim_web.tgz Assuming that you are in the directory above the directory “events”, run these commands:
wget https://atlaswww.hep.anl.gov/hepsim/doc/lib/exe/fetch.php?media=hepsim:hepsim_web.tgz -O hepsim_web.tgz
tar -zvxf hepsim_web.tgz
cd hepsim_web/web_post
wget https://atlaswww.hep.anl.gov/hepsim/soft/hs-toolkit.tgz -O - | tar -xz;
source hs-toolkit/setup.sh # this checks if Java is installed
This package has 2 directories:
• events directory should be served by HTTP Apache. You can move it to /var/www/html location.
• web_post directory should be outside the Apache area. This directory is used to index your files in the directory “events”
This package has 2 example files in “events/ee/250gev/pythia6_higgs_gamgam” to illustrate how the indexing works.
Now, index all ProMC/ROOT/SLCIO files located in “events”. Open the script “A_RUN_hepsim.sh” and specify the location of the “events” directory. Then run “bash ./A_RUN_hepsim.sh”. It will process the directory “events/”. You can edit the script to change the indexed directory to ““events/pp/100tev/”. After indexing, several new files should appear, such as “files.zip”, “metadata.txt” and “dirs.idx”.
To make sure that everything works, look with the browser in the HTTP link “http://yourserver/events/”. You should see your files and the directory structure. Note that what you see is not what you see in HepSim, which does not use the “index.php” file.
Now you can:
• populate the directory tree with your files (for a new dataset). ProMC is used for EVGEN files, abd SLCIO/ROOT files for directories “rfullXXX/rfastXXX”, where XXX is a tag number.
• copy existing files from the HepSim and put them to the correct directory (will be mirror)
In both cases, make sure that Linux system administrator set the correct permission for the directory “events”, so you can copy the files. The directory for indexing should be inside your private directory outside the Web area.
If you have indexed the files successfully, send a request to “[email protected]” (or [email protected]) to include your repository to HepSim database. Please include a short description of your files and your name (it will be shown on the web page).
# How to mirror entire dataset
You can mirror an entire dataset by copying HepSim files to your mirror web server (or local computer). You can use the command “hs-mirror” from the “hs-toolkit” package. For example, if you want to mirror a dataset with known URL, use this example:
wget https://atlaswww.hep.anl.gov/hepsim/soft/hs-toolkit.tgz -O - | tar -xz;
source hs-toolkit/setup.sh # setup HepSim programs
# now copy a dataset from URL to a new location
SOURCE=https://cepcgit.ihep.ac.cn:81/hepsim/events/ee/250gev/pythia6_higgs_gamgam_test
OUTPUT_DIR=/var/www/html/
hs-mirror -i $SOURCE -o$OUTPUT_DIR
This example creates the directory ”/var/www/html/events/ee/250gev/pythia6_higgs_gamgam_test“ and copies all files from the URL. The URL can be found using the HepSim web page.
If you want to download only EVGEN files, without reconstructed events, use this command:
hs-mirror -i $SOURCE -o$OUTPUT_DIR -t evgen
Generally, you do not need to index files in the mirror directory.
# How to index directories
If you have made new files for HepSim (and added new file to the mirrored directory), you will need to index all files Assume your files are located inside the directory “events/ep/pythi8_dis”. Then run “hs-index” script:
wget https://atlaswww.hep.anl.gov/hepsim/soft/hs-toolkit.tgz -O - | tar -xz;
source hs-toolkit/setup.sh # setup HepSim programs
hs-index events/ep/pythi8_dis
If you need to re-index all subdirectories inside the directory “events”, pass the upper directory to this script:
hs-index events
This script creates:
• “files.zip” - with the list of files
• “metadata.txt” - with some information from ProMC files
• “dirs.txt” - a list with subdirectories
# Using Petrel from Globus
Monte Carlo files can be added to the “petrel#hepsim” project (https://press3.mcs.anl.gov/petrel/) on the grid Globus, so hey can be accessed via the grid and https for public view. In this case there is no need to run a private web server. The description of Petrel can be found in https://press3.mcs.anl.gov/petrel/documentation/. You will need a Globus account to be able to store files on Petrel.
You can run your personal Petrel projects (with enabled https) with the files with HepSim-supported files, or you can add your files to the existing petrel#hepsim project. The directory with Monte Carlo files should be properly indexed as described above, and then you can copy such directory to Petrel Web-based storage using the transfer tools.
A typical workflow is following:
• create directory with MC files on OSG or other resources
• index files using the tools described above
• Move the directory with the files to a petrel project (or ask to be included to petrel#hepsim)
• Send a URL location of your files to [email protected]
# Summary
When everything is done, this is what you should expect:
• Your files will be visible on the main HepSim web page and on the current mirrors (takes ~ few days to propagate the changes)
• You can search your files etc. using the main HepSim web page
• You can search, list and download files using hs-toolkit commands (hs-find, hs-ls, hs-get etc)
• Since your files are public, there is good chance that somebody will make a mirror to reduce the load on your server
• You server will be listed on the page statistics summary
Sergei Chekanov 2016/04/28 21:31Sergei Chekanov 2016/10/24 21:31
| 2023-03-24T22:15:18 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4301208257675171, "perplexity": 6472.150649915736}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296945289.9/warc/CC-MAIN-20230324211121-20230325001121-00541.warc.gz"}
|
http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S1405-22532021000300002&lng=es&nrm=iso&tlng=en
|
## Articulo
• Similares en SciELO
## versión On-line ISSN 2007-3496versión impresa ISSN 1405-2253
### Am. Lat. Hist. Econ vol.28 no.3 México sep./dic. 2021 Epub 04-Oct-2021
#### https://doi.org/10.18232/alhe.1215
Artículos
Economic growth, nutrition and living standards in 19th century Lima: new estimates of welfare ratios using a linear programming model
Crecimiento económico, nutrición y niveles de vida en Lima en el siglo XIX: nuevas estimaciones de ratios de bienestar usando un modelo de programación lineal
1Pontificia Universidad Católica del Perú, Lima, Perú.
Abstract
This study relies on a linear programming model to estimate welfare ratios in 19th century Lima. By using a linear programming model, the food basket guarantees the intake of basic nutrients at the minimum cost. The subsistence cost includes the cost of food and other basic needs. The estimates show that low-skilled workers in Lima were able to cover their basic needs in 1800-1875. The results also show that living standards of low-skilled workers declined during the Guano Era. Living standards in Lima, however, compared favorably to several cities in Europe.
Key words: living costs; prices; wages; Lima
JEL Clasification: N36; I32; J31; C61
Resumen
Este estudio se basa en un modelo de programación lineal para estimar ratios de bienestar en Lima en el siglo XIX. Usando un modelo de programación lineal, la canasta de alimentos garantiza el consumo de nutrientes básicos al mínimo costo. El costo de subsistencia incluye el costo de los alimentos y otras necesidades básicas. Las estimaciones muestran que trabajadores poco calificados en Lima pudieron cubrir sus necesidades básicas en 1800-1875. Los resultados también muestran que los niveles de vida de los trabajadores poco calificados disminuyeron durante la Era del Guano. Los niveles de vida en Lima, sin embargo, no eran bajos en comparación con varias ciudades de Europa.
Palabras-clave: costos de vida; precios; salarios; Lima
Introduction
In the last years, several studies have focused on the standards of living in Latin America. Information on real wages and height suggests that living standards in many parts of Spanish America compared favorably to Europe in late colonial times (Dobado-González and García-Montero, 2014). In the 19th century, real wages improved in some Latin American economies and remained or declined in others.1 There were important differences in living standards within Latin America; Argentina, for instance, had higher living standards than other cities in the region.2
Peru in the 19th century constitutes an interesting study case of living standards. Peru was one of the main commercial and economic centers in the Americas in colonial times. After Independence, Peru remained an important economy in the region. In the first decades of the 19th century, political instability affected the economy. The economic situation of Peru changed in the mid-19th century. In the 1850s and 1860s, Peru experienced a commercial boom due to the exportation of guano. The Guano Era was in fact one of the periods of fastest export growth in Latin America. The expansion of foreign trade led to the expansion of the economy in several regions of Peru, especially on the coast.
Could Limenians cover their basic needs in the 19th century? How did living standards evolve during this period? Did low-income families experience an improvement in living standards during the Guano Era?
Some studies suggest that low-income families in Lima did not increase their living standards during the Guano Era. For instance, Twrdek and Manzel (2010) indicate that height (proxy for nutrition) did not change during this period in spite of the economic bonanza. Other studies suggest that low-skilled workers could cover their basic needs, but experienced a decline in living standards during the Guano Era (Arroyo-Abad, 2014; Zegarra, 2020a).
Welfare ratios constitute a useful indicator to determine the capacity of families to cover their basic needs. The welfare ratio is calculated as the ratio between total family income and the cost of subsistence.3 The cost of subsistence (also known as poverty line) is the cost of basic needs, such as food, clothing, fuel, housing, among others. If the welfare ratio is higher than 1.0, families are able to cover their basic needs.
Two methods can be employed to estimate the subsistence food basket and welfare ratios. One of those methods consists of using historical diets to determine the composition of the subsistence basket. In this case, welfare ratios are consistent with consumption habits. A potential weakness of relying on historical diets is that habits could vary across people and over time; so choosing a particular diet may be arbitrary and may introduce biases in the estimation of welfare ratios. An alternative methodology to estimate welfare ratios consists of using a linear programming model. Linear programming can be used to estimate the least-cost food basket that guarantees a minimum intake of important nutrients. Linear programming has been recently used for the estimation of welfare ratios in several economies (Allen, 2017; Zegarra, 2021). This method is useful to determine theoretically the food basket that a family must consume in order to ingest basic nutrients at the lowest possible cost. A potential weakness of the method is that families do not necessarily count with complete information on prices and nutrients and do not rely on a mathematical tool for the selection of their diets.4
Two studies have estimated welfare ratios for 19th century Lima. Like most historical estimations of welfare ratios, Arroyo-Abad (2014) relied on historical diets to estimate welfare ratios. In another study, I relied on a linear programming model to estimate the cost of food, but assumed that the composition of the food basket was not very different from 1860s diets (Zegarra, 2020a). Importantly, both studies assume that people should ingest at least minimum quantities of calories and proteins. A balanced-nutrition diet, however, should also include other nutrients, such as fat, iron and vitamins.
In this study, I estimate welfare ratios for low-skilled workers in 19th century Lima using an alternative methodology. I use a linear programming model and assume that the food basket should guarantee the intake of calories, proteins, fat, iron and some basic vitamins at the lowest possible cost. I do not assume that the food basket should be close to historical diets. I add expenses on fuel, clothing, housing and other basic goods in order to calculate the cost of subsistence. I then estimate the welfare ratios of low-skilled workers as the ratio between the family income and the cost of subsistence. The results of the linear programming model show that the least-cost food basket was composed of a large quantity of chickpeas, in addition to potatoes and mutton.
The estimates show that the welfare ratio in Lima was usually above 1.0. Low-skilled workers earned enough to cover the basic needs of their families. However, living standards declined during the Guano Era. Living standards were then negatively correlated with economic growth, at a time of increasing terms of trade and immigration of chinese workers. This result is consistent with the findings for other countries in Latin America: the evidence for the region suggests that if economic growth is associated with an increase in terms of trade and massive immigration, real wages may decline. Nevertheless, in spite of the decline in real wages during the Guano Era, low-skilled workers in Lima in the mid-19th century were not poorer than some of their Western European counterparts. Although living standards in Lima were below those in London, the welfare ratio in Lima was similar to the ratios in Amsterdam, Paris and Strasbourg in the 19th century.
Historical background
Peru has always been an economy in rich natural resources. The country has abundant mining resources in the highlands and rich valleys on the coast. Historically, Peru has exported natural resources. In colonial times, most of Peruvian exports were minerals and agricultural products. Among minerals, Perus main export was silver. The country also exported agricultural products, such as sugar and bark. After Independence, Peruvian exports were also natural resources. From the late 1840s, Peru exported guano, entering into the Guano Era. In the 1870s, nitrates increased in importance. Sugar and cotton were also important exports in the 19th century.
The importance of the Peruvian export sector varied across regions. In the northern highlands, most of the southern highlands and in the jungle, mining had a limited scope and most agriculture was not destined to exportation. Exports came primarily from the coast and the central highlands.
By the mid-19th century, Lima had around 100 000 inhabitants. Lima was the largest city of Peru, a country of 2 000 000 inhabitants. Limenians conducted a variety of activities. In 1858, low skilled workers represented around 40% of the labor force (Zegarra, 2020a); among them, servants, launderers, cooks, laborers and mailmen were relatively important. In addition, artisans accounted for 25% of the labor force of Lima and merchants for 15%. The State employed around 12% of the labor force of Lima, including military personal and bureaucracy. Some people worked in nearby chakras, but they represented a minor proportion of the labor force of Lima (only 1%).
The Peruvian economy experienced important changes during the 19th century. In the 1820s, Independence wars affected the export sector. Exports of minerals fell between 1795 and 1830. Civil wars hit the country following Independence. Civil wars were frequent in 1825-1845 (Tantaleán, 2011). The Presidency changed 18 times between 1830 and 1845. Evasion, low levels of economic activity and civil unrest contributed to the limited capacity of the State to collect taxes.
The political and economic situation of the country dramatically changed from the mid-1840s. Civil wars were less frequent and governments were more stable. In addition, Peru started the exportation of guano from the late 1840s (Hunt, 2012). The export sector increased rapidly in the following years. In particular, the value of exports increased from 9 000 000 dollars in 1850 to 31 000 000 in 1860 and 50 000 000 in 1870 (Zegarra, 2018). Economic activity in Lima expanded. The credit market of Lima increased during the Guano Era (Camprubí, 1957): credit remained below 500 000 dollars in 1835-1845, but then increased to nearly 2 000 000 dollars in 1855 (Zegarra, 2016).
Nutrition in 19th century Peru
Peruvians consumed a variety of foods in the 19th century. Some people consumed much meat and bread, whereas others consumed large quantities of maize, legumes and tubers.
In Lima, bread, meat, maize and tubers were widely consumed. In 1839, the annual consumption of an average Limenian included around 115 kg of bread, 67 kg of meat, 55 kg of maize, 43 kg of tubers (potatoes, sweet potatoes and yucas), among other items (see table 1). In the late 1860s, the annual diet of artisans in Lima was composed of almost 170 kg of meat, more than 100 kg of bread, 63 kg of rice, 42 kg of beans, in addition to lard, sugar and other items. Soldiers consumed similar quantities of meat, bread and beans as artisans, but far more tubers, more noodles and less rice. Convicts also consumed large quantities of meat and bread; in addition, they consumed far more potatoes than artisans and soldiers.5
Table 1 Diets of Peruvians, 19th Century
Average Limenian Male adult equivalent Artisans in Lima Soldiers and sailors Convicts in Lima Coolies on the coast Slaves on the coast Laborers in the highlands
Meats kg 66.6 86.6 167.9 168.0 157.5 88.2 0.0 42.1
Milk kg 0.0 0.0 1.2 0.0 0.0 0.0 0.0 0.0
Cheese kg 0.2 0.3 0.0 0.0 0.0 0.0 0.0 0.0
Eggs kg 0.4 0.5 0.0 0.0 0.0 0.0 0.0 0.0
Lard kg 0.0 0.0 21.1 10.4 10.5 10.5 0.0 3.5
Bread kg 115.2 149.8 104.9 124.8 115.6 9.1 0.0 56.0
Maize kg 55.0 71.5 0.0 42.0 0.0 0.0 167.9 184.9
Rice kg 15.9 20.6 63.0 51.6 57.8 139.1 0.0 0.0
Noodles kg 0.0 0.0 8.9 0.0 0.0 0.0 0.0 0.0
Legumes kg 14.6 18.9 42.0 46.4 57.8 66.1 167.9 62.7
Tubers kg 43.2 56.2 0.0 46.0 89.4 45.6 0.0 56.0
Sugar kg 37.5 48.8 36.3 7.9 5.3 2.6 0.0 0.0
Miscelanous kg 0.0 0.0 11.1 6.4 0.0 0.0 0.0 0.0
Vegetables kg 18.9 24.5 0.0 0.0 0.0 54.8 0.0 36.6
Total kg 367.5 477.8 456.4 503.5 493.9 415.9 335.8 441.7
Nutrients per day (as % of minimum requirements)
Calories 82 115 111 101 90 93 65
Proteins 127 199 206 194 175 213 141
Fat 164 404 328 298 193 65 104
Iron 130 143 155 144 129 234 148
Thiam. 128 87 146 133 81 122 107
Niacin 149 182 211 195 99 201 138
Vit. B12 211 383 425 398 188 0 132
Folate 206 314 357 413 466 1001 447
Vit. C 92 8 67 130 138 31 110
Notes: The table reports diets of Peruvians in 1839 and 1869, and the intake of nutrients as a percentage of the minimum requirement for an adult male. The nutrition requirements are 3 300 kcal calories, 60 g of proteins, 38 g of fat, 17 mg of iron, 1.7 mg of thiamine, 21 mg NE of niacin, 1 µg of vitamin B12, 200 µg of folate and 40 mg of vitamin C per day.
Sources: Córdova y Urrutia (1992) and Pardo (1870) reports the production of the main foodstuffs in the valleys of Lima to be sold in the city of Lima, as well as the importation of foodstuffs from other provinces into Lima. From those figures, one can obtain total consumption in Lima. To calculate per-capita consumption, I rely on the population of Lima in 1836. To calculate the equivalent of a male adult, I rely on the ratio of calorie requirements of a male adult with respect to the calorie requirements for an average person. The table also reports the food baskets of male adults in Peru in 1869 from Pardo (1870). For soldiers, the table reports the average quantities in the diets of a soldier from the Army and a sailor from the Navy (Pardo, 1870). For convicts, the table reports the average quantities in the diets of convicts in two jails in Lima (Pardo, 1870). For coolies, the table reports the average quantities using several diets of coolies (Pardo, 1870). For laborers in the highlands, the table reports the average quantities from the diets of a mining laborer in Cerro de Pasco, a railroad laborer in Arequipa and a Indigenous laborer (Pardo, 1870).
The consumption of meat in Lima was relatively large for international standards. For instance, in modern Europe, a respectable diet of laborers included around 26 kg of meat per year (Allen, 2001). The high consumption of meat in Lima could be explained by a relatively low price of meat. Meat was indeed relatively cheap in Lima compared to London. In 1800-1850, one kilogram of beef in Lima cost around 2.5 times a kilogram of maize, the cheapest source of calories. In London, in the same period, one kilogram of beef cost around five times a kilogram of oats or barley, the cheapest sources of calories. Certainly, relative prices are not the only possible factor behind the large consumption of meat: one could also argue that living standards in Lima were relatively high.
In the highlands, the diet was different. It seems Indigenous people in Peru rarely consumed meat. Hill (1860), for example, indicated that people in Cuzco (in the Southern highlands of Peru) rarely ate meat more than once a week; and, on the rest of the week, their diets were primarily composed of maize and barley.6 In the late 1860s, laborers in the highlands consumed meat, but their diets were largely composed of maize. Potatoes, legumes and bread were also important items in their diets.
Diets varied according to economic level and social status. As expected, low-income families consumed smaller quantities of meat and other expensive sources of calories than medium-or high-income families. All over the coast, coolies did not consume as much meat as artisans;7 instead, they consumed more rice and legumes. Slaves consumed large quantities of potatoes. Laborers in the highlands also consumed large quantities of potatoes and maize.
Did Peruvians and, in particular, Limenians consumed enough nutrients for a healthy life? To answer this question, I rely on the nutrients requirements for a healthy life and the chemical composition of foodstuffs. People require calories and proteins for survival. In addition, people require fat, iron and vitamins for a balanced nutrition. Requirements of nutrients depend on age, height, weight and type of occupation. Calorie requirements partly depend on weight. I assume a weight of 55 kg for adult men and 50 kg for adult women.8 I also assume a daily energy requirement of 2.2 bmr for men and 1.8 bmr for women, which implies heavy work for men and moderate work for women. A man of 18-30 years of age would then need 3 300 kcal calories per day, and a woman in the same age range would need 2 200 kcal calories per day.9 Following Allen (2017), I rely on Indian dietary requirements of proteins, fat, iron and vitamins (Rao, 2009). Since Indian dietary requirements are calculated assuming a weight of 60 kg for men (only slightly more than the weight of Limenians), those requirements may be close to the nutrition needs of 19th century Limenians. Therefore, in addition to 3 300 kcal calories, a male adult would require 60 g of proteins, 38 g of fat, 17 mg of iron, 1.7 mg of thiamine, 21 mg NE of niacin, 1 µg of vitamin B12, 200 µg of folate and 40 mg of vitamin C per day.
Information on the chemical composition of foodstuffs comes from several sources.10 I adjust the information from the composition tables to obtain the actual consumption of nutrients per purchased kilogram of food. In particular, I take into account that some portions of the foods were discarded. Indian dietary requirements take into account the loss of nutrients during cooking (Allen, 2017; Rao, 2009).
Let us analyze whether Limenians obtained enough nutrients for a healthy life. In the late 1830s, Limenians did not consume enough calories. On average, a male adult consumed 2 700 kcal calories per day. This amount was below the daily requirement of 3 300 kcal calories for hard work. In the late 1860s, some consumed enough calories. Artisans, for instance, obtained 15% more calories than needed. Soldiers and convicts also covered their requirements of calories. Coolies, slaves and laborers in the highlands, however, consumed fewer calories than required. For some people, other nutrients were not ingested in sufficient quantities. For instance, slaves did not consume vitamin B12, because of the lack of meat in slaves’ diets (as reported by contemporary accounts). Some diets were also deficient on vitamin C.
Therefore, our calculations suggest that diets varied across locations and occupations and that not all Peruvians satisfied their nutrition needs. Nevertheless, one must be cautious about these calculations. The information on diets is scattered. I do not count with detailed information about the diets of Limenians. For 1839, I estimated the average consumption of foods in Lima. For that year, however, it is not possible to determine how diets varied across Limenians. There is information on the diversity of diets in Peru for some occupations for 1869, but not for other years.
In the following sections, I opt for a different method to determine whether Limenians were able to cover their basic needs. In particular, I estimate welfare ratios.
Estimating the cost of a balanced-nutrition diet
In the last two decades, a large number of studies have estimated welfare ratios in order to determine the capacity of workers to cover the basic needs of their families. The welfare ratio is calculated as the ratio of total family income divided by the cost of subsistence, where the cost of subsistence includes the cost of food and other basic expenses. If the welfare ratio is greater than 1.0, then the family income is higher than the cost of subsistence. If the welfare ratio is less than 1.0, then the family income is lower than the cost of subsistence.
Methodology to estimate the food basket
To estimate the cost of food, one needs to assume the composition of the food basket at subsistence levels. Most studies usually rely on historical diets in order to estimate the cost of food of low-income families. Historical diets constitute valuable information on consumption patterns. Relying on historical diets to estimate the cost of subsistence, however, may be problematic. One potential problem is that historical accounts usually do not provide information on all types of diets, but only on an average diet. Using an average diet for a long period may overshadow the differences in diets over time and so bias the results. On the other hand, when comparing living standards across countries, it is not clear which food baskets should be used. Using the same basket for all countries may not account for the differences in relative prices and habits. Assuming different diets, however, also involves challenges: it would be hard to determine whether the different baskets are comparable.11
In addition, one must be careful about the content of nutrients in historical diets. If the consumption habits in the past did not grant the intake of all necessary nutrients for a healthy life, then one must necessarily adjust those diets. Diets with excessive nutrients may be also problematic: diets with excessive calories may be relatively expensive. By using an over-expensive food basket, one may reach the incorrect conclusion that wages were not high enough to cover the basic nutrition needs of low-income families.
Foodstuffs vary on the composition of nutrients. Some items provide many calories. Others provide many proteins and vitamins. Foodstuffs also vary on price. For instance, meat was far more expensive than maize and tubers in 19th century Lima. Considering the differences in prices and in the chemical composition of foodstuffs, it is not clear which basket would be the cheapest form of ingesting all necessary nutrients. Should the subsistence basket include maize and meats? Should it also include legumes and potatoes?
Linear programming can be very useful to estimate the composition of the subsistence food basket. By using a linear programming model, one can determine the quantities of foodstuffs that minimize the cost of food subject to restrictions on nutrients intakes.
I use a linear programming model to determine the least-cost food basket of Lima in the 19th century. I assume that Limenians could consume the following items: wheat bread, maize, rice, noodles, quinoa, common beans, chickpeas, butter beans, potatoes, beef, mutton, chicken, lard and sugar.12 I only rely on these goods because of the availability of price information. Limenians could have also consumed other goods, but information on prices of other goods is scattered.
The linear programming model can be expressed as follows:
$Min_{\left \{ q_{j} \right \}_{j=1}^{N}}^{}\sum_{j=1}^{N}p_{j}q_{j}$
subject to
$\sum_{j=1}^{N}\alpha_{j}q_{j}\geq F_{L}^{K}$
$q_{j}\geq 0$
where
$\sum_{j=1}^{N}\alpha_{j}q_{j}$
is the total cost of the food basket, N is the number of items in the food basket, pj is the price of good j per kilogram, and qj is the consumed quantity of good j in kilograms. I impose K restrictions on nutrients. In those restrictions, αjk is the quantity of nutrient k in a kilogram of product j (k = 1, 2, .., K), FkL is the minimum quantity of nutrient k for a healthy nutrition.
Following Allen (2017), I calculated the requirements of nutrients for an average person. To do so, I relied on the distribution of the population for Lima from the Census of 1876. Requirements of calories come from Food and Agricultural Organization of the United Nations (1985); requirements of other nutrients come from Rao (2009). Then an average person in 19th century Lima would need at least 2,538 kcal calories, 52 g of proteins, 33 g of fat, 19 mg of iron, 1.3 mg of thiamine, 16 mg NE of niacin, 0.7 µg of vitamin B12, 183 µg of folate and 41 mg of vitamin C per day.
Linear programming is not exempted from criticism. The optimal basket may not reflect consumption habits, and habits may be hard to change. In addition, families do not necessarily count with complete information on prices and nutrients. Families also do not rely on a mathematical tool such as a linear programming model when selecting their diets. For low-income families, however, relative prices may play a key role (Allen, 2017).
Rather than stating that a linear programming model is superior to using historical diets, I argue that both methodologies are complementary. Each method has advantages and disadvantages. When using historical diets, welfare ratios are useful to determine the capacity of families to cover their actual consumption habits. When using linear programming, welfare ratios are useful to determine whether the incomes of families could have granted their basic needs, including having a balanced-nutrition diet.
I rely on the linear programming model to estimate the composition of the food basket. I assume pj is equal to the median prices in 1800-1873 for each product in Lima. I take into account the requirements of calories, proteins, fat, iron, thiamine, niacin, vitamin B12, folate and vitamin C. I call the optimal basket the "balanced-nutrition basket" or simply bn basket.
Table 2 reports the balanced-nutrition basket for an average person. The basket is composed of 239 kilograms of chickpeas, 15 kg of potatoes and 17 kg of mutton per year. The basket satisfies all restrictions. The binding constraints are those for calories, vitamin B12 and vitamin C. Chickpeas have a large participation in the food basket. This result is not surprising: at median prices of 1800-1873, one gram of silver on chickpeas yielded 2 248 kcal calories, much more than one gram of silver on other foodstuffs. Chickpeas also provided more proteins, iron, thiamine and folate per gram of silver than other foodstuffs. Meanwhile, the selection of mutton can be explained by the provision of vitamin B12: one gram of silver on mutton provided 3.8 μg of vitamin B12, whereas one gram of silver on beef provided 2.6 μg of vitamin B12.
1800-1809 1810-1819 1820-1829 1830-1839 1840-1849 1850-1859 1860-69 1870-73
Consumption per year
Bread kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Maize kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Rice kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Noodles kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Quinoa kg 0.0 0.0 217 0.0 0.0 0.0 0.0 0.0 0.0
Beans kg 0.0 0.0 0.0 0.0 180.6 180.6 0.0 0.0 0.0
Chickpeas kg 239.4 239.4 0.0 239.4 79.8 79.8 239.4 239.4 183.4
Butter beans kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 65.1
Potatoes kg 15.1 15.1 158.4 15.1 46.1 46.1 15.1 15.1 0.0
Beef kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Mutton kg 16.8 16.8 16.8 16.8 16.8 16.8 16.8 16.8 16.8
Chicken kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Lard kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
White sugar kg 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
Cost of food (grams of silver per day) 1.29 0.97 1.87 1.24 1.32 1.08 1.20 2.28 1.96
Nutrients per day
Calories Kcal 2 538.3 2 538.3 2 538.3 2 538.3 2 538.3 2 538.3 2 538.3 2 538.3 2 538.3
Proteins G 132.3 132.3 94.5 132.3 153.4 153.4 132.3 132.3 138.5
Fat G 51.8 51.8 46.6 51.8 32.7 32.7 51.8 51.8 44.6
Iron Mg 55.2 55.2 47.0 55.2 50.3 50.3 55.2 55.2 54.2
Thiam. Mg 2.6 2.6 3.2 2.6 2.0 2.0 2.6 2.6 2.4
Niacin mg NE 20.5 20.5 16.2 20.5 45.5 45.5 20.5 20.5 21.3
Vit. B12 µg 0.8 0.8 0.8 0.8 0.8 0.8 0.8 0.8 0.8
Folate µg 3 661.3 3 661.3 1 160.5 3 661.3 3 267.0 3 267.0 3 661.3 3,661.3 3,503.8
Vit. C Mg 40.5 40.5 56.4 40.5 40.5 40.5 40.5 40.5 40.5
Notes: The table reports the composition of the balanced-nutrition (bn) food basket as well as the intake of nutrients for an average person. The figures refer to an average person. The minimum requirements for an average person are 2,538 kcal calories, 52 g of proteins, 33 g of fat, 19 mg of iron, 1.3 mg of thiamine, 16 mg ne of niacin, 0.7 µg of vitamin B12, 183 µg of folate and 41 mg of vitamin C per day.
Source: Our own calculations, based on the linear programming model.
Figure 1 depicts the evolution of the cost of the balanced-nutrition food basket per day. The daily food cost for the average person was around one gram of silver in the 1800s. It then increased during Independence wars, surpassing 1.9 grams of silver in the late 1810s. After Independence, the daily cost of food declined to 1.2 grams of silver in the early 1830s. It remained around one gram of silver in the late 1840s and early 1850s. During the Guano Era, however, the food cost increased. In the early 1870s, the daily cost of food was around two grams of silver per day.
Notes: The figure depicts two series of the cost of food per day for one adult in grams of silver. The fixed basket refers to the optimal food basket at median prices of 1800-1873. Changing baskets refer to optimal food baskets for every decade at median decade prices. To calculate the cost of food for a five-year period, I first calculated the cost of food for each year and then computed the average cost for each five-year period.
Source: Our own calculations based on the linear programming model.
Figure Cost of Food (Grams of Silver per Day)
I calculated a single food basket for the entire period of 1800-1873 using median prices for this period. Food baskets, however, could have changed in response to changes in prices over time. Are there differences in the food cost when allowing food baskets to change over time? To answer this question, I estimate the food basket for each decade, using the median prices of each decade.13 Our estimates show that changes in the food basket do not affect the food cost significantly (see figure 1). The main differences in the cost of food between the fixed basket and the changing baskets refer to the late 1810s, late 1830s and early 1840s. Even then, however, the differences in the food cost were not large.
Let us compare the balanced-nutrition food basket (bn basket) and the baskets from Gootenberg (1990), Arroyo-Abad (2014) and Zegarra (2020a), which partly rely on historical diets (see table 3). Those studies report food baskets for a male adult; for comparison purposes, I converted those baskets to baskets for an average person. Gootenberg (1990) relies on historical diets to estimate a price index for Lima. Gootenberg’s food basket was not a subsistence basket but was supposed to reflect the consumption habits of artisans. The basket for an average person is composed of more than 80 kg of bread and around 130 kg of meat per year. This basket is also composed of dozens of kilograms of rice and beans per year. The basket was very expensive: at median prices of 1800-1873, it would cost around 3.2 grams of silver per day, equivalent to 2.5 times the cost of the bn basket. Other studies assume that the food basket was similar to 19th century consumption habits (Arroyo-Abad, 2014; Zegarra, 2020a). Those baskets were more expensive than the bn basket, but cheaper than Gootenberg’s basket.14
Table 3 Camparison of Food Baskets
Gootenberg (1990) Arroyo-Abad (2014) Zegarra (2020)
A B A B A B
Consumption per year
Bread 0 104.8 80.6 49.1 37.8 10.9 8.4
Maize 0 0 0 0 0 0 0
Rice 0 62.8 48.3 58.9 45.3 73.7 56.7
Noodles 0 0 0 0 0 0 0
Quinoa 0 0 0 0 0 0 0
Beans 0 42 32.3 49.1 37.8 28.2 21.7
Chickpeas 239.4 0 0 0 0 0 0
Butter beans 0 0 0 0 0 0 0
Potatoes 15.1 0 0 0 0 42.5 32.7
Beef 0 56 43.1 98.2 75.5 43.2 33.2
Mutton 16.8 56 43.1 0 0 19.3 14.8
Chicken 0 56 43.1 0 0 4.8 3.7
Lard 0 20.8 16 11.8 9.1 10.8 8.3
White sugar 0 0 0 0 0 1.4 1.1
Cost of food (grams of silver per day) 1.29 3.24 1.81 1.44
Notes: The table compares the balanced-nutrition basket (bn basket) and baskets derived from historical diets. For the bn basket, the figures refer to an average person. When using historical diets, the figures refer to a male adult (A) and an average person (B). I converted the baskets for a male adult from Gootenberg (1990), Arroyo-Abad (2014) and Zegarra (2020a) to baskets for an average person. To make the conversion, I rely on the ratio of calorie requirements of a male adult with respect to the calorie requirements for an average person.
Sources: Gootenberg (1990), Arroyo-Abad (2014), Zegarra (2020a) and our own calculations based on the linear programming model.
Wages and welfare ratios for low-income families
Welfare ratios are useful to determine whether families are able to cover their basic needs. The welfare ratio is calculated as the ratio of total family income divided by the cost of subsistence, where the cost of subsistence includes the cost of food and other basic goods and services. I rely on the balanced-nutrition basket to compute the food cost. I call our welfare ratios "balanced-nutrition welfare ratios" or, simply, bn welfare ratios. If the welfare ratio is greater than 1.0, then the family income is higher than the cost of subsistence. If the welfare ratio is less than 1.0, then the family income is lower than the cost of subsistence.
The subsistence cost includes the cost of food, as well as the cost of fuel, clothing, housing, and other basic items. I rely on the fixed basket (estimated with the median prices of 1800-1873) to calculate the cost of food. I add the cost of fuel, clothing, soap, candles, oil and housing. To estimate the requirement of fuel, I rely on the relation between the quantity of wood and the quantity of food in the budget of artisans in the late 1860s, as reported by Pardo (1870). I then assume that an average person required 1.79 M BTU of fuel per year.15 In addition, I assume that an average person required 3 meters of cotton, 1.3 kg of candles, 1.3 kg of soap, and 1.3 liters of oil per year.16 I assume that a family is composed of four members, so the subsistence cost of a family is four times the cost of an average person. In the case of Lima, considering that children and adolescents represented almost half of the population, the assumption of four members (two adults and two children) in a family is reasonable.17 In addition, I assume that a family rented a room in a callejón. A callejón (in plural, callejones) was a building composed of an alley and several rooms, inhabited by poor families.
Information on salaries of low-skilled workers comes from primary and secondary sources.18 Wages refer to laborers, doormen, mailmen and servants.19 The appendix describes the data sources. For doormen, mailmen and servants, information refers to annual salaries. Information on laborers salaries is available from the 1800s. For doormen and servants, information on salaries is available from the late 1820s; for mailmen, wages are available from the late 1830s. For laborers, information refers to payments for a day of work or jornales. I assume that laborers could work between 250 and 365 days per year. Several studies have assumed that laborers worked 250 days per year (Allen, 2001). Other studies, however, have questioned this assumption (Stephenson, 2018). For Lima, I do not count with information on the number of working days per year. However, since annual incomes of servants were around 250 times the jornal (payment for a day of work) of laborers in most of the period and annual incomes of doormen and mailmen were around 365 times, it is reasonable to assume that the number of working days of laborers ranged between 250 and 365.
A possible weakness of the data is that wages refer to government workers. Salaries in the private sector could be different from government salaries. The government may take time to adjust salaries to market conditions. Scattered evidence, however, suggests that, at least in the long term, government salaries reflected market conditions. For instance, contemporary observers indicate that laborers earned around one peso per day in the late 1860s. The data also shows that laborers earned around one peso per day in 1867-68.
Figure 2 depicts the evolution of daily nominal wages in grams of silver. For doormen, mailmen and servants, the daily wage was calculated as the annual labor income divided by 365. For laborers, I calculated the daily wage as D times the jornal (payment for a day of work), where D = {250/365, 1}. In the 1800s, 1810s and 1820s, laborers earned between 10 and 15 grams of silver per day. Daily wages of laborers then increased to 11.6-17 grams of silver in the late 1830s, but later declined to 8.6-12.6 grams of silver in the early 1850s. In the following decades, daily wages of laborers increased, becoming 17-24 grams of silver in the early 1870s. Meanwhile, daily salaries of doormen declined from 17 grams of silver in the 1830s to 15 grams of silver in the early 1840s, but then increased in the following decades. In the early 1870s, daily wages of doormen were 22 grams of silver. Wages of mailmen were similar to those of doormen in the 1850s, 1860s and 1870s. In the case of servants, daily wages were around 6.5 grams of silver in the 1830s. Salaries then remained around 10 grams of silver per day in the 1840s and 1850s, but increased in the 1860s and 1870s. In the early 1870s, daily salaries of servants were around 14.5 grams of silver.
Notes: The figure depicts the average daily wage for laborers, doormen, mailmen and servants. For laborers, I report the lower and upper levels. The lower level is calculated under the assumption that laborers worked 250 days per year. The upper level is calculated under the assumption that laborers worked 365 days per year.
Sources: Our own calculations based on information from the National Archives of Lima.
Figure 2 Daily Wages in the City of Lima (Grams of Silver)
Welfare ratios are calculated as the total earnings of a family divided by the cost of subsistence. I assume that only one male adult worked per family and that workers did not receive in-kind compensation for their work.20 Figure 3 depicts the evolution of the bn welfare ratios (balanced-nutrition welfare ratios). Laborers had a welfare ratio of 1.4-2.1 in the 1800s. The ratio then declined in the 1810s and 1820s. In the early 1820s, the ratio ranged between 1.0 and 1.5. The welfare ratio then increased to 1.6-2.3 in the early 1830s. During the Guano Era, the welfare ratio declined to 1.2-1.8 in the early 1850s and 0.9-1.5 in the late 1860s. In the case of doormen, the welfare ratio was around 1.9 in the early 1830s, then increased to 2.8 in the early 1850s and later declined to 1.5 in the 1860s and 1.6 in the 1870s. Living standards of mailmen were similar to those of doormen. In the case of servants, the welfare ratio was relatively low. It was below 1.0 in the 1830s, increased to 1.6 in the late 1840s, but then declined in the 1850s and 1860s. In the late 1860s, the welfare ratio of servants was around 1.0.
Notes: The figure depicts the welfare ratios for laborers, doormen, mailmen and servants. For laborers, I report the lower and upper levels. The lower level is calculated under the assumption that laborers worked 250 days per year. The upper level is calculated under the assumption that laborers worked 365 days per year. The food basket is the fixed bn basket.
Source: Our own calculations.
Figure 3 Welfare Ratios in the City of Lima (Fixed Food Basket)
In order to estimate welfare ratios, this study uses a linear programming model that guarantees the intake of basic nutrients. Alternative food baskets could yield different welfare ratios. I then estimate welfare ratios using historical diets. In particular, I use the food baskets from Gootenberg (1990), Arroyo-Abad (2014) and Zegarra (2020a). I adjusted the food baskets, so they reflect the consumption of an average person. I rely on our information on prices and wages and on our assumptions on family size, number of people who worked and number of working days.21 Figure 4 depicts the series for laborers, assuming that laborers worked 250 days per year. All series point out at similar trends: an increase in the 1830s and a significant drop in the 1850s and 1860s. Nominal salaries did not change much during the Guano Era in spite of the increasing inflation. Since nominal wages did not increase as rapidly as prices, real wages declined.
Notes: The figure depicts the welfare ratios for laborers using alternative food baskets. For all series, I assume that laborers worked 250 days per year. One series refers to our estimates, using the fixed basket. Alternaive 1 relies on the food basket of Gootenberg (1990). Alternative 2 relies on the food basket of Arroyo-Abad (2014). Alternative 3 relies on the food basket of Zegarra (2020a). Non food costs are the same for all series.
Source: Our own calculations based on the linear programming model, Gootenberg (1990), Arroyo-Abad (2014) and Zegarra (2020a).
Figure 4 Welfare Ratios Laborers in Lima, Using Alternative Food Baskets
Nevertheless, there are important differences in the magnitudes of the welfare ratios between this study and other studies. The bn welfare ratios are usually higher than the ratios estimated using historical diets. When using the basket from Gootenberg, for example, the welfare ratio is less than 1.0, far less than the bn welfare ratios. Using the baskets of Arroyo-Abad (2014) and Zegarra (2020a), the welfare ratio would be below the bn ratios most of the time. A comparison of the bn ratios with those for Gootenberg clearly illustrates the differences between linear programming and historical diets. As indicated previously, the basket from Gootenberg refers to the typical diet of artisans. The estimates of bn welfare ratios suggest that the labor income of a low-skilled worker allowed him to cover the basic nutrients of his family. In contrast, the results for the Gootenberg’s basket show that the same labor income did not allow the worker to afford the consumption habits of an artisans family. To afford those consumption habits, low-income families would need another person (such as the wife) to work for a salary.
The bn estimates suggest that living standards did not improve during the Guano Era. Other estimations of welfare ratios also suggest that the living standards of low-income families did not increase during this period of macroeconomic bonanza (Arroyo-Abad, 2014; Gootenberg, 1990; Zegarra, 2020a). In addition, the evidence on the height of low-income Limenians supports the hypothesis that living standards did not improve during the Guano Era. In particular, Twrdek and Manzel (2010) collected information on the height of convicts in Lima and found that height did not increase during the Guano Era. Since those convicts belonged to the low-income segments of society, the evidence suggests that low-income families did not improve their nutrition during the Guano Era in spite of the macroeconomic bonanza.
How can one explain the decline of the living standards of low-income families in Lima during the Guano Era, a period of economic bonanza?
The Guano Era was a period of substantial economic growth in Lima. From a theoretical point of view, it is possible that the growth of the economy led to the increase of living standards of all inhabitants, including low-income families. For instance, laborers and servants could have faced a higher demand for their services, which would increase real wages.
Real wages, however, declined. One possible explanation for the decline of real salaries during the Guano Era is that there were nominal rigidities. Under nominal rigidities, nominal salaries do not increase as rapidly as prices and so real wages decline in the presence of inflation. If the expansion of the economy led to the increase of earnings of high-income families, the higher demand for services could have led to higher prices. One might expect workers to require higher nominal wages to face higher prices. If nominal wages did not change rapidly, real wages would have declined. Nominal rigidities are usually associated with the existence of contracts or institutional restrictions. Nominal rigidities may explain a short-term decline in real wages during inflationary periods. However, it is hard to make a theoretical argument for a negative relationship between inflation and real wages in the long term.
The increase of terms of trade could also explain at least partly the decline of real wages in Lima during the Guano Era. Standard trade theory states that terms of trade may be correlated with the wage/rental ratio. In particular, the Heckscher-Ohlin model states that an increase in terms of trade may lead to a decline in the wage/rent ratio in land abundant economies and an increase in the ratio in labor abundant economies. For economies that export raw materials, a period of economic bonanza, associated with an increase in terms of trade, could be associated with the decline in the wage/rental ratio. Terms of trade increased in Peru during the Guano Era. The increase in terms of trade may have increased the demand for production factors in export sectors, in particular, in the sectors producing guano, nitrate, sugar and cotton. Since those sectors were intensive in land and capital, the increase in terms of trade may have increased the overall demand for capital and land and may have reduced the overall demand for labor. The reduction in the demand for labor in turn would have reduced real wages.
Immigration of workers could also explain the decline in real wages in Lima. Peru experienced a massive immigration of Chinese coolies in 1849-74, especially in the late 1860s. By 1876, around 50 000 Chinese citizens lived in the coast of Peru, representing around 4% of the total population. Since most Chinese immigrants were unskilled workers, immigration could have increased the supply of low-skilled labor and so could have reduced real wages.
Therefore, in the short run the decline in real wages during the Guano Era could be partly explained by higher inflation. In the long term, however, one would expect real wages to depend on changes in the demand for labor and supply of labor. The increase in terms of trade and immigration of Chinese workers could explain the long-term decline in real wages of unskilled workers during the Guano Era.
International comparison
An international comparison of welfare ratios is useful to determine the differences in living standards across cities and the possible determinants of living standards.
Comparison with other Latin American cities
No study has used linear programming to estimate welfare ratios for other Latin American cities. I then cannot determine whether welfare ratios in Lima were relatively high or low for Latin American standards. However, a comparison of the trends of welfare ratios across cities can provide useful insights. In particular, such comparison may provide some insights about the relationship between real wages and economic growth.
The evidence for 19th century Lima indicates that economic growth is not necessarily associated with an increase in living standards. Does the evidence for other Latin American economies point out in the same direction?
In the 19th century, economic growth in some Latin American countries was associated with increasing terms of trade, massive immigration and expansion of the frontier. As stated by the Heckscher-Ohlin model, increasing terms of trade in Latin America (a land-abundant region) and massive immigration would lead to a reduction in the wage/rental ratio (Arroyo-Abad, 2013; Williamson, 1999). The increasing terms of trade would lead to a lower demand for labor. In addition, immigration may have led to a greater supply of labor. Real wages could have declined due to the lower demand for labor and the greater supply of labor. However, the expansion of the frontier could reduce or counteract the effect of terms of trade and immigration on real wages. These were certainly not the only factors affecting real wages in 19th century Latin America. In some countries, civil wars also affected capital stock, the labor supply, productivity and therefore real wages.
In Argentina, the economy expanded from 1840. As the economy grew, real wages grew in Buenos Aires in 1825-1849 (Gelman and Santilli, 2018). Real wages in Buenos Aires continued increasing in the 1880-1900 (Cuesta, 2012). The growth of the economy occurred at a time of increasing terms of trade. According to Arroyo-Abad (2013), terms of trade and factor endowments affected the wage-rental ratio. Terms of trade could have reduced real wages; but the expansion of the frontier and the consequent increase in land stock counteracted the negative effect of increase terms of trade on real wages in the 19th century. In the early 20th century, real wages remained stagnant. In the 1900s and 1910s, the increase in terms of trade and immigration probably contributed to the stagnation of real wages (Williamson, 1999).
In Brazil, real wages increased in the 19th century. For instance, real wages in the Southeast of Brazil increased by almost 200% in 1830-1900. The growth of the economy may have led to the increase in the living standards of the poor in the 19th century. In the early 20th century, however, the situation changed. Real wages declined by 30% between 1905-1909 and 1920-1924. The increase in terms of trade and massive immigration probably contributed to the decline in real wages (Williamson, 1999).
In the case of Mexico, real wages declined in 1760-1810 and remained relatively stagnant in 1810-1860 (Challú and Gómez-Galvarriato, 2015). In the late 19th century, real wages increased. The pacification of the country, the integration of Mexico with the international economy and the introduction of new technologies probably contributed to the increase of real wages (Challú and Gómez-Galvarriato, 2015). Decreasing terms of trade and the expansion of the frontier probably also contributed to the increase in real wages in the late 19th century (Arroyo-Abad, 2013).22
The evolution of real wages in 19th century Lima is consistent with the findings for other Latin American economies for the late 19th and early 20th centuries. The expansion of the economy in the region in this period did not necessarily lead to the improvement of living standards. The expansion of the frontier could have contributed to the increase in living standards. However, if the expansion of the economy was associated with increasing terms of trade and massive immigration, real wages could have declined.
Comparison with European cities
Previous studies have compared living standards of Latin America and Europe. Some portray an unfavorable depiction of living standards in Latin America (relatively low living standards); others provide a favorable portrayal. Some studies show that welfare ratios in Latin America were below those in London in the 18th and 19th centuries.23 London, however, may not be representative of Europe: some studies indicate that Londoners had far higher welfare ratios than other Europeans (Allen, 2001).24 In addition, some estimates suggest that in the 18th century Spanish America had higher welfare ratios than Leipzig (Arroyo-Abad, Davies and van Zanden, 2012), and that in the 19th century Buenos Aires and Mexico had higher welfare ratios than Milan and around the same ratios as Amsterdam and Leipzig.
One problem with those welfare-ratio estimates is that they have been estimated using historical diets. One might wonder whether historical diets are comparable across countries. If they are not, then one should not rely on those ratios to determine the differences in living standards between Latin America and Europe.
Until now, no study has made a comparison of welfare ratios of Latin America and Europe using linear programming. Recently, I used linear programming to estimate welfare ratios in six European cities (Zegarra, 2021). For four of those cities (London, Amsterdam, Paris and Strasbourg), I estimated welfare ratios for the 19th century. For other two cities (Munich and Leipzig), there is only information for the 17th and 18th centuries.
In comparison to those London, Amsterdam, Paris and Strasbourg, the welfare ratio of laborers in Lima in the 19th century was not low (see figure 5). Actually, laborers in Lima had similar welfare ratios as laborers in the four European cities, including London, in the 1800s. The capacity of working families in Lima to cover their basic needs was similar to those cities in Europe. From the 1810s, the welfare ratio in London followed an upward trend. Since the welfare ratio in Lima did not maintain an upward long-term trend during this period, in the 1860s London had a far higher welfare ratio than in Lima. Therefore, over the 19th century, there occurred a divergence in living standards between Lima and London. Nevertheless, living standards in London were not the same as in other cities. Welfare ratios in Amsterdam, Paris and Strasbourg did not follow an upward long-term trend in 1800-1870. As a result, living standards in Lima were similar to those cities during this period.
Therefore, our results provide a favorable depiction of living standards in Lima. Living standards were not relatively low in 1800-1870, at least not in comparison with important European cities. One would need further research for other Latin American cities to determine whether in general living standards in Latin America compared favorably to Europe in the 19th century.
Notes: The figure depicts welfare ratios of laborers for several cities. For Lima, I depict the lower level of the welfare ratio, estimated with the 250-day assumption.
Source: For European cities, Zegarra (2021). For Lima, our own calculations.
Figure 5 Welfare Ratios in Lima and Europe
Conclusions
Two methodologies can be employed to determine the food basket and estimate welfare ratios. Most studies have relied on historical diets to determine the food basket. This study relies on a linear programming model to determine the least cost basket that granted a balanced-nutrition diet to Limenians. According to the results of this study, the balanced-nutrition welfare ratio in Lima was usually above 1.0, so families were able to cover their basic needs.
The results show that the welfare ratio in Lima declined during the Guano Era. This finding is consistent with other studies that also indicate that the living standards of the poor declined during the Guano Era, in spite of the macroeconomic bonanza (Arroyo-Abad, 2014; Gootenberg, 1990; Twrdek and Manzel, 2010; Zegarra, 2020a). The results for Lima support the hypothesis that living standards do not necessarily increase in response to economic growth. Similarly, in other Latin American countries, real wages did not necessarily increase in response to the growth of the economy in the late 19th and early 20th centuries. In Peru, a land abundant economy, the increase in terms of trade may have contributed to the decline in real wages. The immigration of Chinese coolies and domestic inflation may have also contributed to the decline in the living standards of the poor.
Nevertheless, in spite of the decline in real wages during the Guano Era, living standards in Lima were not relatively low for international standards. Lima had around the same welfare ratios as Amsterdam, Paris and Strasbourg in the mid-19th century. Although London had higher living standards than Lima, Limenians enjoyed similar living standards as working families in important European cities.
Otras fuentes.
Anales de la Hacienda Pública
Referencias
Allen, R. C. (2001). The Great Divergence in European Wages and Prices from the Middle Ages to the First World War. Explorations in Economic History, 38(4), 411–447. DOI: 10.1006/exeh.2001.0775Links ]
Allen, R. C. (2009). The British Industrial Revolution in Global Perspective. Cambridge: Cambridge University Press. DOI: 10.1017/CBO9780511816680Links ]
Allen, R. C. (2017). Absolute Poverty: When Necessity Displaces Desire. American Economic Review, 107(12), 3690–3721. DOI: 10.1257/aer.20161080Links ]
Allen, R. C., Murphy, T. E. and Schneider, E. B. (2012). The Colonial Origins of the Divergence in the Americas: A Labor Market Approach. The Journal of Economic History, 72(4), 863–894. DOI: 10.1017/S0022050712000629Links ]
Armas, F. (2007). Iglesia: Bienes y rentas: Secularización liberal y reorganización patrimonial en Lima (1820-1950). Lima: Pontificia Universidad Católica del Perú/Instituto de Estudios Peruanos. [ Links ]
Arroyo-Abad, L. (2013). Persistent Inequality? Trade, Factor Endowments, and Inequality in Republican Latin America. The Journal of Economic History, 73(1), 38–78. DOI: 10.1017/S0022050713000028Links ]
Arroyo-Abad, L. (2014). Failure to launch: Cost of living and living standards in Peru during the 19th Century. Revista de Historia Económica/Journal of Iberian and Latin American Economic History, 32(1), 47–76. DOI: 10.1017/S0212610913000232Links ]
Arroyo-Abad, L., Davies, E. and van Zanden, J. L. (2012). Between conquest and independence: Real wages and demographic change in Spanish America, 1530–1820. Explorations in Economic History, 49(2), 149–166. DOI: 10.1016/j.eeh.2011.12.001Links ]
Calderón-Fernández, A., García-Montero, H. and Llopis-Agelán, E. (2017). New research guidelines for living standards, consumer baskets and prices in Madrid and Mexico. In G. Nigro (Ed.), I prezzi delle cose/The Prices of Things: Nell’età preindustriale/In Pre-industrial Times (pp. 259–289). Florence: Firenze University Press. DOI: 10.36253/978-88-6453-492-3Links ]
Camprubí, C. (1957). Historia de los bancos en el Perú (1860-1879). Lima: s. e. [ Links ]
Challú, E. and Gómez-Galvarriato, A. (2015). Mexico’s real wages in the age of the great divergence, 1750s-1920s. Revista de Historia Económica/Journal of Iberian and Latin American Economic History, 33(1), 83–122. DOI: 10.1017/S021261091500004XLinks ]
Córdova y Urrutia, J. (1992). Estadísticas histórica, geográfica y comercial de los pueblos que comprenden las provincias del departamento de Lima. Lima: Imprenta de Instrucción Primaria. [ Links ]
Cuesta, M. (2012). Precios y salarios en Buenos Aires durante la gran expansión (1850-1914). Revista de Instituciones, Ideas y Mercados, 56, 159–179. [ Links ]
Djenderedjian, J. and Martirén, J. L. (2020). Consumption baskets and cost of living in southern late colonial Brazil: Rio Grande, 1772-1823. Revista de Historia Económica/Journal of Iberian and Latin American Economic History, 38(2), 279–309. DOI: 10.1017/S0212610919000405Links ]
Dobado-González, R. and Garcia-Hiernaux, A. (2017). Two worlds apart: Determinants of height in late 18th century central Mexico. Economics y Human Biology, 24, 153–163. DOI: 10.1016/j.ehb.2016.12.003Links ]
Dobado-González, R. and García-Montero, H. (2014). Neither So Low nor So Short: Wages and Heights in Bourbon Spanish America from an International Comparative Perspective. Journal of Latin American Studies, 46(2), 291–321. DOI: 10.1017/S0022216X14000054Links ]
Food and Agricultural Organization of the United Nations (1985). Energy and protein requirements: Report of a Joint FAO/WHO/UNU Expert Consultation. Geneva: World Health Organization. [ Links ]
Food and Agricultural Organization of the United Nations (2017). Global Food Composition Database for Pulses. Rome: Author. [ Links ]
Fuentes, M. (1858). Estadística general de Lima. Lima: Tipografia Nacional. [ Links ]
Gazeley, I. and Horrell, S. (2013). Nutrition in the English agricultural labourer’s household over the course of the long nineteenth century: Agricultural labourers’ nutrition. The Economic History Review, 66(3), 757–784. DOI: 10.1111/j.1468-0289.2012.00672.xLinks ]
Gelman, J. and Santilli, D. (2018). Wages and standards of living in the 19th century from a comparative perspective. Consumption basket, Bare Bone Basket and welfare ratio in Buenos Aires, 1825–1849. Investigaciones de Historia Económica, 14(2), 94–106. DOI: 10.1016/j.ihe.2016.09.001Links ]
Gootenberg, P. (1990). Carneros y Chuño: Price Levels in Nineteenth-Century Peru. Hispanic American Historical Review, 70(1), 1–56. DOI: 10.1215/00182168-70.1.1Links ]
Hill, S. S. (1860). Travels in Peru and Mexico. London: Longman, Green, Longman and Roberts. [ Links ]
Humphries, J. (2013). The lure of aggregates and the pitfalls of the patriarchal perspective: A critique of the high wage economy interpretation of the British industrial revolution: Critique of the High Wage Economy Interpretation. The Economic History Review, 66(3), 693–714. DOI: 10.1111/j.1468-0289.2012.00663.xLinks ]
Humphries, J. and Weisdorf, J. (2015). The Wages of Women in England, 1260–1850. The Journal of Economic History, 75(2), 405–447. DOI: 10.1017/S0022050715000662Links ]
Hunt, S. J. (2012). La formación de la economía peruana: Distribución y crecimiento en la historia del Perú y América Latina. Lima: Banco Central de Reserva del Perú/Instituto de Estudios Peruanos. [ Links ]
Instituto de Nutrición de Centro América y Panama (2017). Tabla de Composición de Alimentos de Centro América. Guatemala: Author/Organización Panamericana de la Salud. [ Links ]
López-Alonso, M. (2012). Measuring up: A history of living standards in Mexico, 1850-1950. Stanford: Stanford University Press. [ Links ]
López-Alonso, M. (2016). Economics and human biology in Latin America. En J. Komlos and I. R. Kelly (Eds.), The Oxford Handbook of Economics and Human Biology (pp. 710–729). Oxford: Oxford University Press. DOI: 10.1093/oxfordhb/9780199389292.001.0001Links ]
Latham, M. (2002). Nutrición Humana en el Mundo en Desarrollo. Rome: FAO. [ Links ]
López-Losa, E. and Piquero-Zarauz, S. P. (2021). Spanish subsistence wages and the Little Divergence in Europe, 1500–1800. European Review of Economic History, 25(1), 59–84. DOI: 10.1093/ereh/heaa005Links ]
Mancera, P. (1992). Los precios del Perú. Siglos XVI-XIX. Fuentes (vol. 1). Lima: Banco Central de Reserva del Perú. [ Links ]
Mathison, G. (1825). Narrative of a visit to Brazil, Chile, Peru, and the Sandwich Islands during the years 1821 and 1822. London: C. Knight. [ Links ]
McCance, R. and Widdowson, E. (1946). The chemical composition of foods. London: His Majesty Stationery Office. [ Links ]
Ministerio de Salud (2009). Tablas Peruanas de Composición de Alimentos. Lima: Author. [ Links ]
Ministerio de Salud (2014). Tablas Auxiliares para la Formulación y Evaluación de Regímenes Alimentarios. Lima: Author. [ Links ]
Moraes, M. I. and Thul, F. (2018). Los salarios reales y el nivel de vida en una economía latinoamericana colonial. Montevideo entre 1760-1810. Revista de Historia Económica/Journal of Iberian and Latin American Economic History, 36(2), 185–213. DOI: 10.1017/S021261091700012XLinks ]
Oviedo, J. (1872). Colección de leyes, decretos y órdenes publicadas en el Perú desde el año de 1821 hasta 31 de diciembre de 1859 (Vol. 16). Lima: Manuel A. Fuentes. [ Links ]
Pardo, M. (1870). Datos e informes sobre las causas que han producido el alza de precios de los artículos de primera necesidad que se consumen en la capital. Lima: Imprenta del Estado. [ Links ]
Paul, A. and Southgate, D. (1978). McCance and Widdowson’ The Composition of Foods. London: His Majesty Stationery Office. [ Links ]
Rao, B. (2009). Nutrient requirements and recommended dietary allowances for indians: A report of the expert group of the Indian council of medical research. Hyderabad: National Institute of Nutrition. [ Links ]
Reyes, A. (2004). Historia urbana de Lima: Los barrios Altos 1820-1880. Investigaciones Sociales, 8(13), 135–162. DOI: 10.15381/is.v8i13.6921Links ]
Salinas, A. (2013). Polos opuestos: Salarios y costo de vida 1821-1879. Lima: Universidad Nacional Mayor de San Marcos. [ Links ]
Stephenson, J. Z. (2018). Looking for Work? Or Looking for Workers? Days and Hours of Work in London Construction in the Eighteenth Century. SSRN Electronic Journal, (Scholarly Paper No. ID 3128189). DOI: 10.2139/ssrn.3128189Links ]
Tantaleán, J. (2011). La gobernabilidad y el leviatan guanero: Desarrollo, crisis y guerra con Chile. Perú: Instituto de Estudios Peruanos. [ Links ]
Tschudi, J. (1842). Travels in Peru, during the years 1838-1842 on the coast, in the Sierra, across the Cordilleras and the Andes, into the principal forests (T. Ross, Trad.). Londres: s. e. [ Links ]
Twrdek, L. and Manzel, K. (2010). The seed of abundance and misery. Economics y Human Biology, 8(2), 145–152. DOI: 10.1016/j.ehb.2010.05.012Links ]
Williamson, J. G. (1999). Real wages, inequality and globalization in latin america before 1940. Revista de Historia Económica/Journal of Iberian and Latin American Economic History, 17(S1), 101–142. DOI: 10.1017/S0212610900002287Links ]
Zegarra, F. (2016). Political instability and non-price loan terms in Lima, Peru: Evidence from notarized contracts. European Review of Economic History, 20(4), 478–525. DOI: 10.1093/ereh/hew012Links ]
Zegarra, L. F. (2018). Reconstruction of Export series for Peru before the Great Depression. Revista de Historia Económica/Journal of Iberian and Latin American Economic History, 36(3), 393–421. DOI: 10.1017/S0212610918000071Links ]
Zegarra, L. F. (2020a). Living Costs and Real Wages in Nineteenth Century Lima: Levels and International Comparisons. Australian Economic History Review, 60(2), 186–219. DOI: 10.1111/aehr.12186Links ]
Zegarra, L. F. (2020b). Trade flows, relative factor prices and the Heckscher-Ohlin theory: The case of a land-intensive economy (Working Paper). Centrum Católica, Perú. [ Links ]
Zegarra, L. F. (2021). Living costs and welfare ratios in Western Europe: New estimates using a linear programming model. European Review of Economic History, heab007. DOI: 10.1093/ereh/heab007Links ]
Appendix
Chemical composition of foods
This section explains the methodology to calculate the chemical composition of foodstuffs.
I assume that wheat was purchased as bread. I adjust the information from the composition tables to obtain the actual consumption of nutrients per purchased kilogram of food. To estimate the chemical composition of bread, I rely on the chemical composition of wheat whole-meal flour at 100%. To calculate the composition of nutrients in a kilogram of bread, I assume that one kilogram of flour yielded 1.28 kilograms of bread (Allen, 2001). In addition, I take into account that some vitamins were lost due to baking. Denote θk as the relative loss of nutrient k due to the baking of wheat flour and βk as the quantity of nutrient k in a kilogram of raw wheat flour. Under the assumption that no portion of flour was discarded when making bread, the quantity of nutrient k in a purchased kilogram of wheat bread is calculated as
Recent composition tables are not appropriate for our historical analysis especially for bread (Gazeley and Horrell, 2013). Information on calories, proteins, fat and iron for wheat whole-meal flour at 100% comes from McCance and Widdowson (1946); information on other nutrients comes from Paul and Southgate (1978). Information on the loss of vitamins due to baking comes from Paul y Southgate (1978). According to our calculations, wheat bread yielded around 2,600 kcal/kg. This figure is not very different from the assumption on bread´s calorie content made by Allen (2001): Allen assumed that bread yielded 2,450 kcal/kg of calories.
I also collected information on nutrients and edible portion for the following items: fresh maize (choclo), maize flour, polished rice, spaghetti, quinoa, common beans, dried chickpeas, dried butter beans, dried broad beans, dried green peas, potatoes, sweet potatoes, yucas, dressed carcass beef, raw dressed carcass pork, dressed carcass lamb, dressed carcass chicken, anchovies, dried meat, whole egg, milk, semi-hard cheese, lard, white sugar, brown sugar, salt, tea, cocoa, vinegar, pumpkins, onions, carrots, lettuce and tomatoes. All of those foodstuffs were employed for the estimation of nutrients intake for historical diets, and some of those foodstuffs were employed for the linear programming model.
I take into account that a portion was discarded. Meats, for example, were purchased with bones, but bones were discarded. For maize, maize flour, potatoes, sweet potatoes, yucas, chickpeas, butter beans, broad beans, green peas, pumpkins, brown sugar and vinegar, information on nutrients and edible portion comes from Ministerio de Salud (2009) and Instituto de Nutrición de Centro América y Panamá (2017). For rice, spaghetti, beef, mutton, pork, chicken, eggs, milk, cheese, lard, white sugar, salt, tea, cocoa, onions, carrots, lettuce and tomatoes, nutrients come McCance and Widdowson (1946) and Paul and Southgate (1978). For quinoa and anchovies, nutrient information comes from Ministerio de Salud (2009; 2014) and USDA. For dried meat, information comes from Latham (2002) and USDA. For common beans, information comes from FAO (2017). Cooking led to the loss of nutrients. Indian dietary requirements, however, already take into account possible losses of nutrients during cooking (Allen, 2017; Rao, 2009).
Denote j as the food purchased in the market αk,j as the consumption of nutrient k in a kilogram of food j. Then αk,j = ejβjk, where ej is the edible (non-discarded) portion of the food j, and βjk is the quantity of nutrient k in a kilogram of food j.
Price data
Most data on prices comes from Gootenberg (1990). I complemented this source with Mancera (1992), Pardo (1870), Fuentes (1858) and Salinas (2013). Gootenberg collected information on prices from primary sources. For bread, information is missing for most years. I then calculated the ratio price of bread/price of wheat. To fill the blanks, I relied on interpolation. Using wheat prices and the estimates of the ratio price of bread/price of wheat, I estimated the price of bread. For noodle prices, I relied on a similar methodology as for bread in order to fill the blanks. Maize prices are missing for most of the period. I filled the blanks by using the ratio price of maize/price of maize flour. The ratio price of maize/price of maize flour was interpolated to fill the blanks. For rice, quinoa, beans, chickpeas, lima beans, potatoes, beef, mutton, poultry, lard and sugar, I also relied on interpolation to fill the blanks.
Information on the rent of rooms in callejones comes from Armas (2007) and Reyes (2004). To fill the blanks, I rely on interpolation and on the evolution of land prices from Zegarra (2020b).
Wage data
Data on wages refer to low-skilled workers, in particular laborers, doormen, mailmen and servants. All workers are government workers. Laborers worked in public works. Doormen, mailmen and servants worked for the public administration.
For laborers, I collected daily payments or jornales from primary sources. For doormen, mailmen and servants, I collected yearly payments from secondary sources. Jornales of laborers were collected from the Historical Archives of the Municipality of Lima and the National Archives of Peru. The Municipality of Lima invested on public works. Budgets and other documents include information on the total payments of salaries, the number of workers and the number of days. Information was not available for all years. I filled the blanks by using interpolation.
For doormen, mailmen and servants, information comes from annual budgets and other legal documents. Annual or bi-annual budgets for the national government report the annual wage of most workers, from the President of the Republic to doormen, mailmen and servants, the least paid among public workers. Budgets of the national government were obtained from the encyclopedic Anales de la Hacienda Pública. In particular, budgets were obtained from Anales de la Hacienda Pública, vol.i for 1821-1826, vol.ii for 1829, vol.iii for 1839-1840, vol.iv for 1846-1849, vol.v for 1850-1855, vol. vi for 1861-1862, vol.vii for 1863-1868, vol.viii for 1869-1872, ix for 1873-1874 and vol.x for 1875-1876. I complemented the information with laws and decrees that also included information on wages. These laws and decrees come from Oviedo (1872) for 1835-1838, 1840 and 1845 (see table 4).
Table 4 Content of Nutrients per Kilogram
Calories (kcal) Proteins (g) Fat (g) Iron (mg) Thiam. (mg) Niacin (mg NE) Vit. B12 (µg) Folate (µg) Vit. C (mg)
Bread 2 601.6 69.5 17.2 23.8 3.1 41.6 0 222.7 0
Maize 460 13.2 3.2 3.2 0.6 5.8 0 184 19.2
Maize flour 3 610 69.3 38.6 23.8 2.5 19 0 250 0
Rice 3 610 62 10 4.5 0.8 15 0 290 0
Noodles 3 780 136 10 12 1.4 20 0 130 0
Quinoa 3 430 136 58 75 4.8 14 0 1 840 5
Beans 3 052.6 209.2 15.1 62.9 2 72.7 0 4 100 26.6
Chickpeas 3 620 192 61 83 3.8 28 0 5 570 54
Butter beans 3 310 204 12 67 2.8 32 0 3 940 75
Broad beans 3 400 238 15 130 3.9 40 0 4 230 86
Green peas 3 510 217 32 26 2.5 34.3 0 2 740 35
Potatoes 853.6 18.5 0.9 4.4 0.8 14.7 0 149.6 123.2
Sweet potatoes 738.6 17.7 1.8 3.9 0.7 4.9 0 96.8 197.6
Yucas 1 263.6 6.2 1.6 3.9 0.3 5.9 0 210.6 239.5
Beef 2 340.6 131.1 201.7 15.8 0.4 31.5 8.3 83 0
Mutton 2 797.2 122.6 256.2 11.8 0.8 33.6 16.8 33.6 0
Pork 2 501.2 100.6 233.1 6.7 4.3 30.3 7.4 22.2 0
Chicken 532.4 90.2 18.9 3.1 0.4 34.3 4.4 52.8 0
Fish 1 560 191 82 30.4 0.1 0 6.2 90 87
Dried meat 2 250 253 120 41 2 32 15.9 20 0
Eggs 1 308.3 109.5 97 17.8 0.8 0.6 25.8 222.5 0
Milk 660 33 37 0.8 0.4 0.8 3 50 15
Cheese 3 040 244 229 2.1 0.4 0.6 14 200 0
Lard 9 210 0 890 1 0 0 0 0 0
White sugar 3 940 0 0 0.4 0 0 0 0 0
Brown sugar 3 240 0 0 32 0 0.8 0 10 0
Salt 0 0 0 3 0 0 0 0 0
Tea 1 080 196 20 152 1.4 75 0 0 0
Cocoa 3 120 185 217 105 1.6 17 0 380 0
Vinegar 210 0 0 5 0 0 0 0 0
Pumpkins 148.4 4.8 0.5 4.8 0.2 0 0 84.8 2.7
Onions 223.1 8.7 0 2.9 0.3 1.9 0 155.2 97
Carrots 220.8 6.7 0 5.4 0.6 5.8 0 144 57.6
Lettuce 77 7.7 2.8 5.1 0.5 2.1 0 238 105
Tomatoes 140 9 0 4.3 0.6 7 0 280 200
Notes: The table reports the content of nutrients per kilogram.
Sources: Our calculations based on McCance and Widdowson (1946), Paul and Southgate (1978), Allen (2001), Ministerio de Salud (2009), Instituto de Nutrición de Centro América y Panamá (2017) and FAO (2017).
1 Some of the studies on living standards in Latin America are Challú y Gómez-Galvarriato (2015), Gelman and Santilli (2018), Arroyo-Abad (2014), Zegarra (2020a).
2 For estimates of welfare ratios for Argentina, see Gelman and Santilli (2018).
3 When analyzing short-term differences in welfare ratios, one must take the results with caution. Welfare ratios may be more helpful when analyzing long-term or large differences in living standards across cities or countries. Other two methods can be used to analyze living standards. One could determine whether the actual intake of nutrients allow people to cover their basic nutrition needs, using information on actual diets. Alternatively, one could study biological measures of living standards. Height, for example, could be used to determine living standards. As López-Alonso (2016) indicates, there are several reasons to study biology measures of living standards. One of them is the lack of national statistics of other indicators of living standards. In addition, biological measures are useful to determine the inequalities of living standards and their evolution in the long run.
4 Families are not cost minimizers in the linear programming sense.
5 Travelers’ accounts also provide information on consumption habits. According to traveler Johann von Tschudi (1842), in Lima sancochado was the typical dish for breakfast and puchero was common for dinner. Sancochado was prepared with mutton, yucas and potatoes, whereas puchero was prepared with beef, pork, ham, sausage, poultry, cabbage, yucas, sweet potatoes, potatoes, rice, peas, maize and bananas. Outside the city, in Chorrillos, "they [Indians] subsist on fish and maize, and the sugar cane, of which there are some plantations in the neighborhood" (Mathison, 1825, p. 279).
7 Artisans were usually not rich, but probably had higher living standards than coolies.
8 I do not have information on weight of Limenians. I rely on information about height. The height of an average male adult in Peru was around 1.60-1.65 m (Twrdek and Manzel, 2010). For a height of 1.63 m, a weight of 55 kg would imply a bmi of 20.7, reflecting a normal weight.
9 For pre-1900 Europe, Allen (2009) assumed that an adult man would need less than 2 000 kcal/day of calories. Humphries (2013), however, challenged such assumption.
10 See the appendix for a further discussion of the sources and methodology to obtain the chemical composition of foodstuffs.
11 In fact, López-Losa and Piquero-Zarauz (2021) argue that much of the cross-country differences in welfare ratios could be explained by the selection of the food basket.
12 I do not include fish due to lack of price information. Including fish could potentially increase welfare ratios.
13 Alternatively, one could calculate the geometric mean of relative prices to take into account the effect of relative prices on consumption (Allen, 2001). When using the geometric mean, the series of the cost of food is practically the same as the original cost of the fixed basket.
14 On the other hand, the three historical baskets only satisfy some of the nutrients´ requirements imposed in our balanced-nutrition linear programming model. The estimates of Arroyo-Abad (2014) and Zegarra (2020a) rely on the traditional assumption that an adult should consume at least 1 900 kcal/day. The bn linear programming model in this study imposes higher restrictions on calories. In addition, this study imposes restrictions on fat, iron and vitamins.
15 Allen (2009) assumes that a male adult requires 2.0 M BTU in pre-1900 Europe.
16 Allen (2009) makes similar assumptions for a male adult.
17 For other cities in the region, the family size could be different. Not taking into account those differences would introduce biases in the estimation of welfare ratios (Moraes and Thul, 2018).
18 I previously used the same data set from the 1820s (Zegarra, 2020a).
19 Some studies usually only focus on salaries of masons, which may not be representative of unskilled workers (Moraes y Thul, 2018).
20 Several studies rely on similar assumptions. However, I must acknowledge the possible biases of these assumptions. First, women could also work for a salary (Calderón-Fernández, García-Montero and Llopis-Agelán, 2017; Humphries y Weisdorf, 2015). Second, workers could receive in-kind compensation in addition to their salaries (Djenderedjian y Martirén, 2020).
21 Notice that Arroyo-Abad (2014) and Zegarra (2020a) did not make the assumptions on family size. Those studies rely on Allen´s assumption that family costs are equal to three times the costs for a male adult.
22 However, there is no consensus on the evolution of living standards in Mexico in the 18th and 19th centuries. At times, the evidence for height contradicts the findings for real wages. Real wages declined in 1760-1810 (Challú and Gómez-Galvarriato, 2015). However, according to Dobado-González and Garcia-Hiernaux (2017), there is no "evidence regarding the notion of ´Great Decline´ in Mexico heights between 1730 and 1840" (p. 161). In addition, height declined in the second half of the 19th century (López-Alonso, 2012) in spite of the increasing real wages.
24 Recently, however, some studies have questioned the finding that London had higher living standards than other European cities (Humphries, 2013).
Received: June 23, 2020; Accepted: February 17, 2021
Este es un artículo publicado en acceso abierto bajo una licencia Creative Commons
| 2022-05-21T12:35:38 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.426837682723999, "perplexity": 4056.7909683618163}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-21/segments/1652662539101.40/warc/CC-MAIN-20220521112022-20220521142022-00097.warc.gz"}
|
http://dergipark.gov.tr/konuralpjournalmath/issue/31478/402932
|
| | | |
## A Novel Generalized Difference Spaces Constructed by the Modulus Function
#### Murat Candan [1] , İhsan Solak [2]
##### 58 97
A major role of this document is to present a generalized difference spaces denoted by $w(\Delta ^{r},\hat{A},p,f,q,s),$ $w_{0}(\Delta ^{r},\hat{A},p,f,q,s),$ and $w_{\infty}(\Delta ^{r},\hat{A},p,f,q,s)$, of which arguments are defined as follows, and also to investigate some algebraic and topological characteristics of the spaces. Here; $\hat{A}$ is an infinite matrix, $p=(p_{k})$ is a bounded sequence of strictly positive real numbers, $f$ is any modulus function, $q$ is a semi norm, and $s$ is any non-negative real number. Besides these, the relationship between the spaces obtained by various values of those arguments is going to be considered. Finally, the newly obtained results are going to be compared with those of other studies.
Difference sequence spaces, modulus function
• [1] S. Banach, Theorie des Operations Lin´eaires, Monografie Matematyczne, vol. 1, Warszawa, 1932.
• [2] F. Başar, Summability Theory and Its Applications, ˙Istanbul 2011.
• [3] E. Bulut, Ö . Çakar, The sequence space l (p; s) and related matrix tranformations, Commun. Fac. Sci. Univ. Ankara, Ser. A1, Math. Stat. 28, (1979), 33–44.
• [4] M. Candan, Some new sequence spaces defined by a modulus function and infinite matrix in a seminormed space, J. Math. Anal., 3(2) (2012) ; 1–9.
• [5] R. Çolak, Ç . CÇakar. Banach limits and related matrix transformations, Stud. Sci. Math. Hung. 24 (1989) ; 429–436.
• [6] G. Das, Banach and other limits, J. London Math. Soc. 7 (1973), 501–507.
• [7] A. Esi, Moduülüs fonksiyonu yardımıyla tanımlanmıs¸ bazı yeni dizi uzayları ve istatistiksel yakınsaklık, Doktora tezi, Fırat U¨ niversitesi Elazığ, 1995.
• [8] M. Et, R. C¸ olak, On generalized difference sequence spaces, Soochow J. Math. 21 (4) (1995) 377–386.
• [9] B. Kuttner, Note on strong summability, J. London Math. Soc. 21 (1946), 118–122.
• [10] J. Connor, On strong Matrix summability with respect to a modulus and statistical convergence, Canad. Mat. Bull. 32 (2) (1989), 194–198.
• [11] G.G. Lorentz, A contribution to the theory of divergent sequences, Acta Math. 80 (1948) 167–190.
• [12] I. J. Maddox, Spaces of strongly summable sequences, Quart. J. Math. 18(1967), 345–355.
• [13] I. J. Maddox, Sequence spaces defined by a modulus, Math. Proc. Camb. Philos Soc. 100(1986), 161–166.
• [14] I. J. Maddox, A New Type of Convergence, Math. Proc. Cambridge Philos. Soc 83 (1978), 61–64.
• [15] I. J. Maddox, On Strong Almost Convergence, Math. Proc. Cambridge Philos. Soc. 85 (1979), 345–350.
• [16] H. Nakano, Concave modulares, J. Math. Loc. Japan, Vol.5, (1953), 29–49.
• [17] S. Nanda, Strongly Almost Convergent Sequences, Bull Calcutta Math. Soc. 76 (1984) 236–40.
• [18] S. Pehlivan, A sequence space defined by a modulus, Erciyes Univ. Journal of Science, 5(1-2)(1989), 875–880.
• [19] W. H. Ruckle, FK spaces in which the sequence of coordinate vectors is bounded, Canad. J. Math. 25(1973), 973–978.
• [20] E. Savas¸, On Strong Almost A-Summability with respect to a Modulus and Statistical Convergence, Indian J. Pure Appl. Math. 23 (1992), 217–22.
• [21] E. Savas¸, On Some Generalized Sequence Spaces Defined by a Modulus, Indian J. Pure Appl. Math., 30 (5) (1999) 459–464.
• [22] S.Simons, The sequence spaces l (pv) and m(pv) ; Proc. London Math. Soc. (3)15:
• [23] B. Altay, F. Bas¸ar, The matrix domain and the fine spectrum of the difference operator D on the sequence space p, (0 < p < 1), Commun. Math. Anal. 2(2)(2007), 1–11.
• [24] H. Kızmaz, On certain sequence spaces. Canad. Math. Bull. 24(2)(1981), 169–176.
• [25] F. Bas¸ar, B. Altay, On the space of sequences of p-bounded variation and related matrix mappings, Ukrainian Math. J. 55(1)(2003), 136–147.
• [26] R. C¸ olak, M. Et, E. Malkowsky, Some Topics of Sequence Spaces, in : Lecture Notes in Mathematics, Fırat Univ. Press, 2004, pp. 1-63. ISBN:975–394–0386–6.
• [27] Z.U. Ahmad, Mursaleen, K¨othe-Toeplitz duals of some new sequence spaces and their matrix maps, Publ. Inst. Math. (Beograd) 42(1987), 57–61.
• [28] C¸ . Asma, R. C¸ olak, On the K¨othe-Toeplitz duals of some generalized sets of difference sequences, Demonstratio Math. 33(2000), 797–803.
• [29] M.A. Sarıg¨ol, On difference sequence spaces, J. Karadeniz Tech. Univ. Fac. Arts Sci. Ser. Math.-Phys. 10(1987), 63–71.
• [30] E. Malkowsky, Absolute and ordinary K¨othe-Toeplitz duals of some sets of sequences and matrix transformations, Pulb. Inst. Math (Beograd), (NS), 46(60)(1989), 97–103.
• [31] B. Choudhary, S.K. Mishra, A note on certain sequence spaces, J. Anal. 1(1993), 139–148.
• [32] S.K. Mishra, Matrix maps involving certain sequence spaces, Indian J. Pure Appl. Math. 24(2)(1993), 125–132.
• [33] M. Mursaleen, A.K. Gaur, A.H. Saifi, Some new sequence spaces and their duals and matrix transformations, Bull. Calcutta Math. Soc. 88(3)(1996), 207–212.
• [34] C. Gnanaseelan, P.D. Srivastava, The a;b and g duals of some generalised difference sequence spaces, Indian J. Math. 38(2)(1996), 111–120.
• [35] E. Malkowsky, A note on the K¨othe-Toeplitz duals of generalized sets of bounded and convergent difference sequences, J. Anal. 4(1996), 81–91.
• [36] A.K. Gaur, M. Mursaleen, Difference sequence spaces, Int. J. Math. Sci. 21(4)(1998), 701–706.
• [37] E. Malkowsky, M. Mursaleen, Qamaruddin, Generalized sets of difference sequences, their duals and matrix transformations, in : equence Spaces and Applications, Narosa, New Delhi, 1999, pp. 68–83.
• [38] E. Malkowsky, M. Mursaleen, Some matrix transformations between the difference sequence spaces Dc0(p), Dc(p) and D¥(p), Filomat 15(2001), 353–363.
• [39] T. Bilgin, The sequence spaces (p; f ;q; s) on seminormed spaces, Bul. of Calcutta Math. Soc. 86(4)(1994), 295–304.
• [40] A S¸ ahiner, Some new paranormed space defined by modulus function, Indian J. Pure Appl. Math. 33(12)(2002), 1877–1888.
Birincil Dil en Mühendislik ve Temel Bilimler Articles Yazar: Murat Candan (Sorumlu Yazar)Ülke: Turkey Yazar: İhsan SolakÜlke: Turkey
Bibtex @araştırma makalesi { konuralpjournalmath402932, journal = {Konuralp Journal of Mathematics}, issn = {}, eissn = {2147-625X}, address = {Mehmet Zeki SARIKAYA}, year = {}, volume = {6}, pages = {17 - 25}, doi = {}, title = {A Novel Generalized Difference Spaces Constructed by the Modulus Function}, key = {cite}, author = {Solak, İhsan and Candan, Murat} }` APA Candan, M , Solak, İ . (). A Novel Generalized Difference Spaces Constructed by the Modulus Function. Konuralp Journal of Mathematics, 6 (1), 17-25. Retrieved from http://dergipark.gov.tr/konuralpjournalmath/issue/31478/402932 MLA Candan, M , Solak, İ . "A Novel Generalized Difference Spaces Constructed by the Modulus Function". Konuralp Journal of Mathematics 6 (): 17-25 Chicago Candan, M , Solak, İ . "A Novel Generalized Difference Spaces Constructed by the Modulus Function". Konuralp Journal of Mathematics 6 (): 17-25 RIS TY - JOUR T1 - A Novel Generalized Difference Spaces Constructed by the Modulus Function AU - Murat Candan , İhsan Solak Y1 - 2018 PY - 2018 N1 - DO - T2 - Konuralp Journal of Mathematics JF - Journal JO - JOR SP - 17 EP - 25 VL - 6 IS - 1 SN - -2147-625X M3 - UR - Y2 - 2018 ER - EndNote %0 Konuralp Journal of Mathematics A Novel Generalized Difference Spaces Constructed by the Modulus Function %A Murat Candan , İhsan Solak %T A Novel Generalized Difference Spaces Constructed by the Modulus Function %D 2018 %J Konuralp Journal of Mathematics %P -2147-625X %V 6 %N 1 %R %U
| 2018-07-23T00:27:25 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5640536546707153, "perplexity": 10215.333544420084}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676594675.66/warc/CC-MAIN-20180722233159-20180723013159-00141.warc.gz"}
|
https://par.nsf.gov/biblio/10026353-sampling-random-spanning-trees-faster-than-matrix-multiplication
|
Sampling Random Spanning Trees Faster than Matrix Multiplication
We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in \Otil(n^{5/3 }m^{1/3}) time\footnote{The \Otil(\cdot) notation hides \poly(\log n) factors}. The tree is sampled from a distribution where the probability of each tree is proportional to the product of its edge weights. This improves upon the previous best algorithm due to Colbourn et al. that runs in matrix multiplication time, O(n^\omega). For the special case of unweighted graphs, this improves upon the best previously known running time of \tilde{O}(\min\{n^{\omega},m\sqrt{n},m^{4/3}\}) for m >> n^{7/4} (Colbourn et al. '96, Kelner-Madry '09, Madry et al. '15). The effective resistance metric is essential to our algorithm, as in the work of Madry et al., but we eschew determinant-based and random walk-based techniques used by previous algorithms. Instead, our algorithm is based on Gaussian elimination, and the fact that effective resistance is preserved in the graph resulting from eliminating a subset of vertices (called a Schur complement). As part of our algorithm, we show how to compute \eps-approximate effective resistances for a set SS of vertex pairs via approximate Schur complements in \Otil(m+(n + |S|)\eps^{-2}) time, without using the Johnson-Lindenstrauss lemma which requires \Otil( \min\{(m + |S|)\eps^{-2}, more »
Authors:
; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10026353
Journal Name:
Proceedings of the annual ACM Symposium on Theory of Computing
ISSN:
0737-8017
National Science Foundation
##### More Like this
1. This paper focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut, and many graph verification problems. We consider the synchronous CONGEST distributed computing model and assume that each node has initial knowledge of itself and the identifiers of its neighbors - the so-called KT_1 model - a well-studied model that also naturally arises in many applications. Recently, it has been established that one can obtain (almost) singularly optimal algorithms, i.e., algorithms that have simultaneously optimal time and message complexity (up to polylogarithmic factors), for many fundamental problems in the standard KT_0 model (where nodes have only local knowledge of themselves and not their neighbors). The situation is less clear in the KT_1 model. In this paper, we present several new distributed algorithms in the KT_1 model that trade off between time and message complexity. Our distributed algorithms are based on a uniform and general approach which involves constructing a sparsified spanning subgraph of the original graph - called a danner - that trades off the number of edges with the diameter of the sparsifier. In particular, a key ingredient of our approach is amore »
2. We present an $\tilde O(m+n^{1.5})$-time randomized algorithm for maximum cardinality bipartite matching and related problems (e.g. transshipment, negative-weight shortest paths, and optimal transport) on $m$-edge, $n$-node graphs. For maximum cardinality bipartite matching on moderately dense graphs, i.e. $m = \Omega(n^{1.5})$, our algorithm runs in time nearly linear in the input size and constitutes the first improvement over the classic $O(m\sqrt{n})$-time [Dinic 1970; Hopcroft-Karp 1971; Karzanov 1973] and $\tilde O(n^\omega)$-time algorithms [Ibarra-Moran 1981] (where currently $\omega\approx 2.373$). On sparser graphs, i.e. when $m = n^{9/8 + \delta}$ for any constant $\delta>0$, our result improves upon the recent advances of [Madry 2013] and [Liu-Sidford 2020b, 2020a] which achieve an $\tilde O(m^{4/3+o(1)})$ runtime. We obtain these results by combining and advancing recent lines of research in interior point methods (IPMs) and dynamic graph algorithms. First, we simplify and improve the IPM of [v.d.Brand-Lee-Sidford-Song 2020], providing a general primal-dual IPM framework and new sampling-based techniques for handling infeasibility induced by approximate linear system solvers. Second, we provide a simple sublinear-time algorithm for detecting and sampling high-energy edges in electric flows on expanders and show that when combined with recent advances in dynamic expander decompositions, this yields efficient data structures for maintaining the iterates ofmore »
3. We present a general framework of designing efficient dynamic approximate algorithms for optimization on undirected graphs. In particular, we develop a technique that, given any problem that admits a certain notion of vertex sparsifiers, gives data structures that maintain approximate solutions in sub-linear update and query time. We illustrate the applicability of our paradigm to the following problems. (1) A fully-dynamic algorithm that approximates all-pair maximum-flows/minimum-cuts up to a nearly logarithmic factor in $\tilde{O}(n^{2/3})$ amortized time against an oblivious adversary, and $\tilde{O}(m^{3/4})$ time against an adaptive adversary. (2) An incremental data structure that maintains $O(1)$-approximate shortest path in $n^{o(1)}$ time per operation, as well as fully dynamic approximate all-pair shortest path and transshipment in $\tilde{O}(n^{2/3+o(1)})$ amortized time per operation. (3) A fully-dynamic algorithm that approximates all-pair effective resistance up to an $(1+\eps)$ factor in $\tilde{O}(n^{2/3+o(1)} \epsilon^{-O(1)})$ amortized update time per operation. The key tool behind result (1) is the dynamic maintenance of an algorithmic construction due to Madry [FOCS' 10], which partitions a graph into a collection of simpler graph structures (known as j-trees) and approximately captures the cut-flow and metric structure of the graph. The $O(1)$-approximation guarantee of (2) is by adapting the distance oracles by [Thorup-Zwick JACM `05].more »
4. Abstract
In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include:
Certifying that a list ofnintegers has no 3-SUM solution can be done in Merlin–Arthur time$$\tilde{O}(n)$$$\stackrel{~}{O}\left(n\right)$. Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in$$\tilde{O}(n^{1.5})$$$\stackrel{~}{O}\left({n}^{1.5}\right)$time (that is, there is a proof system with proofs of length$$\tilde{O}(n^{1.5})$$$\stackrel{~}{O}\left({n}^{1.5}\right)$and a deterministic verifier running in$$\tilde{O}(n^{1.5})$$$\stackrel{~}{O}\left({n}^{1.5}\right)$time).
Counting the number ofk-cliques with total edge weight equal to zero in ann-node graph can be done in Merlin–Arthur time$${\tilde{O}}(n^{\lceil k/2\rceil })$$$\stackrel{~}{O}\left({n}^{⌈k/2⌉}\right)$(where$$k\ge 3$$$k\ge 3$). For oddk, this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in anm-edge graph can be done in Merlin–Arthur time$${\tilde{O}}(m)$$$\stackrel{~}{O}\left(m\right)$. Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only countk-cliques in unweighted graphs, and had worse running times for smallk.
Computing the All-Pairsmore »
Certifying that ann-variablek-CNF is unsatisfiable can be done in Merlin–Arthur time$$2^{n/2 - n/O(k)}$$${2}^{n/2-n/O\left(k\right)}$. We also observe an algebrization barrier for the previous$$2^{n/2}\cdot \textrm{poly}(n)$$${2}^{n/2}·\text{poly}\left(n\right)$-time Merlin–Arthur protocol of R. Williams [CCC’16] for$$\#$$$#$SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol fork-UNSAT running in$$2^{n/2}/n^{\omega (1)}$$${2}^{n/2}/{n}^{\omega \left(1\right)}$time. Therefore we have to exploit non-algebrizing properties to obtain our new protocol.
Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time$$2^{4n/5}\cdot \textrm{poly}(n)$$${2}^{4n/5}·\text{poly}\left(n\right)$. Previously, the only nontrivial result known along these lines was an Arthur Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in$$2^{2n/3}\cdot \textrm{poly}(n)$$${2}^{2n/3}·\text{poly}\left(n\right)$time.
Due to the centrality of these problems in fine-grained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution tonintegers can be done in Merlin–Arthur time$$2^{n/3}\cdot \textrm{poly}(n)$$${2}^{n/3}·\text{poly}\left(n\right)$, improving on the previous best protocol by Nederlof [IPL 2017] which took$$2^{0.49991n}\cdot \textrm{poly}(n)$$${2}^{0.49991n}·\text{poly}\left(n\right)$time.
5. We revisit the much-studied problem of space-efficiently estimating the number of triangles in a graph stream, and extensions of this problem to counting fixed-sized cliques and cycles, obtaining a number of new upper and lower bounds. For the important special case of counting triangles, we give a $4$-pass, $(1\pm\varepsilon)$-approximate, randomized algorithm that needs at most $\widetilde{O}(\varepsilon^{-2}\cdot m^{3/2}/T)$ space, where $m$ is the number of edges and $T$ is a promised lower bound on the number of triangles. This matches the space bound of a very recent algorithm (McGregor et al., PODS 2016), with an arguably simpler and more general technique. We give an improved multi-pass lower bound of $\Omega(\min\{m^{3/2}/T, m/\sqrt{T}\})$, applicable at essentially all densities $\Omega(n) \le m \le O(n^2)$. We also prove other multi-pass lower bounds in terms of various structural parameters of the input graph. Together, our results resolve a couple of open questions raised in recent work (Braverman et al., ICALP 2013). Our presentation emphasizes more general frameworks, for both upper and lower bounds. We give a sampling algorithm for counting arbitrary subgraphs and then improve it via combinatorial means in the special cases of counting odd cliques and odd cycles. Our results show that these problemsmore »
| 2023-03-20T21:58:38 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 18, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7905072569847107, "perplexity": 1024.3752360444712}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296943562.70/warc/CC-MAIN-20230320211022-20230321001022-00427.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Awalther.andrea
|
# zbMATH — the first resource for mathematics
## Walther, Andrea
Compute Distance To:
Author ID: walther.andrea Published as: Walther, A.; Walther, Andrea External Links: Wikidata · ORCID · GND
Documents Indexed: 67 Publications since 1999, including 3 Books Reviewing Activity: 37 Reviews
all top 5
#### Co-Authors
9 single-authored 23 Griewank, Andreas 6 Schlenkrich, Sebastian 5 Gauger, Nicolas R. 4 Herzog, Roland 4 Stumm, Philipp 3 Biegler, Lorenz T. 3 Fiege, Sabrina 3 Gebremedhin, Assefaw Hadish 3 Kulshreshtha, Kshitij 3 Kusch, Lisa 3 Pothen, Alex 2 Banović, Mladen 2 Kowarz, Andreas 2 Lehmann, Uwe 2 Moldenhauer, Carsten 2 Naumann, Uwe 2 Riehme, Jan 2 Utke, Jean 2 Vogel, Olaf 1 Albring, Tim 1 Auriemma, Salvatore 1 Best, André 1 Bischof, Christian H. 1 Bock, Hans Georg 1 Bosse, Torsten 1 Claes, Leander 1 Diehl, Moritz Mathias 1 Eppler, Karsten 1 Forth, Shaun A. 1 Guertler, Niels 1 Harbrecht, Helmut 1 Henning, Bernd 1 Holfeld, Denise 1 Hovland, Paul D. 1 Jurgelucks, Benjamin 1 Klein, Wolfram 1 Korzec, Maciek D. 1 Kostina, Ekaterina A. 1 Legrand, Herve 1 Letschert, Benjamin 1 Meyer, Marcus 1 Müller, Jens-Dominik 1 Mykhaskiv, Orest 1 Nguyen, Duc Dung 1 Noack, Antje 1 Özkaya, Emre 1 Phipps, Eric T. 1 Richert, Natalie 1 Schaefer, Bernd-Jochen 1 Schmidt, Stephan 1 Schütte, Maria 1 Stiller, Jörg 1 Tarafdar, Arijit 1 Vasilopoulos, Ilias 1 Vetukuri, Sree Rama Raju 1 Wagner, Mathias 1 Widhalm, Markus
all top 5
#### Serials
13 Optimization Methods & Software 5 PAMM. Proceedings in Applied Mathematics and Mechanics 4 Computational Optimization and Applications 3 Mathematical Programming. Series A. Series B 3 SIAM Journal on Optimization 3 SIAM Journal on Scientific Computing 2 ACM Transactions on Mathematical Software 2 Computing 2 Applied Numerical Mathematics 2 Optimization and Engineering 1 Acta Informatica 1 Computer Physics Communications 1 Mathematics of Computation 1 Journal of Optimization Theory and Applications 1 Optimal Control Applications & Methods 1 Revista Investigación Operacional 1 INFORMS Journal on Computing 1 Vietnam Journal of Mathematics 1 ZAMM. Zeitschrift für Angewandte Mathematik und Mechanik 1 Journal of Mathematical Study 1 Discussiones Mathematicae. Differential Inclusions, Control and Optimization 1 Lecture Notes in Computational Science and Engineering
all top 5
#### Fields
43 Numerical analysis (65-XX) 28 Operations research, mathematical programming (90-XX) 23 Calculus of variations and optimal control; optimization (49-XX) 21 Computer science (68-XX) 4 Fluid mechanics (76-XX) 2 General and overarching topics; collections (00-XX) 2 Combinatorics (05-XX) 2 Partial differential equations (35-XX) 2 Mechanics of particles and systems (70-XX) 2 Mechanics of deformable solids (74-XX) 2 Optics, electromagnetic theory (78-XX) 2 Systems theory; control (93-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Real functions (26-XX) 1 Measure and integration (28-XX) 1 Integral equations (45-XX) 1 Classical thermodynamics, heat transfer (80-XX) 1 Quantum theory (81-XX)
#### Citations contained in zbMATH
41 Publications have been cited 496 times in 363 Documents Cited by Year
Evaluating derivatives. Principles and techniques of algorithmic differentiation. 2nd ed. Zbl 1159.65026
Griewank, Andreas; Walther, Andrea
2008
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation. Zbl 1137.65330
Griewank, Andreas; Walther, Andrea
2000
Efficient computation of sparse hessians using coloring and automatic differentiation. Zbl 1243.65071
Gebremedhin, Assefaw H.; Tarafdar, Arijit; Pothen, Alex; Walther, Andrea
2009
Evaluating higher derivative tensors by forward propagation of univariate Taylor series. Zbl 0952.65028
Griewank, Andreas; Utke, Jean; Walther, Andrea
2000
Automatic differentiation of explicit Runge-Kutta methods for optimal control. Zbl 1278.49037
Walther, Andrea
2007
On constrained optimization by adjoint based quasi-Newton methods. Zbl 1065.90077
Griewank, Andreas; Walther, Andrea
2002
First- and second-order optimality conditions for piecewise smooth objective functions. Zbl 1385.90026
Griewank, A.; Walther, A.
2016
Adjoint concepts for the optimal control of Burgers equation. Zbl 1278.49028
Noack, Antje; Walther, Andrea
2007
On Lipschitz optimization based on gray-box piecewise linearization. Zbl 1350.49038
Griewank, Andreas; Walther, Andrea; Fiege, Sabrina; Bosse, Torsten
2016
Evaluating gradients in optimal control: continuous adjoints versus automatic differentiation. Zbl 1130.49308
Griesse, R.; Walther, A.
2004
New algorithms for optimal online checkpointing. Zbl 1214.65038
Stumm, Philipp; Walther, Andrea
2010
Multistage approaches for optimal offline checkpointing. Zbl 1194.65084
Stumm, Philipp; Walther, Andrea
2009
Parametric sensitivities for optimal control problems using automatic differentiation. Zbl 1073.93518
Griesse, Roland; Walther, Andrea
2003
An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization. Zbl 1197.49034
Diehl, Moritz; Walther, Andrea; Bock, Hans Georg; Kostina, Ekaterina
2010
On the local convergence of adjoint Broyden methods. Zbl 1185.90207
Schlenkrich, Sebastian; Griewank, Andreas; Walther, Andrea
2010
Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians. Zbl 1196.90130
Griewank, Andreas; Walther, Andrea; Korzec, Maciek
2007
Recent advances in algorithmic differentiation. Selected papers based on the presentations at the 6th international conference on automatic differentiation (AD2012), Fort Collins, CO, USA, July 23–27, 2012. Zbl 1247.65002
Forth, Shaun (ed.); Hovland, Paul (ed.); Phipps, Eric (ed.); Utke, Jean (ed.); Walther, Andrea (ed.)
2012
On the numerical stability of algorithmic differentiation. Zbl 1238.65013
Griewank, Andreas; Kulshreshtha, Kshitij; Walther, Andrea
2012
Numerical experiments with an inexact Jacobian trust-region algorithm. Zbl 1219.90166
Walther, Andrea; Biegler, Lorenz T.
2011
On the efficient computation of high-order derivatives for implicitly defined functions. Zbl 1205.65131
Wagner, Mathias; Walther, Andrea; Schaefer, Bernd-Jochen
2010
Global convergence of quasi-Newton methods based on adjoint Broyden updates. Zbl 1163.65025
Schlenkrich, Sebastian; Walther, Andrea
2009
Computing sparse Hessians with automatic differentiation. Zbl 1291.65190
Walther, Andrea
2008
Application of AD-based quasi-Newton methods to stiff ODEs. Zbl 1270.65035
Schlenkrich, Sebastian; Walther, Andrea; Griewank, Andreas
2006
Walther, Andrea; Griewank, Andreas
2004
On an extension of one-shot methods to incorporate additional constraints. Zbl 1369.49041
Walther, Andrea; Gauger, Nicolas R.; Kusch, Lisa; Richert, Natalie
2016
A first-order convergence analysis of trust-region methods with inexact Jacobians. Zbl 1163.90028
Walther, Andrea
2008
Optimal $$r$$-order of an adjoint Broyden method without the assumption of linearly independent steps. Zbl 1211.90291
Griewank, Andreas; Schlenkrich, Sebastian; Walther, Andrea
2008
Walther, Andrea; Griewank, Andreas; Vogel, Olaf
2003
Characterizing and testing subdifferential regularity in piecewise smooth optimization. Zbl 1422.49016
Walther, Andrea; Griewank, Andreas
2019
Relaxing kink qualifications and proving convergence rates in piecewise smooth optimization. Zbl 1410.90252
Griewank, Andreas; Walther, Andrea
2019
Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization. Zbl 1401.90168
Fiege, Sabrina; Walther, Andrea; Kulshreshtha, Kshitij; Griewank, Andreas
2018
On the efficient computation of sparsity patterns for Hessians. Zbl 1251.65037
Walther, Andrea
2012
A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints. Zbl 1242.90244
Walther, Andrea; Vetukuri, Sree Rama Raju; Biegler, Lorenz T.
2012
Towards matrix-free AD-based preconditioning of KKT systems in PDE-constrained optimization. Zbl 1391.65153
Griesse, Roland; Walther, Andrea
2005
Algorithmic differentiation of the Open CASCADE technology CAD kernel and its coupling with an adjoint CFD solver. Zbl 1408.90321
Banović, Mladen; Mykhaskiv, Orest; Auriemma, Salvatore; Walther, Andrea; Legrand, Herve; Müller, Jens-Dominik
2018
On an inexact trust-region SQP-filter method for constrained nonlinear optimization. Zbl 1362.90344
Walther, Andrea; Biegler, Lorenz
2016
Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process. Zbl 1152.65416
Gebremedhin, Assefaw H.; Pothen, Alex; Walther, Andrea
2008
Automatic differentiation of an entire design chain for aerodynamic shape optimization. Zbl 1409.76126
Gauger, Nicolas R.; Walther, Andrea; Moldenhauer, Carsten; Widhalm, Markus
2007
Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules. Zbl 1102.68417
Walther, A.
2004
Introduction to automatic differentiation. Zbl 1201.68160
Griewank, Andreas; Walther, Andrea
2003
The implementation and testing of time-minimal and resource-optimal parallel reversal schedules. Zbl 1055.68526
Lehmann, U.; Walther, A.
2002
Characterizing and testing subdifferential regularity in piecewise smooth optimization. Zbl 1422.49016
Walther, Andrea; Griewank, Andreas
2019
Relaxing kink qualifications and proving convergence rates in piecewise smooth optimization. Zbl 1410.90252
Griewank, Andreas; Walther, Andrea
2019
Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization. Zbl 1401.90168
Fiege, Sabrina; Walther, Andrea; Kulshreshtha, Kshitij; Griewank, Andreas
2018
Algorithmic differentiation of the Open CASCADE technology CAD kernel and its coupling with an adjoint CFD solver. Zbl 1408.90321
Banović, Mladen; Mykhaskiv, Orest; Auriemma, Salvatore; Walther, Andrea; Legrand, Herve; Müller, Jens-Dominik
2018
First- and second-order optimality conditions for piecewise smooth objective functions. Zbl 1385.90026
Griewank, A.; Walther, A.
2016
On Lipschitz optimization based on gray-box piecewise linearization. Zbl 1350.49038
Griewank, Andreas; Walther, Andrea; Fiege, Sabrina; Bosse, Torsten
2016
On an extension of one-shot methods to incorporate additional constraints. Zbl 1369.49041
Walther, Andrea; Gauger, Nicolas R.; Kusch, Lisa; Richert, Natalie
2016
On an inexact trust-region SQP-filter method for constrained nonlinear optimization. Zbl 1362.90344
Walther, Andrea; Biegler, Lorenz
2016
Recent advances in algorithmic differentiation. Selected papers based on the presentations at the 6th international conference on automatic differentiation (AD2012), Fort Collins, CO, USA, July 23–27, 2012. Zbl 1247.65002
Forth, Shaun (ed.); Hovland, Paul (ed.); Phipps, Eric (ed.); Utke, Jean (ed.); Walther, Andrea (ed.)
2012
On the numerical stability of algorithmic differentiation. Zbl 1238.65013
Griewank, Andreas; Kulshreshtha, Kshitij; Walther, Andrea
2012
On the efficient computation of sparsity patterns for Hessians. Zbl 1251.65037
Walther, Andrea
2012
A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints. Zbl 1242.90244
Walther, Andrea; Vetukuri, Sree Rama Raju; Biegler, Lorenz T.
2012
Numerical experiments with an inexact Jacobian trust-region algorithm. Zbl 1219.90166
Walther, Andrea; Biegler, Lorenz T.
2011
New algorithms for optimal online checkpointing. Zbl 1214.65038
Stumm, Philipp; Walther, Andrea
2010
An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization. Zbl 1197.49034
Diehl, Moritz; Walther, Andrea; Bock, Hans Georg; Kostina, Ekaterina
2010
On the local convergence of adjoint Broyden methods. Zbl 1185.90207
Schlenkrich, Sebastian; Griewank, Andreas; Walther, Andrea
2010
On the efficient computation of high-order derivatives for implicitly defined functions. Zbl 1205.65131
Wagner, Mathias; Walther, Andrea; Schaefer, Bernd-Jochen
2010
Efficient computation of sparse hessians using coloring and automatic differentiation. Zbl 1243.65071
Gebremedhin, Assefaw H.; Tarafdar, Arijit; Pothen, Alex; Walther, Andrea
2009
Multistage approaches for optimal offline checkpointing. Zbl 1194.65084
Stumm, Philipp; Walther, Andrea
2009
Global convergence of quasi-Newton methods based on adjoint Broyden updates. Zbl 1163.65025
Schlenkrich, Sebastian; Walther, Andrea
2009
Evaluating derivatives. Principles and techniques of algorithmic differentiation. 2nd ed. Zbl 1159.65026
Griewank, Andreas; Walther, Andrea
2008
Computing sparse Hessians with automatic differentiation. Zbl 1291.65190
Walther, Andrea
2008
A first-order convergence analysis of trust-region methods with inexact Jacobians. Zbl 1163.90028
Walther, Andrea
2008
Optimal $$r$$-order of an adjoint Broyden method without the assumption of linearly independent steps. Zbl 1211.90291
Griewank, Andreas; Schlenkrich, Sebastian; Walther, Andrea
2008
Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process. Zbl 1152.65416
Gebremedhin, Assefaw H.; Pothen, Alex; Walther, Andrea
2008
Automatic differentiation of explicit Runge-Kutta methods for optimal control. Zbl 1278.49037
Walther, Andrea
2007
Adjoint concepts for the optimal control of Burgers equation. Zbl 1278.49028
Noack, Antje; Walther, Andrea
2007
Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians. Zbl 1196.90130
Griewank, Andreas; Walther, Andrea; Korzec, Maciek
2007
Automatic differentiation of an entire design chain for aerodynamic shape optimization. Zbl 1409.76126
Gauger, Nicolas R.; Walther, Andrea; Moldenhauer, Carsten; Widhalm, Markus
2007
Application of AD-based quasi-Newton methods to stiff ODEs. Zbl 1270.65035
Schlenkrich, Sebastian; Walther, Andrea; Griewank, Andreas
2006
Towards matrix-free AD-based preconditioning of KKT systems in PDE-constrained optimization. Zbl 1391.65153
Griesse, Roland; Walther, Andrea
2005
Evaluating gradients in optimal control: continuous adjoints versus automatic differentiation. Zbl 1130.49308
Griesse, R.; Walther, A.
2004
Walther, Andrea; Griewank, Andreas
2004
Bounding the number of processors and checkpoints needed in time-minimal parallel reversal schedules. Zbl 1102.68417
Walther, A.
2004
Parametric sensitivities for optimal control problems using automatic differentiation. Zbl 1073.93518
Griesse, Roland; Walther, Andrea
2003
Walther, Andrea; Griewank, Andreas; Vogel, Olaf
2003
Introduction to automatic differentiation. Zbl 1201.68160
Griewank, Andreas; Walther, Andrea
2003
On constrained optimization by adjoint based quasi-Newton methods. Zbl 1065.90077
Griewank, Andreas; Walther, Andrea
2002
The implementation and testing of time-minimal and resource-optimal parallel reversal schedules. Zbl 1055.68526
Lehmann, U.; Walther, A.
2002
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation. Zbl 1137.65330
Griewank, Andreas; Walther, Andrea
2000
Evaluating higher derivative tensors by forward propagation of univariate Taylor series. Zbl 0952.65028
Griewank, Andreas; Utke, Jean; Walther, Andrea
2000
all top 5
#### Cited by 700 Authors
25 Walther, Andrea 17 Griewank, Andreas 8 Charpentier, Isabelle 7 Barton, Paul I. 7 Diehl, Moritz Mathias 7 Khan, Kamil A. 6 Bücker, H. Martin 6 Sandu, Adrian 5 Gauger, Nicolas R. 5 Hossain, Shahadat 5 Joshi, Mark S. 5 Lamour, René 4 Alexe, Mihai 4 Behr, Marek A. 4 Bischof, Christian H. 4 Hoppe, Ronald H. W. 4 Lehmann, Lutz 4 Müller, Jens-Dominik 4 Naumann, Uwe 4 Navon, Ionel Michael 4 Quirynen, Rien 4 Schlenkrich, Sebastian 4 Streubel, Tom 4 Wild, Stefan M. 3 Antil, Harbir 3 Asaithambi, Asai 3 Aschemann, Harald 3 Barrio, Roberto 3 Biegler, Lorenz T. 3 Bock, Hans Georg 3 Bosse, Torsten 3 Braga, Mónica 3 Cochelin, Bruno 3 Dussault, Jean-Pierre 3 Fidkowski, Krzysztof J. 3 Fiege, Sabrina 3 Gerdts, Matthias 3 Götschel, Sebastian 3 Gower, Robert Mansel 3 Gros, Sebastien 3 Hascoet, Laurent 3 Heinkenschloss, Matthias 3 Herty, Michael Matthias 3 Houska, Boris 3 Hu, Heng 3 Karasözen, Bülent 3 Kchouk, Bilel 3 Koutsawa, Yao 3 Kulshreshtha, Kshitij 3 Lukšan, Ladislav 3 Lülfesmann, Michael 3 Mäkinen, Raino A. E. 3 Marenco, Javier L. 3 Menickelly, Matt 3 Ober-Blöbaum, Sina 3 Potier-Ferry, Michel 3 Probst, Markus 3 Radons, Manuel 3 Rauh, Andreas 3 Steihaug, Trond 3 Toivanen, Jukka I. 3 Wang, Qiqi 3 Watson, Harry A. J. 3 Weiser, Martin 3 Yilmaz, Fikriye Nuray 3 Zhu, Dan 2 Abad, Alberto J. 2 Albi, Giacomo 2 Alexanderian, Alen 2 Amaran, Satyajith 2 Auer, Ekaterina 2 Aupy, Guillaume 2 Awruch, Armando Miguel 2 Banović, Mladen 2 Borgonovo, Emanuele 2 Brossier, Romain 2 Bury, Scott J. 2 Chen, Xiao 2 Christakopoulos, Faidon 2 Daya, El Mostafa 2 Degroote, Joris 2 Espath, Luis F. R. 2 Estévez Schwarz, Diana 2 Fang, Fangxin 2 Farrell, Patrick E. 2 Fiedorowicz, Anna 2 Flaßkamp, Kathrin 2 Guillot, Louis 2 Hasenfelder, Richard 2 Haslinger, Jaroslav 2 Hegerhorst-Schultchen, L. C. 2 Herrmann, Julien 2 Herzog, Roland 2 Hojny, Christopher 2 Huchette, Joey 2 Jones, Dominic 2 Kasać, Josip 2 Kusch, Lisa 2 Lampoh, Komlanvi 2 Lang, Jens ...and 600 more Authors
all top 5
#### Cited in 122 Serials
54 Optimization Methods & Software 17 Journal of Computational and Applied Mathematics 15 Journal of Computational Physics 13 SIAM Journal on Scientific Computing 9 Computer Methods in Applied Mechanics and Engineering 9 Applied Mathematics and Computation 8 Numerical Algorithms 8 Mathematical Programming. Series A. Series B 8 SIAM Journal on Optimization 8 Computational Optimization and Applications 6 Computers and Fluids 6 Optimal Control Applications & Methods 6 Journal of Scientific Computing 5 Computers & Mathematics with Applications 5 Computer Physics Communications 5 Optimization and Engineering 4 Discrete Applied Mathematics 4 ACM Transactions on Mathematical Software 4 International Journal for Numerical Methods in Engineering 4 European Journal of Operational Research 4 Engineering Analysis with Boundary Elements 4 Computational Geosciences 4 SIAM/ASA Journal on Uncertainty Quantification 3 Computing 3 Journal of Optimization Theory and Applications 3 Mathematics and Computers in Simulation 3 Computational Mechanics 3 Applied Mathematical Modelling 3 Nonlinear Dynamics 3 Mathematics in Computer Science 3 Mathematical Programming Computation 2 International Journal of Control 2 International Journal for Numerical Methods in Fluids 2 Inverse Problems 2 Journal of Engineering Mathematics 2 Psychometrika 2 Mathematics of Computation 2 Kybernetika 2 Numerische Mathematik 2 Optimization 2 Journal of Economic Dynamics & Control 2 Journal of Global Optimization 2 Computational Statistics 2 SIAM Review 2 Discrete and Continuous Dynamical Systems 2 Journal of Combinatorial Optimization 2 International Journal of Theoretical and Applied Finance 2 Journal of Discrete Algorithms 2 Acta Numerica 2 SIAM Journal on Imaging Sciences 2 Science China. Mathematics 1 Acta Mechanica 1 Advances in Applied Probability 1 Discrete Mathematics 1 International Journal of General Systems 1 Journal of Fluid Mechanics 1 Journal of Mathematical Biology 1 Mathematical Methods in the Applied Sciences 1 Physics Reports 1 SIAM Journal on Numerical Analysis 1 Systems & Control Letters 1 Acta Applicandae Mathematicae 1 Physica D 1 Applied Numerical Mathematics 1 Graphs and Combinatorics 1 Journal of Symbolic Computation 1 Constructive Approximation 1 Algorithmica 1 Numerical Methods for Partial Differential Equations 1 Mathematical and Computer Modelling 1 Annals of Operations Research 1 Machine Learning 1 International Journal of High Speed Computing 1 International Journal of Computer Mathematics 1 Linear Algebra and its Applications 1 Computational Statistics and Data Analysis 1 Journal of Dynamics and Differential Equations 1 Journal of Mathematical Imaging and Vision 1 Journal of Nonlinear Science 1 Cybernetics and Systems Analysis 1 Advances in Applied Clifford Algebras 1 Monte Carlo Methods and Applications 1 Applied Mathematical Finance 1 INFORMS Journal on Computing 1 European Journal of Control 1 Computing and Visualization in Science 1 Mathematical Finance 1 Vietnam Journal of Mathematics 1 Soft Computing 1 Australian & New Zealand Journal of Statistics 1 Chaos 1 Mathematical and Computer Modelling of Dynamical Systems 1 International Journal of Applied Mathematics and Computer Science 1 RAIRO. Operations Research 1 Nonlinear Analysis. Modelling and Control 1 Quantitative Finance 1 Archives of Computational Methods in Engineering 1 Journal of Machine Learning Research (JMLR) 1 ASTIN Bulletin 1 Journal of Applied Mathematics and Computing ...and 22 more Serials
all top 5
#### Cited in 39 Fields
216 Numerical analysis (65-XX) 102 Operations research, mathematical programming (90-XX) 92 Calculus of variations and optimal control; optimization (49-XX) 44 Computer science (68-XX) 39 Fluid mechanics (76-XX) 38 Partial differential equations (35-XX) 22 Ordinary differential equations (34-XX) 21 Mechanics of deformable solids (74-XX) 18 Statistics (62-XX) 17 Systems theory; control (93-XX) 15 Combinatorics (05-XX) 15 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 12 Probability theory and stochastic processes (60-XX) 11 Real functions (26-XX) 10 Geophysics (86-XX) 9 Biology and other natural sciences (92-XX) 8 Mechanics of particles and systems (70-XX) 6 Approximations and expansions (41-XX) 5 Dynamical systems and ergodic theory (37-XX) 5 Information and communication theory, circuits (94-XX) 4 Integral equations (45-XX) 3 Linear and multilinear algebra; matrix theory (15-XX) 3 Operator theory (47-XX) 3 Optics, electromagnetic theory (78-XX) 3 Quantum theory (81-XX) 2 Number theory (11-XX) 2 Mathematics education (97-XX) 1 General and overarching topics; collections (00-XX) 1 Mathematical logic and foundations (03-XX) 1 Field theory and polynomials (12-XX) 1 Commutative algebra (13-XX) 1 Nonassociative rings and algebras (17-XX) 1 Special functions (33-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Integral transforms, operational calculus (44-XX) 1 Geometry (51-XX) 1 Manifolds and cell complexes (57-XX) 1 Global analysis, analysis on manifolds (58-XX) 1 Statistical mechanics, structure of matter (82-XX)
#### Wikidata Timeline
The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.
| 2021-04-21T14:07:12 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4316288232803345, "perplexity": 14591.872812020714}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-17/segments/1618039544239.84/warc/CC-MAIN-20210421130234-20210421160234-00162.warc.gz"}
|
https://www.usgs.gov/publications/spectral-distance-decay
|
Spectral distance decay
January 1, 2009
Remotely sensed data represents key information for character-izing and estimating biodiversity. Spectral distance among sites has proven to be a powerful approach for detecting species composition variability. Regression analysis of species similarity versus spectral distance may allow us to quantitatively estimate how beta-diversity in species changes with respect to spectral and ecological variability. In classical regression analysis, the residual sum of squares is minimized for the mean of the dependent variable distribution. However, many ecological datasets are characterized by a high number of zeroes that can add noise to the regression model. Quantile regression can be used to evaluate trend in the upper quantiles rather than a mean trend across the whole distribution of the dependent variable. In this paper, we used ordinary least square (OLS) and quantile regression to estimate the decay of species similarity versus spectral distance. The achieved decay rates were statistically nonzero (p < 0.05) considering both OLS and quantile regression. Nonetheless, OLS regression estimate of mean decay rate was only half the decay rate indicated by the upper quantiles. Moreover, the intercept value, representing the similarity reached when spectral distance approaches zero, was very low compared with the intercepts of upper quantiles, which detected high species similarity when habitats are more similar. In this paper we demonstrated the power of using quantile regressions applied to spectral distance decay in order to reveal species diversity patterns otherwise lost or underestimated by ordinary least square regression.
Citation Information
Publication Year 2009 Spectral distance decay 10.14358/pers.75.10.1225 D. Rocchinl, H. Nagendra, R. Ghate, B.S. Cade Article Journal Article Photogrammetric Engineering and Remote Sensing 70035824 USGS Publications Warehouse
| 2023-03-30T12:01:51 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8653522729873657, "perplexity": 1856.5043560674806}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949181.44/warc/CC-MAIN-20230330101355-20230330131355-00353.warc.gz"}
|
https://www.nist.gov/publications/multiplicative-complexity-6-variable-boolean-functions
|
# The Multiplicative Complexity of 6-variable Boolean Functions
Published: April 03, 2018
### Author(s)
Cagdas Calik, Meltem Sonmez Turan, Rene C. Peralta
### Abstract
The multiplicative complexity of a Boolean function is the minimum number of AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT). Finding the multiplicative complexity of a given function is computationally intractable, even for functions with small number of inputs. Turan et al. \cite{TuranSonmez2015} showed that $n$-variable Boolean functions can be implemented with at most $n-1$ AND gates for $n\leq 5$. A counting argument can be used to show that, for $n \geq 7$, there exists $n$-variable Boolean functions with multiplicative complexity of at least $n$. In this work, we propose a method to find the multiplicative complexity of Boolean functions by analyzing all circuits with a particular number of AND gates and utilizing the affine equivalence of functions. We use this method to study the multiplicative complexity of 6-variable Boolean functions, and calculate the multiplicative complexities of all 150\,357 affine equivalence classes. We show that any 6-variable Boolean function can be implemented using at most 6 AND gates. Additionally, we exhibit specific 6-variable Boolean functions which have multiplicative complexity 6.
Citation: Cryptography and Communication
Pub Type: Journals
| 2018-04-26T11:46:41 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8058411478996277, "perplexity": 466.25844289188274}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-17/segments/1524125948126.97/warc/CC-MAIN-20180426105552-20180426125552-00016.warc.gz"}
|
http://dergipark.gov.tr/ieja/issue/30344/325939
|
Yıl 2017, Cilt 22, Sayı 22, Sayfalar 133 - 146 2017-07-11
| | | |
## Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers
#### Ryan Gipson [1] , Hamid Kulosman [2]
##### 130 114
We investigate the atomicity and the AP property of the semigroup rings $F[X;M]$, where $F$ is a field, $X$ is a variable and $M$ is a submonoid of the additive monoid of nonnegative rational numbers. The main notion that we introduce for the purpose of the investigation is the notion of essential generators of $M$.
Semigroup ring, atomic domain
• P. J. Allen and L. Dale, Ideal theory in the semiring Z+, Publ. Math. Debrecen, 22 (1975), 219-224.
• D. D. Anderson, D. F. Anderson and M. Zafrullah, Factorization in integral domains, J. Pure Appl. Algebra, 69(1) (1990), 1-19.
• R. C. Daileda, A non-UFD integral domains in which irreducibles are prime, preprint. http://ramanujan.math.trinity.edu/rdaileda/teach/m4363s07/non_ufd.pdf.
• R. Gilmer, Commutative Semigroup Rings, Chicago Lectures in Mathematics, University of Chicago Press, Chicago, IL, 1984.
Konular Matematik Makaleler Yazar: Ryan Gipson Yazar: Hamid Kulosman
Bibtex @araştırma makalesi { ieja325939, journal = {International Electronic Journal of Algebra}, issn = {1306-6048}, eissn = {1306-6048}, address = {Prof. Dr. Abdullah HARMANCI}, year = {2017}, volume = {22}, pages = {133 - 146}, doi = {10.24330/ieja.325939}, title = {Atomic and AP semigroup rings \$F[X;M]\$, where \$M\$ is a submonoid of the additive monoid of nonnegative rational numbers}, key = {cite}, author = {Gipson, Ryan and Kulosman, Hamid} } APA Gipson, R , Kulosman, H . (2017). Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers. International Electronic Journal of Algebra, 22 (22), 133-146. DOI: 10.24330/ieja.325939 MLA Gipson, R , Kulosman, H . "Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers". International Electronic Journal of Algebra 22 (2017): 133-146 Chicago Gipson, R , Kulosman, H . "Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers". International Electronic Journal of Algebra 22 (2017): 133-146 RIS TY - JOUR T1 - Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers AU - Ryan Gipson , Hamid Kulosman Y1 - 2017 PY - 2017 N1 - doi: 10.24330/ieja.325939 DO - 10.24330/ieja.325939 T2 - International Electronic Journal of Algebra JF - Journal JO - JOR SP - 133 EP - 146 VL - 22 IS - 22 SN - 1306-6048-1306-6048 M3 - doi: 10.24330/ieja.325939 UR - http://dx.doi.org/10.24330/ieja.325939 Y2 - 2019 ER - EndNote %0 International Electronic Journal of Algebra Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers %A Ryan Gipson , Hamid Kulosman %T Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers %D 2017 %J International Electronic Journal of Algebra %P 1306-6048-1306-6048 %V 22 %N 22 %R doi: 10.24330/ieja.325939 %U 10.24330/ieja.325939 ISNAD Gipson, Ryan , Kulosman, Hamid . "Atomic and AP semigroup rings $F[X;M]$, where $M$ is a submonoid of the additive monoid of nonnegative rational numbers". International Electronic Journal of Algebra 22 / 22 (Temmuz 2017): 133-146. http://dx.doi.org/10.24330/ieja.325939
| 2019-02-20T03:25:24 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5793895721435547, "perplexity": 3552.0566942125597}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-09/segments/1550247494424.70/warc/CC-MAIN-20190220024254-20190220050254-00005.warc.gz"}
|
https://par.nsf.gov/biblio/10362455
|
Gravity versus Magnetic Fields in Forming Molecular Clouds
Abstract
Magnetic fields are dynamically important in the diffuse interstellar medium. Understanding how gravitationally bound, star-forming clouds form requires modeling of the fields in a self-consistent, supernova-driven, turbulent, magnetized, stratified disk. We employ the FLASH magnetohydrodynamics code to follow the formation and early evolution of clouds with final masses of 3–8 × 103Mwithin such a simulation. We use the code’s adaptive mesh refinement capabilities to concentrate numerical resolution in zoom-in regions covering single clouds, allowing us to investigate the detailed dynamics and field structure of individual self-gravitating clouds in a consistent background medium. Our goal is to test the hypothesis that dense clouds are dynamically evolving objects far from magnetohydrostatic equilibrium. We find that the cloud envelopes are magnetically supported with field lines parallel to density gradients and flow velocity, as indicated by the histogram of relative orientations and other statistical measures. In contrast, the dense cores of the clouds are gravitationally dominated, with gravitational energy exceeding internal, kinetic, or magnetic energy and accelerations due to gravity exceeding those due to magnetic or thermal pressure gradients. In these regions, field directions vary strongly, with a slight preference toward being perpendicular to density gradients, as shown by three-dimensional histograms of relative more »
Authors:
; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10362455
Journal Name:
The Astrophysical Journal
Volume:
925
Issue:
2
Page Range or eLocation-ID:
Article No. 196
ISSN:
0004-637X
Publisher:
DOI PREFIX: 10.3847
National Science Foundation
##### More Like this
1. ABSTRACT
The properties of young star clusters formed within a galaxy are thought to vary in different interstellar medium conditions, but the details of this mapping from galactic to cluster scales are poorly understood due to the large dynamic range involved in galaxy and star cluster formation. We introduce a new method for modelling cluster formation in galaxy simulations: mapping giant molecular clouds (GMCs) formed self-consistently in a FIRE-2 magnetohydrodynamic galaxy simulation on to a cluster population according to a GMC-scale cluster formation model calibrated to higher resolution simulations, obtaining detailed properties of the galaxy’s star clusters in mass, metallicity, space, and time. We find $\sim 10{{\ \rm per\ cent}}$ of all stars formed in the galaxy originate in gravitationally bound clusters overall, and this fraction increases in regions with elevated Σgas and ΣSFR, because such regions host denser GMCs with higher star formation efficiency. These quantities vary systematically over the history of the galaxy, driving variations in cluster formation. The mass function of bound clusters varies – no single Schechter-like or power-law distribution applies at all times. In the most extreme episodes, clusters as massive as 7 × 106 M⊙ form in massive, dense clouds with high star formation efficiency. Themore »
2. Abstract
Observations of12COJ= 1 – 0 and HCNJ= 1 – 0 emission from NGC 5194 (M51) made with the 50 m Large Millimeter Telescope and the SEQUOIA focal plane array are presented. Using the HCN-to-CO ratio, we examine the dense gas mass fraction over a range of environmental conditions within the galaxy. Within the disk, the dense gas mass fraction varies along the spiral arms but the average value over all spiral arms is comparable to the mean value of interarm regions. We suggest that the near-constant dense gas mass fraction throughout the disk arises from a population of density-stratified, self-gravitating molecular clouds and the required density threshold to detect each spectral line. The measured dense gas fraction significantly increases in the central bulge in response to the effective pressure,Pe, from the weight of the stellar and gas components. This pressure modifies the dynamical state of the molecular cloud population and, possibly, the HCN-emitting regions in the central bulge from self-gravitating to diffuse configurations in whichPeis greater than the gravitational energy density of individual clouds. Diffuse molecular clouds comprise a significant fraction of the molecular gas mass in the central bulge, which may account for the measured sublinear relationships betweenmore »
3. ABSTRACT
We present the stability analysis of two regions, OMC-3 and OMC-4, in the massive and long molecular cloud complex of Orion A. We obtained 214 $\mu$m HAWC + /SOFIA polarization data, and we make use of archival data for the column density and C18O (1–0) emission line. We find clear depolarization in both observed regions and that the polarization fraction is anticorrelated with the column density and the polarization-angle dispersion function. We find that the filamentary cloud and dense clumps in OMC-3 are magnetically supercritical and strongly subvirial. This region should be in the gravitational collapse phase and is consistent with many young stellar objects (YSOs) forming in the region. Our histogram of relative orientation (HRO) analysis shows that the magnetic field is dynamically sub-dominant in the dense gas structures of OMC-3. We present the first polarization map of OMC-4. We find that the observed region is generally magnetically subcritical except for an elongated dense core, which could be a result of projection effect of a filamentary structure aligned close to the line of sight. The relative large velocity dispersion and the unusual positive shape parameters at high column densities in the HROs analysis suggest that our viewing angle may be closemore »
4. Abstract
We perform particle-in-cell simulations to elucidate the microphysics of relativistic weakly magnetized shocks loaded with electron-positron pairs. Various external magnetizationsσ≲ 10−4and pair-loading factorsZ±≲ 10 are studied, whereZ±is the number of loaded electrons and positrons per ion. We find the following: (1) The shock becomes mediated by the ion Larmor gyration in the mean field whenσexceeds a critical valueσLthat decreases withZ±. AtσσLthe shock is mediated by particle scattering in the self-generated microturbulent fields, the strength and scale of which decrease withZ±, leading to lowerσL. (2) The energy fraction carried by the post-shock pairs is robustly in the range between 20% and 50% of the upstream ion energy. The mean energy per post-shock electron scales as$E¯e∝Z±+1−1$. (3) Pair loading suppresses nonthermal ion acceleration at magnetizations as low asσ≈ 5 × 10−6. The ions then become essentially thermal with mean energy$E¯i$, while electrons form a nonthermal tail, extending from$E∼Z±+1−1E¯i$to$E¯i$. Whenσ= 0, particle acceleration is enhanced by the formation of intense magnetic cavities that populate the precursor during the late stages of shock evolution. Here,more »
5. Abstract
Kiloparsec-scale triple active galactic nuclei (AGNs), potential precursors of gravitationally bound triple massive black holes (MBHs), are rarely seen objects and believed to play an important role in the evolution of MBHs and their host galaxies. In this work we present a multiband (3.0, 6.0, 10.0, and 15.0 GHz), high-resolution radio imaging of the triple AGN candidate, SDSS J0849+1114, using the Very Large Array. Two of the three nuclei (A and C) are detected at 3.0, 6.0, and 15 GHz for the first time, both exhibiting a steep spectrum over 3–15 GHz (with a spectral index −0.90 ± 0.05 and −1.03 ± 0.04) consistent with a synchrotron origin. Nucleus A, the strongest nucleus among the three, shows a double-sided jet, with the jet orientation changing by ∼20° between its inner 1″ and the outer 5.″5 (8.1 kpc) components, which may be explained as the MBH’s angular momentum having been altered by merger-enhanced accretion. Nucleus C also shows a two-sided jet, with the western jet inflating into a radio lobe with an extent of 1.″5 (2.2 kpc). The internal energy of the radio lobe is estimated to be 5.0 × 1055erg, for an equipartition magnetic field strength of ∼160μG. Nomore »
| 2023-02-07T07:57:06 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 4, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.5396331548690796, "perplexity": 2542.7981667375284}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500392.45/warc/CC-MAIN-20230207071302-20230207101302-00225.warc.gz"}
|
https://lammps.sandia.gov/doc/Section_modify.html
|
10. Modifying & extending LAMMPS
This section describes how to customize LAMMPS by modifying and extending its source code.
10.6 Fix styles which include integrators, temperature and pressure control, force constraints, boundary conditions, diagnostic output, etc
LAMMPS is designed in a modular fashion so as to be easy to modify and extend with new functionality. In fact, about 75% of its source code is files added in this fashion.
In this section, changes and additions users can make are listed along with minimal instructions. If you add a new feature to LAMMPS and think it will be of interest to general users, we encourage you to submit it to the developers for inclusion in the released version of LAMMPS. Information about how to do this is provided below.
The best way to add a new feature is to find a similar feature in LAMMPS and look at the corresponding source and header files to figure out what it does. You will need some knowledge of C++ to be able to understand the hi-level structure of LAMMPS and its class organization, but functions (class methods) that do actual computations are written in vanilla C-style code and operate on simple C-style data structures (vectors and arrays).
Most of the new features described in this section require you to write a new C++ derived class (except for exceptions described below, where you can make small edits to existing files). Creating a new class requires 2 files, a source code file (*.cpp) and a header file (*.h). The derived class must provide certain methods to work as a new option. Depending on how different your new feature is compared to existing features, you can either derive from the base class itself, or from a derived class that already exists. Enabling LAMMPS to invoke the new class is as simple as putting the two source files in the src dir and re-building LAMMPS.
The advantage of C++ and its object-orientation is that all the code and variables needed to define the new feature are in the 2 files you write, and thus shouldn’t make the rest of LAMMPS more complex or cause side-effect bugs.
Here is a concrete example. Suppose you write 2 files pair_foo.cpp and pair_foo.h that define a new class PairFoo that computes pairwise potentials described in the classic 1997 paper by Foo, et al. If you wish to invoke those potentials in a LAMMPS input script with a command like
pair_style foo 0.1 3.5
then your pair_foo.h file should be structured as follows:
#ifdef PAIR_CLASS
PairStyle(foo,PairFoo)
#else
...
(class definition for PairFoo)
...
#endif
where “foo” is the style keyword in the pair_style command, and PairFoo is the class name defined in your pair_foo.cpp and pair_foo.h files.
When you re-build LAMMPS, your new pairwise potential becomes part of the executable and can be invoked with a pair_style command like the example above. Arguments like 0.1 and 3.5 can be defined and processed by your new class.
As illustrated by this pairwise example, many kinds of options are referred to in the LAMMPS documentation as the “style” of a particular command.
The instructions below give the header file for the base class that these styles are derived from. Public variables in that file are ones used and set by the derived classes which are also used by the base class. Sometimes they are also used by the rest of LAMMPS. Virtual functions in the base class header file which are set = 0 are ones you must define in your new derived class to give it the functionality LAMMPS expects. Virtual functions that are not set to 0 are functions you can optionally define.
Additionally, new output options can be added directly to the thermo.cpp, dump_custom.cpp, and variable.cpp files as explained below.
• Think about whether what you want to do would be better as a pre- or post-processing step. Many computations are more easily and more quickly done that way.
• Don’t do anything within the timestepping of a run that isn’t parallel. E.g. don’t accumulate a bunch of data on a single processor and analyze it. You run the risk of seriously degrading the parallel efficiency.
• If your new feature reads arguments or writes output, make sure you follow the unit conventions discussed by the units command.
• If you add something you think is truly useful and doesn’t impact LAMMPS performance when it isn’t used, send an email to the developers. We might be interested in adding it to the LAMMPS distribution. See further details on this at the bottom of this page.
10.1. Atom styles
Classes that define an atom style are derived from the AtomVec class and managed by the Atom class. The atom style determines what attributes are associated with an atom. A new atom style can be created if one of the existing atom styles does not define all the attributes you need to store and communicate with atoms.
Atom_vec_atomic.cpp is a simple example of an atom style.
Here is a brief description of methods you define in your new derived class. See atom_vec.h for details.
init one time setup (optional) grow re-allocate atom arrays to longer lengths (required) grow_reset make array pointers in Atom and AtomVec classes consistent (required) copy copy info for one atom to another atom’s array locations (required) pack_comm store an atom’s info in a buffer communicated every timestep (required) pack_comm_vel add velocity info to communication buffer (required) pack_comm_hybrid store extra info unique to this atom style (optional) unpack_comm retrieve an atom’s info from the buffer (required) unpack_comm_vel also retrieve velocity info (required) unpack_comm_hybrid retrieve extra info unique to this atom style (optional) pack_reverse store an atom’s info in a buffer communicating partial forces (required) pack_reverse_hybrid store extra info unique to this atom style (optional) unpack_reverse retrieve an atom’s info from the buffer (required) unpack_reverse_hybrid retrieve extra info unique to this atom style (optional) pack_border store an atom’s info in a buffer communicated on neighbor re-builds (required) pack_border_vel add velocity info to buffer (required) pack_border_hybrid store extra info unique to this atom style (optional) unpack_border retrieve an atom’s info from the buffer (required) unpack_border_vel also retrieve velocity info (required) unpack_border_hybrid retrieve extra info unique to this atom style (optional) pack_exchange store all an atom’s info to migrate to another processor (required) unpack_exchange retrieve an atom’s info from the buffer (required) size_restart number of restart quantities associated with proc’s atoms (required) pack_restart pack atom quantities into a buffer (required) unpack_restart unpack atom quantities from a buffer (required) create_atom create an individual atom of this style (required) data_atom parse an atom line from the data file (required) data_atom_hybrid parse additional atom info unique to this atom style (optional) data_vel parse one line of velocity information from data file (optional) data_vel_hybrid parse additional velocity data unique to this atom style (optional) memory_usage tally memory allocated by atom arrays (required)
The constructor of the derived class sets values for several variables that you must set when defining a new atom style, which are documented in atom_vec.h. New atom arrays are defined in atom.cpp. Search for the word “customize” and you will find locations you will need to modify.
Note
It is possible to add some attributes, such as a molecule ID, to atom styles that do not have them via the fix property/atom command. This command also allows new custom attributes consisting of extra integer or floating-point values to be added to atoms. See the fix property/atom doc page for examples of cases where this is useful and details on how to initialize, access, and output the custom values.
New pair styles, fixes, or computes can be added to LAMMPS, as discussed below. The code for these classes can use the per-atom properties defined by fix property/atom. The Atom class has a find_custom() method that is useful in this context:
int index = atom->find_custom(char *name, int &flag);
The “name” of a custom attribute, as specified in the fix property/atom command, is checked to verify that it exists and its index is returned. The method also sets flag = 0/1 depending on whether it is an integer or floating-point attribute. The vector of values associated with the attribute can then be accessed using the returned index as
int *ivector = atom->ivector[index];
double *dvector = atom->dvector[index];
Ivector or dvector are vectors of length Nlocal = # of owned atoms, which store the attributes of individual atoms.
10.2. Bond, angle, dihedral, improper potentials
Classes that compute molecular interactions are derived from the Bond, Angle, Dihedral, and Improper classes. New styles can be created to add new potentials to LAMMPS.
Bond_harmonic.cpp is the simplest example of a bond style. Ditto for the harmonic forms of the angle, dihedral, and improper style commands.
Here is a brief description of common methods you define in your new derived class. See bond.h, angle.h, dihedral.h, and improper.h for details and specific additional methods.
init check if all coefficients are set, calls init_style (optional) init_style check if style specific conditions are met (optional) compute compute the molecular interactions (required) settings apply global settings for all types (optional) coeff set coefficients for one type (required) equilibrium_distance length of bond, used by SHAKE (required, bond only) equilibrium_angle opening of angle, used by SHAKE (required, angle only) write & read_restart writes/reads coeffs to restart files (required) single force and energy of a single bond or angle (required, bond or angle only) memory_usage tally memory allocated by the style (optional)
10.3. Compute styles
Classes that compute scalar and vector quantities like temperature and the pressure tensor, as well as classes that compute per-atom quantities like kinetic energy and the centro-symmetry parameter are derived from the Compute class. New styles can be created to add new calculations to LAMMPS.
Compute_temp.cpp is a simple example of computing a scalar temperature. Compute_ke_atom.cpp is a simple example of computing per-atom kinetic energy.
Here is a brief description of methods you define in your new derived class. See compute.h for details.
init perform one time setup (required) init_list neighbor list setup, if needed (optional) compute_scalar compute a scalar quantity (optional) compute_vector compute a vector of quantities (optional) compute_peratom compute one or more quantities per atom (optional) compute_local compute one or more quantities per processor (optional) pack_comm pack a buffer with items to communicate (optional) unpack_comm unpack the buffer (optional) pack_reverse pack a buffer with items to reverse communicate (optional) unpack_reverse unpack the buffer (optional) remove_bias remove velocity bias from one atom (optional) remove_bias_all remove velocity bias from all atoms in group (optional) restore_bias restore velocity bias for one atom after remove_bias (optional) restore_bias_all same as before, but for all atoms in group (optional) pair_tally_callback callback function for tally-style computes (optional). memory_usage tally memory usage (optional)
Tally-style computes are a special case, as their computation is done in two stages: the callback function is registered with the pair style and then called from the Pair::ev_tally() function, which is called for each pair after force and energy has been computed for this pair. Then the tallied values are retrieved with the standard compute_scalar or compute_vector or compute_peratom methods. The USER-TALLY package provides examples_compute_tally.html for utilizing this mechanism.
10.5. Dump custom output options
Classes that dump per-atom info to files are derived from the Dump class. To dump new quantities or in a new format, a new derived dump class can be added, but it is typically simpler to modify the DumpCustom class contained in the dump_custom.cpp file.
Dump_atom.cpp is a simple example of a derived dump class.
Here is a brief description of methods you define in your new derived class. See dump.h for details.
write_header write the header section of a snapshot of atoms count count the number of lines a processor will output pack pack a proc’s output data into a buffer write_data write a proc’s data to a file
See the dump command and its custom style for a list of keywords for atom information that can already be dumped by DumpCustom. It includes options to dump per-atom info from Compute classes, so adding a new derived Compute class is one way to calculate new quantities to dump.
Alternatively, you can add new keywords to the dump custom command. Search for the word “customize” in dump_custom.cpp to see the half-dozen or so locations where code will need to be added.
10.6. Fix styles
In LAMMPS, a “fix” is any operation that is computed during timestepping that alters some property of the system. Essentially everything that happens during a simulation besides force computation, neighbor list construction, and output, is a “fix”. This includes time integration (update of coordinates and velocities), force constraints or boundary conditions (SHAKE or walls), and diagnostics (compute a diffusion coefficient). New styles can be created to add new options to LAMMPS.
Fix_setforce.cpp is a simple example of setting forces on atoms to prescribed values. There are dozens of fix options already in LAMMPS; choose one as a template that is similar to what you want to implement.
Here is a brief description of methods you can define in your new derived class. See fix.h for details.
setmask determines when the fix is called during the timestep (required) init initialization before a run (optional) setup_pre_exchange called before atom exchange in setup (optional) setup_pre_force called before force computation in setup (optional) setup called immediately before the 1st timestep and after forces are computed (optional) min_setup_pre_force like setup_pre_force, but for minimizations instead of MD runs (optional) min_setup like setup, but for minimizations instead of MD runs (optional) initial_integrate called at very beginning of each timestep (optional) pre_exchange called before atom exchange on re-neighboring steps (optional) pre_neighbor called before neighbor list build (optional) pre_force called before pair & molecular forces are computed (optional) post_force called after pair & molecular forces are computed and communicated (optional) final_integrate called at end of each timestep (optional) end_of_step called at very end of timestep (optional) write_restart dumps fix info to restart file (optional) restart uses info from restart file to re-initialize the fix (optional) grow_arrays allocate memory for atom-based arrays used by fix (optional) copy_arrays copy atom info when an atom migrates to a new processor (optional) pack_exchange store atom’s data in a buffer (optional) unpack_exchange retrieve atom’s data from a buffer (optional) pack_restart store atom’s data for writing to restart file (optional) unpack_restart retrieve atom’s data from a restart file buffer (optional) size_restart size of atom’s data (optional) maxsize_restart max size of atom’s data (optional) setup_pre_force_respa same as setup_pre_force, but for rRESPA (optional) initial_integrate_respa same as initial_integrate, but for rRESPA (optional) post_integrate_respa called after the first half integration step is done in rRESPA (optional) pre_force_respa same as pre_force, but for rRESPA (optional) post_force_respa same as post_force, but for rRESPA (optional) final_integrate_respa same as final_integrate, but for rRESPA (optional) min_pre_force called after pair & molecular forces are computed in minimizer (optional) min_post_force called after pair & molecular forces are computed and communicated in minimizer (optional) min_store store extra data for linesearch based minimization on a LIFO stack (optional) min_pushstore push the minimization LIFO stack one element down (optional) min_popstore pop the minimization LIFO stack one element up (optional) min_clearstore clear minimization LIFO stack (optional) min_step reset or move forward on line search minimization (optional) min_dof report number of degrees of freedom added by this fix in minimization (optional) max_alpha report maximum allowed step size during linesearch minimization (optional) pack_comm pack a buffer to communicate a per-atom quantity (optional) unpack_comm unpack a buffer to communicate a per-atom quantity (optional) pack_reverse_comm pack a buffer to reverse communicate a per-atom quantity (optional) unpack_reverse_comm unpack a buffer to reverse communicate a per-atom quantity (optional) dof report number of degrees of freedom removed by this fix during MD (optional) compute_scalar return a global scalar property that the fix computes (optional) compute_vector return a component of a vector property that the fix computes (optional) compute_array return a component of an array property that the fix computes (optional) deform called when the box size is changed (optional) reset_target called when a change of the target temperature is requested during a run (optional) reset_dt is called when a change of the time step is requested during a run (optional) modify_param called when a fix_modify request is executed (optional) memory_usage report memory used by fix (optional) thermo compute quantities for thermodynamic output (optional)
Typically, only a small fraction of these methods are defined for a particular fix. Setmask is mandatory, as it determines when the fix will be invoked during the timestep. Fixes that perform time integration (nve, nvt, npt) implement initial_integrate() and final_integrate() to perform velocity Verlet updates. Fixes that constrain forces implement post_force().
Fixes that perform diagnostics typically implement end_of_step(). For an end_of_step fix, one of your fix arguments must be the variable “nevery” which is used to determine when to call the fix and you must set this variable in the constructor of your fix. By convention, this is the first argument the fix defines (after the ID, group-ID, style).
If the fix needs to store information for each atom that persists from timestep to timestep, it can manage that memory and migrate the info with the atoms as they move from processors to processor by implementing the grow_arrays, copy_arrays, pack_exchange, and unpack_exchange methods. Similarly, the pack_restart and unpack_restart methods can be implemented to store information about the fix in restart files. If you wish an integrator or force constraint fix to work with rRESPA (see the run_style command), the initial_integrate, post_force_integrate, and final_integrate_respa methods can be implemented. The thermo method enables a fix to contribute values to thermodynamic output, as printed quantities and/or to be summed to the potential energy of the system.
10.7. Input script commands
New commands can be added to LAMMPS input scripts by adding new classes that have a “command” method. For example, the create_atoms, read_data, velocity, and run commands are all implemented in this fashion. When such a command is encountered in the LAMMPS input script, LAMMPS simply creates a class with the corresponding name, invokes the “command” method of the class, and passes it the arguments from the input script. The command method can perform whatever operations it wishes on LAMMPS data structures.
The single method your new class must define is as follows:
command operations performed by the new command
Of course, the new class can define other methods and variables as needed.
10.8. Kspace computations
Classes that compute long-range Coulombic interactions via K-space representations (Ewald, PPPM) are derived from the KSpace class. New styles can be created to add new K-space options to LAMMPS.
Ewald.cpp is an example of computing K-space interactions.
Here is a brief description of methods you define in your new derived class. See kspace.h for details.
init initialize the calculation before a run setup computation before the 1st timestep of a run compute every-timestep computation memory_usage tally of memory usage
10.9. Minimization styles
Classes that perform energy minimization derived from the Min class. New styles can be created to add new minimization algorithms to LAMMPS.
Min_cg.cpp is an example of conjugate gradient minimization.
Here is a brief description of methods you define in your new derived class. See min.h for details.
init initialize the minimization before a run run perform the minimization memory_usage tally of memory usage
10.10. Pairwise potentials
Classes that compute pairwise interactions are derived from the Pair class. In LAMMPS, pairwise calculation include manybody potentials such as EAM or Tersoff where particles interact without a static bond topology. New styles can be created to add new pair potentials to LAMMPS.
Pair_lj_cut.cpp is a simple example of a Pair class, though it includes some optional methods to enable its use with rRESPA.
Here is a brief description of the class methods in pair.h:
compute workhorse routine that computes pairwise interactions settings reads the input script line with arguments you define coeff set coefficients for one i,j type pair init_one perform initialization for one i,j type pair init_style initialization specific to this pair style write & read_restart write/read i,j pair coeffs to restart files write & read_restart_settings write/read global settings to restart files single force and energy of a single pairwise interaction between 2 atoms compute_inner/middle/outer versions of compute used by rRESPA
The inner/middle/outer routines are optional.
10.11. Region styles
Classes that define geometric regions are derived from the Region class. Regions are used elsewhere in LAMMPS to group atoms, delete atoms to create a void, insert atoms in a specified region, etc. New styles can be created to add new region shapes to LAMMPS.
Region_sphere.cpp is an example of a spherical region.
Here is a brief description of methods you define in your new derived class. See region.h for details.
inside determine whether a point is in the region surface_interior determine if a point is within a cutoff distance inside of surc surface_exterior determine if a point is within a cutoff distance outside of surf shape_update change region shape if set by time-dependent variable
10.12. Body styles
Classes that define body particles are derived from the Body class. Body particles can represent complex entities, such as surface meshes of discrete points, collections of sub-particles, deformable objects, etc.
See Section 6.14 of the manual for an overview of using body particles and the body doc page for details on the various body styles LAMMPS supports. New styles can be created to add new kinds of body particles to LAMMPS.
Body_nparticle.cpp is an example of a body particle that is treated as a rigid body containing N sub-particles.
Here is a brief description of methods you define in your new derived class. See body.h for details.
data_body process a line from the Bodies section of a data file noutrow number of sub-particles output is generated for noutcol number of values per-sub-particle output is generated for output output values for the Mth sub-particle pack_comm_body body attributes to communicate every timestep unpack_comm_body unpacking of those attributes pack_border_body body attributes to communicate when reneighboring is done unpack_border_body unpacking of those attributes
10.13. Thermodynamic output options
There is one class that computes and prints thermodynamic information to the screen and log file; see the file thermo.cpp.
There are two styles defined in thermo.cpp: “one” and “multi”. There is also a flexible “custom” style which allows the user to explicitly list keywords for quantities to print when thermodynamic info is output. See the thermo_style command for a list of defined quantities.
The thermo styles (one, multi, etc) are simply lists of keywords. Adding a new style thus only requires defining a new list of keywords. Search for the word “customize” with references to “thermo style” in thermo.cpp to see the two locations where code will need to be added.
New keywords can also be added to thermo.cpp to compute new quantities for output. Search for the word “customize” with references to “keyword” in thermo.cpp to see the several locations where code will need to be added.
Note that the thermo_style custom command already allows for thermo output of quantities calculated by fixes, computes, and variables. Thus, it may be simpler to compute what you wish via one of those constructs, than by adding a new keyword to the thermo command.
10.14. Variable options
There is one class that computes and stores variable information in LAMMPS; see the file variable.cpp. The value associated with a variable can be periodically printed to the screen via the print, fix print, or thermo_style custom commands. Variables of style “equal” can compute complex equations that involve the following types of arguments:
thermo keywords = ke, vol, atoms, ...
other variables = v_a, v_myvar, ...
math functions = div(x,y), mult(x,y), add(x,y), ...
group functions = mass(group), xcm(group,x), ...
atom values = x[123], y[3], vx[34], ...
compute values = c_mytemp[0], c_thermo_press[3], ...
Adding keywords for the thermo_style custom command (which can then be accessed by variables) was discussed here on this page.
Adding a new math function of one or two arguments can be done by editing one section of the Variable::evaluate() method. Search for the word “customize” to find the appropriate location.
Adding a new group function can be done by editing one section of the Variable::evaluate() method. Search for the word “customize” to find the appropriate location. You may need to add a new method to the Group class as well (see the group.cpp file).
Accessing a new atom-based vector can be done by editing one section of the Variable::evaluate() method. Search for the word “customize” to find the appropriate location.
Adding new compute styles (whose calculated values can then be accessed by variables) was discussed here on this page.
10.15. Submitting new features for inclusion in LAMMPS
We encourage users to submit new features or modifications for LAMMPS to the core developers so they can be added to the LAMMPS distribution. The preferred way to manage and coordinate this is as of Fall 2016 via the LAMMPS project on GitHub. An alternative is to contact the LAMMPS developers or the indicated developer of a package or feature directly and send in your contribution via e-mail.
For any larger modifications or programming project, you are encouraged to contact the LAMMPS developers ahead of time, in order to discuss implementation strategies and coding guidelines, that will make it easier to integrate your contribution and result in less work for everybody involved. You are also encouraged to search through the list of open issues on GitHub and submit a new issue for a planned feature, so you would not duplicate the work of others (and possibly get scooped by them) or have your work duplicated by others.
How quickly your contribution will be integrated depends largely on how much effort it will cause to integrate and test it, how much it requires changes to the core codebase, and of how much interest it is to the larger LAMMPS community. Please see below for a checklist of typical requirements. Once you have prepared everything, see this tutorial for instructions on how to submit your changes or new files through a GitHub pull request. If you prefer to submit patches or full files, you should first make certain, that your code works correctly with the latest patch-level version of LAMMPS and contains all bugfixes from it. Then create a gzipped tar file of all changed or added files or a corresponding patch file using ‘diff -u’ or ‘diff -c’ and compress it with gzip. Please only use gzip compression, as this works well on all platforms.
If the new features/files are broadly useful we may add them as core files to LAMMPS or as part of a standard package. Else we will add them as a user-contributed file or package. Examples of user packages are in src sub-directories that start with USER. The USER-MISC package is simply a collection of (mostly) unrelated single files, which is the simplest way to have your contribution quickly added to the LAMMPS distribution. You can see a list of the both standard and user packages by typing “make package” in the LAMMPS src directory.
Note that by providing us files to release, you are agreeing to make them open-source, i.e. we can release them under the terms of the GPL, used as a license for the rest of LAMMPS. See Section 1.4 for details.
With user packages and files, all we are really providing (aside from the fame and fortune that accompanies having your name in the source code and on the Authors page of the LAMMPS WWW site), is a means for you to distribute your work to the LAMMPS user community, and a mechanism for others to easily try out your new feature. This may help you find bugs or make contact with new collaborators. Note that you’re also implicitly agreeing to support your code which means answer questions, fix bugs, and maintain it if LAMMPS changes in some way that breaks it (an unusual event).
Note
If you prefer to actively develop and support your add-on feature yourself, then you may wish to make it available for download from your own website, as a user package that LAMMPS users can add to their copy of LAMMPS. See the Offsite LAMMPS packages and tools page of the LAMMPS web site for examples of groups that do this. We are happy to advertise your package and web site from that page. Simply email the developers with info about your package and we will post it there.
The previous sections of this doc page describe how to add new “style” files of various kinds to LAMMPS. Packages are simply collections of one or more new class files which are invoked as a new style within a LAMMPS input script. If designed correctly, these additions typically do not require changes to the main core of LAMMPS; they are simply add-on files. If you think your new feature requires non-trivial changes in core LAMMPS files, you’ll need to communicate with the developers, since we may or may not want to make those changes. An example of a trivial change is making a parent-class method “virtual” when you derive a new child class from it.
Here is a checklist of steps you need to follow to submit a single file or user package for our consideration. Following these steps will save both you and us time. See existing files in packages in the src dir for examples. If you are uncertain, please ask.
• All source files you provide must compile with the most current version of LAMMPS with multiple configurations. In particular you need to test compiling LAMMPS from scratch with -DLAMMPS_BIGBIG set in addition to the default -DLAMMPS_SMALLBIG setting. Your code will need to work correctly in serial and in parallel using MPI.
• For consistency with the rest of LAMMPS and especially, if you want your contribution(s) to be added to main LAMMPS code or one of its standard packages, it needs to be written in a style compatible with other LAMMPS source files. This means: 2-character indentation per level, no tabs, no lines over 80 characters. I/O is done via the C-style stdio library, class header files should not import any system headers outside <stdio.h>, STL containers should be avoided in headers, and forward declarations used where possible or needed. All added code should be placed into the LAMMPS_NS namespace or a sub-namespace; global or static variables should be avoided, as they conflict with the modular nature of LAMMPS and the C++ class structure. Header files must not import namespaces with using. This all is so the developers can more easily understand, integrate, and maintain your contribution and reduce conflicts with other parts of LAMMPS. This basically means that the code accesses data structures, performs its operations, and is formatted similar to other LAMMPS source files, including the use of the error class for error and warning messages.
• If you want your contribution to be added as a user-contributed feature, and it’s a single file (actually a *.cpp and *.h file) it can rapidly be added to the USER-MISC directory. Send us the one-line entry to add to the USER-MISC/README file in that dir, along with the 2 source files. You can do this multiple times if you wish to contribute several individual features.
| 2018-07-20T10:46:19 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.498129665851593, "perplexity": 3376.2333788894794}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-30/segments/1531676591578.1/warc/CC-MAIN-20180720100114-20180720120114-00129.warc.gz"}
|
https://tjyj.stats.gov.cn/CN/10.19343/j.cnki.11-1302/c.2019.11.003
|
• •
### 规模的门限效应、综合化经营与我国商业银行系统性风险
• 出版日期:2019-11-25 发布日期:2019-11-28
### The Threshold Effect of Bank Sizes, Comprehensive Operation and Systemic Risk for China’s Commercial Banks
Zhang Tianding
• Online:2019-11-25 Published:2019-11-28
Abstract: Comprehensive operation has become an important business strategy to make breakthroughs in the development for China’s commercial banks in the trend of falling traditional interest incomes. The use of the non-interest income as the current research measure for the comprehensive operation has obvious defects. This paper introduces the measurement of the entropy index in the product diversification of nonfinancial firms to the analysis of commercial banks’ comprehensive operation, which effectively solves the measurement problems. Based on the combination supervision of macro prudential and micro prudential concepts, this paper uses the component expected shortfall method to measure the systemic risk for the commercial banks, and treats the bank size as the threshold variable to identify the different regime by the dynamic panel threshold models, in which we discuss the effect of the comprehensive operation on the systemic risk. The results show that the comprehensive operation has the property of size threshold effect which means for the small ones it will decrease the systemic risk and for the big ones it will increase the systemic risk. Finally, based on the empirical research this paper gives some policy advice and implications.
| 2023-02-02T20:08:47 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.24425257742404938, "perplexity": 1627.395760399696}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764500041.18/warc/CC-MAIN-20230202200542-20230202230542-00721.warc.gz"}
|
https://googology.wikia.org/wiki/Maksudov%27s_transfinite_arrow_notation
|
11,052 Pages
This is an extension of arrow notation to transfinitely many arrows by Googology Wiki user Denis Maksudov.[1]
## Definition
Let $$n$$ and $$b$$ be natural numbers, and $$\alpha$$ be a countable ordinal.
• If $$\alpha=0$$, $$n\uparrow^\alpha b\ :=\ n\times b$$
• $$n\uparrow^{\alpha+1}b\ :=\ \begin{cases}n\textrm{ if }b=1 \\ n\uparrow^\alpha (n\uparrow^{\alpha+1}(b-1))\textrm{ if }b>1\end{cases}$$
• If $$\alpha$$ is a limit ordinal, then $$n\uparrow^\alpha b\ :=\ n\uparrow^{(\alpha}$$$$^{[n]}$$$$^)n$$
## Examples
For finite $$\alpha$$, this notation exactly corresponds to arrow notation.
## Sources
Community content is available under CC-BY-SA unless otherwise noted.
| 2021-06-22T18:04:37 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9964861273765564, "perplexity": 1839.6181458045853}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-25/segments/1623488519183.85/warc/CC-MAIN-20210622155328-20210622185328-00231.warc.gz"}
|
https://kulturforum-metzingen.de/7nfknc/9559d2-do-weak-acids-completely-dissociate-in-water
|
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. H2CO3. This is done by making an ICE table to find the protonation of the acid or base, while also incorporating the ion product of water. А. | $ac-a\left(\dfrac{w}{y}-y\right)=\left(\dfrac{w}{y}-y\right)^2+\left(\dfrac{w}{y}-y\right)y$, $ac-\dfrac{aw}{y}+ay=\dfrac{w^2}{y^2}-\dfrac{2wy}{y}+y^2+\dfrac{wy}{y}-y^2$, $ac-\dfrac{aw}{y}+ay=\dfrac{w^2}{y^2}-2w+y^2+w-y^2$, $ac-\dfrac{aw}{y}+ay=\dfrac{w^2}{y^2}-w$, $ac-\dfrac{aw}{y}+ay+w=\dfrac{w^2}{y^2}$, $(1.78 \times 10^{-4})y^3+((1.78 \times 10^{-4})(2.17 \times 10^{-7})+(10^{-14})) y^2-(1.78 \times 10^{-4})(10^{-14})y-(10^{-14})^2=0$, $(1.78 \times 10^{-4})y^3+(3.86 \times 10^{-11})y^2-(1.78 \times 10^{-18})y-10^{-28}=0$, and use a graphing calculator to find that, $x=\dfrac{w}{y}-y = \dfrac{10^{-14}}{3.91 \times 10^{-8}}-3.91 \times 10^{-8} = 2.17 \times 10^{-7}$, $[H_3O^+] = (x + y) = (2.17 \times 10^{-7} + 3.91 \times 10^{-8}) = 2.56 \times 10^{-7} \;M$, $-\log[H_3O^+] = -\log(2.56 \times 10^{-7}) = pH = 6.59$. Ka is the equilibrium constant for the dissociation of a weak acid and Kb is the equilibrium constant for the dissociation of a weak … Weak Acids And Bases Are Those That Do Not Completely Dissociate In Water. A strong base can give your skin a much worse burn than an acid. The hydrogen ion (proton) does not wander long by itself before it attaches to the oxygen atom of a second un-ionized water molecule to form a hydronium ion (H3O +). Biphenyl, Benzyl alcohol, and Benzoic acid. Compare this value to pH = 6.66, which is what would have been calculated if the autoprotonization of water was not considered. Under standard conditions for temperature and pressure, benzoic acid is known to exist as a crystalline solid which does not have any characteristic colour. © 2003-2020 Chegg Inc. All rights reserved. The conjugate base of acetic acid is commonly referred to as acetate. Since the hydrogen ion has no electron to neutralize the positive charge on its proton, it has a full unit of positive charge and is symbolized as H+. Ka of In its liquid state, formic acid is known to possess strong and penetrating pungent odour. The LibreTexts libraries are Powered by MindTouch® and are supported by the Department of Education Open Textbook Pilot Project, the UC Davis Office of the Provost, the UC Davis Library, the California State University Affordable Learning Solutions Program, and Merlot. The molar mass of acetic acid corresponds to 60.052 grams per mole. Your email address will not be published. A weak acid is a weak electrolyte and weak electrolytes do not completely dissociate or ionize completely in water but are partially ionized or dissociate incompletely in water. refe... A: “Since you have asked multiple question, we will solve the first question for you. Acids that do not dissociate completely are called weak acids. This distinction has clearly led you in the wrong direction, so I tried to reword it to help. What mass of sodium bicarbonate (NaHCO3) should be added to a one liter solution of 0.250 M H2CO3 to maintain the solution at pH of 7.40? Some common weak acids and bases are given here. Weak acids do not dissociate completely in water and have pKa values of - 3 or higher. What is the hink-pink for blue green moray? Under standard conditions for temperature and pressure, this weak acid is known to exist as a colourless liquid that emanates a strong, vinegar-like odour. All Rights Reserved. Only Oxalic acid is regarded to be one of the simplest dicarboxylic acids. A weak acid is a weak electrolyte and weak electrolytes do not completely dissociate or ionize completely in water but are partially ionized or dissociate incompletely in water. Although this is more difficult than calculating the pH of a strong acid or base solution, most biochemically important acids and bases are considered weak, and so it is very useful to understand how to calculate the pH of these substances. Strong acids are listed at the top left hand corner of the table and have Ka values >1 2. A base is defined as a “proton acceptor.” The most common bases produce hydroxide ion when they dissociate, and it is the hydroxide ion that accepts the proton. https://quizlet.com/279045928/acid-and-base-equilibria-flash-cards The sampl... A: Given, Examples of strong acids are hydrochloric acid (HCl), perchloric acid (HClO 4), nitric acid (HNO 3) and sulfuric acid (H 2 SO 4). Oxalic acid is a weak acid with the chemical formula C2H2O4. Polyprotic bases take more than one proton from water, and also have more than one ionization constant (Kb1, Kb2, etc). acids that can exist in two conformational states Most often this is the case, and only one ICE table is necessary. The pKa of hydrofluoric acid is equal to 3.17. Who is the longest reigning WWE Champion of all time? strong acids completely dissociate in water. When did organ music become associated with baseball? A: Nuclear fission occurs through two processes. This organic compound is known to exist as a crystalline solid which is white in colour under standard conditions for temperature and pressure (often abbreviated to STP). А. HNO3 В. НС C. H2SO4 . Does Jerry Seinfeld have Parkinson's disease? Unlike ionic compounds, such as sodium chloride, they are not ionized before they dissociate; they accomplish ionization and dissociation at the same time. . The We also acknowledge previous National Science Foundation support under grant numbers 1246120, 1525057, and 1413739. The dissociation of the acid or base is an equilibrium process and has a corresponding equilibrium constant. For every acetic acid molecule that dissociates, one acetate ion and one hydronium ion is produced. $HC_2H_3O_{2(aq)} + H_2O_{(l)} \rightleftharpoons C_2H_3O^-_{2(aq)} + H_3O^+_{(aq)}$. Required fields are marked *. Acetic acid is a weak acid in water. Salts of this weak acid are widely used in the food industry as preservatives. Median response time is 34 minutes and may be longer for new subjects. Sodium fluoride can be prepar... A: A balanced chemical reaction is a reaction in which number of atoms of each element present in the r... *Response times vary by subject and question complexity. Under standard conditions for temperature and pressure, formic acid exists as a colourless liquid (which sometimes evolves fumes). Weak Acids are the acids that do not completely dissociate into their constituent ions when dissolved in solutions. (Ka = 1.8 x 10-5). In any sample of water, very few of the molecules are dissociated at any one time: in fact, only about one in 550 million. Benzoic acid is an aromatic carboxylic acid with the chemical formula C6H5COOH. Assume that the vinegar is really just a solution of acetic acid in water, and that density = 1 g/mL. Unlike strong acids/bases, weak acids and weak bases do not completely dissociate (separate into ions) at equilibrium in water, so calculating the pH of these solutions requires consideration of a unique ionization constant and equilibrium concentrations. Acid strength is the tendency of an acid, symbolised by the chemical formula HA, to dissociate into a proton, H +, and an anion, A −.The dissociation of a strong acid in solution is effectively complete, except in its most concentrated solutions.. HA → H + + A −.
| 2021-07-25T18:32:54 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.4613594710826874, "perplexity": 2449.323416418857}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-31/segments/1627046151760.94/warc/CC-MAIN-20210725174608-20210725204608-00400.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?node=S042DM&home=MXXX045
|
#### ${\mathit m}_{{{\mathit B}^{0}}}–{\mathit m}_{{{\mathit B}^{+}}}$
VALUE (MeV) DOCUMENT ID TECN COMMENT
$\bf{ 0.32 \pm0.05}$ OUR FIT
$\bf{ 0.33 \pm0.05}$ OUR AVERAGE
$0.57$ $\pm0.49$ $\pm0.10$ 1
2018 DF
CMS ${{\mathit p}}{{\mathit p}}$ at 8 TeV
$0.20$ $\pm0.17$ $\pm0.11$ 1
2012 E
LHCB ${{\mathit p}}{{\mathit p}}$ at 7 TeV
$0.33$ $\pm0.05$ $\pm0.03$ 2
2008 AF
BABR ${{\mathit e}^{+}}$ ${{\mathit e}^{-}}$ $\rightarrow$ ${{\mathit \Upsilon}{(4S)}}$
$0.53$ $\pm0.67$ $\pm0.14$ 1
2006
CDF ${{\mathit p}}{{\overline{\mathit p}}}$ at 1.96 TeV
$0.41$ $\pm0.25$ $\pm0.19$
1994
CLE2 ${{\mathit e}^{+}}$ ${{\mathit e}^{-}}$ $\rightarrow$ ${{\mathit \Upsilon}{(4S)}}$
$-0.4$ $\pm0.6$ $\pm0.5$
1992
CLEO ${{\mathit e}^{+}}$ ${{\mathit e}^{-}}$ $\rightarrow$ ${{\mathit \Upsilon}{(4S)}}$
$-0.9$ $\pm1.2$ $\pm0.5$
1990 J
ARG ${{\mathit e}^{+}}$ ${{\mathit e}^{-}}$ $\rightarrow$ ${{\mathit \Upsilon}{(4S)}}$
$2.0$ $\pm1.1$ $\pm0.3$ 3
1987
CLEO ${{\mathit e}^{+}}$ ${{\mathit e}^{-}}$ $\rightarrow$ ${{\mathit \Upsilon}{(4S)}}$
1 Uses exclusively reconstructed final states containing a ${{\mathit J / \psi}}$ $\rightarrow$ ${{\mathit \mu}^{+}}{{\mathit \mu}^{-}}$ decay.
2 Uses the ${{\mathit B}}$ -momentum distributions in the ${{\mathit e}^{+}}{{\mathit e}^{-}}$ rest frame.
3 BEBEK 1987 actually measure the difference between half of $\mathit E_{{\mathrm {cm}}}$ and the ${{\mathit B}^{\pm}}$ or ${{\mathit B}^{0}}$ mass, so the ${\mathit m}_{{{\mathit B}^{0}}}–{\mathit m}_{{{\mathit B}^{\pm}}}$ is more accurate. Assume ${\mathit m}_{{{\mathit \Upsilon}{(4S)}}}$ = 10580 MeV.
References:
SIRUNYAN 2018DF
EPJ C78 939 Studies of ${\mathrm {B}} ^{*{\mathrm {s}}2}(5840)^0$ and ${\mathrm {B}} _{{\mathrm {s}}1}(5830)^0$ mesons including the observation of the ${\mathrm {B}} ^{*{\mathrm {s}}2}(5840)^0 \rightarrow {\mathrm {B}} ^0 \mathrm {K} ^0_{\mathrm {S}}$ decay in proton-proton collisions at $\sqrt{s}=8\,\text {TeV}$
AAIJ 2012E
PL B708 241 Measurement of ${\mathit {\mathit b}}$-Hadron Masses
AUBERT 2008AF
PR D78 011103 Measurement of the Mass Difference ${\mathit m}_{{{\mathit B}^{0}}}–{\mathit m}_{{{\mathit B}^{+}}}$
ACOSTA 2006
PRL 96 202001 Measurement of Bottom-Quark Hadron Masses in Exclusive ${{\mathit J / \psi}}$ Decays with the CDF Detector
ALAM 1994
PR D50 43 Exclusive Hadronic ${{\mathit B}}$ Decays to Charm and Charmonium Final States
BORTOLETTO 1992
PR D45 21 Inclusive and Exclusive Decays of ${{\mathit B}}$ Mesons to Final States Including Charm and Charmonium Mesons
ALBRECHT 1990J
ZPHY C48 543 Exclusive Hadronic Decays of ${{\mathit B}}$ Mesons
BEBEK 1987
PR D36 1289 Exclusive Decays and Masses of the ${{\mathit B}}$ Mesons
| 2023-01-31T04:41:32 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9601514935493469, "perplexity": 4107.166971674138}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-06/segments/1674764499842.81/warc/CC-MAIN-20230131023947-20230131053947-00309.warc.gz"}
|
https://www.usgs.gov/centers/id-water/science/water-quality
|
# Idaho Water Science Center
## Water Quality
Due to a lapse in appropriations, the majority of USGS websites may not be up to date and may not reflect current conditions. Websites displaying real-time data, such as Earthquake and Water and information needed for public health and safety will be updated with limited support. Additionally, USGS will not be able to respond to inquiries until appropriations are enacted. For more information, please see www.doi.gov/shutdown
Filter Total Items: 21
Date published: November 20, 2017
Status: Active
### Water Quality in Aquifers Used for Drinking-Water Supplies, Gem County
The U.S. Geological Survey, in cooperation with Gem County and the Idaho Department of Environmental Quality, is assessing the quality of groundwater from freshwater aquifers used for drinking-water supplies.
Contacts: Erin M Murray
Date published: November 2, 2017
Status: Active
### Water Monitoring - Idaho National Laboratory
We monitor groundwater and surface-water quality as well as streamflow and reservoir levels at nine surface-water sites.
Water samples are collected...
Date published: September 21, 2017
Status: Active
### Water Archive Library - Idaho National Laboratory
Since 1966, we have archived over 6000 samples of about 500 mL each of "raw" (unfiltered and unpreserved) water from groundwater and surface-water quality sites collected during our monitoring activities. Through the years, we've kept the water samples in a secure room and tracked which samples researchers have requested and analyzed for various projects.
Date published: September 20, 2017
Status: Completed
### Geophyical Logging and Water-Quality Assessment for Project Hot Spot
Relatively little is known about the Yellowstone-Snake River "hotspot" system. To increase our knowledge, the U.S. Department of Energy’s Geothermal Technologies Program provided over $4.5 million of this$6.7 million project using American Recovery and Reinvestment Act funds.
Contacts: Brian V Twining
Date published: September 20, 2017
Status: Completed
### Hydrologic Investigations near the Remote Handled Low-Level Waste Facility
The U.S. Department of Energy has proposed a location for a new facility to store waste at the INL. In the unlikely event that waste leaks from the facility, it will be important to monitor whether the contamination reaches the aquifer and baseline information is need before the facility is built.
Because we need to know how water and contaminants may travel through the aquifer, we need...
Date published: September 20, 2017
Status: Completed
### Naval Reactors Facility Groundwater-Quality Monitoring
As part of the Comprehensive Environmental Response Compensation and Liability Act, it is important to evaluate the effect of Naval Reactors Facility (NRF) activities on the water quality of the eastern Snake River Plain aquifer.
Contacts: Gordon Rattray
Date published: August 18, 2017
Status: Active
### Monitoring Mercury in Fish Tissue, Boise and Snake Rivers and Brownlee Reservoir
To meet National Pollution Discharge Elimination System (NPDES) permitting requirements, the City of Boise will be responsible for collecting fish tissue samples for mercury analysis upstream of and downstream of their wastewater treatment facilities discharging to the lower Boise and Snake Rivers.
Mercury is a naturally occurring element that ultimately makes its way into aquatic...
Contacts: Dorene MacCoy
Date published: August 8, 2017
Status: Active
### Wood River Valley Aquatic Biology and Habitat Assessment
Blaine County’s population nearly quadrupled from about 5,700 to 22,000 people between 1970 and 2010. Residents and resource managers of the Wood River Valley of south-central Idaho are concerned about the potential effects that population growth and the expected increased demand for water might have on the quantity and quality of the valley’s ground and surface waters. Increased water use has...
Contacts: Dorene MacCoy
Date published: August 4, 2017
Status: Active
### Selenium in the Blackfoot River Watershed
The upper Blackfoot River receives runoff from 12 large phosphate mines. Shale waste rock that is a byproduct of mining is highly enriched in naturally occurring selenium. At optimal concentrations, selenium can be a positive nutrient and antioxidant in mammals and fish. At elevated concentrations, however, it can damage fish and animal immune systems. As early as 1996, livestock deaths...
Date published: August 4, 2017
Status: Active
### Occurrence and Potential Risk of Microplastics in Lake Mead and the Delaware River
There is mounting evidence that microplastics present a significant threat to aquatic organisms. Microplastics – defined as plastic particles less than 5 mm in diameter – come from many different sources, including synthetic textiles, industrial waste products, personal care products, and the breakdown of litter, car tires, and other objects. This study will assess the occurrence of...
Date published: August 4, 2017
Status: Active
### Mercury Cycling in the Hells Canyon Complex
The Hells Canyon Complex is a hydroelectric project consisting of three dams located on the Snake River along the Oregon and Idaho border. Elevated concentrations of mercury and methylmercury in the water column, bottom sediments, and biota in this reach have resulted in two of the reservoirs, Brownlee and Hells Canyon, being listed as impaired for mercury by the state of Idaho, and the entire...
Date published: August 4, 2017
Status: Active
### Trace Elements in Streams Near the Stibnite Mining Area
Mining of stibnite (antimony sulfide), tungsten, gold, silver, and mercury near the town of Stibnite in central Idaho has left a legacy of trace element contamination in the East Fork of the South Fork of the Salmon River (EFSFSR) and its tributaries. Concentrations of arsenic, antimony, and mercury frequently exceed human health criteria and may impact threatened or endangered salmonid...
| 2019-01-19T22:17:00 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.26126617193222046, "perplexity": 13799.065769106832}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-04/segments/1547583684033.26/warc/CC-MAIN-20190119221320-20190120003320-00387.warc.gz"}
|
https://par.nsf.gov/biblio/10133660-temperature-dependence-collisional-broadening-shift-kr-electronic-transition
|
Temperature dependence of collisional broadening and shift for the Kr 4 p 6 S 01→5 p [3/2] 2 electronic transition
Temperature scaling of collisional broadening parameters for krypton (absorber)$4p6S01→<#comment/>5p[3/2]2$electronic transition centered at 107.3 nm in the presence of major combustion species (perturber) is investigated. The absorption spectrum in the vicinity of the transition is obtained from the fluorescence due to the two-photon excitation scan of krypton. Krypton was added in small amounts to major combustion species such as$CH4$,$CO2$,$N2$, and air, which then heated to elevated temperatures when flowed through a set of heated coils. In a separate experimental campaign, laminar premixed flat flame product mixtures of methane combustion were employed to extend the investigations to higher temperature ranges relevant to combustion. Collisional full width half maximum (FWHM) ($wC$) and shift ($δ<#comment/>C$) were computed from the absorption spectrum by synthetically fitting Voigt profiles to the excitation scans, and their corresponding temperature scaling was determined by fitting power-law temperature dependencies to the$wC$and$δ<#comment/>C$data for each perturber species. The temperature exponents of$wC$and$δ<#comment/>C$for all considered combustion species (perturbers) were$−<#comment/>0.73$and$−<#comment/>0.6$, respectively. Whereas the temperature exponents of$wC$are closer to more »
Authors:
; ;
Publication Date:
NSF-PAR ID:
10133660
Journal Name:
Applied Optics
Volume:
59
Issue:
5
Page Range or eLocation-ID:
Article No. 1438
ISSN:
1559-128X; APOPAI
Publisher:
Optical Society of America
1. Pressure scaling of collisional broadening parameters of krypton (absorber)$4p6S01→<#comment/>→<#comment/>5p[3/2]2$transition centered at 107.3 nm in the presence of nitrogen$N2$(perturber) is investigated. The absorption spectrum in the vicinity of the transition is obtained from the two-photon excitation scan of krypton in the presence of the perturber at different prescribed pressures varying from a few torrs to 10 atm. The absorption spectra reveal noticeable asymmetry at atmospheric pressure, and the asymmetry becomes increasingly pronounced with pressure; however, the absorption spectra at sub-atmospheric pressures tested are symmetric. The absorption spectra are fitted with synthetic asymmetric Voigt profiles across all pressures, wherein the asymmetry parameter is varied to capture the asymmetry at different pressures. The collisional shift ($δ<#comment/>C$), the symmetric equivalent collisional full width at half maximum ($wC,0$), and the asymmetry parameter ($a$) are determined from the synthetic fits at various pressures. All the parameters are observed to vary linearly with pressure over the entire range of the pressure values tested. The mechanisms that cause the asymmetry in the absorption spectra are also discussed.
2. The mid-IR spectroscopic properties of$Er3+$doped low-phonon$CsCdCl3$and$CsPbCl3$crystals grown by the Bridgman technique have been investigated. Using optical excitations at$∼<#comment/>800nm$and$∼<#comment/>660nm$, both crystals exhibited IR emissions at$∼<#comment/>1.55$,$∼<#comment/>2.75$,$∼<#comment/>3.5$, and$∼<#comment/>4.5µ<#comment/>m$at room temperature. The mid-IR emission at 4.5 µm, originating from the$4I9/2→<#comment/>4I11/2$transition, showed a long emission lifetime of$∼<#comment/>11.6ms$for$Er3+$doped$CsCdCl3$, whereas$Er3+$doped$CsPbCl3$exhibited a shorter lifetime of$∼<#comment/>1.8ms$. The measured emission lifetimes of the$4I9/2$state were nearly independent of the temperature, indicating a negligibly small nonradiative decay rate through multiphonon relaxation, as predicted by the energy-gap law for low-maximum-phonon energy hosts. The room temperature stimulatedmore »
3. Electro-optic quantum coherent interfaces map the amplitude and phase of a quantum signal directly to the phase or intensity of a probe beam. At terahertz frequencies, a fundamental challenge is not only to sense such weak signals (due to a weak coupling with a probe in the near-infrared) but also to resolve them in the time domain. Cavity confinement of both light fields can increase the interaction and achieve strong coupling. Using this approach, current realizations are limited to low microwave frequencies. Alternatively, in bulk crystals, electro-optic sampling was shown to reach quantum-level sensitivity of terahertz waves. Yet, the coupling strength was extremely weak. Here, we propose an on-chip architecture that concomitantly provides subcycle temporal resolution and an extreme sensitivity to sense terahertz intracavity fields below 20 V/m. We use guided femtosecond pulses in the near-infrared and a confinement of the terahertz wave to a volume of$VTHz∼<#comment/>10−<#comment/>9(λ<#comment/>THz/2)3$in combination with ultraperformant organic molecules ($r33=170pm/V$) and accomplish a record-high single-photon electro-optic coupling rate of, 10,000 times higher than in recent reports of sensing vacuum field fluctuations in bulk media. Via homodyne detection implemented directly on chip, the interaction results into an intensity modulation of the femtosecond pulses. The single-photon cooperativity is$C0=1.6×<#comment/>10−<#comment/>8$, and the multiphoton cooperativity is$C=0.002$at room temperature. We show$><#comment/>70dB$dynamic range in intensity at 500 ms integration under irradiation with a weak coherent terahertz field. Similar devices could be employed in future measurements of quantum states in the terahertz at the standard quantum limit, or for entanglement of subsystems on subcycle temporal scales, such as terahertz and near-infrared quantum bits.
4. We report on spectroscopic measurements on the$4f76s28S7/2∘<#comment/>→<#comment/>4f7(8S∘<#comment/>)6s6p(1P∘<#comment/>)8P9/2$transition in neutral europium-151 and europium-153 at 459.4 nm. The center of gravity frequencies for the 151 and 153 isotopes, reported for the first time in this paper, to our knowledge, were found to be 652,389,757.16(34) MHz and 652,386,593.2(5) MHz, respectively. The hyperfine coefficients for the$6s6p(1P∘<#comment/>)8P9/2$state were found to be$A(151)=−<#comment/>228.84(2)MHz$,$B(151)=226.9(5)MHz$and$A(153)=−<#comment/>101.87(6)MHz$,$B(153)=575.4(1.5)MHz$, which all agree with previously published results except for A(153), which shows a small discrepancy. The isotope shift is found to be 3163.8(6) MHz, which also has a discrepancy with previously published results.
5. An optical parametric oscillator (OPO) is developed and characterized for the simultaneous generation of ultraviolet (UV) and near-UV nanosecond laser pulses for the single-shot Rayleigh scattering and planar laser-induced-fluorescence (PLIF) imaging of methylidyne (CH) and nitric oxide (NO) in turbulent flames. The OPO is pumped by a multichannel, 8-pulse Nd:YAG laser cluster that produces up to 225 mJ/pulse at 355 nm with pulse spacing of 100 µs. The pulsed OPO has a conversion efficiency of 9.6% to the signal wavelength of$∼<#comment/>430nm$when pumped by the multimode laser. Second harmonic conversion of the signal, with 3.8% efficiency, is used for the electronic excitation of the A-X (1,0) band of NO at$∼<#comment/>215nm$, while the residual signal at 430 nm is used for direct excitation of the A-X (0,0) band of the CH radical and elastic Rayleigh scattering. The section of the OPO signal wavelength for simultaneous CH and NO PLIF imaging is performed with consideration of the pulse energy, interference from the reactant and product species, and the fluorescence signal intensity. The excitation wavelengths of 430.7 nm and 215.35 nm are studied in a laminar, premixed–air flame. Single-shot CH and NO PLIF and Rayleigh scatter imaging is demonstrated in a turbulent$CH4−<#comment/>H2−<#comment/>NH3$diffusion flame using a high-speed intensified CMOS camera. Analysis of the complementary Rayleigh scattering and CH and NO PLIF enables identification and quantification of the high-temperature flame layers, the combustion product zones, and the fuel-jet core. Considerations for extension to simultaneous, 10-kHz-rate acquisition are discussed.
| 2023-03-31T12:09:08 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 57, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6093441843986511, "perplexity": 3401.8249641775164}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2023-14/segments/1679296949642.35/warc/CC-MAIN-20230331113819-20230331143819-00342.warc.gz"}
|
http://www.legisquebec.gouv.qc.ca/en/version/cs/E-2.2?code=se:16&history=20211022
|
### E-2.2 - Act respecting elections and referendums in municipalities
16. Within 15 days of passage of the draft by-law, the clerk or the secretary-treasurer shall publish, in a newspaper having general circulation in the municipality, a notice setting forth
(1) the object of the draft by-law;
(2) the description of the boundaries of the proposed electoral districts;
(3) the number of electors included in each proposed electoral district;
(4) the place, days and hours for examining the draft by-law;
(5) every elector’s right to inform the clerk or the secretary-treasurer in writing of his objection to the draft by-law within 15 days of publication of the notice;
(6) the address to which objections must be sent;
(7) the number of objections required to oblige the council to hold a public meeting to hear the persons present in respect of the draft by-law.
In addition to or in lieu of the description required under subparagraph 2 of the first paragraph, the notice may include a map or a sketch of the proposed electoral districts.
1987, c. 57, s. 16; 1997, c. 34, s. 5.
16. Within 15 days of passage of the draft by-law, the clerk or the secretary-treasurer shall publish, in a newspaper having general circulation in the municipality, a notice setting forth
(1) the object of the draft by-law;
(2) the description of the boundaries of the proposed electoral districts;
(3) the number of electors included in each proposed electoral district;
(4) the place, days and hours for examining the draft by-law;
(5) every elector’s right to inform the clerk or the secretary-treasurer in writing of his objection to the draft by-law within 15 days of publication of the notice;
(6) the address to which objections must be sent;
(7) the number of objections required to oblige the council to hold a public meeting to hear the persons present in respect of the draft by-law.
In the case of a municipality having a population of 20 000 or over, the notice shall include a map or a sketch of the proposed electoral districts.
1987, c. 57, s. 16.
| 2022-01-26T05:51:43 |
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8197841048240662, "perplexity": 6619.314077780311}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2022-05/segments/1642320304915.53/warc/CC-MAIN-20220126041016-20220126071016-00608.warc.gz"}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.