url
stringlengths 16
775
| text
stringlengths 100
1.02M
| date
timestamp[s] | metadata
stringlengths 1.07k
1.1k
|
|---|---|---|---|
https://indico.fnal.gov/event/19685/
|
# Steffen Hagstotz, "Probing the non-Gaussian density field with clusters of galaxies"
Tuesday, March 5, 2019 from to (US/Central)
at 362 ( F-108 )
Description Abtract: Considerable effort in cosmology today is focused on understanding the statistical nature and evolution of the (dark matter) density field that underlies the observed large-scale structure. Information about this field is mostly phrased in terms of two-point statistics, such as the power spectrum of galaxies or weak lensing, essentially approximating the large-scale structure as a Gaussian random field. However, the Universe is far more complex than that: Gravitational collapse turns the simple initial conditions into the cosmic web consisting of halos, filaments and large voids we see today. In my talk, I will show how we can use the abundance of galaxy clusters residing in the 'knots' of the cosmic web to probe the non-Gaussian shape of the density field. This gives us insights into the physics of structure formation, and provides at the same time a new method to search for deviations from the cosmological standard model. Material:
Go to day
| 2019-11-17T09:58:56 |
{"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.5390756726264954, "perplexity": 804.7230654245707}, "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/1573496668910.63/warc/CC-MAIN-20191117091944-20191117115944-00061.warc.gz"}
|
http://dlmf.nist.gov/20.3
|
§20.3 Graphics
§20.3(ii) $\theta$-Functions: Complex Variable and Real Nome
In the graphics shown in this subsection, height corresponds to the absolute value of the function and color to the phase. See also About Color Map.
§20.3(iii) $\theta$-Functions: Real Variable and Complex Lattice Parameter
In the graphics shown in this subsection, height corresponds to the absolute value of the function and color to the phase. See also About Color Map.
| 2016-07-27T17:17:40 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 117, "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.48276111483573914, "perplexity": 1140.715912006879}, "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-2016-30/segments/1469257826916.34/warc/CC-MAIN-20160723071026-00070-ip-10-185-27-174.ec2.internal.warc.gz"}
|
https://pos.sissa.it/358/327/
|
Volume 358 - 36th International Cosmic Ray Conference (ICRC2019) - CRI - Cosmic Ray Indirect
Testing Lorentz Invariance Violation at the Pierre Auger Observatory
R.G. Lang
Full text: pdf
Pre-published on: 2019 July 22
Published on:
Abstract
In this work, we present the capabilities of testing Lorentz invariance violation (LIV) using data from the Pierre Auger Observatory. Two independent scenarios are treated. Firstly, LIV on the hadron sector is considered and the modified UHECR propagation obtained. An updated combined fit of the spectrum and composition data is performed for each LIV assumption. The data is better described with a low maximum rigidity at sources, which leads to a poor sensitivity to LIV effects. Secondly, subluminal LIV on the photon sector is considered and the propagation of GZK photons is modified. For one of the scenarios considered, very competitive limits on the LIV coefficient of the order of $\delta_\gamma^{(1)} \gtrsim -10^{-40} \, \text{eV}^{-1}$ and $\delta_\gamma^{(2)} \gtrsim -10^{-60} \, \text{eV}^{-2}$ are imposed. Finally, we discuss a promising possibility of testing LIV using the development of UHE air-showers.
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2019-10-15T06:10: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": 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.36819490790367126, "perplexity": 3053.0817738432506}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "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-2019-43/segments/1570986657586.16/warc/CC-MAIN-20191015055525-20191015083025-00071.warc.gz"}
|
https://pos.sissa.it/398/153/
|
Volume 398 - The European Physical Society Conference on High Energy Physics (EPS-HEP2021) - T03: Dark Matter
Sub-MeV Dark Matter Searches with EDELWEISS: results and prospects
H. Lattaud*, E. Armengaud, Q. Arnaud, C. Augier, A. Benoit, L. Bergé, J. Billard, A. Broniatowski, P. Camus, A. Cazes, M. Chapellier, F. Charlieux, M. De.Jesus, L. Dumoulin, K. Eitel, J.B. Fillipini, D. Filosofov, J. Gascon, A. Giuliani, M. Gros, Y. Jin, A. Juillard, M. Kleifges, S. Marnieros, D. Misiak, X.F. Navick, C. Nones, E. Olivieri, C. Oriol, P. Pari, B. Paul, D. Poda, S. Rozov, T. Salagnac, V. Sanglard, B. Siebenborn, L. Vagneron, M. Weber, E. Yakushev, A. Zolotarova on behalf of the Edelweiss collaborationet al. (click to show)
Full text: pdf
Pre-published on: January 12, 2022
Published on: May 12, 2022
Abstract
The Edelweiss collaboration performs light Dark Matter (DM) particles searches with germanium bolometers collecting
charge and phonon signals. Thanks to the Neganov-Trofimov-Luke effect, a RMS resolution of 0.56 electron-hole pair
was obtained on a massive (33.4g) germanium detector operated underground at the Laboratoire Souterrain de Modane.
This sensitiviy made possible a search for Dark Photons Down to 1 eV and for DM-electron interactions below 1 MeV/c$^2$.
It is the first measurement in cryogenic germanium at such low threshold proving the high relevance of this technology.
This is an important step of the development of the Ge detectors with improved performance in the context of the EDELWEISS-SubGeV program.
DOI: https://doi.org/10.22323/1.398.0153
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.
| 2022-08-13T12:09: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": 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.3676786720752716, "perplexity": 6774.271723799859}, "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-33/segments/1659882571950.76/warc/CC-MAIN-20220813111851-20220813141851-00756.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?node=S019F%2B&home=sumtabB
|
# ${{\boldsymbol \Sigma}^{+}}$ DECAY PARAMETERS
See the Note on Baryon Decay Parameters'' in the neutron Listings. A few early results have been omitted.
# $\phi _{+}$ ANGLE FOR ${{\boldsymbol \Sigma}^{+}}$ $\rightarrow$ ${{\boldsymbol n}}{{\boldsymbol \pi}^{+}}$ ($\phi _{+}$ = $\beta /\gamma$) INSPIRE search
VALUE ($^\circ{}$) EVTS DOCUMENT ID TECN COMMENT
$\bf{ 167 \pm20}$ OUR AVERAGE Error includes scale factor of 1.1.
$184$ $\pm24$ 1054 1
1970 B
HBC
$143$ $\pm29$ 560
1969 B
HBC ${{\mathit K}^{-}}{{\mathit p}}$ 0.4 ${\mathrm {GeV/}}\mathit c$
1 Changed from 176 to 184$^\circ{}$ to agree with our sign convention.
References:
BERLEY 1970B
PR D1 2015 Decay Parameters in the Nonleptonic Decay Modes of the Charged ${{\mathit \Sigma}}$ Hyperons
BANGERTER 1969B
PR 187 1821 Decay Parameters for ${{\mathit \Sigma}^{\pm}}$ $\rightarrow$ ${{\mathit n}}{{\mathit \pi}^{\pm}}$
| 2021-03-09T07:54:59 |
{"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.6360283493995667, "perplexity": 8415.190005365563}, "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/1614178389472.95/warc/CC-MAIN-20210309061538-20210309091538-00119.warc.gz"}
|
https://wiki.bnl.gov/eic/index.php?title=Roman_Pot_Sim&direction=prev&oldid=6201
|
# Roman Pot Sim
This page gives details of the Roman Pot simulations, which includes acceptance studies, momentum reconstruction studies, and the move towards a full mock analysis of DVCS. The process includes generation of physics events, importing physics events through EicRoot for GEANT tracking of particles through magnetic fields to the detectors, digitizing the raw hit information, and implementing a reconstruction algorithm to determine the pT of the proton from the hits in the Roman Pot. All of the steps have been implemented into a single script that can handle the workflow, which can be found at /direct/eic+u/rmpetti/workarea/roman_pots/condor/run_pot_sim_milou_jobs.csh. The basic steps in the simulation process are described in the sections below.
## MILOU sim
The first step in the simulation study is to generate DVCS physics events. Details of the MILOU Monte Carlo program can be found elsewhere. An example steering file used for this study can be found at /direct/eic+data/rmpetti/milou_sim/dvcs.steer. A quick note about this step. If one desires to run many jobs in parallel with Condor, it is necessary to change the seed for the random number generator that is specified in the steering file (denoted by the SEED keyword). A script (/direct/eic+u/rmpetti/workarea/roman_pots/condor/mod_steering_script.pl) has been written that will take as one of its arguments the desired seed (the script takes four arguments, seed, minimum t, maximum t, and number of events) that will regenerate the steering file automatically replacing the original value of the seed with the one used as an argument in running the script. As it is currently setup when running in Condor, the seed is passed by the process number that is automatically assigned to the Condor job through the scheduler.
Another note if running within Condor. MILOU will generate an integration table that is used for its calculations with BASES, with the table stored in the generated bases.data file. This is time consuming. To increase efficiency, the same bases.data file is used for all the jobs farmed out. In order to achieve this, MILOU first needs to be run once outside of Condor. The point here is just to generate the bases.data file, so it is sufficient to generate just one event. Within the steering file, the keyword IGEN must be set to 0 to generate the table from scratch. Then when running in Condor, the IGEN flag can be set to 4 and the existing bases.data table will be used. This is already setup if running the mod_steering_script.pl script referenced above.
## Divergence smearing
One of the effects that needs to be studied is the impact of the smearing of the angle of the outgoing protons due to the angular divergence of the beams at the IP. In principle, this effect will influence the momentum reconstruction resolution. This is an initial state effect in that the electrons and protons in the beam will collide with some angle compared with the nominal trajectories. This effect is approximated by adding a smearing only of the outgoing proton. This means that the MILOU events are generated with the electron and proton colliding head on, but then an extra rotation is applied, determined by the magnitude of the divergence. This should be sufficient for evaluating the effect of the momentum resolution, but may need to be handled in the initial collision for more detailed studies.
The divergence is calculated from the beam parameters obtained by the machine designers, specifically the (un-normalized) beam emittance, ε, and β*, via the equation $\displaystyle{ \sigma_\theta = \sqrt{\varepsilon/\beta^*} }$. This formula is used to generate the angle which the outgoing proton will be rotated. The angle is chosen randomly from a Gaussian distribution with a width equal to the calculated εθ. The script /direct/eic+u/rmpetti/workarea/roman_pots/MCafterburners/addDivergence.C will take in as input, the ASCII file generated by running MILOU in the previous step and will output a modified event record with the proton rotated by the specified angle. The script also takes in the (un-normalized) emittance and β* in both the x and y direction to calculate the magnitude of the divergence in each direction separately.
## Roman Pot setup
The next described step is the construction of the Roman Pot systems. This can be done by running the script /direct/eic+u/rmpetti/workarea/roman_pots/detectorSetup/tracker.C. This takes many arguments as detailed in the defined function in the script. The script allows for the construction of the Roman Pot through all the arguments supplied, including the position along the lattice in x and z, the rotation of the pot so that the beam comes in perpendicular to the sensors, the denoting of how many layers of sensors should be included in the station and the size of the rectangular "hole" that represents the gap in acceptance due to how close the pots can be placed to the beam (currently assumed to be 10σ of the beam width from the core of the beam and determined from the emittance and β function). Each station is also given an index through the arguments. This script needs to be run inside ROOT. Some more general information of constructing detector geometries inside EicRoot can be found here.
## EicRoot simulation
The next step is to run the GEANT tracking of the events through the magnet setup and the Roman Pots within the EicRoot package. An example script to handle this is found at /direct/eic+u/rmpetti/workarea/roman_pots/sim/simulation.C. This script will use the events generated above in step 1, as well as the detector constructs from step 3. Additionally, the magnetic setup in the IR needs to be defined. Some general information on the importing of magnetic fields into EicRoot can be found here or here.
If one wants to study the effect of the angular divergence, then this step needs to be performed twice. The simulation.C macro will be run once on the event record without divergence and run again on the event record with divergence. The output of simulation.C WITHOUT divergence is simply used to gain access to the original, un-smeared, proton pT and to pass this value along the simulation chain. The actual detector hits that will be analyzed later for acceptance and momentum reconstruction studies will utilize the output of simulation.C WITH divergence applied.
In both cases, the output of simulation.C is a ROOT file containing the standardized EICTree format used by the BNL EIC Task Force group.
## Digitizing hits
The next step is performed to add an additional layer of reality to the simulation. Rather than use the raw exact hits of the protons in the sensors, a digitized hit is used, which takes into account the pixelation of the detector sensor. This step is applied by running the macro /direct/eic+u/rmpetti/workarea/roman_pots/sim/digitization.C. The pixel size in x and y can be adjusted within this script. This macro takes in the output of the previous simulation step and outputs another ROOT file containing TTrees with the hit information in each Roman Pot station. If it is desired to study the effect of divergence, this macro needs to be run with the simulated file which includes the divergence. For more general information on the digitization step in EicRoot, please consult this page.
| 2022-12-01T03:01: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": 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.4961516261100769, "perplexity": 826.2494880875373}, "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/1669446710789.95/warc/CC-MAIN-20221201021257-20221201051257-00573.warc.gz"}
|
https://par.nsf.gov/biblio/10058298-measurements-mathrm-mathrm-rightarrow-mathrm-mathrm-ppzz-production-cross-section-mathrm-rightarrow-ell-z4-branching-fraction-constraints-anomalous-triple-gauge-couplings-sqrt-text-tev
|
Measurements of the $$\mathrm {p}\mathrm {p}\rightarrow \mathrm{Z}\mathrm{Z}$$pp→ZZ production cross section and the $$\mathrm{Z}\rightarrow 4\ell$$Z→4ℓ branching fraction, and constraints on anomalous triple gauge couplings at $$\sqrt{s} = 13\,\text {TeV}$$s=13TeV
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10058298
Journal Name:
The European Physical Journal C
Volume:
78
Issue:
2
ISSN:
1434-6044
1. 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 »
2. 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 »
| 2022-06-26T19:50: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": 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.9624890089035034, "perplexity": 3701.2443898413335}, "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/1656103271864.14/warc/CC-MAIN-20220626192142-20220626222142-00375.warc.gz"}
|
https://www.usgs.gov/media/images/mapping-insar-displacement
|
# Mapping InSAR Displacement
### Detailed Description
Interpreting interferograms is a three-step process. The first step is to map the InSAR displacement. This is done by counting the number of InSAR fringes between two points on the interferogram, where one fringe is one complete color cycle (i.e. red, orange, yellow, green, blue, purple).
Public Domain.
| 2022-07-07T09:01:53 |
{"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.8336806893348694, "perplexity": 3621.6824606053956}, "config": {"markdown_headings": true, "markdown_code": false, "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/1656104683708.93/warc/CC-MAIN-20220707063442-20220707093442-00530.warc.gz"}
|
https://phys.libretexts.org/Bookshelves/College_Physics/Book%3A_College_Physics_(OpenStax)/13%3A_Temperature%2C_Kinetic_Theory%2C_and_the_Gas_Laws/13.5%3A_Phase_Changes
|
Skip to main content
$$\require{cancel}$$
# 13.5: Phase Changes
Up to now, we have considered the behavior of ideal gases. Real gases are like ideal gases at high temperatures. At lower temperatures, however, the interactions between the molecules and their volumes cannot be ignored. The molecules are very close (condensation occurs) and there is a dramatic decrease in volume, as seen in Figure $$\PageIndex{1}$$. The substance changes from a gas to a liquid. When a liquid is cooled to even lower temperatures, it becomes a solid. The volume never reaches zero because of the finite volume of the molecules.
Figure $$\PageIndex{1}$$: A sketch of volume versus temperature for a real gas at constant pressure. The linear (straight line) part of the graph represents ideal gas behavior—volume and temperature are directly and positively related and the line extrapolates to zero volume at $$273.15^oC$$, or absolute zero. When the gas becomes a liquid, however, the volume actually decreases precipitously at the liquefaction point. The volume decreases slightly once the substance is solid, but it never becomes zero.
High pressure may also cause a gas to change phase to a liquid. Carbon dioxide, for example, is a gas at room temperature and atmospheric pressure, but becomes a liquid under sufficiently high pressure. If the pressure is reduced, the temperature drops and the liquid carbon dioxide solidifies into a snow-like substance at the temperature $$-78^oC$$. Solid $$CO_2$$ is called “dry ice.” Another example of a gas that can be in a liquid phase is liquid nitrogen $$(LN_2)$$. $$LN_2$$ is made by liquefaction of atmospheric air (through compression and cooling). It boils at 77 K $$(-196^oC)$$ at atmospheric pressure. $$LN_2$$ is useful as a refrigerant and allows for the preservation of blood, sperm, and other biological materials. It is also used to reduce noise in electronic sensors and equipment, and to help cool down their current-carrying wires. In dermatology, $$LN_2$$ is used to freeze and painlessly remove warts and other growths from the skin.
# PV Diagrams
We can examine aspects of the behavior of a substance by plotting a graph of pressure versus volume, called a PV diagram. When the substance behaves like an ideal gas, the ideal gas law describes the relationship between its pressure and volume. That is,
$PV = NkT \, (ideal \, gas).$
Now, assuming the number of molecules and the temperature are fixed,
$PV - constant \, (ideal \, gas, \, constant \, temperature).$
For example, the volume of the gas will decrease as the pressure increases. If you plot the relationship $$PV$$ = constant on a $$PV$$ diagram, you find a hyperbola. Figure $$\PageIndex{2}$$ shows a graph of pressure versus volume. The hyperbolas represent ideal-gas behavior at various fixed temperatures, and are called isotherms. At lower temperatures, the curves begin to look less like hyperbolas—the gas is not behaving ideally and may even contain liquid. There is a critical point—that is, a critical temperature—above which liquid cannot exist. At sufficiently high pressure above the critical point, the gas will have the density of a liquid but will not condense. Carbon dioxide, for example, cannot be liquefied at a temperature above $$31.0^oC$$. Critical pressure is the minimum pressure needed for liquid to exist at the critical temperature. Table $$\PageIndex{1}$$ lists representative critical temperatures and pressures.
Figure $$\PageIndex{2}$$: $$PV$$ diagrams. (a) Each curve (isotherm) represents the relationship between $$P$$ and $$V$$ at a fixed temperature; the upper curves are at higher temperatures. The lower curves are not hyperbolas, because the gas is no longer an ideal gas. (b) An expanded portion of the $$PV$$ diagram for low temperatures, where the phase can change from a gas to a liquid. The term “vapor” refers to the gas phase when it exists at a temperature below the boiling temperature.
Table $$\PageIndex{1}$$: Critical Temperatures and Pressures
Substance Critical Temperature Critical pressure
$$K$$ $$^oC$$ $$Pa$$ $$atm$$
Water 647.4 374.3 $$22.12 \times 10^6$$ 219.0
Sulfur dioxide 430.7 157.6 $$7.88 \times 10^6$$ 78.0
Ammonia 405.5 132.4 $$11.28 \times 10^6$$ 111.7
Carbon dioxide 304.2 31.1 $$7.39 \times 10^6$$ 73.2
Oxygen 154.8 −118.4 $$5.08 \times 10^6$$ 50.3
Nitrogen 126.2 −146.9 $$3.39 \times 10^6$$ 33.6
Hydrogen 33.3 −239.9 $$1.30 \times 10^6$$ 12.9
Helium 5.3 −267.9 $$0.229 \times 10^6$$ 2.27
### Phase Diagrams
The plots of pressure versus temperatures provide considerable insight into thermal properties of substances. There are well-defined regions on these graphs that correspond to various phases of matter, so $$PT$$ graphs are called phase diagrams. Figure $$\PageIndex{3}$$ shows the phase diagram for water. Using the graph, if you know the pressure and temperature you can determine the phase of water. The solid lines—boundaries between phases—indicate temperatures and pressures at which the phases coexist (that is, they exist together in ratios, depending on pressure and temperature). For example, the boiling point of water is $$100^oC$$ at 1.00 atm. As the pressure increases, the boiling temperature rises steadily to $$374^oC$$ at a pressure of 218 atm. A pressure cooker (or even a covered pot) will cook food faster because the water can exist as a liquid at temperatures greater than $$100^oC$$ without all boiling away. The curve ends at a point called the critical point, because at higher temperatures the liquid phase does not exist at any pressure. The critical point occurs at the critical temperature, as you can see for water from Table. The critical temperature for oxygen is $$-118^oC$$, so oxygen cannot be liquefied above this temperature.
Figure $$\PageIndex{3}$$: The phase diagram ($$PT$$ graph) for water. Note that the axes are nonlinear and the graph is not to scale. This graph is simplified—there are several other exotic phases of ice at higher pressures.
Similarly, the curve between the solid and liquid regions in Figure gives the melting temperature at various pressures. For example, the melting point is $$0^oC$$ at 1.00 atm, as expected. Note that, at a fixed temperature, you can change the phase from solid (ice) to liquid (water) by increasing the pressure. Ice melts from pressure in the hands of a snowball maker. From the phase diagram, we can also say that the melting temperature of ice rises with increased pressure. When a car is driven over snow, the increased pressure from the tires melts the snowflakes; afterwards the water refreezes and forms an ice layer.
At sufficiently low pressures there is no liquid phase, but the substance can exist as either gas or solid. For water, there is no liquid phase at pressures below 0.00600 atm. The phase change from solid to gas is called sublimation. It accounts for large losses of snow pack that never make it into a river, the routine automatic defrosting of a freezer, and the freeze-drying process applied to many foods. Carbon dioxide, on the other hand, sublimates at standard atmospheric pressure of 1 atm. (The solid form of $$CO_2$$ is known as dry ice because it does not melt. Instead, it moves directly from the solid to the gas state.)
All three curves on the phase diagram meet at a single point, the triple point, where all three phases exist in equilibrium. For water, the triple point occurs at 273.16 K $$(0.01^oC)$$ and is a more accurate calibration temperature than the melting point of water at 1.00 atm, or 273.15 K $$(0.0^oC)$$. See Table for the triple point values of other substances.
# Equilibrium
Liquid and gas phases are in equilibrium at the boiling temperature. (See Figure.) If a substance is in a closed container at the boiling point, then the liquid is boiling and the gas is condensing at the same rate without net change in their relative amount. Molecules in the liquid escape as a gas at the same rate at which gas molecules stick to the liquid, or form droplets and become part of the liquid phase. The combination of temperature and pressure has to be “just right”; if the temperature and pressure are increased, equilibrium is maintained by the same increase of boiling and condensation rates.
Figure $$\PageIndex{4}$$: Equilibrium between liquid and gas at two different boiling points inside a closed container. (a) The rates of boiling and condensation are equal at this combination of temperature and pressure, so the liquid and gas phases are in equilibrium. (b) At a higher temperature, the boiling rate is faster and the rates at which molecules leave the liquid and enter the gas are also faster. Because there are more molecules in the gas, the gas pressure is higher and the rate at which gas molecules condense and enter the liquid is faster. As a result the gas and liquid are in equilibrium at this higher temperature.
Table $$\PageIndex{2}$$: Triple Point Temperatures and Pressures
Substance Temperature Pressure
$$K$$ $$^oC$$ Pa atm
Water 273.16 0.01 $$6.10 \times 10^2$$ 0.00600
Carbon dioxide 216.55 −56.60 $$5.16 \times 10^5$$ 5.11
Sulfur dioxide 197.68 −75.47 $$1.67 \times 10^3$$ 0.0167
Ammonia 195.40 −77.75 $$6.06 \times 10^3$$ 0.0600
Nitrogen 63.18 −210.0 $$1.25 \times 10^4$$ 0.124
Oxygen 54.36 −218.8 $$1.52 \times 10^2$$ 0.00151
Hydrogen 13.84 −259.3 $$7.04 \times 10^3$$ 0.0697
One example of equilibrium between liquid and gas is that of water and steam at $$100^oC$$ and 1.00 atm. This temperature is the boiling point at that pressure, so they should exist in equilibrium. Why does an open pot of water at $$100^oC$$ boil completely away? The gas surrounding an open pot is not pure water: it is mixed with air. If pure water and steam are in a closed container at $$100^oC$$ and 1.00 atm, they would coexist—but with air over the pot, there are fewer water molecules to condense, and water boils. What about water at $$20.0^oC$$ and 1.00 atm? This temperature and pressure correspond to the liquid region, yet an open glass of water at this temperature will completely evaporate. Again, the gas around it is air and not pure water vapor, so that the reduced evaporation rate is greater than the condensation rate of water from dry air. If the glass is sealed, then the liquid phase remains. We call the gas phase a vapor when it exists, as it does for water at $$20.0^oC$$, at a temperature below the boiling temperature.
Exercise $$\PageIndex{1}$$: Check your Understanding
Explain why a cup of water (or soda) with ice cubes stays at $$0^oC$$, even on a hot summer day.
Answer
The ice and liquid water are in thermal equilibrium, so that the temperature stays at the freezing temperature as long as ice remains in the liquid. (Once all of the ice melts, the water temperature will start to rise.)P
# Vapor Pressure, Partial Pressure, and Dalton’s Law
Vapor pressure is defined as the pressure at which a gas coexists with its solid or liquid phase. Vapor pressure is created by faster molecules that break away from the liquid or solid and enter the gas phase. The vapor pressure of a substance depends on both the substance and its temperature—an increase in temperature increases the vapor pressure.
Partial pressure is defined as the pressure a gas would create if it occupied the total volume available. In a mixture of gases, the total pressure is the sum of partial pressures of the component gases, assuming ideal gas behavior and no chemical reactions between the components. This law is known as Dalton’s law of partial pressures, after the English scientist John Dalton (1766–1844), who proposed it. Dalton’s law is based on kinetic theory, where each gas creates its pressure by molecular collisions, independent of other gases present. It is consistent with the fact that pressures add according to Pascal’s Principle. Thus water evaporates and ice sublimates when their vapor pressures exceed the partial pressure of water vapor in the surrounding mixture of gases. If their vapor pressures are less than the partial pressure of water vapor in the surrounding gas, liquid droplets or ice crystals (frost) form.
Exercise $$\PageIndex{1}$$: Check Your Understanding
Is energy transfer involved in a phase change? If so, will energy have to be supplied to change phase from solid to liquid and liquid to gas? What about gas to liquid and liquid to solid? Why do they spray the orange trees with water in Florida when the temperatures are near or just below freezing?
Answer
Yes, energy transfer is involved in a phase change. We know that atoms and molecules in solids and liquids are bound to each other because we know that force is required to separate them. So in a phase change from solid to liquid and liquid to gas, a force must be exerted, perhaps by collision, to separate atoms and molecules. Force exerted through a distance is work, and energy is needed to do work to go from solid to liquid and liquid to gas. This is intuitively consistent with the need for energy to melt ice or boil water. The converse is also true. Going from gas to liquid or liquid to solid involves atoms and molecules pushing together, doing work and releasing energy.
PHET EXPLORATIONS: STATES OF MATTER - BASICS
Heat, cool, and compress atoms and molecules and watch as they change between solid, liquid, and gas phases.
Figure 13.6.5. States of Matter: Basics
# Section Summary
• Most substances have three distinct phases: gas, liquid, and solid.
• Phase changes among the various phases of matter depend on temperature and pressure.
• The existence of the three phases with respect to pressure and temperature can be described in a phase diagram.
• Two phases coexist (i.e., they are in thermal equilibrium) at a set of pressures and temperatures. These are described as a line on a phase diagram.
• The three phases coexist at a single pressure and temperature. This is known as the triple point and is described by a single point on a phase diagram.
• A gas at a temperature below its boiling point is called a vapor.
• Vapor pressure is the pressure at which a gas coexists with its solid or liquid phase.
• Partial pressure is the pressure a gas would create if it existed alone.
• Dalton’s law states that the total pressure is the sum of the partial pressures of all of the gases present.
## Glossary
PV diagram
a graph of pressure vs. volume
critical point
the temperature above which a liquid cannot exist
critical temperature
the temperature above which a liquid cannot exist
critical pressure
the minimum pressure needed for a liquid to exist at the critical temperature
vapor
a gas at a temperature below the boiling temperature
vapor pressure
the pressure at which a gas coexists with its solid or liquid phase
phase diagram
a graph of pressure vs. temperature of a particular substance, showing at which pressures and temperatures the three phases of the substance occur
triple point
the pressure and temperature at which a substance exists in equilibrium as a solid, liquid, and gas
sublimation
the phase change from solid to gas
partial pressure
the pressure a gas would create if it occupied the total volume of space available
Dalton’s law of partial pressures
the physical law that states that the total pressure of a gas is the sum of partial pressures of the component gases
## Contributors
Paul Peter Urone (Professor Emeritus at California State University, Sacramento) and Roger Hinrichs (State University of New York, College at Oswego) with Contributing Authors: Kim Dirks (University of Auckland) and Manjula Sharma (University of Sydney). This work is licensed by OpenStax University Physics under a Creative Commons Attribution License (by 4.0).
| 2019-05-20T13:28:53 |
{"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.5999532341957092, "perplexity": 643.6163582319605}, "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-2019-22/segments/1558232255944.3/warc/CC-MAIN-20190520121941-20190520143941-00335.warc.gz"}
|
https://wiki.bnl.gov/eic/index.php?title=RAPGAP
|
# RAPGAP
DEPRECATED - PLEASE REFER TO https://eic.github.io/software/rapgap.html
## Documentation on RAPGAP
RAPGAP is a MC generator which can be used to generate both DIS and Diffractive e+p events.
## Running RAPGAP
This has been installed in the eic region at:
/afs/rhic.bnl.gov/eic/PACKAGES/RAPGAP-3.2/
When you run RAPGAP, you will create large text files as output. Therefore, in order to run this, you should do so from the DATA directory.
So, firstly, create a directory in this region:
mkdir /afs/rhic.bnl.gov/eic/DATA/<username>
Once this is done, inside the directory, you should create a soft link to the rapgap executable code:
ln -s /afs/rhic.bnl.gov/eic/PACKAGES/RAPGAP-3.2-32BIT/bin/rapgap rapgap
Now, you need to copy the steer file from the RAPGAP directory to your own directory, so you can edit it and run what you wish.
This is done via:
cp /afs/rhic.bnl.gov/eic/PACKAGES/RAPGAP-3.2-32BIT/data/steer .
Once this is done, you are ready to run. Once you have edited the file, then you run with the command:
./rapgap < steer >&! rapgap.log
This creates a text file named rapgap.txt with the raw rapgap output. At this point, you are ready to create a ROOT tree and analyse your data.
### Output file structure
the output file (rapgap.txt) is in a text format which has the following structure.
• 1st line: RAPGAP EVENT FILE
• 2nd line: "============================================"
• 3rd line: Information on event wise variables stored in the file
I: 0 (line index) ievent: eventnumber running from 1 to XXX genevent: trials to generate this event subprocess: generated subprocess, for details see page in the rapgap-manual idir: select type of events to be generated = 1 standard inelastic scattering = 0 diffractive and pion exchange processes idisdif: mixing of standard inelastic scattering, diffractive and pion exchange processes according to cross section 0 generates only the processes selected by IDIR. 1 mixing of standard inelastic and diffractive processes. 2 mixing of standard inelastic, diffractive and pion exchange processes cross section: integrated cross section error on cross section: standard deviation of integrated cross section s: total center of mass energy Q2, y: in lepto-production: actual Q2 of γ; energy fraction lost by incident electron If radiative corrections are turned on they are different from what is calculated from the scattered lepton. If radiative corrections are turned off they are the same as what is calculated from the scattered lepton xgam: energy fraction of parton on electron side xpr: energy fraction of parton on proton side pt_hat: phat_⊥ [GeV/c] of parton in hard subprocess cm system pt2_hat: phat^2_⊥ [GeV2/c2] of parton in hard subprocess cm system s_hat: invariant mass ˆs [GeV2] of hard subprocess t_hat: for diffractive processes T2GKI = t [GeV2] x_pom: for diffractive processes XFGKI = xIP s_hat: shat of hard subprocess z: z = p_i*p_f/p_i*q = ZQGKI x: xp = Q2/2p_i*q = XPGKI phi: φ = PHIGKI azimuthal angle nrTracks: number of tracks in this event, includes also virtual particles
• 4th line: "============================================"
• 5th line: Information on track wise variables stored in the file
I: line index, runs from 1 to nrTracks K(I,1): status code KS (1: stable particles 11: particles which decay 55; radiative photon) K(I,2): particle KF code (211: pion, 2112:n, ....) K(I,3): line number of parent particle K(I,4): normally the line number of the first daughter; it is 0 for an undecayed particle or unfragmented parton K(I,5): normally the line number of the last daughter; it is 0 for an undecayed particle or unfragmented parton. P(I,1): px of particle P(I,2): py of particle P(I,3): pz of particle P(I,4): Energy of particle P(I,5): mass of particle V(I,1): x vertex information V(I,2): y vertex information V(I,3): z vertex information
• 6th line: "============================================"
• 7th line: event information for first event
• 8th line: "============================================"
• 9th to X-1 line: trackwise info of 1st event
• Xth line "=============== Event finished ==============="
the information from line 7 to X repeats for each event.
### How to analyze events
• create a root tree
there are root macros available to convert the output txt-files into root trees.
Details how to run the macros can be found [here]
| 2022-11-27T03:01:09 |
{"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.42032960057258606, "perplexity": 9620.457991275041}, "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-49/segments/1669446710155.67/warc/CC-MAIN-20221127005113-20221127035113-00074.warc.gz"}
|
https://par.nsf.gov/biblio/10362533-pair-sub-neptunes-transiting-bright-dwarf-toi-characterized-cheops
|
A pair of sub-Neptunes transiting the bright K-dwarf TOI-1064 characterized with CHEOPS
ABSTRACT
We report the discovery and characterization of a pair of sub-Neptunes transiting the bright K-dwarf TOI-1064 (TIC 79748331), initially detected in the Transiting Exoplanet Survey Satellite (TESS) photometry. To characterize the system, we performed and retrieved the CHaracterising ExOPlanets Satellite (CHEOPS), TESS, and ground-based photometry, the High Accuracy Radial velocity Planet Searcher (HARPS) high-resolution spectroscopy, and Gemini speckle imaging. We characterize the host star and determine $T_{\rm eff, \star }=4734\pm 67\,\mathrm{ K}$, $R_{\star }=0.726\pm 0.007\, \mathrm{ R}_{\odot }$, and $M_{\star }=0.748\pm 0.032\, \mathrm{ M}_{\odot }$. We present a novel detrending method based on point spread function shape-change modelling and demonstrate its suitability to correct flux variations in CHEOPS data. We confirm the planetary nature of both bodies and find that TOI-1064 b has an orbital period of Pb = 6.44387 ± 0.00003 d, a radius of Rb = 2.59 ± 0.04 R⊕, and a mass of $M_{\rm b} = 13.5_{-1.8}^{+1.7}$ M⊕, whilst TOI-1064 c has an orbital period of $P_{\rm c} = 12.22657^{+0.00005}_{-0.00004}$ d, a radius of Rc = 2.65 ± 0.04 R⊕, and a 3σ upper mass limit of 8.5 M⊕. From the high-precision photometry we obtain radius uncertainties of ∼1.6 per cent, allowing us to conduct internal structure and atmospheric escape modelling. TOI-1064 b is one of the densest, well-characterized sub-Neptunes, with more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Publication Date:
NSF-PAR ID:
10362533
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
511
Issue:
1
Page Range or eLocation-ID:
p. 1043-1071
ISSN:
0035-8711
Publisher:
Oxford University Press
National Science Foundation
##### More Like this
1. ABSTRACT
We present ground- and space-based photometric observations of TOI-270 (L231-32), a system of three transiting planets consisting of one super-Earth and two sub-Neptunes discovered by TESS around a bright (K-mag = 8.25) M3V dwarf. The planets orbit near low-order mean-motion resonances (5:3 and 2:1) and are thus expected to exhibit large transit timing variations (TTVs). Following an extensive observing campaign using eight different observatories between 2018 and 2020, we now report a clear detection of TTVs for planets c and d, with amplitudes of ∼10 min and a super-period of ∼3 yr, as well as significantly refined estimates of the radii and mean orbital periods of all three planets. Dynamical modelling of the TTVs alone puts strong constraints on the mass ratio of planets c and d and on their eccentricities. When incorporating recently published constraints from radial velocity observations, we obtain masses of $M_{\mathrm{b}}=1.48\pm 0.18\, M_\oplus$, $M_{\mathrm{c}}=6.20\pm 0.31\, M_\oplus$, and $M_{\mathrm{d}}=4.20\pm 0.16\, M_\oplus$ for planets b, c, and d, respectively. We also detect small but significant eccentricities for all three planets : eb = 0.0167 ± 0.0084, ec = 0.0044 ± 0.0006, and ed = 0.0066 ± 0.0020. Our findings imply an Earth-like rocky composition for the inner planet, and Earth-like cores with an additional He/H2O atmosphere for the outermore »
2. ABSTRACT
We present the discovery of TOI-2136 b, a sub-Neptune planet transiting a nearby M4.5V-type star every 7.85 d, identified through photometric measurements from the Transiting Exoplanet Survey Satellite (TESS) mission. The host star is located 33 pc away with a radius of R* = 0.34 ± 0.02 R⊙, a mass of $0.34\pm 0.02 \, \mathrm{M}_{\odot }$, and an effective temperature of 3342 ± 100 K. We estimate its stellar rotation period to be 75 ± 5 d based on archival long-term photometry. We confirm and characterize the planet based on a series of ground-based multiwavelength photometry, high-angular-resolution imaging observations, and precise radial velocities from Canada–France–Hawaii Telescope (CFHT)/SpectroPolarimètre InfraROUge (SPIRou). Our joint analysis reveals that the planet has a radius of 2.20 ± 0.17 R⊕ and a mass of 6.4 ± 2.4 M⊕. The mass and radius of TOI-2136 b are consistent with a broad range of compositions, from water-ice to gas-dominated worlds. TOI-2136 b falls close to the radius valley for M dwarfs predicted by thermally driven atmospheric mass-loss models, making it an interesting target for future studies of its interior structure and atmospheric properties.
3. ABSTRACT We report the discovery of a warm sub-Saturn, TOI-257b (HD 19916b), based on data from NASA’s Transiting Exoplanet Survey Satellite (TESS). The transit signal was detected by TESS and confirmed to be of planetary origin based on radial velocity observations. An analysis of the TESS photometry, the Minerva-Australis, FEROS, and HARPS radial velocities, and the asteroseismic data of the stellar oscillations reveals that TOI-257b has a mass of MP = 0.138 ± 0.023 $\rm {M_J}$ (43.9 ± 7.3 $\, M_{\rm \oplus}$), a radius of RP = 0.639 ± 0.013 $\rm {R_J}$ (7.16 ± 0.15 $\, \mathrm{ R}_{\rm \oplus}$), bulk density of $0.65^{+0.12}_{-0.11}$ (cgs), and period $18.38818^{+0.00085}_{-0.00084}$ $\rm {days}$. TOI-257b orbits a bright (V = 7.612 mag) somewhat evolved late F-type star with M* = 1.390 ± 0.046 $\rm {M_{sun}}$, R* = 1.888 ± 0.033 $\rm {R_{sun}}$, Teff = 6075 ± 90 $\rm {K}$, and vsin i = 11.3 ± 0.5 km s−1. Additionally, we find hints for a second non-transiting sub-Saturn mass planet on a ∼71 day orbit using the radial velocity data. This system joins the ranks of a small number of exoplanet host stars (∼100) that have been characterized with asteroseismology. Warm sub-Saturns are rare in the known sample of exoplanets, and thus the discovery of TOI-257b is important in the context of future work studying the formation and migration history of similar planetary systems.
4. ABSTRACT We report on the discovery and validation of TOI 813 b (TIC 55525572 b), a transiting exoplanet identified by citizen scientists in data from NASA’s Transiting Exoplanet Survey Satellite (TESS) and the first planet discovered by the Planet Hunters TESS project. The host star is a bright (V = 10.3 mag) subgiant ($R_\star =1.94\, R_\odot$, $M_\star =1.32\, M_\odot$). It was observed almost continuously by TESS during its first year of operations, during which time four individual transit events were detected. The candidate passed all the standard light curve-based vetting checks, and ground-based follow-up spectroscopy and speckle imaging enabled us to place an upper limit of $2\, M_{\rm Jup}$ (99 per cent confidence) on the mass of the companion, and to statistically validate its planetary nature. Detailed modelling of the transits yields a period of $83.8911 _{ - 0.0031 } ^ { + 0.0027 }$ d, a planet radius of 6.71 ± 0.38 R⊕ and a semimajor axis of $0.423 _{ - 0.037 } ^ { + 0.031 }$ AU. The planet’s orbital period combined with the evolved nature of the host star places this object in a relatively underexplored region of parameter space. We estimate that TOI 813 b induces a reflex motion in its host star with a semi-amplitude of ∼6 m s−1, makingmore »
5. ABSTRACT
We present a precise characterization of the TOI-561 planetary system obtained by combining previously published data with TESS and CHEOPS photometry, and a new set of 62 HARPS-N radial velocities (RVs). Our joint analysis confirms the presence of four transiting planets, namely TOI-561 b (P = 0.45 d, R = 1.42 R⊕, M = 2.0 M⊕), c (P = 10.78 d, R = 2.91 R⊕, M = 5.4 M⊕), d (P = 25.7 d, R = 2.82 R⊕, M = 13.2 M⊕), and e (P = 77 d, R = 2.55 R⊕, M = 12.6 R⊕). Moreover, we identify an additional, long-period signal (>450 d) in the RVs, which could be due to either an external planetary companion or to stellar magnetic activity. The precise masses and radii obtained for the four planets allowed us to conduct interior structure and atmospheric escape modelling. TOI-561 b is confirmed to be the lowest density (ρb = 3.8 ± 0.5 g cm−3) ultra-short period (USP) planet known to date, and the low metallicity of the host star makes it consistent with the general bulk density-stellar metallicity trend. According to our interior structure modelling, planet b has basically no gas envelope, and it could host a certain amount of water. In contrast, TOI-561 c, d, and e likely retainedmore »
| 2023-02-02T02:55:07 |
{"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.6180641055107117, "perplexity": 3081.5989992291456}, "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/1674764499954.21/warc/CC-MAIN-20230202003408-20230202033408-00235.warc.gz"}
|
https://par.nsf.gov/biblio/10367851-fast-rising-tidal-disruption-event-from-candidate-intermediate-mass-black-hole
|
This content will become publicly available on August 31, 2023
A fast rising tidal disruption event from a candidate intermediate mass black hole
Massive black holes (BHs) at the centres of massive galaxies are ubiquitous. The population of BHs within dwarf galaxies, on the other hand, is evasive. Dwarf galaxies are thought to harbour BHs with proportionally small masses, including intermediate mass BHs, with masses 102
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10367851
Journal Name:
ArXivorg
ISSN:
2331-8422
4. Abstract We review the current knowledge about nuclear star clusters (NSCs), the spectacularly dense and massive assemblies of stars found at the centers of most galaxies. Recent observational and theoretical works suggest that many NSC properties, including their masses, densities, and stellar populations, vary with the properties of their host galaxies. Understanding the formation, growth, and ultimate fate of NSCs, therefore, is crucial for a complete picture of galaxy evolution. Throughout the review, we attempt to combine and distill the available evidence into a coherent picture of NSC evolution. Combined, this evidence points to a clear transition mass in galaxies of $$\sim 10^9\,M_\odot$$ ∼ 10 9 M ⊙ where the characteristics of nuclear star clusters change. We argue that at lower masses, NSCs are formed primarily from globular clusters that inspiral into the center of the galaxy, while at higher masses, star formation within the nucleus forms the bulk of the NSC. We also discuss the co-existence of NSCs and central black holes, and how their growth may be linked. The extreme densities of NSCs and their interaction with massive black holes lead to a wide range of unique phenomena including tidal disruption and gravitational-wave events. Finally, we review themore »
| 2023-02-01T20:12: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": 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.4169060289859772, "perplexity": 2296.6622070717}, "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/1674764499949.24/warc/CC-MAIN-20230201180036-20230201210036-00237.warc.gz"}
|
https://dlmf.nist.gov/35.7
|
# §35.7 Gaussian Hypergeometric Function of Matrix Argument
## §35.7(i) Definition
35.7.1 ${{{}_{2}F_{1}}\left({a,b\atop c};\mathbf{T}\right)=\sum_{k=0}^{\infty}\frac{1}% {k!}\sum_{|\kappa|=k}\frac{{\left[a\right]_{\kappa}}{\left[b\right]_{\kappa}}}% {{\left[c\right]_{\kappa}}}Z_{\kappa}\left(\mathbf{T}\right)},$ $-c+\frac{1}{2}(j+1)\notin\mathbb{N}$, $1\leq j\leq m$; $\|\mathbf{T}\|<1$.
### Jacobi Form
35.7.2 $P^{(\gamma,\delta)}_{\nu}\left(\mathbf{T}\right)=\frac{\Gamma_{m}\left(\gamma+% \nu+\frac{1}{2}(m+1)\right)}{\Gamma_{m}\left(\gamma+\frac{1}{2}(m+1)\right)}\*% {{}_{2}F_{1}}\left({-\nu,\gamma+\delta+\nu+\frac{1}{2}(m+1)\atop\gamma+\frac{1% }{2}(m+1)};\mathbf{T}\right),$ $\boldsymbol{{0}}<\mathbf{T}<\mathbf{I}$; $\gamma,\delta,\nu\in\mathbb{C}$; $\Re\left(\gamma\right)>-1$.
## §35.7(ii) Basic Properties
### Case $m=2$
35.7.3 ${{}_{2}F_{1}}\left({a,b\atop c};\begin{bmatrix}t_{1}&0\\ 0&t_{2}\end{bmatrix}\right)=\sum_{k=0}^{\infty}\frac{{\left(a\right)_{k}}{% \left(c-a\right)_{k}}{\left(b\right)_{k}}{\left(c-b\right)_{k}}}{k!\,{\left(c% \right)_{2k}}{\left(c-\tfrac{1}{2}\right)_{k}}}\*(t_{1}t_{2})^{k}{{}_{2}F_{1}}% \left({a+k,b+k\atop c+2k};t_{1}+t_{2}-t_{1}t_{2}\right).$ ⓘ Symbols: ${{}_{\NVar{p}}F_{\NVar{q}}}\left(\NVar{a_{1},\dots,a_{p}};\NVar{b_{1},\dots,b_% {q}};\NVar{\mathbf{T}}\right)$ or ${{}_{\NVar{p}}F_{\NVar{q}}}\left({\NVar{a_{1},\dots,a_{p}}\atop\NVar{b_{1},% \dots,b_{q}}};\NVar{\mathbf{T}}\right)$: generalized hypergeometric function of matrix argument, ${\left(\NVar{a}\right)_{\NVar{n}}}$: Pochhammer’s symbol (or shifted factorial), $!$: factorial (as in $n!$), $a$: complex variable, $t_{j}$: eigenvalues of $\mathbf{T}$, $b$: complex variable, $c$: complex variable and $k$: nonnegative integer Referenced by: Erratum (V1.0.25) for Equation (35.7.3) Permalink: http://dlmf.nist.gov/35.7.E3 Encodings: TeX, pMML, png Notational change (effective with 1.0.25): Originally the matrix in the argument of the Gaussian hypergeometric function of matrix argument ${{}_{2}F_{1}}$ was written with round brackets. This matrix has been rewritten with square brackets to be consistent with the rest of the DLMF. See also: Annotations for §35.7(ii), §35.7(ii), §35.7 and Ch.35
### Confluent Form
35.7.4 $\lim_{c\to\infty}{{}_{2}F_{1}}\left({a,b\atop c};\mathbf{I}-c\mathbf{T}^{-1}% \right)=\left|\mathbf{T}\right|^{b}\Psi\left(b;b-a+\tfrac{1}{2}(m+1);\mathbf{T% }\right).$
### Integral Representation
35.7.5 ${{}_{2}F_{1}}\left({a,b\atop c};\mathbf{T}\right)=\frac{1}{\mathrm{B}_{m}\left% (a,c-a\right)}\int\limits_{\boldsymbol{{0}}<\mathbf{X}<\mathbf{I}}\left|% \mathbf{X}\right|^{a-\frac{1}{2}(m+1)}\*{\left|\mathbf{I}-\mathbf{X}\right|}^{% c-a-\frac{1}{2}(m+1)}{\left|\mathbf{I}-\mathbf{T}\mathbf{X}\right|}^{-b}\,% \mathrm{d}{\mathbf{X}},$ $\Re\left(a\right),\Re\left(c-a\right)>\frac{1}{2}(m-1)$, $\boldsymbol{{0}}<\mathbf{T}<\mathbf{I}$.
### Transformations of Parameters
35.7.6 ${{}_{2}F_{1}}\left({a,b\atop c};\mathbf{T}\right)=\left|\mathbf{I}-\mathbf{T}% \right|^{c-a-b}{{}_{2}F_{1}}\left({c-a,c-b\atop c};\mathbf{T}\right)=\left|% \mathbf{I}-\mathbf{T}\right|^{-a}{{}_{2}F_{1}}\left({a,c-b\atop c};-\mathbf{T}% (\mathbf{I}-\mathbf{T})^{-1}\right)=\left|\mathbf{I}-\mathbf{T}\right|^{-b}{{}% _{2}F_{1}}\left({c-a,b\atop c};-\mathbf{T}(\mathbf{I}-\mathbf{T})^{-1}\right).$
### Gauss Formula
35.7.7 ${{{}_{2}F_{1}}\left({a,b\atop c};\mathbf{I}\right)=\frac{\Gamma_{m}\left(c% \right)\Gamma_{m}\left(c-a-b\right)}{\Gamma_{m}\left(c-a\right)\Gamma_{m}\left% (c-b\right)}},$ $\Re\left(c\right),\Re\left(c-a-b\right)>\frac{1}{2}(m-1)$.
### Reflection Formula
35.7.8 ${{{}_{2}F_{1}}\left({a,b\atop c};\mathbf{T}\right)=\frac{\Gamma_{m}\left(c% \right)\Gamma_{m}\left(c-a-b\right)}{\Gamma_{m}\left(c-a\right)\Gamma_{m}\left% (c-b\right)}}\*{{}_{2}F_{1}}\left({a,b\atop a+b-c+\frac{1}{2}(m+1)};\mathbf{I}% -\mathbf{T}\right),$ $\boldsymbol{{0}}<\mathbf{T}<\mathbf{I}$; ${\frac{1}{2}}(j+1)-a\in\mathbb{N}$ for some $j=1,\ldots,m$; ${\frac{1}{2}}(j+1)-c\notin\mathbb{N}$ and $c-a-b-{\frac{1}{2}}(m-j)\notin\mathbb{N}$ for all $j=1,\ldots,m$. ⓘ Symbols: ${{}_{\NVar{p}}F_{\NVar{q}}}\left(\NVar{a_{1},\dots,a_{p}};\NVar{b_{1},\dots,b_% {q}};\NVar{\mathbf{T}}\right)$ or ${{}_{\NVar{p}}F_{\NVar{q}}}\left({\NVar{a_{1},\dots,a_{p}}\atop\NVar{b_{1},% \dots,b_{q}}};\NVar{\mathbf{T}}\right)$: generalized hypergeometric function of matrix argument, $\in$: element of, $\Gamma_{\NVar{m}}\left(\NVar{a}\right)$: multivariate gamma function, $\notin$: not an element of, $\mathbb{N}$: set of all positive integers, $\Re$: real part, $a$: complex variable, $\mathbf{I}$: $m\times m$ identity matrix, $\mathbf{T}$: real symmetric $m\times m$ matrix, $b$: complex variable, $c$: complex variable, $j$: nonnegative integer, $m$: positive integer and $\boldsymbol{{0}}$: $m\times m$ matrix of zeros Referenced by: §35.7(ii), Erratum (V1.0.26) for Equation (35.7.8) Permalink: http://dlmf.nist.gov/35.7.E8 Encodings: TeX, pMML, png Clarification (effective with 1.0.26): Originally the constraint was written as $\Re\left(c\right),\Re\left(c-a-b\right)>\frac{1}{2}(m-1)$. The constraint has been replaced with $\boldsymbol{{0}}<\mathbf{T}<\mathbf{I}$; ${\frac{1}{2}}(j+1)-a\in\mathbb{N}$ for some $j=1,\ldots,m$; ${\frac{1}{2}}(j+1)-c\notin\mathbb{N}$ and $c-a-b-{\frac{1}{2}}(m-j)\notin\mathbb{N}$ for all $j=1,\ldots,m$; for details see https://arxiv.org/abs/2002.05248. See also: Annotations for §35.7(ii), §35.7(ii), §35.7 and Ch.35
## §35.7(iii) Partial Differential Equations
Let $f:{\boldsymbol{\Omega}}\to\mathbb{C}$ (a) be orthogonally invariant, so that $f(\mathbf{T})$ is a symmetric function of $t_{1},\dots,t_{m}$, the eigenvalues of the matrix argument $\mathbf{T}\in{\boldsymbol{\Omega}}$; (b) be analytic in $t_{1},\dots,t_{m}$ in a neighborhood of $\mathbf{T}=\boldsymbol{{0}}$; (c) satisfy $f(\boldsymbol{{0}})=1$. Subject to the conditions (a)–(c), the function $f(\mathbf{T})={{}_{2}F_{1}}\left(a,b;c;\mathbf{T}\right)$ is the unique solution of each partial differential equation
35.7.9 $t_{j}(1-t_{j})\frac{{\partial}^{2}F}{{\partial t_{j}}^{2}}-\frac{1}{2}\sum_{% \begin{subarray}{c}k=1\\ k\neq j\end{subarray}}^{m}\frac{t_{k}(1-t_{k})}{t_{j}-t_{k}}\frac{\partial F}{% \partial t_{k}}+\left({c-\tfrac{1}{2}(m-1)-\left(a+b-\tfrac{1}{2}(m-3)\right)t% _{j}}+\frac{1}{2}\sum_{\begin{subarray}{c}k=1\\ k\neq j\end{subarray}}^{m}\frac{t_{j}(1-t_{j})}{t_{j}-t_{k}}\right)\frac{% \partial F}{\partial t_{j}}=abF,$
for $j=1,\dots,m$.
Systems of partial differential equations for the ${{}_{0}F_{1}}$ (defined in §35.8) and ${{}_{1}F_{1}}$ functions of matrix argument can be obtained by applying (35.8.9) and (35.8.10) to (35.7.9).
## §35.7(iv) Asymptotic Approximations
Butler and Wood (2002) applies Laplace’s method (§2.3(iii)) to (35.7.5) to derive uniform asymptotic approximations for the functions
35.7.10 ${{}_{2}F_{1}}\left({\alpha a,\alpha b\atop\alpha c};\mathbf{T}\right)$
and
as $\alpha\to\infty$. These approximations are in terms of elementary functions.
For other asymptotic approximations for Gaussian hypergeometric functions of matrix argument, see Herz (1955), Muirhead (1982, pp. 264–281, 290, 472, 563), and Butler and Wood (2002).
| 2023-02-02T00:46:39 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 194, "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.9265543222427368, "perplexity": 2076.147243417383}, "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-06/segments/1674764499954.21/warc/CC-MAIN-20230202003408-20230202033408-00113.warc.gz"}
|
https://par.nsf.gov/biblio/10331606-mean-free-path-ionizing-photons-lt-lt-evidence-rapid-evolution-near-reionization
|
This content will become publicly available on October 7, 2022
The mean free path of ionizing photons at 5 < z < 6: evidence for rapid evolution near reionization
ABSTRACT The mean free path of ionizing photons, λmfp, is a key factor in the photoionization of the intergalactic medium (IGM). At z ≳ 5, however, λmfp may be short enough that measurements towards QSOs are biased by the QSO proximity effect. We present new direct measurements of λmfp that address this bias and extend up to z ∼ 6 for the first time. Our measurements at z ∼ 5 are based on data from the Giant Gemini GMOS survey and new Keck LRIS observations of low-luminosity QSOs. At z ∼ 6 we use QSO spectra from Keck ESI and VLT X-Shooter. We measure $\lambda _{\rm mfp} = 9.09^{+1.62}_{-1.28}$ proper Mpc and $0.75^{+0.65}_{-0.45}$ proper Mpc (68 per cent confidence) at z = 5.1 and 6.0, respectively. The results at z = 5.1 are consistent with existing measurements, suggesting that bias from the proximity effect is minor at this redshift. At z = 6.0, however, we find that neglecting the proximity effect biases the result high by a factor of two or more. Our measurement at z = 6.0 falls well below extrapolations from lower redshifts, indicating rapid evolution in λmfp over 5 < z < 6. This evolution disfavours models in which reionization ended early enough more »
Authors:
; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10331606
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
508
Issue:
2
Page Range or eLocation-ID:
1853 to 1869
ISSN:
0035-8711
3. ABSTRACT Reionization-era galaxies tend to exhibit weak Ly α emission, likely reflecting attenuation from an increasingly neutral IGM. Recent observations have begun to reveal exceptions to this picture, with strong Ly α emission now known in four of the most massive z = 7–9 galaxies in the CANDELS fields, all of which also exhibit intense [O iii]+H β emission (EW > 800 Å). To better understand why Ly α is anomalously strong in a subset of massive z ≃ 7–9 galaxies, we have initiated an MMT/Binospec survey targeting a larger sample (N = 22) of similarly luminous (≃1–6 L$^{\ast }_{\mathrm{UV}}$) z ≃ 7 galaxies selected over verymore »
5. ABSTRACT We present 10 main-sequence ALPINE galaxies (log (M/M⊙) = 9.2−11.1 and ${\rm SFR}=23-190\, {\rm M_{\odot }\, yr^{-1}}$) at z ∼ 4.5 with optical [O ii] measurements from Keck/MOSFIRE spectroscopy and Subaru/MOIRCS narrow-band imaging. This is the largest such multiwavelength sample at these redshifts, combining various measurements in the ultraviolet, optical, and far-infrared including [C ii]158 $\mu$m line emission and dust continuum from ALMA and H α emission from Spitzer photometry. For the first time, this unique sample allows us to analyse the relation between [O ii] and total star-formation rate (SFR) and the interstellar medium (ISM) properties via [O ii]/[C ii] and [O ii]/H α luminosity ratios at z ∼ 4.5. The [O ii]−SFR relationmore »
| 2022-08-13T14:57: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.5913678407669067, "perplexity": 3279.1095027187002}, "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-2022-33/segments/1659882571959.66/warc/CC-MAIN-20220813142020-20220813172020-00700.warc.gz"}
|
http://hitchhikersgui.de/Help_talk:Displaying_a_formula
|
# Help talk:Displaying a formula
Wikipedia Help Project (Rated NA-class, Mid-importance)
This page is within the scope of the Wikipedia Help Project, a collaborative effort to improve Wikipedia's help documentation for readers and contributors. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. To browse help related resources see the Help Menu or Help Directory. Or ask for help on your talk page and a volunteer will visit you there.
NA This page does not require a rating on the project's quality scale.
Mid This page has been rated as Mid-importance on the project's importance scale.
## Equations broken on iphone
All equations now render as illegibly small on my iphone. Tried safari, chrome, mercury with lots of user agents. Recent within few days of 22 August 2016. 107.77.213.47 (talk) 05:23, 23 September 2016 (UTC)
Yes, this drives me nuts. Unless I happen to be sitting at work, I am usually reading Wikipedia on my iPhone in the Chrome browser—and I tend to consult a lot of math-intensive pages. Is this genuinely not a supported use case? It actually makes me feel unwelcome on Wikipedia. (If this works for other users and is an artifact of my sticking stubbornly to iOS 8, someone let me know and I will quit complaining.) Tracy Hall (talk) 16:31, 11 February 2017 (UTC)
Same happens to me on iPad iOS 8.4, but not on my new iphone with iOS 10. — Preceding unsigned comment added by 80.110.66.133 (talk) 18:28, 12 February 2017 (UTC)
I have the same problem on an iPad 3 with iOS 8.3. Although I have already spent several hours trying to find a solution, I can't seem to find any. — Preceding unsigned comment added by Ilirea (talkcontribs) 15:55, 9 March 2017 (UTC)
## MathML broken again?
This is probably the wrong place to ask this, feel free to direct me elsewhere.
I'm still getting fallback svg images in Firefox, even though I've got MathML in my prefs. It's been broken a long time for me, I'm not sure it ever worked after MathJax was removed. Should this work? Discussion above suggests it was fixed for everyone else in August 2015. Is there some way I can debug this? How is the fallback decision made? Kendall-K1 (talk) 15:28, 2 June 2016 (UTC)
Unfortunately this became more complicated. While the user setting is no longer needed the native MathML plugin is required. See https://www.mediawiki.org/wiki/Extension:Math. The good news is, that there is also information on the font setup, so that really good looking MathML is produced in the end. --Physikerwelt (talk) 16:00, 2 June 2016 (UTC)
(Edit conflict) The relates to T131177 which has changed the default renderer for all users. Part of that change is to was "As a result we reconsidered to decision to delver MathML as default for firefox users. Now they get SVG's as well and need to install a add on which provides really good MathML support."
The discussion about dropping MathML for firefox was at Wikipedia talk:Special:Preferences
You can reenable the MathML with a bit of CSS
.mwe-math-fallback-image-inline {
display: none !important;
}
.mwe-math-fallback-image-display {
display: none !important;
}
.mwe-math-mathml-a11y {
position: inherit;
clip:inherit;
width:inherit;
height:inherit;
opacity:inherit
}
Add this to your Special:MyPage/vector.css and the MathML will reappear. --Salix alba (talk): 16:48, 2 June 2016 (UTC)
Installing the FF plugins did it. Sorry if I missed it, but this really needs to be documented somewhere. Kendall-K1 (talk) 17:16, 2 June 2016 (UTC)
I am not sure if this is related to this section per se, but I see no option to create a new section while not logged in... Something that has been broken for a little while here (maybe a month or two? not sure) is the displayed size of formulae. The bounding box for the svg images is the correct size, but the images themselves appear microscopic. Opening the images in a new tab shows the formulae at the proper size, but this workaround still leaves formula-heavy pages nearly illegible. It also renders the point in the "benefits of TeX" section of the article about formula size being larger in TeX vs. HTML invalid. Regardless of whether user preferences can fix this anomaly, it should not be the case that one must log in before a page can approach legible (hence the intentional being not-logged-in for this comment). 169.235.228.254 (talk) 02:45, 7 July 2016 (UTC)
Thank you Salix alba for the .css snippet - that fixes it. The discussion Wikipedia talk:Special:Preferences does not seem entirely relevant; it addresses the question of the default rendering and it's not clear why this should override user preferences. I had supposed that correct rendering had stopped due to some bug that would eventually be fixed if I was very patient - so thanks again, --catslash (talk) 01:52, 12 March 2017 (UTC)
I've added a new rule to the above css to prevent the display maths produced with the <math display="block"> tag, which is how Visual Editor creates display maths. --Salix alba (talk): 16:29, 28 August 2017 (UTC)
## Some missing amsmath support
I'm not sure where I should bring this up, so I'm trying here first. I just "fixed" a formula that was using \operatorname* -- WP seems not to support the starred version, so the only thing I could really do was to remove the star. This improved the appearance, but it still falls short of the intended typesetting. Is there any way to add support for this feature? Where does one bring up this sort of request anyway? One other missing bit of support that seems crucial is for \genfrac. This is needed a lot, and the workaround(s) are usually less-than-desirable LaTeX. Deacon Vorbis (talk) 00:27, 25 January 2017 (UTC)
## About chemical equations
If I have any grammar or spelling errors, please feel free to change.
On this page,the example of chemical equations like <chem>{A2}+B2->2AB</chem>;and for beautiful,I suggest changing them to like <chem>A2{+}B2->2AB</chem>.--脂肪酸钠 (talk) 09:00, 2 April 2017 (UTC)
Not sure <chem>A2{+}B2->2AB</chem> (${\displaystyle {{\ce {A2{+}B2->2AB}}}}$) is bettern than <chem>{A2}+B2->2AB</chem> (${\displaystyle {{\ce {{A2}+B2->2AB}}}}$). Looking in some text books there seems to be a large space around the plus sign. --Salix alba (talk): 10:45, 22 April 2017 (UTC)
## Accented character
The accented character in $ń\left(D\right)$ causes the tag to not render. Advice? Lfstevens (talk) 21:17, 4 July 2017 (UTC)
Try \acute{n}. --Deacon Vorbis (talk) 22:04, 4 July 2017 (UTC)
## How to start a new line?
It seems that \\ does not work. Golopotw (talk) 00:39, 23 July 2017 (UTC)
It does within certain environments, like align (and related ones), but not otherwise. --Deacon Vorbis (talk) 00:44, 23 July 2017 (UTC)
## LaTeX Incorrect Rendering
(In reference to edit Special:Diff/811387351 on the triangular numbers page) Under what conditions could/would the LaTeX markup (eg "") be displayed instead of the intended formula? Specifically, what could cause all the LaTeX markup in a single section of a page to render that way? (It's possible the issue was caused by my browser not fully loading the page) If possible, please point me to any "best practices" documentation for Wikipedia's LaTeX implemention. —Leopardpaw (talk) 09:02, 21 November 2017 (UTC)
Your Math settings in the appearance section of the preferences would cause that if it were set to "LaTeX source", instead of MathML with SVG and PNG. —TheDJ (talkcontribs) 09:26, 21 November 2017 (UTC)
@TheDJ: Thank you for the quick response. In this case, I am primarily using a mobile browser (which may be part of the issue). It might have been due to a combination of interacting with Wikipedia's mobile site and my browser's setting, since as soon as I pushed my edit, the LaTeX rendered properly.
As a note, I did check the settings you referrenced, and it is set to render MathML. Thanks again. —Leopardpaw 09:48, 21 November 2017 (UTC)
@Leopardpaw what likely happened, is that when you added it, the page was rendered before the math fragment was finished. In theory this should not happen, but sometimes it does. Reloading the page, or making a WP:NULLEDIT usually fixes the problem. —TheDJ (talkcontribs) 09:47, 5 December 2017 (UTC)
## Work around for LaTeX \phantom?
I intend to re-use given structures for displaying formulas by (slightly) modifying the existing content, without spending much effort on redesigning an elaborate alignment. This quick-and-dirty method seems reasonable to me, especially when considering the rate of acceptance for changes in WP. Cleaning up LaTeX-source may be scheduled for times after establishing content, possibly carried out by expert gnomes.
Since I am no expert in LaTeX, I humbly ask for cheap tricks, possibly saving me to, e.g., dig into arrays with elaborate aligning. Best regards, Purgy (talk) 09:08, 5 December 2017 (UTC)
Do you have an example of the expression you would like to display. --Salix alba (talk): 09:36, 5 December 2017 (UTC)
@Purgy Purgatorio Note that we don't support full LaTeX, only the math subset of LaTeX (specifically amsmath). —TheDJ (talkcontribs) 09:50, 5 December 2017 (UTC)
We don't even fully support amsmath: \genfrac, \substack, and \operatorname* all don't work, for example. –Deacon Vorbis (carbon • videos) 13:46, 5 December 2017 (UTC)
... yes, I got to learn this already (\dddots -> \overset), nevertheless I ask the experts for some work around. Purgy (talk) 19:50, 5 December 2017 (UTC)
──────────────────────────────────────────────────────────────────────────────────────────────────── I would enjoy most a generic answer to Howto mimic \phantom in WP?, but I do understand that this is maybe too much or meaningless to ask for. The last encounter with this problem was the following:
Having this:
${\displaystyle |x|={\begin{cases}x,&{\mbox{if }}x\geq 0\\-x,&{\mbox{if }}x<0.\end{cases}}}$
and wanting something, approximated by this:
${\displaystyle |x|={\begin{cases}\;\;\ x,&{\mbox{if }}x\geq 0\\-x,&{\mbox{if }}x<0.\end{cases}}}$
but not by using the ridiculous and unsatisfactory "\;\;\" but rather "\phantom {-}", or possibly "\phantom {{}-}". Aligning with the rude "&" did not work for me because of the minimally introduced whitespace, and \mspace does not work either. I mused about this already in other environments, but started to ask around on this occasion. As said, I am no expert, but really, I do like experts' answers. Purgy (talk) 19:50, 5 December 2017 (UTC)
Well, \phantom would certainly be nice to have for other things too, but here, you can achieve the same effect using the array environment, which is essentially what cases does. (Note, use \text{} here, not \mbox{}).
${\displaystyle |x|=\left\{{\begin{array}{rl}x,&{\text{if }}x\geq 0\\-x,&{\text{if }}x<0.\end{array}}\right.}$
Deacon Vorbis (carbon • videos) 20:22, 5 December 2017 (UTC)
Thank you for having done the work, which I so eagerly strive to avoid. As mentioned in the thread starter I search for a quick-and-dirty method to re-use, as extensively as possibly, existing structures and definitely want to avoid re-casting the whole environment.
Mournfully, by your suggestion, I see my chances, for some artifice of \LaTex (you cannot have even this in its full glory) to trick WP-rendering to my desires, dramatically degrading. Any more sages around, please? Purgy (talk) 08:42, 6 December 2017 (UTC)
## Difference between \bold and \mathbf?
This text is in \bold
${\displaystyle {\mathbf {abcdefghijklmnopqrstuvxyz} }}$
And this is the same string in \mathbf
${\displaystyle \mathbf {abcdefghijklmnopqrstuvxyz} }$
There doesn't seem to be any difference between the two, so which one should be used? And why is there no reference to \bold anywhere except for section 3.7.1.1.1? — Preceding unsigned comment added by Megafish40 (talkcontribs) 19:44, 10 December 2017 (UTC)
The \bold command does not appear in The Not So Short Introduction to LATEX 2ε. It might be a hang over from the old texvc package which had some odd non standard syntax.--Salix alba (talk): 23:47, 10 December 2017 (UTC)
Correct, there are many texvc commands that weren't actual standard mathmode commands or that were common LaTeX commands or shortcuts, which were added in the early days for convenience. \bold is defined as an alias for the proper \mathbf. So while the result is the same, \mathbf, is what you really should be using, because it makes the formula interoperable with most latex renderers. —TheDJ (talkcontribs) 10:48, 11 December 2017 (UTC)
## Spacing in arrays
I perceived that
{[email protected]{}l}
generates an error, and
{[email protected]{4em}l}
is ignored. Did I do something wrong, or is there a workaround? Specifically, I would like to be able to set the arrays-inherent spacing to zero. Purgy (talk) 12:06, 14 January 2018 (UTC)
It sure doesn't look like there's much control over the spacing commands here. You can try using 6 \!s before every entry in the second column. That seems to give about the right negative space, but that's almost certainly a bad idea. What are you trying to do? Maybe there's another way. –Deacon Vorbis (carbon • videos) 14:05, 14 January 2018 (UTC)
It is similar to what I wanted to do recently with \phantom. I want to have approximately this:
${\displaystyle {\begin{array}{llrrl}&-(a,b)&=&(-a,b)&\quad {\text{additive inverse}}\\&\;\;\ (a,b)^{-1}&=&(b,a)&\quad {\text{multiplicative inverse}},\end{array}}}$
but I dislike doing it with \;\;\ , and would like to avoid the surplus white space before and after the "=", which should remain aligned, of course.
Thank you for your efforts. Purgy (talk) 15:38, 15 January 2018 (UTC)
Unfortunately, I don't think that's going to be reasonable given the limited spacing commands available, especially missing \phantom{}. I think using a plain align block would be just fine here. I suspect that even in a full TeX install, getting such fine control over vertical alignment (in a robust way) within an alignment block would require some significant wizardry (to the point where I'd just look for separate packages that do it for you already). –Deacon Vorbis (carbon • videos) 15:51, 15 January 2018 (UTC)
## Writing chem ionic equation
How do I write:
Fe2+ + Cu2+
using <chem>? I cannot figure out how to get the "+" between the pair of ions to render correctly. Here are my attempts at the left-hand side:
Fe2+ + Cu2+ ${\displaystyle {\ce {Fe2+ + Cu2+}}}$ Fe+2 + Cu+2 ${\displaystyle {\ce {Fe+2 + Cu+2}}}$ Fe^{2+} + Cu^{2+} ${\displaystyle {\ce {Fe^{2+}+ Cu^{2+}}}}$ Fe^{+2} + Cu^{+2} ${\displaystyle {\ce {Fe^{+2}+ Cu^{+2}}}}$
DMacks (talk) 20:09, 20 January 2018 (UTC)
<chem>Fe^2+ + Cu^2+</chem> seems to work ${\displaystyle {\ce {Fe^2+ + Cu^2+}}}$. --Salix alba (talk): 20:17, 20 January 2018 (UTC)
Thanks! DMacks (talk) 02:28, 24 January 2018 (UTC)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Help_talk:Displaying_a_formula&oldid=822046114"
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Help_talk:Displaying_a_formula
This page is based on the copyrighted Wikipedia article "Help talk:Displaying a formula"; 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
| 2018-02-21T15:39:55 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 13, "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.7842335104942322, "perplexity": 2988.623009824576}, "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-09/segments/1518891813626.7/warc/CC-MAIN-20180221143216-20180221163216-00785.warc.gz"}
|
https://www.aimsciences.org/article/doi/10.3934/proc.2005.2005.768
|
Article Contents
Article Contents
# Dynamics of noninvertibility in delay equations
• Models with a time delay often occur, since there is a naturally occurring delay in the transmission of information. A model with a delay can be noninvertible, which in turn leads to qualitative di erences between the dynamical properties of a delay equation and the familiar case of an ordinary di erential equation. We give speci c conditions for the existence of noninvertible solutions in delay equations, and describe the consequences of noninvertibility.
Mathematics Subject Classification: Primary:34K, Secondary:39B.
Citation:
Open Access Under a Creative Commons license
| 2022-12-03T09:02: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": 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.218209370970726, "perplexity": 1684.33046465386}, "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/1669446710926.23/warc/CC-MAIN-20221203075717-20221203105717-00672.warc.gz"}
|
https://par.nsf.gov/biblio/10157777-spikey-self-lensing-flares-from-eccentric-smbh-binaries
|
Spikey: Self-Lensing Flares from Eccentric SMBH Binaries
Abstract We examine the light curves of two quasars, motivated by recent suggestions that a supermassive black hole binary (SMBHB) can exhibit sharp lensing spikes. We model the variability of each light curve as due to a combination of two relativistic effects: the orbital relativistic Doppler boost and gravitational binary self-lensing. In order to model each system we extend previous Doppler plus self-lensing models to include eccentricity. The first quasar is identified in optical data as a binary candidate with a 20-yr period (Ark 120), and shows a prominent spike. For this source, we rule out the lensing hypothesis and disfavor the Doppler-boost hypothesis due to discrepancies in the measured vs. recovered values of the binary mass and optical spectral slope. The second source, which we nickname Spikey, is the rare case of an active galactic nucleus (AGN) identified in Kepler’s high-quality, high-cadence photometric data. For this source, we find a model, consisting of a combination of Doppler modulation and a narrow symmetric lensing spike, consistent with an eccentric SMBHB with mass Mtot = 3 × 107M⊙, rest-frame orbital period T = 418 days, eccentricity e = 0.5, and seen at an inclination 8○ from edge-on. This interpretation can be tested more »
Authors:
; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10157777
Journal Name:
Monthly Notices of the Royal Astronomical Society
ISSN:
0035-8711
| 2022-12-03T22:09: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.8280643820762634, "perplexity": 3937.5741037888633}, "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/1669446710941.43/warc/CC-MAIN-20221203212026-20221204002026-00173.warc.gz"}
|
https://www.abs.gov.au/methodologies/regional-population-methodology/2021
|
Latest release
# Regional population methodology
Reference period
2021
## Estimated resident population
Estimated resident population (ERP) is the official estimate of the Australian population, which links people to a place of usual residence within Australia. Usual residence is the address at which a person considers themselves to currently live. ERP includes all people who usually live in Australia (regardless of nationality, citizenship or visa status), with the exception of people present for foreign military, consular or diplomatic reasons.
ERP, or population estimates, for Australia and it's states and territories (from now on referred to as states) are prepared quarterly and released around six months after the reference date in National, state and territory population.
Annual population estimates as at 30 June are then prepared for areas below the state level and released in this product. Estimates are prepared at the Statistical Area Level 2 and Local Government Area levels, according to the Australian Statistical Geography Standard (ASGS), and are aggregated or split to create estimates for other geographies. Population estimates are available in this product for Statistical Areas Levels 2 to 4, Greater Capital City Statistical Areas, Local Government Areas, Significant Urban Areas, Remoteness Areas, and Commonwealth and State Electoral Divisions. This is the first release of Regional population to include data on the Australian Statistical Geography Standard (ASGS) Edition 3.
This issue contains preliminary rebased estimates for 30 June 2017 to 2021 based on the 2021 Census. Age and sex breakdowns of these estimates will be released in Regional population by age and sex on 30 August 2022. Final Census-based estimates for June 2017 through to June 2021 will be released in 2023. Totals will be released in Regional population while age and sex breakdowns will be released in Regional population by age and sex
### Method
ERP as at 30 June in a Census year is calculated by adjusting Census counts of Australian usual residents to account for residents temporarily overseas, people missed or counted more than once in the Census (based on the Post Enumeration Survey), and for the births, deaths and migration that happened between 30 June and Census night.
At the national and state levels, ERP is updated from the Census base every three months by taking the population estimate at the start of the quarter and adding the components of population change: natural increase (births minus deaths), net overseas migration and (in the case of state populations) net interstate migration. This is known as the component method, and uses the demographic balancing equation:
$$P_{t+1}=P_t+B−D+NOM+NIM$$ where:
$$P_t$$ = the estimated resident population at time point $$t$$
$$P_{t+1}$$ = the estimated resident population at time point $$t+1$$
$$B$$ = the number of births occurring between $$t$$ and $$t+1$$
$$D$$ = the number of deaths occurring between $$t$$ and $$t+1$$
$$NOM$$ = net overseas migration occurring between $$t$$ and $$t+1$$
$$NIM$$ = net interstate migration occurring between $$t$$ and $$t+1$$
At the national level, net interstate migration is zero.
For Statistical Areas Level 2 (SA2s) and Local Government Areas (LGAs), population estimates are updated from the Census base annually as at 30 June also using the component method, by taking the estimate at the start of the financial year and adding natural increase and net overseas and internal (moves between and within the states) migration. The components for these sub-state areas are calculated by breaking down state-level component estimates, ensuring consistency between the state and sub-state population and component data.
The components of population change (and subsequently ERP) at the LGA level are constrained to those at the SA2 level to ensure consistency between these two geographies, based on the smallest possible regions where SA2 and LGA boundaries match in terms of the combined area containing resident population. For example, where one LGA aligns exactly with one SA2 or where a group of LGAs aligns with a group of SA2s, the components for these areas will generally match. Estimates at the SA2 and LGA level are ultimately constrained so that they add to the relevant state estimates.
Once the estimates are updated, they are scrutinised and validated by ABS analysts. Local knowledge, such as that advised by state governments is considered and used to adjust data for particular SA2s and LGAs. In some small areas, population change since the previous Census is assumed to be zero in the absence of reliable component data for these areas.
To provide an indication of ERP below the SA2 level, population estimates are calculated for Statistical Areas Level 1 (SA1s). For a Census year, SA2 estimates are apportioned across SA1s using usual residence Census counts. In intercensal years, the SA2 estimates are apportioned across SA1s by taking into account population change implied by Medicare and electoral roll counts at the SA1 level in the years following the Census. Estimates for SA1s can be aggregated to regions such as Remoteness Areas. For areas that cannot be built up from whole SA1s, such as electoral divisions and Postal Areas, Mesh Block Census counts are used to estimate the share of the SA1 population that resides in those areas. By these means, population estimates for areas other than those provided in this product (including SA1s) may be available on request via the ABS website.
### 2021 Census-based population estimates
The 2021 estimates in this release are based on the 2021 Census, with adjustments made for residents temporarily overseas, net Census undercount and overcount, and the time between Census night and 30 June. These are referred to as rebased population estimates. For more information, including the demographic adjustments made for national and state/territory ERP, see Methodology used in rebased population estimates, June 2021.
At the greater capital city and rest of state level (part of state), a further demographic adjustment was applied to account for relatively large variations in the PES net undercount adjustments between Censuses.
The following two populations were used to arrive at an adjusted 2021 rebased ERP for each part of state:
• the unadjusted 2021 rebased ERP for that part of state, and
• the 2021 unrebased ERP for that part of state (as published in Regional population, 2020-21)
A weighting of 60% was applied to the unadjusted 2021 rebased ERP split of population between the greater capital city and rest of state region for each state/territory, and 40% to the 2021 unrebased ERP split. Within each state/territory, the population for each part of state was then adjusted to arrive at this composite split (with balancing adjustments made so that the net adjustment at the state/territory level was zero), as shown in the following table.
Demographic adjustments by part of state, 2021
NSWVic.QldSAWATas.NTTotal
Greater capital city (no.)26,10028,4007,500-5002,100-60010063,100
Rest of state (no.)-26,100-28,400-7,500500-2,100600-100-63,100
Greater capital city (%)0.50.60.3-0.00.1-0.250.10.4
Rest of state (%)-0.9-1.8-0.30.1-0.40.20-0.1-0.8
ERP for all regions below each part of state was then apportioned to the new part of state ERP on a pro-rata basis. This composite method was also applied for 2016 rebasing of sub-state ERP.
### Intercensal difference
In Census years, both preliminary estimates (derived from updating ERP from the previous Census) and 'rebased' population estimates (based on the current Census) are prepared. Differences between these two sets of estimates are referred to as intercensal differences. Rebased estimates of SA2 populations for previous intercensal years are derived by apportioning the intercensal difference across the five years, while constraining to state totals. Rebased 2017 to 2020 estimates were generally derived by adding one-fifth of the 2021 intercensal difference to the previous estimate of the 2017 population, two-fifths to the previous estimate of the 2018 population, and so on. Intercensal difference was apportioned based on the unrebased growth rate for some areas (e.g. newly established areas).
As a result of the rebasing process, the components (natural increase, internal and overseas migration) published in previous issues of this product no longer sum to population change.
### Accuracy
The sub-state estimates in this product are subject to some error. Some caution should be exercised when using the estimates, especially for areas with very small population.
An indication of the accuracy of ERP can be gauged by assessing the size and direction of intercensal differences. For Australia as at 30 June 2021, the unrebased ERP over-estimated the preliminary rebased ERP by 0.2% (52,200 people). For the states and territories, the 2021 intercensal differences ranged from -5.1% (Australian Capital Territory) to +1.5% (Victoria).
To assess the quality of SA2-based estimates, unrebased estimates for 2021 were converted to SA2s based on the 2021 ASGS, and constrained to preliminary rebased state/territory ERP. These estimates were compared with preliminary rebased 2021 SA2 estimates. The average of the absolute values of the intercensal differences for these SA2 estimates (excluding areas with less than 1,000 people) was 4.1%.
The table below shows that intercensal differences were generally larger for very small areas, and lower for very large areas.
Size of SA2 (people)Number of SA2s (no.)Average absolute intercensal difference (%)
1,000 to 2,999928.9
3,000 to 4,9993064.0
5,000 to 6,9993293.7
7,000 to 9,9993974.0
10,000 to 14,9995954.3
15,000 to 19,9993843.9
20,000 and over2173.4
### Status
To meet the competing demands for accuracy and timeliness, there are several versions of sub-state population estimates. Preliminary estimates are available around nine months after the reference date with revised estimates 12 months later. Rebased and final estimates are made available after each Census, when revisions are made to the estimates for all years in the previous intercensal period.
The status of annual sub-state ERP and components changes over time, from preliminary to revised to final, as new component data becomes available at the state level. Estimates in this issue are final for 2001 to 2016 and preliminary rebased for 2017 to 2021, based on the 2021 Census.
## Components of population change
### Births and deaths
Natural increase (births minus deaths) for sub-state areas is calculated using information provided by each state/territory registry of births, deaths and marriages. The data is coded based on the place of usual residence of the mother for births, and the place of usual residence of the deceased for deaths. It is aggregated to SA2 and LGA levels and constrained to published state estimates of births and deaths.
The estimates of births and deaths in this product are prepared for financial years to correspond with the 30 June reference date for sub-state ERP. To produce timely sub-state estimates, preliminary births and deaths data are prepared using year of registration as a proxy for year of occurrence.
Preliminary births and deaths are prepared by breaking down preliminary state-level data. Later, when the state-level data is updated, the sub-state data is updated accordingly and released in the next issue of this product.
The sub-state births and deaths data in this product is not coherent with the sub-state data released in Births, Australia and Deaths, Australia which is for calendar years and has a different scope.
### Overseas migration
The movement of people from overseas to Australia's sub-state areas and vice-versa cannot be directly measured and is estimated by breaking down overseas migrant arrivals and departures at the state level to sub-state areas, using information from the most recent Census. The state-level overseas migration data is sourced from Department of Home Affairs processing systems, visa information, and incoming passenger cards, and is published in National, state and territory population.
Regional overseas migration estimate (ROME) arrivals are estimated based on counts of people who identified in the Census that they were living overseas one year ago, at SA2 level. This distribution is used to break down state arrivals each year up until the next Census. To account for changes to the distribution of overseas arrivals within a state between Censuses (e.g. in high growth areas or inner-city areas with changing numbers of temporary migrants), adjustments may be made based on up-to-date indicator data including counts of Temporary Skills Shortage visa holders and overseas students.
For ROME departures, a model distributes state-level overseas migrant departures to SA2s. This model is based on a range of information from the Census - mainly the number of people who arrived in each area from overseas in the last year. More weighting is given to areas that have high SEIFA Index of Education and Occupation scores and more than 20% of their total population born overseas. Of all the models evaluated, this model was selected as it best estimated population change between the last two Censuses. As with overseas arrivals, overseas departures may be adjusted based on additional information sources.
LGA estimates of ROME arrivals and departures are prepared by converting from SA2-level ROME arrivals and departures, using a population-weighted correspondence.
Preliminary ROME arrivals and departures are prepared by breaking down preliminary state-level data. Later, when the state-level data is updated, the sub-state data is updated accordingly and released in the next issue of this product.
### Internal migration
The movement of people between and within Australia's states and territories cannot be directly measured and is estimated using administrative data. Internal migration is estimated based on a combination of Census data (usual address one year ago), Medicare change of address data (provided by Services Australia), and Department of Defence records (for military personnel only).
Medicare is Australia's universal health insurance scheme and covers the vast majority of Australian residents. De-identified Medicare change of address counts are aggregated to SA2 and LGA levels. There are some people who are part of ERP but are not covered by Medicare, such as certain temporary visa holders. For others there is a time delay from when they move residence to when they update their address details with Medicare. To account for these issues, factors are applied to calibrate this data to internal migration data from the Census. These factors are applied by age, sex, state and move type (arrival or departure). Medicare data received for the year ending 30 September is used to estimate internal migration for the year ending 30 June. This assumes that on average the time between a person moving house and registering their change of address with Medicare is three months.
As many defence force personnel do not interact with Medicare, defence movements data is used to supplement the Medicare data. Aggregated defence force personnel movements are converted from postcode to SA2 and LGA levels. This data reflects the time of move, and is therefore not lagged.
The Medicare and defence data are combined to prepare regional internal migration estimates (RIME) at SA2 and LGA levels. Interstate RIME moves are constrained to estimates of interstate migration as published in National, state and territory population.
RIME was previously prepared and released in Migration, Australia for financial years up to 2015-16. This old series of RIME was experimental in that it was prepared independently of and is not directly comparable with ERP nor with RIME prepared for 2016-17 onwards, due to different methods and source data used. The old RIME series used Medicare change of address data aggregated to postcodes, which was converted to SA2/LGA, and was supplied to the ABS quarterly meaning that one person could record up to four moves in a financial year. RIME for 2016-17 onwards uses change of address data coded directly to ASGS areas, and is supplied and calculated on an annual basis consistent with the definition of population change over a financial year.
## Statistical geography
The Australian Statistical Geography Standard (ASGS) brings together all of the regions which the ABS and many other organisations use to collect, release and analyse geographically classified statistics. The ASGS classification structures are split into two broad groups, ABS Structures and Non-ABS Structures.
The ABS Structures are defined and maintained by the ABS, and remain unchanged for the five years between Censuses. This issue of Regional population contains data for the ABS Structures of both the 2021 ASGS (Edition 3) and 2016 ASGS (Edition 2). Further information on the ABS Structures of the 2021 ASGS (Edition 3) for which population estimates are available in this product is contained in:
Further information on the ABS Structures of the 2016 ASGS (Edition 2) for which population estimates are available in this product is contained in:
The Non-ABS Structures are not defined or maintained by the ABS, and generally represent administrative regions. As the Non-ABS Structures represent regions that are subject to ongoing change, the ABS releases updates to these Structures each year where significant change has occurred. Further information on the Non-ABS Structures of the 2021 ASGS (Edition 3) for which population estimates are available in this product is contained in:
Maps of the statistical areas defined in the ASGS are available in the online mapping tool ABS Maps.
The area figures used in this product were calculated using ABS standard Geographic Information System software from the digital boundaries of the ASGS.
## Other population measures
### Centre of population
The centre of population of a region is a point that describes a centre point of the region's population, and is calculated in this product based on SA1s. Due to the inherent imprecision in small area estimates, the centre of population should be considered indicative and not ascribed to an exact location. The use of different geographical level data in the calculation of the centre of population can result in different locations.
### Population density
The population density of each region in this product has been calculated by dividing its ERP by its area in square kilometres. The result is expressed as a number of people per square kilometre.
### Population grid
In this product, ERP is also presented in one square kilometre grid format. The population grid offers a consistently sized spatial unit and gives a refined model of population distribution, particularly for the non-urban areas of Australia. It is also an established, easy to understand and readily comparable international standard which enables users to make local, national and international comparisons of population density.
The population grid is prepared using SA1 population estimates. Within each populated SA1, all known residential dwelling locations were identified using a subset of the ABS Address Register, and the population distributed equally across the residential dwellings. The average value assigned to each dwelling was then summed within each one square kilometre grid cell across the country. This is modelled data and caution must be used in its interpretation, as the population has not been measured at the one square kilometre grid cell level.
Prior to 2021, the grid was prepared using known residential dwelling locations based on the Geocoded National Address File. The new methodology used for 2021, which makes use of the ABS Address Register, has resulted in the population grid showing a more targeted representation of the population.
The population grid is provided in ESRI Grid format and Geo TIFF format, which are recommended for users proficient in the use of Geographic Information System software.
## Confidentiality
The ABS collects statistical information under the authority of the Census and Statistics Act, 1905. This requires that statistical output shall not be published or disseminated in a manner that is likely to enable the identification of a particular person or organisation.
To guard against identification or disclosure of confidential information, a procedure is applied to confidentialise sub-state ERP and components, which are also subsequently constrained so that they add to relevant state estimates. As a result of this confidentialisation method, and forced additivity, estimates of under three people should be regarded as synthetic and only exist to ensure additivity to higher levels.
ABS statistics draw extensively on information provided freely by individuals, businesses, governments and other organisations. Their continued cooperation is very much appreciated: without it, the wide range of statistics published by the ABS would not be available. Information received by the ABS is treated in strict confidence as required by the Census and Statistics Act 1905.
## Glossary
### Show all
#### 12/16 month rule
Under a '12/16 month rule', incoming overseas travellers (who are not currently counted in the population) must be resident in Australia for a total period of 12 months or more, during the 16 month follow-up period to then be added to the estimated resident population. Similarly, those travellers departing Australia (who are currently counted in the population) must be absent from Australia for a total of 12 months or more during the 16 month follow-up period to then be subtracted from the estimated resident population.
The 12/16 month rule does not have to be continuous and takes account of those persons who may have left Australia briefly and returned, while still being resident for 12 months out of 16. Similarly, it takes account of Australians who live most of the time overseas but periodically return to Australia for short periods.
#### Australian Statistical Geography Standard (ASGS)
The ASGS brings all the regions for which the ABS publishes statistics within the one framework and has been in use for the collection and dissemination of geographically classified statistics since 1 July 2011. It is the current framework for understanding and interpreting the geographical context of statistics published by the ABS.
#### Birth
The delivery of a child, irrespective of the duration of pregnancy, who, after being born, breathes or shows any other evidence of life such as heartbeat.
#### Capital city
Refers to the Greater Capital City Statistical Areas of states and territories as defined in the Australian Statistical Geography Standard.
#### Census
The complete enumeration of a specific population at a point in time (as opposed to a survey, which enumerates a sample of the population). When the word is capitalised, "Census" refers to the national Census of Population and Housing. The Census is run by the ABS every five years and aims to count every person in Australia on Census night.
#### Centre of population
A measure used to summarise the spatial distribution of a population. To calculate the centre of population for an area in this product, the latitude and longitude coordinates of the geographic centroid of each Statistical Area Level 1 (SA1) in that area are multiplied by the population of each SA1 to obtain weighted latitudes and longitudes for each SA1. These are summed to obtain a population-weighted latitude and longitude coordinate for the area, then divided by the total population of the area to obtain a single latitude and longitude coordinate.
#### Commonwealth Electoral Division (CED)
An area legally prescribed for returning one member to the House of Representatives, Australia's Federal Lower House of Parliament. Data for CEDs are approximated by aggregating the data for Mesh Blocks that best fit the area. Where the Australian Electoral Commission revise their boundaries, CEDs are updated in conjunction with the annual update of other Non-ABS Structures in the Australian Statistical Geography Standard.
#### Death
The permanent disappearance of all evidence of life after birth has taken place. The definition excludes deaths prior to live birth. For the purposes of death registration collections compiled by the ABS, a death refers to any death which occurs in, or en route to Australia and is registered with a state or territory Registry of Births, Deaths and Marriages.
#### Estimated resident population (ERP)
The official measure of the population of Australia, based on the concept of usual residence. It refers to all people, regardless of nationality, citizenship or legal status, who usually live in Australia, with the exception of foreign diplomatic personnel and their families. It includes usual residents who are overseas for less than 12 months over a 16-month period. It excludes overseas visitors who are in Australia for less than 12 months over a 16-month period. Sub-state estimates of the resident population are prepared on an annual basis by adding natural increase (the excess of births over deaths), net internal migration and net overseas migration occurring during the period to the population at the beginning of each period.
#### Greater Capital City Statistical Area (GCCSA)
Represent the socioeconomic area of each of the eight state and territory capital cities. These boundaries are built from aggregations of whole Statistical Areas Level 4. GCCSA boundaries represent a broad socioeconomic definition of each capital city, containing not only the urban area of the capital city, but also surrounding and non-urban areas where much of the population has strong links to the capital city, for example through commuting to work.
#### Highest growth rate
Based on the population change over a period as a proportion (percentage) of the population at the beginning of the period.
#### Intercensal difference
The difference between two estimates at 30 June of a Census year population: the first based on the latest Census, and the second arrived at by updating the 30 June estimate of the previous Census year with intercensal components of population change.
#### Internal migration
The movement of people across a specified boundary within Australia involving a change in place of usual residence. Net internal migration is the number of arrivals minus the number of departures and can be either positive or negative.
#### Interstate migration
The movement of people over a state or territory boundary involving a change in place of usual residence. Net interstate migration is the number of arrivals minus the number of departures and can be either positive or negative.
#### Largest growth
Based on absolute change in population over a period.
#### Local Government Area (LGA)
An ABS approximation of an officially gazetted LGA as defined by each state and territory local government department. LGAs cover incorporated areas of Australia, which are legally designated areas for which incorporated local governing bodies have responsibility. The major areas of Australia not administered by incorporated bodies are the northern parts of South Australia and all of the Australian Capital Territory and the Other Territories. These regions are identified as 'Unincorporated' in the LGA structure of the Australian Statistical Geography Standard.
#### Mesh Block
The smallest geographic region in the Australian Statistical Geography Standard (ASGS) which forms the basis for all larger regions of the ASGS. They broadly identify land use such as residential, commercial, agricultural and parks. There are approximately 368,000 Mesh Blocks and they cover the whole of Australia without gaps or overlaps.
#### Natural increase
The number of births minus the number of deaths.
#### Net overseas migration (NOM)
The net gain or loss of population through immigration to Australia and emigration from Australia.
#### Net undercount
The difference between the actual number of people who were counted in the Census (including imputations) and an estimate of the number of people who should have been counted in the Census. This estimate is based on the Post Enumeration Survey (PES) conducted after each Census. For a category of person (e.g. based on age, sex and state of usual residence), net undercount is the result of Census undercount, overcount, differences in classification between the PES and Census, and imputation error.
#### Overseas migrant arrivals
Incoming international travellers who stay in Australia for 12 months or more over a 16-month period, who are not currently counted within the population, and are then added to the population.
#### Overseas migrant departures
Outgoing international travellers who leave Australia for 12 months or more over a 16-month period, who are currently counted within the population, and are then subtracted from the population.
#### Post Enumeration Survey (PES)
The Census Post Enumeration Survey (PES) is a household survey conducted following the Census. The PES allows the ABS to estimate the number of people missed in the Census and the number counted more than once or in error. Historically more people are missed than are counted more than once in Australia, leading to a net undercount. PES estimates of net undercount are used to adjust Census counts for use in ERP.
#### Rebasing
After each Census, the ABS uses Census counts (adjusted for undercount) to construct a new base population figure for 30 June of the Census year. Rebasing is the process of updating population estimates for the five years between Censuses, to incorporate information from the most recent Census.
#### Regional internal migration estimates (RIME)
Estimates of internal migration for Australia's sub-state areas, prepared primarily using Medicare change of address information.
#### Regional overseas migration estimates (ROME)
Estimates of overseas migration for Australia's sub-state areas, prepared by breaking down state/territory overseas migrant arrivals and departures primarily using Census information.
#### Remoteness Area (RA)
Remoteness Areas divide Australia into 5 classes of remoteness (ranging from Major Cities to Very Remote) on the basis of their relative access to services. Access to services is measured using the Accessibility and Remoteness Index of Australia (ARIA+). Within the Australian Statistical Geography Standard, each RA is created from a grouping of Statistical Areas Level 1 which have a particular degree of remoteness.
#### Rest of state
Within each state and the Northern Territory, the area not defined as being part of the greater capital city is represented by a rest of state region. The Australian Capital Territory does not have a rest of state region.
#### Significant Urban Area (SUA)
Represent individual Urban Centres or clusters of related Urban Centres with a core urban population over 10,000 people. They can also include related peri-urban areas, satellite development, the area into which the urban development is likely to expand, and nearby rural land. SUAs are aggregations of whole Statistical Areas Level 2. They do not cover the whole of Australia, and may cross state/territory borders.
#### Socio-Economic Indexes for Areas (SEIFA)
A suite of four indexes that rank areas in Australia according to relative socio-economic advantage and disadvantage. The indexes are based on the five-yearly Census of Population and Housing. The SEIFA index used in the model to distribute overseas departures within states and territories is the Index of Education and Occupation (IEO).
#### State Electoral Division (SED)
An area legally prescribed for returning one or more members to the State or Territory Lower Houses of Parliament. Data for SEDs are approximated by aggregating the data for Mesh Blocks that best fit the area. Where the Australian Electoral Commission revise their boundaries, SEDs are updated in conjunction with the annual update of other Non-ABS Structures in the Australian Statistical Geography Standard.
#### Statistical Area Level 1 (SA1)
An area defined in the Australian Statistical Geography Standard (ASGS) designed as the smallest unit for the release of Census data. They generally have a population of 200 to 800 people, and an average population of about 400 people. SA1s in remote and regional areas generally have smaller populations than those in urban areas. SA1s are used as the building blocks for a number of ASGS defined regions including Sections of State, Urban Centres and Localities and Remoteness Areas. There are approximately 61,800 SA1s and they cover the whole of Australia without gaps or overlaps. Population estimates are prepared for SA1s by breaking down estimates from the SA2 level.
#### Statistical Area Level 2 (SA2)
A medium-sized general purpose area defined in the Australian Statistical Geography Standard built from whole SA1s. Their purpose is to represent a community that interacts together socially and economically. SA2s are based on officially gazetted suburbs and localities. In urban areas, SA2s largely conform to one or more whole suburbs, while in rural areas they generally define the functional zone of a regional centre. SA2s generally have a population range of 3,000 to 25,000 people, and an average population of about 10,000 people. There are approximately 2,500 SA2s and they cover the whole of Australia without gaps or overlaps. SA2s are the base unit for preparing sub-state population estimates.
#### Statistical Area Level 3 (SA3)
An area defined in the Australian Statistical Geography Standard built up from SA2s to provide a regional breakdown of Australia. SA3s aim to create a standard framework for the analysis of ABS data at the regional level through clustering groups of whole SA2s that have similar regional characteristics. Their boundaries reflect a combination of widely recognised informal regions as well as existing administrative regions such as State Government Regions in rural areas and Local Government Areas in urban areas. SA3s generally range in population from 30,000 to 130,000 people. There are around 360 SA3s and they cover the whole of Australia without gaps or overlaps.
#### Statistical Area Level 4 (SA4)
An area defined in the Australian Statistical Geography Standard designed for the output of labour force data and to reflect labour markets. In rural areas SA4s generally represent aggregations of multiple small labour markets with socioeconomic connections or similar industry characteristics. Large regional city labour markets are generally defined by a single SA4. Within major metropolitan labour markets SA4s represent sub-labour markets. SA4s are built from whole SA3s. They generally have a population of over 100,000 people to enable accurate labour force survey data to be generated. There are 107 SA4s and they cover the whole of Australia without gaps or overlaps.
#### Urban Centre and Locality (UCL)
Aggregations of Statistical Areas Level 1 which represent population centres with populations exceeding 200 persons. Centres with a core urban population of 1,000 persons or more are considered to be Urban Centres, whilst smaller centres with populations of between 200 and 999 people are considered to be Localities.
#### Usual residence
Within Australia, usual residence is the address of the dwelling at which a person considers themselves to currently live, either having lived there for some time or intending to live there for some time.
## Abbreviations
### Show all
ABS Australian Bureau of Statistics ACT Australian Capital Territory ASGS Australian Statistical Geography Standard CED Commonwealth Electoral Division Census Census of Population and Housing ERP estimated resident population GCCSA Greater Capital City Statistical Area LGA Local Government Area no. number NOM net overseas migration NSW New South Wales NT Northern Territory PES Census Post Enumeration Survey Qld Queensland RA Remoteness Area RIME regional internal migration estimates ROME regional overseas migration estimates sq km square kilometre S/T state or territory SA South Australia SA1 Statistical Area Level 1 SA2 Statistical Area Level 2 SA3 Statistical Area Level 3 SA4 Statistical Area Level 4 SED State Electoral Division SEIFA Socio-Economic Indexes for Areas SUA Significant Urban Area Tas. Tasmania Vic. Victoria WA Western Australia
| 2022-08-08T21:50:52 |
{"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.3413786292076111, "perplexity": 3777.608603443205}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "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-2022-33/segments/1659882570879.1/warc/CC-MAIN-20220808213349-20220809003349-00705.warc.gz"}
|
https://math.wikia.org/wiki/Vector_addition
|
## FANDOM
1,168 Pages
The sum of vectors u and v is
$\mathbf{u}+\mathbf{v} =(u_1+v_1)\mathbf{e}_1 +(u_2+v_2)\mathbf{e}_2 +(u_3+v_3)\mathbf{e}_3.$
Where
${\mathbf u} = {\mathbf u_1}{\mathbf e_1} + {\mathbf u_2}{\mathbf e_2} + {\mathbf u_3}{\mathbf e_3}$
${\mathbf v} = {\mathbf v_1}{\mathbf e_1} + {\mathbf v_2}{\mathbf e_2} + {\mathbf v_3}{\mathbf e_3}$
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-12-10T08:33:02 |
{"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.7795702815055847, "perplexity": 5577.816202317546}, "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/1575540527010.70/warc/CC-MAIN-20191210070602-20191210094602-00551.warc.gz"}
|
https://pdglive.lbl.gov/DataBlock.action?node=M171DM&home=MXXX030
|
# ${{\boldsymbol \gamma}}$ ENERGY IN ${{\boldsymbol \Upsilon}{(3S)}}$ DECAY INSPIRE search
VALUE (MeV) EVTS DOCUMENT ID TECN COMMENT
$\bf{ 920.6 {}^{+2.8}_{-3.2}}$ OUR AVERAGE
$918.6$ $\pm6.0$ $\pm1.9$ $2.3$ $\pm0.5$k 1
2010
CLEO ${{\mathit \Upsilon}{(3S)}}$ $\rightarrow$ ${{\mathit \gamma}}{{\mathit X}}$
$921.2$ ${}^{+2.1}_{-2.8}$ $\pm2.4$ $19$ $\pm3$k 1
2008 V
BABR ${{\mathit \Upsilon}{(3S)}}$ $\rightarrow$ ${{\mathit \gamma}}{{\mathit X}}$
1 Assuming ${\Gamma}_{{\mathit \eta}_{{b}}{(1S)}}$ = 10 MeV. Not independent of the corresponding mass or mass difference measurements.
References:
BONVICINI 2010
PR D81 031104 Measurement of the ${{\mathit \eta}_{{b}}{(1S)}}$ Mass and the Branching Fraction for ${{\mathit \Upsilon}{(3S)}}$ $\rightarrow$ ${{\mathit \gamma}}{{\mathit \eta}_{{b}}{(1S)}}$
AUBERT 2008V
PRL 101 071801 Observation of the Bottomonium Ground State in the Decay ${{\mathit \Upsilon}{(3S)}}$ $\rightarrow$ ${{\mathit \gamma}}{{\mathit \eta}_{{b}}}$
| 2020-09-25T04:03: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.9402086138725281, "perplexity": 4720.668556074928}, "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/1600400221980.49/warc/CC-MAIN-20200925021647-20200925051647-00302.warc.gz"}
|
https://control.com/textbook/basic-process-control-strategies/techniques-for-analyzing-control-strategies/
|
# Techniques for Analyzing Control Strategies
## Chapter 34 - Basic Process Control Strategies and Control System Configurations
Control strategies such as cascade, ratio, feedforward, and those containing limit and selector functions can be quite daunting to analyze, especially for students new to the subject. As a teacher, I have seen first-hand where students tend to get confused on these topics, and have seen how certain problem-solving techniques work well to overcome these conceptual barriers. This section explores some of these techniques and the reasons why they work.
### Explicitly denoting controller actions
The direction of action for a loop controller – either direct or reverse – at first seems like a very simple concept. It certainly is fundamental to the comprehension of any control strategy containing PID loop controllers, but this seemingly simple concept harbors an easy-to-overlook fact causing much confusion for students as they begin to analyze any control strategy where a loop controller receives a remote setpoint signal from some other device, most notably in cascade and ratio control strategies.
A direct-acting loop controller is defined as one where the output signal increases as the process variable signal increases. A reverse-acting controller is defined as one where the output signal decreases as the process variable signal increases. Both types of action are shown here:
Let us apply this concept to a realistic application, in this case the control of temperature in a steam-heated chemical reactor vessel:
As the reactor vessel’s temperature increases, we need the temperature controller (TIC) to reduce the amount of hot steam entering the jacket in order to stabilize that temperature. Since the steam control valve is air-to-open (ATO), this means we need the controller to output a decreasing signal as the process variable (temperature) signal increases. This, by definition, is a reverse-acting controller. This example also showcases the utility of the problem-solving technique known as a “thought experiment,” whereby we imagine a certain condition changing (in this case, the reactor temperature increasing) and then we mentally model the desired response of the system (in this case, closing the steam valve) in order to determine the necessary controller action.
So far, this example poses no confusion. But suppose we were to perform another thought experiment, this time supposing the setpoint signal increases rather than the reactor temperature increases. How will the controller respond now?
Many students will conclude that the controller’s output signal will once again decrease, because we have determined this controller’s action to be reverse, and “reverse” implies the output will go the opposite direction as the input. However, this is not the case: the controller output will actually increase if its setpoint signal is increased. This, in fact, is precisely how any reverse-acting controller should respond to an increase in setpoint.
The reason for this is evident if we take a close look at the characteristic equation for a reverse-acting proportional controller. Note how the gain is multiplied by the difference between setpoint and process variable. Note how the process variable has a negative sign in front of it, while setpoint does not.
An increase in process variable (PV) causes the quantity inside the parentheses to become more negative, or less positive, causing the output to decrease toward 0%. Conversely, an increase in setpoint (SP) causes the quantity inside the parentheses to become more positive, causing the output to increase toward 100%. This is precisely how any loop controller should respond: with the setpoint having the opposite effect of the process variable, because those two quantities are always being subtracted from one another in the proportional controller’s equation.
Where students get confused is the single label of either “direct” or “reverse” describing a controller’s action. We define a controller as being either “direct-acting” or “reverse-acting” based on how it responds to changes in process variable, but it is easy to overlook the fact that the controller’s setpoint input must necessarily have the opposite effect. What we really need is a way to more clearly denote the respective actions of a controller’s two inputs than a single word.
Thankfully, such a convention already exists in the field of electronics1023, where we must denote the “actions” of an operational amplifier’s two inputs. In the case of an opamp, one input has a direct effect on the output (i.e. a change in signal at that input drives the output the same direction) while the other has a reverse effect on the output (i.e. a change in signal at that input drives the output in the opposite direction). Instead of calling these inputs “direct” and “reverse”, however, they are conventionally denoted as noninverting and inverting, respectively. If we draw a proportional controller as though it were an opamp, we may clearly denote the actions of both inputs in this manner:
I strongly recommend students label the loop controllers in any complex control strategy in the same manner, with “+” and “$$-$$” labels next to the PV and SP inputs for each controller, in order to unambiguously represent the effects of each signal on a controller’s output. This will be far more informative, and far less confusing, than merely labeling each controller with the word “direct” or “reverse”.
Let us return to our example of the steam-heated reactor to apply this technique, labeling the reverse-acting controller’s process variable input with a “$$-$$” symbol and its setpoint input with a “+” symbol:
With these labels in place we can see clearly how an increase in temperature going into the “$$-$$” (inverting) input of the temperature controller will drive the valve signal down, counter-acting the change in temperature and thereby stabilizing it. Likewise, we can see clearly how an increase in setpoint going into the “+” (noninverting) input of the temperature controller will drive the valve signal up, sending more steam to the reactor to achieve a greater temperature.
While this technique of labeling the PV and SP inputs of a loop controller as though it were an operational amplifier is helpful in single-loop controller systems, it is incredibly valuable when analyzing more complex control strategies where the setpoint to a controller is a live signal rather than a static value set by a human operator. In fact, it is for this very reason that many students do not begin to have trouble with this concept until they begin to study cascade control, where one controller provides a live (“remote”) setpoint value to another controller. Up until that point in their study, they never rarely had to consider the effects of a setpoint change on a control system because the setpoint value for a single-loop controller is usually static.
Let us modify our steam-heated reactor control system to include a cascade strategy, where the temperature controller drives a setpoint signal to a “slave” steam flow controller:
In order to determine the proper actions for each controller in this system, it is wise to begin with the slave controller (FIC), since the master controller (TIC) depends on the slave controller being properly configured in order to do its job properly. Just as we would first tune the slave controller in a cascade system prior to tuning the master controller, we should first determine the correct action for the slave controller prior to determining the correct action for the master controller.
Once again we may apply a “thought experiment” to this system in order to choose the appropriate slave controller action. If we imagine the steam flow rate suddenly increasing, we know we need the control valve to close off in order to counter-act this change. Since the valve is still air-to-open, this requires a decrease in the output signal from the FIC. Thus, the FIC must be reverse-acting. We shall denote this with a “$$-$$” label next to the process variable (PV) input, and a “+” label next to the remote setpoint (RSP) input:
Now that we know the slave controller must be reverse-acting, we may choose the action of the master controller. Applying another “thought experiment” to this system, we may imagine the reactor temperature suddenly increasing. If this were to happen, we know we would need the control valve to close off in order to counter-act this change: sending less steam to a reactor that is getting too hot. Since the valve is air-to-open, this requires a decrease in the output signal from the FIC. Following the signal path backwards from the control valve to the FIC to the TIC, we can see that the TIC must output a decreasing signal to the FIC, calling for less steam flow. A decreasing output signal at the TIC enters the FIC’s noninverting (“+”) input, causing the FIC output signal to also decrease. Thus, we need the TIC to be reverse-acting as well. We shall denote this with a “$$-$$” label next to the process variable (PV) input, and a “+” label next to the local setpoint (LSP) input:
With these unambiguous labels in place at each controller’s inputs, we are well-prepared to qualitatively analyze the response of this cascade control system to process upsets, to instrument failure scenarios, or to any other change. No longer will we be led astray by the singular label of “reverse-acting”, but instead will properly recognize the different directions of action associated with each input signal to each controller.
### Determining the design purpose of override controls
Override control strategies are a source of much confusion for students first learning the concept. Perhaps the most fundamental question students find difficult to answer when faced with an override strategy is how to determine the intended purpose for that strategy if no explanation is given.
Take for example this surge tank level/flow control system. While it may be obvious that the flow controller is there for the purpose of regulating flow out of the tank, it is not so clear what the two level controllers are doing, or what purposes are served by the two selector functions:
A good starting point in our analysis is to first determine the proper directions of action for each controller. This is wise because the selector functions perform their tasks based on the relative values of the controller output signals: controllers become selected or de-selected on the basis of their output signals being greater or less than some other signal. Therefore, before we may be able to determine the purpose of a selector function, we must know how the loop controller feeding that selector function is supposed to react to process conditions. Once we have determined each controller’s proper action, we may then interpret each selector’s function in light of what process conditions will cause a particular controller to become selected.
When choosing the proper action for each controller, we must consider each controller in this system – one at a time – as though it were the one being selected. In other words, we may give ourselves license to ignore the selector functions and just concentrate for the time being on how each controller needs to act in order to do its job when selected. Looking at the system from this perspective, we see that each level controller (when selected) acts as a master to the flow (slave) controller. Thus, what we have here is a cascade level/flow control system, with two master controllers selected on the basis of their output signals.
The flow controller (FIC) needs to be reverse-acting, because in order to counter-act an increase in flow rate it must close off the valve (i.e. decreasing output with increasing input = reverse action). Each level controller needs to be direct-acting, because in order to counter-act an increase in level it must call for more flow exiting the tank (i.e. increasing output with increasing input = direct action). Denoting these actions using “+” and “$$-$$” labels at each PV and SP input line:
Only now are we prepared to analyze the purpose of each selector function. Let’s begin with the low-select first. It selects the lowest of two values, either a fixed value of 50% or the output of the level controller with the 10% setpoint. Since we know this level controller is direct-acting, we may conclude that it will be selected if it sees a low level at its PV input. More specifically, it will be surely be selected if the measured tank level drops significantly below the setpoint value of 10%. Thus, we may conclude that the purpose of this level controller is to take over control if the tank level reaches or drops below the 10% mark.
Next, let us analyze the purpose of the other level controller (connected to the high-select function). Since the high-select function will select this level controller only if its output signal exceeds the signal passed on by the low-select function, and we know that this controller is direct-acting, we may conclude that it will be selected if it sees a high level at its PV input. More specifically, it will surely be selected if the measured tank level rises significantly above the setpoint value of 90%. Thus, we may conclude that the purpose of this level controller is to take over control if the tank level reaches or exceeds the 90% mark.
If neither level controller is selected, the signal that gets passed on to the flow controller as a remote setpoint is the 50% fixed signal entering on the left-hand side of the low-select function. Thus, the flow controller tries to maintain a steady flow rate of 50% in the event neither level controller is selected.
Putting all these pieces together, we may conclude that the purpose of this surge tank control system is to maintain as steady a flow rate as possible out of the tank (and on to some other process), letting the liquid level inside the tank rise and fall significantly before any action is taken to change the flow rate. Only if the level drops below 10% will the flow rate be reduced, and only if the level rises above 90% will the flow rate be increased. Otherwise, the flow rate will hold steady at 50%.
To summarize, the recommended technique for analyzing the purpose of an override control system is as follows:
• First, determine the necessary actions of each controller (assume the selector functions are absent, and each controller gets its turn controlling the process).
• Identify the type of selection (high or low) implemented by each selector function.
• Based on the type of selection and the action of the controller, identify what process condition will cause that controller to become selected. This is the condition the controller exists to regulate.
• Share
Published under the terms and conditions of the Creative Commons Attribution 4.0 International Public License
| 2020-03-30T19:14: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": 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.5647561550140381, "perplexity": 861.0299503402478}, "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-16/segments/1585370497301.29/warc/CC-MAIN-20200330181842-20200330211842-00163.warc.gz"}
|
https://www.abs.gov.au/statistics/research/supply-chain-network-reconstruction
|
# Supply Chain Network Reconstruction
Measuring the risk of supply chain disruptions
Released
7/09/2022
##### Abstract
This concept paper, first proposed to the Australian Bureau of Statistics (ABS) Methodological Advisory Committee in October 2018, explores the feasibility of reconstructing the Australian network of domestic supply chains through entropy maximisation. This 'network approach' captures the flow (magnitude and direction) of goods and services through the economy. If feasibility can be established, the reconstructed network would fill a critical information gap in contemporary governance. Based on existing data and a partial observation of the underlying network, the reconstructed network could model the propagation of shocks throughout the economy. Notably, the network could address nascent concerns around supply chain disruption and systemic risk.
## Introduction
The disruptive events of the COVID-19 pandemic, trade restrictions and emerging risks from single-source imports have demonstrated the vulnerabilities of modern integrated economies. Emerging literature has demonstrated the potential to 1) reconstruct business supply chains, and 2) model the impact of shocks. Therefore, the ABS is investigating the prospect of reconstructing supply chain networks to measure systemic risks and strategic vulnerabilities. As a comprehensive map of the economy, a reconstructed network would fill critical data gaps and provide new statistical tools in policymaking, macro-economics, and supply chain research.
Existing ABS statistics paint a detailed picture of business specific characteristics, but only broad brushstrokes of economic movement. The ABS business longitudinal analysis data environment, for example, includes firm-level characteristics but does not include the relationships and flows between businesses. In terms of economic movement, the ABS national accounts provide information on the flow of goods and services through input-output tables (ABS, 2021) and supply-use tables (ABS, 2020). However, these statistics are aggregated by industry and product classifications. In contrast, the reconstructed network could harmonise these datasets and reveal the flow of goods and services at the firm level.
## Network Reconstruction
Network reconstruction methods are designed to estimate a complete network based on a partial observation of the underlying network. This can include individual nodes or connections, as well as global observations. For example, the number of connections for each node or simply the distribution of connections per node. We refer here to a directed network where the nodes are individual businesses, and the network connections indicate the supply or receipt of goods and services between two businesses.
Given the missing information, it is usually not possible to perfectly reconstruct the network. Instead, the aim is to generate an ensemble $$\mathbb{G}$$ of all possible networks that satisfy the observed data. Specifically, to generate a probability matrix $$\small{P=[{p_{ij}]}_{i,j=1}^N}$$ that encodes the distribution of all possible networks. Here, each $$p_{ij}$$ describes the probability $$\small{0<p_{ij}<1}$$ of a connection between $$i$$ and $$j$$. A Bernoulli trial of each $$p_{ij}$$ results in a graph $$\small G\in\mathbb{G}$$ described by an adjacency matrix $$\small{A=[{a_{ij}]}_{i,j=1}^N}$$ where each element $$a_{ij}=1$$ if a link exists, otherwise $$a_{ij}=0$$. After reconstructing a graph $$\small G\in\mathbb{G}$$, we then need to ascertain the weight $$w_{ij}$$ or value of goods and services being traded between businesses. Therefore, we construct a weighted adjacency matrix $$\small{W=[{w_{ij}]}_{i,j=1}^N}$$ to describe the weight and direction of goods and services from node $$i$$ to node $$j$$.
### Maximum Entropy Network Reconstruction
For the reconstruction to be statistically defensible, it should minimise bias with respect to all available information. Maximising entropy ensures that the link probabilities are 'maximally random' and therefore captures the uncertainty inherent in the estimate. Moreover, this approach reproduces the values of the information constraints on average, ensuring the outcome is unbiased. In this regard, entropy maximisation can be considered as a more general (non-parametric) form of Bayes’ theorem.
To maximise entropy, first consider that the reconstructed network contains information $$\small{I\left(G\right)=-\text{ln}P\left(G\right)}$$ about the underlying network (Cover & Thomas, 2006; Squartini et al., 2018). Where a reconstructed network $$\small{G}$$ is unlikely $$\small{P\left(G\right)\simeq0}$$, the information presents an almost infinite amount of 'surprise' (Cover & Thomas, 2006; Squartini et al., 2018). Where the reconstructed network is certain $$\small{P\left(G\right)=1}$$, no new information about the underlying network is presented. Iterating over the ensemble of all possible networks results in the Shannon entropy equation:
$$S=\left\langle I\right\rangle=\sum_{G\in\mathbb{G}} P\left(G\right)I\left(G\right)=\sum_{G\in\mathbb{G}}{-P\left(G\right)\text{ln} P\left(G\right)}$$
(Squartini et al., 2018)
From here, the aim is to maximise entropy subject to $$m$$ constraints $$C_m$$, each representing known information of the network. In general the constraints take the form:
$$\sum_{G\in\mathbb{G}}{P\left(G\right)C_m(G)=\left\langle C_m\right\rangle}$$
where the first constraint acts as a normalising condition, $$\sum_{G\in\mathbb{G}}{P\left(G\right)=1}$$.
Here $$C_m(G)$$ is the value of the $$m^{th}$$ constraint for graph $$G$$ and $$\small \langle C_m \rangle$$ is the observed (or expected) value for constraint $$m$$. Constraining entropy by the expected value ensures the subsequent distribution preserves our observation in expectation (on average). Therefore, the Lagrangian maximising entropy with respect to our $$m$$ constraints follows:
$$\displaystyle \mathcal{L}\left[P\right]=S-\lambda_0\left[\sum_{G\in\mathbb{G}}{P\left(G\right)-1}\right]-\sum_{m=1}^{M}{\lambda_m\left[\sum_{G\in\mathbb{G}}{P\left(G\right)C_m(G)-\left\langle C_m\right\rangle}\right]}$$
Solving the partial derivatives results in the exponential random graph model distribution:
$$\sum_{G\in\mathbb{G}}{P\left(G\right)} =\displaystyle \frac{e^{-\sum_{m=1}^M \lambda_m \cdot C_m(G)}} {\sum_{G\in\mathbb{G}} \exp (-\sum_{m=1}^M \lambda_m \cdot C_m(G))} = \frac{e^{-H(G)}}{Z}$$
(Squartini et al., 2018)
In statistical mechanics terms, the Hamiltonian $$\small{H\left(G\right)=\sum_{m=1}^{M}{\lambda_mC_m\left(G\right)}}$$ describes the total energy of the system, and the partition function $$\small{Z=\sum_{G\in\mathbb{G}} \exp\left(-\sum_{m=1}^{M}{\lambda_mC_m\left(G\right)}\right)}$$ acts as a normalising constant (Squartini et al., 2018).
If the degree or number of connections $$k$$ for each node is known, then one of the constraints becomes $$\sum_{G\in\mathbb{G}}\sum_{i}{P\left(G\right)k_i\left(G\right)=\left\langle k\right\rangle}\$$where $$k_i\left(G\right)$$ is the degree of node $$i$$ for graph $$G$$. Given the degree $$k_i=\sum_{j} a_{ij}$$ is the number of connections for each node and the network is directed, each node has an in-degree $$k_i^{in}$$ and an out-degree $$k_i^{out}$$. So, the Hamiltonian takes the form:
$$H\left(G\right)=\sum_{i}\sum_{j\neq i}{\lambda_i^{out}a_{ij}+\lambda_j^{in}a_{ji}}\ =\sum_{i}\sum_{j\neq i}{\lambda_i^{out}k_i^{out}+\lambda_j^{in}k_j^{in}}$$
(Squartini et al., 2018)
Now that we have defined the Hamiltonian at the node-level, we can also define the probability distribution at the node-level. Consider that the probability $$p_{ij}$$ of a connection between $$i$$ and $$j$$ is equal to the expected value of a connection existing $$\small \left\langle a_{ij} \right\rangle$$ (Rachkov, Pjipers, & Garlashceilli, 2021). Therefore, the network can be split into pairs of directed links:
$$\displaystyle{p_{ij}=\frac{e^{-\sum_{i}{\lambda_i^{\text{out}}k_i^{\text{out}}}}e^{-\lambda_j^{\text{in}}k_j^{\text{in}}}}{1+e^{-\sum_{i}{\lambda_i^{\text{out}}k_i^{\text{out}}}}e^{-\lambda_j^{\text{in}}k_j^{\text{in}}}}}$$
For simplicity, we use the convention that $$x_j^{in}=e^{-\lambda_j^{in}k_j^{in}}$$ and $$x_i^{out}=e^{-\sum_{i}{\lambda_i^{out}k_i^{out}}}$$. Therefore:
$$\displaystyle{p_{ij}=\frac{x_i^{\text{out}}x_j^{\text{in}}}{1+x_i^{\text{out}}x_j^{\text{in}}}}$$
Recall that each $$p_{ij}$$ is an element in a probability matrix $$P$$ that encodes the probability of selecting a realisation $$G$$ of all possible graphs $$\mathbb{G}$$:
$$P=\left[\begin{matrix}p_{ij}^\ &\cdots&p_{iN}^\ \\\vdots&\ddots&\vdots\\p_{Nj}^\ &\cdots&p_{NN}^\ \\\end{matrix}\right]$$
### Fitness-Induced Exponential Random Graph
The degree, or number of connections per node, is usually unknown given the confidentiality of financial flows. However, Caldarelli et al. (2002) show that the link probability can be derived from a node's 'fitness', as opposed to any topological property. Here, fitness denotes a node's influence in the network, meaning high fitness nodes attract more connections. This method has been demonstrated to hold in international trade networks (Almog, Squartini, & Garlaschelli, 2015; Garlaschelli & Loffredo, 2008), interbank networks (De Masi et al., 2006; Garlaschelli & Loffredo, 2004; Bollobas et al., 2003), and financial securities networks (Cimini et al., 2015; Garlaschelli et al., 2005). Therefore, a 'fitness ansatz' $$\small{z}$$ correlated with the Lagrangian multipliers is used to approximate the nodes' degrees.
The theory of node fitness has also been observed in highly detailed domestic trade networks in Japan (Bernard, Moxnes and Saito, 2015) and Belgium (e.g. Bernard, Dhyne, Magerman, Manova and Moxnes, 2018; Dhyne and Duprez, 2017). These examples show that:
1. Larger firms generally have more trade connections.
2. Larger firms tend to transact with other large firms.
3. Firms tend to transact with geographically closer firms.
Additionally, the presence of the power law in many aspects such as the connection distribution (Bernard et al., 2018; Bernard, Moxnes and Saito, 2015), distance distribution (Bernard, Moxnes and Saito, 2015; Dhyne and Duprez, 2017) and weight distribution (Bernard et al., 2018) affirm the structural properties of the network.
Unlike the degrees, the weight of incoming and outgoing flows (total sales and purchases) for each businesses is generally known (e.g. from publicly disclosed balance sheets or taxation data). This aggregated weight or strength is defined for each node as $$\small{\hat{s}_i^{out}=\sum_{j=1}^{N} w_{ij}}$$ for the out-strength, and $$\small{\hat{s}_j^{in}=\sum_{i=1}^{N} w_{ij}}$$ for the in-strength. For businesses, this can be considered as the total value of purchases (out-strength) and sales (in-strength) to other businesses. Therefore the link probability can be defined as:
$$\displaystyle{p_{ij}=\frac{x_i^{\text{out}}x_j^{\text{in}}}{1+x_i^{\text{out}}x_j^{\text{in}}}\approx\frac{zs_i^{\text{out}}s_j^{\text{in}}}{1+zs_i^{\text{out}}s_j^{\text{in}}}}$$
Notice that under this formulation the sum of incoming and outgoing probabilities for each node is equal to the expected in-degree $$\small{\sum_{j} p_{ij}=\langle k_i^{\text{out}} \rangle}$$ and out-degree $$\small{\sum_{i} p_{ij}=\langle k_j^{\text{in}} \rangle}$$. That is, the row-sum and column-sum of the $$\small{P}$$ matrix describe the expected number of links for each node. It follows too, that the probability matrix sums to the expected number of links $$\small{\langle L \rangle}$$ in the network:
$$\displaystyle{\sum_{i}\sum_{j\neq i} p_{ij}=\langle L \rangle}$$
This implies that if the total number of links (or even a sample of links) in the network is known, then $$z$$ can be calculated and shown to meet the expected value of the Lagrangian multipliers (Squartini et al., 2018). Furthermore, the reconstruction takes on a more intuitive process, wherein the expected number of links for each firm is simply the total number of links in the market, apportioned by each firm’s market share.
Finally, Squartini et al. (2018) demonstrate the validity of incorporating a gravity model, which employs a distance function $$\small{f(d_{ij})}$$ to penalise connections between geographically distant nodes, thereby accounting for logistics costs observed in the Japanese and Belgium trade networks (Bernard, Moxnes and Saito, 2015; Dhyne and Duprez, 2017):
$$\displaystyle p_{ij}=\frac{z\hat{s}_i^{out}\hat{s}_j^{in}e^{f(d_{ij})}}{1+z\hat{s}_i^{out}\hat{s}_j^{in}e^{f(d_{ij})}}$$
### Production Network Reconstruction
The Dutch Central Bureau of Statistics (CBS) has demonstrated the potential for applying network reconstruction to an entire economic network (Rachkov, Pijpers, & Garlaschelli, 2021; Hooijmaaijers & Buiten, 2019). Drawing from the work of Squartini et al. (2018), the CBS adapts the maximum entropy framework to the system of national accounts. Specifically, Rachkov, Pijpers, & Garlaschelli (2021) make use of supply-use tables to determine commodity flows and input-output tables to determine industry flows:
$$\displaystyle p_{ij}^{[\alpha]}=\frac{(z^{[\alpha]}\hat{s}_i^{out,[\alpha]}\hat{s}_j^{in,[\alpha]}I_{ij})d_{ij}} {1+(z^{[\alpha]}\hat{s}_i^{out,[\alpha]}\hat{s}_j^{in,[\alpha]}I_{ij})d_{ij}}$$
where:
• the link probabilities of each commodity group $$\alpha$$ are estimated independently;
• the out-strength $$\small{\textstyle \hat{s}_j^{out,[\alpha]}}$$ represents the volume of goods and services of commodity group $$\textstyle \alpha$$ that firm $$\textstyle j$$ supplies;
• the in-strength $$\small{\textstyle \hat{s}_i^{in,[\alpha]}}$$ represents the volume of goods and services of commodity group $$\alpha$$ that firm $$i$$ purchases;
• $$\small c_i$$ refers to the industry classification of business $$i$$;
• $$\small I_{ij}$$ is a binary indicator that takes the value $$\small 1$$ where industry $$\textstyle c_i$$ trades with industry $$\textstyle c_j$$, and $$0$$ otherwise; and
• $$\small d_{ij}$$ is the sum of the absolute difference in location (i.e., longitude and latitude coordinates) between two businesses.
Note that the in-strength and out-strength are defined for each product market (or commodity group) as:
$$\hat{s}_j^{in,[\alpha]} =\frac{\mathrm{Net \ turnover \ of \ firm \ }j} {\mathrm{Total\ net \ turnover \ of \ industry \ }c} \small{D_{c_j}^{in,[\alpha]}}$$ and $$\hat{s}_i^{out,[\alpha]} =\frac{\mathrm{Net \ turnover \ of \ firm \ }i} {\mathrm{Total\ net \ turnover \ of \ industry\ }c} \small{D_{c_i}^{out,[\alpha]}}$$
where:
• $$\small D_{c_j}^{in,[\alpha]}$$ represents the value of commodity group $$\alpha$$ used in industry $$c$$; and
• $$\small D_{c_i}^{out,[\alpha]}$$ represents the value of commodity group $$\alpha$$ supplied by industry $$c$$.
### Weight Reconstruction
The simplest method for generating weights follows the maximum entropy approach. Maximising the Shannon entropy $$\small S=\sum_{i=1}^{N}\sum_{j=1}^{N} w_{ij}\text{ ln }w_{ij}$$ leads to $$\small w_{ij}^{ME}=\frac{s_i^{out}s_j^{in}}{W}\$$$$\forall i,j$$ where $$\small W=\sum_{j=1}^{N}s_j^{in}\equiv\sum_{i=1}^{N}s_i^{out}$$ is the total network weight. Here, the weights are conditional on the existence of a link. That is, each weight matrix is conditional on the graph (adjacency matrix) drawn from the probability matrix $$\small P$$. The marginal weights and marginal degrees are met on average (Squartini et al., 2018).
An alternative approach described by Parisi, Squartini, & Garlaschelli (2020) takes the probability matrix $$\small P$$ as prior information and maximises the Shannon entropy, constrained by the observed strength. The conditional entropy maximisation produces a distribution of weighted connections described by the tensor of coefficients $$\beta_{ij}$$ that can be sampled:
$$\displaystyle\beta_{ij}=\frac{p_{ij}}{w_{ij}^{ME}}\ \ \ \ \ \forall i\neq j$$
(Parisi, Squartini, & Garlaschelli, 2020)
Despite the size of the tensor, the method is computationally feasible given that each parameter can be calculated independently, enabling parallelisation (Parisi, Squartini, & Garlaschelli, 2020).
## Reconstruction Feasibility
The following section considers how the Dutch approach to network reconstruction can be applied in the Australian context with particular attention to potential data sources. Broadly speaking, the reconstruction can be considered as a constrained optimisation problem with national accounts input-output and supply-use tables forming global constraints, and individual tax records forming local unit-level constraints. If available, a sample of business connections would then be used to calibrate the optimisation. The calibration step verifies the assumption of the fitness ansatz by ensuring the expected degree of the sample meets the expected degree of the reconstruction. Given the datasets used to form constraints are commonly available to statistical offices (including the ABS), the only novel data component is the sample of links between businesses.
The primary units of analysis are businesses with a registered Australian Business Number (i.e., with an annual turnover greater than AU\$75,000.) As such, the frame has almost complete coverage of Australian businesses and transaction value. Business activity statement (BAS) data provided by the Australian Tax Office (ATO) break down sales and purchases made with a goods and services tax (GST) for each business. Given the GST on imports is reported separately and the GST on exports is generally exempt (ATO source), the scope can be easily reduced to domestic sales and purchases. Despite some missingness from GST-exempt products (namely agricultural), we can therefore determine the value of domestic sales and purchases for each business. For agriculture, sales volume can be calculated from total sales (from BAS data), less the value of exports as reported on customs declarations. This value can also be calculated for other industries to account for any other GST exceptions.
The ABS and CBS conform to the conceptually equivalent national accounting standards (system of national accounts) and similar categorisation of products and industries (the CBS reports 98 products across 81 industries, and the ABS reports 114 products across 67 industries). Therefore, the method's main data requirements are already satisfied.
Observations of the degree (or degree distribution) are required to calibrate and validate the reconstruction. Although bank transaction data would be ideal, practical limitations mean that this source would require significant investment to ensure it is usable for statistical purposes. Similarly, consignment data from freight transportation or package tracking information may prove to be viable, but currently faces similar practical limitations (aside from the obvious absence of digital goods and services). Instead, the ABS is considering manageable and scalable alternatives.
The introduction of single-touch payroll reporting has proliferated the use of common accounting software for businesses with more than 19 employees (Australian Tax Office, 2020). As a result, there has been a concurrent uptake in e-invoicing (i.e., using accounting software to send digital invoices). As such, a small number of accounting software companies provide business accounting software services (including e-invoices) to the majority of businesses. Although the coverage is skewed towards small businesses, the data covers pairs of trading businesses (buyers and suppliers). Therefore, large businesses will be present as suppliers to small businesses.
E-invoicing is a key feature of the Government’s modern digital economy strategy (Prime Minister of Australia, 2021; Department of Treasury, 2020). Although on hold due to the COVID-19 pandemic, it is reasonable to expect that e-invoicing will eventually be rolled out nation-wide (Prime Minister & Cabinet, 2021). Therefore, in the long term, e-invoicing data with near complete coverage could be suitable for statistical purposes.
Survey Data
Existing surveys could be amended to include information on trading relationships. To preserve privacy and reduce administrative burden, these questions would only need to capture aggregate relational data (Breza et al., 2020). For example, additional questions could include: 'How many businesses in industry $$c$$ do you supply commodity $$\alpha$$ to?', and 'What is the total value?' Therefore, in principle, existing surveys can be tailored to inform reconstruction without identifying individual businesses.
## Applications
The following sections describe the potential applications of the reconstructed network, specifically: in the context of government policymaking, macro-economic modelling, and supply chain research. The proposed method should be viewed as a two-stage model wherein the first stage requires reconstructing the network, and the second involves analysing or modelling potential shocks in the network. This additional step combines two, often separate, fields of research, as most network modelling is conducted on fully sampled (as opposed to reconstructed) networks. Given the abundance of information and implied dependence networks convey, it is reasonable to expect that networks could provide greater insight than existing data assets.
### Policymaking
Social and economic systems are driven by complex interactions between numerous interdependent agents, like households and businesses. The growing abundance of information available to policymakers makes it possible to embrace the complexity of these systems and better understand complex issues, i.e., wicked problems (Roberts, 2000).
The traditional approach to complex issues is to simplify the problem: reduce the number of factors, operate in distinct silos, aggregate data, assume linearity, and so on (Cairney & Geyer, 2017; Eppel & Rhodes, 2018; OECD, 2017). The complexity approach on the other hand, recognises that macroscopic phenomena (e.g. climate change, inequality, GDP, etc.) cannot be modelled as linear or independent processes (Cairney & Geyer, 2017; Eppel & Rhodes, 2018; OECD, 2017). Instead, outcomes result from complex interdependent interactions between micro-level agents (Cairney & Geyer, 2017; Eppel & Rhodes, 2018; OECD, 2017). Therefore, by reconstructing the complex network of micro-level relationships between businesses, policymakers can develop a greater understanding of broader economic outcomes.
In practical terms, the reconstructed network can quantify the effects of business relationships on business behaviour and performance. Given that the reconstructed network defines business suppliers and clients, it also implies competitors. Therefore, analysts can calculate the peer effects of neighbouring businesses (for details on peer effect, see: Lee, 2007; Di Falco, Doku, & Mahajan, 2020). For example, how a business is affected by supply shortages among neighbouring firms.
More complex modelling, discussed in the Macro-economic Modelling section below, can simulate dynamic changes in the network. The analytical potential is, for the time being, largely limited to tax data. However, linking additional data (e.g. from other administrative sources) makes it possible to study business dynamics in a variety of fields. For example:
• Macro-economic agencies (e.g. Department of Treasury) can study how economic forces (e.g. prices, interest rates, productivity, etc.) reverberate, dampen, or amplify across the economy.
• Micro-economic agencies (e.g. Australian Competition & Consumer Commission) can analyse the effects of business relationships on firm performance and market efficiency.
• Financial agencies (e.g. Australian Prudential Regulation Authority) can study the risk of financial crises and the impact of a market crash.
• Environmental agencies (e.g. Australian Climate Service) can use the network to understand energy use in production or the flow-on impacts of a natural disaster.
### Macro-economic Modelling
The policymaking examples above rely on sound macro-economic models. However, one of the main shortcomings of economic models is their reliance on highly aggregated statistics (Hendry & Muellbauer, 2018; Pagan, 2019). Fortunately, the abundance and granularity of information in the reconstructed network can be used to fine-tune a variety of models (Mitic, 2020).
Economic shocks can be triggered by a single business and are transmitted along business-level connections (Gabaix, 2011; Acemoglu et al., 2012). Therefore, the reconstructed network is necessary for policymakers to model how economic shocks propagate throughout the economy. For example, COVID-19 impacts, financial instability, supply chain disruption, or policy implementation.
The severity of economic shocks is not only determined by the starting point, but by the structure of the network (Starnini, Boguñá, & Serrano, 2019; Acemoglu, Akcigit, & Kerr, 2016). Squartini et al. (2013) for example, show that the changes in the network structure can be used as an 'early warning signal' of financial collapse. Additionally, Freixas, Laeven & Peydró (2015) explain that regulation designed to improve the stability of individual businesses can inadvertently harm the structure of the economy as a whole. Therefore, policymakers need to consider network structure as well as the most central (highly connected) nodes.
A vector auto-regression (VAR) model can be used as a parsimonious, data-driven approach to extend existing flows into the future while keeping the network structure fixed (Kumar at al., 2021; Kumar, Bansal, & Chakrabarti, 2020; Acemoglu, Akcigit, & Kerr, 2016). Hence, the model can provide detailed insights into short-term effects, such as disruptions in highly efficient just-in-time supply chains.
Although complex, an agent-based model (ABM) is well suited to complex networks because it simulates the interactions of each agent in the network (Ghorbani et al., 2014; Haldane & Turrell, 2019). Unlike traditional macro-economic models, ABMs are not restricted by assumptions around general equilibrium, perfect competition, or rationality (Mercure et al., 2016; Haldane & Turrell, 2019). Accordingly, there is considerable interest in incorporating ABMs as a standard tool for macro-economic modelling (Blanchard, 2018; Hendry & Muellbauer, 2018; Mercure et al., 2016; Haldane & Turrell, 2019). Within ABMs, actors can exhibit ‘realistic’ heterogeneous behaviour, interact with one another, and form new connections (Ghorbani et al., 2014; Mercure et al., 2016; Haldane & Turrell, 2019). Due to this flexibility, ABMs are an effective tool for policy experimentation as they can simulate how networks change over time (Ghorbani et al., 2014; Haldane & Turrell, 2019). To that end, ABMs are not limited by past observations when simulating future events and assessing risk (Hoffmann, 2017).
A pressing concern for policymakers is understanding how supply chains can adapt to disruptions. Given the level of detail available, the reconstructed network can be used to estimate the elasticity and substitution of products along the supply chain. This not only applies to VARs and ABMs but to existing and widely used economic models. For example, ABMs (Inoue & Todo, 2019) and general equilibrium models (Flaaen, & Pandalai-Nayar, 2019; Kashiwagi, Todo, & Matous, 2018; Carvalho et al., 2016) have been used to model the effect of product substitution among firms after a natural disaster. Therefore, policymakers can apply existing economic frameworks to study the capacity of supply chains to absorb or adapt to exogenous shocks.
### Supply Chain Resilience
As a trade-dependent nation, Australia is particularly exposed to international supply chain disruptions. Customs records (import and export declarations) are effective at identifying the primary source of import risk. However, these records fail to capture downstream dependencies in the domestic economy.
The Productivity Commission's report on supply chain vulnerabilities underscores the current data gap in downstream (domestic) supply chains (Productivity Commission, 2021). The reconstructed network offers a potential solution to fill this gap as it can reveal supply chains that are masked in industry-level statistics. The construction of the reconstructed network is based on 114 classifications of goods and services (from the national accounts). In comparison, customs records include detailed descriptions of goods (up to 5,722 for exports and 7,688 for imports (ABS, 2018)). Integrating customs records into the reconstructed network can improve the specificity of products, however the full path can only be implied. Therefore, additional data may be necessary to capture specific product supply chains.
The global pandemic and geopolitical disruptions have highlighted underlying vulnerabilities and triggered a whole-of-government response to supply chain resilience:
• The Department of Prime Minister and Cabinet (2021) Office of Supply Chain Resilience is coordinating the whole of government response.
• The Productivity Commission has developed a framework to identify supply chain risk as the intersection of essential, critical and vulnerable goods and services (Productivity Commission, 2021).
• The Department of Industry, Science, Energy and Resources (2021) is working with Australian industries to identify vulnerabilities and boost resilience in critical products.
• The Department of the Treasury is analysing and mitigating the impact of supply chain disruption, particularly centred around imports.
• The Department of Infrastructure, Transport, Cities and Regional Development (2021a; 2021b), in conjunction with the Commonwealth Scientific and Industrial Research Organisation (2021), is working to quantify and alleviate supply chain risk in physical infrastructure (roads, rail, etc).
• The Department of Home Affairs (2021a; 2021b; 2021c) is investigating and mitigating vulnerabilities in cyber supply chains and critical government infrastructure.
• The Department of Defence (2021) is continuing to review and limit supply chain risk to defensive capability.
• The Australian Trade and Investment Commission, alongside the Department of Foreign Affairs and Trade (2021a; 2021b), is supporting Australian exporters, trade relations, and supply chain adaptability.
The ongoing work on supply chains among government agencies has yielded a considerable amount of high-quality information. Quantitative findings can be easily integrated with the proposed reconstructed network and shared across organisations. But critically, expert and industry-specific information can be used to interpret the reconstructed network and guide policymaking.
Adjacent ABS work on real-time shipping can further increase the value and timeliness of the reconstructed network (MD News, 2021). The ABS, alongside the United Nations, is working to improve trade statistics using real-time ship positions from automated identification system (AIS) transponders. AIS data make it possible to identity port congestion and anticipate supply chain disruption (Verschuur, Koks, & Hall, 2020; Cerdeiro et al., 2020). Therefore, the reconstructed network can integrate physical supply chain vulnerabilities alongside production vulnerabilities.
To summarise, the reconstructed network, alongside techniques described in the Macro-economic Modelling section above, can help quantify and anticipate supply chain disruption and structural risk in the economy.
## Conclusion
Network reconstruction presents new opportunities to quantify complex economic and social systems. More research is needed on how to apply the reconstructed network in practice. However, the growing body of work in network science suggests that network reconstruction has considerable potential to address emerging issues in policymaking, macro-economic modelling, and supply chain vulnerabilities.
Harry Raymond & Daniel Elazar
Australian Bureau of Statistics, Methodology Division, Canberra
### References
Acemoglu D., Akcigit U., Kerr W. (2016). Networks and the macroeconomy: An empirical exploration NBER Macroecon. Annual, 30 (1), pp. 273-335
Acemoglu, D., Carvalho, V. M., Ozdaglar, A., & Tahbaz‐Salehi, A. (2012). The network origins of aggregate fluctuations. Econometrica, 80(5), 1977-2016. https://doi.org/10.3982/ECTA9623
Almog, A., Squartini, T., & Garlaschelli, D. (2015). A GDP-driven model for the binary and weighted structure of the international trade network. New Journal of Physics, 17(1), 13009. https://doi.org/10.1088/1367-2630/17/1/013009
Anand, K., van Lelyveld, I., Banai, Á., Friedrich, S., Garratt, R., Hałaj, G., Fique, J., Hansen, I., Jaramillo, S. M., Lee, H., Molina-Borboa, J. L., Nobili, S., Rajan, S., Salakhova, D., Silva, T. C., Silvestri, L., & de Souza, Sergio Rubens Stancato. (2018). The missing links: A global study on uncovering financial network structures from partial data. Journal of Financial Stability, 35, 107-119. https://doi.org/10.1016/j.jfs.2017.05.012
Australian Bureau of Statistics (2020). Australian National Accounts: Supply Use Tables, retrieved September 9, 2020 https://www.abs.gov.au/statistics/economy/national-accounts/australian-national-accounts-supply-use-tables/latest-release
Australian Bureau of Statistics (2021). Australian National Accounts: Input-Output Tables, retrieved September 9, 2020 https://www.abs.gov.au/statistics/economy/national-accounts/australian-national-accounts-input-output-tables/2018-19
Australian Tax Office, (2020). Single Touch Payroll, retrieved September 1, 2020, https://www.ato.gov.au/business/single-touch-payroll/
Bernard, A. B., Dhyne, E., Magerman, G. C. G., Moxnes, A., & Manova, K. (2019). The origins of firm heterogeneity: A production network approach, National Bureau of Economic Research. https://doi.org/10.3386/w25441
Bernard, A. B., Moxnes, A., & Saito, Y. U. (2019). Production networks, geography, and firm performance. The Journal of Political Economy, 127(2), 639-688. https://doi.org/10.1086/700764
Boehm C. E., Flaaen A., Pandalai-Nayar A. (2019). Input Linkages and the Transmission of Shocks: Firm-Level Evidence from the 2011 Tōhoku Earthquake. The Review of Economics and Statistics; 101 (1): 60–75.
Breza, E., Chandrasekhar, A. G., McCormick, T. H., & Pan, M. (2020). Using aggregated relational data to feasibly identify network structure without network data. The American Economic Review, 110(8), 2454-2484. https://doi.org/10.1257/aer.20170861
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., and Havlin, S. (2010). Catastrophic cascade of failures in interdependent networks. Nature, 464(7291), 1025.
Cairney, P. & Geyer:, R. (2017). "A Critical Discussion of Complexity Theory how does Complexity Thinking improve our Understanding of Politics and Policymaking?" Complexity, Governance & Networks, Vol. 3, No 2, p. 1-11 doi: http://dx.doi.org/10.20377/cgn-56
Caldarelli, G., Capocci, A., De Los Rios, P., & Muñoz, M. A. (2002). Scale-free networks from varying vertex intrinsic fitness. Physical Review Letters, 89(25), 258702-258702. https://doi.org/10.1103/PhysRevLett.89.258702
Carvalho V. M., Nirei M., Saito Y. U., & Tahbaz-Salehi, A. (2016). "Supply Chain Disruptions: Evidence from the Great East Japan Earthquake", Discussion papers 287, Policy Research Institute, Ministry of Finance Japan.
Cerdeiro, D. A, Komaromi, A., Liu, Y., Saeed, M. (2020). World Seaborne Trade in Real Time: A Proof of Concept for Building AIS-based Nowcasts from Scratch, IMF Working Papers, International Monetary Fund
Cimini, G. Squartini, T., Garlaschelli, D., Gabrielli, A. (2015). Systemic risk analysis on reconstructed economic and financial networks, Sci. Rep. 5 15758. http://dx.doi.org/10.1038/srep15758.
Commonwealth Scientific and Industrial Research Organisation (2021). ‘Unlocking infrastructure investment and regulatory options for more efficient transport of agriculture and broader freight’, Transport logistics-TraNSIT, retrieved September 9, 2020, https://www.csiro.au/en/research/technology-space/it/transport-logistics-transit
Cover, T. M., Thomas, J. A. (2006). Elements of Information Theory, Wiley-Interscience
De Masi, G., Iori, G., & Caldarelli, G. (2006). Fitness model for the italian interbank money market. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics, 74(6 Pt 2), 066112-066112. https://doi.org/10.1103/PhysRevE.74.066112
Department of Defence (2021). Global Supply Chain Program, retrieved September 9, 2020, https://www1.defence.gov.au/business-industry/industry-programs/global-supply-chain
Department of Foreign Affairs and Trade (2021a). Joint Statement on the Supply Chain Resilience Initiative by Australian, Indian and Japanese Trade Ministers, retrieved September 9, 2020, https://www.dfat.gov.au/news/media-release/joint-statement-supply-chain-resilience-initiative-australian-indian-and-japanese-trade-ministers
Department of Foreign Affairs and Trade (2021b). ‘Pivot: Diversifying Australia’s Trade and Investment Profile’, Australian government response joint standing committee trade investment growth report retrieved September 9, 2020, https://www.dfat.gov.au/sites/default/files/government-response-joint-standing-committee-trade-investment-growth-report.pdf
Department of Home Affairs (2021a). Critical Technology Supply Chain Principles, Discussion Paper, retrieved September 9, 2020, https://www.homeaffairs.gov.au/reports-and-pubs/files/critical-technology-supply-chain-principles-discussion-paper.pdf
Department of Home Affairs (2021b). Protecting Critical Infrastructure and Systems of National Significance, Consultation Paper, retrieved September 9, 2020, https://www.homeaffairs.gov.au/reports-and-pubs/files/protecting-critical-infrastructure-systems-consultation-paper.pdf
Department of Home Affairs (2021c). Australia’s Cyber Security Strategy 2020, retrieved September 9, 2020, https://www.homeaffairs.gov.au/cyber-security-subsite/files/cyber-security-strategy-2020.pdf
Department of Industry, Science, Energy and Resources (2021). Make it Happen: The Australian Government’s Modern Manufacturing Strategy, retrieved September 9, 2020, https://www.industry.gov.au/data-and-publications/make-it-happen-the-australian-governments-modern-manufacturing-strategy
Department of Infrastructure, Transport, Cities and Regional Development (2021a). The National Freight Data Hub, retrieved September 9, 2020, https://www.infrastructure.gov.au/transport/freight/national-freight-data-hub/index.aspx
Department of Infrastructure, Transport, Cities and Regional Development (2021b). National Freight and Supply Chain Strategy, National Action Plan, retrieved September 9, 2020, https://www.freightaustralia.gov.au/sites/default/files/documents/national-action-plan-august-2019.pdf
Department of Treasury (2020). Options for mandatory e-Invoicing adoption by businesses, retrieved September 1, 2020, from https://treasury.gov.au/consultation/c2020-122716
Dhyne, E., & Duprez, C. (2017). It's a small, small world. A guided tour of the Belgian production network. International Productivity Monitor, (32), 84-96.
Dr Amineh Ghorbani A, Dr Francien DechesneB , Dr Virginia DignumC, Prof. Dr. Catholijn Jonker (2014). Enhancing ABM into an Inevitable Tool for Policy Analysis
Eppel, E.A. & Rhodes, M.L. (2018). "Complexity theory and public management: a ‘becoming’ field", Public management review, vol. 20, no. 7, pp. 949-959.
Freixas X, Laeven L, Peydró J (2015). “Chapter 8 – system risk and microprudential regulation” Systemic risk, crises, and macroprudential regulation. MIT Press, Boston
Furtado, B. A., Fuentes, M. A., & Tessone, C. J. (2019). Policy modeling and applications: State-of-the-art and perspectives. Complexity (New York, N.Y.), 2019, 1-11. https://doi.org/10.1155/2019/5041681
Gabaix X. (2011). The granular origins of aggregate fluctuations, Econometrica, 79 (3), pp. 733-772
Garlaschelli, D., & Loffredo, M. I. (2004). Fitness-dependent topological properties of the world trade web. Physical Review Letters, 93(18), https://doi.org/10.1103/PhysRevLett.93.188701
Garlaschelli, D., Battiston, S., Castri, M., Servedio, V. D. P., & Caldarelli, G. (2005). The scale-free topology of market investments. Physica A, 350(2), 491-499. https://doi.org/10.1016/j.physa.2004.11.040
Ghorbani, A, Dechesne, F, Dignum, V & Jonker, CM (2014). 'Enhancing ABM into an inevitable tool for policy analysis', Journal of Policy and Complex Systems, vol. 1, no. 1, pp. 61-76.
Haldane, A. G., & Turrell, A. E. (2019). Drawing on different disciplines: Macroeconomic agent-based models. Journal of Evolutionary Economics, 29(1), 39-66. doi:http://dx.doi.org.virtual.anu.edu.au/10.1007/s00191-018-0557-5
Hoffmann, C. H. (2017). Towards understanding dynamic complexity in financial systems Structure‐based explanatory modelling of risks. Systems Research and Behavioral Science, 34(6), 728-745. https://doi.org/10.1002/sres.2414
Hooijmaaijers, S., & Buiten, G., (2019). A methodology for estimating the Dutch interfirm trade network, including a breakdown by commodity, Centraal Bureau van Statistiek
Inoue, H., Todo, Y. (2019). Firm-level propagation of shocks through supply-chain networks. Nat Sustain 2, 841–847
Kashiwagi, Y., Todo, Y., & Matous, P. (2018). Propagation of economic shocks through global supply chains—Evidence from Hurricane Sandy. Review of International Economics. https://doi.org/10.1111/roie.12541
Kumar, A., Chakrabarti, A. S., Chakraborti, A., & Nandi, T. (2021). Distress propagation on production networks: Coarse-graining and modularity of linkages. Physics A, 568, 125714. https://doi.org/10.1016/j.physa.2020.125714
Kumar, S., Bansal, A., & Chakrabarti, A. S. (2020). Ripples on financial networks. The European Journal of Finance, 1-22. https://doi.org/10.1080/1351847X.2020.1835686
Lebacher, M., Cook, S., Klein, N., and Kauermann, G., (2019). In search of lost edges: a case study on reconstructing financial networks arXiv:1909.01274
LeBaron, B., & Tesfatsion, L. (2008). Modeling macroeconomies as open-ended dynamic systems of interacting agents. The American Economic Review, 98(2), 246-250. https://doi.org/10.1257/aer.98.2.246
Mazzarisi, P., and Lillo, F., (2017). Methods for Reconstructing Interbank Networks from Limited Information: A Comparison. 10.1007/978-3-319-47705-3_15.
Mercure, J., Pollitt, H., Bassi, A. M., Viñuales, J. E., & Edwards, N. R. (2016). Modelling complex systems of heterogeneous agents to better design sustainability transitions policy. Global Environmental Change, 37, 102-115. https://doi.org/10.1016/j.gloenvcha.2016.02.003
Mitic, P. (2020). Systemic shock propagation in a complex system. Soft Comput 24, 13667–13685 https://doi.org/10.1007/s00500-019-04466-6
Organisation for Economic Cooperation and Development (2017). Debate the Issues: Complexity and policy making, OECD Insights, OECD Publishing, Paris, http://dx.doi.org/10.1787/9789264271531-en.
Pagan, A. (2019). Australian Macro-Econometric Models and Their Construction – A short History Centre for Applied Microeconomic Analyses Working Paper, Australian National University
Parisi, F., Squartini, T., & Garlaschelli, D. (2020). A faster horse on a safer trail: Generalized inference for the efficient reconstruction of weighted networks. New Journal of Physics, 22(5), 53053. https://doi.org/10.1088/1367-2630/ab74a7
Prime Minister & Cabinet (2021). Tracking progress to 2030, Australia’s Digital Economy retrieved from https://digitaleconomy.pmc.gov.au/strategy/tracking-progress
Prime Minister of Australia (2021). A modern digital economy to secure Australia’s future, Media release, retrieved September 1, 2020, https://www.pm.gov.au/media/modern-digital-economy-secure-australias-future
Productivity Commission (2021). Vulnerable Supply Chains, Productivity Commission Study Report, retrieved from https://www.pc.gov.au/inquiries/completed/supply-chains/report/supply-chains.pdf
Rachkov, A., Pijpers, F.P., Garlaschelli, D. (2021). Potential Biases in Network Reconstruction Methods Not Maximizing Entropy, Discussion Paper, Centraal Bureau van Statistiek https://www.cbs.nl/en-gb/background/2021/09/potential-biases-in-network-reconstruction-methods
Ramadiah, A., Caccioli, F., & Fricke, D. (2020). Reconstructing and stress testing credit networks. Journal of Economic Dynamics & Control, 111, 103817. https://doi.org/10.1016/j.jedc.2019.103817
Roberts, N.C. (2000). "Wicked Problems and Network Approaches to Resolution", International Public Management Review, International Public Management Network https://journals.sfu.ca/ipmr/index.php/ipmr/article/view/175
Squartini, T., Almog, A., Caldarelli, G., Van Lelyveld, I., Garlaschelli, D., & Cimini, G. (2017). Enhanced capital-asset pricing model for the reconstruction of bipartite financial networks. Physical Review. E, 96(3), 032315-032315. https://doi.org/10.1103/PhysRevE.96.032315
Squartini, T., Caldarelli, G., Cimini, G., Gabrielli, A., & Garlaschelli, D. (2018). Reconstruction methods for networks: The case of economic and financial systems. Physics Reports, 757, 1-47. https://doi.org/10.1016/j.physrep.2018.06.008
Squartini, T., Van Lelyveld, I., & Garlaschelli, D. (2013). Early-warning signals of topological collapse in interbank networks. Scientific Reports (Nature Publisher Group), 3, 3357.
Starnini M., Boguñá M., Serrano M.Á. (2019). The interconnected wealth of nations: Shock propagation on global trade-investment multiplex networks, Sci. Rep., 9 (1), pp. 1-10
Verschuur, J., Koks, E. E., & Hall, J. W. (2020). Port disruptions due to natural disasters: Insights into port and logistics resilience. Transportation Research. Part D, Transport and Environment, 85, 102393. https://doi.org/10.1016/j.trd.2020.102393
| 2022-10-04T01:27:56 |
{"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.6041780710220337, "perplexity": 5590.655731797875}, "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/1664030337446.8/warc/CC-MAIN-20221003231906-20221004021906-00653.warc.gz"}
|
http://www.scstatehouse.gov/sess120_2013-2014/sj13/20130515.htm
|
South Carolina General Assembly
120th Session, 2013-2014
Journal of the Senate
Wednesday, May 15, 2013
(Statewide Session)
Indicates Matter Stricken
Indicates New Matter
The Senate assembled at 11:00 A.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 Chaplain as follows:
The Psalmist writes:
"The ordinances of the Lord are sure and altogether righteous. They are more precious than gold, than much pure gold, they are sweeter than honey, than honey from the comb." (Psalm 19:9b-10)
Bow with me, if you will:
Gracious God, we beseech You to open the hearts and minds of these leaders so that they will hear Your call to them and rightly respond. Remind them of Your teachings, Lord; set these leaders on the course You would have them to follow. Grant to each Senator insight and compassion. For indeed, how the members of this Body determine to make the best use of and the wisest distribution of our state's resources will have impact for years and years to come. By Your grace, O God, may these leaders carry out their work wisely and well, in accord with Your expectations. Moreover, we ask You to embrace lovingly the family of Senator BOB LAKE, JR., upon his death, and we give You our thanksgiving for his many years of service to this State. In Your wondrous name we pray, Lord.
Amen.
The PRESIDENT called for Petitions, Memorials, Presentments of Grand Juries and such like papers.
Doctor of the Day
Senator SCOTT introduced Dr. E.J. Mayeaux of Columbia, S.C., Doctor of the Day, along with Jamie King, 1st year resident.
Leave of Absence
On motion of Senator PEELER, at 10:05 A.M., Senator FAIR was granted a leave of absence until 2:00 P.M.
Expression of Personal Interest
Senator HUTTO rose for an Expression of Personal Interest.
S. 626 (Word version) Sen. Verdin
On motion of Senator PEELER, with unanimous consent, Senator RANKIN was granted leave to attend a meeting and was granted leave to vote from the balcony.
INTRODUCTION OF BILLS AND RESOLUTIONS
The following were introduced:
S. 699 (Word version) -- Senator Verdin: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 46-25-815 SO AS TO IMPOSE AN INSPECTION FEE OF ONE DOLLAR A TON ON THE DISTRIBUTION OR SALE OF COMMERCIAL FERTILIZER IN THIS STATE, TO PROVIDE THAT THIS FEE MUST BE REPORTED, PAID, AND ENFORCED IN THE SAME MANNER THAT THE EXISTING FIFTY CENTS A TON INSPECTION TAX ON THE SALE OF COMMERCIAL FERTILIZER IS REPORTED, PAID, AND ENFORCED, TO PROVIDE THAT THE REVENUES OF THIS INSPECTION FEE MUST BE RETAINED AND EXPENDED BY THE DIVISION OF REGULATORY AND PUBLIC SERVICE PROGRAMS OF CLEMSON UNIVERSITY (CLEMSON PSA) FOR THE SUPPORT OF THE DIVISION'S PROGRAMS, AND TO PROVIDE THAT UNEXPENDED FEE REVENUES AT THE END OF A FISCAL YEAR CARRY FORWARD TO THE SUCCEEDING FISCAL YEAR AND MUST BE USED FOR THE SAME PURPOSES.
l:\council\bills\bbm\10925htc13.docx
Read the first time and referred to the Committee on Agriculture and Natural Resources.
S. 700 (Word version) -- Senator Thurmond: A BILL TO AMEND SECTION 17-1-40, CODE OF LAWS OF SOUTH CAROLINA, 1976, , RELATING TO THE DESTRUCTION OF RECORDS WHERE CHARGES HAVE BEEN DISMISSED, SO AS TO PROVIDE THAT A PERSON OR ENTITY WHO PUBLISHES ON THE PERSON'S OR ENTITY'S PUBLICLY AVAILABLE WEBSITE A MUG SHOT OF A PERSON WHOSE CHARGES HAVE BEEN DISCHARGED, DISMISSED, OR THE PERSON HAS BEEN FOUND NOT GUILTY, SHALL, WITHOUT FEE OR COMPENSATION, REMOVE THE MUG SHOT FROM THE PERSON'S OR ENTITY'S WEBSITE WITHIN THIRTY DAYS OF THE PERSON SENDING A WRITTEN REQUEST TO THE PERSON OR ENTITY, AND TO PROVIDE THE PENALTIES FOR A PERSON OR ENTITY WHO FAILS TO REMOVE SUCH MUG SHOTS.
l:\s-jud\bills\thurmond\jud0063.jjg.docx
Read the first time and referred to the Committee on Judiciary.
S. 701 (Word version) -- Senators Verdin and Fair: A CONCURRENT RESOLUTION TO REQUEST THE SOUTH CAROLINA DEPARTMENT OF TRANSPORTATION NAME THE INTERSECTION OF SOUTH PLEASANTBURG DRIVE AND EAST FARIS ROAD IN GREENVILLE AS THE "SHERIFF SAM SIMMONS INTERSECTION" AND INSTALL APPROPRIATE MARKERS OR SIGNS ALONG THE ROAD INDICATING THIS DESIGNATION IN RECOGNITION OF SHERIFF SIMMONS' YEARS OF HARD WORK AND SERVICE TO HIS COMMUNITY AND THIS STATE.
l:\s-res\dbv\028simm.mrh.dbv.docx
The Concurrent Resolution was introduced and referred to the Committee on Transportation.
S. 702 (Word version) -- Senator Malloy: A SENATE RESOLUTION TO CONGRATULATE PALMA BURGESS ANDREWS OF LEE COUNTY ON THE OCCASION OF HER NINETY-SIXTH BIRTHDAY AND TO WISH HER MUCH HAPPINESS AND A JOYOUS BIRTHDAY CELEBRATION.
l:\council\bills\rm\1269ac13.docx
S. 703 (Word version) -- Senators Setzler and Massey: A SENATE RESOLUTION TO CONGRATULATE DORIS WILSON ANTLEY OF BATESBURG-LEESVILLE ON THE OCCASION OF HER SEVENTIETH BIRTHDAY AND TO WISH HER A JOYOUS BIRTHDAY CELEBRATION AND MUCH HAPPINESS IN THE YEARS AHEAD.
l:\council\bills\rm\1278ac13.docx
S. 704 (Word version) -- Senator Allen: A SENATE RESOLUTION TO RECOGNIZE AND HONOR CLYDE MAYES OF GREENVILLE, A DOMINANT FORCE IN FURMAN UNIVERSITY BASKETBALL FROM 1971 TO 1975, ON HIS MANY ATHLETIC ACCOMPLISHMENTS, BOTH COLLEGE AND PROFESSIONAL, AND TO CONGRATULATE HIM ON HIS MOST RECENT ACCOLADE, INDUCTION INTO THE SOUTH CAROLINA ATHLETIC HALL OF FAME.
l:\council\bills\rm\1280vr13.docx
S. 705 (Word version) -- Senator Leatherman: A JOINT RESOLUTION TO PROVIDE FOR THE CONTINUING AUTHORITY TO PAY THE EXPENSES OF STATE GOVERNMENT IF THE 2013-2014 FISCAL YEAR BEGINS WITHOUT A GENERAL APPROPRIATIONS ACT FOR THAT YEAR IN EFFECT, AND TO PROVIDE EXCEPTIONS.
l:\council\bills\nl\13221dg13.docx
Read the first time and referred to the Committee on Finance.
S. 706 (Word version) -- Senator Malloy: A BILL TO AMEND SECTION 56-5-2930, THE CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO A PERSON DRIVING A MOTOR VEHICLE WHILE UNDER THE INFLUENCE OF ALCOHOL OR OTHER DRUGS; TO AMEND SECTION 56-5-2933, RELATING TO A PERSON DRIVING A MOTOR VEHICLE WITH AN UNLAWFUL ALCOHOL CONCENTRATION; TO AMEND SECTION 56-5-2950, RELATING TO IMPLIED CONSENT TO TESTING OF A PERSON DRIVING A MOTOR VEHICLE FOR ALCOHOL OR OTHER DRUGS; AND TO AMEND SECTION 56-5-2951, RELATING TO SUSPENSION OF A PERSON'S DRIVER'S LICENSE FOR REFUSING TO SUBMIT TO TESTING OR FOR CERTAIN LEVELS OF ALCOHOL CONCENTRATION, SO AS TO CHANGE THE LEVELS OF UNLAWFUL ALCOHOL CONCENTRATION FROM EIGHT ONE-HUNDREDTHS OF ONE PERCENT OR MORE TO FIVE ONE-HUNDREDTHS OF ONE PERCENT OR MORE, TEN ONE-HUNDREDTHS OF ONE PERCENT OR MORE TO SEVEN ONE-HUNDREDTHS OF ONE PERCENT OR MORE, AND SIXTEEN ONE-HUNDREDTHS OF ONE PERCENT OR MORE TO THIRTEEN ONE-HUNDREDTHS OF ONE PERCENT OR MORE.
l:\s-jud\bills\malloy\jud0069.jjg.docx
Senator MALLOY spoke on the Bill.
Read the first time and referred to the Committee on Judiciary.
S. 707 (Word version) -- Senator Lourie: A BILL TO PROVIDE FOR THE AUTHORITY OF THE CITY OF COLUMBIA TO APPOINT AND COMMISSION FIREFIGHTERS TO SERVE AS CERTIFIED LAW ENFORCEMENT OFFICERS WHO HAVE THE FULL POWERS AS CERTIFIED LAW ENFORCEMENT OFFICERS AND TO REQUIRE FIREFIGHTERS TO MEET CERTAIN QUALIFICATIONS TO BE COMMISSIONED AS A CERTIFIED LAW ENFORCEMENT OFFICER.
l:\council\bills\nbd\11229vr13.docx
Read the first time and ordered placed on the Local and Uncontested Calendar.
H. 3098 (Word version) -- Rep. Spires: A BILL TO AMEND SECTION 44-81-40, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE RIGHTS OF LONG-TERM CARE FACILITY RESIDENTS, SO AS TO REQUIRE A RESIDENT OR HIS REPRESENTATIVE TO PROVIDE THE ADMINISTRATOR OF THE FACILITY CERTAIN NOTICE OF THE INTENT OF THE RESIDENT TO VOLUNTARILY RELOCATE TO ANOTHER FACILITY, AND TO PROVIDE THE FACILITY MAY CHARGE THE RESIDENT THE EQUIVALENT OF THIRTY DAYS OCCUPANCY FOR FAILURE TO GIVE THIS NOTICE.
Read the first time and referred to the Committee on Medical Affairs.
H. 3989 (Word version) -- Education and Public Works Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE STATE BOARD OF EDUCATION, RELATING TO ASSISTING, DEVELOPING, AND EVALUATING PROFESSIONAL TEACHING (ADEPT), DESIGNATED AS REGULATION DOCUMENT NUMBER 4325, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
Read the first time and referred to the Committee on Education.
H. 4129 (Word version) -- Rep. Limehouse: A CONCURRENT RESOLUTION TO RECOGNIZE AND EXPRESS APPRECIATION TO THE SOUTH CAROLINA INSTITUTE OF ARCHAEOLOGY AND ANTHROPOLOGY FOR OUTSTANDING CONTRIBUTIONS TO THE PRESERVATION OF THE STATE'S HISTORIC AND PREHISTORIC PAST ON THE OCCASION OF ITS SIXTIETH ANNIVERSARY.
The Concurrent Resolution was adopted, ordered returned to the House.
REPORT OF STANDING COMMITTEE
Senator VERDIN from the Committee on Agriculture and Natural Resources polled out S. 699 favorable:
S. 699 (Word version) -- Senator Verdin: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 46-25-815 SO AS TO IMPOSE AN INSPECTION FEE OF ONE DOLLAR A TON ON THE DISTRIBUTION OR SALE OF COMMERCIAL FERTILIZER IN THIS STATE, TO PROVIDE THAT THIS FEE MUST BE REPORTED, PAID, AND ENFORCED IN THE SAME MANNER THAT THE EXISTING FIFTY CENTS A TON INSPECTION TAX ON THE SALE OF COMMERCIAL FERTILIZER IS REPORTED, PAID, AND ENFORCED, TO PROVIDE THAT THE REVENUES OF THIS INSPECTION FEE MUST BE RETAINED AND EXPENDED BY THE DIVISION OF REGULATORY AND PUBLIC SERVICE PROGRAMS OF CLEMSON UNIVERSITY (CLEMSON PSA) FOR THE SUPPORT OF THE DIVISION'S PROGRAMS, AND TO PROVIDE THAT UNEXPENDED FEE REVENUES AT THE END OF A FISCAL YEAR CARRY FORWARD TO THE SUCCEEDING FISCAL YEAR AND MUST BE USED FOR THE SAME PURPOSES.
Poll of the Agriculture and Natural Resources Committee
Polled 17; Ayes 13; Nays 4; Not Voting 0
AYES
Verdin Matthews McGill
Grooms Williams Campbell
Sheheen Gregory Massey
Coleman Hembree Johnson
McElveen
Total--13
NAYS
Bryant Corbin Shealy
Young
Total--4
Ordered for consideration tomorrow.
Message from the House
Columbia, S.C., May 14, 2013
Mr. President and Senators:
The House respectfully informs your Honorable Body that it concurs in the amendments proposed by the Senate to:
S. 237 (Word version) -- Senators Shealy, Setzler, Courson, Turner, Cromer, Massey, Young, Alexander and McElveen: A BILL TO AMEND SECTION 10-1-161 OF THE 1976 CODE, RELATING TO STATE CAPITOL BUILDING FLAGS FLOWN AT HALF-STAFF, TO PROVIDE THAT FLAGS ATOP THE STATE CAPITOL BUILDING MUST BE LOWERED TO HALF-STAFF FOR MEMBERS OF THE UNITED STATES MILITARY SERVICES, WHO WERE RESIDENTS OF THIS STATE AND WHO LOST THEIR LIVES IN THE LINE OF DUTY, ON THE DAY WHEN THEIR NAMES ARE RELEASED TO THE GENERAL PUBLIC, AND THE FLAGS SHALL REMAIN AT HALF-STAFF UNTIL AT LEAST DAWN THE SECOND DAY AFTER FUNERAL SERVICES ARE CONDUCTED.
and has ordered the Bill enrolled for Ratification.
Very respectfully,
Speaker of the House
Message from the House
Columbia, S.C., May 14, 2013
Mr. President and Senators:
The House respectfully informs your Honorable Body that it concurs in the amendments proposed by the Senate to:
H. 3097 (Word version) -- Rep. Bales: A BILL TO AMEND CHAPTER 56, TITLE 44 OF THE 1976 CODE, RELATING TO THE DRYCLEANING FACILITY RESTORATION TRUST FUND, SO AS TO, AMONG OTHER THINGS, SPECIFY THE USE AND PURPOSE OF THE FUND, AUTHORIZE THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL TO EXPEND MONIES FROM THE FUND FOR ASSESSMENT OF POTENTIAL SITES PRIOR TO OBTAINING EVIDENCE OF CONTAMINATION AT THE SITE, AND CLARIFY WHAT FACILITIES ARE EXCLUDED FROM PARTICIPATING IN THE FUND AND THE EFFECT OF PARTICIPATING IN THE FUND IF A FACILITY IS SEEKING EXEMPTION FROM THE FUND; AND TO DELETE OBSOLETE PROVISIONS, REORGANIZE PROVISIONS, AND MAKE TECHNICAL CORRECTIONS.
and has ordered the Bill enrolled for Ratification.
Very respectfully,
Speaker of the House
THE SENATE PROCEEDED TO A CALL OF THE UNCONTESTED LOCAL AND STATEWIDE CALENDAR.
ORDERED ENROLLED FOR RATIFICATION
The following Bill was read the third time and, having received three readings in both Houses, it was ordered that the title be changed to that of an Act and enrolled for Ratification:
H. 3087 (Word version) -- Reps. Merrill and Daning: A BILL TO AMEND SECTION 59-40-50, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO VARIOUS CHARTER SCHOOL REQUIREMENTS, POWERS, AND DUTIES, SO AS TO PROVIDE THAT A CHARTER SCHOOL LOCATED ON A FEDERAL MILITARY INSTALLATION OR BASE WHERE THE APPROPRIATE AUTHORITIES HAVE MADE BUILDINGS, FACILITIES, AND GROUNDS ON THE INSTALLATION OR BASE AVAILABLE FOR USE BY THE CHARTER SCHOOL, AS ITS PRINCIPAL LOCATION, ALSO MAY GIVE ENROLLMENT PRIORITY TO OTHERWISE ELIGIBLE STUDENTS WHO ARE DEPENDENTS OF MILITARY PERSONNEL LIVING IN MILITARY HOUSING ON THE BASE OR INSTALLATION OR WHO ARE CURRENTLY STATIONED AT THE BASE OR INSTALLATION NOT TO EXCEED FIFTY PERCENT OF THE TOTAL ENROLLMENT OF THE CHARTER SCHOOL.
H. 3193 (Word version) -- Reps. Rutherford and King: A BILL TO AMEND SECTION 24-13-40, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE COMPUTATION OF TIME SERVED BY A PRISONER, SO AS TO PROVIDE THAT ANY TIME SERVED UNDER HOUSE ARREST BY A PRISONER MUST BE USED IN COMPUTING TIME SERVED BY THE PRISONER.
The Senate proceeded to a 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 39; Nays 2
AYES
Alexander Allen Bennett
Bright Campbell Campsen
Cleary Courson Cromer
Davis Gregory Grooms
Hayes Hembree Hutto
Jackson Johnson Leatherman
Lourie Malloy Martin, Larry
Martin, Shane Massey Matthews
McElveen McGill Nicholson
Peeler Rankin Reese
Scott Setzler Shealy
Sheheen Thurmond Turner
Verdin Williams Young
Total--39
NAYS
Bryant Corbin
Total--2
The Bill was read the second time and ordered placed on the Third Reading Calendar.
H. 3751 (Word version) -- Rep. Sandifer: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, SO AS TO CONFORM WITH FEDERAL MANDATES ENACTED BY THE UNITED STATES CONGRESS IN THE TRADE ADJUSTMENT ASSISTANCE EXTENSION ACT OF 2011; BY ADDING SECTION 41-41-45 SO AS TO PROVIDE THE DEPARTMENT OF EMPLOYMENT AND WORKFORCE SHALL IMPOSE A PENALTY ON FRAUDULENT OVERPAYMENTS OF UNEMPLOYMENT BENEFITS; BY ADDING SECTION 41-33-910 SO AS TO CREATE THE DEPARTMENT OF EMPLOYMENT AND WORKFORCE INTEGRITY FUND AND PROVIDE FOR ITS SOURCE AND USE; BY ADDING SECTION 41-35-135 SO AS TO PROVIDE THE DEPARTMENT SHALL CHARGE THE ACCOUNT OF AN EMPLOYER WHEN THE EMPLOYER FAILS TO RESPOND TIMELY OR ADEQUATELY TO A REQUEST BY THE DEPARTMENT FOR INFORMATION CONCERNING A CLAIM FOR UNEMPLOYMENT BENEFITS WHEN THE EMPLOYER HAS DEMONSTRATED A PATTERN OF FAILING TO TIMELY OR ADEQUATELY RESPOND TO THESE REQUESTS; AND TO AMEND SECTION 43-5-598, AS AMENDED, RELATING TO DEFINITIONS CONCERNING THE SOUTH CAROLINA EMPLOYABLES PROGRAM ACT, SO AS TO REVISE THE DEFINITION OF "NEW HIRE" TO APPLY WHERE THE SEPARATION OF AN EMPLOYEE FROM EMPLOYMENT IS FOR AT LEAST SIXTY CONSECUTIVE DAYS.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator ALEXANDER proposed the following amendment (3751R002.TCA), which was adopted:
Amend the bill, as and if amended, by striking all after the enacting words and inserting:
/ SECTION 1. Chapter 41, Title 41 of the 1976 Code is amended by adding:
"Section 41-41-45. (A) Notwithstanding any other provision of law, if the department determines that an improper payment from its unemployment compensation fund or from any federal unemployment compensation fund was made to any individual due to a false statement or failure to disclose a material fact pursuant to Sections 41-41-10 and 41-41-20, the department will assess a monetary penalty of twenty-five percent of the amount of the overpayment.
(B) The notice of the determination or decision informing the individual of the overpayment must include:
(1) the claimant's appeal rights;
(2) the penalty amount;
(3) an explanation of the reason for the overpayment; and
(4) the reason the penalty has been applied.
(C) The recovered amounts shall be applied with priority to:
(1) the principal amount of the overpayment to the unemployment compensation fund;
(2) sixty percent of the monetary penalty to the unemployment compensation fund;
(3) the remaining forty percent of the monetary penalty to promote unemployment compensation integrity; and
(4) any remaining amounts to interest.
(D) Offset of future unemployment insurance benefits shall not be applied to the monetary penalty or interest associated with an overpayment.
(E) The monetary penalty will be assessed on any fraudulent overpayment determined by the department after October 21, 2013."
SECTION 2. Chapter 35, Title 41 of the 1976 Code is amended by adding:
"Section 41-35-135. (A) Notwithstanding any other provision of law, the department shall not relieve the charge benefits to an employer's account when it determines that the overpayment has been made to a claimant and it determines that both of the following conditions apply:
(1) the overpayment occurred because the employer was at fault for failing to respond timely or adequately to a written request of the department for information relating to an unemployment compensation claim; and
(2) the employer exhibits a pattern of failure to timely or adequately respond to requests from the department for information relating to unemployment compensation claims on three or more occasions, or three percent of requests made, within a single calendar year, whichever is greater; provided:
(a) If an employer uses a third-party agent to respond on its behalf to the department's request for information relating to an unemployment compensation claim, the agent's actions on behalf of the employer will be considered when determining a pattern of behavior.
(b) A response is considered untimely if it fails to meet the time as prescribed in the statute or in the regulations.
(c) A response is considered inadequate if it fails to provide sufficient facts to enable the department to make an accurate determination of benefits that do not result in an overpayment. However, a response may not be considered inadequate if the department fails to request the necessary information.
(B) In all cases where the department contacts, or attempts to contact, an employer via telephone concerning a claim for benefits, it must document the contact, or attempt to contact, the employer and provide the documentation to the employer upon request. The documentation must contain the name of the department's staff contacting, or attempting to contact, the employer, the date, time, and whether the department's staff spoke with the employer, and the name of the person with whom the department's staff spoke, if anyone.
(C) A written request for information may be made by electronic mail provided, the employer has opted for notice by electronic mail pursuant to Section 41-35-615.
(D) The department shall charge an employer's account that meets the conditions of subsection (A) for each week of unemployment compensation that is an overpayment until the department makes a determination that the individual is no longer eligible for unemployment compensation and stops making such payments.
(E) If the claim is a combined wage claim, the determination of not charging for the combined wage claim shall be made by the paying state. If the response from the employer does not meet the criteria established by the paying state for an adequate or timely response, the paying state must promptly notify the transferring state of its determination and the employer must be appropriately charged.
(F)(1) The department must waive the charging of benefits to an employer's account when the department finds the employer failed to timely or adequately respond due to good cause.
(2) For the purposes of this section, 'good cause' may include, but is not limited to, an error made by the department that results in the employer's error, or a natural disaster, emergency, or similar event, or an illness on the part of the employer, the employer's agent of record, or the employer's staff charged with responding to inquiries. The burden is on the employer to establish good cause.
(G) Determinations of the department prohibiting the relief of charges pursuant to this section shall be subject to appeal pursuant to procedures contained in Chapter 35, Title 41.
(H) The department shall charge benefits to an employer's account pursuant to this section for any overpayment determined by the department after October 21, 2013."
SECTION 3. Section 43-5-598(A)(6) of the 1976 Code is amended to read:
"(6) 'New hire' includes an individual newly employed or an individual who has been rehired who was separated for at least sixty consecutive days or has returned to work after being laid off, furloughed, separated, granted leave without pay, or terminated from employment for at least sixty consecutive days."
SECTION 4. A. Title 41, Chapter 33 of the 1976 Code is amended by adding:
"Section 41-33-910. (A) There is created in the State Treasury a special fund to be known as the Department of Employment and Workforce integrity fund.
(B) The fund shall consist of monetary penalties collected pursuant to Section 41-41-45(C)(3) for the purpose of promoting unemployment compensation integrity. The Department of Employment and Workforce integrity fund shall be used for the purpose of preserving the integrity of the unemployment compensation fund. These efforts may include, but are not limited to, identifying overpayments, verifying eligibility, determining status, and updating technology and education tools to support integrity activities.
(C) All money collected in the integrity fund must be deposited, administered, and disbursed in the same manner and under the same conditions and requirements as are provided by law for other special funds in the State Treasury, except that money in this fund must not be commingled with other state funds, but must be maintained in a separate account on the books of a depository bank. These funds must be secured by the bank by securities or surety bonds as required by law of depositories of state funds.
(D) All money that is deposited or paid into the fund is appropriated and made available to the department. All money in this fund must be expended solely for the purpose of promoting unemployment insurance integrity efforts by the department as provided in Section 41-41-45.
(E) All balances in this fund must not lapse at any time but must be continuously available to the department by expenditure consistent with Chapters 27 through 41 of the title. The department shall issue its requisition, which must be approved by the executive director or any designated officer, agent, or other individual for payment of the costs of interest to the Comptroller General who shall draw his warrant in the usual form provided by law on the State Treasurer, who shall pay it by check on the integrity fund."
B. The provisions of this SECTION take effect October 1, 2013.
SECTION 5. The Department of Employment and Workforce must, as soon as practicable, fully implement an on-line, employer pre-filing program that allows employers to address potential claims for benefits by one of the employer's former employees. The department must report progress on implementation upon request by the Chairman of the Senate Labor, Commerce and Industry Committee or the Chairman of the House Labor, Commerce and Industry Committee.
SECTION 6. This act takes effect upon approval by the Governor./
Renumber sections to conform.
Amend title to conform.
Senator BRYANT explained the amendment.
The question then was second reading of the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 38; Nays 0
AYES
Alexander Allen Bennett
Bright Bryant Campbell
Campsen Cleary Corbin
Courson Cromer Davis
Gregory Grooms Hayes
Hutto Jackson Johnson
Leatherman Malloy Martin, Larry
Martin, Shane Massey Matthews
McGill Nicholson Peeler
Rankin Reese Scott
Setzler Shealy Sheheen
Thurmond Turner Verdin
Williams Young
Total--38
NAYS
Total--0
The Bill was read the second time and ordered placed on the Third Reading Calendar.
S. 348 (Word version) -- Senator L. Martin: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 6-10-35 SO AS TO PROVIDE FOR REQUIREMENTS FOR FIREPLACES IN LIEU OF REQUIREMENTS OF THE 2009 EDITION OF THE INTERNATIONAL ENERGY CONSERVATION CODE.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator LARRY MARTIN explained the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 39; Nays 0
AYES
Alexander Allen Bennett
Bright Bryant Campbell
Campsen Cleary Corbin
Courson Cromer Davis
Gregory Grooms Hayes
Hembree Hutto Jackson
Johnson Leatherman Lourie
Malloy Martin, Larry Martin, Shane
Massey McGill Nicholson
Peeler Rankin Reese
Scott Setzler Shealy
Sheheen Thurmond Turner
Verdin Williams Young
Total--39
NAYS
Total--0
The Bill was read the second time and ordered placed on the Third Reading Calendar.
S. 690 (Word version) -- Labor, Commerce and Industry Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE BOARD OF ARCHITECTURAL EXAMINERS, RELATING TO OFFICERS, MEETINGS, APPLICATIONS AND FEES, RENEWALS, AND CONTINUING EDUCATION, DESIGNATED AS REGULATION DOCUMENT NUMBER 4334, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
The Senate proceeded to a consideration of the Resolution, the question being the second reading of the Joint Resolution.
Senator MASSEY explained the Joint Resolution.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 39; Nays 0
AYES
Alexander Allen Bennett
Bright Bryant Campbell
Campsen Cleary Coleman
Corbin Courson Cromer
Davis Gregory Grooms
Hayes Hembree Hutto
Johnson Leatherman Lourie
Malloy Martin, Larry Martin, Shane
Massey Matthews McElveen
McGill Nicholson Peeler
Scott Setzler Shealy
Sheheen Thurmond Turner
Verdin Williams Young
Total--39
NAYS
Total--0
The Joint Resolution was read the second time and ordered placed on the Third Reading Calendar.
S. 692 (Word version) -- Labor, Commerce and Industry Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE RESIDENTIAL BUILDERS COMMISSION, RELATING TO RESIDENTIAL SPECIALTY CONTRACTORS LICENSE, DESIGNATED AS REGULATION DOCUMENT NUMBER 4252, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
The Senate proceeded to a consideration of the Resolution, the question being the second reading of the Joint Resolution.
Senator MASSEY explained the Joint Resolution.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 38; Nays 3
AYES
Alexander Allen Bennett
Campbell Campsen Cleary
Coleman Courson Cromer
Davis Gregory Grooms
Hayes Hembree Hutto
Jackson Johnson Leatherman
Lourie Malloy Martin, Larry
Martin, Shane Massey Matthews
McElveen McGill Nicholson
Peeler Reese Scott
Setzler Shealy Sheheen
Thurmond Turner Verdin
Williams Young
Total--38
NAYS
Bright Bryant Corbin
Total--3
The Joint Resolution was read the second time and ordered placed on the Third Reading Calendar.
AMENDMENT PROPOSED
POINT OF ORDER
H. 3762 (Word version) -- Reps. Ott, Skelton, Hardwick, Hodges, Knight, Bales, Jefferson, Parks, Sellers, Finlay, Funderburk, Gagnon, Gambrell, George, Hayes, Hiott, Hixon, Horne, Lowe, D.C. Moss, Norman, Pitts, Putnam, Riley, White, Williams and Vick: A BILL TO AMEND SECTIONS 50-11-740, AS AMENDED, AND 50-11-745, RELATING TO THE CONFISCATION, FORFEITURE, SALE, AND RELEASE OF PROPERTY USED FOR THE UNLAWFUL HUNTING OF WILDLIFE, SO AS TO PROVIDE ADDITIONAL TYPES OF PROPERTY THAT ARE COVERED BY BOTH PROVISIONS, AND TO REVISE THE PENALTIES THAT MAY BE IMPOSED FOR THE UNLAWFUL HUNTING OF WILDLIFE.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator CAMPSEN proposed the following amendment (3762R002.GEC):
Amend the bill, as and if amended, page 1, by striking SECTION 1 in its entirety and inserting:
/ SECTION 1. Section 50-11-740 of the 1976 Code, as last amended by Act 228 of 2012, is further amended to read:
"Section 50-11-740. (A) Every vehicle, boat, trailer, other means of conveyance, animal, and firearm, or device used in the hunting of deer or bear at night, or used in connection with a violation of Section 50-11-710, is forfeited to the State and must be confiscated seized by any peace officer who shall forthwith deliver it to the department.
(B) 'Hunting' as used in this section in reference to a vehicle, boat, or other means of conveyance includes the transportation of a hunter to or from the place of hunting or the transportation of the carcass, or any part of the carcass, of a deer, or bear, coyote, armadillo, or feral hog which has been unlawfully killed at night.
(C)(1) For purposes of this section, a conviction for unlawfully hunting deer, or bear, coyote, armadillo, or feral hog at night is conclusive as against any convicted owner of the above mentioned property.
(2) In all other instances, forfeiture must be accomplished by the initiation by the State of an action in the circuit court in the county in which the property was seized giving notice to owners of record and lienholders of record or other persons having claimed an interest in the property subject to forfeiture and an opportunity to appear and show, if they can, why the property should not be forfeited and disposed of as provided for by this section. Failure of any person claiming an interest in the property to appear at the above proceeding after having been given notice of the proceeding constitutes a waiver of his claim and the property must be immediately forfeited to the State.
(3) Notice of the above proceedings must be accomplished by:
(a) personal service of the owner of record or lienholder of record by certified copy of the petition or notice of hearing; or
(b) in the case of property for which there is no owner or lienholder of record, publication of notice in a newspaper of local circulation in the county where the property was seized for at least two successive weeks before the hearing.
(D) The department shall sell any confiscated device at public auction for cash to the highest bidder in front of the county courthouse in the county where it is confiscated, after having given ten days' public notice of the sale by posting advertisement thereof on the door or bulletin board of the county courthouse or by publishing the advertisement at least once in a newspaper of general circulation in the county. Upon sale, the department shall pay over the net proceeds, after payment of the proper costs and expenses, if any, of the seizure, advertisement, and sale, including any proper expense incurred for the storage of the confiscated device, to the State Treasurer for deposit in the Fish and Wildlife Protection Fund. When
(E)(1) If an individual is apprehended for a first offense and the device is of greater value than one two thousand five hundred dollars, the owner may at any time before sale redeem it by paying to the department the sum of one two thousand five hundred dollars. When the device is of lesser value than one two thousand five hundred dollars, the owner may at any time before sale redeem it by paying to the department the retail market value. The sums received by the department must be deposited in the game protection fund pursuant to the provisions of this section.
(2) If an individual is apprehended for a second offense and the device is of greater value than five thousand dollars, the owner may, at any time before sale, redeem it by paying to the department the sum of five thousand dollars. When the device is of lesser value than five thousand dollars, the owner may, at any time before sale, redeem it by paying to the department the retail market value.
(3) If an individual is apprehended for a third or subsequent offense, the device must be forfeited to the State.
(F) Upon sale or redemption of a confiscated device, the department shall pay over the net proceeds, after payment of any proper costs and expenses of the seizure, advertisement, and sale, including any proper expense incurred for the storage of the confiscated device, to the State Treasurer for deposit in the County Game and Fish Fund." /
Renumber sections to conform.
Amend title to conform.
Senator CAMPSEN explained the amendment.
H. 3762--Point of Order
Senator SHANE 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.
CARRIED OVER
H. 3540 (Word version) -- Reps. Harrell, J.E. Smith, Bales, Hosey, Cobb-Hunter, Bannister, J.R. Smith, Patrick, Brannon, Erickson, Taylor, Huggins, Kennedy, Ballentine, Bernstein, Sellers, Williams, Jefferson, M.S. McLeod, Atwater, Bowers, R.L. Brown, Cole, Douglas, George, Hixon, Long, McCoy, Mitchell, Pitts, Pope, G.R. Smith, Tallon, Wood, Weeks, Knight and Hart: A BILL TO AMEND SECTION 1-3-240, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE REMOVAL OF OFFICERS BY THE GOVERNOR, SO AS TO ADD THE ADJUTANT GENERAL TO THE LIST OF OFFICERS OR ENTITIES THE GOVERNING BOARD OF WHICH MAY BE REMOVED BY THE GOVERNOR ONLY FOR CERTAIN REASONS CONSTITUTING CAUSE; TO AMEND SECTION 25-1-320, RELATING TO THE STATE ADJUTANT GENERAL, SO AS TO PROVIDE THAT BEGINNING UPON THE EXPIRATION OF THE TERM OF THE ADJUTANT GENERAL SERVING IN OFFICE ON THE DATE OF THE 2014 GENERAL ELECTION, THE ADJUTANT GENERAL MUST BE APPOINTED BY THE GOVERNOR UPON THE ADVICE AND CONSENT OF THE SENATE FOR A FOUR-YEAR TERM COMMENCING ON THE FIRST WEDNESDAY FOLLOWING THE SECOND TUESDAY IN JANUARY THAT FOLLOWS THE GENERAL ELECTION THAT MARKS THE MIDTERM OF THE GOVERNOR, EXCEPT THAT THE INITIAL TERM OF THE FIRST ADJUTANT GENERAL APPOINTED PURSUANT TO THIS ACT MUST BE FOR TWO YEARS SO AS TO ALLOW SUBSEQUENT TERMS TO BE STAGGERED WITH THAT OF THE GOVERNOR, AND TO ESTABLISH CERTAIN QUALIFICATIONS FOR THE OFFICE OF ADJUTANT GENERAL; TO AMEND SECTION 25-1-340, AS AMENDED, RELATING TO VACANCIES IN THE OFFICE OF ADJUTANT GENERAL, SO AS TO DELETE A REFERENCE TO THE ELIGIBILITY REQUIREMENTS OF CONSTITUTIONAL OFFICERS; AND TO PROVIDE THAT THE ABOVE PROVISIONS ARE EFFECTIVE UPON THE RATIFICATION OF AMENDMENTS TO SECTION 7, ARTICLE VI, AND SECTION 4, ARTICLE XIII OF THE CONSTITUTION OF THIS STATE DELETING THE REQUIREMENT THAT THE STATE ADJUTANT GENERAL BE ELECTED BY THE QUALIFIED ELECTORS OF THIS STATE.
On motion of Senator MASSEY, the Bill was carried over.
H. 3360 (Word version) -- Reps. Owens, Daning, Hiott, Skelton, Simrill, Anthony, Bedingfield, Clemmons, Delleney, Hardwick, Henderson, Hixon, Limehouse, Nanney, Ott, Pope, G.R. Smith, J.E. Smith, Sottile, Stringer, Tallon, Taylor and Bales: A BILL TO AMEND SECTIONS 57-5-10, 57-5-70, AND 57-5-80, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE COMPOSITION OF THE STATE HIGHWAY SYSTEM, ADDITIONS TO THE STATE HIGHWAY SECONDARY SYSTEM, AND THE DELETION AND REMOVAL OF ROADS FROM THE STATE HIGHWAY SECONDARY SYSTEM, SO AS TO PROVIDE THAT ALL HIGHWAYS WITHIN THE STATE HIGHWAY SYSTEM SHALL BE CONSTRUCTED TO THE DEPARTMENT OF TRANSPORTATION STANDARDS, TO PROVIDE THE FUNDING SOURCES THAT THE DEPARTMENT USES TO CONSTRUCT AND MAINTAIN THESE HIGHWAYS, TO REVISE THE PROCEDURE AND WHEREBY ENTITIES TO WHICH THE DEPARTMENT MAY TRANSFER ROADS WITHIN THE STATE HIGHWAY SECONDARY SYSTEM; AND TO REVISE THE PROCEDURE WHEREBY THE DEPARTMENT MAY ADD A ROAD FROM THE COUNTY OR MUNICIPAL ROAD TO THE STATE HIGHWAY SYSTEM; AND TO REPEAL SECTION 57-5-90 RELATING TO THE ESTABLISHMENT AND MAINTENANCE OF BELT LINES AND SPURS.
On motion of Senator GROOMS, the Bill was carried over.
S. 509 (Word version) -- Senators Thurmond, Hembree and Rankin: A BILL TO AMEND CHAPTER 13, TITLE 24 OF THE 1976 CODE, RELATING TO OFFENSES IN CONNECTION WITH ELECTRONIC MONITORING DEVICES, BY ADDING SECTION 24-13-425 TO PROVIDE THAT IT IS UNLAWFUL FOR ANY PERSON TO KNOWINGLY AND WITHOUT AUTHORITY TO REMOVE, DESTROY, OR CIRCUMVENT THE OPERATION OF AN ELECTRONIC MONITORING DEVICE WHICH IS BEING USED FOR THE PURPOSE OF MONITORING A PERSON, OR TO SOLICIT ANOTHER PERSON TO DO SO, AND TO PROVIDE FOR PENALTIES.
On motion of Senator MASSEY, the Bill was carried over.
H. 3459 (Word version) -- Reps. Sandifer, Bales, J.E. Smith and Erickson: A BILL TO AMEND SECTION 40-2-10, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE SOUTH CAROLINA BOARD OF ACCOUNTANCY, SO AS TO PROVIDE THE DEPARTMENT OF LABOR, LICENSING AND REGULATION SHALL DESIGNATE CERTAIN PERSONNEL FOR THE EXCLUSIVE USE OF THE BOARD, TO PROHIBIT THE DEPARTMENT FROM ASSIGNING OTHER WORK TO THESE PERSONNEL WITHOUT APPROVAL OF THE BOARD, AND TO PROVIDE THESE PERSONNEL MAY BE TERMINATED BY THE DIRECTOR OF A MAJORITY OF THE BOARD; TO AMEND SECTION 40-2-30, RELATING TO THE PRACTICE OF ACCOUNTANCY, SO AS TO PROVIDE A CERTIFIED PUBLIC ACCOUNTANT LICENSED BY THE BOARD IS EXEMPT FROM LICENSURE REQUIREMENTS OF PRIVATE SECURITY AND INVESTIGATION AGENCIES; AND TO AMEND SECTION 40-2-70, RELATING TO POWERS AND DUTIES OF THE BOARD, SO AS TO PROVIDE THE BOARD MAY CONDUCT PERIODIC INSPECTIONS OF LICENSEES OR FIRMS; AND TO AMEND SECTION 40-2-80, RELATING TO INVESTIGATIONS OF ALLEGED VIOLATIONS, SO AS TO PROVIDE THE DEPARTMENT SHALL DIRECT THE INVESTIGATOR ASSIGNED TO THE BOARD TO INVESTIGATE AN ALLEGED VIOLATION TO DETERMINE THE EXISTENCE OF PROBABLE CAUSE MERITING FURTHER PROCEEDINGS.
On motion of Senator MASSEY, the Bill was carried over.
H. 3061 (Word version) -- Reps. McCoy, M.S. McLeod, Stavrinakis and Sellers: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 59-63-95 SO AS TO REQUIRE THE DEPARTMENT OF EDUCATION TO DEVELOP AND DISTRIBUTE MODEL POLICIES CONCERNING THE NATURE AND RISK OF CONCUSSIONS SUSTAINED BY STUDENT ATHLETES, TO REQUIRE EACH LOCAL SCHOOL DISTRICT TO DEVELOP ITS OWN POLICY, TO REQUIRE THE REVIEW OF THE POLICY BY STUDENT ATHLETES AND THEIR PARENTS OR GUARDIANS, TO REQUIRE THE REMOVAL FROM PLAY AND MEDICAL EVALUATION OF A STUDENT ATHLETE BELIEVED TO HAVE SUSTAINED A CONCUSSION DURING PLAY, TO ALLOW FOR THE EVALUATION TO BE UNDERTAKEN BY A VOLUNTEER HEALTH CARE PROVIDER, AND TO PROVIDE THAT LOCAL SCHOOL DISTRICTS ARE NOT REQUIRED TO ENFORCE THE PROVISIONS OF THIS SECTION.
On motion of Senator SCOTT, the Bill was carried over.
S. 691 (Word version) -- Labor, Commerce and Industry Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE DEPARTMENT OF LABOR, LICENSING AND REGULATION-BUILDING CODES COUNCIL, RELATING TO INTERNATIONAL RESIDENTIAL CODE, DESIGNATED AS REGULATION DOCUMENT NUMBER 4321, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
On motion of Senator SHANE MARTIN, the Joint Resolution was carried over.
At 11:05 A.M., Senator LARRY MARTIN asked unanimous consent to make a motion to invite the House of Representatives to attend the Senate Chamber for the purpose of ratifying Acts at a mutually agreeable time.
There was no objection and a message was sent to the House accordingly.
RATIFICATION OF ACTS
Pursuant to an invitation the Honorable Speaker and House of Representatives appeared in the Senate Chamber on May 15, 2013, at 11:45 A.M. and the following Acts and Joint Resolution were ratified:
(R37, S. 237 (Word version)) -- Senators Shealy, Setzler, Courson, Turner, Cromer, Massey, Young, Alexander and McElveen: AN ACT TO AMEND SECTION 10-1-161, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE FLYING OF FLAGS ATOP THE STATE CAPITOL BUILDING AT HALF-STAFF, SO AS TO PROVIDE THE LENGTH OF TIME THAT THESE FLAGS MAY BE FLOWN AT HALF-STAFF FOR MEMBERS OF THE UNITED STATES MILITARY SERVICES WHO WERE RESIDENTS OF SOUTH CAROLINA AND WHO LOST THEIR LIVES IN THE LINE OF DUTY WHILE IN COMBAT, TO PROVIDE THE PROCEDURE FOR HOISTING AND LOWERING THE FLAGS ATOP THE STATE CAPITOL BUILDING WHEN MORE THAN ONE INDIVIDUAL IS HONORED, AND TO PROVIDE THAT ON A DAY WHERE THE FLAGS ATOP THE STATE CAPITOL BUILDING ARE FLOWN AT HALF-STAFF, THE GOVERNOR SHALL IDENTIFY THE PERSON OR PERSONS WHO ARE HONORED ON THE GOVERNOR'S WEBSITE.
L:\COUNCIL\ACTS\237CM13.DOCX
(R38, S. 448 (Word version)) -- Senators Alexander, Peeler, Cleary and S. Martin: AN ACT TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 40-47-938 SO AS TO PROVIDE CIRCUMSTANCES IN WHICH A PHYSICIAN MAY ENTER A SUPERVISORY RELATIONSHIP WITH A PHYSICIAN ASSISTANT; TO AMEND SECTION 40-47-910, RELATING TO DEFINITIONS IN THE PHYSICIAN ASSISTANTS PRACTICE ACT, SO AS TO ADD AND REVISE CERTAIN DEFINITIONS; TO AMEND SECTION 40-47-940, RELATING TO APPLICATION FOR LICENSURE, SO AS TO PROVIDE AN APPLICATION MUST BE COMPLETE BEFORE A LICENSE MAY BE GRANTED; TO AMEND SECTION 40-47-945, RELATING TO CONDITIONS FOR GRANTING PERMANENT LICENSURE, SO AS TO DELETE REQUIREMENTS THAT A SUPERVISING PHYSICIAN MUST ACCOMPANY AN APPLICANT APPEARING BEFORE THE BOARD WITH HIS SCOPE OF PRACTICE GUIDELINES, AND TO DELETE THE PROHIBITION AGAINST APPROVAL BY A SUPERVISING PHYSICIAN OF ON-THE-JOB TRAINING OR TASKS NOT LISTED ON THE APPLICATION FOR LIMITED LICENSURE AS A PHYSICIAN ASSISTANT; TO AMEND SECTION 40-47-950, RELATING TO REQUIREMENTS FOR LIMITED LICENSURE AS A PHYSICIAN ASSISTANT, SO AS TO DELETE REFERENCES TO SUPERVISING PHYSICIANS; TO AMEND SECTION 40-47-955, RELATING TO PHYSICAL PRESENCE REQUIREMENTS OF THE SUPERVISING PHYSICIAN OF A PHYSICIAN ASSISTANT, SO AS TO DELETE EXISTING REQUIREMENTS CONCERNING ON-SITE SETTINGS AND TO PROVIDE WHERE AND HOW A PHYSICIAN ASSISTANT MAY PRACTICE, TO REVISE PROVISIONS CONCERNING OFF-SITE SETTINGS, AND TO REVISE CERTAIN REQUIREMENTS OF A SUPERVISING PHYSICIAN; TO AMEND SECTION 40-47-960, RELATING TO SCOPE OF PRACTICE GUIDELINES FOR PHYSICIAN ASSISTANTS, SO AS TO INCLUDE AUTHORIZATION TO PRESCRIBE SCHEDULE II CONTROLLED SUBSTANCES AMONG SITUATIONS REQUIRING DIRECT EVALUATION OR IMMEDIATE REFERRAL BY THE SUPERVISING PHYSICIAN; TO AMEND SECTION 40-47-965, RELATING TO SCHEDULE II CONTROLLED SUBSTANCES AND SCOPE OF PRACTICE GUIDELINES OF A PHYSICIAN ASSISTANT, SO AS TO PROVIDE A PHYSICIAN ASSISTANT MAY RECEIVE AND DISTRIBUTE PROFESSIONAL SAMPLES OF THESE SUBSTANCES AND MAY PRESCRIBE THESE SUBSTANCES IN CERTAIN CIRCUMSTANCES; TO AMEND SECTION 40-47-970, RELATING TO THE PRESCRIBING OF DRUGS BY A PHYSICIAN ASSISTANT, SO AS TO AS TO DELETE A PROHIBITION AGAINST PRESCRIBING SCHEDULE II CONTROLLED SUBSTANCES; TO AMEND SECTION 40-47-995, RELATING TO THE TERMINATION OF A SUPERVISORY RELATIONSHIP BETWEEN A PHYSICIAN AND PHYSICIAN ASSISTANT, SO AS TO PROVIDE THAT UPON THIS TERMINATION THE PRACTICE OF THE PHYSICIAN ASSISTANT MUST CEASE UNTIL NEW SCOPE OF PRACTICE GUIDELINES, RATHER THAN A NEW APPLICATION, ARE SUBMITTED BY A NEW SUPERVISING PHYSICIAN TO THE BOARD; AND TO REPEAL SECTION 40-47-975 RELATING TO ON-THE-JOB TRAINING AND SECTION 40-47-980 RELATING TO THE TREATMENT OF PATIENTS IN CHRONIC CARE AND LONG-TERM CARE FACILITIES.
L:\COUNCIL\ACTS\448AB13.DOCX
(R39, S. 621 (Word version)) -- Education Committee: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE STATE BOARD OF EDUCATION, RELATING TO ASSISTING, DEVELOPING, AND EVALUATING PROFESSIONAL TEACHING (ADEPT), DESIGNATED AS REGULATION DOCUMENT NUMBER 4325, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
L:\COUNCIL\ACTS\621AC13.DOCX
(R40, H. 3087 (Word version)) -- Reps. Merrill and Daning: AN ACT TO AMEND SECTION 59-40-50, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO VARIOUS REQUIREMENTS, POWERS, AND DUTIES OF CHARTER SCHOOLS, SO AS TO PROVIDE A PUBLIC CHARTER SCHOOL SHALL ALLOW ENROLLMENT PREFERENCE TO RETURNING STUDENTS AND THAT THESE RETURNING STUDENTS MAY NOT ENTER A LOTTERY FOR CHARTER SCHOOL ENROLLMENT, AND TO PROVIDE THAT A CHARTER SCHOOL LOCATED ON A FEDERAL MILITARY INSTALLATION OR BASE WHERE THE APPROPRIATE AUTHORITIES HAVE MADE BUILDINGS, FACILITIES, AND GROUNDS ON THE INSTALLATION OR BASE AVAILABLE FOR USE BY THE CHARTER SCHOOL AS ITS PRINCIPAL LOCATION ALSO MAY GIVE ENROLLMENT PRIORITY TO OTHERWISE ELIGIBLE STUDENTS WHO ARE DEPENDENTS OF MILITARY PERSONNEL LIVING IN MILITARY HOUSING ON THE BASE OR INSTALLATION OR WHO ARE CURRENTLY STATIONED AT THE BASE OR INSTALLATION NOT TO EXCEED FIFTY PERCENT OF THE TOTAL ENROLLMENT OF THE CHARTER SCHOOL.
L:\COUNCIL\ACTS\3087AB13.DOCX
(R41, H. 3097 (Word version)) -- Rep. Bales: AN ACT TO AMEND ARTICLE 4, CHAPTER 56, TITLE 44, CODE OF LAWS, 1976, RELATING TO THE DRYCLEANING FACILITY RESTORATION TRUST FUND, SO AS TO SPECIFY THE USE AND PURPOSE OF THE FUND, AUTHORIZE THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL TO EXPEND MONIES FROM THE FUND FOR ASSESSMENT OF POTENTIAL SITES PRIOR TO OBTAINING EVIDENCE OF CONTAMINATION AT THE SITE, AND CLARIFY WHAT FACILITIES ARE EXCLUDED FROM PARTICIPATING IN THE FUND AND THE EFFECT OF PARTICIPATING IN THE FUND IF A FACILITY IS SEEKING EXEMPTION FROM THE FUND; AND TO DELETE OBSOLETE PROVISIONS, REORGANIZE PROVISIONS, AND MAKE TECHNICAL CORRECTIONS.
L:\COUNCIL\ACTS\3097VR13.DOCX
(R42, H. 3223 (Word version)) -- Rep. White: AN ACT TO AMEND SECTIONS 1-11-55, AS AMENDED, 1-11-425, 1-23-120, AS AMENDED, 2-1-230, 2-3-75, 2-13-60, 2-13-180, 2-13-190, AS AMENDED, 2-13-200, 2-13-210, 11-35-310, 11-53-20, AND 29-6-250, CODE OF LAWS OF SOUTH CAROLINA, 1976, ALL RELATING, IN WHOLE OR IN PART, TO THE OFFICE OF LEGISLATIVE PRINTING, INFORMATION AND TECHNOLOGY SYSTEMS (LPITS), SO AS TO CHANGE THE NAME OF THIS OFFICE TO THE LEGISLATIVE SERVICES AGENCY (LSA).
L:\COUNCIL\ACTS\3223SD13.DOCX
(R43, H. 3829 (Word version)) -- Reps. Bedingfield, Stringer, Allison, Bannister, Chumley, Dillard, Hamilton, Henderson, Loftis, Nanney, Putnam, Robinson-Simpson, G.R. Smith and Willis: AN ACT TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 18 TO CHAPTER 53, TITLE 59 SO AS TO BE CAPTIONED THE "GREENVILLE TECHNICAL COLLEGE AREA COMMISSION"; TO DESIGNATE SECTIONS 1A, 4, AND 5 OF ACT 743 OF 1962 AS SECTIONS 59-53-1500, 59-53-1510, AND 59-53-1520, RESPECTIVELY, OF ARTICLE 18, CHAPTER 53, TITLE 59; AND TO AMEND ARTICLE 18, CHAPTER 53, TITLE 59, RELATING TO THE MEMBERSHIP, POWERS, AND DUTIES OF THE GREENVILLE TECHNICAL COLLEGE AREA COMMISSION, SO AS TO RECONSTITUTE THE MEMBERSHIP OF THE COMMISSION AND THE TERMS AND APPOINTING PROCEDURES FOR MEMBERS.
L:\COUNCIL\ACTS\3829SD13.DOCX
THE SENATE PROCEEDED TO A CONSIDERATION OF H. 3710, THE GENERAL APPROPRIATIONS BILL.
DEBATE INTERRUPTED
H. 3710--GENERAL APPROPRIATIONS BILL
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 1A.61 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT sustained the Point of Order.
Proviso 1A.61 was ruled out of order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 11.15 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT sustained the Point of Order.
Proviso 11.15 was ruled out of order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRIGHT on May 14, 2013, that Proviso 117.114 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 36.2 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator SHANE MARTIN on May 14, 2013, that Proviso 78.4 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT sustained the Point of Order.
Proviso 78.4 was ruled out of order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 1.79 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Point of Order Withdrawn
Senator BRYANT raised a Point of Order on May 14, 2013, that Proviso 118.5 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
On motion of Senator BRYANT, the Point of Order was withdrawn.
Point of Order
Senator BRIGHT raised a Point of Order under Rule 24A that Proviso 118.5 of Part 1B was out of order inasmuch as it was not germane to the Bill.
118.5. (SR: Criminal Justice Academy Funding) (A) In addition to all other assessments and surcharges, during the current fiscal year, a five dollar surcharge to fund training at the South Carolina Criminal Justice Academy is also levied on all fines, forfeitures, escheatments, or other monetary penalties imposed in the general sessions court or in magistrates' or municipal court for misdemeanor traffic offenses or for non-traffic violations. No portion of the surcharge may be waived, reduced, or suspended. The additional surcharge imposed by this section does not apply to parking citations.
(B) The revenue collected pursuant to subsection (A) must be retained by the jurisdiction, which heard or processed the case and paid to the State Treasurer within thirty days after receipt. The State Treasurer shall transfer the revenue quarterly to the South Carolina Criminal Justice Academy.
(C) The State Treasurer may request the State Auditor to examine the financial records of any jurisdiction which he believes is not timely transmitting the funds required to be paid to the State Treasurer pursuant to subsection (B). The State Auditor is further authorized to conduct these examinations and the local jurisdiction is required to participate in and cooperate fully with the examination.
The PRESIDENT took the Point of Order under advisement.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRIGHT on May 15, 2013, that Proviso 118.5 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT sustained the Point of Order.
Proviso 118.5 was ruled out of order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 45.6 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT sustained the Point of Order.
Proviso 45.6 was ruled out of order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator SHANE MARTIN on May 14, 2013, that Proviso 1.75 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 1.83 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 1A.51 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT sustained the Point of Order.
Proviso 1A.51 was ruled out of order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator SHANE MARTIN on May 14, 2013, that Proviso 38.22 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 1A.57 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 11.18 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT overruled the Point of Order.
Decision of the PRESIDENT
The PRESIDENT took up the Point of Order raised by Senator BRYANT on May 14, 2013, that Proviso 34.46 of Part 1B was out of order inasmuch as it was violative of Rule 24A.
The PRESIDENT sustained the Point of Order.
Proviso 34.46 was ruled out of order.
Amendment No. 34
Senator MALLOY proposed the following amendment (DAD 3.5 SCHOOL BUSES):
Amend the bill, as and if amended, Part IA, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 15, line 3, opposite LOTTERY EXPENDITURES by:
COLUMN 7 COLUMN 8
/ STRIKING: 268,240,000
and
INSERTING: 279,500,000 /
Amend the bill further, as and if amended, Part IA, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 15, line 4, opposite UNCLAIMED PRIZES by:
COLUMN 7 COLUMN 8
/ STRIKING: 12,400,000
and
INSERTING: 8,000,000 /
Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 381, paragraph 3.5, line 34, item (14), at the end by striking /and/
Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 381, line 35, item (15), after "$3,000,000" by inserting /and/ Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 381, paragraph 3.5, after line 35, by adding an appropriately numbered new item to read: / ( ) Department of Education-- New School Buses$11,260,000. /
Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 382, paragraph 3.5, lines 32-36 and page 383, lines 1-2, by striking the lines in their entirety and inserting: /For Fiscal Year 2013-14, of the funds certified from unclaimed prizes, $8,000,000 shall be appropriated to the Department of Education for the purchase of new school buses. / Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 383, paragraph 3.5, lines 3-11, by striking the lines in their entirety and inserting: /Any unclaimed prize funds available in excess of the Board of Economic Advisors estimate shall be directed to the Department of Education for new school buses. / Renumber sections to conform. Amend sections, totals and title to conform. Senator MALLOY explained the amendment. Motion Adopted On motion of Senator COURSON, with unanimous consent, the Senate agreed that, at the conclusion of the Joint Assembly, the Senate would stand in recess until 2:00 P.M. On motion of Senator COURSON, with unanimous consent, the Senate receded for the Joint Assembly, with Senator MALLOY retaining the floor. With Senator MALLOY retaining the floor, on motion of Senator COURSON, with unanimous consent, debate was interrupted. Joint Assembly Elections The PRESIDENT announced that elections were in order to elect a successor to the position of Judge, Circuit Court, Sixth Judicial Circuit, Seat #1. Election to the Position of Judge, Circuit Court, 6th Judicial Circuit, Seat #1 The PRESIDENT announced that nominations were in order to elect a successor to the position of Judge, Circuit Court, Sixth Judicial Circuit, Seat #1. Senator LARRY MARTIN, Chairman of the Judicial Merit Selection Commission, indicated that Brian M. Gibbons had been screened and found qualified to serve. Senator LARRY MARTIN placed the name of Brian M. Gibbons in nomination, moved that nominations be closed and, with unanimous consent, the vote was taken by acclamation, resulting in the election of the nominee. Whereupon, the PRESIDENT announced that the Honorable Brian M. Gibbons was elected to the position of Judge, Circuit Court, 6th Judicial Circuit, Seat #1 for the term prescribed by law. Immediately following the judicial elections, the Senate proceeded to the election of a medical member to the Board of Trustees of the Medical University of South Carolina, 5th Congressional District. Medical University of South Carolina 5th Congressional District, medical position The PRESIDENT announced that nominations were in order to elect a successor to the medical position on the Board of Trustees for the Medical University of South Carolina, 5th Congressional District. Senator PEELER, Chairman of the Committee to Screen Candidates for State Colleges and Universities, indicated that Mr. Coty P. Fishburne and Mr. G. Murrell Smith, Sr. had been screened and found qualified to serve. On motion of Senator PEELER, the name of Mr. Coty P. Fishburne was withdrawn from consideration. Senator PEELER placed the name of Mr. G. Murrell Smith, Sr. in nomination. Senator HUTTO spoke on the nomination. Senator HUTTO moved that the nominations be closed and, with unanimous consent, the vote was taken by acclamation, resulting in the election of the nominee. Whereupon, the PRESIDENT announced that the Honorable G. Murrell Smith, Sr. was elected to the medical position on the Board of Trustees for Medical University of South Carolina, 5th Congressional District for the term prescribed by law. The purposes of the Joint Assembly having been accomplished, the PRESIDENT declared it adjourned, whereupon the Senate returned to its Chamber and was called to order by the PRESIDENT. RECESS At 12:26 P.M., with Senator MALLOY retaining the floor, on motion of Senator COURSON, with unanimous consent, the Senate receded from business until 2:00 P.M. AFTERNOON SESSION The Senate reassembled at 2:03 P.M. and was called to order by the PRESIDENT. AMENDED, AMENDMENT PROPOSED DEBATE INTERRUPTED H. 3710--GENERAL APPROPRIATIONS BILL The Senate resumed consideration of the Bill, the question being the adoption of Amendment No. 34 (DAD 3.5 SCHOOL BUSES) proposed by Senator MALLOY. Senator MALLOY resumed speaking on Amendment No. 34. With Senator MALLOY retaining the floor, Senator MALLOY asked unanimous consent to make a motion to take up Amendment No. 74 for immediate consideration. There was no objection. Amendment No. 74 Senator MALLOY proposed the following amendment (DAD 3.5 LOTTERY GM SCHOOL BUSES), which was not adopted: Amend the bill, as and if amended, Part IA, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 15, line 3, opposite LOTTERY EXPENDITURES by: COLUMN 7 COLUMN 8 / STRIKING: 268,240,000 and INSERTING: 279,500,000 / Amend the bill further, as and if amended, Part IA, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 15, line 4, opposite UNCLAIMED PRIZES by: COLUMN 7 COLUMN 8 / STRIKING: 12,400,000 and INSERTING: 8,000,000 / Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 381, paragraph 3.5, line 16, item (1), by striking /$43,000,000;/ and inserting /$47,400,000;/ Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 381, paragraph 3.5, line 34, item (14), at the end by striking /and/ Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 381, line 35, item (15), after "$3,000,000" by inserting /and/
Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 381, paragraph 3.5, after line 35, by adding an appropriately numbered new item to read
/ ( ) Department of Education--
New School Buses .$6,860,000. / Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 382, paragraph 3.5, lines 32-36 and page 383, lines 1-2, by striking the lines in their entirety and inserting: /For Fiscal Year 2013-14, of the funds certified from unclaimed prizes,$1,700,000 shall be appropriated to the Commission on Higher Education and State Board for Technical and Comprehensive Education for Tuition Assistance Two Year Institutions and $6,300,000 shall be appropriated to the Department of Education for the purchase of new school buses. / Amend the bill further, as and if amended, Part IB, Section 3, LOTTERY EXPENDITURE ACCOUNT, page 383, paragraph 3.5, lines 3-11, by striking the lines in their entirety and inserting: /Any unclaimed prize funds available in excess of the Board of Economic Advisors estimate shall be directed to the Department of Education for new school buses. / Renumber sections to conform. Amend sections, totals and title to conform. Senator MALLOY explained the amendment. Senator HAYES spoke on the amendment. Senator HAYES moved to lay the amendment on the table. The "ayes" and "nays" were demanded and taken, resulting as follows: Ayes 18; Nays 25 AYES Alexander Campbell Corbin Cromer Hayes Jackson Leatherman Lourie Martin, Larry Matthews McGill Nicholson Peeler Rankin Scott Setzler Verdin Williams Total--18 NAYS Allen Bennett Bright Bryant Campsen Cleary Coleman Courson Davis Ford Gregory Grooms Hembree Hutto Johnson Malloy Martin, Shane Massey McElveen Reese Shealy Sheheen Thurmond Turner Young Total--25 The Senate refused to table the amendment. The question then was the adoption of the amendment. Senator JACKSON spoke on the amendment. Senator MATTHEWS spoke on the amendment. Senator MALLOY spoke on the amendment. The "ayes" and "nays" were demanded and taken, resulting as follows: Ayes 16; Nays 27 AYES Bennett Bright Bryant Campsen Cleary Davis Grooms Hembree Hutto Malloy Martin, Shane Massey Shealy Thurmond Turner Young Total--16 NAYS Alexander Allen Campbell Coleman Corbin Courson Cromer Ford Gregory Hayes Jackson Johnson Leatherman Lourie Martin, Larry Matthews McElveen McGill Nicholson Peeler Rankin Reese Scott Setzler Sheheen Verdin Williams Total--27 The amendment was not adopted. On motion of Senator MALLOY, Amendment No. 34 was carried over. Amendment No. 57 Senator SHANE MARTIN proposed the following amendment (DG SMLOCGOV), which was carried over: Amend the bill, as and if amended, Part IA, Section 110, AID TO SUBDIVISIONS - STATE TREASURER, page 323, line 3, by: COLUMN 7 COLUMN 8 / STRIKING: 182,619,411 182,619,411 and INSERTING: 253,600,787 253,600,787/ Renumber sections to conform. Amend sections, totals and title to conform. Senator SHANE MARTIN explained the amendment. Senator LEATHERMAN moved to carry over the amendment. Senator SHANE MARTIN moved to table the motion to carry over. The "ayes" and "nays" were demanded and taken, resulting as follows: Ayes 8; Nays 34 AYES Bright Bryant Corbin Davis Grooms Malloy Martin, Shane Shealy Total--8 NAYS Alexander Allen Bennett Campbell Campsen Cleary Courson Cromer Ford Gregory Hayes Hembree Hutto Jackson Johnson Leatherman Lourie Martin, Larry Massey Matthews McElveen McGill Nicholson Peeler Rankin Reese Scott Setzler Sheheen Thurmond Turner Verdin Williams Young Total--34 The Senate refused to table the motion to carry over the amendment. The question then was the motion to carry over. The "ayes" and "nays" were demanded and taken, resulting as follows: Ayes 34; Nays 8 AYES Alexander Allen Bennett Campbell Campsen Cleary Courson Cromer Ford Gregory Hayes Hembree Hutto Jackson Johnson Leatherman Lourie Martin, Larry Massey Matthews McElveen McGill Nicholson Peeler Rankin Reese Scott Setzler Sheheen Thurmond Turner Verdin Williams Young Total--34 NAYS Bright Bryant Corbin Davis Grooms Malloy Martin, Shane Shealy Total--8 Amendment No. 57 was carried over. Amendment No. 54 Senator GROOMS proposed the following amendment (3710R012.LKG.DOCX), which was carried over: Amend the bill, as and if amended, Part IB, Section 1, DEPARTMENT OF EDUCATION, page 333, after line 5, by adding an appropriately numbered new proviso to read: / 1.___. (SDE: Educational Credit) (A)(1) As used in subsection (A): (a) 'Independent school' means a school, other than a public school, at which the compulsory attendance requirements of Section 59-65-10 may be met and that does not discriminate based on the grounds of race, color, or national origin. For purposes of this definition, 'independent school' does not include a home school as defined in item (b). (b) 'Home school' means a home, residence, or location where a parent or legal guardian teaches one or more children as authorized pursuant to Section 59-65-40, 59-65-45, or 59-65-47. (c) 'Parent' means the natural or adoptive parent or legal guardian of a child. (d) 'Qualifying student' means a student who is a South Carolina resident and who is eligible to be enrolled in a South Carolina secondary or elementary public school at the kindergarten or later year level for the current school year. (e) 'Resident public school district' means the public school district in which a student resides. (f) 'Tuition' means the total amount of money charged for the cost of a qualifying student to attend an independent school including, but not limited to, fees for attending the school and school-related transportation. (2)(a) For the 2013-2014 school year, a parent or legal guardian who teaches one or more qualifying students at home as authorized pursuant to Section 59-65-40, 59-65-45, or 59-65-47 may take a deduction against their State of South Carolina taxable income of up to two thousand dollars per home school student for instruction-related expenditures. This deduction is limited to a total of two thousand dollars per child regardless of the number of taxpayers incurring home school instruction-related expenses on behalf of that child. The deduction allowed by this subsection is fully deductible on a 2013 state income tax return provided the qualifying student completes the school term for the 2013-2014 school year. (b) For the 2013-2014 school year, a parent or legal guardian is entitled to a deduction against their State of South Carolina taxable income of up to four thousand dollars paid to an independent school within this State for tuition on behalf of their child or ward to attend the independent school for the school year. The child or ward must be a qualifying student as this term is defined in subsection (A)(1)(d). This deduction is limited to a total of four thousand dollars per child regardless of the number of taxpayers making tuition payments on behalf of that child. The deduction allowed by this subsection is fully deductible on a 2013 state income tax return provided the qualifying student completes the school term for the 2013-2014 school year. (c) For the 2013-2014 school year, a parent or legal guardian is entitled to a deduction against their State of South Carolina taxable income of up to one thousand dollars paid on behalf of their child or ward to attend a school in a school district which is not the school district of residence of the child or ward. This deduction is limited to a total of one thousand dollars per child regardless of the number of taxpayers making payments to another school district on behalf of that child. The deduction allowed by this subsection is fully deductible on a 2013 state income tax return provided the qualifying student completes the school term for the 2013-2014 school year. (B)(1) As used in subsection (B): (a) 'Eligible school' means an independent school including those religious in nature, other than a public or home school, at which the compulsory attendance requirements of Section 59-65-10 may be met, that: (i) offers a general education to primary or secondary school students; (ii) does not discriminate on the basis of race, color, or national origin; (iii) is located in this State; (iv) has an educational curriculum that includes courses set forth in the state's diploma requirements and where the students attending are administered national achievement or state standardized tests, or both, at progressive grade levels to determine student progress; (v) has school facilities that are subject to applicable federal, state, and local laws; and (vi) is a member in good standing of the Southern Association of Colleges and Schools, the South Carolina Association of Christian Schools or the South Carolina Independent Schools Association. (b) 'Nonprofit scholarship funding organization' means a charitable organization that: (i) is exempt from federal tax under Section 501(a) of the Internal Revenue Code by being listed as an exempt organization in Section 501(c)(3) of the Code; (ii) allocates, after its first year of operation, at least ninety-five percent of its annual contributions and revenue received during a particular year to provide grants for tuition, transportation, or textbook expenses (collectively hereinafter referred to as tuition) or any combination thereof to children enrolled in an eligible school meeting the criteria of this section, and incurs administrative expenses annually, after its first year of operation, of not more than five percent of its annual contributions and revenue for a particular year; (iii) allocates all of its funds used for grants on an annual basis to children who are 'exceptional needs' students as defined herein, or who are eligible for the federal free or reduced lunch program, or whose families meet the qualifications for federal Medicaid benefits; (iv) does not provide grants solely for the benefit of one school, and if the Department of Revenue determines that the nonprofit scholarship funding organization is providing grants to one particular school, the tax credit allowed by this section may be disallowed; (v) does not have as a member of its governing board any parent, legal guardian, or member of their immediate family who has a child or ward who is currently receiving or has received a scholarship grant authorized by this section from the organization within one year of the date the parent, legal guardian, or member of their immediate family became a board member; and (vi) does not have as a member of its governing board any person who has been convicted of a felony, or who has declared bankruptcy within the last seven years. (c) 'Person' means an individual, partnership, corporation, or other similar entity. (d) 'Transportation' means transportation to and from school only. (2) A person is entitled to a tax credit for the amount of money the person contributes to a nonprofit scholarship funding organization up to the limits of subsection (B) if: (a) the contribution is used to provide grants for tuition, transportation, or textbook expenses or any combination thereof to children enrolled in eligible schools who qualify for these grants under the provisions of subsection (B); and (b) the person does not designate a specific child or school as the beneficiary of the contribution. (3)(a) Grants may be awarded by the nonprofit scholarship funding organization in an amount not exceeding five thousand dollars or the total cost of tuition, whichever is less, for children who are eligible for the federal free or reduced school lunch program or whose families meet the requirements for federal Medicaid benefits to attend an independent school. (b) In addition to the provisions of item (a), grants may be awarded by a scholarship funding organization in an amount not exceeding ten thousand dollars or the total cost of tuition, whichever is less, for students with 'exceptional needs' to attend an independent school. An 'exceptional needs' child is defined as a child who has significant cognitive, mental, physical, or emotional disabilities and whose parents or legal guardian believe that the services provided by the school district of legal residence do not sufficiently meet the needs of their child. (4)(a) The tax credits authorized by subsection (B) may not exceed cumulatively a total of fifteen million dollars for contributions made on behalf of students who are eligible for the federal free or reduced lunch program and whose families meet the qualifications for federal Medicaid benefits, and the tax credits authorized by subsection (B) may not exceed cumulatively a total of ten million dollars for contributions made on behalf of 'exceptional needs' students. If the Department of Revenue determines that the total of such credits claimed by all taxpayers for one or both categories exceed these amounts, it shall allow credits only up to those amounts on a first come, first serve basis. (b) Filers making contributions to a nonprofit scholarship funding organization designating a portion or all of their contributions for grants for exceptional needs children shall state with their contribution the amount to be used for this purpose. These amounts so stated must be used for purposes of computing the maximum tax credit amounts under item (a) authorized for contributions on behalf of exceptional needs students. If no such designation for exceptional needs children is made, the contribution shall come within the maximum tax credit limitation for contributions pertaining to students who are eligible for the federal free or reduced lunch program and whose families meet the qualifications for federal Medicaid benefits provided in item (a). (c) If a husband and wife file separate returns, they each may only claim one-half of the tax credit that would have been allowed for a joint return for the year. (d) The person shall apply for a credit under subsection (B) on or with the tax return for the period for which the credit is claimed. (e) The Department of Revenue shall prescribe the form and manner of proof required to obtain the credit authorized by subsection (B). Also, the department shall develop a method of informing taxpayers if either of the credit limits set forth in item (a) are met at any time during the 2013 tax year. (f) A person may claim a credit under subsection (B) for a contribution during a particular period only against the tax owed for the corresponding period. (g) Any unused tax credit, including the portion of a contribution which is reduced pro rata under item (a) of this subsection, may be carried forward for a period not exceeding five consecutive years. However, the tax credit is not refundable. (5) A corporation or entity entitled to a credit under subsection (B) may not convey, assign, or transfer the deduction or credit authorized by this section to another entity unless all of the assets of the entity are conveyed, assigned, or transferred in the same transaction. (6) Except as otherwise provided by subsection (B), neither the Department of Education, the Department of Revenue, nor any other state agency may regulate the educational program of an independent school that accepts students receiving scholarship grants pursuant to subsection (B). (7)(a) The Education Oversight Committee, as established in Chapter 6, Title 59, is responsible for determining if an eligible school meets the criteria established by subsection (B)(1)(a), and shall publish an approved list of such schools meeting this criteria as provided in item (b) below. For this purpose, it also shall promulgate regulations further enumerating the specifics of this criteria. In performing this function, the Education Oversight Committee shall establish an advisory committee made up of not more than nine members including parents, and representatives of independent schools and independent school associations. The advisory committee shall provide recommendations to the Education Oversight Committee on the content of these regulations and any other matters requested by the Education Oversight Committee. (b)(i) By the first day of August for the current fiscal year, the Education Oversight Committee, on its website available to the general public, shall provide a list with addresses and telephone numbers of nonprofit scholarship funding organizations in good standing which provide grants under subsection (B), and a list of approved independent schools which accept grants for eligible students under subsection (B) and which in its determination are in compliance with the requirements of subsection (B)(1)(a). (ii) Student test scores, by category, on national achievement or state standardized tests, or both, for all grades tested and administered by an eligible school receiving or entitled to receive scholarship grants under subsection (B) must be transmitted to the Education Oversight Committee which in turn shall publish this information on its website with the most recent scores by category included. (c) Any independent school not determined to be an eligible school under the provisions of subsection (B) may seek review by filing a request for a contested case hearing with the Administrative Law Court in accordance with the court's rules of procedure. (d) The Education Oversight Committee, after consultation with its nine-member advisory committee, may exempt an independent school having students with exceptional needs who receive scholarship grants pursuant to subsection (B) from the curriculum requirements of subsection (B)(1)(iv). (8)(a) Every nonprofit scholarship funding organization providing grants under subsection (B), shall cause an outside auditing firm to conduct a comprehensive financial audit of its operations in conformity with generally accepted accounting principles and shall furnish the same within thirty days of its completion and acceptance to the Secretary of State and Department of Revenue which must be made available by them on their website for public review. (b) Every independent school accepting grants for eligible students under subsection (B) shall cause to be conducted a compliance audit by an outside entity or auditing firm examining its compliance with the provisions of subsection (B), and shall furnish the same within thirty days of its completion and acceptance to the Secretary of State and Department of Revenue which must be made available by them on their website for public review. / Renumber sections to conform. Amend sections, totals and title to conform. Point of Order Senator HUTTO raised a Point of Order under Rule 24A that the amendment was out of order inasmuch as it was not germane to the Bill. Senator CAMPSEN spoke on the Point of Order. The PRESIDENT overruled the Point of Order. On motion of Senator GROOMS, the amendment was carried over. Amendment No. 68A Senator FAIR proposed the following amendment (3710R042.MLF.DOCX), which was carried over: Amend the bill, as and if amended, Part IB, Section 1, DEPARTMENT OF EDUCATION, page 355, after line 34, by adding an appropriately numbered new proviso to read: / 1.___ (SDE: Tuition Tax Credits for Exceptional Needs Children) (A) For the purposes of this proviso: (1) "Independent school" means a school, other than a public school, at which the compulsory attendance requirements of Section 59-65-10 may be met and that does not discriminate based on the grounds of race, color, or national origin. For purposes of this definition, "independent school" does not include a home school as defined in item (3). (2) "Exceptional needs" means a child who has significant cognitive, mental, physical, or emotional disabilities. (3) "Home school" means a home, residence, or location where a parent or legal guardian teaches one or more children as authorized pursuant to Section 59-65-40, 59-65-45, or 59-65-47. (4) "Parent" means the natural or adoptive parent or legal guardian of a child. (5) "Qualifying student" means a student who is a South Carolina resident and who is eligible to be enrolled in a South Carolina secondary or elementary public school at the kindergarten or later year level for the current school year. (6) "Resident public school district" means the public school district in which a student resides. (7) "Tuition" means the total amount of money charged for the cost of a qualifying student to attend an independent school including, but not limited to, fees for attending the school and school-related transportation. (B) For the 2013-2014 school year, a parent or legal guardian who teaches one or more qualifying students with exceptional needs at home as authorized pursuant to Section 59-65-40, 59-65-45, or 59-65-47 because the parent or legal guardian believes that the services provided by the school district of legal residence do not sufficiently meet the needs of the child may take a deduction against their State of South Carolina taxable income of up to two thousand dollars per exceptional needs home schooled student for instruction-related expenditures. This deduction is limited to a total of two thousand dollars per child regardless of the number of taxpayers incurring home school instruction-related expenses on behalf of that child. The deduction allowed by this subsection is fully deductible on a 2013 state income tax return provided the qualifying student completes the school term for the 2013-2014 school year. (C) For the 2013-2014 school year, a parent or legal guardian is entitled to a deduction against their State of South Carolina taxable income of up to four thousand dollars paid to an independent school within this State for tuition on behalf of their child or ward to attend an independent school. The child or ward must be a qualifying student with special needs whose parents or legal guardian believe that the services provided by the school district of legal residence do not sufficiently meet the child's needs. This deduction is limited to a total of four thousand dollars per child regardless of the number of taxpayers making tuition payments on behalf of that child. The deduction allowed by this subsection is fully deductible on a 2013 state income tax return provided the qualifying student completes the school term for the 2013-2014 school year. / Renumber sections to conform. Amend sections, totals and title to conform. Point of Order Senator HUTTO raised a Point of Order under Rule 24A that the amendment was out of order inasmuch as it was not germane to the Bill. The PRESIDENT took the Point of Order under advisement. The amendment was carried over. Amendment No. 83 Senators GREGORY and SETZLER proposed the following amendment (DG GGCHEREPORT), which was adopted: Amend the bill, as and if amended, Part IB, Section 11, COMMISSION ON HIGHER EDUCATION, page 390, after line 28, by adding an appropriately numbered new proviso to read: / 11.___. (CHE: Inventory of State-Mandated Reporting Requirements) To help reduce the cost of higher education and institutions' compliance burdens by eliminating conflicting, redundant, or other excessive reporting requirements, the Commission on Higher Education is directed to work with the state's colleges and universities to prepare a report inventorying all state mandated reporting requirements, including those of the Commission on Higher Education, imposed on South Carolina's institutions of higher education. This report shall be provided to the Governor, the Chairman of the Senate Finance Committee, and the Chairman of the House Ways and Means Committee by December 1, 2013. / Renumber sections to conform. Amend sections, totals and title to conform. Senator GREGORY explained the amendment. The amendment was adopted. Amendment No. 55 Senator MASSEY proposed the following amendment (3710R029.ASM.DOCX), which was adopted: Amend the bill, as and if amended, Part IB, Section 23, MEDICAL UNIVERSITY OF SOUTH CAROLINA, page 392, paragraph 23.3 by striking lines 6-7. Renumber sections to conform. Amend sections, totals and title to conform. Senator MASSEY explained the amendment. The amendment was adopted. Amendment No. 61 Senators ALEXANDER, SHEHEEN, SETZLER and LARRY MARTIN proposed the following amendment (DAD 33.34F), which was adopted: Amend the bill, as and if amended, Part IB, Section 33, DEPARTMENT OF HEALTH & HUMAN SERVICES, page 404, paragraph 33.34, lines 30-31, by striking /Each recipient shall receive a minimum increase of$100 per month./ and inserting / The facility rate shall increase a minimum of $100 per month per eligible beneficiary. / Amend the bill further, as and if amended, Part IB, Section 33, DEPARTMENT OF HEALTH & HUMAN SERVICES, page 404, paragraph 33.34, line 31, by inserting at the end: / and nothing contained herein may conflict with or limit existing regulations / Renumber sections to conform. Amend sections, totals and title to conform. Senator ALEXANDER explained the amendment. The amendment was adopted. Amendment No. 62 Senators ALEXANDER and LARRY MARTIN proposed the following amendment (DG TCASOIL), which was adopted: Amend the bill, as and if amended, Part IB, Section 34, DEPARTMENT OF HEALTH & ENVIRONMENTAL CONTROL, page 413, after line 12, by adding an appropriately numbered new proviso to read: / 34.___. (DHEC: Onsite Wastewater Disposal system) In the current fiscal year, an individual who has completed a minimum of six weeks training in a combination of classroom and field experience, as determined by the department, in soil morphology, soil classification, soil texture, and determining seasonal high water table, may submit an application for a non-engineered onsite wastewater disposal system pursuant to R-61-55 and 61-56. / Renumber sections to conform. Amend sections, totals and title to conform. Amendment No. 59 Senator HUTTO proposed the following amendment (DG CBH38.20), which was tabled: Amend the bill, as and if amended, Part IB, Section 38, DEPARTMENT OF SOCIAL SERVICES, page 422, by deleting paragraph 38.20 in its entirety. Renumber sections to conform. Amend sections, totals and title to conform. Senator GROOMS spoke on the amendment. Senator GROOMS asked unanimous consent to take up for immediate consideration Amendment No. 59-1. There was no objection. Amendment No. 59-1 Senator GROOMS proposed the following amendment (3710R050.LKG.DOCX), which was adopted: Amend the bill, as and if amended, Part IB, Section 38, DEPARTMENT OF SOCIAL SERVICES, page 422, paragraph 38.20, by striking lines 21-22 and inserting: / Continuation of Teen Pregnancy Prevention, the department must award two contracts must be awarded to separate private, non-profit 501(c)(3) entities to provide Abstinence Until Marriage teen pregnancy prevention programs and services within the State. / Renumber sections to conform. Amend sections, totals and title to conform. The amendment was adopted. Senator HUTTO spoke on Amendment No. 59. Objection Senator MALLOY asked unanimous consent to make a motion to amend the amendment. Senator GROOMS objected. Senator GROOMS moved to lay the amendment on the table. The "ayes" and "nays" were demanded and taken, resulting as follows: Ayes 29; Nays 13 AYES Alexander Allen Bennett Bright Bryant Campbell Campsen Cleary Corbin Courson Cromer Davis Fair Gregory Grooms Hayes Hembree Martin, Larry Martin, Shane McElveen McGill Peeler Rankin Shealy Thurmond Turner Verdin Williams Young Total--29 NAYS Coleman Ford Hutto Jackson Johnson Leatherman Lourie Malloy Matthews Nicholson Reese Scott Setzler Total--13 The amendment was laid on the table. Amendment No. 56 Senators CAMPBELL, VERDIN and LARRY MARTIN proposed the following amendment (DAD CLEM PSA ADMIN FEE), which was ruled out of order: Amend the bill, as and if amended, Part IB, Section 45, CLEMSON UNIVERSITY - PSA, page 427, after line 27, by adding an appropriately numbered new proviso to read: / (CU-PSA: Administrative Fee) For the current fiscal year Clemson Public Service Activities is authorized to charge an administrative fee of$1 per ton of commercial fertilizer sold or distributed in this state to offset administrative operating costs. Clemson University-PSA may retain, expend, and carry forward these funds to maintain its programs. /
Renumber sections to conform.
Amend sections, totals and title to conform.
Senator CAMPBELL explained the amendment.
Point of Order Withdrawn
Senator SHANE MARTIN raised a Point of Order under Rule 24A that the amendment was out of order inasmuch as it was not germane to the Bill.
Senator VERDIN spoke on the Point of Order.
On motion of Senator SHANE MARTIN, the Point of Order was withdrawn.
Point of Order
Senator BRYANT raised a Point of Order under Rule 24A that the amendment was out of order inasmuch as it was not germane to the Bill.
Senator BRYANT spoke on the Point of Order.
The PRESIDENT sustained the Point of Order.
The amendment was ruled out of order.
Amendment No. 70
Senator SCOTT proposed the following amendment (DG JSDRAINAGE), which was adopted:
Amend the bill, as and if amended, Part IB, Section 84, DEPARTMENT OF TRANSPORTATION, page 464, after line 18, by adding an appropriately numbered new proviso to read:
/ 84.___. (DOT: Drainage Studies) Of the funds appropriated and authorized to the Department of Transportation, the department may conduct drainage studies as the department deems beneficial. /
Renumber sections to conform.
Amend sections, totals and title to conform.
Senator SCOTT explained the amendment.
Amendment No. 44
Senators SETZLER and McGILL proposed the following amendment (DG NGSDEWREPORT), which was adopted:
Amend the bill, as and if amended, Part IB, Section 117, GENERAL PROVISIONS, page 526, proviso 117.103, by striking the proviso in its entirety and inserting:
/ 117.103. (GP: WIA Training Marketability Evaluation) (A) For Fiscal Year 2012-13 2013-14, local workforce investment boards the Department of Employment and Workforce shall prepare an submit annual a report that demonstrates how funds were expended in the prior fiscal year to provide marketable work skills training. The report shall include, but not be limited to the total number of local training recipients, a description of the training area in which each recipient participated, and the number and percentage of participants in each training area that, upon completion of training, have become employed in the field in which they were trained. The report shall be annually submitted to the Chairman of the Senate Finance Committee, Chairman of the Senate Labor, Commerce and Industry Committee, and the Chairman of the House Ways and Means Committee, and the Chairman of the House Labor, Commerce and Industry Committee on or before November 16th.
(B) Also, the report must specifically describe any restructuring or realignment of agency functions, and any changes in staffing levels or service. The report must detail information on employees terminated, hired, re-hired, reassigned, or reclassified by program area and location. Further, the report must describe efforts made by the agency to reassign or retrain employees who were terminated for positions for which the department hired new employees. /
Renumber sections to conform.
Amend sections, totals and title to conform.
Senator SETZLER explained the amendment.
Amendment No. 27A
Senator BRIGHT proposed the following amendment (3710R043.LB.DOCX), which was adopted:
Amend the bill, as and if amended, Part IB, Section 117, GENERAL PROVISIONS, page 530, after line 18, by adding an appropriately numbered new proviso to read:
/ 117.___ (GP: Family Planning Funds) (A) Notwithstanding any other law, federal family planning funds and state family planning funds shall be awarded to eligible individuals, organizations, or entities applying to be family planning contractors in the following order of descending priority:
(1) public entities that provide family planning services, including state, county, and local community health clinics and federally qualified health centers;
(2) nonpublic entities that provide comprehensive primary and preventive health services, as described in 42 U.S.C. 254b(b)(1)(A), in addition to family planning services; and
(3) nonpublic entities that provide family planning services but do not provide comprehensive primary and preventive health services.
(B) Family planning funds must be distributed in compliance with federal law to ensure distribution in a manner that does not severely limit or eliminate access to family planning services in any region of the State.
(C) Any department, agency, board, commission, office, or other instrumentality of the State that distributes family planning funds shall submit an annual report to the General Assembly listing any family planning contractors that fall under item (A)(3), and the amount of federal or state family planning funds they received. The report shall provide a detailed explanation of how it was determined that there were an insufficient number of eligible individuals, organizations, or entities in items (A)(1) and (A)(2) to prevent a significant reduction in family planning services in each region of the State where (A)(3) contractors are located. /
Renumber sections to conform.
Amend sections, totals and title to conform.
Senator BRIGHT explained the amendment.
Amendment No. 58
Senator CORBIN proposed the following amendment (3710R034.TDC.DOCX), which was ruled out of order:
Amend the bill, as and if amended, Part IB, Section 117, GENERAL PROVISIONS, page 530, after line 18, by inserting a new proviso to read:
/ 117.___ (GP: Across-the-Board Cut) All general fund appropriations contained in this act are reduced by five percent. The revenue resulting from the across-the-board cut is credited to the Department of Transportation and to County Transportation Committees as provided in this proviso. One-third of the revenue shall be apportioned among the counties and distributed pursuant to the C-Fund formula contained in Section 12-28-2740. County Transportation Committee funds must be expended in the manner provided in Section 12-28-2740 on existing roads and bridges. The remaining two-thirds of the revenue shall be distributed to the Department of Transportation. Department of Transportation funds must be expended for bridge replacement, rehabilitation, and maintenance projects currently programmed in the Statewide Transportation Improvement Program (STIP) and Act 114 prioritized road rehabilitation projects on existing roads approved by the commission for future inclusion in the STIP as of May 1, 2013. Unexpended funds appropriated pursuant to this proviso may be carried forward to succeeding fiscal years and expended for the same purpose. /
Renumber sections to conform.
Amend sections, totals and title to conform.
Senator CORBIN explained the amendment.
Point of Order
Senator LEATHERMAN raised a Point of Order that the amendment was out of order inasmuch as it was violative of provisions of the South Carolina Constitution that prohibit the reduction of the salaries of Constitutional Officers during their terms.
The PRESIDENT took the Point of Order under advisement.
Point of Order
Senator LEATHERMAN raised a Point of Order that the amendment was out of order inasmuch as it was violative of Rule 24A.
Senator SETZLER spoke on the Point of Order.
The PRESIDENT sustained the Point of Order.
The amendment was ruled out of order.
At 6:40 P.M., Senator BRIGHT moved that the Senate stand adjourned.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 18; Nays 25
AYES
Allen Bright Bryant
Coleman Corbin Ford
Hutto Jackson Johnson
Malloy Martin, Shane Matthews
Nicholson Reese Scott
Shealy Sheheen Williams
Total--18
NAYS
Alexander Bennett Campbell
Campsen Cleary Courson
Cromer Davis Fair
Gregory Grooms Hayes
Hembree Leatherman Martin, Larry
Massey McElveen McGill
Peeler Rankin Setzler
Thurmond Turner Verdin
Young
Total--25
Amendment No. 78
Senators CAMPSEN and LOURIE proposed the following amendment (DAD 117 CHARTERING SVCS ANALYSIS):
Amend the bill, as and if amended, Part IB, Section 117, GENERAL PROVISIONS, page 530, after line 18, by adding an appropriately numbered new proviso to read:
/ (GP: Aircraft Chartering Services Analysis) The Budget and Control Board is directed to conduct an analysis to determine the costs and benefits of selling the following state-owned aircraft operated by the Division of Aeronautics: Hawker Beechcraft King Air 350 and Hawker Beechcraft King Air C90; and authorizing private chartering services for use by state officials and state agencies to conduct the state's official business. This analysis must be presented to the Governor and General Assembly no later than January 1, 2014. The Governor shall have the authority to sell the state-owned aircraft if the cost-benefit analysis justifies the sale. /
Renumber sections to conform.
Amend sections, totals and title to conform.
Senator CAMPSEN explained the amendment.
Senator BRIGHT spoke on the amendment.
Point of Order
Senator LOURIE raised a Point of Order under Rule 24A that the amendment was out of order inasmuch as it was not germane to the Bill.
The PRESIDENT took the Point of Order under advisement.
Objection
Senator CAMPSEN asked unanimous consent to make a motion to amend the amendment.
Senator MALLOY objected.
Objection
At 7:01 P.M., with Senator CAMPSEN retaining the floor, Senator COURSON asked unanimous consent to make a motion that the Senate stand adjourned.
Senator BRIGHT objected.
Senator COURSON moved that when the Senate adjourns today, it stand adjourned to meet at 10:00 A.M. tomorrow.
On motion of Senator CAMPSEN, debate was interrupted by adjournment.
On motion of Senator SHEHEEN, with unanimous consent, the Senate stood adjourned out of respect to the memory of Mr. Robert "Bob" A. Carswell of Camden, S.C. Mr. Carswell was a retired CPA and a senior partner of Carswell, Cantey and Associates. He was a beloved stepfather and a doting grandfather and great-grandfather.
and
| 2016-07-23T09:12: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.37065035104751587, "perplexity": 8171.555364800655}, "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-30/segments/1469257821671.5/warc/CC-MAIN-20160723071021-00016-ip-10-185-27-174.ec2.internal.warc.gz"}
|
https://pos.sissa.it/303/049/
|
Volume 303 - Loops and Legs in Quantum Field Theory (LL2018) - Plenary 2
NNLO Parton Distributions for the LHC
S. Alekhin,* J. Bluemlein, S.O. Moch
*corresponding author
Full text: pdf
Published on: 2018 October 02
Abstract
We consider some trends, achievements and a series of remaining problems in the precision determination of parton distribution functions. For the description of the scaling violations of the deep-inelastic scattering data, forming the key ingredients to all PDF fits, a solid theoretical framework is of importance. It is provided by the fixed flavor number scheme in describing the heavy-quark contributions which is found in good agreement with
the present experimental data in a very wide range of momentum transfers. In this framework also a consistent determination of
the heavy-quark masses is possible at high precision. The emerging Drell-Yan data measured at hadron colliders start to play a crucial role in disentangling the quark species, particularly at small and large values of $x$. These new inputs demonstrate a good overall consistency with the earlier constraints on the PDFs coming from fixed-target experiments. No dramatic change is observed in
the PDFs in case of a consistent account of the higher-order QCD corrections and when leaving enough flexibility in the PDF shape parameterization.
DOI: https://doi.org/10.22323/1.303.0049
Open Access
Copyright owned by the author(s) under the term of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
| 2019-02-22T14:13: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": 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.3639673888683319, "perplexity": 1751.8833087815722}, "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-2019-09/segments/1550247518425.87/warc/CC-MAIN-20190222135147-20190222161147-00138.warc.gz"}
|
https://math.wikia.org/wiki/Lambda_Calculus
|
## FANDOM
1,168 Pages
Lambda Calculus (also known as λ-calc) is a way of expressing abstract functions. It was invented by Alonzo Church in the 1930s. It has many uses in computer programming, especially in languages like Python
## Examples
lambda x: x**2+1
represents the function
$\lambda x.x^2+1$
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-12-12T02:39:59 |
{"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.5072996020317078, "perplexity": 2854.114737419757}, "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-51/segments/1575540536855.78/warc/CC-MAIN-20191212023648-20191212051648-00081.warc.gz"}
|
https://par.nsf.gov/biblio/10209599-rigid-foldability-np-hard
|
Rigid foldability is NP-hard
In this paper, we show that the rigid-foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from the partition problem, and that rigid-foldability with optional creases is NP-hard by a reduction from the 1-in-3 SAT problem. Unlike flat-foldabilty of origami or flexibility of other kinematic linkages, whose complexity originates in the complexity of the layer ordering and possible self-intersection of the material, rigid foldabilltiy from a planar state is hard even though there is no potential self-intersection. In fact, the complexity comes from the combinatorial behavior of the different possible rigid folding configurations at each vertex. The results underpin the fact that it is harder to fold from an unfolded sheet of paper than to unfold a folded state back to a plane, frequently encountered problem when realizing folding-based systems such as self-folding matters and reconfigurable robots.
Authors:
; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10209599
Journal Name:
Journal of computational geometry
Volume:
11
Issue:
1
Page Range or eLocation-ID:
93–124
ISSN:
1920-180X
1. Given a locally flat-foldable origami crease pattern $G=(V,E)$ (a straight-line drawing of a planar graph on the plane) with a mountain-valley (MV) assignment $\mu:E\to\{-1,1\}$ indicating which creases in $E$ bend convexly (mountain) or concavely (valley), we may \emph{flip} a face $F$ of $G$ to create a new MV assignment $\mu_F$ which equals $\mu$ except for all creases $e$ bordering $F$, where we have $\mu_F(e)=-\mu(e)$. In this paper we explore the configuration space of face flips that preserve local flat-foldability of the MV assignment for a variety of crease patterns $G$ that are tilings of the plane. We prove examples wheremore »
| 2022-05-16T08:37: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.4793717861175537, "perplexity": 1113.813116391142}, "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-00649.warc.gz"}
|
https://www.usgs.gov/center-news/how-well-do-you-know-volcanoes-your-backyard
|
# How well do you know the volcanoes in your backyard?
Release Date:
We often hear the term "IQ" (intelligence quotient)—but how would you rate your "VAQ" (volcano awareness quotient)? In other words, how well do you know the volcanoes in your backyard?
Lava erupts from a fissure on Mauna Loa's northeast rift zone on March 26, 1984. At an elevation of 9,500 feet, this fissure was about 12 miles east of the original vent that opened in Moku‘āweoweo, Mauna Loa's summit caldera, 36 hours earlier.
(Public domain.)
Let's begin with a short quiz. No need to flash back to high school and those feelings of panic—sweaty palms and racing heart rate—that set in when your teacher announced a pop quiz on the homework you forgot to do. This quiz won't be scored by anyone other than you.
Here are five questions to test your VAQ: How many active volcanoes are in the State of Hawaii? What is the most abundant gas emitted by Kīlauea and other Hawaiian volcanoes? What is the longest known Kīlauea eruption? During the past 200 years, how many times have Mauna Loa lava flows reached the ocean? How many earthquakes of magnitude 6 or greater have occurred on Hawaii Island since 1900?
As we usher in the New Year, Mayor Billy Kenoi will issue a Proclamation from the County of Hawaii, designating January 2010 as "Volcano Awareness Month." Throughout the month, the USGS Hawaiian Volcano Observatory (HVO), in cooperation with Hawaii Volcanoes National Park, Hawaii County Civil Defense, and the University of Hawaii at Hilo, will sponsor various events to promote the importance of understanding and respecting the volcanoes on which we live.
Volcano Awareness Month kicks off on Saturday, January 2, at 10:00 a.m., with an opening event on the Jaggar Museum overlook in Hawaii Volcanoes National Park. The public is invited to attend.
Mayor Kenoi has been invited to read the Proclamation, and featured speakers will include "Thomas A. Jaggar," HVO's founder and first Director (portrayed by Peter Charlot), and Jim Kauahikaua, HVO's current Scientist-in-Charge. Cindy Orlando, Superintendent of Hawaii Volcanoes National Park; Quince Mento, Administrator of Hawaii County Civil Defense; and other special guests will also address volcano awareness.
This opening is just the first of a month-long series of events focusing on Hawaiian volcanoes. They include guided hikes, evening talks, teacher workshops and other extraordinary programs, and in order to reach a wide audience, are scheduled on weekdays, as well as weekends. Many of the programs and activities will be held in Hawaii Volcanoes National Park, but some will also take place in Hilo and in Kona.
A calendar and descriptions of all Volcano Awareness Month events are provided on HVO's Web site.
HVO selected January 2010 as Volcano Awareness Month, largely because January 3, 2010, marks the 27th anniversary of Kīlauea's ongoing east rift zone eruption. It will also be 20 years since Kalapana was buried beneath lava and 50 years since Kapoho was inundated by fast-moving lava flows. The destruction of these two communities is a sobering reminder of why it's important to understand how Hawaii's volcanoes work.
Now, back to the quiz. The answers, in order of the questions asked, are as follows. There are six active volcanoes (defined as erupting in the past 10,000 years) in the State of Hawaii. Water vapor is the most abundant gas released by Hawaiian volcanoes, followed by carbon dioxide (CO2) and sulfur dioxide (SO2). The Ailaau eruption, which lasted about 60 years from around 1410 to 1470, is Kīlauea's longest known eruption. Eight Mauna Loa lava flows, from eruptions in 1859, 1868, 1887, 1919, 1926, and 1950, have reached the ocean in the last 200 years. Since 1900, there have been 13 magnitude-6 or greater earthquakes—in 1929, 1941, 1950, 1951, 1952, 1954, 1962, 1973, 1975, 1983, 1989, and 2006.
Even if you aced the quiz—and especially if you did not—we encourage you to participate in Volcano Awareness Month events to learn more about Hawaii's volcanoes. Don't be caught with a low "volcano awareness quotient" if the volcano in your backyard erupts!
————————————————————————————————————————————————————————————————
### Volcano Activity Update
Lava continues to erupt from the TEB vent on Kīlauea's east rift zone and flow through tubes to the ocean at two locations—Waikupanaha and west Waikupanaha. Small surface flows have been sporadically active on the coastal plain for the last several weeks. In the past week, these surface flows were scattered mostly over a broad area just inland from the shoreline more than 1 km to the west of the Hawaii County lava viewing trail.
Glow above the vent at Kīlauea's summit has been visible at night from the Jaggar Museum. Incandescent openings, sometimes yielding bursts of spatter, were visible on the floor of the vent cavity throughout the week, as recorded by the Webcam perched on the rim of Halemaumau Crater. Volcanic gas emissions remain elevated, resulting in high concentrations of sulfur dioxide downwind.
No earthquakes beneath Hawai`i Island were reported felt for the second week.
Visit our Web site for detailed Kīlauea and Mauna Loa activity updates, recent volcano photos, recent earthquakes, and more; call (808) 967-8862 for a Kīlauea activity summary; email questions to [email protected].
| 2020-03-31T19:57: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.17253167927265167, "perplexity": 3346.986544450269}, "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-16/segments/1585370503664.38/warc/CC-MAIN-20200331181930-20200331211930-00492.warc.gz"}
|
https://www.scstatehouse.gov/sess121_2015-2016/sj15/20150603.htm
|
South Carolina General Assembly
121st Session, 2015-2016
Journal of the Senate
Wednesday, June 3, 2015
(Statewide Session)
Indicates Matter Stricken
Indicates New Matter
The Senate assembled at 11:00 A.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 Chaplain as follows:
At the end of the book Deuteronomy we note:
"Then Moses climbed Mount Nebo from the plains of Moab to the top of Pisgah, across from Jericho." And the Lord God said, " '...you will not cross over into it'." (Deuteronomy 34:1a)
Pray with me, if you will:
We all recall, O God, how Moses was never able to experience absolute fulfillment of all that he dreamed of accomplishing. How difficult it always is, Lord, to stand on the brink of getting done what You truly believe in. How frustrating. How disappointing. How natural it is, God, for us to wonder what the final judgment upon the work of this Senate will be? A satisfying year? A year of brilliant accomplishments? A year of "if only"? Whatever, dear God, we ask You to embrace each of these leaders in your care. Lead them wisely and well even in these final days of this Legislative Session. In Your wondrous name do we pray, O Lord. Amen.
The PRESIDENT called for Petitions, Memorials, Presentments of Grand Juries and such like papers.
MESSAGE FROM THE GOVERNOR
The following appointment was transmitted by the Honorable Nikki Randhawa Haley:
Local Appointment
Reappointment, Greenville County Master-in-Equity, with the term to commence April 30, 2015, and to expire April 30, 2021
Charles B. Simmons, Jr., 305 East North Street, Suite 313, Greenville, SC 29601
On motion of Senator KIMPSON, with unanimous consent, Senators MALLOY, HEMBREE and THURMOND were granted leave to attend a subcommittee meeting and were granted leave to vote from the balcony.
Doctor of the Day
Senator LOURIE introduced Dr. Helmut Albrecht of Columbia, S.C., Doctor of the Day.
Leave of Absence
At 2:20 P.M., Senator CAMPBELL requested a leave of absence for Senator VERDIN until 2:45 P.M.
Leave of Absence
At 2:26 P.M., Senator FAIR requested a leave of absence beginning at 3:30 P.M. until tomorrow, Thursday, June 4, 2015, at 11:00 A.M.
The following co-sponsor was added to the respective Bill:
S. 845 (Word version) Sen. Cleary
RECALLED
H. 3896 (Word version) -- Reps. Jefferson, Daning, Crosby, Merrill, Southard and Rivers: A CONCURRENT RESOLUTION TO REQUEST THAT THE DEPARTMENT OF TRANSPORTATION NAME THE PORTION OF SOUTH CAROLINA HIGHWAY 311 IN BERKELEY COUNTY FROM ITS INTERSECTION WITH UNITED STATES HIGHWAY 176 TO MUDVILLE ROAD "CALDWELL PINCKNEY, SR. MEMORIAL HIGHWAY" AND ERECT APPROPRIATE MARKERS OR SIGNS ALONG THIS PORTION OF HIGHWAY THAT CONTAIN THIS 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
READ THE SECOND TIME
H. 3670 (Word version) -- Reps. Lowe, Williams and Kirby: A BILL TO AMEND SECTION 4-23-1005, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE ORIGINAL AREA OF THE WEST FLORENCE FIRE DISTRICT IN FLORENCE AND DARLINGTON COUNTIES, SO AS TO FURTHER PROVIDE FOR THE DESCRIPTION OF THE ORIGINAL FLORENCE COUNTY PORTION OF THE DISTRICT WITHOUT CHANGING THE BOUNDARIES OF THE DISTRICT AT ITS CREATION; BY ADDING SECTION 4-23-1006 SO AS TO ADD ADDITIONAL AREAS IN EITHER FLORENCE OR DARLINGTON COUNTIES TO THE ORIGINAL AREA OF THE DISTRICT; TO AMEND SECTION 4-23-1015, RELATING IN PART TO THE MILLAGE LEVY OF THE DISTRICT, SO AS TO STIPULATE WHICH REFERENDUM PROVISIONS CONTROL IN REGARD TO MILLAGE RATE LIMITATIONS; TO AMEND SECTION 4-23-1025, RELATING IN PART TO RESTRICTIONS ON DIMINISHING THE AUTHORITY OF THE DISTRICT COMMISSION OR THE AREA OF THE DISTRICT, AND TO THE REAL AND PERSONAL PROPERTY OF THE DISTRICT, SO AS TO PROVIDE THAT CERTAIN PROVISIONS OF LAW IN REGARD TO MUNICIPAL ANNEXATION OF PARTS OF A SPECIAL PURPOSE DISTRICT CONTINUE TO APPLY TO THE WEST FLORENCE FIRE DISTRICT, AND TO FURTHER PROVIDE FOR THE TRANSFER OF CERTAIN REAL AND PERSONAL PROPERTY TO THE DISTRICT; AND TO AMEND SECTION 4-23-1040, RELATING TO WHICH POLITICAL SUBDIVISION MAY IMPOSE MILLAGE LEVIES OR FIRE SERVICE FEES IN THE DISTRICT, SO AS TO CLARIFY THE BASIS FOR WHICH THE WEST FLORENCE FIRE DISTRICT ONLY MAY LEVY AD VALOREM PROPERTY TAXES IN THE DISTRICT FOR THE PROVISION OF FIRE OR FIRE PROTECTION SERVICES.
Senator LARRY MARTIN asked unanimous consent to make a motion to recall the Bill from the Committee on Judiciary.
The Bill was recalled from the Committee on Judiciary and was ordered placed on the Calendar for consideration tomorrow.
On motion of Senator LARRY MARTIN, with unanimous consent, the Bill was read the second time and ordered to a third reading.
Motion Under Rule 26B Waived
Senator LARRY MARTIN asked unanimous consent to make a motion to waive the provisions of Rule 26B in order to allow amendments to be considered on third reading.
There was no objection.
RECALLED
H. 3874 (Word version) -- Reps. Mitchell, Cobb-Hunter, Merrill, Loftis, Dillard and Govan: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 12-6-3770 SO AS TO PROVIDE FOR AN INCOME TAX CREDIT TO AN INDIVIDUAL OR BUSINESS THAT CONSTRUCTS, PURCHASES, OR LEASES RENEWABLE ENERGY PROPERTY AND PLACES IT IN SERVICE IN THIS STATE, AND TO PROVIDE A DEFINITION OF "RENEWABLE ENERGY PROPERTY".
Senator LEATHERMAN asked unanimous consent to make a motion to recall the Bill from the Committee on Finance.
The Bill was recalled from the Committee on Finance and ordered placed on the Calendar for consideration tomorrow.
RECALLED AND COMMITTED
S. 72 (Word version) -- Senators Campsen and Grooms: A BILL TO AMEND SECTION 59-39-112 OF THE 1976 CODE, RELATING TO ELECTIVE CREDIT FOR RELEASED TIME CLASSES IN RELIGIOUS INSTRUCTION FOR HIGH SCHOOL STUDENTS, TO PROVIDE THAT THE SCHOOL DISTRICT BOARD OF TRUSTEES MAY, AS A MEANS TO ENSURE EVALUATION OF INSTRUCTION ON THE BASIS OF PURELY SECULAR CRITERIA, ACCEPT TIME RELEASED CREDITS AS TRANSFER CREDITS FROM AN ACCREDITED PRIVATE SCHOOL THAT HAS AWARDED PRIVATE SCHOOL CREDITS FOR A RELEASED TIME PROGRAM OPERATED BY AN UNACCREDITED ENTITY.
Senator CAMPSEN asked unanimous consent to make a motion to recall the Bill from the Committee on Education.
There was no objection and the Bill was recalled from the Committee on Education.
On motion of Senator CAMPSEN, with unanimous consent, the Bill was committed to the Committee on Judiciary.
COMMITTED
S. 851 (Word version) -- Senators Scott and Jackson: A BILL TO AMEND ACT 613 OF 1986, AS AMENDED, RELATING TO SCHOOL DISTRICTS IN RICHLAND COUNTY, SO AS TO REAPPORTION THE FOUR SINGLE-MEMBER ELECTION DISTRICTS FROM WHICH THE TRUSTEES OF RICHLAND COUNTY SCHOOL DISTRICT ONE ARE ELECTED, TO DESIGNATE A MAP NUMBER ON WHICH THESE SINGLE-MEMBER ELECTION DISTRICTS ARE DELINEATED, AND TO PROVIDE DEMOGRAPHIC INFORMATION PERTAINING TO THE REAPPORTIONED ELECTION DISTRICTS.
On motion of Senator SCOTT, the Bill was committed to the Local Delegation.
INTRODUCTION OF BILLS AND RESOLUTIONS
The following were introduced:
S. 859 (Word version) -- Senators Turner and Shealy: A BILL TO AMEND THE 1976 CODE, BY ADDING ARTICLE 2, CHAPTER 2, TITLE 56 SO AS TO ESTABLISH IMMUNITY FROM LIABILITY FOR INJURIES OR DEATH TO A PERSON ENGAGED IN AN ATV ACTIVITY CAUSED BY AN INHERENT RISK OF ATV ACTIVITY.
l:\s-res\rt\004atv .eb.rt.docx
Read the first time and referred to the Committee on Transportation.
S. 860 (Word version) -- Senator Hembree: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING CHAPTER 30 TO TITLE 27 TO ENACT THE "SOUTH CAROLINA HOMEOWNERS PROTECTION ACT OF 2015" SO AS TO SET FORTH THE MANNER IN WHICH A HOMEOWNERS ASSOCIATION CREATED AFTER 2015 MUST BE ESTABLISHED AND ADMINISTERED, AND TO SET FORTH THE RIGHTS OF THE ASSOCIATION AND ITS OWNERS; TO AMEND SECTION 22-3-10, RELATING TO THE JURISDICTION OF MAGISTRATES, SO AS TO GRANT MAGISTRATES CONCURRENT CIVIL JURISDICTION IN CERTAIN ACTIONS BETWEEN ASSOCIATIONS AND OWNERS; AND TO AMEND SECTION 22-3-20, RELATING TO THE JURISDICTION OF MAGISTRATES, SO AS TO PROVIDE THAT A MAGISTRATE DOES NOT HAVE JURISDICTION OF CERTAIN FORECLOSURE ACTIONS BY AN ASSOCIATION.
l:\s-res\gh\012home.eb.gh.docx
Read the first time and referred to the Committee on Judiciary.
l:\s-res\tca\044pawn.ls.tca.docx
Read the first time and referred to the Committee on Labor, Commerce and Industry.
S. 862 (Word version) -- Senators Rankin and Hembree: A BILL TO AMEND SECTION 6-1-510, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE LOCAL ACCOMMODATIONS TAX, SO AS TO CLARIFY THE DEFINITION OF THE LOCAL ACCOMMODATIONS TAX; BY ADDING SECTION 6-1-580 SO AS TO PROVIDE THAT A THIRD PARTY WHO ACCEPTS AN ACCOMMODATION CHARGE IS LIABLE FOR ACCOMMODATIONS TAX; BY ADDING SECTION 6-1-590 SO AS TO PROVIDE THAT THE LOCAL ACCOMMODATIONS TAX DOES NOT APPLY TO CERTAIN RESIDENTIAL REAL PROPERTY; TO AMEND SECTION 12-36-920, RELATING TO THE TAX ON ACCOMMODATIONS FOR TRANSIENTS, SO AS TO CLARIFY WHICH PARTY IS RESPONSIBLE FOR THE ACCOMMODATIONS TAX, AND TO PROVIDE THAT A THIRD PARTY WHO ACCEPTS AN ACCOMMODATION CHARGE IS LIABLE FOR ACCOMMODATIONS TAX.
l:\council\bills\dka\3115sa15.docx
Read the first time and referred to the Committee on Finance.
S. 863 (Word version) -- Senator Scott: A BILL TO AMEND ACT 613 OF 1986, AS AMENDED, RELATING TO SCHOOL DISTRICTS IN RICHLAND COUNTY, SO AS TO REAPPORTION THE FOUR SINGLE-MEMBER ELECTION DISTRICTS FROM WHICH THE TRUSTEES OF RICHLAND COUNTY SCHOOL DISTRICT ONE ARE ELECTED, TO DESIGNATE A MAP NUMBER ON WHICH THESE SINGLE-MEMBER ELECTION DISTRICTS ARE DELINEATED, AND TO PROVIDE DEMOGRAPHIC INFORMATION PERTAINING TO THE REAPPORTIONED ELECTION DISTRICTS.
l:\council\bills\ggs\22772zw15.docx
Read the first time and ordered placed on the Local and Uncontested Calendar.
S. 864 (Word version) -- Senators O'Dell and Campsen: A SENATE RESOLUTION TO RECOGNIZE AND HONOR LIEUTENANT GENERAL WILLIAM MICHAEL STEELE, USA (RETIRED), FOR HIS SIX YEARS OF DEDICATED AND OUTSTANDING SERVICE ON THE CITADEL BOARD OF VISITORS AND, UPON THE OCCASION OF HIS RETIREMENT FROM THE BOARD, TO WISH HIM MUCH HAPPINESS AND FULFILLMENT IN THE YEARS AHEAD.
l:\council\bills\rm\1324zw15.docx
The Senate Resolution was adopted.
S. 865 (Word version) -- Senator Shealy: A SENATE RESOLUTION TO RECOGNIZE AND CONGRATULATE ST. JAMES LUTHERAN CHURCH IN LEXINGTON ON THE OCCASION OF ITS HISTORIC ONE HUNDRED TWENTY-FIFTH ANNIVERSARY AND TO COMMEND THE CHURCH FOR MORE THAN A CENTURY OF SERVICE TO GOD AND THE COMMUNITY.
l:\s-res\ks\034st. .kmm.ks.docx
The Senate Resolution was adopted.
S. 866 (Word version) -- Senator Shealy: A SENATE RESOLUTION TO RECOGNIZE AND CONGRATULATE PLEASANT HILL MISSIONARY BAPTIST CHURCH IN LEXINGTON ON THE OCCASION OF ITS HISTORIC ONE HUNDRED FIFTIETH ANNIVERSARY AND TO COMMEND THE CHURCH FOR MORE THAN A CENTURY OF SERVICE TO GOD AND THE COMMUNITY.
l:\s-res\ks\033plea.kmm.ks.docx
The Senate Resolution was adopted.
S. 867 (Word version) -- Senator Peeler: A SENATE RESOLUTION TO RECOGNIZE AND HONOR KAYE CAMPBELL HILLIARD UPON THE OCCASION OF HER RETIREMENT AFTER MORE THAN TEN YEARS OF FAITHFUL SERVICE ON THE STAFF OF THE SOUTH CAROLINA SENATE AND TO WISH HER CONTINUED SUCCESS AND HAPPINESS IN ALL HER FUTURE ENDEAVORS.
l:\council\bills\ggs\22779zw15.docx
The Senate Resolution was adopted.
S. 868 (Word version) -- Senators Young, Massey and Setzler: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 3 TO CHAPTER 7, TITLE 58 SO AS TO PROVIDE PROCEDURES FOR THE EXERCISE OF EMINENT DOMAIN BY PIPELINE COMPANIES, TO PROVIDE NECESSARY DEFINITIONS, TO PROVIDE CERTAIN RELATED CERTIFICATION OR PERMITTING FUNCTIONS AT THE PUBLIC SERVICE COMMISSION AND THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL, AND TO PROVIDE PROPERTY OWNER RIGHTS AND A CAUSE OF ACTION FOR DAMAGES SUSTAINED BY CERTAIN ADJACENT PROPERTY OF THE OWNER OF PROPERTY CONDEMNED UNDER THE PROVISIONS OF THIS ACT; AND TO DESIGNATE THE EXISTING PROVISIONS IN THE CHAPTER AS ARTICLE 1 ENTITLED "GAS AND WATER COMPANIES".
l:\council\bills\agm\18669ab15.docx
Read the first time and referred to the Committee on Judiciary.
S. 869 (Word version) -- Senators McElveen, Cleary, Alexander, Allen, Bennett, Bright, Bryant, Campbell, Campsen, Coleman, Corbin, Courson, Cromer, Davis, Fair, Gregory, Grooms, Hayes, Hembree, Hutto, Jackson, Johnson, Kimpson, Leatherman, Lourie, Malloy, L. Martin, S. Martin, Massey, Matthews, Nicholson, O'Dell, Peeler, Pinckney, Rankin, Reese, Sabb, Scott, Setzler, Shealy, Sheheen, Thurmond, Turner, Verdin, Williams and Young: A SENATE RESOLUTION TO CONGRATULATE DR. WALLIE B. JONES OF SUMTER UPON THE OCCASION OF HIS RETIREMENT FROM A FORTY-YEAR CAREER IN GENERAL DENTISTRY AND TO HONOR HIM FOR HIS CONTINUED WORK WITH YOUNG MEN, TEACHING THEM BASEBALL AND LIFE SKILLS.
l:\s-res\jtm\016wall.kmm.jtm.docx
The Senate Resolution was adopted.
H. 4151 (Word version) -- Reps. Pitts, White, Bannister and D. C. Moss: A BILL TO AMEND SECTION 12-21-735, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE STAMP TAX ON CIGARETTES AND TOBACCO PRODUCTS, SO AS TO REQUIRE AND PROVIDE FOR THE PROPER AFFIXING OF STAMPS, INCLUDING PROVISIONS FOR EXEMPT PACKAGES, UNIQUE SERIAL NUMBERING OF STAMPS, REVOCATION OF THE LICENSE OF A PERSON VIOLATING THESE PROVISIONS, LIMITATIONS ON THE RECEIPT AND SALE OF UNTAXED CIGARETTES, TO PROVIDE FOR RETURN AND PAYMENT OF THE TAX, AND TO AUTHORIZE THE DEPARTMENT OF REVENUE TO PROMULGATE REGULATIONS NECESSARY TO ESTABLISH, IMPLEMENT, AND ENFORCE THESE PROVISIONS.
Read the first time and referred to the Committee on Finance.
H. 4185 (Word version) -- Rep. McEachern: A CONCURRENT RESOLUTION TO REQUEST THAT THE DEPARTMENT OF TRANSPORTATION NAME THE INTERCHANGE LOCATED AT THE INTERSECTION OF INTERSTATE HIGHWAY 20 AND UNITED STATES HIGHWAY 321 IN RICHLAND COUNTY "WILLIE R. PORTEE INTERCHANGE" AND ERECT APPROPRIATE MARKERS OR SIGNS AT THIS INTERCHANGE THAT CONTAIN THIS DESIGNATION.
The Concurrent Resolution was introduced and referred to the Committee on Transportation.
H. 4194 (Word version) -- Rep. Quinn: A CONCURRENT RESOLUTION TO REQUEST THAT THE DEPARTMENT OF CORRECTIONS NAME THE INMATE CEMETERY LOCATED ON ITS BROAD RIVER ROAD PROPERTY IN RICHLAND COUNTY "PAUL ISAIAH WELDON CEMETERY".
The Concurrent Resolution was introduced and referred to the Committee on Corrections and Penology.
Message from the House
Columbia, S.C., June 2, 2015
Mr. President and Senators:
The House respectfully informs your Honorable Body that it concurs in the amendments proposed by the Senate to:
H. 3583 (Word version) -- Reps. Clemmons, Simrill, McCoy, Loftis, Atwater, Kirby, Corley, Bernstein, McEachern, Weeks, Johnson, Goldfinch, Kennedy, H.A. Crawford, Rutherford, Whitmire, Douglas, Burns, Clyburn, Erickson, G.R. Smith, Yow, Spires, Chumley, Allison, Hardee, Anderson, Gagnon, Putnam, Nanney, Williams, Limehouse, Duckworth, Norrell, Anthony, Ballentine, Bannister, Bedingfield, Bingham, Clary, Delleney, Felder, Finlay, Funderburk, Gambrell, Hamilton, Hardwick, Hicks, Hiott, Hixon, Huggins, Long, Lowe, Lucas, V.S. Moss, Murphy, Norman, Pitts, Pope, Quinn, Riley, Rivers, Sandifer, G.M. Smith, Stringer, Tallon, Taylor, Thayer, Toole, Wells, Willis, Newton, Forrester, Hill and Gilliard: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 23 TO CHAPTER 35, TITLE 11 SO AS TO PROHIBIT THE STATE OR A POLITICAL SUBDIVISION OF THE STATE FROM ACCEPTING A PROPOSAL FROM OR PROCURING GOODS OR SERVICES FROM A BUSINESS WHICH ENGAGES IN THE BOYCOTT OF A PERSON OR AN ENTITY BASED ON RACE, COLOR, RELIGION, OR NATIONAL ORIGIN.
and has ordered the Bill enrolled for Ratification.
Very respectfully,
Speaker of the House
Message from the House
Columbia, S.C., May 5, 2015
Mr. President and Senators:
The House respectfully informs your Honorable Body that it has confirmed the appointment:
MASTER-IN-EQUITY
Reappointment, Greenville County Master-in-Equity, with term to commence April 30, 2015, and to expire April 30, 2021:
The Honorable Charles B. Simmons, Jr., 305 East North Street, Suite 313, Greenville, SC 29601
Very respectfully,
Speaker of the House
Message from the House
Columbia, S.C., June 3, 2015
Mr. President and Senators:
The House respectfully informs your Honorable Body that it has requested and was granted Free Conference Powers and has appointed Reps. Newton, Taylor and Norrell to the Committee of Free Conference on the part of the House on:
S. 11 (Word version) -- Senators L. Martin, Malloy, Peeler, Courson, Campsen, Johnson, Hembree, Setzler, Coleman, Alexander, Scott and Sheheen: A BILL TO AMEND SECTION 30-4-80, SOUTH CAROLINA CODE OF LAWS, 1976, RELATING TO THE NOTICE OF MEETINGS FOR PUBLIC BODIES, TO REQUIRE THAT A PUBLIC BODY MUST PROVIDE AN AGENDA FOR ALL REGULARLY SCHEDULED MEETINGS AND THAT ITEMS SHALL NOT BE ADDED TO THAT AGENDA LATER THAN TWENTY-FOUR HOURS BEFORE THE MEETING, EXCEPT BY A TWO-THIRDS VOTE OF THE BODY.
Very respectfully,
Speaker of the House
Message from the House
Columbia, S.C., June 3, 2015
Mr. President and Senators:
The House respectfully informs your Honorable Body that it has adopted the Report of the Committee of Free Conference on the following Bill and has ordered the Bill enrolled for Ratification:
S. 11 (Word version) -- Senators L. Martin, Malloy, Peeler, Courson, Campsen, Johnson, Hembree, Setzler, Coleman, Alexander, Scott and Sheheen: A BILL TO AMEND SECTION 30-4-80, SOUTH CAROLINA CODE OF LAWS, 1976, RELATING TO THE NOTICE OF MEETINGS FOR PUBLIC BODIES, TO REQUIRE THAT A PUBLIC BODY MUST PROVIDE AN AGENDA FOR ALL REGULARLY SCHEDULED MEETINGS AND THAT ITEMS SHALL NOT BE ADDED TO THAT AGENDA LATER THAN TWENTY-FOUR HOURS BEFORE THE MEETING, EXCEPT BY A TWO-THIRDS VOTE OF THE BODY.
Very respectfully,
Speaker of the House
Message from the House
Columbia, S.C., June 3, 2015
Mr. President and Senators:
The House respectfully informs your Honorable Body that it has returned the following Bill to the Senate with amendments:
H. 3114 (Word version) -- Reps. Nanney, Hicks, Allison, Atwater, Ballentine, Bannister, Bingham, Brannon, Burns, Chumley, Clary, Corley, H.A. Crawford, Crosby, Daning, Delleney, Erickson, Forrester, Gagnon, Goldfinch, Hamilton, Henderson, Herbkersman, Hiott, Huggins, Kennedy, Limehouse, Loftis, Long, McCoy, Merrill, D.C. Moss, Newton, Pitts, Pope, Quinn, Ryhal, Sandifer, G.M. Smith, G.R. Smith, Stringer, Tallon, Taylor, Thayer, Yow, Wells, Willis, Hixon, Putnam, Rivers, V.S. Moss, Whitmire, Bedingfield, Hill, Duckworth and Clemmons: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 5 TO CHAPTER 41, TITLE 44 SO AS TO ENACT THE "SOUTH CAROLINA PAIN-CAPABLE UNBORN CHILD PROTECTION ACT", TO PROVIDE FINDINGS OF THE GENERAL ASSEMBLY, TO DEFINE NECESSARY TERMS, TO REQUIRE A PHYSICIAN TO CALCULATE THE PROBABLE POST-FERTILIZATION AGE OF AN UNBORN CHILD BEFORE PERFORMING OR INDUCING AN ABORTION, TO PROVIDE THAT AN ABORTION MAY NOT BE PERFORMED IF THE PROBABLE POST-FERTILIZATION AGE OF THE UNBORN CHILD IS TWENTY OR MORE WEEKS, TO PROVIDE FOR EXCEPTIONS, TO REQUIRE CERTAIN REPORTING BY PHYSICIANS WHO PERFORM ABORTIONS TO THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL, TO REQUIRE THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL TO PREPARE PUBLIC REPORTS THAT PROVIDE DATA ON ABORTIONS PERFORMED IN THE STATE AND TO PROMULGATE REGULATIONS, TO PROVIDE FOR A CIVIL RIGHT OF ACTION FOR CERTAIN INDIVIDUALS AGAINST A PHYSICIAN PERFORMING AN ABORTION IN VIOLATION OF THE ACT AND FOR INJUNCTIVE RELIEF, TO CREATE CRIMINAL PENALTIES, AND TO PROVIDE THE ACT DOES NOT IMPLICITLY OR OTHERWISE REPEAL ANOTHER PROVISION OF LAW.
Very respectfully,
Speaker of the House
Placed on Calendar for consideration tomorrow.
HOUSE CONCURRENCES
S. 839 (Word version) -- Senators O'Dell and Nicholson: A CONCURRENT RESOLUTION TO RECOGNIZE AND HONOR JUANITA DAVENPORT "NITA" HOZEY, OWNER AND SOLE OPERATOR OF PRAISE UNLIMITED WEDDINGS, LLC, AND TO CONGRATULATE HER FOR BEING NAMED THE 2015 SOUTH CAROLINA WOMEN IN BUSINESS ADVOCATE OF THE YEAR.
Returned with concurrence.
S. 840 (Word version) -- Senator O'Dell: A SENATE RESOLUTION TO RECOGNIZE AND HONOR THE BELTON HONEA PATH HIGH SCHOOL BASEBALL TEAM FOR ANOTHER OUTSTANDING SEASON AND TO CONGRATULATE THE PLAYERS ON CAPTURING THE 2015 CLASS AAA STATE CHAMPIONSHIP TITLE.
Returned with concurrence.
Privilege of the Chamber
On motion of Senator BRYANT, on behalf of Senator McELVEEN, in accordance with the provisions of Rule 35, the Privilege of the Chamber, to that area behind the rail, was extended to Ms. Mary DeVaughn Lee-Alston.
THE SENATE PROCEEDED TO A CALL OF THE UNCONTESTED LOCAL AND STATEWIDE CALENDAR.
ORDERED ENROLLED FOR RATIFICATION
The following Bills were read the third time and, having received three readings in both Houses, it was ordered that the title be changed to that of an Act and enrolled for Ratification:
H. 3548 (Word version) -- Reps. J.E. Smith, Yow and Weeks: A BILL TO AMEND SECTION 63-7-320, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO NOTIFICATION AND TRANSFER OF REPORTS OF CHILD ABUSE OR NEGLECT, SO AS TO PROVIDE THAT IF THE ALLEGED ABUSED OR NEGLECTED CHILD IS A MEMBER OF AN ACTIVE DUTY MILITARY FAMILY, THE COUNTY DEPARTMENT OF SOCIAL SERVICES SHALL NOTIFY CERTAIN DESIGNATED MILITARY OFFICIALS AT THE INSTALLATION WHERE THE ACTIVE DUTY SERVICE MEMBER, WHO IS THE SPONSOR OF THE ALLEGED ABUSED OR NEGLECTED CHILD, IS ASSIGNED; TO AMEND SECTION 63-7-920, RELATING TO INVESTIGATIONS AND CASE DETERMINATIONS OF THE DEPARTMENT OF SOCIAL SERVICES, SO AS TO PROVIDE THAT THE DEPARTMENT OR LAW ENFORCEMENT, OR BOTH, MAY COLLECT INFORMATION CONCERNING THE MILITARY AFFILIATION OF THE PERSON HAVING CUSTODY OR CONTROL OF THE CHILD SUBJECT TO AN INVESTIGATION AND MAY SHARE THIS INFORMATION WITH THE APPROPRIATE MILITARY AUTHORITIES; TO AMEND SECTION 63-7-1990, AS AMENDED, RELATING TO CONFIDENTIALITY AND RELEASE OF RECORDS AND INFORMATION, SO AS TO MAKE TECHNICAL CORRECTIONS AND TO AUTHORIZE THE DEPARTMENT OF SOCIAL SERVICES TO GRANT ACCESS TO THE RECORDS OF AN INDICATED CASE TO CERTAIN DESIGNATED MILITARY OFFICIALS AT THE INSTALLATION WHERE THE ACTIVE DUTY SERVICE MEMBER, WHO IS THE SPONSOR OF THE ALLEGED ABUSED OR NEGLECTED CHILD, IS ASSIGNED; AND TO AMEND SECTION 63-11-80, RELATING TO CONFIDENTIAL INFORMATION WITHIN CHILD WELFARE AGENCIES, SO AS TO PROVIDE THAT AN OFFICER, AGENT OR EMPLOYEE OF THE DEPARTMENT OR A CHILD WELFARE AGENCY SHALL NOT DISCLOSE, DIRECTLY OR INDIRECTLY, INFORMATION LEARNED ABOUT A CHILD, THE CHILD'S PARENTS OR RELATIVES, OR OTHER PERSONS HAVING CUSTODY OR CONTROL OF THE CHILD, EXCEPT IN CASES INVOLVING A CHILD IN THE CUSTODY OR CONTROL OF PERSONS WHO HAVE MILITARY AFFILIATION.
H. 3772 (Word version) -- Reps. Merrill and Delleney: A BILL TO AMEND SECTION 38-79-260, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO APPOINTMENT OF DIRECTORS TO THE BOARD OF THE SOUTH CAROLINA MEDICAL MALPRACTICE INSURANCE JOINT UNDERWRITING ASSOCIATION, SO AS TO PROVIDE FOR THE REAPPOINTMENT OF DIRECTORS TO SUCCESSIVE TERMS BY DELETING A RELATED PROHIBITION.
HOUSE BILLS RETURNED
The following Bills were read the third time and ordered returned to the House with amendments:
H. 3266 (Word version) -- Reps. Hiott, Bannister, Brannon, Erickson, Henderson, Collins, Sandifer, Corley, Tallon, Taylor, Thayer, Wells, Felder, Kirby, Hixon, Hodges, Riley, Ott, Goldfinch, Hardee, Gagnon, Pitts, Finlay, Southard, D.C. Moss, Chumley, Yow, Huggins, Kennedy, Rivers and White: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING CHAPTER 82 TO TITLE 15 SO AS TO ESTABLISH THE "TRESPASSER RESPONSIBILITY ACT" WHICH PROVIDES A LIMITATION ON LIABILITY BY LAND POSSESSORS TO TRESPASSERS, AND TO PROVIDE EXCEPTIONS.
H. 3545 (Word version) -- Reps. Gambrell, Weeks, Bedingfield, V.S. Moss, Clemmons, Forrester, Gagnon, D.C. Moss, Pitts, Riley, G.M. Smith, G.R. Smith, White and Yow: A BILL TO AMEND SECTION 16-11-110, AS AMENDED, RELATING TO ARSON, SO AS TO RESTRUCTURE THE ELEMENTS OF THE DEGREES OF ARSON.
H. 3882 (Word version) -- Reps. Gambrell, Gagnon, Putnam and Thayer: A BILL TO AMEND SECTION 59-67-160, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO PHYSICAL EXAMINATIONS OF SCHOOL BUS DRIVERS, SO AS TO PROVIDE THE PHYSICAL MUST BE A DEPARTMENT OF TRANSPORTATION PHYSICAL THAT MEETS THE REQUIREMENTS OF THE CERTAIN FEDERAL MOTOR CARRIER SAFETY REGULATIONS IN ADDITION TO EXISTING STATE CERTIFICATION REQUIREMENTS.
COMMITTEE AMENDMENT TABLED
AMENDED, READ THE THIRD TIME
RETURNED TO THE HOUSE
H. 3525 (Word version) -- Reps. Sandifer, Forrester and Hayes: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 16 TO CHAPTER 23, TITLE 58 SO AS TO PROVIDE FOR THE REGULATION OF TRANSPORTATION NETWORK COMPANIES; TO AMEND SECTION 58-4-60, RELATING TO THE DUTIES AND RESPONSIBILITIES OF THE OFFICE OF REGULATORY STAFF, SO AS TO PROVIDE FOR THE EXPENSES OF THE TRANSPORTATION DEPARTMENT BORNE BY ASSESSMENTS TO TRANSPORTATION NETWORK COMPANIES IN ADDITION TO EXISTING SOURCES; AND TO AMEND SECTION 58-23-50, RELATING TO EXEMPTIONS FROM REGULATION OF MOTOR VEHICLE CARRIERS BY THE PUBLIC SERVICE COMMISSION, SO AS TO EXEMPT TRANSPORTATION NETWORK COMPANIES.
The Senate proceeded to a consideration of the Bill.
Senator GROOMS explained the Bill.
The Committee on Transportation proposed the following amendment (3525R002.KM.LKG), which was tabled:
Amend the bill, as and if amended, by striking all after the enacting words and inserting:
/ SECTION 1. Chapter 23, Title 58 of the 1976 Code is amended by adding:
"Article 19
South Carolina Transportation Network Companies
Section 58-23-1900. This article may be cited as the 'South Carolina Transportation Network Companies Act'.
Section 58-23-1910. For the purposes of this article:
(1) 'Personal vehicle' means a vehicle that is used by a transportation network company driver in connection with providing a prearranged ride and is:
(a) owned, leased, or otherwise authorized for use by the transportation network company driver; and
(b) not a taxi, charter bus, charter limousine, or for-hire vehicle.
(2) 'Digital network' means any online-enabled application, software, website, or system offered or utilized by a TNC that enables the prearrangement of rides with transportation network company drivers.
(3) 'Transportation network company' or 'TNC' means a corporation, partnership, sole proprietorship, or other entity operating in the State that uses a digital network to connect transportation network company riders to transportation network company drivers who provide prearranged rides. A transportation network company shall not be deemed to control, direct, or manage the personal vehicles of transportation network company drivers that connect to its digital network, except where agreed to by written contract.
(4) 'Transportation network company driver' or 'driver' means an individual who:
(a) receives connections to potential passengers and related services from a transportation network company in exchange for payment of a fee to the transportation network company; and
(b) uses a personal vehicle to provide a prearranged ride to riders upon connection through a digital network controlled by a transportation network company in return for compensation or payment of a fee.
(5) 'Transportation network company rider' or 'rider' means an individual or individuals who use a transportation network company's digital network to connect with a transportation network driver who provides prearranged rides to the rider in the driver's personal vehicle between points chosen by the rider.
(6) 'Prearranged ride' means the provision of transportation by a transportation network company driver to a transportation network company rider, beginning when a driver accepts a ride requested by a rider through a digital network controlled by a transportation network company, continuing while the driver transports a requesting rider, and ending when the last requesting rider departs from the personal vehicle. A prearranged ride does not include transportation provided using a taxi, limousine, or other for-hire vehicle pursuant to a Class C certificate issued by the South Carolina Public Service Commission or pursuant to a license issued by the governing body of a county or city. Transportation network company service does not include services provided pursuant to Articles 1 through 15 of Chapter 23, Title 58 or arranging non-emergency medical transportation for individuals qualifying for Medicaid or Medicare pursuant to a contract with the State or a managed care organization.
Section 58-23-1920. Articles 1 to 17 of this chapter do not apply to:
(1) transportation network companies;
(2) transportation network company drivers; or
(3) transportation network company services.
Section 58-23-1930. (A) Transportation network companies and TNC drivers are not motor vehicle carriers as defined in this chapter, and shall not be considered to provide taxi, charter bus, charter limousine, or for-hire services.
(B) A TNC is not deemed to own, control, operate, or manage the personal vehicles used by TNC drivers.
(C) Transportation network companies and TNC drivers shall not be required to obtain a certificate from the South Carolina Public Service Commission or the Office of Regulatory Staff pursuant to Article 3 of this chapter.
Section 58-23-1940. (A) A person or entity shall not operate a TNC in South Carolina without first having obtained a permit from the Office of Regulatory Staff pursuant to this article; however, a person or entity operating a TNC in South Carolina as of the effective date of this article may continue to operate for a period of sixty days following the effective date of this article so as to permit the person or entity to obtain a permit from the Office of Regulatory Staff pursuant to this section.
(B) The Office of Regulatory Staff shall issue a permit to each TNC that meets the requirements for a TNC set forth in this article.
Section 58-23-1950. In order to receive a permit pursuant to this article, a TNC must maintain an agent for service of process in the State of South Carolina.
Section 58-23-1960. A TNC may determine and charge a fare for the prearranged rides provided to riders; provided that, if a fare is charged, the TNC shall disclose to riders the fare calculation method on its website or through its digital platform, network, or software application service. The TNC also shall provide riders with the applicable rates being charged and the option to receive an estimated fare before the rider enters the TNC driver's personal vehicle.
Section 58-23-1970. A TNC's website or digital platform, network, or software application service shall display a picture of the TNC driver, and the license plate number of the personal vehicle utilized for providing the prearranged ride before the rider enters the TNC driver's personal vehicle.
Section 58-23-1980. Within a reasonable period of time following the completion of a trip, a TNC shall transmit an electronic receipt to the rider that lists:
(1) the origin and destination of the trip;
(2) the total time and distance of the trip; and
(3) an itemization of the total fare paid, if any.
Section 58-23-1990. (A) Insurers that write automobile insurance in the State may exclude any and all coverage afforded under the owner's insurance policy for any loss or injury that occurs while a TNC driver is logged on a TNC's digital network or while the driver provides a prearranged ride. This right to exclude all coverage may apply to any coverage included in an automobile insurance policy including, but not limited to:
(1) liability coverage for bodily injury and property damage;
(2) uninsured and underinsured motorist coverage;
(3) medical payments coverage;
(4) comprehensive physical damage coverage; and
(5) collision physical damage coverage.
(B) The exclusions shall apply notwithstanding any requirement under Sections 56-9-10 through 56-9-630. Nothing in this section implies or requires that a personal automobile insurance policy provide coverage while the transportation network driver is logged on the TNC's digital network, while the driver is engaged in a prearranged ride or while the driver otherwise uses a personal vehicle to transport passengers for compensation. Nothing shall be deemed to preclude an automobile insurer from providing coverage for the TNC driver's personal vehicle, if he so choses to do so by contract or endorsement.
(C) Automobile insurers that exclude coverage as permitted in subsections (A) and (B) shall have no duty to defend or indemnify any claim expressly excluded thereunder. Nothing in this article shall be deemed to invalidate or limit an exclusion contained in a policy. An automobile insurer that defends or indemnifies a claim against a driver that is excluded under the terms of its policy as permitted in subsections (A) and (B), shall have a right of contribution against other insurers that provide automobile insurance to the same driver in satisfaction of the coverage requirements of Section 58-23-1910 at the time of loss.
(D) In a claims coverage investigation, transportation network companies and any automobile insurer potentially providing coverage under Section 58-23-1910 shall cooperate to facilitate the exchange of relevant information with directly involved parties and any automobile insurer of the TNC driver if applicable, including the precise times that a driver logged on and off of the TNC's digital network in the twelve-hour period immediately preceding and in the twelve-hour period immediately following the accident and disclose to one another a clear description of the coverage, exclusions, and limits provided under any automobile insurance maintained under Section 58-23-1910.
Section 58-23-2000. (A) A TNC driver or TNC on the driver's behalf shall maintain primary automobile insurance that recognizes that the driver is a TNC driver or otherwise uses a personal vehicle to transport riders for compensation and covers the driver:
(a) while the driver is logged on the TNC's digital network; or
(b) while the driver is engaged in a prearranged ride.
(B) The following automobile insurance requirements shall apply while a participating TNC driver is logged on the TNC's digital network and is available to receive transportation requests but is not engaged in a prearranged ride:
(1) primary automobile liability insurance in the amount of at least fifty thousand dollars for death and bodily injury per person, one hundred thousand dollars for death and bodily injury per incident, and twenty-five thousand dollars for property damage;
(2) uninsured motorist coverage as required by Section 38-77-150;
(3) collision physical damage coverage and comprehensive physical damage coverage if the participating TNC driver carries these coverages on his personal automobile policy, unless that insurer is providing TNC company insurance to the TNC driver;
(4) the coverage requirements of this subsection may be satisfied by automobile insurance maintained by the TNC driver or automobile insurance maintained by the TNC, or both.
(C) The following automobile insurance requirements shall apply while a TNC driver is engaged in a prearranged ride:
(1) primary automobile liability insurance that provides at least one million dollars for death, bodily injury, and property damage;
(2) uninsured motorist coverage as required by Section 38-77-150;
(3) collision physical damage coverage and comprehensive physical damage coverage if the participating TNC driver carries these coverages on his personal automobile policy, unless that insurer is providing TNC company insurance to the TNC driver;
(4) the coverage requirements of this subsection may be satisfied by automobile insurance maintained by the TNC driver or automobile insurance maintained by the TNC, or both.
(D) If insurance maintained by the TNC driver in subsections (B) or (C) has lapsed or does not provide the required coverage, insurance maintained by a TNC shall provide the coverage required by this section beginning with the first dollar of a claim and shall have the duty to defend such claim.
(E) Coverage under an automobile insurance policy maintained by the TNC shall not be dependent upon a personal automobile insurer first denying a claim nor shall a personal automobile insurer be required to first deny the claim.
(F) Insurance required by this section may be placed with an authorized insurer or with an eligible surplus lines insurer pursuant to Section 38-45-90.
(G) Insurance satisfying the requirements of this section shall be deemed to satisfy the financial responsibility requirements for a motor vehicle pursuant to Sections 56-9-10 through 56-9-630.
(H) A TNC driver shall carry proof of coverage satisfying subsections (B) and (C) at all times during use of a vehicle in connection with a TNC's digital network. In the event of an accident, a TNC driver shall provide this insurance coverage to the directly interested parties, automobile insurers, and the investigating police officers, upon request, pursuant to Section 56-10-225. Upon such request, a TNC driver shall also disclose to directly interested parties, automobile insurers, and the investigating police officers, whether he was logged on the TNC's digital network or on a prearranged ride at the time of an accident.
Section 58-23-2010. Before TNC drivers are allowed to accept a request for a prearranged ride on the TNC's digital network, the TNC shall disclose to the drivers, in writing, the following information:
(1) the insurance coverage, including the types of coverage and the limits for each coverage, that the TNC provides while the TNC driver uses a personal vehicle in connection with a TNC's digital network; and
(2) depending on its terms, that the TNC driver's personal automobile insurance policy may not provide any coverage while the driver is logged on the TNC's digital network and is available to receive a transportation request or is engaged in a prearranged ride.
Section 58-23-2020. (A) A TNC shall implement a zero tolerance policy on the use of drugs or alcohol any time a TNC driver is:
(1) providing prearranged rides; or
(2) logged into the TNC's digital platform, network, or software application service but is not providing prearranged rides.
(B) A TNC shall publish on its website and provide notice to its drivers of:
(1) the zero tolerance policy required in subsection (A); and
(2) procedures to report a complaint about a TNC driver with whom a rider was matched and whom the rider reasonably suspects was under the influence of drugs or alcohol during the course of the trip.
(C) Upon receipt of a complaint from a rider alleging that a driver may have violated the zero tolerance policy, the TNC shall immediately suspend the driver's access to the TNC's digital platform, network, or software application service, and shall conduct an investigation into the reported incident. The suspension shall last the duration of the investigation.
(D) The TNC shall maintain records relevant to the enforcement of the requirements of this section for at least two years from the date that a rider complaint is received by the TNC.
Section 58-23-2030. (A) Prior to permitting an individual to operate as a TNC driver on its digital platform, network, or software application service, the TNC shall:
(1) require the individual to submit an application to the TNC, which includes information regarding his or her address, age, driver's license, driving history, motor vehicle registration, automobile liability insurance, and other information required by the TNC;
(2) conduct, or have a third party conduct, a local and national criminal background check for each applicant that must include:
(a) a multi-state and multi-jurisdiction Criminal Records Locator or other similar commercial nationwide database with validation (primary source search); and
(b) National Sex Offender Registry database search;
(3) obtain and review a driving history research report for such individual.
(B) The TNC shall not permit an individual to act as a TNC driver on its digital platform, network, or software application service who:
(1) has had more than three moving violations in the prior three-year period, or one major violation in the prior three-year period including, but not limited to, failure to stop for a blue light, leaving the scene of an accident, reckless driving, or driving on a suspended or revoked license;
(2) has been convicted, within the past ten years, of driving under the influence of drugs or alcohol, driving with an unlawful alcohol concentration, fraud, use of a motor vehicle to commit a felony, a felony crime involving property damage, theft, and crimes defined as violent pursuant to Section 16-1-60;
(3) has been convicted of acts of terror, felony driving under the influence, criminal sexual conduct offenses, or leaving the scene of an accident with bodily injury;
(4) is a match in the National Sex Offender Registry database;
(5) does not possess a valid driver's license;
(6) does not possess proof of registration for the motor vehicle the individual proposes to use to provide TNC services;
(7) does not possess proof of automobile liability insurance for the motor vehicle the individual proposes to use to provide TNC services; or
(8) is not at least nineteen years of age.
Section 58-23-2040. A TNC driver shall exclusively accept rides booked through the TNC's digital platform, network, or software application service, and shall not solicit or accept street hails.
Section 58-23-2050. (A) The TNC shall adopt and implement a policy prohibiting solicitation or acceptance of cash payments from riders and notify TNC drivers of such policy.
(B) TNC drivers shall not solicit or accept cash payments from riders. Any payment for TNC services shall be made only electronically using the TNC's digital platform, network, or software application service.
Section 58-23-2060. (A) A TNC shall adopt and implement a policy of nondiscrimination on the basis of destination, race, color, national origin, religious belief or affiliation, sex, disability, or age with respect to riders and potential riders and notify TNC drivers of the policy.
(B) TNC drivers shall comply with all applicable laws regarding nondiscrimination against riders or potential riders on the basis of destination, race, color, national origin, religious belief or affiliation, sex, disability, or age.
(C) TNC drivers shall comply with all applicable laws relating to accommodation of service animals.
(D) A TNC shall not impose additional charges on riders for providing services to persons with physical disabilities because of those disabilities.
(E) A TNC shall provide riders an opportunity to indicate whether they require a wheelchair-accessible vehicle. If a TNC cannot arrange wheelchair-accessible TNC service in any instance, it shall direct the rider to an alternate provider of wheelchair-accessible service, if available.
Section 58-23-2070. (A) A TNC shall maintain:
(1) individual trip records for at least one year from the date each trip was provided; and
(2) TNC driver records at least until the one-year anniversary of the date on which a TNC driver's activation on the TNC digital platform or network has ended.
(B) Records maintained by a TNC pursuant to this section shall be considered confidential and proprietary. Such records shall further be considered a trade secret as defined by Section 39-8-20(5) and shall be afforded the protections of Section 39-8-60 of the South Carolina Trade Secrets Act.
(C) Any records maintained by a TNC pursuant to this section that are obtained by a public body as defined by Section 30-4-20(a) or other governmental entity, or any records that incorporate information from records maintained pursuant to this section, shall not be subject to disclosure under the Freedom of Information Act as provided for in Chapter 4, Title 30 or any other law.
Section 58-23-2080. (A) A TNC shall not disclose a rider's personally identifiable information to a third party unless:
(1) the rider consents;
(2) disclosure is required by a legal obligation; or
(3) disclosure is required to protect or defend the terms of use of the service or to investigate violations of those terms.
(B) A TNC shall be permitted to share a rider's name and telephone number with the TNC driver providing a prearranged ride to the rider in order to facilitate the correct identification of the rider by the TNC driver, or to facilitate communication between the rider and the TNC driver.
Section 58-23-2090. Notwithstanding any other provision of law, transportation network companies and TNC drivers are governed exclusively by this article and any regulations promulgated by the Office of Regulatory Staff consistent with this article. Political subdivisions are prohibited from enacting laws, ordinances, or regulations related to services provided by TNCs."
SECTION 2. This act takes effect upon approval by the Governor. /
Renumber sections to conform.
Amend title to conform.
The amendment was tabled.
Senator BENNETT proposed the following amendment (3525R008.LS.SB), which was adopted:
Amend the bill, as and if amended, by striking all after the enacting words and inserting:
/ SECTION 1. Chapter 23, Title 58 of the 1976 Code is amended by adding:
"Article 19
South Carolina Transportation Network Companies
Section 58-23-1900. This article may be cited as the 'South Carolina Transportation Network Companies Act'.
Section 58-23-1910. For the purposes of this article:
(1) 'Personal vehicle' means a vehicle that is used by a transportation network company driver in connection with providing a prearranged ride and is:
(a) owned, leased, or otherwise authorized for use by the transportation network company driver; and
(b) not a taxi, charter bus, charter limousine, or for-hire vehicle.
(2) 'Digital network' means any online-enabled application, software, website, or system offered or utilized by a TNC that enables the prearrangement of rides with transportation network company drivers.
(3) 'Transportation network company' or 'TNC' means a corporation, partnership, sole proprietorship, or other entity operating in the State that uses a digital network to connect transportation network company riders to transportation network company drivers who provide prearranged rides.
(4) 'Transportation network company driver' or 'driver' means an individual who:
(a) receives connections to potential passengers and related services from a transportation network company in exchange for payment of a fee to the transportation network company; and
(b) uses a personal vehicle to provide a prearranged ride to riders upon connection through a digital network controlled by a transportation network company in return for compensation or payment of a fee.
(5) 'Transportation network company rider' or 'rider' means an individual or individuals who use a transportation network company's digital network to connect with a transportation network driver who provides prearranged rides to the rider in the driver's personal vehicle between points chosen by the rider.
(6) 'Prearranged ride' means the provision of transportation by a transportation network company driver to a transportation network company rider, beginning when a driver accepts a ride requested by a rider through a digital network controlled by a transportation network company, continuing while the driver transports a requesting rider, and ending when the last requesting rider departs from the personal vehicle. A prearranged ride, for the purposes of this article, does not include shared expense carpool or vanpool arrangements, or transportation provided using a taxi, limousine, or other for-hire vehicle pursuant to a Class C certificate issued by the South Carolina Public Service Commission or pursuant to a license issued by the governing body of a county or city. Transportation network company service does not include services provided pursuant to Articles 1 through 15 of Chapter 23, Title 58 or arranging non-emergency medical transportation for individuals qualifying for Medicaid or Medicare pursuant to a contract with the State or a managed care organization.
Section 58-23-1920. Articles 1 to 17 of this chapter do not apply to:
(1) TNCs;
(2) TNC drivers; or
(3) TNC services.
Section 58-23-1930. (A) TNCs and TNC drivers are not motor vehicle carriers as defined in this chapter, and shall not be considered to provide taxi, charter bus, charter limousine, or for-hire services.
(B) TNCs and TNC drivers shall not be required to obtain a certificate from the South Carolina Public Service Commission or the Office of Regulatory Staff pursuant to Article 3 of this chapter.
Section 58-23-1940. (A) A person or entity shall not operate a TNC in South Carolina without first having obtained a permit from the Office of Regulatory Staff pursuant to this article; however, a person or entity operating a TNC in South Carolina as of the effective date of this article may continue to operate for a period of sixty days following the effective date of this article so as to permit the person or entity to obtain a permit from the Office of Regulatory Staff pursuant to this section.
(B) The Office of Regulatory Staff shall issue a permit to each TNC that meets the requirements for a TNC set forth in this article.
Section 58-23-1950. In order to receive a permit pursuant to this article, a TNC must maintain an agent for service of process in the State of South Carolina.
Section 58-23-1960. A TNC may determine and charge a fare for the prearranged rides provided to riders; provided that, if a fare is charged, the TNC shall disclose to riders the fare calculation method on its website or through its digital platform, network, or software application service. The TNC also shall provide riders with the applicable rates being charged and the option to receive an estimated fare before the rider enters the TNC driver's personal vehicle.
Section 58-23-1970. A TNC's website or digital platform, network, or software application service shall display a picture of the TNC driver, and the license plate number of the personal vehicle utilized for providing the prearranged ride before the rider enters the TNC driver's personal vehicle.
Section 58-23-1980. Within a reasonable period of time following the completion of a trip, a TNC shall transmit an electronic receipt to the rider that lists:
(1) the origin and destination of the trip;
(2) the total time and distance of the trip; and
(3) an itemization of the total fare paid, if any.
Section 58-23-1990. (A) Insurers that write automobile insurance in the State may exclude any and all coverage afforded under the owner's insurance policy for any loss or injury that occurs while a TNC driver is logged on a TNC's digital network or while the driver provides a prearranged ride. This right to exclude all coverage may apply to any coverage included in an automobile insurance policy including, but not limited to:
(1) liability coverage for bodily injury and property damage;
(2) uninsured and underinsured motorist coverage;
(3) medical payments coverage;
(4) comprehensive physical damage coverage; and
(5) collision physical damage coverage.
(B) The exclusions shall apply notwithstanding any requirement under Sections 56-9-10 through 56-9-630. Nothing in this section implies or requires that a personal automobile insurance policy provide coverage while the transportation network driver is logged on the TNC's digital network, while the driver is engaged in a prearranged ride or while the driver otherwise uses a personal vehicle to transport passengers for compensation. Nothing shall be deemed to preclude an automobile insurer from providing coverage for the TNC driver's personal vehicle, if it so chose to do so by contract or endorsement.
(C) Automobile insurers that exclude coverage as permitted in subsections (A) and (B) shall have no duty to defend or indemnify any claim expressly excluded thereunder. Nothing in this article shall be deemed to invalidate or limit an exclusion contained in a policy. An automobile insurer that defends or indemnifies a claim against a driver that is excluded under the terms of its policy as permitted in subsections (A) and (B), shall have a right of contribution against other insurers that provide automobile insurance to the same driver in satisfaction of the coverage requirements of Section 58-23-2000 at the time of loss.
(D) In a claims coverage investigation, transportation network companies and any automobile insurer potentially providing coverage under Section 58-23-2000 shall cooperate to facilitate the exchange of relevant information with directly involved parties and any automobile insurer of the TNC driver if applicable, including the precise times that a driver logged on and off of the TNC's digital network in the twelve-hour period immediately preceding and in the twelve-hour period immediately following the accident and disclose to one another a clear description of the coverage, exclusions, and limits provided under any automobile insurance maintained under Section 58-23-2000.
Section 58-23-2000. (A) A TNC driver or TNC on the driver's behalf shall maintain primary automobile insurance that recognizes that the driver is a TNC driver or otherwise uses a personal vehicle to transport riders for compensation and covers the driver:
(1) while the driver is logged on the TNC's digital network; or
(2) while the driver is engaged in a prearranged ride.
(B) The following automobile insurance requirements shall apply while a participating TNC driver is logged on the TNC's digital network and is available to receive transportation requests but is not engaged in a prearranged ride:
(1) primary automobile liability insurance in the amount of at least fifty thousand dollars for death and bodily injury per person, one hundred thousand dollars for death and bodily injury per incident, and twenty-five thousand dollars for property damage;
(2) uninsured motorist coverage as required by Section 38-77-150;
(3) the coverage requirements of this subsection may be satisfied by automobile insurance maintained by the TNC driver or automobile insurance maintained by the TNC, or both.
(C) The following automobile insurance requirements shall apply while a TNC driver is engaged in a prearranged ride:
(1) primary automobile liability insurance that provides at least one million dollars for death, bodily injury, and property damage;
(2) uninsured motorist coverage as required by Section 38-77-150;
(3) the coverage requirements of this subsection may be satisfied by automobile insurance maintained by the TNC driver or automobile insurance maintained by the TNC, or both;
(D) If insurance maintained by the TNC driver in subsections (B) or (C) has lapsed or does not provide the required coverage, insurance maintained by a TNC shall provide the coverage required by this section beginning with the first dollar of a claim and shall have the duty to defend such claim.
(E) Coverage under an automobile insurance policy maintained by the TNC shall not be dependent upon a personal automobile insurer first denying a claim nor shall a personal automobile insurer be required to first deny the claim.
(F) Insurance required by this section may be placed with an authorized insurer or with an eligible surplus lines insurer pursuant to Section 38-45-90.
(G) Insurance satisfying the requirements of this section shall be deemed to satisfy the financial responsibility requirements for a motor vehicle pursuant to Sections 56-9-10 through 56-9-630.
(H) A TNC driver shall carry proof of coverage satisfying subsections (B) and (C) at all times during use of a vehicle in connection with a TNC's digital network. In the event of an accident, a TNC driver shall provide this insurance coverage to the directly interested parties, automobile insurers, and the investigating police officers, upon request, pursuant to Section 56-10-225. Upon such request, a TNC driver shall also disclose to directly interested parties, automobile insurers, and the investigating police officers, whether he was logged on the TNC's digital network or on a prearranged ride at the time of an accident.
(I) If a TNC's insurer makes a claim covered under comprehensive coverage or collision coverage, the TNC shall cause its insurer to issue the payment directly to the business repairing the vehicle or jointly to the owner of the vehicle and the primary lienholder on the covered vehicle. The Office of Regulatory Staff shall not assess any fines as a result of a violation of this subsection.
Section 58-23-2010. Before TNC drivers are allowed to accept a request for a prearranged ride on the TNC's digital network, the TNC shall disclose to the drivers, in writing, the following information:
(1) the insurance coverage, including the types of coverage and the limits for each coverage, that the TNC provides while the TNC driver uses a personal vehicle in connection with a TNC's digital network;
(2) depending on its terms, that the TNC driver's personal automobile insurance policy may not provide any coverage while the driver is logged onto the TNC's digital network and is available to receive a transportation request or is engaged in a prearranged ride; and
(3) if the vehicle to be used to provide TNC services has a lien against it, the driver must notify the lienholder that the driver will be using the vehicle for transportation services that may violate the terms of the contract with the lienholder.
Section 58-23-2020. (A) A TNC shall implement a zero tolerance policy on the use of drugs or alcohol any time a TNC driver is:
(1) providing prearranged rides; or
(2) logged into the TNC's digital platform, network, or software application service but is not providing prearranged rides.
(B) A TNC shall publish on its website and provide notice to its drivers of:
(1) the zero tolerance policy required in subsection (A); and
(2) procedures to report a complaint about a TNC driver with whom a rider was matched and whom the rider reasonably suspects was under the influence of drugs or alcohol during the course of the trip.
(C) Upon receipt of a complaint from a rider alleging that a driver may have violated the zero tolerance policy, the TNC shall immediately suspend the driver's access to the TNC's digital platform, network, or software application service, and shall conduct an investigation into the reported incident. The suspension shall last the duration of the investigation.
(D) The TNC shall maintain records relevant to the enforcement of the requirements of this section for at least two years from the date that a rider complaint is received by the TNC.
Section 58-23-2030. (A) Prior to permitting an individual to operate as a TNC driver on its digital platform, network, or software application service, the TNC shall:
(1) require the individual to submit an application to the TNC, which includes information regarding his or her address, age, driver's license, driving history, motor vehicle registration, automobile liability insurance, and other information required by the TNC;
(2) conduct, or have a third party conduct, a local and national criminal background check for each applicant that must include:
(a) a multi-state and multi-jurisdiction Criminal Records Locator or other similar commercial nationwide database with validation (primary source search); and
(b) National Sex Offender Registry database search;
(3) obtain and review a driving history research report for such individual.
(B) The TNC shall not permit an individual to act as a TNC driver on its digital platform, network, or software application service who:
(1) has had more than three moving violations in the prior three-year period, or one major violation in the prior three-year period including, but not limited to, failure to stop for a blue light, leaving the scene of an accident, reckless driving, or driving on a suspended or revoked license;
(2) has been convicted, within the past ten years, of driving under the influence of drugs or alcohol, driving with an unlawful alcohol concentration, fraud, use of a motor vehicle to commit a felony, a felony crime involving property damage, theft, and crimes defined as violent pursuant to Section 16-1-60;
(3) has been convicted of acts of terror, felony driving under the influence, criminal sexual conduct offenses, or leaving the scene of an accident with bodily injury;
(4) is a match in the National Sex Offender Registry database;
(5) does not possess a valid driver's license;
(6) does not possess proof of registration for the motor vehicle the individual proposes to use to provide TNC services;
(7) does not possess proof of automobile liability insurance for the motor vehicle the individual proposes to use to provide TNC services; or
(8) is not at least nineteen years of age.
Section 58-23-2040. A TNC driver shall exclusively accept rides booked through the TNC's digital platform, network, or software application service, and shall not solicit or accept street hails.
Section 58-23-2050. (A) The TNC shall adopt and implement a policy prohibiting solicitation or acceptance of cash payments from riders and notify TNC drivers of such policy.
(B) TNC drivers shall not solicit or accept cash payments from riders. Any payment for TNC services shall be made only electronically using the TNC's digital platform, network, or software application service.
Section 58-23-2060. (A) A TNC shall adopt and implement a policy of nondiscrimination on the basis of destination, race, color, national origin, religious belief or affiliation, sex, disability, or age with respect to riders and potential riders and notify TNC drivers of the policy.
(B) TNC drivers shall comply with all applicable laws regarding nondiscrimination against riders or potential riders on the basis of destination, race, color, national origin, religious belief or affiliation, sex, disability, or age.
(C) TNC drivers shall comply with all applicable laws relating to accommodation of service animals.
(D) A TNC shall not impose additional charges on riders for providing services to persons with physical disabilities because of those disabilities.
(E) A TNC shall provide riders an opportunity to indicate whether they require a wheelchair-accessible vehicle. If a TNC cannot arrange wheelchair-accessible TNC service in any instance, it shall direct the rider to an alternate provider of wheelchair-accessible service, if available.
Section 58-23-2070. (A) A TNC shall maintain:
(1) individual trip records for at least three years from the date each trip was provided; and
(2) TNC driver records at least until the one-year anniversary of the date on which a TNC driver's activation on the TNC digital platform or network has ended.
(B) Each TNC operating in this state shall maintain a list of all TNC drivers who are authorized to accept trip requests on the TNC's digital platform. Upon written request, a TNC shall make this list available for inspection by law enforcement officers and representatives of the Office of Regulatory Staff at the TNC's place of business or a mutually agreed upon location.
(C) Any records maintained by a TNC pursuant to this section that are obtained by a public body as defined by Section 30-4-20(a) or other governmental entity, or any records that incorporate information from records maintained pursuant to this section, shall not be subject to disclosure under the Freedom of Information Act as provided for in Chapter 4, Title 30 or any other law.
Section 58-23-2080. (A) A TNC shall not disclose a rider's personally identifiable information to a third party unless:
(1) the rider consents;
(2) disclosure is required by a legal obligation; or
(3) disclosure is required to protect or defend the terms of use of the service or to investigate violations of those terms.
(B) A TNC shall be permitted to share a rider's name and telephone number with the TNC driver providing a prearranged ride to the rider in order to facilitate the correct identification of the rider by the TNC driver, or to facilitate communication between the rider and the TNC driver.
Section 58-23-2090. Notwithstanding any other provision of law, transportation network companies and TNC drivers are governed exclusively by this article and any regulations promulgated by the Office of Regulatory Staff consistent with this article. Political subdivisions are prohibited from enacting laws, ordinances, or regulations related to services provided by TNCs.
Section 58-23-2100. (A) For the purposes of this section:
(1) 'Gross trip fare' means the sum of the base fare charge, distance charge, and time charge for the complete trip at rates published on the TNC's website.
(2) 'Local assessment fee' means one percent of the gross trip fare.
(3) 'Municipality' means a city or town issued a certificate of incorporation, or township created by act of the General Assembly.
(B) A TNC shall collect a local assessment fee on behalf of a TNC driver who accepts a request for a prearranged ride made through the TNC's digital network for all prearranged rides that originate in the state.
(C) Using the Geographic Information System (GIS) data made available by the Revenue and Fiscal Affairs Office pursuant to subsection (I), a TNC shall determine whether each prearranged trip occurred within the incorporated boundaries of a municipality, or outside of the incorporated boundaries of a municipality and within the boundaries of a county of this state.
(D) No later than thirty days after the end of a calendar quarter, a TNC shall submit to the Office of Regulatory Staff:
(1) the total local assessment fees collected by a TNC on behalf of the TNC drivers; and
(2) for trips that originated in a municipality, a report listing the number of trips and percentage of the gross trip fare that originated in each municipality during the reporting period; and
(3) for trips that originated outside a municipality, a report listing the number of trips and percentage of the gross trip fare that originated outside a municipality during the reporting period.
(E) The funds collected pursuant to this subsection are not general fund revenue of the State and must be kept by the State Treasurer in a distinct and separate fund and apart from the general fund. These funds are to be administered by the Office of Regulatory Staff pursuant to this section and expended only for the purposes provided in this chapter.
(F)(1) The Office of Regulatory Staff shall retain an amount of one percent of the local assessment fee collected under subsection (D)(1) to cover the expenses borne by the Office of Regulatory Staff derived from:
(a) regulation of TNCs; and
(b) collection, remittance, and distribution of local assessment fees pursuant to this section.
(2) Within sixty days of the end of the calendar quarter, the Office of Regulatory Staff shall distribute the remaining portion of the total local assessment fees collected under subsection (D)(1), minus the amount retained pursuant to subsection (F)(1), to each municipality where a trip originated during the reporting period and, for trips that originated outside a municipality, to each county where a trip originated during the reporting period. The distribution to each municipality or county shall be proportionate to the number of trips and percentage of the gross trip fare that originated in each municipality or county.
(G)(1) To ensure that the TNC has remitted the correct local assessment fee and has accurately reported the percentages attributable to municipalities and counties pursuant to subsection (D), upon request of the municipality, the Office of Regulatory Staff may inspect the necessary records at a TNC's place of business or a mutually agreed upon location. This inspection may not be conducted more than once a year.
(2) At least forty-five days before the Office of Regulatory Staff conducts an inspection of records pursuant to subsection (G)(1), the Office of Regulatory Staff shall notify the Municipal Association of South Carolina (MASC) of its intent to conduct an inspection and the date of the planned inspection.
(3) The MASC may request that a TNC that is subject to inspection under subsection (G)(1) engage an independent third party auditor to verify that the local assessment to municipalities has been properly accounted for and distributed. At least thirty days before the scheduled audit, the MASC must submit this request in writing to the Office of Regulatory Staff and the TNC subject to the audit.
(a) The TNC that is subject to the audit shall engage the independent third party auditor, which shall be selected at the sole discretion of the TNC, and bear all costs associated with the third party audit. The independent third party auditor must be:
(i) a certified public accounting firm licensed in the State; and
(ii) qualified to perform engagements in accordance with Generally Accepted Government Auditing Standards (GAGAS).
(b) The TNC shall provide the MASC with a copy of the third party audit report within fifteen days of completion, which shall in no event, occur later than ninety days after receipt of the MASC's written request. The audit report shall disclose the amount of any underpayments or overpayments to municipalities and counties.
(c) A person employed by or formerly employed by the MASC who discloses to a third party any information that the TNC marked in the audit report as confidential shall be guilty of a violation of Section 39-8-90 and be subject to penalties unless the individual obtained the TNC's written consent prior to disclosure. Nothing in this section shall be construed to restrict the MASC from disclosing any overpayment or underpayment with the impacted municipalities or counties.
(4) In the event that a TNC submits a report to the MASC that is subsequently determined to be inaccurate, thereby leading to an underpayment or overpayment of a municipality or county's local assessment fee, the Office of Regulatory Staff shall correct the underpayment and overpayment by offsetting the amount of the underpayment or overpayment in subsequent local assessment fee distributions. In the event a TNC remits an assessment fee to the Office of Regulatory Staff that is determined to constitute an underpayment of the total assessment fee required by this article, the transportation network company shall, within thirty days of receiving notification of the determination, remit the balance owed to the Office of Regulatory Staff. A TNC that submits a report containing an inaccuracy or remits an assessment fee that constitutes an underpayment that is determined by the Office of Regulatory Staff to be the result of an intentional misrepresentation shall be assessed damages that are no less than three times the amount of the underpayment or resultant underpayment to the municipality or county impacted.
(H) Any records maintained by a TNC pursuant to this section that are obtained by the Office of Regulatory Staff, a public body as defined by Section 30-4-20(a), or any records that incorporate information from records maintained pursuant to this section, shall not be subject to disclosure under the Freedom of Information Act as provided for in Chapter 4, Title 30, or any other provision of law.
(I) The Office of Regulatory Staff may not disclose records or information provided by a TNC unless disclosure is required by a subpoena or court order. If a disclosure is required, the Office of Regulatory Staff shall promptly notify the TNC prior to the disclosure. Nothing in this section shall be construed to restrict the Office of Regulatory Staff from disclosing any overpayment or underpayment with the impacted municipalities or counties.
(J) To ensure proper distribution of the local assessment fee pursuant to subsection (D)(2), the Revenue and Fiscal Affairs Office shall prepare and make available for public use a GIS file showing the state's county and municipal boundaries. This file shall be updated on a quarterly basis, and published on the Revenue and Fiscal Affairs Office's website. In addition to the requirements of Section 5-3-90, municipalities shall provide annexation information to the Revenue and Fiscal Affairs Office within thirty days after the annexation is complete. Such information shall include a written description of the boundary, along with a map or plat which clearly defines the new territory added.
(K) This section shall become effective ninety days after the effective date of this Act.
Section 58-23-2110. (A) Except as otherwise provided in this chapter, TNCs and TNC drivers are governed exclusively by this article and by any regulations promulgated by the Office of Regulatory Staff consistent with this article. TNC drivers remain subject to all local ordinances outside the scope of this article, whether directly or indirectly impacting the delivery of TNC driver services, including but not limited to parking and traffic regulations that are not inconsistent with the provisions of this article.
(B) Political subdivisions are prohibited from imposing a tax on TNCs, TNC drivers, or a vehicle used by a TNC driver, including a business license tax, where such tax is assessed in connection with prearranged rides in the state. Nothing in this article may be construed to restrict a municipality from collecting a business license tax from a TNC located within its boundaries if the tax is limited to receipts or revenue that is not subject to a local assessment fee pursuant to Section 58-23-2100 or a business license tax.
(C) In order for TNCs and TNC drivers to provide prearranged rides on airport property, the TNC must comply with Federal Aviation Administration regulations and airport regulations relating to:
(1) payment of reasonable fee to operate at the airport, provided that the fee is not assessed on a per-driver or per-vehicle basis; and
(2) designating locations for staging, pick-ups, drop-offs, and other similar locations.
Section 58-23-2120. The provisions contained in this Article shall not preempt any federal regulation relating to the provision of transportation services at any facility regulated by the United States Federal Aviation Administration."
SECTION 2. Section 58-4-60(B) of the 1976 Code is amended to read:
"Section 58-4-60. (B)(1) The expenses of the Transportation Department of the Office of Regulatory Staff, with the exception of the expenses incurred in its railway jurisdiction, must be borne by the revenues from license fees derived pursuant to Sections 58-23-530 through 58-23-630, assessments to Transportation Network Companies pursuant to Sections 58-23-1940 and 58-23-2100, and assessments to the carriers of household goods and hazardous waste for disposal carriers. The expenses of the railway section of the Office of Regulatory Staff must be borne by the railroad companies subject to the commission's jurisdiction according to their gross income from operations in this State.
(2) All other expenses of the Office of Regulatory Staff must be borne by the public utilities subject to the jurisdiction of the commission. On or before the first day of July in each year, the Department of Revenue must assess each public utility, railway company, household goods carrier, and hazardous waste for disposal carrier its proportion of the expenses in proportion to its gross income from operation in this State in the year ending on the thirtieth day of June preceding that on which the assessment is made which is due and payable on or before July fifteenth. The assessments must be charged against the companies by the Department of Revenue and collected by the department in the manner provided by law for the collection of taxes from the companies including the enforcement and collection provisions of Article 1, Chapter 54 of Title 12 and paid, less the Department of Revenue actual incremental increase in the cost of administration into the state treasury as other taxes collected by the Department of Revenue for the State. Transportation Network Companies' assessments shall be assessed by and remitted to the Office of Regulatory Staff."
SECTION 3. This act takes effect upon approval by the Governor. /
Renumber sections to conform.
Amend title to conform.
The amendment was adopted.
The question then was the third reading of the Bill, as amended.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 42; Nays 0
AYES
Alexander Bennett Bright
Bryant Campbell Campsen
Cleary Coleman Corbin
Courson Davis Gregory
Grooms Hayes Hembree
Hutto Jackson Johnson
Kimpson Leatherman Lourie
Malloy Martin, Larry Martin, Shane
Massey Matthews McElveen
Nicholson O'Dell Peeler
Rankin Reese Sabb
Scott Setzler Shealy
Sheheen Thurmond Turner
Verdin Williams Young
Total--42
NAYS
Total--0
Recorded Vote
Senator ALLEN desired to be recorded as voting in favor of the third reading of the Bill.
There being no further amendments, the Bill was read third time, passed and ordered returned to the House of Representatives with amendments.
READ THE THIRD TIME
SENT TO THE HOUSE
The following Bill was read the third time and ordered sent to the House of Representatives:
S. 505 (Word version) -- Senators L. Martin, Hembree and Shealy: A BILL TO AMEND SECTION 24-21-440, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO PERIODS OF PROBATION, SO AS TO TOLL THE PERIOD DURING PERIODS OF CIVIL COMMITMENT; TO AMEND SECTION 24-21-560, AS AMENDED, RELATING TO COMMUNITY SUPERVISION PROGRAMS, SO AS TO TOLL THE COMMUNITY SUPERVISION PERIOD DURING PERIODS OF CIVIL COMMITMENT; AND TO AMEND SECTION 24-21-670, RELATING TO PERIODS OF PAROLE, SO AS TO TOLL THE PAROLE PERIOD DURING PERIODS OF CIVIL COMMITMENT.
RECESS
At 12:13 P.M., on motion of Senator LEATHERMAN, the Senate receded from business until 1:30 P.M.
At 1:53 P.M., the Senate resumed.
On motion of Senator HAYES, with unanimous consent, Senators PEELER, LEATHERMAN and SETZLER were granted leave to attend a subcommittee meeting and were granted leave to vote from the balcony.
The following Bill, having been read the second time, was ordered placed on the Third Reading Calendar:
H. 4260 (Word version) -- Reps. Hodges, R.L. Brown, Knight and Bamberg: A BILL TO AMEND SECTION 7-7-200, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN COLLETON COUNTY, SO AS TO DESIGNATE A MAP NUMBER ON WHICH THE NAMES OF THESE PRECINCTS MAY BE FOUND AND MAINTAINED BY THE REVENUE AND FISCAL AFFAIRS OFFICE, AND TO MAKE TECHNICAL CORRECTIONS.
H. 4260--Ordered to a Third Reading
On motion of Senator HUTTO, with unanimous consent, H. 4260 was ordered to receive a third reading on Thursday, June 4, 2015.
READ THE SECOND TIME
H. 4056 (Word version) -- Reps. Funderburk, Norrell, King, Knight, Brannon, Cobb-Hunter, Daning, Henderson, Herbkersman, Hicks, Kennedy, Newton, Simrill, Thayer, Weeks, Hodges, Pope and Ballentine: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 57-5-1655 SO AS TO PROVIDE THAT A DEPARTMENT OF TRANSPORTATION CONTRACTOR OR CONTRACTING FIRM SHALL NOT BE QUALIFIED TO PARTICIPATE IN DEPARTMENT CONTRACTS AS A PRIME CONTRACTOR OR SUBCONTRACTOR UNDER CERTAIN CIRCUMSTANCES.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator GREGORY asked unanimous consent to make a motion to proceed to a consideration of the Bill.
The Bill was read the second time, passed and ordered to a third reading.
Motion Under Rule 26B Waived
Senator GREGORY asked unanimous consent to make a motion to waive the provisions of Rule 26B in order to allow amendments to be considered on third reading.
There was no objection.
READ THE SECOND TIME
H. 3430 (Word version) -- Reps. Simrill, G.M. Smith, Felder, Pope, Weeks, Taylor, Hixon, Corley, Norrell, Ridgeway, Henderson, G.A. Brown, Long, Lucas, Pitts, Atwater, Gagnon, Gambrell, Wells and Hicks: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING CHAPTER 77 TO TITLE 39 SO AS TO PROVIDE THAT IT IS UNLAWFUL TO SELL OR INSTALL AN UNMOUNTED, UNSAFE USED TIRE ONTO A PASSENGER CAR OR LIGHT TRUCK, TO DEFINE "UNSAFE" FOR THE PURPOSES OF THE CHAPTER, TO REQUIRE THE DEPARTMENT OF HEALTH AND ENVIRONMENTAL CONTROL TO CONDUCT INSPECTIONS, TO PROVIDE A CIVIL FINE FOR EACH VIOLATION, TO PROVIDE THAT THIS CHAPTER DOES NOT LIMIT A BUSINESS OR INDIVIDUAL'S LIABILITY UNDER THE STATE'S PRODUCTS LIABILITY LAWS, AND TO EXEMPT A BUSINESS OR PERSON WHO IS SELLING TIRES FOR RETREADING.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator ALEXANDER asked unanimous consent to return to the Bill for consideration.
Senator ALEXANDER explained the Bill.
The Bill was read the second time, passed and ordered to a third reading.
Motion Under Rule 26B Waived
Senator ALEXANDER asked unanimous consent to make a motion to waive the provisions of Rule 26B in order to allow amendments to be considered on third reading.
There was no objection.
POINT OF ORDER WITHDRAWN
READ THE SECOND TIME
H. 3852 (Word version) -- Reps. Tallon, Bannister, Loftis, Burns, Brannon, Allison, Ballentine, Bamberg, Bedingfield, Bingham, Clary, Clemmons, Cole, Collins, Delleney, Duckworth, Finlay, Forrester, Gagnon, Gambrell, Goldfinch, Hamilton, Hardee, Hardwick, Henderson, Hicks, Hiott, Horne, Huggins, Kennedy, Kirby, Long, McCoy, Merrill, D.C. Moss, V.S. Moss, Newton, Norman, Norrell, Pope, Quinn, Rutherford, Ryhal, Simrill, G.M. Smith, G.R. Smith, Sottile, Spires, Stavrinakis, Stringer, Taylor, Thayer, Willis, Yow, Bradley and Anthony: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 27-18-75 SO AS TO PROVIDE FOR ESCHEATMENT TO THE STATE OF UNCLAIMED UNITED STATES SAVINGS BONDS, TO PROVIDE FOR JUDICIAL DETERMINATION OF ESCHEATMENT, TO PROVIDE FOR PROCEDURES FOR CHALLENGING ESCHEATMENT, TO PROVIDE FOR DEPOSIT OF THE PROCEEDS OF ESCHEATMENT; AND BY ADDING SECTION 27-18-76 SO AS TO PROVIDE THAT A PERSON CLAIMING AN INTEREST IN A UNITED STATES SAVINGS BOND MAY FILE A CLAIM WITH THE ADMINISTRATOR ADMINISTERING THE UNIFORM UNCLAIMED PROPERTY ACT AND TO PROVIDE FOR LIMITATIONS ON SUCH CLAIMS.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator MASSEY explained the Bill.
Point of Order
Senator BRYANT 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.
Senator LARRY MARTIN asked unanimous consent to return to the Bill for consideration.
On motion of Senator LARRY MARTIN, with unanimous consent, the Point of Order was withdrawn.
Senator LARRY MARTIN explained the Bill.
The Bill was read the second time, passed and ordered to the third reading.
Motion Under Rule 26B Waived
Senator LARRY MARTIN asked unanimous consent to make a motion to waive the provisions of Rule 26B in order to allow amendments to be considered on third reading.
There was no objection.
READ THE SECOND TIME
H. 4225 (Word version) -- Rep. Bedingfield: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE DEPARTMENT OF NATURAL RESOURCES, RELATING TO TERM AND CONDITIONS FOR THE PUBLIC'S USE OF STATE LAKES AND PONDS OWNED OR LEASED BY THE DEPARTMENT OF NATURAL RESOURCES, DESIGNATED AS REGULATION DOCUMENT NUMBER 4547, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
The Senate proceeded to a consideration of the Joint Resolution, the question being the second reading of the Joint Resolution.
Senator CAMPSEN explained the Joint Resolution.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 40; Nays 0
AYES
Alexander Allen Bennett
Bright Bryant Campbell
Campsen Coleman Corbin
Courson Cromer Davis
Fair Gregory Grooms
Hayes Hembree Hutto
Johnson Kimpson Lourie
Malloy Martin, Larry Martin, Shane
Massey Matthews McElveen
Nicholson O'Dell Pinckney
Rankin Reese Sabb
Scott Shealy Sheheen
Thurmond Turner Williams
Young
Total--40
NAYS
Total--0
The Joint Resolution was read the second time, passed and ordered to a third reading.
READ THE SECOND TIME
H. 4231 (Word version) -- Rep. Bedingfield: A JOINT RESOLUTION TO APPROVE REGULATIONS OF THE DEPARTMENT OF NATURAL RESOURCES, RELATING TO REGULATIONS FOR SPECIES OR SUBSPECIES OF NON-GAME WILDLIFE, DESIGNATED AS REGULATION DOCUMENT NUMBER 4560, PURSUANT TO THE PROVISIONS OF ARTICLE 1, CHAPTER 23, TITLE 1 OF THE 1976 CODE.
The Senate proceeded to a consideration of the Joint Resolution, the question being the second reading of the Joint Resolution.
Senator CAMPSEN explained the Joint Resolution.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 40; Nays 0
AYES
Alexander Allen Bennett
Bright Bryant Campbell
Campsen Cleary Coleman
Corbin Courson Cromer
Davis Fair Gregory
Grooms Hayes Hembree
Hutto Jackson Johnson
Kimpson Leatherman Lourie
Malloy Martin, Larry Martin, Shane
Massey McElveen Nicholson
Peeler Rankin Reese
Setzler Shealy Thurmond
Turner Verdin Williams
Young
Total--40
NAYS
Total--0
The Joint Resolution was read the second time, passed and ordered to a third reading.
READ THE SECOND TIME
H. 4005 (Word version) -- Reps. Southard, Merrill, Daning, Jefferson and Rivers: A BILL TO AMEND SECTION 7-7-120, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF VOTING PRECINCTS IN BERKELEY COUNTY, SO AS TO REDESIGNATE THE PRECINCTS AND THE MAP NUMBER ON WHICH THE NAMES OF THESE PRECINCTS MAY BE FOUND AND MAINTAINED BY THE REVENUE AND FISCAL AFFAIRS OFFICE.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator CAMPSEN explained the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 37; Nays 0
AYES
Alexander Allen Bright
Bryant Campbell Campsen
Cleary Corbin Courson
Cromer Davis Fair
Gregory Grooms Hayes
Hembree Hutto Johnson
Kimpson Malloy Martin, Larry
Martin, Shane Massey Matthews
McElveen Nicholson O'Dell
Pinckney Rankin Reese
Sabb Scott Shealy
Thurmond Turner Williams
Young
Total--37
NAYS
Total--0
The Bill was read the second time, passed and ordered to a third reading.
READ THE SECOND TIME
H. 4142 (Word version) -- Rep. Ballentine: A BILL TO AMEND SECTION 7-7-465, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DESIGNATION OF PRECINCTS IN RICHLAND 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.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator MASSEY explained the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 37; Nays 0
AYES
Alexander Allen Bright
Bryant Campbell Campsen
Cleary Corbin Courson
Cromer Davis Fair
Gregory Grooms Hayes
Hembree Hutto Johnson
Kimpson Malloy Martin, Larry
Martin, Shane Massey Matthews
McElveen Nicholson O'Dell
Pinckney Rankin Reese
Sabb Scott Shealy
Thurmond Turner Williams
Young
Total--37
NAYS
Total--0
The Bill was read the second time, passed and ordered to a third reading.
READ THE SECOND TIME
H. 4084 (Word version) -- Rep. Stringer: A BILL TO AMEND SECTION 59-40-50, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO EXEMPTIONS OF CHARTER SCHOOLS FROM CERTAIN PROVISIONS APPLICABLE TO PUBLIC SCHOOLS, THE POWERS AND DUTIES OF A CHARTER SCHOOL, AND ADMISSIONS TO CHARTER SCHOOLS, SO AS TO AUTHORIZE A SCHOOL LEADER TO BE HIRED TO ASSIST WITH THE DAILY OPERATION OF THE SCHOOL, TO PROVIDE THAT EMPLOYEES, BOARD MEMBERS, AND STAFF OF THE CHARTER SCHOOL ARE SUBJECT TO THE ETHICS AND GOVERNMENT ACCOUNTABILITY REQUIREMENTS APPLICABLE TO PUBLIC MEMBERS AND PUBLIC EMPLOYEES, AND TO REQUIRE A STATEMENT OF COMPLIANCE ASSURANCE TO BE FILED ANNUALLY WITH THE SCHOOL'S SPONSOR AND THE STATE DEPARTMENT OF EDUCATION.
The Senate proceeded to a consideration of the Bill, the question being the second reading of the Bill.
Senator HAYES explained the Bill.
The "ayes" and "nays" were demanded and taken, resulting as follows:
Ayes 36; Nays 0
AYES
Alexander Allen Bennett
Bright Bryant Campbell
Campsen Coleman Corbin
Courson Cromer Davis
Fair Grooms Hayes
Hembree Hutto Johnson
Lourie Malloy Martin, Larry
Martin, Shane Massey Matthews
McElveen Nicholson O'Dell
Pinckney Rankin Reese
Sabb Scott Shealy
Thurmond Turner Young
Total--36
NAYS
Total--0
The Bill was read the second time, passed and ordered to a third reading.
AMENDED, CARRIED OVER
H. 3145 (Word version) -- Reps. Sandifer, Lucas, Thayer, Yow, Long, G.R. Smith, Hixon, Henderson, G.M. Smith, Sottile, Forrester, Felder, Atwater, Toole, Huggins, Pope, Simrill, Bales, Anderson, Gilliard and Hicks: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING SECTION 15-3-700 SO AS TO PROVIDE CIRCUMSTANCES IN WHICH A PERSON IS IMMUNE FROM CIVIL LIABILITY FOR DAMAGE RESULTING FROM HIS FORCIBLE ENTRY INTO A MOTOR VEHICLE TO REMOVE A CHILD WHO HE REASONABLY BELIEVES IS IN IMMINENT DANGER OF SUFFERING HARM IF NOT REMOVED, AMONG OTHER THINGS, AND TO PROVIDE THAT THIS IMMUNITY DOES NOT AFFECT CERTAIN OTHER CIVIL LIABILITY.
The Senate proceeded to a consideration of the Bill.
Senators MASSEY and COLEMAN proposed the following amendment (JUD3145.002), which was adopted:
Amend the bill, as and if amended, by striking all after the enacting words and inserting:
/ SECTION 1. Article 5, Chapter 3, Title 15 of the 1976 Code is amended by adding:
"Section 15-3-700. A person is immune from civil liability for property damage resulting from his forcible entry into a motor vehicle for the purpose of removing a minor or vulnerable adult from the vehicle if the person has a reasonable good faith belief that forcible entry into the vehicle is necessary because the minor or vulnerable adult is in imminent danger of suffering harm."
SECTION 2. This act takes effect upon approval by the Governor. /
Renumber sections to conform.
Amend title to conform.
Senator MASSEY explained the Bill.
On motion of Senator MALLOY, the Bill was carried over.
CARRIED OVER
H. 3305 (Word version) -- Reps. Lowe, Bingham, Horne, Weeks and Bradley: A BILL TO AMEND SECTION 41-35-120, AS AMENDED, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE DENIAL OF UNEMPLOYMENT BENEFITS FOR AN EMPLOYEE WHO TESTS POSITIVE FOR ILLEGAL DRUG USE OR THE UNLAWFUL USE OF LEGAL DRUGS, SO AS TO REVISE THE RANGE OF SPECIMENS FROM AN EMPLOYEE THAT MAY BE TESTED TO INCLUDE ORAL FLUIDS.
On motion of Senator ALEXANDER, the Bill was carried over.
H. 3353 (Word version) -- Reps. Bradley, Herbkersman, Daning, Erickson, Long, Bowers, Newton, Wells, Corley, Hodges, R.L. Brown, George, Johnson and Robinson-Simpson: A JOINT RESOLUTION TO ESTABLISH BEGINNING WITH THE 2015-2016 SCHOOL YEAR A TWO-YEAR PILOT PROGRAM IN FIVE SPECIFIC COUNTIES TO FACILITATE THE USE OF GENERAL EDUCATIONAL DEVELOPMENT CAMPS TO HELP PEOPLE OBTAIN THEIR GENERAL EDUCATIONAL DEVELOPMENT CERTIFICATES, TO PROVIDE PROGRAM ELEMENTS, AND TO PROVIDE THE STATE BOARD FOR TECHNICAL AND COMPREHENSIVE EDUCATION SHALL ESTABLISH AND OVERSEE THE PROGRAM.
Senator SHANE MARTIN explained the Joint Resolution.
On motion of Senator SCOTT, the Joint Resolution was carried over.
S. 653 (Word version) -- Senator Scott: A BILL TO AMEND SECTION 38-63-80, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO PAYMENT OF INDIVIDUAL LIFE INSURANCE POLICY BENEFIT PROCEEDS IN A LUMP SUM, SO AS TO PROVIDE THE INTEREST PAID MUST BE PAID AT A RATE NOT LESS THAN THE CURRENT RATE INTEREST PAID ON DEATH PROCEEDS LEFT ON DEPOSIT WITH THE INSURER; AND TO AMEND SECTION 38-65-120, RELATING TO PAYMENT OF GROUP LIFE INSURANCE POLICY BENEFIT PROCEEDS IN A LUMP SUM, SO AS TO CLARIFY THE REQUIREMENTS FOR CLAIMS SUBMISSIONS, AND TO PROVIDE INTEREST PAID ON LUMP SUM PAYMENTS MUST BE PAID AT A RATE NOT LESS THAN THE CURRENT RATE OF INTEREST PAID ON DEATH PROCEEDS LEFT ON DEPOSIT WITH THE INSURER.
Senator CROMER explained the Bill.
On motion of Senator HUTTO, the Bill was carried over.
MINORITY REPORT REMOVED
H. 3560 (Word version) -- Reps. Limehouse, Sottile, McCoy and Spires: A BILL TO AMEND SECTION 59-25-460, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO THE REQUIRED NOTICE AND HEARINGS FOR DISMISSAL OF A TEACHER, SO AS TO PROVIDE THAT THE BOARD MAY DESIGNATE A HEARING OFFICER TO CONDUCT A DISMISSAL HEARING AND ISSUE A REPORT WITH RECOMMENDATIONS, TO PROVIDE RELATED REQUIREMENTS OF A HEARING OFFICER, TO PROVIDE A HEARING MUST BE PRIVATE UNLESS THE TEACHER REQUESTS IN WRITING THAT THE HEARING BE PUBLIC, TO PROVIDE THAT A NOTICE OF DISMISSAL MUST BE GIVEN BY THE SUPERINTENDENT OR HIS DESIGNEE INSTEAD OF THE SCHOOL BOARD, TO SPECIFY USE OF A COURT REPORTER TO RECORD THE PROCEEDINGS, AND TO PROVIDE AN APPEALS PROCESS.
Senator MALLOY asked unanimous consent to remove his name from the minority report of the Bill.
There was no objection and proper notation was made on the Bill.
OBJECTION
S. 453 (Word version) -- Senators Fair and Reese: A BILL TO MAKE PERMANENT THE PROVISIONS OF SECTION 14-1-240, RELATING TO SURCHARGES ON CERTAIN MISDEMEANORS TO FUND TRAINING AT THE SOUTH CAROLINA CRIMINAL JUSTICE ACADEMY.
Senator MASSEY objected to consideration of the Bill.
THE CALL OF THE UNCONTESTED CALENDAR HAVING BEEN COMPLETED, THE SENATE PROCEEDED TO THE MOTION PERIOD.
At 2:26 P.M., on motion of Senator CROMER, the Senate agreed to dispense with the balance of the Motion Period.
OBJECTION
Senator HUTTO asked unanimous consent to make a motion that the Senate proceed to H. 3579 on the Special Order Calendar.
Senator BRIGHT objected.
HAVING DISPENSED WITH THE MOTION PERIOD, THE SENATE PROCEEDED TO A CONSIDERATION OF REPORTS OF COMMITTEES OF CONFERENCE AND FREE CONFERENCE.
Message from the House
Columbia, S.C., June 2, 2015
Mr. President and Senators:
The House respectfully informs your Honorable Body that it has adopted the Report of the Committee of Conference on:
S. 183 (Word version) -- Senators Hayes and Bryant: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY AMENDING SECTION 16-3-2010, RELATING TO HUMAN TRAFFICKING DEFINITIONS, SO AS TO DEFINE "COERCION"; BY AMENDING SECTION 16-3-2020, RELATING TO HUMAN TRAFFICKING OFFENSES, SO AS TO PROVIDE THAT A PERSON IS CONSIDERED A TRAFFICKER IF THE PERSON SOLICITS OR PARTICIPATES IN PROSTITUTION WITH ANOTHER PERSON KNOWING THAT THE OTHER PERSON IS A HUMAN TRAFFICKING VICTIM, TO PROVIDE THAT A VICTIM CONVICTED OF A HUMAN TRAFFICKING VIOLATION OR PROSTITUTION MAY MOTION THE COURT TO VACATE THE CONVICTION, AND TO PROVIDE THAT A VICTIM IS NOT SUBJECT TO PROSECUTION FOR HUMAN TRAFFICKING OR PROSTITUTION IF THE VICTIM WAS A MINOR AT THE TIME OF THE OFFENSE, AND TO PROVIDE THAT A VICTIM'S SEXUAL HISTORY IS NOT ADMISSIBLE BY A DEFENDANT IN A CRIMINAL ACTION; BY AMENDING SECTION 16-3-2030, RELATING TO BUSINESSES AND HUMAN TRAFFICKING, SO AS TO PROVIDE THAT A COURT MAY CONSIDER DISGORGEMENT OF PROFIT FROM A BUSINESS INVOLVED IN HUMAN TRAFFICKING AND DISBARMENT FROM GOVERNMENT CONTRACTS; BY AMENDING SECTION 16-3-2040, RELATING TO HUMAN TRAFFICKING RESTITUTION, SO AS TO PROVIDE THAT THE COURT MAY ORDER AN AMOUNT REPRESENTING THE VALUE OF THE VICTIM'S LABOR OR SERVICES; BY AMENDING SECTION 16-3-2050, RELATING TO THE HUMAN TRAFFICKING TASK FORCE, SO AS TO PROVIDE THAT THE TASK FORCE MAY MAKE GRANTS OR CONTRACTS TO DEVELOP OR EXPAND VICTIM SERVICE PROGRAMS; BY AMENDING SECTION 16-3-2060, RELATING TO HUMAN TRAFFICKING CIVIL ACTIONS, SO AS TO PROVIDE THAT A VICTIM'S SEXUAL HISTORY IS NOT ADMISSIBLE BY A DEFENDANT IN A CIVIL ACTION; BY AMENDING SECTION 16-3-2070, RELATING TO VICTIMS' RIGHTS AND THE STATE CRIME VICTIM'S COMPENSATION FUND, SO AS TO PROVIDE THAT HUMAN TRAFFICKING VICTIMS ARE CONSIDERED VICTIMS REGARDLESS OF IMMIGRATION STATUS, TO PROVIDE THAT THE PICTURES AND IMAGES OF VICTIMS MUST BE KEPT CONFIDENTIAL, AND TO PROVIDE THE PROTOCOL A LAW ENFORCEMENT OFFICER SHALL FOLLOW WHEN INTERACTING WITH A VICTIM; AND BY ADDING SECTION 16-3-2100, SO AS TO REQUIRE THE POSTING OF INFORMATION REGARDING THE NATIONAL HUMAN TRAFFICKING RESOURCE CENTER HOTLINE IN CERTAIN BUSINESSES.
Very respectfully,
Speaker of the House
S. 183--REPORT OF THE
COMMITTEE OF CONFERENCE ADOPTED
S. 183 (Word version) -- Senators Hayes and Bryant: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY AMENDING SECTION 16-3-2010, RELATING TO HUMAN TRAFFICKING DEFINITIONS, SO AS TO DEFINE "COERCION"; BY AMENDING SECTION 16-3-2020, RELATING TO HUMAN TRAFFICKING OFFENSES, SO AS TO PROVIDE THAT A PERSON IS CONSIDERED A TRAFFICKER IF THE PERSON SOLICITS OR PARTICIPATES IN PROSTITUTION WITH ANOTHER PERSON KNOWING THAT THE OTHER PERSON IS A HUMAN TRAFFICKING VICTIM, TO PROVIDE THAT A VICTIM CONVICTED OF A HUMAN TRAFFICKING VIOLATION OR PROSTITUTION MAY MOTION THE COURT TO VACATE THE CONVICTION, AND TO PROVIDE THAT A VICTIM IS NOT SUBJECT TO PROSECUTION FOR HUMAN TRAFFICKING OR PROSTITUTION IF THE VICTIM WAS A MINOR AT THE TIME OF THE OFFENSE, AND TO PROVIDE THAT A VICTIM'S SEXUAL HISTORY IS NOT ADMISSIBLE BY A DEFENDANT IN A CRIMINAL ACTION; BY AMENDING SECTION 16-3-2030, RELATING TO BUSINESSES AND HUMAN TRAFFICKING, SO AS TO PROVIDE THAT A COURT MAY CONSIDER DISGORGEMENT OF PROFIT FROM A BUSINESS INVOLVED IN HUMAN TRAFFICKING AND DISBARMENT FROM GOVERNMENT CONTRACTS; BY AMENDING SECTION 16-3-2040, RELATING TO HUMAN TRAFFICKING RESTITUTION, SO AS TO PROVIDE THAT THE COURT MAY ORDER AN AMOUNT REPRESENTING THE VALUE OF THE VICTIM'S LABOR OR SERVICES; BY AMENDING SECTION 16-3-2050, RELATING TO THE HUMAN TRAFFICKING TASK FORCE, SO AS TO PROVIDE THAT THE TASK FORCE MAY MAKE GRANTS OR CONTRACTS TO DEVELOP OR EXPAND VICTIM SERVICE PROGRAMS; BY AMENDING SECTION 16-3-2060, RELATING TO HUMAN TRAFFICKING CIVIL ACTIONS, SO AS TO PROVIDE THAT A VICTIM'S SEXUAL HISTORY IS NOT ADMISSIBLE BY A DEFENDANT IN A CIVIL ACTION; BY AMENDING SECTION 16-3-2070, RELATING TO VICTIMS' RIGHTS AND THE STATE CRIME VICTIM'S COMPENSATION FUND, SO AS TO PROVIDE THAT HUMAN TRAFFICKING VICTIMS ARE CONSIDERED VICTIMS REGARDLESS OF IMMIGRATION STATUS, TO PROVIDE THAT THE PICTURES AND IMAGES OF VICTIMS MUST BE KEPT CONFIDENTIAL, AND TO PROVIDE THE PROTOCOL A LAW ENFORCEMENT OFFICER SHALL FOLLOW WHEN INTERACTING WITH A VICTIM; AND BY ADDING SECTION 16-3-2100, SO AS TO REQUIRE THE POSTING OF INFORMATION REGARDING THE NATIONAL HUMAN TRAFFICKING RESOURCE CENTER HOTLINE IN CERTAIN BUSINESSES.
On motion of Senator HAYES, with unanimous consent, the Report of the Committee of Conference was taken up for immediate consideration.
Senator HAYES spoke on the report.
The question then was adoption of the Report of the Committee of Conference.
The Report of the Conference Committee was adopted as follows:
S. 183--Conference Report
The General Assembly, Columbia, S.C., June 1, 2015
The COMMITTEE OF CONFERENCE, to whom was referred:
S. 183 (Word version) -- Senators Hayes and Bryant: A BILL TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY AMENDING SECTION 16-3-2010, RELATING TO HUMAN TRAFFICKING DEFINITIONS, SO AS TO DEFINE "COERCION"; BY AMENDING SECTION 16-3-2020, RELATING TO HUMAN TRAFFICKING OFFENSES, SO AS TO PROVIDE THAT A PERSON IS CONSIDERED A TRAFFICKER IF THE PERSON SOLICITS OR PARTICIPATES IN PROSTITUTION WITH ANOTHER PERSON KNOWING THAT THE OTHER PERSON IS A HUMAN TRAFFICKING VICTIM, TO PROVIDE THAT A VICTIM CONVICTED OF A HUMAN TRAFFICKING VIOLATION OR PROSTITUTION MAY MOTION THE COURT TO VACATE THE CONVICTION, AND TO PROVIDE THAT A VICTIM IS NOT SUBJECT TO PROSECUTION FOR HUMAN TRAFFICKING OR PROSTITUTION IF THE VICTIM WAS A MINOR AT THE TIME OF THE OFFENSE, AND TO PROVIDE THAT A VICTIM'S SEXUAL HISTORY IS NOT ADMISSIBLE BY A DEFENDANT IN A CRIMINAL ACTION; BY AMENDING SECTION 16-3-2030, RELATING TO BUSINESSES AND HUMAN TRAFFICKING, SO AS TO PROVIDE THAT A COURT MAY CONSIDER DISGORGEMENT OF PROFIT FROM A BUSINESS INVOLVED IN HUMAN TRAFFICKING AND DISBARMENT FROM GOVERNMENT CONTRACTS; BY AMENDING SECTION 16-3-2040, RELATING TO HUMAN TRAFFICKING RESTITUTION, SO AS TO PROVIDE THAT THE COURT MAY ORDER AN AMOUNT REPRESENTING THE VALUE OF THE VICTIM'S LABOR OR SERVICES; BY AMENDING SECTION 16-3-2050, RELATING TO THE HUMAN TRAFFICKING TASK FORCE, SO AS TO PROVIDE THAT THE TASK FORCE MAY MAKE GRANTS OR CONTRACTS TO DEVELOP OR EXPAND VICTIM SERVICE PROGRAMS; BY AMENDING SECTION 16-3-2060, RELATING TO HUMAN TRAFFICKING CIVIL ACTIONS, SO AS TO PROVIDE THAT A VICTIM'S SEXUAL HISTORY IS NOT ADMISSIBLE BY A DEFENDANT IN A CIVIL ACTION; BY AMENDING SECTION 16-3-2070, RELATING TO VICTIMS' RIGHTS AND THE STATE CRIME VICTIM'S COMPENSATION FUND, SO AS TO PROVIDE THAT HUMAN TRAFFICKING VICTIMS ARE CONSIDERED VICTIMS REGARDLESS OF IMMIGRATION STATUS, TO PROVIDE THAT THE PICTURES AND IMAGES OF VICTIMS MUST BE KEPT CONFIDENTIAL, AND TO PROVIDE THE PROTOCOL A LAW ENFORCEMENT OFFICER SHALL FOLLOW WHEN INTERACTING WITH A VICTIM; AND BY ADDING SECTION 16-3-2100, SO AS TO REQUIRE THE POSTING OF INFORMATION REGARDING THE NATIONAL HUMAN TRAFFICKING RESOURCE CENTER HOTLINE IN CERTAIN BUSINESSES.
Beg leave to report that they have duly and carefully considered the same and recommend:
That the same do pass with the following amendments:
Amend the bill, as and if amended, by striking all after the enacting words and inserting:
/ SECTION 1. Section 16-3-2020 of the 1976 Code is amended to read:
"Section 16-3-2020. (A) A person who recruits, entices, solicits, isolates, harbors, transports, provides, or obtains, or so attempts, a victim, knowing that the victim will be subjected to sex trafficking, forced labor or services, involuntary servitude or debt bondage through any means or who benefits, financially or by receiving anything of value, from participation in a venture which has engaged in an act described in this subsection, is guilty of trafficking in persons.
(B) A person who recruits, entices, solicits, isolates, harbors, transports, provides, or obtains, or so attempts, a victim, for the purposes of sex trafficking, forced labor or services, involuntary servitude or debt bondage through any means or who benefits, financially or by receiving anything of value, from participation in a venture which has engaged in an act described in subsection (A), is guilty of trafficking in persons.
(C) For a first offense, the person is guilty of a felony and, upon conviction, must be imprisoned not more than fifteen years.
(D) For a second offense, the person is guilty of a felony and, upon conviction, must be imprisoned not more than thirty years.
(E) For a third or subsequent offense, the person is guilty of a felony, and, upon conviction, must be imprisoned not more than forty-five years.
(F) If the victim of an offense contained in this section is under the age of eighteen, an additional term of fifteen years may be imposed in addition and must be consecutive to the penalty prescribed for a violation of this section.
(G) A person who aids, abets, or conspires with another person to violate the criminal provisions of this section must be punished in the same manner as provided for the principal offender and is considered a trafficker. A person is considered a trafficker if he knowingly gives, agrees to give, or offers to give anything of value so that any person may engage in commercial sexual activity with another person when he knows that the other person is a victim of trafficking in persons.
(H) A business owner who uses his business in a way that participates in a violation of this article, upon conviction, must be imprisoned for not more than ten years in addition to the penalties provided in this section for each violation.
(I) A plea of guilty or the legal equivalent entered pursuant to a provision of this article by an offender entitles the victim of trafficking in persons to all benefits, rights, and compensation granted pursuant to Section 16-3-1110.
(J) In a prosecution of a person who is a victim of trafficking in persons, it is an affirmative defense that he was under duress or coerced into committing the offenses for which he is subject to prosecution, if the offenses were committed as a direct result of, or incidental or related to, trafficking. A victim of trafficking in persons convicted of a violation of this article or prostitution may motion the court to vacate the conviction and expunge the record of the conviction. The court may grant the motion on a finding that the person's participation in the offense was a direct result of being a victim. A victim of trafficking in persons is not subject to prosecution pursuant to this article or prostitution, if the victim was a minor at the time of the offense and committed the offense as a direct result of, or incidental or related to, trafficking.
(K) Evidence of the following facts or conditions do not constitute a defense in a prosecution for a violation of this article, nor does the evidence preclude a finding of a violation:
(1) the victim's sexual history or history of commercial sexual activity, the specific instances of the victim's sexual conduct, opinion evidence of the victim's sexual conduct, and reputation evidence of the victim's sexual conduct;
(2) the victim's connection by blood or marriage to a defendant in the case or to anyone involved in the victim's trafficking;
(3) the implied or express consent of a victim to acts which violate the provisions of this section do not constitute a defense to violations of this section;
(4) age of consent to sex, legal age of marriage, or other discretionary age; and
(5) mistake as to the victim's age, even if the mistake is reasonable.
(L) A person who violates the provisions of this section may be prosecuted by the State Grand Jury, pursuant to Section 14-7-1600, when a victim is trafficked in more than one county or a trafficker commits the offense of trafficking in persons in more than one county."
SECTION 2. Section 16-3-2030(A) of the 1976 Code is amended to read:
SECTION 3. Section 16-3-2040(D) of the 1976 Code is amended to read:
"(D) Restitution for this section, pursuant to Section 16-3-1270, means payment for all injuries, specific losses, and expenses, including, but not limited to, attorney's fees, sustained by a crime victim resulting from an offender's criminal conduct pursuant to Section 16-3-1110(12)(a). In addition, the court may order an amount representing the value of the victim's labor or services."
SECTION 4. Section 16-3-2050 of the 1976 Code is amended by adding an appropriately numbered subsection to read:
"( ) To the extent that funds are appropriated, the task force may make grants to or contract with a state agency, local government, or private victim's service organization to develop or expand service programs for victim's. A recipient of a grant or contract shall report annually to the task force the number and demographic information of all victims receiving services pursuant to the grant or contract."
SECTION 5. If any section, subsection, item, subitem, paragraph, subparagraph, sentence, clause, phrase, or word of this act is for any reason held to be unconstitutional or invalid, such holding shall not affect the constitutionality or validity of the remaining portions of this act, the General Assembly hereby declaring that it would have passed this act, and each and every section, subsection, item, subitem, paragraph, subparagraph, sentence, clause, phrase, and word thereof, irrespective of the fact that any one or more other sections, subsections, items, subitems, paragraphs, subparagraphs, sentences, clauses, phrases, or words hereof may be declared to be unconstitutional, invalid, or otherwise ineffective.
SECTION 6. This act takes effect upon approval by the Governor. /
Amend title to conform.
/s/Sen. Robert W. Hayes, Jr. /s/Rep. Norman D. Brannon
/s/Sen. C. Bradley Hutto Rep. Christopher J. Murphy
/s/Sen. Tom Young, Jr. /s/Rep. J. David Weeks
On Part of the Senate. On Part of the House.
, and a message was sent to the House accordingly.
THE SENATE PROCEEDED TO A CONSIDERATION OF BILLS AND RESOLUTIONS RETURNED FROM THE HOUSE.
CARRIED OVER
S. 199 (Word version) -- Senators Grooms, Hembree, Bennett, Campbell, Verdin, Campsen, Gregory, Johnson, Setzler, Sabb, Nicholson and Scott: A BILL TO AMEND SECTION 56-5-1535 OF THE 1976 CODE, RELATING TO SPEEDING IN WORK ZONES AND PENALTIES ASSOCIATED WITH SPEEDING IN WORK ZONES, TO DELETE THIS PROVISION AND CREATE "PEANUT'S LAW", TO PROVIDE A DEFINITION FOR THE TERMS "HIGHWAY WORK ZONE" AND "HIGHWAY WORKER", TO CREATE THE OFFENSES OF "ENDANGERMENT OF A HIGHWAY WORKER", AND TO PROVIDE PENALTIES FOR THESE OFFENSES; TO AMEND SECTION 56-1-720, RELATING TO THE POINT SYSTEM ESTABLISHED FOR THE EVALUATION OF THE DRIVING RECORD OF PERSONS OPERATING MOTOR VEHICLES, TO PROVIDE THAT "ENDANGERMENT OF A HIGHWAY WORKER" VIOLATIONS RANGE BETWEEN TWO AND SIX POINTS; AND TO REPEAL SECTION 56-5-1536 RELATING TO DRIVING IN TEMPORARY WORK ZONES AND PENALTIES FOR UNLAWFUL DRIVING IN TEMPORARY WORK ZONES.
The House returned the Bill with amendments.
On motion of Senator HUTTO, the Bill was carried over.
Motion to Ratify Adopted
At 2:32 P.M., Senator LARRY MARTIN asked unanimous consent to make a motion to invite the House of Representatives to attend the Senate Chamber for the purpose of ratifying Acts at a mutually convenient time.
There was no objection and a message was sent to the House accordingly.
RATIFICATION OF ACTS
Pursuant to an invitation the Honorable Speaker and House of Representatives appeared in the Senate Chamber on June 3, 2015, at 3:00 P.M. and the following Acts and Joint Resolutions were ratified:
(R90, S. 78 (Word version)) -- Senators Massey and Nicholson: AN ACT TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, TO ENACT THE "FORFEITED LANDS EMERGENCY DEVELOPMENT ACT" BY ADDING SECTION 12-59-140 SO AS TO AUTHORIZE THE COUNTY COUNCIL TO PETITION THE DEPARTMENT OF REVENUE TO ALLOW THE COUNTY'S FORFEITED LAND COMMISSION TO UTILIZE EMERGENCY PROCEDURES, TO SPECIFY THE PROCESS BY WHICH THE PETITION IS SUBMITTED, AND TO SPECIFY THE EMERGENCY PROCEDURES; AND BY ADDING SECTION 12-59-150 SO TO PROHIBIT AN IMMEDIATE FAMILY MEMBER OF A COUNTY FORFEITED LAND COMMISSION MEMBER FROM PURCHASING LAND FROM THE FORFEITED LAND COMMISSION ON WHICH THEIR RELATIVE SERVES, AND TO PROVIDE EXCEPTIONS.
L:\COUNCIL\ACTS\78DG15.DOCX
(R91, S. 810 (Word version)) -- Senator Leatherman: AN ACT TO AMEND ACT 250 OF 1991, AS AMENDED, RELATING TO THE ELECTION OF TRUSTEES IN FLORENCE COUNTY SCHOOL DISTRICT NUMBER FIVE, SO AS TO REAPPORTION THE FOUR SINGLE-MEMBER ELECTION DISTRICTS FROM WHICH TRUSTEES ARE ELECTED, TO DESIGNATE A MAP NUMBER ON WHICH THESE SINGLE-MEMBER ELECTION DISTRICTS ARE DELINEATED, AND TO PROVIDE DEMOGRAPHIC INFORMATION PERTAINING TO THE REAPPORTIONED ELECTION DISTRICTS.
L:\COUNCIL\ACTS\810ZW15.DOCX
(R92, S. 389 (Word version)) -- Senator Lourie: AN ACT TO AMEND CHAPTER 37, TITLE 33, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO SOUTH CAROLINA BUSINESS DEVELOPMENT CORPORATIONS, SO AS TO FURTHER PROVIDE FOR THE MANNER IN WHICH THESE CORPORATIONS ARE ORGANIZED, REGULATED, AND PERMITTED TO OPERATE.
L:\COUNCIL\ACTS\389SD15.DOCX
(R93, S. 809 (Word version)) -- Senator Leatherman: AN ACT TO AMEND ACT 84 OF 2011, AS AMENDED, RELATING TO THE TIME AND METHOD BY WHICH THE NINE MEMBERS OF THE FLORENCE COUNTY SCHOOL DISTRICT NUMBER THREE BOARD OF TRUSTEES ARE ELECTED, SO AS TO REAPPORTION THE FIVE SINGLE-MEMBER ELECTION DISTRICTS AND THE TWO MULTIMEMBER ELECTION DISTRICTS FROM WHICH THESE NINE MEMBERS MUST BE ELECTED, TO DESIGNATE A MAP NUMBER ON WHICH THESE SINGLE-MEMBER AND MULTIMEMBER ELECTION DISTRICTS ARE DELINEATED, AND TO PROVIDE DEMOGRAPHIC INFORMATION PERTAINING TO THE REAPPORTIONED ELECTION DISTRICTS.
L:\COUNCIL\ACTS\809ZW15.DOCX
(R94, H. 3156 (Word version)) -- Reps. J.E. Smith, Cobb-Hunter, Whipper, Weeks and Yow: AN ACT TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 5 TO CHAPTER 15, TITLE 63 ENACTING THE "UNIFORM DEPLOYED PARENTS CUSTODY AND VISITATION ACT" SO AS TO ADDRESS ISSUES OF CUSTODIAL RESPONSIBILITY WHEN A PARENT IN THE UNIFORMED SERVICE IS BEING DEPLOYED; TO PROVIDE THAT A COURT MUST HAVE JURISDICTION PURSUANT TO THE UNIFORM CHILD CUSTODY JURISDICTION AND ENFORCEMENT ACT TO ISSUE AN ORDER UNDER THIS ARTICLE; TO REQUIRE PROMPT NOTICE OF DEPLOYMENT TO THE OTHER PARENT; TO PROVIDE THAT THE CUSTODIAL RESPONSIBILITIES OF A DEPLOYING PARENT MAY BE ASSIGNED FOR THE DURATION OF THE DEPLOYMENT BY A TEMPORARY AGREEMENT ENTERED INTO BY THE PARENTS OR WITH THE DEPLOYING PARENT'S CONSENT, BY A COURT ISSUING A TEMPORARY ORDER GRANTING CUSTODIAL RESPONSIBILITIES AND TO FURTHER PROVIDE CERTAIN REQUIREMENTS AND LIMITATIONS OF AN AGREEMENT OR COURT ORDER; TO PROVIDE FOR THE TERMINATION OF A TEMPORARY AGREEMENT OR A TEMPORARY ORDER; TO PROVIDE THAT THIS ARTICLE SUPERSEDES THE FEDERAL ELECTRONIC SIGNATURES IN GLOBAL AND NATIONAL COMMERCE ACT, EXCEPT CERTAIN PROVISIONS IN THAT ACT; AND TO PROVIDE THAT THIS ARTICLE DOES NOT AFFECT THE VALIDITY OF A TEMPORARY COURT ORDER CONCERNING CUSTODIAL RESPONSIBILITY DURING DEPLOYMENT ENTERED BEFORE THIS ARTICLE'S EFFECTIVE DATE.
L:\COUNCIL\ACTS\3156VR15.DOCX
(R95, H. 3548 (Word version)) -- Reps. J.E. Smith, Yow and Weeks: AN ACT TO AMEND SECTION 63-7-320, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO NOTIFICATION AND TRANSFER OF REPORTS OF CHILD ABUSE OR NEGLECT, SO AS TO PROVIDE THAT IF THE ALLEGED ABUSED OR NEGLECTED CHILD IS A MEMBER OF AN ACTIVE DUTY MILITARY FAMILY, THE COUNTY DEPARTMENT OF SOCIAL SERVICES SHALL NOTIFY CERTAIN DESIGNATED MILITARY OFFICIALS AT THE INSTALLATION WHERE THE ACTIVE DUTY SERVICE MEMBER, WHO IS THE SPONSOR OF THE ALLEGED ABUSED OR NEGLECTED CHILD, IS ASSIGNED; TO AMEND SECTION 63-7-920, RELATING TO INVESTIGATIONS AND CASE DETERMINATIONS OF THE DEPARTMENT OF SOCIAL SERVICES, SO AS TO PROVIDE THAT THE DEPARTMENT OR LAW ENFORCEMENT, OR BOTH, MAY COLLECT INFORMATION CONCERNING THE MILITARY AFFILIATION OF THE PERSON HAVING CUSTODY OR CONTROL OF THE CHILD SUBJECT TO AN INVESTIGATION AND MAY SHARE THIS INFORMATION WITH THE APPROPRIATE MILITARY AUTHORITIES; TO AMEND SECTION 63-7-1990, AS AMENDED, RELATING TO CONFIDENTIALITY AND RELEASE OF RECORDS AND INFORMATION, SO AS TO MAKE TECHNICAL CORRECTIONS AND TO AUTHORIZE THE DEPARTMENT OF SOCIAL SERVICES TO GRANT ACCESS TO THE RECORDS OF AN INDICATED CASE TO CERTAIN DESIGNATED MILITARY OFFICIALS AT THE INSTALLATION WHERE THE ACTIVE DUTY SERVICE MEMBER, WHO IS THE SPONSOR OF THE ALLEGED ABUSED OR NEGLECTED CHILD, IS ASSIGNED; AND TO AMEND SECTION 63-11-80, RELATING TO CONFIDENTIAL INFORMATION WITHIN CHILD WELFARE AGENCIES, SO AS TO PROVIDE THAT AN OFFICER, AGENT OR EMPLOYEE OF THE DEPARTMENT OR A CHILD WELFARE AGENCY SHALL NOT DISCLOSE, DIRECTLY OR INDIRECTLY, INFORMATION LEARNED ABOUT A CHILD, THE CHILD'S PARENTS OR RELATIVES, OR OTHER PERSONS HAVING CUSTODY OR CONTROL OF THE CHILD, EXCEPT IN CASES INVOLVING A CHILD IN THE CUSTODY OR CONTROL OF PERSONS WHO HAVE MILITARY AFFILIATION.
L:\COUNCIL\ACTS\3548ZW15.DOCX
(R96, H. 3583 (Word version)) -- Reps. Clemmons, Simrill, McCoy, Loftis, Atwater, Kirby, Corley, Bernstein, McEachern, Weeks, Johnson, Goldfinch, Kennedy, H.A. Crawford, Rutherford, Whitmire, Douglas, Burns, Clyburn, Erickson, G.R. Smith, Yow, Spires, Chumley, Allison, Hardee, Anderson, Gagnon, Putnam, Nanney, Williams, Limehouse, Duckworth, Norrell, Anthony, Ballentine, Bannister, Bedingfield, Bingham, Clary, Delleney, Felder, Finlay, Funderburk, Gambrell, Hamilton, Hardwick, Hicks, Hiott, Hixon, Huggins, Long, Lowe, Lucas, V.S. Moss, Murphy, Norman, Pitts, Pope, Quinn, Riley, Rivers, Sandifer, G.M. Smith, Stringer, Tallon, Taylor, Thayer, Toole, Wells, Willis, Newton, Forrester, Hill and Gilliard: AN ACT TO AMEND THE CODE OF LAWS OF SOUTH CAROLINA, 1976, BY ADDING ARTICLE 23 TO CHAPTER 35, TITLE 11 SO AS TO PROHIBIT THE STATE OR A POLITICAL SUBDIVISION OF THE STATE FROM ACCEPTING A PROPOSAL FROM OR PROCURING GOODS OR SERVICES FROM A BUSINESS WHICH ENGAGES IN THE BOYCOTT OF A PERSON OR AN ENTITY BASED ON RACE, COLOR, RELIGION, GENDER, OR NATIONAL ORIGIN; TO AMEND SECTION 11-57-320, RELATING TO THE EXCEPTION TO CONTRACT PROHIBITION ON A CASE-BY-CASE BASIS, SO AS TO REMOVE THE CASE-BY-CASE BASIS REQUIREMENT, AND TO PROVIDE THAT THIS SECTION APPLIES TO INVESTMENT ACTIVITIES MADE BEFORE JANUARY 1, 2015; TO AMEND SECTION 11-57-330, RELATING TO THE CERTIFICATION REQUIREMENT TO CONTRACT WITH THE STATE, SO AS TO PROVIDE THAT THE REQUIREMENT DOES NOT APPLY TO CONTRACTS BETWEEN PUBLIC PROCUREMENT UNITS, NOR CONTRACTS BETWEEN PUBLIC PROCUREMENT UNITS AND EXTERNAL PROCUREMENT ACTIVITIES; TO AMEND SECTION 11-57-510, RELATING TO THE CERTIFICATION REQUIREMENT IN THE BIDDING PROCESS, SO AS TO PROVIDE THAT THE REQUIREMENT DOES NOT APPLY TO CONTRACTS BETWEEN PUBLIC PROCUREMENT UNITS, NOR CONTRACTS BETWEEN PUBLIC PROCUREMENT UNITS AND EXTERNAL PROCUREMENT ACTIVITIES; BY ADDING SECTION 11-57-50 SO AS TO PROVIDE THAT FAILURE TO COMPLY WITH A PROVISION OF THIS CHAPTER IS NOT GROUNDS FOR CERTAIN PROTESTS; AND TO AMEND SECTION 11-57-40, RELATING TO CERTAIN CONTRACTS AND PROCUREMENTS TO WHICH THE IRAN DIVESTMENT ACT DOES NOT APPLY, SO AS TO PROVIDE THAT IT DOES NOT APPLY TO A PROCUREMENT OR CONTRACT VALUED AT TEN THOUSAND DOLLARS OR LESS.
L:\COUNCIL\ACTS\3583SA15.DOCX
(R97, H. 3725 (Word version)) -- Reps. J.E. Smith, Quinn, Lowe, Jordan and W.J. McLeod: AN ACT TO AMEND SECTION 12-6-3535, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO TAX CREDITS FOR MAKING QUALIFIED REHABILITATION EXPENDITURES FOR CERTIFIED HISTORIC STRUCTURES, SO AS TO PROVIDE THAT A TAXPAYER MAY ELECT A TWENTY-FIVE PERCENT TAX CREDIT IN LIEU OF THE TEN PERCENT TAX CREDIT, NOT TO EXCEED ONE MILLION DOLLARS FOR EACH CERTIFIED HISTORIC STRUCTURE, TO PROVIDE FOR THE TIME PERIOD IN WHICH THE CREDIT MUST BE TAKEN, AND TO PROVIDE THAT THE TAX CREDIT MAY BE ASSIGNED; TO AMEND SECTION 12-67-120, RELATING TO DEFINITIONS, SO AS TO PROVIDE A DEFINITION FOR "STATE-OWNED ABANDONED BUILDING"; TO AMEND SECTION 12-67-140, RELATING TO ELIGIBILITY FOR THE ABANDONED BUILDING TAX CREDIT, SO AS TO INCLUDE INSURANCE PREMIUM TAXES AS ONE OF THE TAXES AGAINST WHICH A CREDIT CAN BE CLAIMED, TO PROVIDE FOR THE TIME PERIOD IN WHICH THE CREDIT MUST BE TAKEN, AND TO REMOVE A LIMITATION RELATED TO THE AMOUNT A TAXPAYER'S TAX LIABILITY MAY BE REDUCED; AND BY ADDING SECTION 12-67-160 SO AS TO PROVIDE FOR THE MANNER IN WHICH A TAXPAYER MAY APPLY TO OBTAIN CERTIFICATION OF THE ABANDONED BUILDING SITE.
L:\COUNCIL\ACTS\3725SA15.DOCX
(R98, H. 3772 (Word version)) -- Reps. Merrill and Delleney: AN ACT TO AMEND SECTION 38-79-260, CODE OF LAWS OF SOUTH CAROLINA, 1976, RELATING TO APPOINTMENT OF DIRECTORS TO THE BOARD OF THE SOUTH CAROLINA MEDICAL MALPRACTICE INSURANCE JOINT UNDERWRITING ASSOCIATION, SO AS TO PROVIDE FOR THE REAPPOINTMENT OF DIRECTORS TO SUCCESSIVE TERMS BY DELETING A RELATED PROHIBITION.
L:\COUNCIL\ACTS\3772AB15.DOCX
THE SENATE PROCEEDED TO THE INTERRUPTED DEBATE.
DEBATE INTERRUPTED
H. 3702 (Word version) -- Ways and Means Committee: A JOINT RESOLUTION TO APPROPRIATE MONIES FROM THE CAPITAL RESERVE FUND FOR FISCAL YEAR 2014-2015, AND TO ALLOW UNEXPENDED FUNDS APPROPRIATED TO BE CARRIED FORWARD TO SUCCEEDING FISCAL YEARS AND EXPENDED FOR THE SAME PURPOSES.
The Senate proceeded to a consideration of the Joint Resolution, the question being the third reading of the Joint Resolution.
Amendment No. 5A
Senators SHANE MARTIN, DAVIS, BRIGHT and BRYANT proposed the following amendment (3702R010.KM.SRM):
Amend the joint resolution, as and if amended, by striking all after the enacting words and inserting:
/ SECTION 1. In accordance with the provisions of Section 36(B)(2) and (3), Article III, Constitution of South Carolina, 1895, and Section 11-11-320(C) and (D) of the 1976 Code, there is appropriated from the monies available in the Capital Reserve Fund for Fiscal Year 2014-2015 the following amounts:
(1) H63 - Department of Education
School Bus Lease or Purchase $17,000,000 (2) H03 - Commission on Higher Education Out of State Veteran Tuition Reimbursement-Colleges$ 7,000,000
(3) H51 - Medical University of South Carolina
Children's Hospital $1 (4) H59 - State Board for Technical and Comprehensive Education readySC$ 4,249,000
(5) J02 - Department of Health and Human Services
Telemedicine $2,000,000 (6) D10 - State Law Enforcement Division New Laboratory Facility$ 1
(7) D10 - State Law Enforcement Division
Vehicles $900,000 (8) K05 - Department of Public Safety Law Enforcement Vehicles$ 1,000,000
(9) K05 - Department of Public Safety
Body Armor Replacement $800,000 (10) K05 - Department of Public Safety Supply Warehouse Roof Replacement$ 250,000
(11) P16 - Department of Agriculture
Consumer Protection Equipment $1,000,000 (12) P28 - Department of Parks, Recreation and Tourism Welcome Center Facility Management$ 1
(13) Y14 - State Ports Authority
Georgetown Port
Maintenance Dredging $2,600,000 (14) U12 - Department of Transportation Facility Maintenance and Renovation$ 870,000
(15) County Transportation Fund
Capital Expenditures
Road Maintenance $47,144,208$ 84,813,211
SECTION 2. (A) Of the funds appropriated above in Section 1, item (2) to the Commission on Higher Education for Out of State Veteran Tuition Reimbursement-Colleges, the Office of State Treasurer is directed to establish a fund, separate and distinct from the general fund and all other funds, entitled the College and University Out of State Veteran Tuition Differential Reimbursement Fund. Any funds appropriated in this act for this purpose must be deposited into the fund and interest accrued by the fund must remain in the fund.
(B) The purpose of the fund is to reimburse public institutions of higher learning, as defined in Section 59-103-5 of the 1976 Code, for revenue loss resulting from the provisions of Section 59-112-50(C). By March 1, 2016, a public institution of higher learning seeking a reimbursement from this fund must submit an application to the Commission on Higher Education to receive a reimbursement from the fund. The total reimbursement to a public institution may not exceed the difference between the amount the institution would have charged but for Section 59-112-50(C), and the amount the institution actually charged. The Commission on Higher Education may require any proof it determines necessary to verify the veracity of the application.
(C) By June 15, 2016, the Commission on Higher Education must distribute the funds to those institutions that have applied pursuant to subsection (B). In the event that the total requested and verified reimbursements exceed the amount in the fund, the distribution to each public institution shall be reduced pro rata based on the institution's amount of verified reimbursements compared to the total amount of verified reimbursements of all institutions.
SECTION 3. Funds appropriated above in Section 1, item (14) to the Department of Transportation shall be used to fund the Orangeburg District Office Building Renovation, Clarendon County Maintenance Complex Construction, SHEP Greenville/Spartanburg Office Construction, and Lexington Maintenance Complex Construction.
SECTION 4. The Comptroller General shall post the appropriations contained in SECTION 1 of this joint resolution as provided in Section 11-11-320(D) of the 1976 Code. Unexpended funds appropriated pursuant to SECTION 1 of this joint resolution may be carried forward to succeeding fiscal years and expended for the same purposes.
SECTION 5. This joint resolution takes effect thirty days after the completion of the 2014-2015 Fiscal Year in accordance with the provisions of Section 36(B)(3)(a), Article III, Constitution of South Carolina, 1895, and Section 11-11-320(D)(1) of the 1976 Code. /
Renumber sections to conform.
Amend title to conform.
Senator DAVIS spoke on the amendment.
Debate was interrupted by adjournment.
Senator LEATHERMAN asked unanimous consent to make a motion that the Senate stand adjourned with Senator DAVIS retaining the floor on H. 3702.
There was no objection.
LOCAL APPOINTMENT
Confirmation
Having received a favorable report from the Senate, the following appointment was confirmed in open session:
Reappointment, Greenville County Master-in-Equity, with the term to commence April 30, 2015, and to expire April 30, 2021
Charles B. Simmons, Jr., 305 East North Street, Suite 313, Greenville, SC 29601
| 2022-07-05T13:08: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": 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.23838862776756287, "perplexity": 9622.175746156907}, "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/1656104576719.83/warc/CC-MAIN-20220705113756-20220705143756-00711.warc.gz"}
|
http://www.legisquebec.gouv.qc.ca/en/showversion/cr/Q-2,%20r.%2019?code=se:131&pointInTime=20201022
|
### Q-2, r. 19 - Regulation respecting the landfilling and incineration of residual materials
131. The measurements taken to monitor compliance with the limit values set out in section 130 are expressed as units of mass per cubic metre of dry combustion gas, at a reference temperature of 25 °C and pressure of 101.3 kPa, corrected to 11% oxygen according to the following formula:
E = Ea x (9.9 / (20.9 -A))
where
“E” is the corrected concentration;
“Ea” is the dry concentration at the above temperature and pressure; and
“A” is the percentage of oxygen, on a dry basis, in the combustion gases at the sampling point.
O.C. 451-2005, s. 131.
| 2020-11-25T08:27: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.8298935294151306, "perplexity": 2384.3813750460786}, "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-2020-50/segments/1606141181482.18/warc/CC-MAIN-20201125071137-20201125101137-00689.warc.gz"}
|
https://zbmath.org/authors/veinott.arthur-f-jun
|
Veinott, Arthur F. jun.
Compute Distance To:
Author ID: veinott.arthur-f-jun Published as: Veinott, Arthur F. jun.; Veinott, Arthur F. External Links: MGP · Wikidata · GND · IdRef
Documents Indexed: 38 Publications since 1962 2 Contributions as Editor Co-Authors: 20 Co-Authors with 23 Joint Publications 488 Co-Co-Authors
all top 5
Co-Authors
17 single-authored 4 Dantzig, George Bernard 2 Derman, Cyrus 2 Granot, Frieda 2 Wagner, Harvey Maurice 1 Balcer, Yves 1 Bessler, S. A. 1 Bowker, Albert H. 1 Ciurria-Infosino, Iara 1 Cottle, Richard W. 1 Eaves, B. Curtis 1 Erickson, Ranel E. 1 Hoffman, Alan J. 1 Huang, Ying 1 Ignall, Edward J. 1 Katehakis, Michael N. 1 Miller, Bruce L. 1 Monma, Clyde L. 1 Olkin, Ingram 1 Topkis, Donald M. 1 Xu, Ningxiong
all top 5
Serials
5 Mathematics of Operations Research 5 Operations Research 5 Management Science. Ser. A, Theory Series 4 Annals of Mathematical Statistics 3 Linear Algebra and its Applications 2 Probability in the Engineering and Informational Sciences 1 Discrete Mathematics 1 Mathematical Programming Study 1 Mathematical Programming 1 Networks 1 Operations Research Letters 1 Annals of Operations Research 1 SIAM Journal on Applied Mathematics 1 SIAM Review 1 Mathematical Programming. Series A. Series B 1 Naval Research Logistics Quarterly 1 SIAM Journal on Control 1 Management Science. Ser. B, Application Series
all top 5
Fields
21 Operations research, mathematical programming (90-XX) 5 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 4 Probability theory and stochastic processes (60-XX) 3 Calculus of variations and optimal control; optimization (49-XX) 3 Numerical analysis (65-XX) 2 General and overarching topics; collections (00-XX) 2 Combinatorics (05-XX) 1 History and biography (01-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Convex and discrete geometry (52-XX) 1 Computer science (68-XX) 1 Systems theory; control (93-XX)
Citations contained in zbMATH Open
34 Publications have been cited 933 times in 785 Documents Cited by Year
Discrete dynamic programming with sensitive discount optimality criteria. Zbl 0183.49102
Veinott, Arthur F. jun.
1969
Send-and-split method for minimum-concave-cost network flows. Zbl 0667.90036
Erickson, Ranel E.; Monma, Clyde L.; Veinott, Arthur F. jun.
1987
Optimal policy for a multi-product, dynamic, nonstationary inventory problem. Zbl 0143.21703
Veinott, Arthur F. jun.
1965
Computing optimal (s, S) inventory policies. Zbl 0137.14102
Veinott, Arthur F. jun.; Wagner, H. M.
1965
On the optimality of (s,S) inventory policies. New conditions and a new proof. Zbl 0173.47603
Veinott, Arthur F. jun.
1966
Optimal policy in a dynamic, single product, nonstationary inventory model with several demand classes. Zbl 0143.21704
Veinott, Arthur F. jun.
1965
On the convergence of some feasible direction algorithms for nonlinear programming. Zbl 0158.18805
Topkis, D. M.; Veinott, Arthur F. jun.
1967
Minimum concave-cost solution of Leontief substitution models of multi- facility inventory systems. Zbl 0175.17602
Veinott, Arthur F. jun.
1969
The status of mathematical inventory theory. Zbl 0143.21801
Veinott, Arthur F. jun.
1966
The supporting hyperplane method for unimodal programming. Zbl 0147.38604
Veinott, Arthur F. jun.
1967
On finding optimal policies in discrete dynamic programming with no discounting. Zbl 0149.16301
Veinott, Arthur F. jun.
1966
The multi-armed bandit problem: Decomposition and computation. Zbl 0618.90097
Katehakis, Michael N.; Veinott, Arthur F. jun.
1987
Polyhedral sets having a least element. Zbl 0245.90015
Cottle, Richard W.; Veinott, Arthur F. jun.
1972
Discrete dynamic programming with a small interest rate. Zbl 0175.47302
Miller, B. L.; Veinott, Arthur F. jun.
1969
Optimality of myopic inventory policies for several substitute products. Zbl 0172.44101
Ignall, Edward; Veinott, Arthur F. jun.
1969
Integral extreme points. Zbl 0162.33401
Veinott, Arthur F. jun.; Dantzig, G. B.
1968
Extreme points of Leontief substitution systems. Zbl 0174.51503
Veinott, Arthur F. jun.
1968
Optimal capacity scheduling. I, II. Zbl 0113.14301
Veinott, Arthur F. jun.; Wagner, H. M.
1962
Least $$d$$-majorized network flows with inventory and statistical applications. Zbl 0239.90014
Veinott, Arthur F. jun.
1971
Substitutes, complements and ripples in network flows. Zbl 0577.90024
Granot, Frieda; Veinott, Arthur F. jun.
1985
Computing a graph’s period quadratically by node condensation. Zbl 0258.05114
Balcer, Yves; Veinott, Arthur F. jun.
1973
The optimal inventory policy for batch ordering. Zbl 0138.15901
Veinott, Arthur F. jun.
1965
Optimal policy for a dynamic multi-echelon inventory model. Zbl 0154.19901
Bessler, S. A.; Veinott, Arthur F. jun.
1966
Representation of general and polyhedral subsemilattices and sublattices of product spaces. Zbl 0669.06002
Veinott, Arthur F. jun.
1989
Constrained Markov decision chains. Zbl 0246.90051
Derman, Cyrus; Veinott, Arthur F. jun.
1972
A solution to a countable system of equations arising in Markovian decision processes. Zbl 0171.16004
Derman, C.; Veinott, Arthur F. jun.
1967
Sequential stochastic core of a cooperative stochastic programming game. Zbl 1286.91018
Xu, Ningxiong; Veinott, Arthur F.
2013
Existence and characterization of minima of concave functions on unbounded convex sets. Zbl 0584.90085
Veinott, Arthur F. jun.
1985
Mathematics of the decision sciences. Part 2. Proc. 5th Summer Semin. Stanford 1967. Zbl 0177.29401
1968
Staircase transportation problems with superadditive rewards and cumulative capacities. Zbl 0799.90091
Hoffman, Alan J.; Veinott, Arthur F. jun.
1993
Markov decision chains. Zbl 0348.90128
Veinott, Arthur F. jun.
1974
Mathematics of the decision sciences. Part 1. Proceedings of the 5th Summer School Seminar, Stanford 1967. Zbl 0179.30702
1968
Discovering hidden totally Leontief substitution systems. Zbl 0384.90080
Dantzig, George B.; Veinott, Arthur F. jun.
1978
Maximum-stopping-value policies in finite Markov population decision chains. Zbl 1325.60060
Eaves, B. Curtis; Veinott, Arthur F. jun.
2014
Maximum-stopping-value policies in finite Markov population decision chains. Zbl 1325.60060
Eaves, B. Curtis; Veinott, Arthur F. jun.
2014
Sequential stochastic core of a cooperative stochastic programming game. Zbl 1286.91018
Xu, Ningxiong; Veinott, Arthur F.
2013
Staircase transportation problems with superadditive rewards and cumulative capacities. Zbl 0799.90091
Hoffman, Alan J.; Veinott, Arthur F. jun.
1993
Representation of general and polyhedral subsemilattices and sublattices of product spaces. Zbl 0669.06002
Veinott, Arthur F. jun.
1989
Send-and-split method for minimum-concave-cost network flows. Zbl 0667.90036
Erickson, Ranel E.; Monma, Clyde L.; Veinott, Arthur F. jun.
1987
The multi-armed bandit problem: Decomposition and computation. Zbl 0618.90097
Katehakis, Michael N.; Veinott, Arthur F. jun.
1987
Substitutes, complements and ripples in network flows. Zbl 0577.90024
Granot, Frieda; Veinott, Arthur F. jun.
1985
Existence and characterization of minima of concave functions on unbounded convex sets. Zbl 0584.90085
Veinott, Arthur F. jun.
1985
Discovering hidden totally Leontief substitution systems. Zbl 0384.90080
Dantzig, George B.; Veinott, Arthur F. jun.
1978
Markov decision chains. Zbl 0348.90128
Veinott, Arthur F. jun.
1974
Computing a graph’s period quadratically by node condensation. Zbl 0258.05114
Balcer, Yves; Veinott, Arthur F. jun.
1973
Polyhedral sets having a least element. Zbl 0245.90015
Cottle, Richard W.; Veinott, Arthur F. jun.
1972
Constrained Markov decision chains. Zbl 0246.90051
Derman, Cyrus; Veinott, Arthur F. jun.
1972
Least $$d$$-majorized network flows with inventory and statistical applications. Zbl 0239.90014
Veinott, Arthur F. jun.
1971
Discrete dynamic programming with sensitive discount optimality criteria. Zbl 0183.49102
Veinott, Arthur F. jun.
1969
Minimum concave-cost solution of Leontief substitution models of multi- facility inventory systems. Zbl 0175.17602
Veinott, Arthur F. jun.
1969
Discrete dynamic programming with a small interest rate. Zbl 0175.47302
Miller, B. L.; Veinott, Arthur F. jun.
1969
Optimality of myopic inventory policies for several substitute products. Zbl 0172.44101
Ignall, Edward; Veinott, Arthur F. jun.
1969
Integral extreme points. Zbl 0162.33401
Veinott, Arthur F. jun.; Dantzig, G. B.
1968
Extreme points of Leontief substitution systems. Zbl 0174.51503
Veinott, Arthur F. jun.
1968
Mathematics of the decision sciences. Part 2. Proc. 5th Summer Semin. Stanford 1967. Zbl 0177.29401
1968
Mathematics of the decision sciences. Part 1. Proceedings of the 5th Summer School Seminar, Stanford 1967. Zbl 0179.30702
1968
On the convergence of some feasible direction algorithms for nonlinear programming. Zbl 0158.18805
Topkis, D. M.; Veinott, Arthur F. jun.
1967
The supporting hyperplane method for unimodal programming. Zbl 0147.38604
Veinott, Arthur F. jun.
1967
A solution to a countable system of equations arising in Markovian decision processes. Zbl 0171.16004
Derman, C.; Veinott, Arthur F. jun.
1967
On the optimality of (s,S) inventory policies. New conditions and a new proof. Zbl 0173.47603
Veinott, Arthur F. jun.
1966
The status of mathematical inventory theory. Zbl 0143.21801
Veinott, Arthur F. jun.
1966
On finding optimal policies in discrete dynamic programming with no discounting. Zbl 0149.16301
Veinott, Arthur F. jun.
1966
Optimal policy for a dynamic multi-echelon inventory model. Zbl 0154.19901
Bessler, S. A.; Veinott, Arthur F. jun.
1966
Optimal policy for a multi-product, dynamic, nonstationary inventory problem. Zbl 0143.21703
Veinott, Arthur F. jun.
1965
Computing optimal (s, S) inventory policies. Zbl 0137.14102
Veinott, Arthur F. jun.; Wagner, H. M.
1965
Optimal policy in a dynamic, single product, nonstationary inventory model with several demand classes. Zbl 0143.21704
Veinott, Arthur F. jun.
1965
The optimal inventory policy for batch ordering. Zbl 0138.15901
Veinott, Arthur F. jun.
1965
Optimal capacity scheduling. I, II. Zbl 0113.14301
Veinott, Arthur F. jun.; Wagner, H. M.
1962
all top 5
Cited by 1,183 Authors
11 Federgruen, Awi 10 Jian, Jinbao 10 Katehakis, Michael N. 10 Schweitzer, Paul J. 9 Kostreva, Michael M. 8 Feinberg, Eugene Aleksandrovich 6 Chen, Shaoxiang 6 Glazebrook, Kevin D. 6 Guo, Xianping 6 Provan, J. Scott 6 Sethi, Suresh P. 6 Tang, Chunming 5 Chen, Frank Youhua 5 Chiang, Chi 5 Dekker, Rommert 5 Flynn, James O. 5 Hernández-Lerma, Onésimo 5 Hordijk, Arie 5 Hu, Qingjie 5 Kallenberg, Lodewijk C. M. 5 Konno, Hiroshi 5 Sladký, Karel 5 Tuy, Hoang 5 Van Ackooij, Wim 5 Veinott, Arthur F. jun. 4 Beyer, Dirk 4 Bisi, Arnab 4 Çetinkaya, Sıla 4 Chandrasekaran, Ramaswamy 4 Dada, Maqbool 4 Horst, Reiner 4 Lambrecht, Marc R. 4 Lee, Chung-Yee 4 Mahjoub, Ali Ridha 4 Mine, Hisashi 4 Nemhauser, George L. 4 Niedermeier, Rolf 4 Pang, Jong-Shi 4 Pardalos, Panos M. 4 Parlar, Mahmut 4 Rothblum, Uriel George 4 Shen, Zuo-Jun Max 4 Simchi-Levi, David 4 Thonemann, Ulrich Wilhelm 4 Truemper, Klaus 4 Westerlund, Tapio 4 Xu, Jianjun 4 Xu, Yifan 4 Zheng, Haiyan 3 Axsäter, Sven 3 Benkherouf, Lakdere 3 Bienstock, Daniel 3 Boute, Robert N. 3 Chen, Xibin 3 Cheng, Tai-Chiu Edwin 3 Chew, Ek Peng 3 Chung, Chia-Shin 3 Ebiefung, Aniekan A. 3 Eronen, Ville-Pekka 3 Feng, Yi 3 Gavalec, Martin 3 Guisewite, Geoffrey M. 3 Güllü, Refik 3 Guo, Jiong 3 Hearn, Donald W. 3 Hochbaum, Dorit S. 3 Iida, Tetsuo 3 Kronqvist, Jan 3 Lamond, Bernard F. 3 Liang, Yan 3 Mäkelä, Marko Mikael 3 Mendelssohn, Roy 3 Migdalas, Athanasios 3 Plavka, Ján 3 Polak, Elijah (Lucien) 3 Powell, Warren Buckler 3 Prieto-Rumeau, Tomás 3 Romeijn, H. Edwin 3 Roundy, Robin O. 3 Sobel, Matthew J. 3 Sonin, Isaac M. 3 Subramani, Krishnan 3 Suchý, Ondřej 3 Tamir, Arie 3 Teunter, Ruud H. 3 van Houtum, Geert-Jan 3 Waldmann, Karl-Heinz 3 Wang, Yunzeng 3 White, Douglas John 3 Xu, Ningxiong 3 Xu, Yanyi 3 Yang, Jian 3 Yu, Huizhen 3 Yu, Jonas C. P. 3 Zhang, Junyu 3 Zhu, Quanxin 3 Zhu, Zhibin 2 Ahmed, Shabbir 2 Ahuja, Vishal 2 Altman, Eitan ...and 1,083 more Authors
all top 5
Cited in 143 Serials
113 European Journal of Operational Research 44 Annals of Operations Research 42 Operations Research Letters 34 Journal of Optimization Theory and Applications 28 Journal of Mathematical Analysis and Applications 27 Linear Algebra and its Applications 24 Mathematical Programming 24 Mathematical Programming. Series A. Series B 18 Operations Research 18 Computers & Operations Research 15 Journal of Global Optimization 15 Probability in the Engineering and Informational Sciences 14 Discrete Applied Mathematics 14 Applied Mathematics and Computation 14 Naval Research Logistics 13 Optimization 12 Zeitschrift für Operations Research. Serie A: Theorie 10 OR Spektrum 9 Automatica 8 Mathematics of Operations Research 8 Asia-Pacific Journal of Operational Research 8 Stochastic Processes and their Applications 8 ZOR. Zeitschrift für Operations Research 7 Discrete Mathematics 7 Stochastic Analysis and Applications 7 International Journal of Production Research 7 Discrete Optimization 6 Mathematical Methods of Operations Research 6 Naval Research Logistics Quarterly 5 Journal of Applied Probability 5 Journal of Computational and Applied Mathematics 5 Kybernetika 5 Networks 5 Theoretical Computer Science 5 SIAM Journal on Algebraic and Discrete Methods 5 Applied Mathematical Modelling 4 International Journal of Systems Science 4 Journal of Economic Theory 4 Journal of Information & Optimization Sciences 4 SIAM Journal on Optimization 4 Computational Optimization and Applications 4 INFORMS Journal on Computing 4 Journal of Systems Science and Complexity 4 OR Spectrum 4 Journal of Discrete Algorithms 3 Mathematical Biosciences 3 Journal of Soviet Mathematics 3 Opsearch 3 SIAM Journal on Control and Optimization 3 Systems & Control Letters 3 Algorithmica 3 Mathematical and Computer Modelling 3 Queueing Systems 3 Optimization Methods & Software 3 Journal of Industrial and Management Optimization 2 Advances in Applied Probability 2 Computers & Mathematics with Applications 2 Applied Mathematics and Optimization 2 Journal of Combinatorial Theory. Series B 2 Journal of Computer and System Sciences 2 Statistica Neerlandica 2 Theory and Decision 2 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 2 Acta Applicandae Mathematicae 2 The Annals of Applied Probability 2 Discrete Event Dynamic Systems 2 Cybernetics and Systems Analysis 2 Annals of Mathematics and Artificial Intelligence 2 Constraints 2 Mathematical Problems in Engineering 2 Optimization and Engineering 2 RAIRO. Operations Research 2 Computational Management Science 2 Journal of the Operations Research Society of China 1 Acta Informatica 1 Bulletin of the Australian Mathematical Society 1 Communications in Algebra 1 Computer Methods in Applied Mechanics and Engineering 1 International Journal of General Systems 1 Information Processing Letters 1 Journal of Mathematical Physics 1 Journal of the Mechanics and Physics of Solids 1 Annals of the Institute of Statistical Mathematics 1 Fuzzy Sets and Systems 1 Information Sciences 1 Journal of Combinatorial Theory. Series A 1 Journal of Mathematical Psychology 1 Journal of Multivariate Analysis 1 Kybernetes 1 Meccanica 1 Numerical Functional Analysis and Optimization 1 Numerische Mathematik 1 SIAM Journal on Computing 1 Transactions of the American Mathematical Society 1 Optimal Control Applications & Methods 1 Cybernetics and Systems 1 Rendiconti di Matematica e delle sue Applicazioni. Serie VII 1 Mathematical Social Sciences 1 Statistics & Probability Letters 1 Statistics ...and 43 more Serials
all top 5
Cited in 32 Fields
655 Operations research, mathematical programming (90-XX) 80 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 77 Numerical analysis (65-XX) 70 Probability theory and stochastic processes (60-XX) 54 Computer science (68-XX) 47 Systems theory; control (93-XX) 43 Combinatorics (05-XX) 36 Linear and multilinear algebra; matrix theory (15-XX) 36 Calculus of variations and optimal control; optimization (49-XX) 18 Convex and discrete geometry (52-XX) 18 Statistics (62-XX) 7 Approximations and expansions (41-XX) 7 Biology and other natural sciences (92-XX) 5 Order, lattices, ordered algebraic structures (06-XX) 3 Partial differential equations (35-XX) 3 Dynamical systems and ergodic theory (37-XX) 3 Functional analysis (46-XX) 3 Information and communication theory, circuits (94-XX) 2 Mathematical logic and foundations (03-XX) 2 General algebraic systems (08-XX) 2 Number theory (11-XX) 2 Operator theory (47-XX) 2 Mechanics of deformable solids (74-XX) 1 History and biography (01-XX) 1 Algebraic geometry (14-XX) 1 Real functions (26-XX) 1 Ordinary differential equations (34-XX) 1 Sequences, series, summability (40-XX) 1 Integral equations (45-XX) 1 Manifolds and cell complexes (57-XX) 1 Classical thermodynamics, heat transfer (80-XX) 1 Quantum theory (81-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.
| 2023-02-02T13:53:55 |
{"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.514488160610199, "perplexity": 12162.445765499537}, "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-06/segments/1674764500028.12/warc/CC-MAIN-20230202133541-20230202163541-00036.warc.gz"}
|
https://indico.fnal.gov/event/19348/contributions/186471/
|
# Neutrino 2020
June 22, 2020 to July 2, 2020
US/Central timezone
## Minimal three-loop neutrino mass models and charged lepton flavor violation
Not scheduled
10m
Poster
### Speaker
Mr Ricardo Cepedello (IFIC, CSIC/Univ. Valencia)
### Description
We study charged lepton flavor violation for the three most popular minimal three-loop Majorana neutrino mass models. We call these models “minimal” since their particle content correspond to the minimal particle contents for which genuine three-loop models can be constructed. In all the three minimal models the neutrino mass matrix is proportional to some powers of standard model lepton masses, providing additional suppression factors on top of the expected loop suppression. To correctly explain neutrino masses, large Yukawa couplings are needed in these models. We calculate charged lepton flavor violating observables and find that the three minimal models survive the current constraints only in very small regions of their parameter spaces. Only particular choices of the Dirac and Majorana phases survive the current constraints for a narrow range of the lightest neutrino mass.
### Mini-abstract
Severely constraining the parameter space of minimal three-loop Majorana neutrino mass models
### Primary authors
Dr Avelino Vicente (IFIC, CISC/Univ. Valencia) Dr Martin Hirsch (IFIC/CSIC University of Valencia) Dr Paulina Rocha-Morán (Universität Bonn) Mr Ricardo Cepedello (IFIC, CSIC/Univ. Valencia)
| 2022-11-28T09:07:36 |
{"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.8420091271400452, "perplexity": 5608.937607383586}, "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/1669446710488.2/warc/CC-MAIN-20221128070816-20221128100816-00427.warc.gz"}
|
https://zbmath.org/authors/?s=0&q=Birman%2C+Joan
|
## Birman, Joan S.
Compute Distance To:
Author ID: birman.joan-s Published as: Birman, Joan S.; Birman, J. S.; Birman, Joan; Birman, J. more...less Further Spellings: Birman, Joan Sylvia Lyttle Homepage: https://www.math.columbia.edu/~jb/ External Links: Women in Mathematics · Celebratio Mathematica · MacTutor · MGP · Wikidata · GND · IdRef
Documents Indexed: 101 Publications since 1969, including 2 Books 6 Contributions as Editor · 4 Further Contributions Biographic References: 7 Publications Co-Authors: 56 Co-Authors with 75 Joint Publications 1,068 Co-Co-Authors
all top 5
### Co-Authors
33 single-authored 15 Menasco, William W. 7 Hilden, Hugh Michael 5 Ko, Ki Hyoung 5 Series, Caroline 4 Kawauchi, Akio 3 Gebhardt, Volker 3 González-Meneses, Juan 3 Gordon, Cameron McA. 3 Jin, Gyo Taek 3 Kauffman, Louis Hirsch 3 Levine, Jerome P. 3 Magnus, Wilhelm 3 Matsumoto, Yukio 3 Wajnryb, Bronislaw 3 Wrinkle, Nancy C. 2 Brendle, Tara E. 2 Broaddus, Nathan 2 Craggs, Robert 2 Kanenobu, Taizo 2 Lee, Sangjin 2 Montesinos-Amilibia, José María 2 Moody, John Atwell 2 Williams, Robert F. 1 Abikoff, William 1 Baxter, Rodney J. 1 Bharathram, Vasudha 1 Bisch, Dietmar H. 1 Boldi, Paolo 1 Brinkmann, Peter 1 Cannon, James W. 1 Chandler, Bruce 1 Chillingworth, D. R. J. 1 Conder, Marsteon 1 Connes, Alain 1 de la Harpe, Pierre 1 Evans, David E. 1 Fenchel, Werner 1 Finkelstein, Elizabeth 1 Freedman, Michael Hartley 1 González Acuña, Francisco Javier 1 Goodman, Fred J. 1 Guionnet, Alice 1 Hansen, Vagn Lundsgaard 1 Hirsch, Michael D. 1 Izumi, Masaki 1 Jackson, Allyn 1 Jaffe, Arthur Michael 1 Johnson, Dennis L. 1 Kawahigashi, Yasuyuki 1 Kawamuro, Keiko 1 Kidwell, Mark Elliot 1 Kirby, Robion Cromwell 1 Kofman, Ilya 1 Kuiken, Kathryn 1 Landau, Susan Eva 1 Lehrer, Gustav Isaac 1 Libgober, Anatoly S. 1 Lin, Xiao-Song 1 Long, Darren D. 1 Longo, Roberto 1 Lubotzky, Alexander 1 Maeda, Toru 1 Margalit, Dan 1 Martin, Gaven J. 1 Marumoto, Yoshihiko 1 McCarthy, John D. 1 Miyazaki, Katura 1 Morse, Matthew J. 1 Murakami, Hitoshi 1 Nakanishi, Yasutaka 1 Nielsen, Jakob 1 Pless, Vera S. 1 Popa, Sorin Teodor 1 Powell, Jerome L. 1 Putman, Andrew 1 Rampichini, Marta 1 Ratcliffe, John G. 1 Reshetikhin, Nikolai Yu. 1 Rubinstein, J. Hyam 1 Saito, Masa-Hiko 1 Sakuma, Makoto 1 Sekine, Mituhiro 1 Shibuya, Tetsuo 1 Shlyakhtenko, Dimitri L. 1 Skandalis, Georges 1 Srinivasan, Bhama 1 Sutherland, Colin E. 1 Suzuki, Shin’ichi 1 Taylor, Jean Ellen 1 Teicher, Mina 1 Tepper Haimo, Deborah 1 Trapp, Rolland 1 Traynor, Lisa 1 Vigna, Sebastiano 1 Wenzl, Hans 1 Witten, Edward 1 Woodin, W. Hugh 1 Zieschang, Heiner
all top 5
### Serials
8 Journal of Knot Theory and its Ramifications 6 Communications on Pure and Applied Mathematics 5 Proceedings of the American Mathematical Society 5 Bulletin of the American Mathematical Society 4 Topology 4 Transactions of the American Mathematical Society 4 Notices of the American Mathematical Society 3 Israel Journal of Mathematics 3 Advances in Mathematics 3 Inventiones Mathematicae 3 Pacific Journal of Mathematics 3 Geometry & Topology 2 Geometriae Dedicata 2 Mathematische Annalen 2 Michigan Mathematical Journal 2 Topology and its Applications 2 Bulletin of the American Mathematical Society. New Series 2 Annals of Mathematics. Second Series 2 Contemporary Mathematics 2 Groups, Geometry, and Dynamics 2 Journal of Topology and Analysis 1 Arkhimedes 1 The Mathematical Intelligencer 1 Archiv der Mathematik 1 Canadian Journal of Mathematics 1 Duke Mathematical Journal 1 Journal of Algebra 1 Journal of Differential Geometry 1 Journal of the London Mathematical Society. Second Series 1 Journal of Pure and Applied Algebra 1 Proceedings of the London Mathematical Society. Third Series 1 Mitteilungen der Mathematischen Gesellschaft in Hamburg 1 Communications in Contemporary Mathematics 1 Journal of the Australian Mathematical Society 1 Proceedings of the Cambridge Philosophical Society 1 Annals of Mathematics Studies 1 Journal of Topology 1 Involve 1 Contemporary Mathematicians 1 RIMS Kokyuroku
all top 5
### Fields
86 Manifolds and cell complexes (57-XX) 36 Group theory and generalizations (20-XX) 9 General and overarching topics; collections (00-XX) 7 Algebraic topology (55-XX) 6 History and biography (01-XX) 6 Functions of a complex variable (30-XX) 6 Computer science (68-XX) 5 Dynamical systems and ergodic theory (37-XX) 4 Differential geometry (53-XX) 2 Ordinary differential equations (34-XX) 1 Mathematical logic and foundations (03-XX) 1 Combinatorics (05-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Number theory (11-XX) 1 Algebraic geometry (14-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Associative rings and algebras (16-XX) 1 Several complex variables and analytic spaces (32-XX) 1 Geometry (51-XX) 1 General topology (54-XX) 1 Global analysis, analysis on manifolds (58-XX) 1 Quantum theory (81-XX)
### Citations contained in zbMATH Open
88 Publications have been cited 2,189 times in 1,598 Documents Cited by Year
Braids, links, and mapping class groups. Based on lecture notes by James Cannon. Zbl 0305.57013
Birman, Joan S.
1975
A new approach to the word and conjugacy problems in the braid groups. Zbl 0937.20016
Birman, Joan; Ko, Ki Hyoung; Lee, Sang Jin
1998
Knot polynomials and Vassiliev’s invariants. Zbl 0812.57011
Birman, Joan S.; Lin, Xiao-Song
1993
Braids, link polynomials and a new algebra. Zbl 0684.57004
Birman, Joan S.; Wenzl, Hans
1989
New points of view in knot theory. Zbl 0785.57001
Birman, Joan S.
1993
Knotted periodic orbits in dynamical systems. I: Lorenz’s equations. Zbl 0507.58038
Birman, Joan S.; Williams, R. F.
1983
Mapping class groups and their relationship to braid groups. Zbl 0167.21503
Birman, J. S.
1969
Abelian and solvable subgroups of the mapping class group. Zbl 0551.57004
Birman, Joan S.; Lubotzky, Alex; McCarthy, John
1983
Mapping class groups of surfaces: a survey. Zbl 0297.57001
Birman, Joan S.
1974
Knotted periodic orbits in dynamical systems. II: Knot holders for fibered knots. Zbl 0526.58043
Birman, Joan S.; Williams, R. F.
1983
Studying links via closed braids. III: Classifying links which are closed 3-braids. Zbl 0813.57010
Birman, Joan S.; Menasco, William W.
1993
On braid groups. Zbl 0157.30904
Birman, Joan S.
1969
On isotopies of homeomorphisms of Riemann surfaces. Zbl 0237.57001
Birman, Joan S.; Hilden, Hugh M.
1973
On the mapping class groups of closed surfaces as covering spaces. Zbl 0217.48602
Birman, J. S.; Hilden, H. M.
1971
Braids: a survey. Zbl 1094.57006
Birman, Joan S.; Brendle, Tara E.
2005
Birman, Joan S.; Menasco, William W.
1990
Geodesics with bounded intersection number on surfaces are sparsely distributed. Zbl 0568.57006
Birman, Joan S.; Series, Caroline
1985
Heegaard splittings of branched coverings of $$S^3$$. Zbl 0312.55004
Birman, Joan S.; Hilden, Hugh M.
1975
On Siegel’s modular group. Zbl 0208.10601
Birman, J. S.
1971
The $$\mu$$-invariant of 3-manifolds and certain structural properties of the group of homeomorphisms of a closed, oriented 2-manifold. Zbl 0383.57006
Birman, Joan S.; Craggs, R.
1978
Birman, Joan S.; Menasco, William W.
1992
Stabilization in the braid groups. II. Transversal simplicity of knots. Zbl 1130.57005
Birman, Joan S.; Menasco, William W.
2006
On the homeotopy group of a non-orientable surface. Zbl 0232.57001
Birman, Joan S.; Chillingworth, D. R. J.
1972
Birman, Joan S.
1973
On the Jones polynomial of closed 3-braids. Zbl 0588.57005
Birman, Joan S.
1985
Conjugacy in Garside groups. I: Cyclings, powers and rigidity. Zbl 1160.20026
Birman, Joan S.; Gebhardt, Volker; González-Meneses, Juan
2007
Special positions for essential tori in link complements. Zbl 0833.57004
Birman, Joan S.; Menasco, William W.
1994
On the stable equivalence of plat representations of knots and links. Zbl 0339.55005
Birman, Joan S.
1976
Conjugacy in Garside groups. III: Periodic braids. Zbl 1165.20031
Birman, Joan S.; Gebhardt, Volker; González-Meneses, Juan
2007
Heegard splittings of prime 3-manifolds are not unique. Zbl 0321.57004
Birman, Joan S.; Gonzalez-Acuna, F.; Montesinos, José María
1976
Studying links via closed braids. VI: A non-finiteness theorem. Zbl 0739.57002
Birman, Joan S.; Menasco, William W.
1992
Studying surfaces via closed braids. Zbl 0907.57006
Birman, Joan S.; Finkelstein, Elizabeth
1998
The infimum, supremum, and geodesic length of a braid conjugacy class. Zbl 1063.20039
Birman, Joan S.; Ko, Ki Hyoung; Lee, Sang Jin
2001
Stabilization in the braid groups. I: MTWS. Zbl 1128.57003
Birman, Joan S.; Menasco, William W.
2006
An algorithm for simple curves on surfaces. Zbl 0507.57006
Birman, Joan S.; Series, Caroline
1984
Studying links via closed braids. I: A finiteness theorem. Zbl 0724.57001
Birman, Joan S.; Menasco, William W.
1992
On transversally simple knots. Zbl 1026.57005
Birman, Joan S.; Wrinkle, Nancy C.
2000
Lifting and projecting homeomorphisms. Zbl 0247.55001
Birman, Joan S.; Hilden, Hugh M.
1972
A note on closed 3-braids. Zbl 1158.57006
Birman, Joan S.; Menasco, William W.
2008
Studying links via closed braids. II: On a theorem of Bennequin. Zbl 0722.57001
Birman, Joan S.; Menasco, William W.
1991
A new algorithm for recognizing the unknot. Zbl 0955.57005
Birman, Joan S.; Hirsch, Michael D.
1998
Conjugacy in Garside groups. II: Structure of the ultra summit set. Zbl 1163.20023
Birman, Joan S.; Gebhardt, Volker; Gonzáles-Meneses, Juan
2008
A new twist on Lorenz links. Zbl 1233.57001
Birman, Joan; Kofman, Ilya
2009
Dehn’s algorithm revisited, with applications to simple curves on surfaces. Zbl 0624.20033
Birman, Joan S.; Series, Caroline
1987
On the equivalence of Heegaard splittings of closed, orientable 3- manifolds. Zbl 0337.57002
Birman, Joan S.
1975
Automorphisms of the fundamental group of a closed, orientable 2- manifolds. Zbl 0175.50103
Birman, J. S.
1969
One-sided Heegaard splittings and homeotopy groups of some 3-manifolds. Zbl 0527.57003
Rubinstein, J. H.; Birman, J. S.
1984
The homeomorphism problem for S$$^3$$. Zbl 0272.57001
Birman, Joan S.; Hilden, Hugh M.
1973
Efficient geodesics and an effective algorithm for distance in the complex of curves. Zbl 1350.05022
Birman, Joan; Margalit, Dan; Menasco, William
2016
Algebraic linearity for an automorphism of a surface group. Zbl 0646.57007
Birman, Joan S.; Series, Caroline
1988
Isotopies of homeomorphisms of Riemann surfaces and a theorem about Artin’s braid group. Zbl 0255.57002
Birman, Joan S.; Hilden, Hugh M.
1972
On Markov’s theorem. Zbl 1059.57002
Birman, Joan S.; Menasco, William W.
2002
Finite-dimensional representations of Artin’s braid group. Zbl 0847.20035
Birman, J. S.; Long, D. D.; Moody, J. A.
1994
The topology of 3-manifolds, Heegaard distance and the mapping class group of a 2-manifold. Zbl 1304.57033
Birman, Joan S.
2006
Jones’ braid-plat formula and a new surgery triple. Zbl 0643.57007
Birman, Joan S.; Kanenobu, Taizo
1988
Fixed points of pseudo-Anosov diffeomorphisms of surfaces. Zbl 0508.55001
Birman, Joan S.; Kidwell, Mark E.
1982
Holonomic and Legendrian parametrizations of knots. Zbl 1001.57015
Birman, Joan S.; Wrinkle, Nancy C.
2000
On minimal Heegaard splittings. Zbl 0436.57003
Birman, Joan S.; Montesinos, José María
1980
Errata: Presentations of the mapping class group. Zbl 0811.57019
Birman, Joan S.; Wajnryb, Bronislaw
1994
Finite rigid sets and homologically nontrivial spheres in the curve complex of a surface. Zbl 1308.57009
Birman, Joan; Broaddus, Nathan; Menasco, William
2015
Mapping class groups of surfaces. Zbl 0663.57008
Birman, Joan S.
1988
Markov classes in certain finite quotients of Artin’s braid group. Zbl 0621.20025
Birman, Joan S.; Wajnryb, Bronislaw
1986
Poincaré’s conjecture and the homeotopy group of a closed orientable 2- manifold. Zbl 0282.55003
Birman, Joan S.
1974
Abelian quotients of the mapping class group of a 2-manifold. Zbl 0191.22401
Birman, J. S.
1970
The curve complex has dead ends. Zbl 1335.57031
Birman, Joan S.; Menasco, William W.
2015
Plat presentations for link groups. Zbl 0266.20027
Birman, Joan S.
1973
Erratum to ‘Isotopies of homeomorphisms of Riemann surfaces’. Zbl 1420.57053
Birman, Joan S.; Hilden, Hugh M.
2017
Recent developments in braid and link theory. Zbl 0713.57002
Birman, Joan S.
1991
Non-conjugate braids can define isotopic knots. Zbl 0187.45502
Birman, J. S.
1969
On the combinatorics of Vassiliev invariants. Zbl 0938.57004
Birman, Joan S.
1994
Polynomial invariants of pseudo-Anosov maps. Zbl 1268.57002
Birman, Joan; Brinkmann, Peter; Kawamuro, Keiko
2012
3-fold branched coverings and the mapping class group of a surface. Zbl 0589.57009
Birman, Joan S.; Wajnryb, Bronislaw
1985
A normal form in the homeotopy group of a surface of genus 2, with applications to 3-manifolds. Zbl 0253.55001
Birman, Joan S.
1972
Towards an implementation of the B-H algorithm for recognizing the unknot. Zbl 1007.57004
Birman, Joan S.; Rampichini, Marta; Boldi, Paolo; Vigna, Sebastiano
2002
Braids. Proceedings of the AMS-IMS-SIAM joint summer research conference on Artin’s braid group, University of California, Santa Cruz, CA, USA, July 13–26, 1986. Zbl 0651.00010
1988
Studying links via closed braids. Zbl 0835.57002
Birman, Joan
1994
Braided chord diagrams. Zbl 0896.57003
Birman, Joan S.; Trapp, Rolland
1998
Collected mathematical papers. Volume 1 (1913–1932). Volume 2 (1932–1955). Ed. for the Danish Mathematical Society by Vagn Lundsgaard Hansen. Zbl 0609.01050
Nielsen, Jakob
1986
Calculating the image of the second Johnson-Morita representation. Zbl 1183.57016
Birman, Joan S.; Brendle, Tara E.; Broaddus, Nathan
2008
Discriminant and projective invariants of binary forms. Zbl 0189.55002
Birman, J.; Magnus, W.
1970
Knots 2000 Korea. Vol. 2. Proceedings of the conference held jointly with the 8th Korea-Japan school of knots and links in Yongpyong, Korea, July 31–August 5, 2000. Zbl 0995.00511
2002
A representation theorem for fibered knots and their monodromy maps. Zbl 0406.57004
Birman, Joan S.
1979
Sepcial Heegaard splittings for closed, oriented 3-manifolds. Zbl 0412.57009
Birman, Joan S.
1978
Obstructions to trivializing a knot. Zbl 1074.57002
Birman, Joan S.; Moody, John Atwell
2004
The mathematical legacy of Wilhelm Magnus. Groups, geometry and special functions. Conference on the legacy of Wilhelm Magnus, May 1-3, 1992, Polytechnic Univ. Brooklyn, NY, USA. Zbl 0801.00023
1994
Book review of: Christian Kassel and Vladimir Turaev, Braid groups; Patrick Dehornoy, Ivan Dynnikov, Dale Rolfsen and Bert Wiest, Ordering braids. Zbl 1292.00013
Birman, Joan S.
2011
Erratum to ’Abelian quotients of the mapping class group of a 2-manifold’. Zbl 0213.25001
Birman, J. S.
1971
A note on the construction of simply-connected 3-manifolds as branched covering spaces of $$S^3$$. Zbl 0325.55003
Birman, Joan S.
1976
Erratum to ‘Isotopies of homeomorphisms of Riemann surfaces’. Zbl 1420.57053
Birman, Joan S.; Hilden, Hugh M.
2017
Efficient geodesics and an effective algorithm for distance in the complex of curves. Zbl 1350.05022
Birman, Joan; Margalit, Dan; Menasco, William
2016
Finite rigid sets and homologically nontrivial spheres in the curve complex of a surface. Zbl 1308.57009
Birman, Joan; Broaddus, Nathan; Menasco, William
2015
The curve complex has dead ends. Zbl 1335.57031
Birman, Joan S.; Menasco, William W.
2015
Polynomial invariants of pseudo-Anosov maps. Zbl 1268.57002
Birman, Joan; Brinkmann, Peter; Kawamuro, Keiko
2012
Book review of: Christian Kassel and Vladimir Turaev, Braid groups; Patrick Dehornoy, Ivan Dynnikov, Dale Rolfsen and Bert Wiest, Ordering braids. Zbl 1292.00013
Birman, Joan S.
2011
A new twist on Lorenz links. Zbl 1233.57001
Birman, Joan; Kofman, Ilya
2009
A note on closed 3-braids. Zbl 1158.57006
Birman, Joan S.; Menasco, William W.
2008
Conjugacy in Garside groups. II: Structure of the ultra summit set. Zbl 1163.20023
Birman, Joan S.; Gebhardt, Volker; Gonzáles-Meneses, Juan
2008
Calculating the image of the second Johnson-Morita representation. Zbl 1183.57016
Birman, Joan S.; Brendle, Tara E.; Broaddus, Nathan
2008
Conjugacy in Garside groups. I: Cyclings, powers and rigidity. Zbl 1160.20026
Birman, Joan S.; Gebhardt, Volker; González-Meneses, Juan
2007
Conjugacy in Garside groups. III: Periodic braids. Zbl 1165.20031
Birman, Joan S.; Gebhardt, Volker; González-Meneses, Juan
2007
Stabilization in the braid groups. II. Transversal simplicity of knots. Zbl 1130.57005
Birman, Joan S.; Menasco, William W.
2006
Stabilization in the braid groups. I: MTWS. Zbl 1128.57003
Birman, Joan S.; Menasco, William W.
2006
The topology of 3-manifolds, Heegaard distance and the mapping class group of a 2-manifold. Zbl 1304.57033
Birman, Joan S.
2006
Braids: a survey. Zbl 1094.57006
Birman, Joan S.; Brendle, Tara E.
2005
Obstructions to trivializing a knot. Zbl 1074.57002
Birman, Joan S.; Moody, John Atwell
2004
On Markov’s theorem. Zbl 1059.57002
Birman, Joan S.; Menasco, William W.
2002
Towards an implementation of the B-H algorithm for recognizing the unknot. Zbl 1007.57004
Birman, Joan S.; Rampichini, Marta; Boldi, Paolo; Vigna, Sebastiano
2002
Knots 2000 Korea. Vol. 2. Proceedings of the conference held jointly with the 8th Korea-Japan school of knots and links in Yongpyong, Korea, July 31–August 5, 2000. Zbl 0995.00511
2002
The infimum, supremum, and geodesic length of a braid conjugacy class. Zbl 1063.20039
Birman, Joan S.; Ko, Ki Hyoung; Lee, Sang Jin
2001
On transversally simple knots. Zbl 1026.57005
Birman, Joan S.; Wrinkle, Nancy C.
2000
Holonomic and Legendrian parametrizations of knots. Zbl 1001.57015
Birman, Joan S.; Wrinkle, Nancy C.
2000
A new approach to the word and conjugacy problems in the braid groups. Zbl 0937.20016
Birman, Joan; Ko, Ki Hyoung; Lee, Sang Jin
1998
Studying surfaces via closed braids. Zbl 0907.57006
Birman, Joan S.; Finkelstein, Elizabeth
1998
A new algorithm for recognizing the unknot. Zbl 0955.57005
Birman, Joan S.; Hirsch, Michael D.
1998
Braided chord diagrams. Zbl 0896.57003
Birman, Joan S.; Trapp, Rolland
1998
Special positions for essential tori in link complements. Zbl 0833.57004
Birman, Joan S.; Menasco, William W.
1994
Finite-dimensional representations of Artin’s braid group. Zbl 0847.20035
Birman, J. S.; Long, D. D.; Moody, J. A.
1994
Errata: Presentations of the mapping class group. Zbl 0811.57019
Birman, Joan S.; Wajnryb, Bronislaw
1994
On the combinatorics of Vassiliev invariants. Zbl 0938.57004
Birman, Joan S.
1994
Studying links via closed braids. Zbl 0835.57002
Birman, Joan
1994
The mathematical legacy of Wilhelm Magnus. Groups, geometry and special functions. Conference on the legacy of Wilhelm Magnus, May 1-3, 1992, Polytechnic Univ. Brooklyn, NY, USA. Zbl 0801.00023
1994
Knot polynomials and Vassiliev’s invariants. Zbl 0812.57011
Birman, Joan S.; Lin, Xiao-Song
1993
New points of view in knot theory. Zbl 0785.57001
Birman, Joan S.
1993
Studying links via closed braids. III: Classifying links which are closed 3-braids. Zbl 0813.57010
Birman, Joan S.; Menasco, William W.
1993
Birman, Joan S.; Menasco, William W.
1992
Studying links via closed braids. VI: A non-finiteness theorem. Zbl 0739.57002
Birman, Joan S.; Menasco, William W.
1992
Studying links via closed braids. I: A finiteness theorem. Zbl 0724.57001
Birman, Joan S.; Menasco, William W.
1992
Studying links via closed braids. II: On a theorem of Bennequin. Zbl 0722.57001
Birman, Joan S.; Menasco, William W.
1991
Recent developments in braid and link theory. Zbl 0713.57002
Birman, Joan S.
1991
Birman, Joan S.; Menasco, William W.
1990
Braids, link polynomials and a new algebra. Zbl 0684.57004
Birman, Joan S.; Wenzl, Hans
1989
Algebraic linearity for an automorphism of a surface group. Zbl 0646.57007
Birman, Joan S.; Series, Caroline
1988
Jones’ braid-plat formula and a new surgery triple. Zbl 0643.57007
Birman, Joan S.; Kanenobu, Taizo
1988
Mapping class groups of surfaces. Zbl 0663.57008
Birman, Joan S.
1988
Braids. Proceedings of the AMS-IMS-SIAM joint summer research conference on Artin’s braid group, University of California, Santa Cruz, CA, USA, July 13–26, 1986. Zbl 0651.00010
1988
Dehn’s algorithm revisited, with applications to simple curves on surfaces. Zbl 0624.20033
Birman, Joan S.; Series, Caroline
1987
Markov classes in certain finite quotients of Artin’s braid group. Zbl 0621.20025
Birman, Joan S.; Wajnryb, Bronislaw
1986
Collected mathematical papers. Volume 1 (1913–1932). Volume 2 (1932–1955). Ed. for the Danish Mathematical Society by Vagn Lundsgaard Hansen. Zbl 0609.01050
Nielsen, Jakob
1986
Geodesics with bounded intersection number on surfaces are sparsely distributed. Zbl 0568.57006
Birman, Joan S.; Series, Caroline
1985
On the Jones polynomial of closed 3-braids. Zbl 0588.57005
Birman, Joan S.
1985
3-fold branched coverings and the mapping class group of a surface. Zbl 0589.57009
Birman, Joan S.; Wajnryb, Bronislaw
1985
An algorithm for simple curves on surfaces. Zbl 0507.57006
Birman, Joan S.; Series, Caroline
1984
One-sided Heegaard splittings and homeotopy groups of some 3-manifolds. Zbl 0527.57003
Rubinstein, J. H.; Birman, J. S.
1984
Knotted periodic orbits in dynamical systems. I: Lorenz’s equations. Zbl 0507.58038
Birman, Joan S.; Williams, R. F.
1983
Abelian and solvable subgroups of the mapping class group. Zbl 0551.57004
Birman, Joan S.; Lubotzky, Alex; McCarthy, John
1983
Knotted periodic orbits in dynamical systems. II: Knot holders for fibered knots. Zbl 0526.58043
Birman, Joan S.; Williams, R. F.
1983
Fixed points of pseudo-Anosov diffeomorphisms of surfaces. Zbl 0508.55001
Birman, Joan S.; Kidwell, Mark E.
1982
On minimal Heegaard splittings. Zbl 0436.57003
Birman, Joan S.; Montesinos, José María
1980
A representation theorem for fibered knots and their monodromy maps. Zbl 0406.57004
Birman, Joan S.
1979
The $$\mu$$-invariant of 3-manifolds and certain structural properties of the group of homeomorphisms of a closed, oriented 2-manifold. Zbl 0383.57006
Birman, Joan S.; Craggs, R.
1978
Sepcial Heegaard splittings for closed, oriented 3-manifolds. Zbl 0412.57009
Birman, Joan S.
1978
On the stable equivalence of plat representations of knots and links. Zbl 0339.55005
Birman, Joan S.
1976
Heegard splittings of prime 3-manifolds are not unique. Zbl 0321.57004
Birman, Joan S.; Gonzalez-Acuna, F.; Montesinos, José María
1976
A note on the construction of simply-connected 3-manifolds as branched covering spaces of $$S^3$$. Zbl 0325.55003
Birman, Joan S.
1976
Braids, links, and mapping class groups. Based on lecture notes by James Cannon. Zbl 0305.57013
Birman, Joan S.
1975
Heegaard splittings of branched coverings of $$S^3$$. Zbl 0312.55004
Birman, Joan S.; Hilden, Hugh M.
1975
On the equivalence of Heegaard splittings of closed, orientable 3- manifolds. Zbl 0337.57002
Birman, Joan S.
1975
Mapping class groups of surfaces: a survey. Zbl 0297.57001
Birman, Joan S.
1974
Poincaré’s conjecture and the homeotopy group of a closed orientable 2- manifold. Zbl 0282.55003
Birman, Joan S.
1974
On isotopies of homeomorphisms of Riemann surfaces. Zbl 0237.57001
Birman, Joan S.; Hilden, Hugh M.
1973
Birman, Joan S.
1973
The homeomorphism problem for S$$^3$$. Zbl 0272.57001
Birman, Joan S.; Hilden, Hugh M.
1973
Plat presentations for link groups. Zbl 0266.20027
Birman, Joan S.
1973
On the homeotopy group of a non-orientable surface. Zbl 0232.57001
Birman, Joan S.; Chillingworth, D. R. J.
1972
Lifting and projecting homeomorphisms. Zbl 0247.55001
Birman, Joan S.; Hilden, Hugh M.
1972
Isotopies of homeomorphisms of Riemann surfaces and a theorem about Artin’s braid group. Zbl 0255.57002
Birman, Joan S.; Hilden, Hugh M.
1972
A normal form in the homeotopy group of a surface of genus 2, with applications to 3-manifolds. Zbl 0253.55001
Birman, Joan S.
1972
On the mapping class groups of closed surfaces as covering spaces. Zbl 0217.48602
Birman, J. S.; Hilden, H. M.
1971
On Siegel’s modular group. Zbl 0208.10601
Birman, J. S.
1971
Erratum to ’Abelian quotients of the mapping class group of a 2-manifold’. Zbl 0213.25001
Birman, J. S.
1971
Abelian quotients of the mapping class group of a 2-manifold. Zbl 0191.22401
Birman, J. S.
1970
Discriminant and projective invariants of binary forms. Zbl 0189.55002
Birman, J.; Magnus, W.
1970
Mapping class groups and their relationship to braid groups. Zbl 0167.21503
Birman, J. S.
1969
On braid groups. Zbl 0157.30904
Birman, Joan S.
1969
Automorphisms of the fundamental group of a closed, orientable 2- manifolds. Zbl 0175.50103
Birman, J. S.
1969
Non-conjugate braids can define isotopic knots. Zbl 0187.45502
Birman, J. S.
1969
all top 5
### Cited by 1,500 Authors
31 Birman, Joan S. 24 Stoimenow, Alexander 22 González-Meneses, Juan 19 Ito, Tetsuya 19 Margalit, Dan 17 Guaschi, John 14 Menasco, William W. 13 Gonçalves, Daciberg Lima 13 Lee, Sangjin 12 Cavicchioli, Alberto 12 Putman, Andrew 11 Abdulrahim, Mohammad N. 11 Kanenobu, Taizo 11 Kawamuro, Keiko 11 Leininger, Christopher J. 11 Ohyama, Yoshiyuki 11 Paris, Luis 11 Wiest, Bertold 10 Dehornoy, Patrick 10 Letellier, Christophe 10 Sullivan, Michael C. 9 Aramayona, Javier 9 Brendle, Tara E. 9 Gebhardt, Volker 9 Park, Chan-Young 9 Rui, Hebing 9 Spaggiari, Fulvia 9 Szepietowski, Błażej 9 Wenzl, Hans 8 Elrifai, Elsayed A. 8 Franco, Nuno 8 Jeong, Myeong-Ju 8 Jones, Vaughan Frederick Randal 8 Lee, Eonkyung 8 Stukow, Michał 7 Ghrist, Robert W. 7 Goodman, Frederick M. 7 Kauffman, Louis Hirsch 7 Ko, Ki Hyoung 7 Lin, Xiao-Song 7 Orevkov, Stepan Yur’evich 7 Schleimer, Saul 7 Shpilrain, Vladimir 7 Vershinin, Vladimir V. 7 Zieschang, Heiner 6 Boileau, Michel Charles 6 Bokut, Leonid A. 6 Calvez, Matthieu 6 Dasbach, Oliver T. 6 East, James 6 Fromentin, Jean 6 Gilmore, Robert 6 Hirose, Susumu 6 Hu, Jun 6 Humphries, Stephen P. 6 Ito, Noboru 6 Lambropoulou, Sofia S. F. 6 Marin, Ivan 6 Murakami, Jun 6 Przytycki, Józef Henryk 6 Si, Mei 6 Taheri, Ali 6 Ushakov, Alexander S. 6 Williams, Robert F. 6 Zhang, Ruibin 5 Bataineh, Khaled 5 Brandenbursky, Michael 5 Chen, Lei 5 Corran, Ruth 5 Diao, Yuanan 5 Eisermann, Michael 5 Elhamdadi, Mohamed 5 Etnyre, John B. 5 Gobet, Thomas 5 Horiuchi, Sumiko 5 Kamada, Seiichi 5 Kent, Autumn Exum 5 Kozlovskaya, Tatyana Anatolevna 5 Le, Thang Tu Quoc 5 Lehrer, Gustav Isaac 5 Manturov, Vassiliĭ Olegovich 5 Morita, Shigeyuki 5 Ng, Lenhard L. 5 Ozawa, Makoto 5 Picantin, Matthieu 5 Roman’kov, Vitaly Anatol’evich 5 Rowell, Eric C. 5 Sato, Masatoshi 5 Series, Caroline 5 Telloni, Agnese Ilaria 4 Antony, Noelle 4 Atalan, Ferihe 4 Behrstock, Jason A. 4 Bessis, David 4 Bigelow, Stephen J. 4 Bonahon, Francis 4 Boyland, Philip L. 4 Ceniceros, Jose 4 Churchill, Indu R. U. 4 Cohen, Arjeh Marcel ...and 1,400 more Authors
all top 5
### Cited in 260 Serials
166 Journal of Knot Theory and its Ramifications 110 Topology and its Applications 62 Journal of Algebra 62 Transactions of the American Mathematical Society 62 Algebraic & Geometric Topology 55 Proceedings of the American Mathematical Society 41 Geometriae Dedicata 39 Geometry & Topology 36 Communications in Mathematical Physics 33 Mathematische Annalen 27 Advances in Mathematics 26 Journal of Pure and Applied Algebra 26 Mathematische Zeitschrift 21 Annales de l’Institut Fourier 21 Duke Mathematical Journal 20 Inventiones Mathematicae 19 Bulletin of the American Mathematical Society. New Series 18 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 16 Israel Journal of Mathematics 16 Mathematical Proceedings of the Cambridge Philosophical Society 16 Chaos, Solitons and Fractals 14 Osaka Journal of Mathematics 14 Journal of Mathematical Sciences (New York) 13 Groups, Geometry, and Dynamics 12 Communications in Algebra 12 Physica D 11 Journal für die Reine und Angewandte Mathematik 11 Journal of the American Mathematical Society 10 International Journal of Theoretical Physics 10 Comptes Rendus. Mathématique. Académie des Sciences, Paris 9 Journal of Mathematical Physics 9 Ergodic Theory and Dynamical Systems 9 International Journal of Algebra and Computation 8 Discrete Mathematics 8 Nuclear Physics. B 8 Archiv der Mathematik 8 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 8 St. Petersburg Mathematical Journal 8 Chaos 7 Bulletin of the Australian Mathematical Society 7 Manuscripta Mathematica 7 Pacific Journal of Mathematics 7 Proceedings of the Japan Academy. Series A 7 Siberian Mathematical Journal 7 Geometric and Functional Analysis. GAFA 7 Experimental Mathematics 7 Algebras and Representation Theory 7 Annals of Mathematics. Second Series 7 Journal of Topology and Analysis 7 Groups, Complexity, Cryptology 7 Quantum Topology 6 Journal of Geometry and Physics 6 Annales Scientifiques de l’École Normale Supérieure. Quatrième Série 6 Applied Mathematics and Computation 6 Glasgow Mathematical Journal 6 Journal of the Mathematical Society of Japan 6 Michigan Mathematical Journal 6 Tokyo Journal of Mathematics 6 International Journal of Mathematics 6 Journal of High Energy Physics 6 Winter Braids Lecture Notes 5 Mathematical Notes 5 Journal of Combinatorial Theory. Series A 5 Publications of the Research Institute for Mathematical Sciences, Kyoto University 5 European Journal of Combinatorics 5 Annales Mathématiques Blaise Pascal 5 Boletín de la Sociedad Matemática Mexicana. Third Series 5 Journal of the European Mathematical Society (JEMS) 5 Journal of the Australian Mathematical Society 5 Journal of Topology 4 Compositio Mathematica 4 Indiana University Mathematics Journal 4 Journal of Soviet Mathematics 4 Nagoya Mathematical Journal 4 Proceedings of the Edinburgh Mathematical Society. Series II 4 Tôhoku Mathematical Journal. Second Series 4 Discrete & Computational Geometry 4 Quantum Information Processing 4 Mediterranean Journal of Mathematics 4 SIGMA. Symmetry, Integrability and Geometry: Methods and Applications 3 Journal of Statistical Physics 3 The Mathematical Intelligencer 3 Acta Mathematica Vietnamica 3 Algebra and Logic 3 International Journal of Mathematics and Mathematical Sciences 3 Journal of Combinatorial Theory. Series B 3 Journal of Geometry 3 Transactions of the Moscow Mathematical Society 3 Chinese Annals of Mathematics. Series B 3 Acta Mathematica Hungarica 3 Journal of Symbolic Computation 3 Selecta Mathematica. New Series 3 Doklady Mathematics 3 Conformal Geometry and Dynamics 3 Journal of Group Theory 3 Physical Review Letters 3 Journal of Algebra and its Applications 3 Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie V 3 Sibirskie Èlektronnye Matematicheskie Izvestiya 3 Bulletin of the American Mathematical Society ...and 160 more Serials
all top 5
### Cited in 52 Fields
1,039 Manifolds and cell complexes (57-XX) 675 Group theory and generalizations (20-XX) 176 Dynamical systems and ergodic theory (37-XX) 89 Combinatorics (05-XX) 88 Quantum theory (81-XX) 83 Associative rings and algebras (16-XX) 80 Nonassociative rings and algebras (17-XX) 78 Several complex variables and analytic spaces (32-XX) 75 Algebraic topology (55-XX) 71 Algebraic geometry (14-XX) 67 Differential geometry (53-XX) 61 Functions of a complex variable (30-XX) 48 Computer science (68-XX) 35 Category theory; homological algebra (18-XX) 33 Global analysis, analysis on manifolds (58-XX) 31 Number theory (11-XX) 22 Statistical mechanics, structure of matter (82-XX) 21 Functional analysis (46-XX) 20 Order, lattices, ordered algebraic structures (06-XX) 20 Topological groups, Lie groups (22-XX) 20 Ordinary differential equations (34-XX) 14 General topology (54-XX) 14 Information and communication theory, circuits (94-XX) 13 Relativity and gravitational theory (83-XX) 11 Commutative algebra (13-XX) 11 Partial differential equations (35-XX) 11 Probability theory and stochastic processes (60-XX) 11 Fluid mechanics (76-XX) 10 History and biography (01-XX) 10 Mathematical logic and foundations (03-XX) 8 Special functions (33-XX) 7 Linear and multilinear algebra; matrix theory (15-XX) 7 Calculus of variations and optimal control; optimization (49-XX) 6 General algebraic systems (08-XX) 6 $$K$$-theory (19-XX) 6 Measure and integration (28-XX) 6 Geometry (51-XX) 6 Convex and discrete geometry (52-XX) 6 Numerical analysis (65-XX) 5 Mechanics of particles and systems (70-XX) 5 Biology and other natural sciences (92-XX) 4 Field theory and polynomials (12-XX) 3 General and overarching topics; collections (00-XX) 2 Difference and functional equations (39-XX) 2 Abstract harmonic analysis (43-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Approximations and expansions (41-XX) 1 Operator theory (47-XX) 1 Optics, electromagnetic theory (78-XX) 1 Classical thermodynamics, heat transfer (80-XX) 1 Astronomy and astrophysics (85-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.
| 2023-01-29T11:27: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.4618258476257324, "perplexity": 8344.922082938076}, "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/1674764499713.50/warc/CC-MAIN-20230129112153-20230129142153-00321.warc.gz"}
|
http://www.legisquebec.gouv.qc.ca/en/showversion/cr/H-4.2,%20r.%201?code=se:237&pointInTime=20210204
|
### H-4.2, r. 1 - Regulation respecting petroleum exploration, production and storage in a body of water
237. The application must contain
(1) the name and contact information of the holder and the licence number;
(2) the name of the well; and
(3) the work schedule and an estimate of the realization costs.
O.C. 1251-2018, s. 237.
In force: 2018-09-20
237. The application must contain
(1) the name and contact information of the holder and the licence number;
(2) the name of the well; and
(3) the work schedule and an estimate of the realization costs.
O.C. 1251-2018, s. 237.
| 2021-04-23T10:46:31 |
{"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.8513829112052917, "perplexity": 8778.203926195412}, "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/1618039617701.99/warc/CC-MAIN-20210423101141-20210423131141-00530.warc.gz"}
|
https://supernatural.fandom.com/wiki/Talk:Omnipotence
|
4,860 Pages
1) Should we add Metatron to this list while he was powered up by the Angel tablet?
2) Jesse Turner on this page is listed under the 'Extremely powerful' beings, however on the actual Jesse Turner page, he is listed as a Nigh-Omnipotent being under his 'Powers and Abilities'. So my question is, should he be moved up?
Toe Knee 17 (talk) 21:45, October 13, 2015 (UTC)
I think one could consider Metatron to be extremely powerful, it's just not fitting to include him in the same class like God, Death and The Darkness. Jesse Turner is powerful, but the same is true for him, time to adapt it. Lambda1 (talk) 00:32, October 14, 2015 (UTC)
I never would have put Metatron in the same league as God, Death and The Darkness anyway, so I agree with that. I think he should be put on the page though, preferably above Soul-Cas, under the 'Extremely powerful' section.
As for Jesse, one of the pages needs to be changed then. It's misleading to have him listed as a nigh-omnipotent on one page but not on another.
Toe Knee 17 (talk) 00:55, October 14, 2015 (UTC)
Agree, I changed it, I think it fits better with him as advanced reality warper and furthermore a link to this page as "one of the most powerful beings". Lambda1 (talk) 01:12, October 14, 2015 (UTC)
I think this needs to be explained further. Some users seem to be able to understand the paradoxon not fully. It's not just about "Could he create a stone so heavy, he can no longer lift it ?" There are many variations of the problem, that are semantically equivalent. Basically, anything that contradicts itself triggers the problem. An example:
1. Solve $x = \lnot x$ is from the logical perspective the same problem as "Could he create a stone so heavy, he can no longer lift it ?"
To explain $x = \lnot x$ for those who are unfamiliar with math or computer science; This is a boolean expression, not a equation that is defined on Real Number/ Complex Numbers/... Means, x can either take the values "True" or "False", nothing more. $x = x$ is always a true statement for x = True, because if you set it in $x = x$ it's equivalent to True = True, so the statement itself is true. The statement is also true if you set x = False in $x = x$ because False = False as a statement is True. As these are all possibilitis $x = x$ is a tautology, means always true for any statement. What about $x = \lnot x$. We have 2 possibilities, x = True or x = False. Let's set x = True into the equation, (it's defined that "not true = false", "not false = true"), than $True = not True \iff True = False$ That it a contradiction. True is never False. Lets test out our other possibility: x = False $False = not False \iff False = True$ that is also a contradiction, because False is not identical to True. As there a no other options left, the equation can't be solved. It's a self contradicting equation, basically the same case we have with the stone. It leads to a contradiction, True = False, and that's the point of the omnipotence paradoxon. There are many variations but they all lead to the same problem. Lambda1 (talk) 16:55, October 26, 2015 (UTC)
## Metatron.
Obviously Metatron was not in the same league as God, Death, The Darkness and Soul-Cas. However, given his feats while powered by the Angel tablet, I think he should be at least on the same level as the Archangels.
Blowing out a ring of Holy Fire comes to mind. Also trapping a Seraph, Castiel, in an illusion without him even knowing. Toe Knee 17 (talk) 14:00, February 10, 2016 (UTC)
## Jesse Turner vs archangels
Before another edit war occurs, let's shift the discussion over to the place it belongs, right here.
Regarding Jesse Turner's Power, it would not make much sense if he draws his power from Lucifer. Castiel said, that now that Lucifer is on earth, he becomes stronger. This doesn't implicate that he becomes weaker when Lucifer is back in the cage. His powers were merely activated when Lucifer was freed. There is another reason to sustain this argument: If Jesse would draw his power from Lucifer, why would Lucifer need Jesse to destroy the Host of Heaven ? If Jesse receives his power from Lucifer, than Lucifer could annihilate the angels on it's own with just a word. Btw. it's still one of the most horrific episodes of Season 5. Destroying all the angels with a word - Really ? This is something Amara or God could do - but this boy could also accomplish this ? Must be a special God given power. Well, it is since Chuck decided this boys existence in the first place by writing him into the SPN books. This needs a retcon. Lambda1 (talk) 18:43, May 10, 2016 (UTC)
That's why it makes more sense that Jesse would simply become as powerful as an archangel, or somehow combine his power with Lucifer's.
Also, Chuck didn't decide anything. He said he avoids divine intervention at all costs, and the books didn't entirely match reality, meaning he was just predicting the future (and badly, in many instances).
Orion (T-B-C) 18:53, May 10, 2016 (UTC)
That's one interpretation, but you can also argue that he decided all the major events. He gave the Winchesters the SPN books and everything happened as predicted. You might argue that Lilith-Sam scene differed from the books version, but he might have just changed his mind or he gave them a wrong version. He said he avoids interventions, but he also confirmed that he intervened on some occasions. Also, keep in mind that the whole Dean- Sam thing happened as it was supposed to happen, for the most part. Gabriel said that they knew since "Dad turned on the lights" it would end with them. Could still be prediction, but there must have been a force that ensured it actually happens as supposed to. However, I don't want to start a discussion on this matter until the next episode comes out. The Dean - Chuck talk might give us some more clues. I suppose Dean punches him. Lambda1 (talk) 19:08, May 10, 2016 (UTC)
See, I'm just going by what was shown in the series. Chuck made many predictions, but he was also wrong about many of them, from the Sam/Lilith thing to the end of the Michael/Lucifer confrontation. Gabriel said it'd end with the "prize fight", as did every other archangel, and they were all wrong, yet that was the ending God predicted. If you say he made everything happen just because he wanted it to happen that way, then you're saying he's intervened since the beginning of time, and free will doesn't exist (in stark contrast with the series on both counts). If you're saying he changed his mind, then he was still wrong, because he didn't predict he'd change his mind, and his predictions remained the same.
I'm guessing Dean is either going to punch him, or apologize for holding a gun to his head.
Orion (T-B-C) 19:16, May 10, 2016 (UTC)
## Omnipotence ranking
Please shift over the discussion to the talk page, that is the reason it is there in the first place. I think we all agree that Amara, God and Death belong under the nigh-omnipotent section. We know not so much about Metatron's power when he had the word of god, neither do we know much about the pagan deities at their height. I would also suggest to list every archangel individually, since Michael is certainly a lot stronger than Gabriel. Castiel destroyed Raphael with a snap of his fingers, but it's doubtful that he could do the same with Gabriel, therefore it is better to distinguish between them. Lambda1 (talk) 18:31, May 15, 2016 (UTC)
Yes I agree with Death, God and the Darkness part. We never saw that Deities were able to achieve great things and they are even vulnerable to basic weapons (Stakes). Metatron with word of God was very strong. It has been implied that it granted God-like abilities to him. He was completely invulnerable against angelic weakness. Even it took time Lucifer to distinguish wardings. Castiel snapping Raphael implies that he is stronger than Michael and Lucifer. Even Lucifer can't defeat Gabriel that easily. He believed he could match Death. Wardings effect archangels but he was completely immune to them which means he is far superior of archangels. SeraphLucifer (talk) 18:47, May 15, 2016 (UTC)SeraphLucifer
Well, Lucifer took Gabriel easily down, there was no real fight between them. Also, Castiel was a mutated angel, maybe so much malformed, that the sigils didn't "recognize" him as an angel any longer. It's like using an angel sigil against demons, it can't work, because they were designed to only work on angels. I would say God-Cas was a bit stronger than Michael, maybe 30%. But, we would just restart a discussion that had been discussed a dozen times here. There is a way to get around the problem: We could remove the "Extremely Powerful" section, place them under Lower Tier Nigh -Omnipotence and just enumerate the things Metatron, Lucifer, Michael... were shown to be capable of. This would allow the reader to make their own conclusion. As for the pagans, they should not be placed here at all. Sam mentioned that they were once more powerful, but still definitely not on archangel level. They all depend on things God created in the first place, none of them can create out of nothing and neither can I remember that I saw them at least change pre existing matter (Okay, they fixed a hotel in Hammer of the Gods, can't compare with creating a TV universe like Gabriel did). So no, they really don't belong on this page at all. The most impressive feat I saw a pagan deity achieving was to generate lightning bolts (Zeus) and Fire (Kali). What do you think ? Good work on the Seraph/Zachariah pages, they are now freed from speculation. Lambda1 (talk) 00:29, May 16, 2016 (UTC)
Yes I definetly agree with you. Pagan gods aren't even near extreme powerful. Thank you by the way. SeraphLucifer (talk) 05:21, May 16, 2016 (UTC)SeraphLucifer
## Jack
Yes I was wondering if I can put Jack under the Lower tier or possible nigh tier omnipotence category. Jack3869 (talk) 21:53, May 18, 2018 (UTC)
## God Castiel
He only wanted to keep Michael in Lucifer's cage, but not Lucifer.--Mgdodl (talk) 13:23, March 23, 2020 (UTC)
He said he wanted to "keep Michael and Lucifer's cage". Admin // Dominic1743 (T-C-L) 13:29, March 23, 2020 (UTC)
Well, when I rewatched this scene, it didn't sound like "and".--Mgdodl (talk) 13:31, March 23, 2020 (UTC)
It was 13:15. Admin // Dominic1743 (T-C-L) 13:35, March 23, 2020 (UTC)
Yeah, I know, but how does it sound to you, because to me it's different.--Mgdodl (talk) 13:45, March 23, 2020 (UTC)
He said "And we need to keep Michael and Lucifer's Cage". On this site there are the subtitles- https://europixhd.io/tvs/supernatural-online/supernatural-season-7-hd-with-subtitles-europix It doesn't work using adblock and it's full of advertising, so be careful. Malthael Archangel of Death (talk) 17:05, March 23, 2020 (UTC)
Well, I bought the DVD and the subtitles of the DVD show "in".--Mgdodl (talk) 17:57, March 23, 2020 (UTC)
• Facepalm*. So... how do you want to handle this? Keeping the page as it is now? Works for me Malthael Archangel of Death (talk) 18:15, March 23, 2020 (UTC)
Well, keep it the way it is, we don't know more about his strength, he just appeared briefly and it's speculation to say that his stronger than Michael, because only demonstrated his powers on Raphael.--Mgdodl (talk) 18:19, March 23, 2020 (UTC)
Community content is available under CC-BY-SA unless otherwise noted.
| 2020-04-03T05:45: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.4669475853443146, "perplexity": 2396.8400360025335}, "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-16/segments/1585370510287.30/warc/CC-MAIN-20200403030659-20200403060659-00171.warc.gz"}
|
https://tjyj.stats.gov.cn/CN/Y2013/V30/I9/79
|
• 论文 •
收入分布函数在收入不平等研究领域的应用
• 出版日期:2013-09-15 发布日期:2013-09-04
The Application of Income Distribution Function in the Research of Income Disparity
Chen Jiandong et al.
• Online:2013-09-15 Published:2013-09-04
Abstract: It needs further explore in this field in China, despite great significance in the research on the functions of income distribution for the exploration about income inequality. Based on the review of literatures, we sort the relative research abroad; categorize the frequently-used income distributions into two sorts: functions of bi-parametric distribution and functions of multi-parametric; and introduce the effects on all kinds of functions fitting distribution of real resident income and the relationship between them and Gini Coefficient. Meanwhile, this paper analyses the inherent relations among these functions. Furthermore, on the basis of distribution functions, the authors explore the internal relation among income disparity and income mobility as well as the mathematical relationship between the values of Mean and Median and the Gini Coefficient, and then raise the method to estimate the parameters of distribution functions with this ratio. According to the results above, this paper studies the income structure and poverty issues of urban residents in 2010, and then proposes several forecasting proposals.
| 2022-07-03T11:34: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.22281350195407867, "perplexity": 1452.3835849859638}, "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-2022-27/segments/1656104240553.67/warc/CC-MAIN-20220703104037-20220703134037-00713.warc.gz"}
|
https://zbmath.org/authors/gulliver.robert-d-ii
|
## Gulliver, Robert D. II
Compute Distance To:
Author ID: gulliver.robert-d-ii Published as: Gulliver, Robert; Gulliver, R.; Gulliver, Robert D. II; Gulliver, R. D. II; Gulliver, R. II more...less Homepage: https://math.umn.edu/directory/robert-gulliver External Links: MGP · Wikidata · dblp
Documents Indexed: 59 Publications since 1971 2 Contributions as Editor Co-Authors: 31 Co-Authors with 37 Joint Publications 838 Co-Co-Authors
all top 5
### Co-Authors
24 single-authored 5 Littman, Walter 5 Spruck, Joel 4 Choe, Jaigyoung 3 Chow, Bennett 2 Triggiani, Roberto 2 White, Brian Cabell 2 Yamada, Sumio 1 Betelú, Santiago I. 1 Coron, Jean-Michel 1 Green, Leon W. 1 Hildebrandt, Stefan 1 Jost, Jürgen 1 Kim, Bang Ok 1 Koo, Yonghoi 1 Lasiecka, Irena 1 Lawson, Herbert Blaine jun. 1 Lesley, Frank David 1 Levy, Silvio V. F. 1 Morgan, Frank 1 Osserman, Robert 1 Park, Sung-Ho 1 Pyo, Juncheol 1 Royden, H. L. 1 Santosa, Fadil N. 1 Scott, G. Peter 1 Seo, Keomkyo 1 Sullivan, John Matthew 1 Tomi, Friedrich 1 Wang, Jing 1 Wente, Henry C. 1 Xu, Guoyi
all top 5
### Serials
4 Manuscripta Mathematica 4 Mathematische Zeitschrift 3 Journal of Differential Geometry 3 Journal für die Reine und Angewandte Mathematik 3 Mathematische Annalen 3 Communications in Analysis and Geometry 3 Annals of Mathematics. Second Series 2 Inventiones Mathematicae 2 Pacific Journal of Mathematics 1 Archive for Rational Mechanics and Analysis 1 American Journal of Mathematics 1 Applied Mathematics and Optimization 1 Indiana University Mathematics Journal 1 Journal of the Korean Mathematical Society 1 Proceedings of the American Mathematical Society 1 Topology 1 Transactions of the American Mathematical Society 1 SIAM Journal on Applied Mathematics 1 Calculus of Variations and Partial Differential Equations 1 Mathematical Research Letters 1 Communications of the Korean Mathematical Society 1 Bulletin of the American Mathematical Society 1 Pure and Applied Mathematics Quarterly 1 Contemporary Mathematics
all top 5
### Fields
45 Differential geometry (53-XX) 22 Calculus of variations and optimal control; optimization (49-XX) 13 Global analysis, analysis on manifolds (58-XX) 12 Partial differential equations (35-XX) 8 Manifolds and cell complexes (57-XX) 5 Systems theory; control (93-XX) 2 General and overarching topics; collections (00-XX) 2 Combinatorics (05-XX) 2 Fluid mechanics (76-XX) 1 Ordinary differential equations (34-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Convex and discrete geometry (52-XX) 1 Optics, electromagnetic theory (78-XX) 1 Biology and other natural sciences (92-XX)
### Citations contained in zbMATH Open
46 Publications have been cited 517 times in 394 Documents Cited by Year
A theory of branched immersions of surfaces. Zbl 0295.53002
Gulliver, R. D. II; Osserman, R.; Royden, H. L.
1973
Regularity of minimizing surfaces of prescribed mean curvature. Zbl 0246.53053
Gulliver, Robert D. II
1973
Minimizing p-harmonic maps into spheres. Zbl 0677.58021
Coron, Jean-Michel; Gulliver, Robert
1989
On boundary branch points of minimizing surfaces. Zbl 0263.53009
Gulliver, Robert; Lesley, Frank David
1973
Harmonic maps which solve a free-boundary problem. Zbl 0619.35117
Gulliver, Robert; Jost, Jürgen
1987
Aleksandrov reflection and nonlinear evolution equations. I: The $$n$$-sphere and $$n$$-ball. Zbl 0851.58041
Chow, Bennett; Gulliver, Robert
1996
The case for differential geometry in the control of single and coupled PDEs: the structural acoustic chamber. Zbl 1067.35014
Gulliver, R.; Lasiecka, I.; Littman, W.; Triggiani, R.
2003
On the variety of manifolds without conjugate points. Zbl 0281.58008
Gulliver, Robert
1975
Isoperimetric inequalities on minimal submanifolds of space forms. Zbl 0777.53063
Choe, Jaigyoung; Gulliver, Robert
1992
The Plateau problem for surfaces of prescribed mean curvature in a cylinder. Zbl 0214.11103
Gulliver, R.; Spruck, J.
1971
Existence theorems for parametric surfaces of prescribed mean curvature. Zbl 0233.53004
Gulliver, Robert; Spruck, Joel
1972
Planes without conjugate points. Zbl 0563.53036
Green, Leon; Gulliver, Robert
1985
The Plateau problem for surfaces of prescribed mean curvature in a Riemannian manifold. Zbl 0275.53033
Gulliver, Robert D. II
1973
On embedded minimal surfaces. Zbl 0347.49033
Gulliver, Robert; Spruck, Joel
1976
The rate of convergence of a harmonic map at a singular point. Zbl 0645.58018
Gulliver, Robert; White, Brian
1989
The sharp isoperimetric inequality for minimal surfaces with radially connected boundary in hyperbolic space. Zbl 0776.53042
Choe, Jaigyoung; Gulliver, Robert
1992
The structure of stable minimal hypersurfaces near a singularity. Zbl 0592.53005
Gulliver, Robert; Lawson, H. Blaine jun.
1986
Aleksandrov reflection and geometric evolution of hypersurfaces. Zbl 1004.53048
Chow, Bennett; Gulliver, Robert
2001
Removability of singular points on surfaces of bounded mean curvature. Zbl 0354.53004
Gulliver, Robert
1976
Least area surfaces can have excess triple points. Zbl 0636.53011
Gulliver, Robert; Scott, Peter
1987
Boundary control of PDEs via curvature flows: the view from the boundary. II. Zbl 1076.58019
Betelú, Santiago; Gulliver, Robert; Littman, Walter
2002
Boundary configurations spanning continua of minimal surfaces. Zbl 0589.53008
Gulliver, Robert; Hildebrandt, Stefan
1986
Surfaces of constant mean curvature which have a simple projection. Zbl 0233.53003
Gulliver, Robert; Spruck, Joel
1972
Existence of surfaces with prescribed mean curvature vector. Zbl 0261.53041
Gulliver, Robert
1973
On false branch points of incompressible branched immersions. Zbl 0701.53009
Gulliver, Robert; Tomi, Friedrich
1989
Embedded minimal surfaces and total curvature of curves in a manifold. Zbl 1055.53044
Choe, Jaigyoung; Gulliver, Robert
2003
Index and total curvature of complete minimal surfaces. Zbl 0592.53006
Gulliver, Robert
1986
Finiteness of the ramified set for branched immersions of surfaces. Zbl 0336.55002
Gulliver, Robert
1976
Branched immersions of surfaces and reduction of topological type. II. Zbl 0338.57014
Gulliver, Robert
1977
Analysis of a variational approach to progressive lens design. Zbl 1055.78002
Wang, Jing; Gulliver, Robert; Santosa, Fadil
2003
On regularity of generalized surfaces of constant mean curvarure. Zbl 0209.24903
Gulliver, R. II
1971
Regularity of minimizing surfaces of prescribed mean curvature. Zbl 0235.53042
Gulliver, Robert D. II
1972
Tori of prescribed mean curvature and the rotating drop. Zbl 0581.76108
Gulliver, R.
1984
Chord uniqueness and controllability: The view from the boundary. I. Zbl 0978.58014
Gulliver, Robert; Littman, Walter
2000
The symmetry group of a curve preserves a plane. Zbl 0489.53002
Gulliver, Robert; Morgan, Frank
1982
On the nonexistence of a hypersurface of prescribed mean curvature with a given boundary. Zbl 0266.53002
Gulliver, Robert
1974
Branched immersions of surfaces and reduction of topological type. I. Zbl 0299.57014
Gulliver, Robert
1975
Necessary conditions for submanifolds and currents with prescribed mean curvature vector. Zbl 0567.53045
Gulliver, Robert
1983
Minimal surfaces of finite index in manifolds of positive scalar curvature. Zbl 0703.58013
Gulliver, Robert
1988
Total curvature of graphs in space. Zbl 1146.53002
Gulliver, Robert
2007
Total curvature of graphs after Milnor and Euler. Zbl 1253.53004
2012
Sharp growth rate for generalized solutions evolving by mean curvature plus a forcing term. Zbl 1037.53045
Gulliver, Robert; Koo, Yonghoi
2001
Fiber evolution in the heat flow of harmonic maps. Zbl 0738.58013
Gulliver, Robert
1991
A minimal surface with an atypical boundary branch point. Zbl 0731.53005
Gulliver, Robert
1991
Density of a minimal submanifold and total curvature of its boundary. Zbl 1380.53061
Choe, Jaigyoung; Gulliver, Robert
2017
Correction to ”On embedded minimal surfaces”. Zbl 0398.49024
Gulliver, Robert; Spruck, Joel
1979
Density of a minimal submanifold and total curvature of its boundary. Zbl 1380.53061
Choe, Jaigyoung; Gulliver, Robert
2017
Total curvature of graphs after Milnor and Euler. Zbl 1253.53004
2012
Total curvature of graphs in space. Zbl 1146.53002
Gulliver, Robert
2007
The case for differential geometry in the control of single and coupled PDEs: the structural acoustic chamber. Zbl 1067.35014
Gulliver, R.; Lasiecka, I.; Littman, W.; Triggiani, R.
2003
Embedded minimal surfaces and total curvature of curves in a manifold. Zbl 1055.53044
Choe, Jaigyoung; Gulliver, Robert
2003
Analysis of a variational approach to progressive lens design. Zbl 1055.78002
Wang, Jing; Gulliver, Robert; Santosa, Fadil
2003
Boundary control of PDEs via curvature flows: the view from the boundary. II. Zbl 1076.58019
Betelú, Santiago; Gulliver, Robert; Littman, Walter
2002
Aleksandrov reflection and geometric evolution of hypersurfaces. Zbl 1004.53048
Chow, Bennett; Gulliver, Robert
2001
Sharp growth rate for generalized solutions evolving by mean curvature plus a forcing term. Zbl 1037.53045
Gulliver, Robert; Koo, Yonghoi
2001
Chord uniqueness and controllability: The view from the boundary. I. Zbl 0978.58014
Gulliver, Robert; Littman, Walter
2000
Aleksandrov reflection and nonlinear evolution equations. I: The $$n$$-sphere and $$n$$-ball. Zbl 0851.58041
Chow, Bennett; Gulliver, Robert
1996
Isoperimetric inequalities on minimal submanifolds of space forms. Zbl 0777.53063
Choe, Jaigyoung; Gulliver, Robert
1992
The sharp isoperimetric inequality for minimal surfaces with radially connected boundary in hyperbolic space. Zbl 0776.53042
Choe, Jaigyoung; Gulliver, Robert
1992
Fiber evolution in the heat flow of harmonic maps. Zbl 0738.58013
Gulliver, Robert
1991
A minimal surface with an atypical boundary branch point. Zbl 0731.53005
Gulliver, Robert
1991
Minimizing p-harmonic maps into spheres. Zbl 0677.58021
Coron, Jean-Michel; Gulliver, Robert
1989
The rate of convergence of a harmonic map at a singular point. Zbl 0645.58018
Gulliver, Robert; White, Brian
1989
On false branch points of incompressible branched immersions. Zbl 0701.53009
Gulliver, Robert; Tomi, Friedrich
1989
Minimal surfaces of finite index in manifolds of positive scalar curvature. Zbl 0703.58013
Gulliver, Robert
1988
Harmonic maps which solve a free-boundary problem. Zbl 0619.35117
Gulliver, Robert; Jost, Jürgen
1987
Least area surfaces can have excess triple points. Zbl 0636.53011
Gulliver, Robert; Scott, Peter
1987
The structure of stable minimal hypersurfaces near a singularity. Zbl 0592.53005
Gulliver, Robert; Lawson, H. Blaine jun.
1986
Boundary configurations spanning continua of minimal surfaces. Zbl 0589.53008
Gulliver, Robert; Hildebrandt, Stefan
1986
Index and total curvature of complete minimal surfaces. Zbl 0592.53006
Gulliver, Robert
1986
Planes without conjugate points. Zbl 0563.53036
Green, Leon; Gulliver, Robert
1985
Tori of prescribed mean curvature and the rotating drop. Zbl 0581.76108
Gulliver, R.
1984
Necessary conditions for submanifolds and currents with prescribed mean curvature vector. Zbl 0567.53045
Gulliver, Robert
1983
The symmetry group of a curve preserves a plane. Zbl 0489.53002
Gulliver, Robert; Morgan, Frank
1982
Correction to ”On embedded minimal surfaces”. Zbl 0398.49024
Gulliver, Robert; Spruck, Joel
1979
Branched immersions of surfaces and reduction of topological type. II. Zbl 0338.57014
Gulliver, Robert
1977
On embedded minimal surfaces. Zbl 0347.49033
Gulliver, Robert; Spruck, Joel
1976
Removability of singular points on surfaces of bounded mean curvature. Zbl 0354.53004
Gulliver, Robert
1976
Finiteness of the ramified set for branched immersions of surfaces. Zbl 0336.55002
Gulliver, Robert
1976
On the variety of manifolds without conjugate points. Zbl 0281.58008
Gulliver, Robert
1975
Branched immersions of surfaces and reduction of topological type. I. Zbl 0299.57014
Gulliver, Robert
1975
On the nonexistence of a hypersurface of prescribed mean curvature with a given boundary. Zbl 0266.53002
Gulliver, Robert
1974
A theory of branched immersions of surfaces. Zbl 0295.53002
Gulliver, R. D. II; Osserman, R.; Royden, H. L.
1973
Regularity of minimizing surfaces of prescribed mean curvature. Zbl 0246.53053
Gulliver, Robert D. II
1973
On boundary branch points of minimizing surfaces. Zbl 0263.53009
Gulliver, Robert; Lesley, Frank David
1973
The Plateau problem for surfaces of prescribed mean curvature in a Riemannian manifold. Zbl 0275.53033
Gulliver, Robert D. II
1973
Existence of surfaces with prescribed mean curvature vector. Zbl 0261.53041
Gulliver, Robert
1973
Existence theorems for parametric surfaces of prescribed mean curvature. Zbl 0233.53004
Gulliver, Robert; Spruck, Joel
1972
Surfaces of constant mean curvature which have a simple projection. Zbl 0233.53003
Gulliver, Robert; Spruck, Joel
1972
Regularity of minimizing surfaces of prescribed mean curvature. Zbl 0235.53042
Gulliver, Robert D. II
1972
The Plateau problem for surfaces of prescribed mean curvature in a cylinder. Zbl 0214.11103
Gulliver, R.; Spruck, J.
1971
On regularity of generalized surfaces of constant mean curvarure. Zbl 0209.24903
Gulliver, R. II
1971
all top 5
### Cited by 436 Authors
13 Gulliver, Robert D. II 11 Tomi, Friedrich 10 Duzaar, Frank 9 Zhu, Miaomiao 8 Steffen, Klaus 7 Cavalcanti, Marcelo Moreira 7 Yao, Pengfei 6 Coskunuzer, Baris 6 Tromba, Anthony Joseph 6 Wood, John C. 5 Ahmad, Daud 5 Gonzalez Martinez, Victor Hugo 5 Hildebrandt, Stefan 5 Jost, Jürgen 5 Meeks, William Hamilton III 5 Rupflin, Melanie 5 Tsai, Dong-Ho 5 Wente, Henry C. 4 Bourni, Theodora 4 Caldiroli, Paolo 4 Choe, Jaigyoung 4 Li, Guanghan 4 Lin, Fang Hua 4 Ning, Zhenhu 4 Seo, Keomkyo 4 Tinaglia, Giuseppe 3 Anderson, Michael T. 3 Bamler, Richard H. 3 Beeson, Michael J. 3 Bourgoin, Jean-Christophe 3 Coron, Jean-Michel 3 Domingos Cavalcanti, Valéria Neves 3 Eells, James jun. 3 Eschenburg, Jost-Hinrich 3 Finn, Robert Samuel 3 Grotowski, Joseph F. 3 Innami, Nobuhiro 3 Ivaki, Mohammad N. 3 Jakob, Ruben 3 Li, Jiayu 3 Liu, Lei 3 Liu, Shitao 3 Liu, Yuxiang 3 Masud, Bilal 3 McCoy, James Alexander 3 Millot, Vincent 3 Nakauchi, Nobumitsu 3 Onninen, Jani 3 Penskoi, Alexei V. 3 Scheven, Christoph 3 Wang, Changyou 3 Wei, Yong 3 White, Brian Cabell 3 Zhang, Zhifei 2 Bialy, Misha 2 Castillon, Philippe 2 Chen, Goong 2 Chen, Yunmei 2 Chow, Bennett 2 Climenhaga, Vaughn 2 Concus, Paul 2 Croke, Christopher B. 2 Day, Stuart 2 Delatorre, Leonel G. 2 Dziuk, Gerhard 2 Fuchs, Martin 2 Gornik, Klaus 2 Hardt, Robert M. 2 Hong, Minchun 2 Howard, Ralph E. 2 Huang, Tao 2 Hungerbuhler, Norbert 2 Hutchinson, John Edward 2 Iacopetti, Alessandro 2 Karpukhin, Mikhail A. 2 Koiso, Miyuki 2 Koski, Aleksis 2 Langford, Mat 2 Lemaire, Luc 2 Li, Qirui 2 Lin, Changsong 2 Lin, Yu-Chu 2 López Camino, Rafael 2 Mao, Jing 2 Minicozzi, William Philip II 2 Moore, John Douglas 2 Morgan, Frank 2 Musina, Roberta 2 Naber, Aaron C. 2 Nadirashvili, Nikolai S. 2 Nakajima, Tôru 2 Osher, Stanley Joel 2 Bessa, Gregório Pacelli 2 Pardon, John Vincent 2 Pérez Muñoz, Joaquín 2 Ripoll, Jaime Bruck 2 Salavessa, Isabel M. C. 2 Sapiro, Guillermo 2 Shen, Changxiang 2 Sire, Yannick ...and 336 more Authors
all top 5
### Cited in 110 Serials
36 Mathematische Zeitschrift 26 Calculus of Variations and Partial Differential Equations 21 Manuscripta Mathematica 20 Mathematische Annalen 18 Archive for Rational Mechanics and Analysis 16 Transactions of the American Mathematical Society 15 The Journal of Geometric Analysis 13 Proceedings of the American Mathematical Society 9 Journal of Mathematical Analysis and Applications 9 Archiv der Mathematik 9 Annales de l’Institut Henri Poincaré. Analyse Non Linéaire 8 Inventiones Mathematicae 7 Advances in Mathematics 5 Journal of Differential Equations 5 Journal of Functional Analysis 5 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 5 Bulletin of the American Mathematical Society. New Series 5 Journal of the European Mathematical Society (JEMS) 4 Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV 4 Applied Mathematics and Optimization 4 Duke Mathematical Journal 4 Geometriae Dedicata 4 Annals of Global Analysis and Geometry 4 Communications in Partial Differential Equations 4 Geometry & Topology 4 Annals of Mathematics. Second Series 4 Acta Mathematica Sinica. English Series 4 Communications in Contemporary Mathematics 3 Journal of Fluid Mechanics 3 Journal für die Reine und Angewandte Mathematik 3 Tôhoku Mathematical Journal. Second Series 3 Systems & Control Letters 3 Chinese Annals of Mathematics. Series B 3 Revista Matemática Iberoamericana 3 Differential Geometry and its Applications 3 Discrete and Continuous Dynamical Systems 3 Nonlinear Analysis. Real World Applications 3 Nonlinear Analysis. Theory, Methods & Applications 2 Inverse Problems 2 Israel Journal of Mathematics 2 Journal of Computational Physics 2 Journal of Geometry and Physics 2 Acta Mathematica 2 Applied Mathematics and Computation 2 Journal of Differential Geometry 2 Mathematische Nachrichten 2 Monatshefte für Mathematik 2 Proceedings of the Japan Academy. Series A 2 SIAM Journal on Control and Optimization 2 Zeitschrift für Analysis und ihre Anwendungen 2 Journal of the American Mathematical Society 2 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 2 Analysis (München) 2 Journal of Evolution Equations 2 Comptes Rendus. Mathématique. Académie des Sciences, Paris 2 Analysis & PDE 2 Advances in Mathematical Physics 1 Computers & Mathematics with Applications 1 Communications in Mathematical Physics 1 Communications on Pure and Applied Mathematics 1 Letters in Mathematical Physics 1 Mathematical Proceedings of the Cambridge Philosophical Society 1 Nonlinearity 1 Rocky Mountain Journal of Mathematics 1 ZAMP. Zeitschrift für angewandte Mathematik und Physik 1 Mathematics of Computation 1 Annales de l’Institut Fourier 1 Annales Polonici Mathematici 1 Annales Scientifiques de l’École Normale Supérieure. Quatrième Série 1 Boletim da Sociedade Brasileira de Matemática 1 Bulletin de la Société Mathématique de France 1 Compositio Mathematica 1 Illinois Journal of Mathematics 1 Journal of Soviet Mathematics 1 Kodai Mathematical Journal 1 Michigan Mathematical Journal 1 Osaka Journal of Mathematics 1 Pacific Journal of Mathematics 1 Proceedings of the London Mathematical Society. Third Series 1 Rendiconti del Circolo Matemàtico di Palermo. Serie II 1 Results in Mathematics 1 Ergodic Theory and Dynamical Systems 1 Applied Mathematics Letters 1 Science in China. Series A 1 Geometric and Functional Analysis. GAFA 1 SIAM Journal on Mathematical Analysis 1 Proceedings of the Indian Academy of Sciences. Mathematical Sciences 1 Annales de l’Institut Henri Poincaré. Physique Théorique 1 Boletim da Sociedade Brasileira de Matemática. Nova Série 1 Journal of Knot Theory and its Ramifications 1 Topological Methods in Nonlinear Analysis 1 Journal of Mathematical Sciences (New York) 1 Documenta Mathematica 1 European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations 1 Abstract and Applied Analysis 1 Mathematical Physics, Analysis and Geometry 1 Journal of Inequalities and Applications 1 Journal of Mathematical Fluid Mechanics 1 Communications on Pure and Applied Analysis 1 Bulletin of the Brazilian Mathematical Society. New Series ...and 10 more Serials
all top 5
### Cited in 34 Fields
266 Differential geometry (53-XX) 119 Global analysis, analysis on manifolds (58-XX) 103 Partial differential equations (35-XX) 100 Calculus of variations and optimal control; optimization (49-XX) 21 Manifolds and cell complexes (57-XX) 18 Systems theory; control (93-XX) 15 Dynamical systems and ergodic theory (37-XX) 14 Fluid mechanics (76-XX) 11 Functions of a complex variable (30-XX) 9 Numerical analysis (65-XX) 7 Convex and discrete geometry (52-XX) 5 Potential theory (31-XX) 4 Algebraic geometry (14-XX) 4 Several complex variables and analytic spaces (32-XX) 4 Algebraic topology (55-XX) 4 Mechanics of deformable solids (74-XX) 3 Geometry (51-XX) 3 Computer science (68-XX) 2 Group theory and generalizations (20-XX) 2 Topological groups, Lie groups (22-XX) 2 Measure and integration (28-XX) 2 Functional analysis (46-XX) 2 Operator theory (47-XX) 2 Biology and other natural sciences (92-XX) 2 Information and communication theory, circuits (94-XX) 1 History and biography (01-XX) 1 Integral transforms, operational calculus (44-XX) 1 Integral equations (45-XX) 1 General topology (54-XX) 1 Mechanics of particles and systems (70-XX) 1 Optics, electromagnetic theory (78-XX) 1 Quantum theory (81-XX) 1 Relativity and gravitational theory (83-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-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.
| 2023-01-30T15:19: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": 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.4565710723400116, "perplexity": 5022.913759683607}, "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/1674764499819.32/warc/CC-MAIN-20230130133622-20230130163622-00510.warc.gz"}
|
https://cms.fnal.gov/anadi-canepa/
|
#### Senior Scientist
Telephone: (630) 840-5402 E-mail: [email protected] Office Location: WH11SE
Areas of Focus: Project planning, Project management, Tracker, Higgs physics, BSM
#### Biography
My research field is experimental particle physics, with focus on searches for new phenomena and the study of the electroweak symmetry breaking mechanism. My program also includes development of trigger systems and silicon-based tracking detectors at hadron colliders. I have been developing the program at the CMS experiment (2015-today), after having been a member of the ATLAS (2008-2015) and CDF (2000-2011) collaborations. I currently serve as the head of the CMS department at Fermilab, the L3 manager for Electronics for the Outer Tracker WBS (HL-LHC CMS upgrade project), the scientific secretary of the Fermilab Physics Advisory Committee, and the co-convener of the energy frontier working group at the laboratory.
Education:
2006 PhD, Purdue University
Professional Experience:
2018-present Senior Scientist, Fermilab
2015-2018 Scientist, Fermilab
2013-2015 Board Appointed Research Scientist, TRIUMF
2013-2015 Honorary Lecturer at the University of British Columbia, UBC.
2008-2013 Board Appointed Research Scientist, TRIUMF
Selected Publications:
A. Canepa and T. Han, “Searches for Electroweakinos”, Annual Review of Nuclear and Particle Science, accepted.
2019 A. Canepa, “Searches for supersymmetry at the Large Hadron Collider”, Reviews in Physics 4 (2019) 100033.
2019 CMS Collaboration, “Beam Test Performance of Prototype Silicon Detectors for the Outer Tracker for the Phase-2 Upgrade of CMS”, JINST 15 (2020) P03014.
2018 X. Cid Vidal et al., “Beyond the Standard Model Physics at the HL-LHC and HE-LHC”, arXiv:1812.07831.
2017 CMS Collaboration, “Search for supersymmetry in events with one lepton and multiple jets in proton- proton collisions at $\sqrt{s}$= 13 TeV”, Phys. Lett. B 780 (2018) 384.
2015 ATLAS Collaboration, “Search for direct production of charginos and neutralinos decaying via the 125 GeV Higgs boson in $\sqrt{s}$= 8 TeV pp collisions with the ATLAS detector”, Eur. Phys. J. C (2015) 75.
Personal website: https://home.fnal.gov/~acanepa/Welcome.html
| 2021-10-22T19:22: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.3534204363822937, "perplexity": 13253.277539160708}, "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/1634323585518.54/warc/CC-MAIN-20211022181017-20211022211017-00526.warc.gz"}
|
https://pos.sissa.it/287/067/
|
Volume 287 - The 25th International workshop on vertex detectors (Vertex 2016) - Session: Poster
4D fast tracking for experiments at the High Luminosity LHC
M. Fiorini,* A. Cardini, E. Luppi, U. Marconi, N. Neri, R. Calabrese
*corresponding author
Full text: pdf
Pre-published on: May 18, 2017
Published on: August 03, 2017
Abstract
We propose an innovative detector capable of performing high resolution tracking with ultra-precise time tagging to allow the High Luminosity LHC (HL-LHC) experiments to fully profit from the luminosity upgrade of the accelerator. The increase in the number of visible interactions per bunch crossing will lead to a much larger number of primary vertices and tracks compared to the current LHC conditions, and will inevitably increase tracking inefficiency and ghost track rate.
We aim to develop a detector capable of providing 4-dimensional (4D) information, with time resolution in the order of 10~ps and position resolution of about 10~$\mu$m, able to operate in a harsh radiation environment exceeding $10^{16}$ 1-MeV neutrons equivalent per cm$^2$ and with fast online track triggering capabilities.
The precise measurement of the hits time is the key feature to operate an effective pattern recognition that guarantees a high tracking efficiency while enhancing ghost track rejection, and to perform selective track triggering.
This detector system will allow to perform precision physics measurements at the HL-LHC operating at instantaneous luminosities almost one order of magnitude larger than the current ones, making efficient use of the whole delivered luminosity.
DOI: https://doi.org/10.22323/1.287.0067
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-12-05T00:09: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.3468749225139618, "perplexity": 3964.8969834417967}, "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-2020-50/segments/1606141745780.85/warc/CC-MAIN-20201204223450-20201205013450-00371.warc.gz"}
|
https://gocompetition.energy.gov/competition/current-competition?page=evaluation
|
Detailed Information
Contact
Team
Stars
NinoDevs
ASU
Notice
The GO Competition is currently in the Beta Testing Phase, also known as Phase 0.
During this phase, we provide you the opportunity to get familiar with the competition platform: the problem to be solved, formats for input and output files, registration, algorithm submission and scoring. We encourage you, as a potential competitor, to try out the platform and raise questions through the Forum or Contact Us directly. Your participation in this phase will help improve the competition platform and process.
Participation at this point carries no obligation for the future. Team membership is flexible at this point.
The formal competition is subject to appropriation of funding.
Evaluation
Evaluation
The evaluation process will assess solutions against the official competition problem formulation as described in this website and official competition documents; however, competitors will be free to utilize any other formulation or modeling approach within their solution software. In order to ensure fairness and to enable the use of alternative problem formulations where appropriate, there will be two sections for each competition algorithm. The first section will record the computation time required by competitors’ codes to solve the OPF problem and report the objective function value, real and reactive power generation dispatch decisions at each bus, and control set points for any other equipment that has been declared controllable by the problem statement). The timer records the time for the first section to execute, from invocation to completion.
In theory, the evaluation platform could use the decision variable solution provided by competitors to calculate power flow solutions and use that solution to assess constraint violations and objective function value; however, solving for power flows and checking for the existence of feasible power flow solutions are also non-trivial problems. Existing (commercial or open-source) power flow tools that could be used by the evaluation platform may find different power flow solutions given the same inputs or may not always converge to a feasible power flow solution even when one exists. The failure of the evaluation platform to find feasible power flow solutions could unfairly penalize the scores of individual competitors; therefore, we believe the best method for evaluating solutions is to require competitors to calculate and report power flow solutions for the base case and all contingency cases (given their previously reported decision variables). Given this additional information, all OPF solutions will be validated in a uniform way by forward constraint evaluation.
The second section, which is not timed, will provide the additional solution details required for solution validation by the evaluation platform. The time required to calculate the additional solution information beyond decision variables will not be counted in an algorithm’s computation time score. Allowing solution software to calculate these quantities only after the first timer has been stopped is important as some competitors will utilize insights on the problem structure or inputs to quickly screen out some contingency cases. Therefore, the software that competitors submit to the competition may not need to calculate actual power flow solutions for every contingency prior to reporting generator and equipment control set points.
Solution data generated by algorithm evaluation will include objective function values, algorithmic run-time and constraint violation magnitudes for each network and scenario pair tested. This data will be logged by the competition evaluation platform and associated with a specific competitor (i.e., team). These logs and the public names of the associated competitors will be released into the public domain after the conclusion of each trial or final event.
This section describes the evaluation process used in the competition, including a description of the required output files and the evaluation platform.
There are two parts to the evaluation of an algorithm on a particular power system network model/scenario pair. The first part, which is timed, establishes the base case solution used to calculate the objective function value. The second part, which is not timed, establishes the contingency solutions used to determine the feasibility of the solution.
As explained in the Scoring section, if the solution does not satisfy all constraints, a scenario score is determined by multiplying a nominal objective value by a constraint violation penalty factor. Similarly, if a scenario runtime is greater than the specified cutoff threshold a scenario score is determined by multiplying the nominal objective value by a time violation penalty factor.
Evaluation Procedure
The evaluation procedure used by the competition platform is designed to check solution objective function values and constraint violations. Competitors’ codes will be required to output solutions in two specific standardized formats: one (solution1.txt) to evaluate the solution objective function value (timed); and the second (solution2.txt) to evaluate contingencies (not timed). The information that will be required in the solution output includes:
• Real and reactive power generation at each generator, as well as other relevant control variables (timed section)
• Real power (injections or withdrawals), reactive power (injections or withdrawals), voltage magnitude and phase angle at each bus for the base case and each of the contingency cases (untimed section)
• System-wide power imbalance magnitude for each contingency case (untimed section).
The automated evaluation process will use the information in competitors’ two solution files to calculate the objective function value and to assess solution constraint violations.
Feasibility check
A feasibility check is performed by evaluating competitors' solutions in the constraints and limits from the standard formulations.
For an inequality constraint gi(x)≤bi and |bi|>1, a relative constraint violation (CVi) is calculated as CVi = max(gi(x)-bi, 0) / |bi|.
For an equality constraint gi(x)=band |bi|>1, a relative constraint violation (CVi) is calculated as CVi = |gi(x)-bi| / |bi|.
For an inequality constraint gi(x)≤bi and |bi|≤1, a relative constraint violation (CVi) is calculated as CVi = max(gi(x)-bi, 0).
For an equality constraint gi(x)=band |bi|≤1, a relative constraint violation (CVi) is calculated as CVi = |gi(x)-bi|.
Summary
The solution1.txt file must be generated during the timed portion of the solution.
The solution2.txt file may be generated during the untimed portion of the solution.
The detailed evaluation process can be seen in the flow chart below.
Solution1.txt
solution1.txt must contain generator dispatch information and other control variables (if any) from the base case of each scenario. It contains the following information:
1. begin generation dispatch segment delimiter (“--generation dispatch”)
1. bus ID (“bus id”)
2. unit ID (“unit id”)
3. real power in megawatts (“pg(MW)”)
4. reactive power in megaVar (“qg(MVar)”)
3. csv data for each dispatch unit in the order given by b-i to b-iv.
4. end generation dispatch segment delimiter ("--end of generation dispatch”)
Instructions on how to input other control variables will be added at a later time.
The Phase 0 IEEE 14 bus contents of Scenario1/solution1.txt would look like the following (competitor’s real power and reactive power values may be different):
--generation dispatch
bus id,unit id,pg(MW),qg(MVar)
1,'1 ',37.9649606792,1.8583662976
6,'1 ',110.4266998728,-13.0957522832
8,'1 ',0.3198286705,6.9978519286
2,'1 ',84.7177624287,17.5456887762
3,'1 ',5.8017882658,26.8372933492
--end of generation dispatch
Solution2.txt
solution2.txt must contain solution information from the contingency cases. It contains the following information:
1. contingency generator dispatch (“--contingency generator”; “--end of contingency generator”)
1. contingency ID (“conID”)
2. generator ID (“genID”)
3. bus ID (“busID”)
4. unit ID (“unitID”)
5. Reactive power in megaVar (“q(MW”)
2. contingency bus information (“--bus”; “--end of bus”)
1. contingency ID (“contingency id”)
2. bus ID (“bus id”)
3. Voltage in per unit (“v(pu)”)
4. Voltage angle in degree (“theta(deg)”)
3. contingency delta (--Delta”; “--end of Delta”)
1. contingency ID (“contingency id”)
2. Delta (“Delta(MW)”)
4. contingency line flow information (“--line flow”; ”--end of line flow”)
1. contingency ID (“contingency id”)
2. line ID (“line id”)
3. origin bus ID (“origin bus id”)
4. destination bus ID (“destination bus id”)
5. circuit ID (“circuit id”)
6. real power in megawatts at origin (“p_origin(MW)”)
7. reactive power in MVar at origin (“q_origin(MVar)”)
8. real power in megawatts at destination (“p_destination(MW)”)
9. reactive power in MVar at destination (“q_destination(MVar)”)
The Phase 0 IEEE 14 bus contents of Scenario1/solution2.txt would look like the following (competitor’s values may be different):
--contingency generator
conID,genID,busID,unitID,q(MW)
1,l_14,1,'1 ',1.8920439657
1,l_17,6,'1 ',-13.0424143005
1,l_18,8,'1 ',7.2486797834
1,l_15,2,'1 ',17.7006839160
1,l_16,3,'1 ',26.9101533072
--end of contingency generator
--bus
contingency id,bus id,v(pu),theta(deg)
0,8,1.1000000000,5.5864770127
0,2,1.0914701645,8.1398994078
0,14,1.0628888503,6.4505375932
0,10,1.0741009382,6.1122501823
0,3,1.0654280495,3.4058096240
0,7,1.0887940120,5.5595254296
0,9,1.0791972126,5.3373738635
0,6,1.1000000000,11.3165871591
0,12,1.0865543223,10.2294798690
0,11,1.0816641774,8.5372192167
0,1,1.0956591539,8.7574065074
0,13,1.0801097385,9.7951050674
0,4,1.0697105064,5.9440132240
0,5,1.0732898620,7.2148842999
1,8,1.1000000000,-0.7532229238
1,2,1.0914701645,1.8538326988
1,14,1.0598341609,-0.0743928645
1,10,1.0733983766,-0.2261850840
1,3,1.0654280495,-2.8808294176
1,7,1.0883923500,-0.7806842204
1,9,1.0784377053,-1.0286520888
1,6,1.1000000000,5.1046567042
1,12,1.0587544948,2.7149743850
1,11,1.0812228268,2.2622242346
1,1,1.0956591539,2.4723694497
1,13,1.0738404326,3.0895688263
1,4,1.0695266224,-0.3486365532
1,5,1.0732096990,0.9333968779
--end of bus
--Delta
contingency id,Delta(MW)
1,0.0019761473
--end of Delta
--line flow
contingency id,line id,origin bus id,destination bus id,circuit id, p_origin(MW) q_origin(MVar), p_destination(MW), q_destination(MVar)
0,i_11,7,9,'BL',4.1413318422,9.5061994545,-4.1413318422,-9.4064239939
0,i_14,10,11,'BL',-22.9761326646,6.1272750623,23.3782748731,-5.1859045079
0,i_17,4,7,'BL',3.8215031717,2.6172876907,-3.8215031717,-2.5797860834
0,i_18,4,9,'BL',2.2679201960,4.9215656632,-2.2679201960,-4.7875472966
0,i_19,5,6,'BL',-35.9525204199,24.8652624433,35.9525204199,-21.2339571641
0,i_1,1,5,'BL',15.9641439290,4.3593613937,-15.8253740474,-9.5734621036
0,i_6,4,5,'BL',-57.3737425289,9.7671310853,57.7689110106,-8.5206483317
0,i_9,6,13,'BL',26.1622121170,3.8319397860,-25.7799935330,-3.0792320773
0,i_4,2,5,'BL',13.2243134554,5.1075898562,-13.1161456412,-8.8311681583
0,i_3,2,4,'BL',27.0351993991,3.0208504059,-26.6662570887,-5.8718879653
0,i_10,7,8,'BL',-0.3198286705,-6.9264133711,0.3198286705,6.9978519286
0,i_12,9,10,'BL',-14.0616138860,11.9276805523,14.1544761136,-11.6810015761
0,i_2,2,3,'BL',49.5701517682,1.9868853878,-48.5926008283,-2.9633522332
0,i_0,1,2,'BL',22.0008167502,-2.5009950960,-21.9226033984,-3.5744969015
0,i_15,12,13,'BL',3.7549512193,-0.6300386655,-3.7278244221,0.6545819582
0,i_8,6,12,'BL',9.4916104689,1.3053581664,-9.3983668501,-1.1112921822
0,i_16,13,14,'BL',17.8421446777,-2.8566525730,-17.3637689253,3.8306438523
0,i_13,9,14,'BL',-4.2129398200,8.5699707507,4.3124667999,-8.3582635299
0,i_5,3,4,'BL',-26.2675003800,7.5512088127,26.7152631642,-7.8672085362
0,i_7,6,11,'BL',27.8375735276,-2.4490101532,-27.2245772023,3.7327011314
1,i_11,7,9,'BL',4.6176371063,9.8586961607,-4.6176371063,-9.7486335316
1,i_14,10,11,'BL',-23.5600133212,6.2615917077,23.9832166878,-5.2709193053
1,i_17,4,7,'BL',4.2918799941,2.7319226632,-4.2918799941,-2.6866626481
1,i_18,4,9,'BL',2.5399988694,5.0368539304,-2.5399988694,-4.8915758208
1,i_19,5,6,'BL',-36.5584065652,24.8681177588,36.5584065652,-21.1524989951
1,i_1,1,5,'BL',15.9411089231,4.4034282171,-15.8023788808,-9.6172700944
1,i_6,4,5,'BL',-57.9146903473,9.6884187522,58.3170944534,-8.4191126168
1,i_9,6,13,'BL',34.4914896899,5.1353881864,-33.8266903513,-3.8261907587
1,i_4,2,5,'BL',13.1895860305,5.1684098512,-13.0814381054,-8.8917511979
1,i_3,2,4,'BL',27.1345130495,3.1047842675,-26.7625299406,-5.9459265667
1,i_10,7,8,'BL',-0.3257571123,-7.1720335125,0.3257571123,7.2486797834
1,i_12,9,10,'BL',-14.6398441010,12.0770070160,14.7383567702,-11.8153182215
1,i_2,2,3,'BL',49.5757963155,1.9860298956,-48.5980277346,-2.9615798140
1,i_0,1,2,'BL',22.0337324924,-2.5113842514,-21.9552873732,-3.5634001262
1,i_15,12,13,'BL',-5.6434156307,-1.7413308477,5.7121581782,1.8035264858
1,i_16,13,14,'BL',16.4488588956,-3.2586384193,-16.0320577524,4.1072614454
1,i_13,9,14,'BL',-2.8863256675,8.8357462988,2.9807556271,-8.6348811230
1,i_5,3,4,'BL',-26.1647482212,7.6222963516,26.6100283387,-7.9443808414
1,i_7,6,11,'BL',28.4705959846,-2.4752205733,-27.8295190169,3.8177159288
--end of line flow
Evaluation Platform Environment
The Evaluation Platform hardware consists of a dedicated 4-node cluster with a Mellanox 4x FDR Infiniband interconnect (54.54 Gigabits/second data bandwidth) where each node has 64 GiB of 4-channel 2133 MHz DDR4 SDRAM (68 Gigabytes/second) memory and two Intel Xeon E5-2670 v3 (Haswell) CPUs, each with 12 cores (24 cores per node) and a clock speed of 2.30 GHz.
Each submission will have exclusive access to only one of the four nodes.
The Evaluation Platform software uses the CentOS Linux release 7.3.1611 (Core) operating system. A list of software in /usr/bin and /opt/stack/bin is available for download. Additional software available includes MATPOWER 6.0 using MATLAB 2017a. In addition to MATLAB, the following programs and toolboxes from MathWorks are available: Simulink; Control System Toolbox; Global Optimization Toolbox; Optimization Toolbox; Parallel Computing Toolbox; Signal Processing Toolbox; Simscape; and Simscape Power Systems. The GAMS modeling language Distribution 24.8, with a full set of solvers, is available. Other solver libraries available include IBM® ILOG CPLEX, GUROBI, Artelys Knitro®, and FICO® Xpress.
Requests for additional software will be considered. Send them to the GO Operations Team.
Please use the Competition Forum or contact the GO Operations Team to comment about any aspect of the Evaluation Platform that might hurt performance.
| 2017-08-24T10:26: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.37823745608329773, "perplexity": 3662.719200061411}, "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-34/segments/1502886133449.19/warc/CC-MAIN-20170824101532-20170824121532-00294.warc.gz"}
|
https://aperta.ulakbim.gov.tr/record/228038/export/schemaorg_jsonld
|
Dergi makalesi Açık Erişim
# An Optimum Volumetric Array Design Approach for Both Azimuth and Elevation Isotropic DOA Estimation
Tansu FİLİK; Fesih Keskin
### JSON-LD (schema.org)
{
"@context": "https://schema.org/",
"@id": 228038,
"@type": "ScholarlyArticle",
"creator": [
{
"@type": "Person",
"affiliation": "Eskisehir Technical University",
"name": "Tansu F\u0130L\u0130K"
},
{
"@type": "Person",
"affiliation": "Eskisehir Technical University",
"name": "Fesih Keskin"
}
],
"datePublished": "2020-10-06",
"description": "<p>In this study, a new volumetric array design approach is presented for both azimuth and elevation isotropic direction of arrival (DOA) estimation. The presented method uses a minimum number of additional sensors to extend the given arrays to a volumetric array which has equal values for the Cramér-Rao lower bound (CRLB) for the entire azimuth and elevation angles. This approach can be applied to all arbitrary linear and planar arrays. Moreover, the design approach also takes into account the electromagnetic mutual coupling (MC) effect between the array elements and both the azimuth and elevation angular ambiguity uncertainties in an optimum manner while extending the array. It has been verified both analytically and with simulations that the designed volumetric arrays satisfy the two dimensional (2-D) isotropic DOA estimation conditions. The proposed approach is applied to Uniform Linear Arrays (ULA), Uniform Circular Arrays (UCA), V-shaped Arrays, and an arbitrary planar array to extend to optimum volumetric arrays with considerable results.</p>",
"headline": "An Optimum Volumetric Array Design Approach for Both Azimuth and Elevation Isotropic DOA Estimation",
"identifier": 228038,
"inLanguage": {
"@type": "Language",
"alternateName": "eng",
"name": "English"
},
"keywords": [
"2-D isotropic array,",
"3-D arrays,",
"angular ambiguity",
"array signal processing",
"direction of arrival,"
],
"name": "An Optimum Volumetric Array Design Approach for Both Azimuth and Elevation Isotropic DOA Estimation",
"url": "https://aperta.ulakbim.gov.tr//record/228038"
}
16
10
görüntülenme
indirilme
Görüntülenme 16 İndirme 10 Veri hacmi 77.3 MB Tekil görüntülenme 14 Tekil indirme 9
| 2021-11-29T03:04:07 |
{"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.28167009353637695, "perplexity": 8413.7381080827}, "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/1637964358685.55/warc/CC-MAIN-20211129014336-20211129044336-00368.warc.gz"}
|
https://www.nist.gov/publications/elastic-modulus-characterization-nanocomposite-latex-coatings?pub_id=861660
|
# Elastic Modulus Characterization of Nanocomposite Latex Coatings
Created September 24, 2008, Updated February 19, 2017
| 2017-05-29T19:21:18 |
{"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.8811878561973572, "perplexity": 11747.63954145376}, "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-2017-22/segments/1495463612537.91/warc/CC-MAIN-20170529184559-20170529204559-00107.warc.gz"}
|
https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=17432
|
License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2022.40
URN: urn:nbn:de:0030-drops-174327
URL: https://drops.dagstuhl.de/opus/volltexte/2022/17432/
Go to the corresponding LIPIcs Volume Portal
### Parikh Automata over Infinite Words
pdf-format:
### Abstract
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable algorithmic properties of finite automata. Here, we study the extension of the classical framework onto infinite inputs: We introduce reachability, safety, Büchi, and co-Büchi Parikh automata on infinite words and study expressiveness, closure properties, and the complexity of verification problems.
We show that almost all classes of automata have pairwise incomparable expressiveness, both in the deterministic and the nondeterministic case; a result that sharply contrasts with the well-known hierarchy in the ω-regular setting. Furthermore, emptiness is shown decidable for Parikh automata with reachability or Büchi acceptance, but undecidable for safety and co-Büchi acceptance. Most importantly, we show decidability of model checking with specifications given by deterministic Parikh automata with safety or co-Büchi acceptance, but also undecidability for all other types of automata. Finally, solving games is undecidable for all types.
### BibTeX - Entry
@InProceedings{guha_et_al:LIPIcs.FSTTCS.2022.40,
author = {Guha, Shibashis and Jecker, Isma\"{e}l and Lehtinen, Karoliina and Zimmermann, Martin},
title = {{Parikh Automata over Infinite Words}},
booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)},
pages = {40:1--40:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-261-7},
ISSN = {1868-8969},
year = {2022},
volume = {250},
editor = {Dawar, Anuj and Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17432},
URN = {urn:nbn:de:0030-drops-174327},
doi = {10.4230/LIPIcs.FSTTCS.2022.40},
annote = {Keywords: Parikh automata, \omega-automata, Infinite Games}
}
Keywords: Parikh automata, ω-automata, Infinite Games Collection: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022) Issue Date: 2022 Date of publication: 14.12.2022
DROPS-Home | Fulltext Search | Imprint | Privacy
| 2023-03-27T14:14:16 |
{"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.4740491509437561, "perplexity": 12001.182604522384}, "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/1679296948632.20/warc/CC-MAIN-20230327123514-20230327153514-00621.warc.gz"}
|
http://wikimechanics.org/banner-constants-sun
|
Banner: Sun Constant
Nouns Definition Sun Constant $U^{\sf{d}} = 0 \ \ \ \ \left( \sf{\text{MeV}} \right)$ 1-3
page revision: 11, last edited: 02 Sep 2018 13:45
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License
| 2018-09-22T03:50: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.4269290268421173, "perplexity": 13814.209025091925}, "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-39/segments/1537267158011.18/warc/CC-MAIN-20180922024918-20180922045318-00088.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Ababuska.ivo-m
|
## Babuška, Ivo
Compute Distance To:
Author ID: babuska.ivo-m Published as: Babuška, Ivo; Babuška, I.; Babuska, Ivo; Babuška, Ivo M.; Babuska, Ivo M.; Babuska, I.; Babusǩa, I.; Babuška, J.; Babuska more...less Further Spellings: Babuška, Ivo Milan Homepage: https://users.ices.utexas.edu/~babuska/ External Links: MacTutor · MGP · Wikidata · dblp · GND · IdRef
Documents Indexed: 387 Publications since 1954, including 10 Books 8 Contributions as Editor · 2 Further Contributions Biographic References: 9 Publications Co-Authors: 161 Co-Authors with 295 Joint Publications 3,657 Co-Co-Authors
all top 5
### Co-Authors
72 single-authored 40 Strouboulis, Theofanis 23 Osborn, John E. 22 Guo, Benqi 19 Banerjee, Uday 16 Gangaraj, S. K. 16 Tempone, Raúl F. 15 Oden, John Tinsley 14 Rheinboldt, Werner C. 12 Szabó, Barna Aladar 11 Suri, Manil 11 Upadhyay, Chandra Shekhar 10 Vitásek, Emil 9 Copps, K. 7 Nobile, Fabio 7 Práger, Milan 7 Zhang, Qinghui 6 Pitkäranta, Juhani 6 Sauter, Stefan A. 6 Zhang, Lin 5 Andersson, Börje 5 Datta, Dibyendu K. 5 Ihlenburg, Frank 5 Lipton, Robert P. 5 Schwab, Christoph 5 Vogelius, Michael S. 4 Demkowicz, Leszek F. 4 Elman, Howard C. 4 Melenk, Jens Markus 4 Nistor, Victor 4 Oh, Hae-Soo 4 Rodríguez, Rodolfo 3 Bieterman, Michael B. 3 Chleboun, Jan 3 Flaherty, Joseph E. 3 Morgan, Richard C. 3 von Petersdorff, Tobias 3 Výborný, Rudolf 3 Wang, Delin 2 Arnold, Douglas Norman 2 Aziz, A. Kadir 2 Baumann, Carlos Erik 2 Bouillard, Philippe 2 Ciarlet, Philippe Gaston 2 Deraemaeker, Arnaud 2 Dowding, Kevin J. 2 Feng, Yusheng 2 Gago, J. 2 Gatica, Gabriel N. 2 Gupta, Varun 2 Hidajat, Realino 2 Hills, Richard G. 2 Hlaváček, Ivan 2 Hughes, Thomas J. R. 2 Janik, Tadeusz J. 2 Kautsky, Jaroslav 2 Kellogg, Bruce 2 Kelly, Donald W. 2 Kergrene, Kenan 2 Kroupa, František 2 Martinsson, Per-Gunnar 2 Motamed, Mohammad 2 Paez, Thomas L. 2 Plank, Lothar 2 Rank, Ernst 2 Red-Horse, John R. 2 Sawlan, Zaid 2 Scavino, Marco 2 Silva, Renato S. 2 Stephan, Ernst Peter 2 Stuebner, Michael 2 Szymczak, William G. 2 Tarfulea, Nicolae 2 Whiteman, John Robert 2 Zhang, Zhimin 2 Zienkiewicz, Olgierd Cecil 2 Zouraris, Georgios E. 1 Actis, Ricardo L. 1 Adjerid, Slimane 1 Ainsworth, Mark 1 Babušková, Renata 1 Bass, Jon M. 1 Bazilevs, Yuri 1 Belytschko, Ted Bohdan 1 Biduat, L. 1 Bischoff, Dieter Ernst 1 Brand, G. F. 1 Browne, James C. 1 Caloz, Gabriel 1 Chandra, Jagdish 1 Chatzipantelidis, Panagiotis 1 Chayapathy, Bidar K. 1 Chen, Jiuhua 1 Coffignal, G. 1 Cui, Cu 1 de Arantes Oliveira, E. R. 1 Deb, Manas K. 1 Devloo, Philippe Remy Bernard 1 D’Harcourt, J. M. 1 Diller, Kenneth R. 1 Dorr, Milo R. ...and 72 more Co-Authors
all top 5
### Serials
77 Computer Methods in Applied Mechanics and Engineering 36 SIAM Journal on Numerical Analysis 29 International Journal for Numerical Methods in Engineering 25 Numerische Mathematik 17 Aplikace Matematiky 15 Mathematics of Computation 9 Časopis Pro Pěstování Matematiky 9 Numerical Methods for Partial Differential Equations 9 M$$^3$$AS. Mathematical Models & Methods in Applied Sciences 8 SIAM Journal on Mathematical Analysis 6 Archives of Mechanics 6 Journal of Computational and Applied Mathematics 6 Finite Elements in Analysis and Design 5 Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 5 Czechoslovak Mathematical Journal 4 Computers & Mathematics with Applications 4 Commentationes Mathematicae Universitatis Carolinae 3 Computers and Structures 3 Journal of Computational Physics 3 Wissenschaftliche Zeitschrift der Hochschule für Architektur und Bauwesen Weimar 3 Communications in Applied Numerical Methods 3 Computational Mechanics 3 SIAM Review 3 SIAM Journal on Scientific Computing 2 Computing 2 Applied Numerical Mathematics 2 RAIRO. Modélisation Mathématique et Analyse Numérique 2 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 2 Advances in Computational Mathematics 2 Computer Assisted Mechanics and Engineering Sciences 2 Czechoslovak Journal of Physics 2 International Journal of Numerical Analysis and Modeling 1 Acta Mechanica 1 Applicable Analysis 1 Archive for Rational Mechanics and Analysis 1 Mathematical Methods in the Applied Sciences 1 ACM Transactions on Mathematical Software 1 Annales Polonici Mathematici 1 BIT 1 Journal of Approximation Theory 1 Rendiconti del Seminario Matematico 1 Advances in Applied Mathematics 1 SIAM Journal on Scientific and Statistical Computing 1 Journal of Complexity 1 Mathematical and Computer Modelling 1 IMPACT of Computing in Science and Engineering 1 Applications of Mathematics 1 Bulletin de l’Académie Polonaise des Sciences, Série des Sciences Techniques 1 International Journal of Computer Mathematics 1 Pokroky Matematiky, Fyziky & Astronomie 1 U.S.S.R. Computational Mathematics and Mathematical Physics 1 Wissenschaftliche Zeitschrift der Technischen Universität Dresden 1 Advances in Engineering Software 1 Tatra Mountains Mathematical Publications 1 Communications in Numerical Methods in Engineering 1 Mathematical Modelling and Scientific Computing 1 Computing and Visualization in Science 1 Comptes Rendus de l’Académie des Sciences. Série II. Fascicule b. Mécanique, Physique, Astronomie 1 Multiscale Modeling & Simulation 1 International Journal of Computational Methods 1 Acta Numerica 1 European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis 1 Acta Facultatis Rerum Naturalium Universitatis Comenianae. Mathematica 1 The IMA Volumes in Mathematics and its Applications 1 Lecture Notes in Computational Science and Engineering 1 Wiley Series in Computational Mechanics
all top 5
### Fields
266 Numerical analysis (65-XX) 157 Partial differential equations (35-XX) 141 Mechanics of deformable solids (74-XX) 26 Ordinary differential equations (34-XX) 21 Fluid mechanics (76-XX) 14 General and overarching topics; collections (00-XX) 14 Approximations and expansions (41-XX) 10 Probability theory and stochastic processes (60-XX) 8 Functional analysis (46-XX) 6 History and biography (01-XX) 5 Statistics (62-XX) 5 Computer science (68-XX) 4 Operator theory (47-XX) 4 Classical thermodynamics, heat transfer (80-XX) 3 Calculus of variations and optimal control; optimization (49-XX) 3 Mechanics of particles and systems (70-XX) 2 Functions of a complex variable (30-XX) 2 Potential theory (31-XX) 1 Mathematical logic and foundations (03-XX) 1 Special functions (33-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Integral equations (45-XX) 1 Optics, electromagnetic theory (78-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Biology and other natural sciences (92-XX)
### Citations contained in zbMATH Open
330 Publications have been cited 14,497 times in 8,085 Documents Cited by Year
The partition of unity finite element method: basic theory and applications. Zbl 0881.65099
Melenk, J. M.; Babuška, Ivo
1996
The partition of unity method. Zbl 0949.65117
Babuška, I.; Melenk, J. M.
1997
The finite element method with Lagrangian multipliers. Zbl 0258.65108
Babuška, Ivo
1973
Error estimates for adaptive finite element computations. Zbl 0398.65069
Babuška, Ivo; Rheinboldt, W. C.
1978
A-posteriori error estimates for the finite element method. Zbl 0396.65068
Babuška, Ivo; Rheinboldt, W. C.
1978
A stochastic collocation method for elliptic partial differential equations with random input data. Zbl 1151.65008
Babuška, Ivo; Nobile, Fabio; Tempone, Raúl
2007
Error-bounds for finite element method. Zbl 0214.42001
Babuška, Ivo
1971
Galerkin finite element approximations of stochastic elliptic partial differential equations. Zbl 1080.65003
Babuska, Ivo; Tempone, Raúl; Zouraris, Georgios E.
2004
The generalized finite element method. Zbl 0997.74069
Strouboulis, T.; Copps, K.; Babuška, I.
2001
Eigenvalue problems. Zbl 0875.65087
Babuška, Ivo; Osborn, J.
1991
The design and analysis of the generalized finite element method. Zbl 0983.65127
Strouboulis, T.; Babuška, I.; Copps, K.
2000
Finite element solution of the Helmholtz equation with high wave number. I: The $$h$$-version of the FEM. Zbl 0838.65108
Ihlenburg, Frank; Babuška, Ivo
1995
A discontinuous $$hp$$ finite element method for diffusion problems. Zbl 0926.65109
Oden, J. Tinsley; Babuška, Ivo; Baumann, Carlos Erik
1998
Special finite element methods for a class of second order elliptic problems with rough coefficients. Zbl 0807.65114
Babuška, Ivo; Caloz, Gabriel; Osborn, John E.
1994
The h-p version of the finite element method with quasiuniform meshes. Zbl 0623.65113
Babuška, I.; Suri, Manil
1987
On the angle condition in the finite element method. Zbl 0324.65046
Babuška, Ivo; Aziz, A. K.
1976
The finite element method for elliptic equations with discontinuous coefficients. Zbl 0199.50603
Babuška, Ivo
1970
A generalized finite element method for solving the Helmholtz equation in two dimensions with minimal pollution. Zbl 0863.73055
Babuška, Ivo; Ihlenburg, Frank; Paik, Ellen T.; Sauter, Stefan A.
1995
Solution of stochastic partial differential equations using Galerkin finite element techniques. Zbl 1075.65006
Deb, Manas K.; Babuška, Ivo M.; Oden, J. Tinsley
2001
Finite element solution of the Helmholtz equation with high wave number. II: The $$h-p$$ version of the FEM. Zbl 0884.65104
Ihlenburg, Frank; Babuška, Ivo
1997
The p-version of the finite element method. Zbl 0487.65059
Babuška, Ivo; Szabo, B. A.; Katz, I. N.
1981
Generalized finite element methods: Their performance and their relation to mixed methods. Zbl 0528.65046
Babuška, Ivo; Osborn, J. E.
1983
Survey of meshless and generalized finite element methods: A unified approach. Zbl 1048.65105
Babuška, Ivo; Banerjee, Uday; Osborn, John E.
2003
Is the pollution effect of the FEM avoidable for the Helmholtz equation considering high wave numbers? Zbl 0894.65050
Babuška, Ivo M.; Sauter, Stefan A.
1997
$$n$$-widths, sup-infs, and optimality ratios for the $$k$$-version of the isogeometric finite element method. Zbl 1227.65093
Evans, John A.; Bazilevs, Yuri; Babuška, Ivo; Hughes, Thomas J. R.
2009
The $$p$$ and $$h-p$$ versions of the finite element method, basic principles and properties. Zbl 0813.65118
Babuška, Ivo; Suri, Manil
1994
The finite element method with penalty. Zbl 0299.65057
Babuška, Ivo
1973
The optimal convergence rate of the p-version of the finite element method. Zbl 0637.65103
Babuška, I.; Suri, Manil
1987
Direct and inverse error estimates for finite elements with mesh refinements. Zbl 0423.65057
Babuška, Ivo; Kellogg, R. B.; Pitkäranta, J.
1979
Survey lectures on the mathematical foundations of the finite element method. With the collaboration of G. Fix and R. B. Kellogg. Zbl 0268.65052
Babuška, Ivo; Aziz, A. K.
1972
A stochastic collocation method for elliptic partial differential equations with random input data. Zbl 1226.65004
Babuška, Ivo; Nobile, Fabio; Tempone, Raúl
2010
Dispersion and pollution of the FEM solution for the Helmholtz equation in one, two and three dimensions. Zbl 0957.65098
Deraemaeker, Arnaud; Babuška, Ivo; Bouillard, Philippe
1999
The h-p version of the finite element method. I. The basic approximation results. Zbl 0634.73058
Guo, B.; Babuška, I.
1986
Finite element analysis. Zbl 0792.73003
Szabó, Barna; Babuška, Ivo
1991
Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation. Zbl 1087.65004
Babuška, Ivo; Tempone, Raúl; Zouraris, Georgios E.
2005
A feedback finite element method with a posteriori error estimation. I: The finite element method and some basic properties of the a posteriori error estimator. Zbl 0593.65064
Babuška, Ivo; Miller, A.
1987
The generalized finite element method: An example of its implementation and illustration of its performance. Zbl 0955.65080
Strouboulis, T.; Copps, K.; Babuška, I.
2000
Is the pollution effect of the FEM avoidable for the Helmholtz equation considering high wave numbers? Zbl 0956.65095
Babuska, Ivo M.; Sauter, Stefan A.
2000
Stable generalized finite element method (SGFEM). Zbl 1239.74093
Babuška, I.; Banerjee, U.
2012
Finite element-Galerkin approximation of the eigenvalues and eigenvectors of selfadjoint problems. Zbl 0675.65108
Babuška, I.; Osborn, J. E.
1989
Nonconforming elements in the finite element method with penalty. Zbl 0237.65066
Babuška, Ivo; Zlámal, Milos
1973
On locking and robustness in the finite element method. Zbl 0763.65085
Babuška, Ivo; Suri, Manil
1992
Dispersion analysis and error estimation of Galerkin finite element methods for the Helmholtz equation. Zbl 0851.73062
Ihlenburg, Frank; Babuška, Ivo
1995
The p- and h-p versions of the finite element method. An overview. Zbl 0731.73078
Babuška, Ivo; Suri, Manil
1990
Validation of a posteriori error estimators by numerical approach. Zbl 0811.65088
Babuška, I.; Strouboulis, T.; Upadhyay, C. S.; Gangaraj, S. K.; Copps, K.
1994
The post-processing approach in the finite element method. I. Calculation of displacements, stresses and other higher derivatives of the displacements. Zbl 0535.73052
Babuška, Ivo; Miller, A.
1984
Analysis of mixed methods using mesh dependent norms. Zbl 0472.65083
Babuška, Ivo; Osborn, J.; Pitkäranta, J.
1980
Locking effects in the finite element approximation of elasticity problems. Zbl 0762.65057
Babuška, Ivo; Suri, Manil
1992
The h-p version of the finite element method for domains with curved boundaries. Zbl 0655.65124
Babuška, I.; Guo, B. Q.
1988
The finite element methods and its reliability. Zbl 0995.65501
Babuška, Ivo; Strouboulis, Theofanis
2001
The h, p and h-p versions of the finite element method in 1 dimension. I. The error analysis of the p-version. Zbl 0614.65088
Gui, W.; Babuška, I.
1986
On solving elliptic stochastic partial differential equations. Zbl 1019.65010
Babuška, Ivo; Chatzipantelidis, Panagiotis
2002
Regularity of the solution of elliptic problems with piecewise analytic data. I: Boundary value problems for linear elliptic equations of second order. Zbl 0647.35021
Babuška, I.; Guo, B. Q.
1988
Damage analysis of fiber composites. I: Statistical analysis of fiber scale. Zbl 0956.74048
Babuška, Ivo; Andersson, Börje; Smith, Paul J.; Levin, Klas
1999
The h-p version of the finite element method. II. General results and applications. Zbl 0634.73059
Guo, B.; Babuška, I.
1986
Efficient preconditioning for the $$p$$-version finite element method in two dimensions. Zbl 0754.65083
Babuška, I.; Craig, A.; Mandel, J.; Pitkäranta, J.
1991
Optimal local approximation spaces for generalized finite element methods with application to multiscale problems. Zbl 1229.65195
Babuska, Ivo; Lipton, Robert
2011
The h, p and h-p versions of the finite element method in 1 dimension. III. The adaptive h-p version. Zbl 0614.65090
Gui, W.; Babuška, I.
1986
Generalized finite element methods – main ideas, results and perspective. Zbl 1081.65107
Babuška, Ivo; Banerjee, Uday; Osborn, John E.
2004
The generalized finite element method for Helmholtz equation: theory, computation, and open problems. Zbl 1120.76044
Strouboulis, Theofanis; Babuška, Ivo; Hidajat, Realino
2006
The post-processing approach in the finite element method. II. The calculation of stress intensity factors. Zbl 0535.73053
Babuška, Ivo; Miller, A.
1984
Error estimates for the combined h and p versions of the finite element method. Zbl 0487.65058
Babuška, Ivo; Dorr, Milo R.
1981
Feedback and adaptive finite element solution of one-dimensional boundary value problems. Zbl 0574.65098
Babuška, Ivo; Vogelius, M.
1984
The h, p and h-p versions of the finite element method in 1 dimension. II. The error analysis of the h- and h-p versions. Zbl 0614.65089
Gui, W.; Babuška, I.
1986
Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle. Zbl 0862.65006
Chen, Qi; Babuška, Ivo
1995
Approximation properties of the $$h$$-$$p$$ version of the finite element method. Zbl 0882.65096
Babuška, Ivo; Guo, B. Q.
1996
A residual-based a posteriori error estimator for the Stokes-Darcy coupled problem. Zbl 1410.76148
Babuška, Ivo; Gatica, Gabriel N.
2010
The post-processing approach in the finite element method. III. A posteriori error estimates and adaptive mesh selection. Zbl 0571.73074
Babuška, Ivo; Miller, A.
1984
Numerical processes in differential equations. (In cooperation with R. Radok. Translated from the Czech by Milada Borůvková). Zbl 0156.16003
Babuška, Ivo; Práger, Milan; Vitásek, Emil
1966
Mixed-hybrid finite element approximations of second-order elliptic boundary-value problems. Zbl 0382.65056
Babuška, Ivo; Oden, J. T.; Lee, J. K.
1977
Can a finite element method perform arbitrarily badly? Zbl 0940.65086
Babuska, Ivo; Osborn, John E.
2000
Generalized finite element method using mesh-based handbooks: application to problems in domains with many voids. Zbl 1054.74059
Strouboulis, Theofanis; Zhang, Lin; Babuška, Ivo
2003
A discontinuous $$hp$$ finite element method for diffusion problems: 1-D analysis. Zbl 0940.65076
Babuška, I.; Baumann, C. E.; Oden, J. T.
1999
A stable and optimally convergent generalized FEM (SGFEM) for linear elastic fracture mechanics. Zbl 1286.74102
Gupta, V.; Duarte, C. A.; Babuška, I.; Banerjee, U.
2013
On the rates of convergence of the finite element method. Zbl 0498.65050
Babuška, Ivo; Szabo, Barna
1982
Direct and inverse approximation theorems for the $$p$$-version of the finite element method in the framework of weighted Besov spaces. I: Approximability of functions in the weighted Besov spaces. Zbl 1008.65078
Babuška, Ivo; Guo, Benqi
2001
Reliable and robust a posteriori error estimation for singularly perturbed reaction-diffusion problems. Zbl 0948.65114
Ainsworth, Mark; Babuska, Ivo
1998
A posteriori estimation and adaptive control of the pollution error in the $$h$$-version of the finite element method. Zbl 0844.65078
Babuška, Ivo; Strouboulis, T.; Upadhyay, C. S.; Gangaraj, S. K.
1995
Computer-based proof of the existence of superconvergence points in the finite element method; superconvergence of the derivatives in finite element solutions of Laplace’s, Poisson’s, and the elasticity equations. Zbl 0854.65089
Babuška, Ivo; Strouboulis, T.; Upadhyay, C. S.; Gangaraj, S. K.
1996
Analysis of optimal finite-element meshes in $$R^1$$. Zbl 0431.65055
Babuška, Ivo; Rheinboldt, W. C.
1979
A posteriori error analysis of finite element solutions for one- dimensional problems. Zbl 0487.65060
Babuška, Ivo; Rheinboldt, Werner C.
1981
Finite element method for domains with corners. Zbl 0224.65031
Babuška, Ivo
1970
Benchmark computation and performance evaluation for a rhombic plate bending problem. Zbl 0675.73041
Babuška, Ivo; Scapolla, Terenzio
1989
Continuous dependence of eigenvalues on the domain. Zbl 0137.32302
Babuška, Ivo; Vyborny, Rudolf
1965
A comparison of approximate boundary conditions and infinite element methods for exterior Helmholtz problems. Zbl 0962.76055
Shirron, Joseph J.; Babuška, Ivo
1998
The problem of selecting the shape functions for a p-type finite element. Zbl 0705.73246
Babuška, I.; Griebel, M.; Pitkäranta, J.
1989
Adaptive approaches and reliability estimations in finite element analysis. Zbl 0396.73077
Babuška, Ivo; Rheinboldt, W. C.
1979
A posteriori error estimation for finite element solutions of Helmholtz’ equation. I: The quality of local indicators and estimators. Zbl 0974.76042
Babuška, I.; Ihlenburg, F.; Strouboulis, T.; Gangaraj, S. K.
1997
Accuracy estimates and adaptive refinements in finite element computations. Lectures presented at the international conference held in Lisbon, June 1984. Zbl 0663.65001
1986
The h-p version of the finite element method for parabolic equations. I: The p-version in time. Zbl 0693.65078
1989
Stable GFEM (SGFEM): improved conditioning and accuracy of GFEM/XFEM for three-dimensional fracture mechanics. Zbl 1423.74886
Gupta, V.; Duarte, C. A.; Babuška, I.; Banerjee, U.
2015
The p-version of the finite element method for domains with corners and for infinite domains. Zbl 0717.65084
Babuška, Ivo; Oh, Hae-Soo
1990
Regularity of the solutions for elliptic problems on nonsmooth domains in $$\mathbb{R}^ 3$$. I: Countably normed spaces on polyhedral domains. Zbl 0874.35019
Guo, Benqi; Babuška, Ivo
1997
Introduction to finite element analysis. Formulation, verification and validation. Zbl 1410.65003
Szabó, Barna; Babuška, Ivo
2011
A finite element scheme for domains with corners. Zbl 0252.65084
Babuška, Ivo; Rosenzweig, Michael B.
1972
The problem of plate modeling: Theoretical and computational results. Zbl 0764.73040
Babuška, I.; Li, Likang
1992
Verification and validation in computational engineering and science: basic concepts. Zbl 1198.74126
Babuska, Ivo; Oden, J. Tinsley
2004
Locking effects in the finite element approximation of plate models. Zbl 0827.73063
Suri, Manil; Babuška, Ivo; Schwab, Christoph
1995
Analysis of the efficiency of an a posteriori error estimator for linear triangular finite elements. Zbl 0759.65069
Babuška, Ivo; Durán, Ricardo; Rodríguez, Rodolfo
1992
Effect of numerical integration on meshless methods. Zbl 1229.65204
Babuška, Ivo; Banerjee, Uday; Osborn, John E.; Zhang, Qinghui
2009
A stable generalized finite element method (SGFEM) of degree two for interface problems. Zbl 1436.65192
Zhang, Qinghui; Babuška, Ivo
2020
Multiscale-spectral GFEM and optimal oversampling. Zbl 1442.65402
Babuška, Ivo; Lipton, Robert; Sinz, Paul; Stuebner, Michael
2020
Strongly stable generalized finite element method (SSGFEM) for a non-smooth interface problem. II: A simplified algorithm. Zbl 1436.74079
Zhang, Qinghui; Banerjee, Uday; Babuška, Ivo
2020
Strongly stable generalized finite element method (SSGFEM) for a non-smooth interface problem. Zbl 1440.74454
Zhang, Qinghui; Banerjee, Uday; Babuška, Ivo
2019
Spatial Poisson processes for fatigue crack initiation. Zbl 1440.74353
Babuška, Ivo; Sawlan, Zaid; Scavino, Marco; Szabó, Barna; Tempone, Raúl
2019
Pointwise error estimate of the Legendre expansion: the known and unknown features. Zbl 1440.65027
Babuška, Ivo; Hakula, Harri
2019
On roundoff error growth in elliptic problems. Zbl 1484.65102
Babuška, Ivo; Söderlind, Gustaf
2018
Strongly stable generalized finite element method: application to interface problems. Zbl 1439.74385
Babuška, Ivo; Banerjee, Uday; Kergrene, Kenan
2017
The computational modeling of problems on domains with small holes. Zbl 1439.74163
Babuška, Ivo; Soane, Ana Maria; Suri, Manil
2017
Stable generalized finite element method and associated iterative schemes; application to interface problems. Zbl 1425.74472
Kergrene, Kenan; Babuška, Ivo; Banerjee, Uday
2016
Robustness in stable generalized finite element methods (SGFEM) applied to Poisson problems with crack singularities. Zbl 1439.74479
Zhang, Qinghui; Babuška, Ivo; Banerjee, Uday
2016
A fuzzy-stochastic multiscale model for fiber composites, a one-dimensional study. Zbl 1425.74126
2016
Bayesian inference and model comparison for metallic fatigue data. Zbl 1426.62295
Babuška, Ivo; Sawlan, Zaid; Scavino, Marco; Szabó, Barna; Tempone, Raúl
2016
Stable GFEM (SGFEM): improved conditioning and accuracy of GFEM/XFEM for three-dimensional fracture mechanics. Zbl 1423.74886
Gupta, V.; Duarte, C. A.; Babuška, I.; Banerjee, U.
2015
Higher order stable generalized finite element method. Zbl 1304.65254
Zhang, Qinghui; Banerjee, Uday; Babuška, Ivo
2014
Machine computation using the exponentially convergent multiscale spectral generalized finite element method. Zbl 1320.74097
Babuška, Ivo; Huang, Xu; Lipton, Robert
2014
A stochastic multiscale method for the elastodynamic wave equation arising from fiber composites. Zbl 1423.74966
Babuška, Ivo; Motamed, Mohammad; Tempone, Raúl
2014
Dealing with uncertainties in engineering problems using only available data. Zbl 1296.76105
Babuška, Ivo; Silva, Renato S.
2014
A stable and optimally convergent generalized FEM (SGFEM) for linear elastic fracture mechanics. Zbl 1286.74102
Gupta, V.; Duarte, C. A.; Babuška, I.; Banerjee, U.
2013
Direct and inverse approximation theorems for the $$p$$-version of the finite element method in the framework of weighted Besov spaces. III: Inverse approximation theorems. Zbl 1382.65399
Guo, Benqi; Babuška, Ivo
2013
Stable generalized finite element method (SGFEM). Zbl 1239.74093
Babuška, I.; Banerjee, U.
2012
Superconvergence of elliptic reconstructions of finite element solutions of parabolic problems in domains with piecewise smooth boundaries. Zbl 1354.65198
Strouboulis, Theofanis; Wang, Delin; Babuška, Ivo
2012
The dome and the ring: verification of an old mathematical model for the design of a stiffened shell roof. Zbl 1252.74043
Pitkäranta, Juhani; Babuška, Ivo; Szabó, Barna
2012
Optimal local approximation spaces for generalized finite element methods with application to multiscale problems. Zbl 1229.65195
Babuska, Ivo; Lipton, Robert
2011
Introduction to finite element analysis. Formulation, verification and validation. Zbl 1410.65003
Szabó, Barna; Babuška, Ivo
2011
Finite elements. An introduction to the method and error estimation. Zbl 1206.65246
Babuška, Ivo; Whiteman, John R.; Strouboulis, Theofanis
2011
$$L^{2}$$-global to local projection: An approach to multiscale analysis. Zbl 1242.65234
Babuska, Ivo; Lipton, Robert
2011
The effect of numerical integration on the finite element approximation of linear functionals. Zbl 1210.65188
Babuška, Ivo; Banerjee, Uday; Li, Hengguang
2011
Numerical treatment of engineering problems with uncertainties. The fuzzy set approach and its application to the heat exchanger problem. Zbl 1242.76228
Babuška, Ivo; Silva, Renato S.
2011
A stochastic collocation method for elliptic partial differential equations with random input data. Zbl 1226.65004
Babuška, Ivo; Nobile, Fabio; Tempone, Raúl
2010
A residual-based a posteriori error estimator for the Stokes-Darcy coupled problem. Zbl 1410.76148
Babuška, Ivo; Gatica, Gabriel N.
2010
Local Jacobi operators and applications to the $$p$$-version of finite element method in two dimensions. Zbl 1218.65129
Guo, Benqi; Babuška, Ivo
2010
$$n$$-widths, sup-infs, and optimality ratios for the $$k$$-version of the isogeometric finite element method. Zbl 1227.65093
Evans, John A.; Bazilevs, Yuri; Babuška, Ivo; Hughes, Thomas J. R.
2009
Effect of numerical integration on meshless methods. Zbl 1229.65204
Babuška, Ivo; Banerjee, Uday; Osborn, John E.; Zhang, Qinghui
2009
The generalized finite element method for Helmholtz equation. II: Effect of choice of handbook functions, error due to absorbing boundary conditions and its assessment. Zbl 1169.76397
Strouboulis, Theofanis; Hidajat, Realino; Babuška, Ivo
2008
Quadrature for meshless methods. Zbl 1195.65165
Babuška, Ivo; Banerjee, Uday; Osborn, John E.; Li, Qiaoluan
2008
A systematic approach to model validation based on Bayesian updates and prediction related rejection criteria. Zbl 1139.74012
Babuška, I.; Nobile, F.; Tempone, R.
2008
Validation challenge workshop. Zbl 1155.74054
Hills, Richard G.; Pilch, Martin; Dowding, Kevin J.; Red-Horse, John; Paez, Thomas L.; Babuška, Ivo; Tempone, Raul
2008
Generalized finite element method for second-order elliptic operators with Dirichlet boundary conditions. Zbl 1153.65106
Babuška, Ivo; Nistor, Victor; Tarfulea, Nicolae
2008
Formulation of the static frame problem. Zbl 1388.74115
2008
The penetration function and its application to microscale problems. Zbl 1152.65105
Babuška, Ivo; Lipton, Robert; Stuebner, Michael
2008
Boundary value problems in spaces of distributions on smooth and polygonal domains. Zbl 1154.65085
Babuška, Ivo; Nistor, Victor
2008
Validation challenge workshop summary. Zbl 1388.00029
2008
Static frame challenge problem: Summary. Zbl 1140.74008
Babuška, I.; Tempone, R.
2008
A stochastic collocation method for elliptic partial differential equations with random input data. Zbl 1151.65008
Babuška, Ivo; Nobile, Fabio; Tempone, Raúl
2007
Superconvergence in the generalized finite element method. Zbl 1129.65075
Babuška, Ivo; Banerjee, Uday; Osborn, John E.
2007
Reliability of computational science. Zbl 1118.65030
Babuška, I.; Nobile, F.; Tempone, R.
2007
Homogenization of materials with periodic truss or frame micro-structures. Zbl 1115.74040
Martinsson, P. G.; Babuška, Ivo
2007
A global-local approach for the construction of enrichment functions for the generalized FEM and its application to three-dimensional cracks. en. Zbl 1323.74081
Duarte, C. Armando; Kim, Dae-Jin; Babuška, Ivo
2007
Assessment of the cost and accuracy of the generalized FEM. Zbl 1194.74474
Strouboulis, Theofanis; Zhang, Lin; Babuška, Ivo
2007
Mechanics of materials with periodic truss or frame micro-structures. Zbl 1140.74532
Martinsson, Per-Gunnar; Babuška, Ivo
2007
Dynamic data-driven finite element models for laser treatment of cancer. Zbl 1114.92043
Oden, J. T.; Diller, K. R.; Bajaj, C.; Browne, J. C.; Hazle, J.; Babuška, I.; Bass, J.; Biduat, L.; Demkowicz, L.; Elliott, A.; Feng, Y.; Fuentes, D.; Prudhomme, S.; Rylander, M. N.; Stafford, R. J.; Zhang, Y.
2007
Approximate and low regularity Dirichlet boundary conditions in the generalized finite element method. Zbl 1145.65093
Babuška, Ivo; Nistor, Victor; Tarfulea, Nicolae
2007
Interior maximum norm estimates for finite element discretizations of the Stokes equations. Zbl 1122.65101
Narasimhan, R.; Babuška, I.
2007
The generalized finite element method for Helmholtz equation: theory, computation, and open problems. Zbl 1120.76044
Strouboulis, Theofanis; Babuška, Ivo; Hidajat, Realino
2006
A posteriori error estimation for generalized finite element methods. Zbl 1119.65111
Strouboulis, Theofanis; Zhang, Lin; Wang, Delin; Babuška, Ivo
2006
Interior numerical approximation of boundary value problems with a distributional data. Zbl 1101.65105
Babuška, Ivo; Nistor, Victor
2006
On the generalized plane strain problem in thermoelasticity. Zbl 1124.74011
Babuška, Ivo; Szabó, Barna
2006
The reliability of computer predictions: can they be trusted? Zbl 1096.65043
Babuška, Ivo; Oden, J. Tinsley
2006
Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation. Zbl 1087.65004
Babuška, Ivo; Tempone, Raúl; Zouraris, Georgios E.
2005
Theory and methodology for estimation and control of errors due to modeling, approximation, and uncertainty. Zbl 1143.74373
Oden, J. Tinsley; Babuška, Ivo; Nobile, Fabio; Feng, Yusheng; Tempone, Raul
2005
Worst case scenario analysis for elliptic problems with uncertainty. Zbl 1082.65115
Babuška, I.; Nobile, F.; Tempone, R.
2005
The splitting method as a tool for multiple damage analysis. Zbl 1149.65321
2005
New fictitious domain methods: formulation and analysis. Zbl 1107.65102
Babuška, Ivo; Podnos, Eugene G.; Rodin, Gregory J.
2005
Galerkin finite element approximations of stochastic elliptic partial differential equations. Zbl 1080.65003
Babuska, Ivo; Tempone, Raúl; Zouraris, Georgios E.
2004
Generalized finite element methods – main ideas, results and perspective. Zbl 1081.65107
Babuška, Ivo; Banerjee, Uday; Osborn, John E.
2004
Verification and validation in computational engineering and science: basic concepts. Zbl 1198.74126
Babuska, Ivo; Oden, J. Tinsley
2004
$$p$$-version of the generalized FEM using mesh-based handbooks with applications to multiscale problems. Zbl 1059.65106
Strouboulis, Theofanis; Zhang, Lin; Babuška, Ivo
2004
Uncertain input data problems and the worst scenario method. Zbl 1116.74003
Hlaváček, Ivan; Chleboun, Jan; Babuška, Ivo
2004
On the approximability and the selection of particle shape functions. Zbl 1054.65116
Babuška, Ivo; Banerjee, Uday; Osborn, John E.
2004
Algebraic algorithms for the analysis of mechanical trusses. Zbl 1079.74045
Babuška, I.; Sauter, S. A.
2004
Efficient solution of lattice equations by the recovery method. I: Scalar elliptic problems. Zbl 1076.65097
Babuška, I.; Sauter, S. A.
2004
Survey of meshless and generalized finite element methods: A unified approach. Zbl 1048.65105
Babuška, Ivo; Banerjee, Uday; Osborn, John E.
2003
Generalized finite element method using mesh-based handbooks: application to problems in domains with many voids. Zbl 1054.74059
Strouboulis, Theofanis; Zhang, Lin; Babuška, Ivo
2003
$$p$$ interpolation error estimates for edge finite elements of variable order in two dimensions. Zbl 1067.78016
Demkowicz, L.; Babuska, I.
2003
On the mixed finite element method with Lagrange multipliers. Zbl 1021.65056
Babuška, Ivo; Gatica, Gabriel N.
2003
Research directions in computational mechanics. Zbl 1025.74503
Oden, J. Tinsley; Belytschko, Ted; Babuska, Ivo; Hughes, T. J. R.
2003
Solving stochastic partial differential equations based on the experimental data. Zbl 1052.60047
Babuška, Ivo; Liu, Kang-Man; Tempone, Raúl
2003
Effects of uncertainties in the domain on the solution of Dirichlet boundary value problems. Zbl 1016.65088
Babuška, Ivo; Chleboun, Jan
2003
On solving stochastic initial-value differential equations. Zbl 1049.60051
Babuška, Ivo; Liu, Kang-Man
2003
Guaranteed a posteriori error estimation for fully discrete solutions of parabolic problems. Zbl 1025.65052
Strouboulis, T.; Babuška, I.; Datta, D. K.
2003
On solving elliptic stochastic partial differential equations. Zbl 1019.65010
Babuška, Ivo; Chatzipantelidis, Panagiotis
2002
Meshless and generalized finite element methods: A survey of some major results. Zbl 1012.65119
Babuška, I.; Banerjee, U.; Osborn, J. E.
2002
On principles for the selection of shape functions for the generalized finite element method. Zbl 1016.65052
Babuška, Ivo; Banerjee, Uday; Osborn, John E.
2002
Effects of uncertainties in the domain on the solution of Neumann boundary value problems in two spatial dimensions. Zbl 1007.65086
Babuška, Ivo; Chleboun, Jan
2002
Direct and inverse approximation theorems for the $$p$$-version of the finite element method in the framework of weighted Besov spaces. II: Optimal rate of convergence of the $$p$$-version finite element solutions. Zbl 1026.65103
Babuška, Ivo; Guo, Benqi
2002
Mesh-independent $$p$$-orthotropic enrichment using the generalized finite element method. Zbl 1027.74065
Duarte, C. A.; Babuška, I.
2002
Can we trust the computational analysis of engineering problems? Zbl 1004.65059
Babuška, I.; Strouboulis, T.
2002
Mathematical modeling and numerical simulation in continuum mechanics. Proceedings of the international symposium, Yamaguchi, Japan, September 29 – October 3, 2000. Zbl 0976.00035
2002
The generalized finite element method. Zbl 0997.74069
Strouboulis, T.; Copps, K.; Babuška, I.
2001
Solution of stochastic partial differential equations using Galerkin finite element techniques. Zbl 1075.65006
Deb, Manas K.; Babuška, Ivo M.; Oden, J. Tinsley
2001
The finite element methods and its reliability. Zbl 0995.65501
Babuška, Ivo; Strouboulis, Theofanis
2001
Direct and inverse approximation theorems for the $$p$$-version of the finite element method in the framework of weighted Besov spaces. I: Approximability of functions in the weighted Besov spaces. Zbl 1008.65078
Babuška, Ivo; Guo, Benqi
2001
A posteriori error estimation for the semidiscrete finite element method of parabolic differential equations. Zbl 1013.65099
Babuška, I.; Ohnimus, S.
2001
On one approach to a posteriori error estimates for evolution problems solved by the method of lines. Zbl 0993.65103
Babuška, Ivo; Feistauer, Miloslav; Šolín, Pavel
2001
A posteriori estimators for the FEM: Analysis of the robustness of the estimators for the Poisson equation. Zbl 0991.65110
Zhang, L.; Strouboulis, T.; Babuška, I.
2001
$$\eta$$%-superconvergence of finite element solutions and error estimators. Zbl 0991.65109
Zhang, L.; Strouboulis, T.; Babuška, I.
2001
The design and analysis of the generalized finite element method. Zbl 0983.65127
Strouboulis, T.; Babuška, I.; Copps, K.
2000
The generalized finite element method: An example of its implementation and illustration of its performance. Zbl 0955.65080
Strouboulis, T.; Copps, K.; Babuška, I.
2000
Is the pollution effect of the FEM avoidable for the Helmholtz equation considering high wave numbers? Zbl 0956.65095
Babuska, Ivo M.; Sauter, Stefan A.
2000
...and 230 more Documents
all top 5
### Cited by 8,508 Authors
142 Babuška, Ivo 65 Oden, John Tinsley 63 Schwab, Christoph 55 Zhang, Zhimin 54 Hughes, Thomas J. R. 51 Demkowicz, Leszek F. 42 Yang, Yidu 39 Carstensen, Carsten 38 Ladevèze, Pierre 37 Bordas, Stéphane Pierre Alain 35 Belytschko, Ted Bohdan 35 Huang, Yunqing 34 Chen, Yanping 34 Düster, Alexander 34 Nobile, Fabio 34 Tempone, Raúl F. 33 Ainsworth, Mark 33 Rank, Ernst 33 Xie, Hehu 31 Repin, Sergeĭ Igorevich 31 Zheng, Hong 30 Gatica, Gabriel N. 28 Bi, Hai 28 Stephan, Ernst Peter 28 Strouboulis, Theofanis 28 Wheeler, Mary Fanett 27 Brenner, Susanne Cecelia 27 Díez, Pedro 27 Karniadakis, George Em 27 Rabczuk, Timon 26 Bazilevs, Yuri 26 Huerta, Antonio 26 Lin, Tao 26 Nicaise, Serge 26 Sangalli, Giancarlo 26 Xu, Jinchao 25 Sukumar, Natarajan 24 Calo, Victor Manuel 24 Gunzburger, Max D. 24 Quarteroni, Alfio M. 24 Sauter, Stefan A. 24 Suri, Manil 24 Wohlmuth, Barbara I. 23 Evans, John A. 23 Farhat, Charbel H. 23 Flaherty, Joseph E. 23 Guo, Benqi 23 Li, Hengguang 23 Perugia, Ilaria 22 Buffa, Annalisa 22 Heuer, Norbert 22 Hou, Thomas Yizhao 22 Liu, Gui-Rong 22 Wang, Junping 22 Wriggers, Peter 21 Banerjee, Uday 21 Beirão da Veiga, Lourenço 21 Dehghan Takht Fooladi, Mehdi 21 Harari, Isaac 21 He, Xiaoming 21 Loula, Abimael Fernando Dourado 21 Oh, Hae-Soo 21 Rodríguez, Rodolfo 20 Chen, Jiun-Shyan 20 Laghrouche, Omar 20 Lin, Yanping 20 Maday, Yvon 19 Brezzi, Franco 19 Lin, Guang 19 Schillinger, Dominik 19 Stenberg, Rolf 19 Sun, Shuyu 19 Yang, Yongtao 19 Ye, Xiu 18 Bernardi, Christine 18 Dolejší, Vít 18 Ghanem, Roger G. 18 Harbrecht, Helmut 18 Li, Jichun 18 Moës, Nicolas 18 Park, Eun-Jae 18 Seaïd, Mohammed 18 Szabó, Barna Aladar 17 Adjerid, Slimane 17 Bramble, James H. 17 Chung, Tsz Shun Eric 17 Franca, Leopoldo Luis Cabo Penna 17 Giani, Stefano 17 Guo, Ben-Yu 17 Han, Weimin 17 Liu, Wing Kam 17 Natarajan, Sundararajan 17 Pardo, David 17 Wihler, Thomas Pascal 17 Wu, Haijun 17 Xie, Xiaoping 16 Chamoin, Ludovic 16 Desmet, Wim 16 Dolbow, John E. 16 Girault, Vivette ...and 8,408 more Authors
all top 5
### Cited in 397 Serials
1,516 Computer Methods in Applied Mechanics and Engineering 499 Journal of Computational Physics 406 International Journal for Numerical Methods in Engineering 368 Journal of Computational and Applied Mathematics 306 Computers & Mathematics with Applications 290 Numerische Mathematik 277 Computational Mechanics 265 Mathematics of Computation 252 Journal of Scientific Computing 235 Applied Numerical Mathematics 188 Engineering Analysis with Boundary Elements 169 Applied Mathematics and Computation 124 SIAM Journal on Scientific Computing 101 SIAM Journal on Numerical Analysis 88 European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis 85 Numerical Methods for Partial Differential Equations 84 Advances in Computational Mathematics 83 M$$^3$$AS. Mathematical Models & Methods in Applied Sciences 78 Applied Mathematical Modelling 70 Communications in Numerical Methods in Engineering 64 Computers and Fluids 61 SIAM/ASA Journal on Uncertainty Quantification 57 International Journal of Computational Methods 48 Multiscale Modeling & Simulation 45 Journal of Mathematical Analysis and Applications 45 Mathematics and Computers in Simulation 45 RAIRO. Modélisation Mathématique et Analyse Numérique 44 Aplikace Matematiky 43 Applications of Mathematics 42 Numerical Algorithms 42 Archives of Computational Methods in Engineering 39 BIT 39 Mathematical Problems in Engineering 38 International Journal for Numerical Methods in Fluids 37 Engineering Computations 36 Calcolo 35 M2AN. Mathematical Modelling and Numerical Analysis. ESAIM, European Series in Applied and Industrial Mathematics 35 Computational Methods in Applied Mathematics 33 Computing 32 Computational Geosciences 32 Communications in Computational Physics 31 Journal of Differential Equations 31 International Journal of Computer Mathematics 30 Advances in Applied Mathematics and Mechanics 29 Applied Mathematics Letters 28 Acta Mechanica 28 Mathematical Methods in the Applied Sciences 28 Numerical Functional Analysis and Optimization 28 European Journal of Mechanics. A. Solids 26 Science China. Mathematics 25 Japan Journal of Industrial and Applied Mathematics 23 Foundations of Computational Mathematics 22 Journal of Numerical Mathematics 21 International Journal of Solids and Structures 21 Journal of Computational Acoustics 20 Wave Motion 20 RAIRO. Analyse Numérique 20 Applied Mathematics and Mechanics. (English Edition) 19 Numerical Linear Algebra with Applications 19 Abstract and Applied Analysis 18 Applicable Analysis 18 Archive for Rational Mechanics and Analysis 18 Comptes Rendus. Mathématique. Académie des Sciences, Paris 17 Journal of Mathematical Sciences (New York) 17 International Journal of Numerical Analysis and Modeling 16 Journal of the Mechanics and Physics of Solids 16 Archive of Applied Mechanics 15 Mathematical and Computer Modelling 15 Computational and Applied Mathematics 15 Computing and Visualization in Science 15 International Journal of Fracture 14 Journal of Elasticity 13 Journal of Integral Equations and Applications 12 Journal of Engineering Mathematics 12 ZAMP. Zeitschrift für angewandte Mathematik und Physik 12 Journal of Approximation Theory 12 International Journal of Computational Fluid Dynamics 12 ZAMM. Zeitschrift für Angewandte Mathematik und Mechanik 11 Computer Aided Geometric Design 11 Linear Algebra and its Applications 11 SIAM Journal on Mathematical Analysis 11 Mathematics and Mechanics of Solids 11 International Journal for Computational Methods in Engineering Science and Mechanics 10 Journal of Complexity 10 COMPEL 10 Journal de Mathématiques Pures et Appliquées. Neuvième Série 10 Inverse Problems in Science and Engineering 9 Meccanica 9 International Journal of Numerical Methods for Heat & Fluid Flow 9 European Series in Applied and Industrial Mathematics (ESAIM): Control, Optimization and Calculus of Variations 9 Discrete and Continuous Dynamical Systems. Series B 9 Journal of Applied Mathematics and Computing 9 Acta Numerica 9 Acta Mechanica Sinica 9 East Asian Journal on Applied Mathematics 8 Physica D 8 Computational Optimization and Applications 8 Journal of Inequalities and Applications 8 International Journal for Numerical Methods in Biomedical Engineering 8 Stochastic and Partial Differential Equations. Analysis and Computations ...and 297 more Serials
all top 5
### Cited in 54 Fields
5,747 Numerical analysis (65-XX) 2,814 Partial differential equations (35-XX) 2,491 Mechanics of deformable solids (74-XX) 1,552 Fluid mechanics (76-XX) 347 Optics, electromagnetic theory (78-XX) 334 Probability theory and stochastic processes (60-XX) 274 Calculus of variations and optimal control; optimization (49-XX) 202 Approximations and expansions (41-XX) 155 Ordinary differential equations (34-XX) 125 Classical thermodynamics, heat transfer (80-XX) 111 Statistics (62-XX) 101 Biology and other natural sciences (92-XX) 86 Computer science (68-XX) 86 Statistical mechanics, structure of matter (82-XX) 83 Operator theory (47-XX) 71 Geophysics (86-XX) 63 Functional analysis (46-XX) 60 Integral equations (45-XX) 60 Operations research, mathematical programming (90-XX) 57 Systems theory; control (93-XX) 43 Potential theory (31-XX) 41 Linear and multilinear algebra; matrix theory (15-XX) 35 Quantum theory (81-XX) 32 Global analysis, analysis on manifolds (58-XX) 28 Dynamical systems and ergodic theory (37-XX) 25 Harmonic analysis on Euclidean spaces (42-XX) 22 General and overarching topics; collections (00-XX) 20 Mechanics of particles and systems (70-XX) 19 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 18 Real functions (26-XX) 16 Special functions (33-XX) 16 Information and communication theory, circuits (94-XX) 13 Functions of a complex variable (30-XX) 11 Differential geometry (53-XX) 9 Combinatorics (05-XX) 9 Convex and discrete geometry (52-XX) 6 History and biography (01-XX) 5 Geometry (51-XX) 4 Mathematical logic and foundations (03-XX) 4 Difference and functional equations (39-XX) 3 Several complex variables and analytic spaces (32-XX) 3 Relativity and gravitational theory (83-XX) 2 Number theory (11-XX) 2 Algebraic geometry (14-XX) 2 Topological groups, Lie groups (22-XX) 2 Manifolds and cell complexes (57-XX) 2 Astronomy and astrophysics (85-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Category theory; homological algebra (18-XX) 1 Group theory and generalizations (20-XX) 1 Measure and integration (28-XX) 1 Abstract harmonic analysis (43-XX) 1 Integral transforms, operational calculus (44-XX) 1 General topology (54-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-07-05T06:59: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.5892411470413208, "perplexity": 7796.7959359809975}, "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/1656104514861.81/warc/CC-MAIN-20220705053147-20220705083147-00779.warc.gz"}
|
http://trove.nla.gov.au/work/77571?q&versionId=82896
|
# English, Article edition: PROJECTING THE FORWARD RATE FLOW ONTO A FINITE DIMENSIONAL MANIFOLD ERHAN BAYRAKTAR; LI CHEN; H. VINCENT POOR
#### User activity
##### Share to:
Bookmark: http://trove.nla.gov.au/version/82896
Physical Description
• article
Language
• English
### Edition details
Title
• PROJECTING THE FORWARD RATE FLOW ONTO A FINITE DIMENSIONAL MANIFOLD
Author
• ERHAN BAYRAKTAR
• LI CHEN
• H. VINCENT POOR
Physical Description
• article
Notes
• Given a HeathâJarrowâMorton (HJM) interest rate model $\mathcal{M}$ and a parametrized family of finite dimensional forward rate curves $\mathcal{G}$, this paper provides a technique for projecting the infinite dimensional forward rate curve rt given by $\mathcal{M}$ onto the finite dimensional manifold $\mathcal{G}$. The Stratonovich dynamics of the projected finite dimensional forward curve are derived and it is shown that, under the regularity conditions, the given Stratonovich differential equation has a unique strong solution. Moreover, this projection leads to an efficient algorithm for implicit parametric estimation of the infinite dimensional HJM model. The feasibility of this method is demonstrated by applying the generalized method of moments.
• Interest rate models, consistency problems, calibration of HJM models, infinite dimensional stochastic differential equations
• RePEc:wsi:ijtafx:v:09:y:2006:i:05:p:777-785
Language
• English
Contributed by
OAIster
## Get this edition
• Set up My libraries
### How do I set up "My libraries"?
In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.
• All (1)
• Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
## User activity
#### Tags
What are tags? Add a tag
e.g. test cricket, Perth (WA), "Parkes, Henry"
Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.
Be the first to add a tag for this edition
| 2017-05-23T11:05:02 |
{"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.6414684057235718, "perplexity": 4226.997064752392}, "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-22/segments/1495463607620.78/warc/CC-MAIN-20170523103136-20170523123136-00268.warc.gz"}
|
http://dlmf.nist.gov/34.12
|
# §34.12 Physical Applications
The angular momentum coupling coefficients ($3j$, $6j$, and $9j$ symbols) are essential in the fields of nuclear, atomic, and molecular physics. For applications in nuclear structure, see de-Shalit and Talmi (1963); in atomic spectroscopy, see Biedenharn and van Dam (1965, pp. 134–200), Judd (1998), Sobelman (1992, Chapter 4), Shore and Menzel (1968, pp. 268–303), and Wigner (1959); in molecular spectroscopy and chemical reactions, see Burshtein and Temkin (1994, Chapter 5), and Judd (1975). $3j,6j$, and $9j$ symbols are also found in multipole expansions of solutions of the Laplace and Helmholtz equations; see Carlson and Rushbrooke (1950) and Judd (1976).
| 2015-01-31T07:02:51 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 11, "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.9039937853813171, "perplexity": 4142.8061350199305}, "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/1422122108378.68/warc/CC-MAIN-20150124175508-00240-ip-10-180-212-252.ec2.internal.warc.gz"}
|
https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/A/Pi_helix
|
# Pi helix
A pi helix (or π-helix) is a type of secondary structure found in proteins.[1] Discovered by crystallographer Barbara Low in 1952[2] and once thought to be rare, short π-helices are found in 15% of known protein structures and are believed to be an evolutionary adaptation derived by the insertion of a single amino acid into an α-helix.[3] Because such insertions are highly destabilizing,[4] the formation of π-helices would tend to be selected against unless it provided some functional advantage to the protein. π-helices therefore are typically found near functional sites of proteins.[3][5][6]
## Standard structure
The amino acids in a standard π-helix are arranged in a right-handed helical structure. Each amino acid corresponds to an 87° turn in the helix (i.e., the helix has 4.1 residues per turn), and a translation of 1.15 Å (0.115 nm) along the helical axis. Most importantly, the N-H group of an amino acid forms a hydrogen bond with the C=O group of the amino acid five residues earlier; this repeated i + 5 → i hydrogen bonding defines a π-helix. Similar structures include the 310 helix (i + 3 → i hydrogen bonding) and the α-helix (i + 4 → i hydrogen bonding).
The majority of π-helices are only 7 residues in length and do not adopt regularly repeating (φ, ψ) dihedral angles throughout the entire structure like that of α-helices or β-sheets. Because of this, textbooks that provide single dihedral values for all residues in the π-helix are misleading. Some generalizations can be made, however. When the first and last residue pairs are excluded, dihedral angles exist such that the ψ dihedral angle of one residue and the φ dihedral angle of the next residue sum to roughly −125°. The first and last residue pairs sum to −95° and −105°, respectively. For comparison, the sum of the dihedral angles for a 310 helix is roughly −75°, whereas that for the α-helix is roughly −105°. Proline is often seen immediately following the end of π-helices. The general formula for the rotation angle Ω per residue of any polypeptide helix with trans isomers is given by the equation
${\displaystyle 3\cos \Omega =1-4\cos ^{2}\left({\frac {\phi +\psi }{2}}\right).}$
## Left-handed structure
In principle, a left-handed version of the π-helix is possible by reversing the sign of the (φ, ψ) dihedral angles to (55°, 70°). This pseudo-"mirror-image" helix has roughly the same number of residues per turn (4.1) and helical pitch (1.5 Å [150 pm]). It is not a true mirror image, because the amino-acid residues still have a left-handed chirality. A long left-handed π-helix is unlikely to be observed in proteins because, among the naturally occurring amino acids, only glycine is likely to adopt positive φ dihedral angles such as 55°.
## π-helices in nature
Commonly used automated secondary structure assignment programs, such as DSSP, suggest <1% of proteins contain a π-helix. This mis-characterization results from the fact that naturally occurring π-helices are typically short in length (7 to 10 residues) and are almost always associated with (i.e. flanked by) α-helices on either end. Nearly all π-helices are therefore cryptic in that the π-helical residues are incorrectly assigned as either α-helical or as "turns". Recently developed programs have been written to properly annotate π-helices in protein structures and they have found that 1 in 6 proteins (around 15%) do in fact contain at least one π-helical segment.[3]
Natural π-helices can easily be identified in a structure as a "bulge" within a longer α-helix. Such helical bulges have previously been referred to as α-aneurisms, α-bulges, π-bulges, wide-turns,looping outs and π-turns, but in fact are π-helices as determined by their repeating i + 5 → i hydrogen bonds.[3] Evidence suggests that these bulges, or π-helices, are created by the insertion of a single additional amino acid into a pre-existing α-helix. Thus, α-helices and π-helices can be inter-converted by the insertion and deletion of a single amino acid.[3][4] Given both the relatively high rate of occurrence of π-helices and their noted association with functional sites (i.e. active sites) of proteins, this ability to interconvert between α-helices and π-helices has been an important mechanism of altering and diversifying protein functionality over the course of evolution.[3]
One of the most notable group of proteins whose functional diversification appears to have been heavily influenced by such an evolutionary mechanism is the ferritin-like superfamily, which includes ferritins, bacterioferritins, rubrerythrins, class I ribonucleotide reductases and soluble methane monooxygenases. Soluble methane monooxygenase is the current record holder for the most number of π-helices in a single enzyme with 13 (PDB code 1MTY). However, the bacterial homologue of a Na+/Cl dependent neurotransmitter transporter (PDB code 2A65) holds the record for the most π-helices in a single peptide chain with 8.[3]
## References
1. Pauling L, Corey RB, Branson HR (1951). "The Structure of Proteins: Two Hydrogen-Bonded Helical Configurations of the Polypeptide Chain". Proc. Natl. Acad. Sci. U.S.A. 37 (4): 205–211. doi:10.1073/pnas.37.4.205. PMC 1063337. PMID 14816373.
2. "(IUCr) Barbara Wharton Low (1920-2019)". www.iucr.org. Retrieved 2019-10-02.
3. Cooley RB, Arp DJ, Karplus PA (2010). "Evolutionary origin of a secondary structure: π-helices as cryptic but widespread insertional variations of α-helices enhancing protein functionality". J Mol Biol. 404 (2): 232–246. doi:10.1016/j.jmb.2010.09.034. PMC 2981643. PMID 20888342.
4. Keefe LJ, Sondek J, Shortle D, Lattman EE (2000). "The alpha aneurism: a structural motif revealed in an insertion mutant of staphylococcal nuclease". Proc. Natl. Acad. Sci. U.S.A. 90 (8): 3275–3279. doi:10.1073/pnas.90.8.3275. PMC 46282. PMID 8475069.
5. Weaver TM (2000). "The pi-helix translates structure into function". Protein Science. 9 (1): 201–206. doi:10.1110/ps.9.1.201. PMC 2144447. PMID 10739264.
6. Fodje MN, Al-Karadaghi S (2002). "Occurrence, conformational features and amino acid propensities for the pi-helix". Protein Eng. 15 (5): 353–358. doi:10.1093/protein/15.5.353. PMID 12034854.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.
| 2021-05-11T02:07:58 |
{"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.743741512298584, "perplexity": 5177.186349757889}, "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-2021-21/segments/1620243991553.4/warc/CC-MAIN-20210510235021-20210511025021-00031.warc.gz"}
|
http://www.itl.nist.gov/div898/handbook/pri/section5/pri59a2.htm
|
5. Process Improvement
5.5.9. An EDA approach to experimental design
5.5.9.10. DOE contour plot
How to Interpret: Contour Curves
Non-linear appearance of contour curves implies strong interaction Based on the fitted model (cumulative residual standard deviation plot) and the best data settings for all of the remaining factors, we draw contour curves involving the two dominant factors. This yields a graphical representation of the response surface.
Before delving into the details as to how the contour lines were generated, let us first note as to what insight can be gained regarding the general nature of the response surface. For the defective springs data, the dominant characteristic of the contour plot is the non-linear (fan-shaped, in this case) appearance. Such non-linearity implies a strong X1*X3 interaction effect. If the X1*X3 interaction were small, the contour plot would consist of a series of near-parallel lines. Such is decidedly not the case here.
Constructing the contour curves As for the details of the construction of the contour plot, we draw on the model-fitting results that were achieved in the cumulative residual standard deviation plot. In that step, we derived the following good-fitting prediction equation:
$$\hat{Y} = 71.25 + 11.5 X_{1} + 5 X_{1}X_{3} - 2.5 X_{2}$$
The contour plot has axes of X1 and X3. X2 is not included and so a fixed value of X2 must be assigned. The response variable is the percentage of acceptable springs, so we are attempting to maximize the response. From the ordered data plot, the main effects plot, and the interaction effects matrix plot of the general analysis sequence, we saw that the best setting for factor X2 was "-". The best observed response data value (Y = 90) was achieved with the run (X1, X2, X3) = (+, -, +), which has X2 = "-". Also, the average response for X2 = "-" was 73 while the average response for X2 = "+" was 68. We thus set X2 = -1 in the prediction equation to obtain
$$\hat{Y} = 71.25 + 11.5 X_{1} + 5 X_{1}X_{3} - 2.5 (-1)$$
$$\hat{Y} = 73.75 + 11.5 X_{1} + 5 X_{1}X_{3}$$
This equation involves only X1 and X3 and is immediately usable for the X1 and X3 contour plot. The raw response values in the data ranged from 52 to 90. The response implies that the theoretical worst is Y = 0 and the theoretical best is Y = 100.
To generate the contour curve for, say, Y = 70, we solve
70 = 73.75 + 11.5*X1 + 5*X1*X3
by rearranging the equation in X3 (the vertical axis) as a function of X1 (the horizontal axis). By substituting various values of X1 into the rearranged equation, the above equation generates the desired response curve for Y = 70. We do so similarly for contour curves for any desired response value Y.
Values for X1 For these X3 = g(X1) equations, what values should be used for X1? Since X1 is coded in the range -1 to +1, we recommend expanding the horizontal axis to -2 to +2 to allow extrapolation. In practice, for the DOE contour plot generated previously, we chose to generate X1 values from -2, at increments of 0.05, up to +2. For most data sets, this gives a smooth enough curve for proper interpretation.
Values for Y What values should be used for Y? Since the total theoretical range for the response Y (= percent acceptable springs) is 0 % to 100 %, we chose to generate contour curves starting with 0, at increments of 5, and ending with 100. We thus generated 21 contour curves. Many of these curves did not appear since they were beyond the -2 to +2 plot range for the X1 and X3 factors.
Summary In summary, the contour plot curves are generated by making use of the (rearranged) previously derived prediction equation. For the defective springs data, the appearance of the contour plot implied a strong X1*X3 interaction.
| 2017-10-18T16:55: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": 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.7834566831588745, "perplexity": 869.9138843692904}, "config": {"markdown_headings": false, "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-2017-43/segments/1508187823016.53/warc/CC-MAIN-20171018161655-20171018181655-00808.warc.gz"}
|
https://lammps.sandia.gov/doc/compute_temp_uef.html
|
# compute temp/uef command
## Syntax
compute ID group-ID temp/uef
• ID, group-ID are documented in compute command
• temp/uef = style name of this compute command
## Examples
compute 1 all temp/uef
compute 2 sel temp/uef
## Description
This command is used to compute the kinetic energy tensor in the reference frame of the applied flow field when fix nvt/uef or fix npt/uef is used. It is not necessary to use this command to compute the scalar value of the temperature. A compute temp may be used for that purpose.
Output information for this command can be found in the documentation for compute temp.
## Restrictions
This fix is part of the USER-UEF package. It is only enabled if LAMMPS was built with that package. See the Build package doc page for more info.
This command can only be used when fix nvt/uef or fix npt/uef is active.
| 2019-12-07T12:52:11 |
{"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.7356764674186707, "perplexity": 3544.376942379439}, "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/1575540499389.15/warc/CC-MAIN-20191207105754-20191207133754-00226.warc.gz"}
|
https://googology.wikia.org/wiki/Talk:Skewes_number
|
10,974 Pages
Does anyone have any ideas how to compute the first and last (before decimal point, if it is transcendental) digit of Skewes' number? Ikosarakt1 (talk) 13:15, December 20, 2012 (UTC)
This article is in large part false. There is infinitely many n's such that $$\pi(n)<li(n)$$, but also infinitely many for which $$\pi(n)>li(n)$$. Exact formulation is that this inequality switches direction infinitely many times. Say largest number before first swap is $$a$$. Assuming Riemann hypothesis $$a<Sk_1$$. Inequality $$a<Sk_2$$ holds independently of Riemann hypothesis. LittlePeng9 (talk) 17:59, May 5, 2013 (UTC)
## Transcendence
Schanuel's conjecture would imply the transcendence of both Skewes Numbers:
Let a be equal to either 79 or 7.705.
Firstly, a is a nonzero algebraic number, so the Lindemann–Weierstrass theorem does imply the transcendence of e^a.
Secondly, a and e^a are linearly independent over Q, so Q(a, e^a, e^a, e^(e^a)) has transcendence degree of at least 2 over Q. Therefore, e^a and e^(e^a) are algebraically independent over Q.
Thirdly, a, e^a, and e^(e^a) are linearly independent over Q, so Q(a, e^a, e^(e^a), e^a, e^(e^a), e^(e^(e^a))) has transcendence degree of at least 3 over Q. Therefore, e^a, e^(e^a), and e^(e^(e^a)) are algebraically independent over Q. With a = 79, the transcendence of the first Skewes Number follows.
And fourthly, a, e^a, e^(e^a), and e^(e^(e^a)) are linearly independent over Q, so Q(a, e^a, e^(e^a), e^(e^(e^a)), e^a, e^(e^a), e^(e^(e^a)), e^(e^(e^(e^a)))) has transcendence degree of at least 4 over Q. Therefore, e^a, e^(e^a), e^(e^(e^a)), and e^(e^(e^(e^a))) are algebraically independent over Q. With a = 7.705, the transcendence of the second Skewes Number follows. --84.61.186.220 18:50, September 29, 2014 (UTC)
## Is the given lower bound still accurate?
According to this webpage , values of the prime counting function up to 10^25 (also known as ten septillion, or a "minnow" in the guppy regiment) have been found.
Allegedly, π(10^25) has been proven to be 176,846,309,399,143,769,411,680.
whereas li(10^25) = 176,846,309,399,198,930,392,619.378663572790738111035705... (calculated here )
As you can see, li(10^25) > π(10^25) still.
If the information presented in the website given is true, either I just improved the lower bound or this article hasn't been updated in ages.
ArtismScrub (talk) 02:04, November 6, 2017 (UTC)
Even if we know $$li(10^{25}) > \pi(10^{25})$$, we don't know whether the inequality isn't reversed for some number below it. The inequality has been verified for all numbers below $$10^{14}$$, but only for very few numbers above it. LittlePeng9 (talk) 08:02, November 6, 2017 (UTC)
Community content is available under CC-BY-SA unless otherwise noted.
| 2021-08-05T21:09: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": 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.8452866077423096, "perplexity": 2337.4559313072155}, "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-31/segments/1627046157039.99/warc/CC-MAIN-20210805193327-20210805223327-00607.warc.gz"}
|
https://bioshock.fandom.com/wiki/Talk:BioShock_Infinite
|
## FANDOM
2,502 Pages
This talk page is for discussing improvements to the page "BioShock Infinite".
• It is not the place for general discussion or sharing stories about the topic of this article. Please use our forum for these purposes.
• Please sign and date your posts by typing four tildes (~~~~) after each of your entries.
• Put new text under old text. Click here to start a new topic.
• Do not edit other people's entries.
Please use our forum or personal blogs for discussion about related topics.
## Three more games by irrational games? Edit
Ken Levine said that he announced three more games tomorrow.What games are they going to be?Are they other bioshock games?strwar 16:27, August 16, 2010 (UTC)
Hehe, that would be cool. What I want to see is BioShock 5= outer space.69.117.71.119 21:14, March 21, 2011 (UTC)
## Big Daddy robot thingy Edit
Ok I added that the robot thingy has a human head because in the gameinformer preview for the demo they said that it does. Also If you look REALLY closely in the trailer on the part were it picks up booker you can see a very human-like silhouette of the creatures head. If you dont believe go check out the article. Aleksandr the Great 21:41, August 16, 2010 (UTC)
Which one? This isn't very comprohensive so far, and I've alrady added about half of it so far.SAmaster01 22:08, August 16, 2010 (UTC)
Possibly a nastier precursor to the big daddy that follows it, that involves removing the heart and brain and putting it in a metal suit. --
Since the Big Daddy looks so mechanical, maybe rather than putting a man in a suit, they put parts of the man in a machine. --RadicalEdward2 16:55, August 20, 2010 (UTC)
I checked out an interview on line and those weird robots at this moment anyway they are calling them Alpha's they basically augment enemie abilities though I am sure that sooner or later they will give them an official name 69.249.228.6 17:09, September 2, 2010 (UTC)
sorry first post here look close at the game informer cover they are call bettermens auto body
in bioshock 1 it said that bodies were grafted in to the suit and not parts or the vitals like the handyman. in bioshock 1 there are chambers called test subject chambers and in my belief those were whole human bodies in there just trying to clear things up hope I helped!
## Prequel or Different Universe? Edit
It's one of two possibilities, a prequel to the original Bioshock (set in a time before Andrew Ryan fled to the US, never mind thinking about building Rapture). either that or they're taking a Final Fantasy apporach... Vae Infectus 22:20, August 16, 2010 (UTC)
If they ruin the series by turning it into Final Fantasy SO HELP ME...IsaacGray 15:18, January 6, 2011 (UTC)
He just means that Infinite will have the same kind of concept setting for BioShock (destroyed Utopia, corrupt ideals, genetic enhancements, remodified weapons, powerful enemies, etc.), but it won't have the same location, or most of the characters, or the same time period. It's complex to get the idea, but Final Fantasy is given as an example because that series of games always has the same archetypes for powers and the initial story concept, but their settings and characters are always different. Evans0305 16:38, January 6, 2011 (UTC)
Precisely, similar gameplay, weapons, abilities and theme, but different setting, time and look to it. THAT was what I was meaning when I suspected that they were taking a "Final Fantasy" approach to the Bioshock Series, Clearly they've done all they can do with Rapture (for now, anyway), so they're doing something different, they're...you know the rest...the different universe option is certain now. Vae Infectus 20:56, January 9, 2011 (UTC)
Well, I believe that their approach on Infinite is to make a backsorty for Rapture, using Columbia. It could be a backstory to Andrew Ryan, and possibly the character that plays as the damsel in distress, Elizibeth, could sprout Ryan's idea for Little Sisters, because Elizibeth is supposed to be the one who can harnest powers, and people can harvest powers from her. So that's what i believe; quite frankly, that is what i hope for, as well. Hazel-rah 22:57, February 22, 2011 (UTC)
I've read an interview that this doesn't count as a BioShock 3 since it is not like the other two. Whether this means they are in the same universe or not is questionable at this time, but it's too early for all that. For some reason, people see that guy on the balcony as Andrew Ryan even though it could be anyone. I for one don't believe he could even exist up there at the time, at least looking as he does. The beginnings of Little Sisters in Rapture was coincidental. I don't see how it could have some deeper inspiration without any documentation. ~ 06:29, February 23, 2011 (UTC)
Honestly, it would upset me if it was a whole entirely new universe. Its just a boot in the teeth to BioShock and BioShock 2. There might be the possibility that Andrew Ryan has something to do with hiring Booker to find Elizibeth, if it is a prequel. Fingers Crossed; Hazel-rah 00:11, February 28, 2011 (UTC)
I think it might be same universe, different story. It might not be related, but Ryan didn't just choose any old bit of seabed to stick Rapture on. I'll let you congitate on that, squire. In the meantime, we should use what we know for now, while picking up anything that Irrational Games and Co. might drop in their trip in the sky. Might be best not to make assumptions... Dark Swarmlord 22:33, February 28, 2011 (UTC)
I believe it's the same universe, but different story. If anything connects to Rapture itself, I don't think it involves Andrew Ryan. I don't believe he is old enough at this time, or at least thinking a certain way, tu be actively involved in the city. Also, Dark Swarmlord... he sort of did. The presentation at Ryan Amusements states that he woke up in the middle of the night and proclaimed a random part of the sea to be the place. ~ 20:47, March 1, 2011 (UTC)
Probably random. I don't know... but you are right, he wouldn't have been old enough. It's... 19...12, when Infinate takes place? And Bioshock took place in '59 so thats... aproxomately 47 years in between the two events. I think it's safe to say that, unless Columbia's materials were made of rare, really durable material, Columbia and Rapture are two different wonderlands with an idealist problem. Dark Swarmlord 23:16, March 1, 2011 (UTC)
## Speculation Edit
Geez, this game was announced recently and there's already tons of speculation and unverified info in the trivia section. This page needs to be blocked to unregistered contributors for the time being or, at least heavily moderated or something. Ant423 23:19, August 16, 2010 (UTC)
## Go Cat Go. Edit
Am I the only old person on the internet? "One for the money, two for the show, three to get ready, now go cat go." is the opening lyric to "Blue Suede Shoes" made famous by Elvis Presley.
Nope, and now it's in the article.
12:43, August 18, 2010 (UTC)
## Arsenal Edit
What is there to be for the weapons at your disposal over the course of the game? Reading an account of an exclusive gameplay screening, I know for a fact that one weapon is a rifle obtained from a barrel during some form of "Guns Rights Rally". But this game takes place during 1912, so weapon selection won't be as colorful. But the judging by how Irrational Games did with the arsenal for the first game, I have no doubt in my mind the selection will be top-notch.
TheBigDaddy 21:23, August 20, 2010 (UTC)
Charles has some kind of pistol. Perhaps you'll also have one of those? --Willbachbakal 21:25, August 20, 2010 (UTC)
Since it is based on 1912 that is around WW1 so the weapons would be of that era so you may find revolvers, submachine guns, battle rifles (weapons that use high caliber slugs similar to those you use in hunting rifles) this is pure speculation on my part but it is possible that they may or then again may not be there.PhoenixPhire333 21:09, August 29, 2010 (UTC)
Well, I can identify some of weapons seen in the demo trailer- The rifle Booker picks up is a scoped M1903 Springfield, a bolt-action in use by the US military for basicly a billion years. Still popular with collectors and sport shooters.
The lever action shotgun looks like some modified form of the Remington M1887 shotgun, popular at the time.
The machine gun though is kinda funny, it can't be the Thompson since that was invented in the 20s. Most machine guns of the time were 40-pound behemoths that required 5 men to haul around and set up, yet it seems portable and easy to handle. We never get to see a good picture of it, though. Another example of Columbian technology. Mr Bio Shock 19:45, March 24, 2011 (UTC)
-------------------
40? .... 200lb behemoths (water cooled maxims/vickers etc...)—The preceding unsigned comment was added by Testxyz (talkcontribs) 16:40, August 6, 2013(UTC). Please remember to sign your posts with ~~~~.
## Little sisters Edit
Will there be any little sisters? Naruto fan 6 19:39, August 23, 2010 (UTC)Nfan 6
It's doubtful as it'll be a little different this time around. Vae Infectus 18:44, August 26, 2010 (UTC)
As noted in this interview:
Focussing on the game, how is it quintessentially BioShock when it is so different from that? What makes it BioShock?
To us when we started, we had these two principles that we think define a BioShock game. You are in a place that is fantastical and ridiculous and absurd, but also grounded in human experience in some way. As crazy as it is, it feels like people could have lived here. The second thing is you have this huge range of skills that you can use and that challenge is that you decide how you approach the problem. The game doesn’t dictate that.
Beyond those two principles, everything was up for grabs. Nothing was a sacred cow. People think its like Rapture, the Big Daddies and Little Sisters, but BioShock is about mystery to me. If you don’t have mystery, you don’t have a BioShock game.
I think once people play the game, and have seen more about the game, they will understand on a very intimate level even more so why this is a BioShock game and how to be a BioShock game. I don’t want to give too much away.
—The preceding unsigned comment was added by Roygbiv666 (talkcontribs) 18:53, 2010 August 26. Please sign your posts with ~~~~!
## Picture Edit
I have a picture of saltonstall, and it shows his face better, ill show it right here.and it shows saltonstalls face. maybe it could replace the saltonstall on the page? it looks better and it has better detail. —The preceding unsigned comment was added by Charly Cohen (talkcontribs) 01:48, 2010 September 4. Please sign your posts with ~~~~!
That would be a good portrait to put on the Saltonstall page, but for this article it is nicer to have a wide-view image. ~Gardimuer ʈalk } 19:36, September 4, 2010 (UTC)
## Game Informer's Covers Edit
An interseting article at Joystick about the making of the covers: http://www.joystiq.com/2010/09/04/heres-the-bioshock-infinite-game-informer-cover-s/
--Pauolo 13:26, September 5, 2010 (UTC)
## little gameplay Edit
i found some gameplay. (its not that much, mostly its about star wars the for unleased 2, but there is a part about it). http://www.gametrailers.com/episode/gametrailers-tv/104&ch=1&sd=0?ep=104&ch=1&sd=0 23:05, September 18, 2010 (UTC)
Downloading it because HD videos are extremely hard to play in my browser. But if it's true, GameTrailers could be in some trouble. Irrational Games told GameInformer to wait until September 23rd to release and video, and on Xbox Live the day before. This is early as hell, no matter the amount of gameplay.
Either way, though... this isn't finalized. ~ 23:21, September 18, 2010 (UTC)
## Story Edit
Anyone think the whole Ultra American Patriot thing is just a huge middle finger to all us other non-American people? 74.15.5.126 02:41, December 17, 2010 (UTC)
That is exactly the point of the game. Haven't you seen the gameplay trailer? It opens to a mural putting down all other races and, as it implies, the countries they are from. The city touts itself over all other countries outside it's origins. ~ 04:23, December 17, 2010 (UTC)
It could be worse...they could've done a "British Empire" theme to that...let's hope they don't with the next one, it'd wreck sales of THAT game. Vae Infectus 20:59, January 9, 2011 (UTC)
Actually, as a patriotic American, it feels like a big middle finger to me. Suggesting that patriotism and pride in one's own county is somehow the root of evil and inhumanity to man, ::192.35.35.34 22:26, February 3, 2011 (UTC)
It not really patriotism so much as racist, eugenicist bigotry that's being presented as the prime evil in the game. Sure, the citizens wear the Flag and do happen to be very fond of their country, but they're evil only because of their excesses: so while they'll buy a beer for any fellow American (like in the demo), they'll tear you to pieces if you oppose them or their goals (which, after all, include the extermination of anyone who doesn't fit the WASP archetype). --Willbachbakal 23:47, February 3, 2011 (UTC)
In Bioshock 1 and 2, altruism caused a great deal of suffering and destruction, regardless of how well intended it was (Andrew Ryan and Dr Sofia Lamb both ended up betraying their ideals) even the author who wrote the novel that Bioshock was loosely based on believed that in the long term it results in society self-destructing. Nazi Germany, USSR, the Roman Catholic Church, the Empires that desired world domination (such as the British, French, Spanish and Russian Empires) are examples of how co-erced self sacrifice in the long term is doomed to failure. In such a society, there are two groups, those who are model citizens and those who are enemies of the public, those who are loyal to the cause and those who turn their backs on it, Bioshock covered Objectivism, Bioshock 2 covered altruism, Bioshock Infintte appears to be covering ultra-nationalism (or to be more precise, an example of it). Vae Infectus 19:53, February 7, 2011 (UTC)
If thats true, Whats left for the team to cover in the next game? Eternity08 20:41, September 1, 2011 (UTC)
-------------------------
"In Bioshock 1 and 2, altruism caused a great deal of suffering and destruction"
huh??? maybe Sofia Lamb (except she sold people on 'helping', but all she did was help herself.)
Ryan ---> altruism ? Did you not hear a thing he said in the game?? Actually its not altruism but 'altruists' those who FORCE/Coerse other people to 'help' (and usually gather power and decision making to themselves by beating up on people who dont 'help' enough) who are the problem Ryan was opposing.—The preceding unsigned comment was added by Testxyz (talkcontribs) 16:48, August 6, 2013(UTC). Please remember to sign your posts with ~~~~.
## Elenor Lamb's Quote...Edit
"The Rapture dream is over"
Is this foreshadowing on the new Columbia setting, snuck in by 2K? It would kind of fit... And on the subject of Eleanor...I think Elizabeth and Eleanor have a slight resembalance to each other, but I could be looking a little to closely into things... Anyway, i'm excited for the relese of Infinite, and hope 2K do a decent job and don't screw things up.
Little sister7364 22:23, March 15, 2011 (UTC)Little_sister7364
"And in our story, Rapture is just the beginning"
Or something to that extent. Put the two quotes together, along with the speculation on Delta's face, and what you noticed about the two girls... I think you might be right. But if you're looking a "little" too closely on things, then god help me. Dark Swarmlord 22:59, March 15, 2011 (UTC)
BioShock 2 was taken up by 2K Marin instead of Irrational Games. Yes, they did have support, but I don't believe they'd let such a small quote have such a heavy meaning on the series. It's just a statement by a single character.
What did Little sister7364 notice about "the two girls?" ~ 06:23, March 16, 2011 (UTC)
The two girls looking a bit like each other. In a way they do... but in a way they don't.
Ok, perhaps I was a bit hasty. I'll just sit and wait (not that it'll stop me from sticking my opinions down). Plus I'm the sort of person who doesn't care about who makes the game, so long as the finished product is worth it. No offence to 2K or Irrational Games. Dark Swarmlord 16:06, March 17, 2011 (UTC)
## decisions Edit
the decisions are greyer in this game. In one example, a dentist is getting beaten up by some Vox Populi. Kill the vox and you'll meet the dentist later, with some gold teeth he pulled out of the mouths of the people he killed to repay you. I read this in the OPS3 Mag. Worth putting in the article (if it isn't already?) 77.101.80.11 22:51, August 7, 2011 (UTC)
## so is it bioshock Edit
so does any one know if it takes place in the bioshock univers or are the going to screw us over on this by puting it in a difrent univers —The preceding unsigned comment was added by Raggedcozy (talkcontribs) 02:42, 2011 August 29 (UTC). Please remember to sign your posts with ~~~~.
"BioShock Infinite is not a direct sequel/prequel to any of the previous BioShock games, and it takes place in an entirely different setting."
Based on that, you can draw your own conclusions. ~Gardimuer ʈalk } 03:50, August 29, 2011 (UTC)
I always imagine that a Tear could lead the player to Rapture at sound point in the game, maybe as a hidden Easter Egg. Or maybe some deeper connection, like their powers coming from Rapture through a Tear. But it's all assumption. ~ 13:33, August 29, 2011 (UTC)
## Trailer Summaries Edit
Some of these summaries are going into ridiculous levels of detail, and that's even carrying over to people describing portions that aren't even in the trailer. Like the summary for the second trailer, the section that describes Booker going into the pub immediately after the first sky-line event: it said that the music over the grammophone was a "big band" version of Tears for Fears's "Everybody Wants to Rule the World". For starters, the Big Band style didn't yet exist during this time period, and, even more ridiculous, if anyone took a minute to actually listen to the song they'd know the lyrics contain words (e.g. "who" and "tell") which aren't even in the lyrics for "Everybody Wants to Rule the World". I've since deleted this ludicrous sentence, but more than that we really need to reconsider this page. It's getting far too cluttered with every single play-by-play of these trailers and we should really truncate it down to it's most essential facts. - Me 8:53 EST, 11/13/2011
You make a good point. One option is that we could entirely move the trailer summaries to separate pages. This is something that Wookiepedia does. For instance, all three cinematic trailers for Star Wars: The Old Republic got separate articles describing them. --~Gardimuer ʈalk } 13:52, November 15, 2011 (UTC)
That sounds like a good idea, but we might also want to consider simply getting rid of the descriptions of the two older trailers. They definitely show off the game's environment, but when it comes to character design (e.g. Elizabeth's hair), damage systems, GUI, and a host of other features these trailers are no longer useful. Maybe include links to videos, but nit-picking an older build at this point would be as useful as analysing the wire-frame test Irrational put up a while ago. Finally, we can stick any useful descriptions from the trailer sections (e.g. environments, weapons, appearance of mobs) into their own pages on Columbia, etc.. -- Me 04:50 EDT, November 24, 2011
## Mirroring Bioshock 1 Edit
Ok this is just my opinion, but i think Bioshock Infinite is starting to mirrior everything from Bioshock 1:
Vigor=Plasmids
Comstock=Andrew Ryan
Daisy Fitzroy=Atlas
Columbia=Rapture, but in the sky
Elizabeth=Little Sister
Gear=Tonics
AirPatriot1912 (talk) 15:35, December 28, 2012 (UTC)
Infinite was planned to resemble original Bioshock, because it shares it's title. Ken Levine said, that he wanted to make things that will tell the player "Yes. That's a Bioshock game." That's why things look similar to each other. Ison (talk) 18:55, December 28, 2012 (UTC)
It is meant to be relateable as a BioShock game, especially since its the first to not be set in Rapture. Not having the same setting and relating it as that franchise is quite difficult to make familiar, especially when it means having to imply that to fans and everyone else. Even though Irrational's System Shock 2 ( BioShock's slightly similar, but arguably better, conceptual predecessor) had influenced several games before, BioShock became more of a mainstream hit, so every company has been making BioShock-influenced concepts and gameplay mechanics in most of their games, such as Batman Arkham City having its Rapture-like Wonder City, to Skyrim having similar dual-weilding controls for weapons/powers, to even Dishonored being close to playing as a BioShock game. Also, when they had their large delay, it did mean that its gameplay had to be more like the first BioShock's than trying a more fresh approach, hence why they changed the Vigors and Nostrum system (which the Vigors were more ample, and Nostrums were permanent changes), so now, Vigors use salts to refil like EVE did with Plasmids, and Gears replaced the Nostrums. Still, its understandable that even through such a change, they're doing what they can to make Columbia a BioShock game, rather than have it "just like" a BioShock game.Evans0305 (talk) 19:40, December 28, 2012 (UTC)
## Graphic Tone. Edit
The game has taken a serious tone such as a Columbian officer geting his face ripped to shreds from a skyhook, a revolver is now powerful enough to decapitate you, etc.AirPatriot1912 (talk) 16:21, December 28, 2012 (UTC)
Hence why its M-rated. I think depending on what gun or what range, it'll be just as powerful to do that kind of damage, and the Sky-Hook was one they were trying to make vary as both a melee weapon and as a transit tool. Evans0305 (talk) 19:40, December 28, 2012 (UTC)
## DLC involving first Pinkerton??? Edit
This is just speculation, i think that Irrational might do a dlc about someone, before Booker, going to Columbia
and rescuing Elizabeth, just like the Minervas Den dlc on Bioshock 2 (except for the saving part).AirPatriot1912 (talk) 02:43, December 30, 2012 (UTC)
Unfortunately, It was mentioned in this article that there won't be any story-based DLC added to the game (or at least any planned this time), so we'll least likely see this happen for a while. Because this game involves around the idea of quantum physics, we might not know yet if wether or not if it was just Booker all this time, not to mention a prelude to Columba's already shown prelude from its fall seems almost like redoing the singleplayer's story, only with a different guy's name over Booker's. Besides, Irrational Games wasn't involved with BioShock 2, so what was done for that game will least likely happen so much in a similar fashon for this game (other than Challenge Rooms they did for the PS3 version of BS1, or some rumored "museum" in the Ultimate Rapture pack this year, but I hardly heard anything confirming this being seen in the game).Evans0305 (talk) 04:27, December 30, 2012 (UTC)
## was the ending shown in the VGA 2011 trailer? Edit
Ok im not saying its true, but a lot of people speculate that when the VGA 2011 trailer was released, they saw a scene where Elizabeth was mourning a columbian citizen, but other people say its Booker, just with a different model.AirPatriot1912 (talk) 14:41, December 30, 2012 (UTC)
That absolutely cannot be Booker, becuase:
1. Look at the sky. In that trailer, sky is bright and sunny. In the new trailer, Booker is still alive when Columbia looks like a flying armagedon with fiery storm everywhere.
2. Please, belive me. Ken Levine wouldn't just casually kill main character in a random place. In an interview, he said that the ending of the game will be VERY surprising, and he's not even sure if everyone will like it. So I think that he wouldn't die in such a random way as being shot by someone...if he will die at all. Noone said that he will - take this into consideration.
So to conclude, I want to say that you can be 150% sure, that the ending was not shown anywhere.
Ison (talk) 15:23, December 30, 2012 (UTC)
I was reading about the cosplayer that was hired and it said she will be doing things like tv ads. It seems their will be a live-action trailer involving her and Booker fighting off the Vox Populi. I wonder if Troy Baker will play Booker in the trailer since he voices him.AirPatriot1912 (talk) 03:27, January 2, 2013 (UTC)
## Starting to look like World at War. Edit
With all this decapatating limbs,skyhooks shredding faces and WW1 style clothing and weapons, im starting to think that BioShock Infinite is starting to look a lot like Call of Duty: World at War. Who else thinks so?AirPatriot1912 (talk) 21:01, January 13, 2013 (UTC)
CoD5 takes place during WWII, so your point is invalid.Einsteinium99 (talk) 04:21, January 25, 2013 (UTC)
I mean like the violence like the limbs getting decapatated by a revolver and a shotgun.AmberWing65 (talk) 12:41, January 25, 2013 (UTC)
## List of polishes made by Irrational. Edit
Here are a list of changes to BioShock Infinite:
1) Booker now wears the attire hes suppose to wear in his concept art.
2) Comstock has a beard
3) Vigors now have a heavy effect when used
4) The Handyman can produce electricity from his suit
This is some stuff i read from the hands-on preview
5) Instead of destroying a Vox Populi zeppelin, you aboard Comstock's zeppelin and a kid sacrifices himself to save Booker so he could destroy the zeppelin
6) That scene where the Vox Populi is about to execute a postman, that has now been changed to a scene involving a rascist crowd attacking a interacial couple.
7) Elizabeth opens a tear to the 1980s, now she opens one to Paris, France.AmberWing65 (talk) 00:25, January 25, 2013 (UTC)
## Western vibe? Edit
I dont know why but every that i look at Columbia's architecture and music style, i start getting this little western vibe feeling. Can anyone atleast share some details on why?AmberWing65 (talk) 20:58, January 28, 2013 (UTC)
I'll just say that BioShock Infinite and Red Dead Redemption take place in the same year.Einsteinium99 (talk) 21:12, January 28, 2013 (UTC)
Ok or maybe that the city is based on Aryan Race, which is actually a western culture.AmberWing65 (talk) 21:55, January 28, 2013 (UTC)
## All-Star cast for the next Bioshock? Edit
I was just wondering do you guys think that for the next Bioshock, Irrational will have a all-star cast like Troy returning for one last acting with them, Micheal Cane doing his usual emotional work like he did inTDKR, but what i really want to see in the all-star cast is Russel Crowe cause i loved his work in The Man With The Iron Fists. Whos voice would you like to hear in the next BioShock?AmberWing65 (talk) 22:37, February 2, 2013 (UTC)
## Pre-order BonusesEdit
I would like to know if I could add online (polish) shop from which I got my copy, because it's one which is working with Bioshock site. It's gives Steelbook, Comstock's skin for China Broom, and Season Pass at one time. Ison (talk) 20:57, February 22, 2013 (UTC)
That's interesting, but is that a chain offer? And if so, how big is the chain? The list is primarily for large scale offers, so that matters. --~ 21:16, February 22, 2013 (UTC)
It's pretty much an internet store with games. It's similar to Steam, just in Polish version. I don't really think that it's a chain, but it's the only shop that gives pre-order bonuses if you don't count Industrial Revolution. From what I see, that site is "liked" by more than 10,000 people... at least that's how I can describe the size. That's the only polish shop listed on the Bioshock Infinite site, so I believe that it could be listed. It's really up to you. Ison (talk) 22:32, February 22, 2013 (UTC)
## Becoming too spoilery? Edit
I'm glad that BioSock Infinite has gone gold and is ready for release, but im just worried that the game is showing too much suprises (new gameplay involving baptisism and first entering Columbia, which was shown on gamespot, various locations in Columbia, showing achievements list).AmberWing65 (talk) 18:46, February 25, 2013 (UTC)
Achievements are nothing bad. I've seen that new part of the game and to be honest, I didn't find may spoilers...everything was muted by constant talking of these guys...I've only heard something like "That priest mistook baptism with drowning" or something like that. And that was not really baptism, because it happens in the church - that is after he wakes up. Not much of a spoiler, at least for me. Even though I think that I'm not gonna watch any more videos connected to the game, because...well, I just wanna have a surprise :/ Ison (talk) 19:43, February 25, 2013 (UTC)
To be honest, the only way they could be spoilery as if they show the ending.AmberWing65 (talk) 16:26, March 16, 2013 (UTC)
No, ANY plot points are considered spoilers. There's more to the story besides the ending, like the twist.Einsteinium99 (talk) 17:12, March 16, 2013 (UTC)
## Possible big war fight between Vox and Founders? Edit
I think near the end of the game a battle between the Vox Populi and The Founders will erupt you might be apart of that battle?AmberWing65 (talk) 17:23, March 16, 2013 (UTC)
Well, they already confirmed that the fiery-looking skies of a part of Emporia will house a big conflict between the Founders and the Vox, and yeah, Booker is part of the battle. I hope there are more of these fights later on, though.189.142.219.156 19:38, March 16, 2013 (UTC)
I mean like the whole entier two factions fighting in possibly the last level.AmberWing65 (talk) 19:48, March 16, 2013 (UTC)
## Trivia worthy? Edit
Interesting discovery, but I'd say better keep the link on this talk page. If it is indeed a source of inspiration for Infinite, then maybe it will be referenced in the incoming artbook.
Pauolo (talk) 14:23, April 6, 2013 (UTC)
Tweeted Ken inquiring about it. Wikipedia:Lighthouse: The Dark Being --~ 15:42, April 6, 2013 (UTC)
picture of the bell tower falling
does this even happen in the game any more ??
## Alternative Interpretation of Ending Edit
Anna/Liz doesn't drown Booker, she baptizes him. It's a metaphor for forgiving him.
The entire story line is about a father guilty about his past (Wounded Knee) and worried about how his baby daughter will think of him.
Comstock is a Booker that didn't have a child, was baptized but never forgave himself so he built a persona (new name and "Prophet") to hide his past and lied to make himself look better that made him enemies (Slate with the Boxer-Rebellion, blaming the Indians for Wounded Knee and Daisy with Lady Comstock's suicide). He used the Tear technology to build Columbia (by observing technology in other times or dimensions) and it eventually made him impotent so he stole another Booker's baby, Anna, to raise as his own prodigy.
The baby is Elizabeth, so that final act where she's dunking you into the water is her (and every other version) forgiving you for what you did and what you could become (Comstock), thus ending the guilt inside Booker and destroying the possibility of Comstock emerging in another dimension. Mallissin (talk) 22:40, April 13, 2013 (UTC)
I like this interpretation. Its interesting. I feel like I should point out that it's still a valid interpretation even if she does drown him. The drowning itself doesn't change the symbolism of the act, and in fact might only add to it. I feel like its more accurate to say that she does baptize him, by drowning him.
Baptism is rebirth, and for something to be re-born, it needs to die.
70.26.84.185 03:26, June 13, 2013 (UTC) What are some more themes you can think of, guys?
## HistoryEdit
1912 happens to be the very same year in which the Titanic sank. ZanyDragon (talk) 12:39, September 24, 2013 (UTC)
## Is 'Old Elizabeth' a seperate character ???Edit
Character List feeding frenzy .... away !!!!!
Testxyz (talk) 14:16, February 24, 2014 (UTC)
## Calculating Field of View (FOV) Edit
How do you calculate the horizontal Field of View (FOV) in Bioshock Infinite?
For example, I want an FOV of 23.137º. The default is 70º. This is controlled by a percentage, which can increase or decrease the FOV. Min 0%. Max 100%. Using a percentage of 15, moving the slider 10 points in either the left or right direction changes the FOV by 10.5º. A percentage of 0 would lock the FOV at 70º.
I found this table on the PC Gaming Wiki, but the math behind it isn't explained:
Max FOV = Percentage (0% to 100%)
85º = 21.43%
90º = 28.57%
95º = 35.71%
100º = 42.86%
105º = 50.00%
110º = 57.14%
Ananina23 (talk) 01:27, June 22, 2014 (UTC)
Probably a little late, but I was trying to figure this out since I just started playing the game. From what I can tell:
• The base FoV is 70°, according to the interwebs 1. We'll call it (base) BFoV.
• In XUserOptions.ini, there's a key FieldOfView, that ranges between -1 and 1, and adds or subtracts an amount to/from BFoV. We'll call it (range) RFoV.
• Also in XUserOptions.ini, there a key MaxUserFOVOffsetPercent that defaults to 15. We'll call it (max) MFoV.
• We'll call the actual, in-game FoV (final) FFoV.
• So, FFoV = BFoV × (1 + RFoV × MFoV).
• Or, MFoV = $\frac{FFoV}{BFoV}$ - 1, if FFoV > 70° (and put RFoV slider all the way right, or RFoV = 1).
• Or, MFoV = 1 - $\frac{FFoV}{BFoV}$, if FFoV < 70° (put RFoV slider all the way left, or RFoV = -1).
• Note that MFoV is listed as a percent, so 1 + 15% = 1.15 = 115% ≠ 16%.
Examples:
Default settings have RFoV at 0 and MFoV at 15. That gives us
• FFoV = 70° × (1 + 0 × 0.15)
• FFoV = 70° × (1 + 0)
• FFoV = 70° × 1
• FFoV = 70°
Let's set the slider to maximum (RFoV is 1) and change the .ini so MFoV is 55. That gives
• FFoV = 70° × (1 + 1 × 0.55)
• FFoV = 70° × (1 + 0.55)
• FFoV = 70° × 1.55
• FFoV = 108.5°
Let's leave the slider on maximum (RFoV is 1), then calculate a desired FoV of 102°.
• 102° = 70° × (1 + 1 × MFoV)
• $\frac{102°}{70°}$ = 1 + MFoV
• MFoV = $\frac{102°}{70°}$ - 1
• MFoV ≈ 0.4571428 = 45.71428%
• (So the .ini setting should read MaxUserFOVOffsetPercent=45.71428 .)
Now, we'll look for a desired FoV of 23.137°, like you asked. (That seems terribly low, but you asked.) In this case, we have to go below 70°, so we want to change RFoV to -1 (put the slider all the way left).
• 23.137° = 70° × (1 - 1 × MFoV)
• $\frac{23.137°}{70°}$ = 1 - MFoV
• -MFoV = $\frac{23.137°}{70°}$ - 1
• MFoV = 1 - $\frac{23.137°}{70°}$
• MFoV ≈ 1 - 0.3305286
• MFoV = 0.6694714
• MFoV = 66.94714%
• (So the .ini setting should read MaxUserFOVOffsetPercent=66.94714 .)
1 I'm not convinced it's actually 70° base, but it's close enough. As far as I can tell, someone read the line FOVAngle=70.000000 in the XEngine.ini file and assumed that was the game FoV, but that actually has zero effect in the game. It's also present in a ton of other games I've played. And it's in the "game editor" section; the same section that has GodMode=True. My presumption is that entire section is for development, not gameplay. Also, there are multiple comment references to 75° in the default config files which warrant investigation. Still, a setting of 110° based on the 70° assumption is visually close to what I normally see, so the default is close to 70°.
199.127.114.114 06:53, May 17, 2018 (UTC)
## Just double-checking regarding item quantity Edit
Last posting I shall make tonight, promise. I have very sketchily mathed out the following, assuming one possesses *all DLC content* (Season Pass and Columbia's Finest, everything):
Bioshock Infinite contains (hypothetically/theoretically):
30 potential Infusion spaces...25 sans S.P...
51 or 53 Gear options...tending to the latter...
And if one is manic in ambition I do not even know if the game empirically allows (?), I have approximated the sum globular upgrade total for both weapons and Vigor modalities, without knowledge if actualizing this grandiosity is even possible, update totality of all upgradeable stuff, to equal roughly \$36, 500 "eagles/dollars"...
Are my numbers right? Thanks to potential answerers...
## Removed trailer videos Edit
It appears that some trailers we had on this page do no longer exist on this wiki. They have been removed from the article accordingly. Since the deletion logs don't indicate anything, I'm suspecting the files were never uploaded to the wiki but provided by Wikia's shared Video repository. For archival purposes, I've listed the removed videos below:
File:BioShock Infinite Launch Trailer|''Launch Trailer.''
File:BioShock Infinite Lamb of Columbia Trailer|''Lamb of Columbia Trailer.''
File:BioShock Infinite - False Shepherd Trailer|''False Shepherd Trailer.''
File:BioShock Infinite - Songbird Featurette|''Songbird Featurette.''
14:53, February 7, 2018 (UTC)
• All these videos are should be Ghost Story's Youtube account. (If not ther than 2K's or the BioShock one) I honestly didn't think we could upload file sizes as large as was needed for these vids. sm --Solarmech (talk) 15:40, February 7, 2018 (UTC)
## Page about Physics in BioShock Infinite?Edit
I have been running across people that freak out about BSI's take on the Many Worlds theory and other theoretical (and real world) physics in the game. A lot of people only know the pop sci-fi version of the physics if they know it at all and even then they get it screwed up. I was wondering if a a page should be made giving a easy to understand overview of the real physics and how those theories show up in BioShock Infinite. Both how the game follow the theories and how it doesn't follow them. Going to be a fair amount of writing and research so I wanted to get opinions on if they was a undertaking that would be worth while for the wiki. sm --Solarmech (talk) 18:49, March 10, 2020 (UTC)
Community content is available under CC-BY-SA unless otherwise noted.
| 2020-07-06T18:20: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.3450224995613098, "perplexity": 4081.751586545811}, "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/1593655881763.20/warc/CC-MAIN-20200706160424-20200706190424-00441.warc.gz"}
|
http://pdglive.lbl.gov/DataBlock.action?node=S004RP3
|
# LIMIT ON ${{\boldsymbol \mu}^{-}}$ $\rightarrow$ ${{\boldsymbol e}^{+}}$ CONVERSION
Forbidden by total lepton number conservation.
# ${\boldsymbol \sigma (}$ ${{\boldsymbol \mu}^{-}}$ ${}^{}\mathrm {Cu}$ $\rightarrow$ ${{\boldsymbol e}^{+}}{}^{}\mathrm {Co}{)}$ / ${\boldsymbol \sigma (}$ ${{\boldsymbol \mu}^{-}}$ ${}^{}\mathrm {Cu}$ $\rightarrow$ ${{\boldsymbol \nu}_{{\mu}}}{}^{}\mathrm {Ni}{)}$ INSPIRE search
VALUE CL% DOCUMENT ID TECN
• • • We do not use the following data for averages, fits, limits, etc. • • •
$<2.6 \times 10^{-8}$ 90
1972
SPEC
$<2.2 \times 10^{-7}$ 90
1962
OSPK
References:
BRYMAN 1972
PRL 28 1469 Search for the Reaction ${{\mathit \mu}^{-}}$ ${}^{}\mathrm {Cu}$ $\rightarrow$ ${{\mathit e}^{+}}{}^{}\mathrm {Co}$
CONFORTO 1962
NC 26 261 Search for Neutrinoless Coherent Nuclear Capture of ${{\mathit \mu}^{-}}$ Mesons
| 2019-02-21T19:52: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.8594701886177063, "perplexity": 5518.415180851558}, "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-2019-09/segments/1550247508363.74/warc/CC-MAIN-20190221193026-20190221215026-00094.warc.gz"}
|
https://par.nsf.gov/biblio/10203400-hot-terrestrial-planet-orbiting-bright-dwarf-unveiled-tess
|
A hot terrestrial planet orbiting the bright M dwarf L 168-9 unveiled by TESS
We report the detection of a transiting super-Earth-sized planet ( R = 1.39 ± 0.09 R ⊕ ) in a 1.4-day orbit around L 168-9 (TOI-134), a bright M1V dwarf ( V = 11, K = 7.1) located at 25.15 ± 0.02 pc. The host star was observed in the first sector of the Transiting Exoplanet Survey Satellite (TESS) mission. For confirmation and planet mass measurement purposes, this was followed up with ground-based photometry, seeing-limited and high-resolution imaging, and precise radial velocity (PRV) observations using the HARPS and Magellan /PFS spectrographs. By combining the TESS data and PRV observations, we find the mass of L 168-9 b to be 4.60 ± 0.56 M ⊕ and thus the bulk density to be 1.74 −0.33 +0.44 times higher than that of the Earth. The orbital eccentricity is smaller than 0.21 (95% confidence). This planet is a level one candidate for the TESS mission’s scientific objective of measuring the masses of 50 small planets, and it is one of the most observationally accessible terrestrial planets for future atmospheric characterization.
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10203400
Journal Name:
Astronomy & Astrophysics
Volume:
636
Page Range or eLocation-ID:
A58
ISSN:
0004-6361
National Science Foundation
More Like this
1. We report the confirmation and mass determination of three hot Jupiters discovered by the Transiting Exoplanet Survey Satellite (TESS) mission: HIP 65Ab (TOI-129, TIC-201248411) is an ultra-short-period Jupiter orbiting a bright ( V = 11.1 mag) K4-dwarf every 0.98 days. It is a massive 3.213 ± 0.078 M J planet in a grazing transit configuration with an impact parameter of b = 1.17 −0.08 +0.10 . As a result the radius is poorly constrained, 2.03 −0.49 +0.61 R J . The planet’s distance to its host star is less than twice the separation at which it would be destroyed bymore »
2. ABSTRACT We report on the discovery and validation of a two-planet system around a bright (V = 8.85 mag) early G dwarf (1.43 R⊙, 1.15 M⊙, TOI 2319) using data from NASA’s Transiting Exoplanet Survey Satellite (TESS). Three transit events from two planets were detected by citizen scientists in the month-long TESS light curve (sector 25), as part of the Planet Hunters TESS project. Modelling of the transits yields an orbital period of $11.6264 _{ - 0.0025 } ^ { + 0.0022 }$ d and radius of $3.41 _{ - 0.12 } ^ { + 0.14 }$ R⊕ for the inner planet, and a periodmore »
3. Context. The harvest of exoplanet discoveries has opened the area of exoplanet characterisation. But this cannot be achieved without a careful analysis of the host star parameters. Aims. The system of HD 219134 hosts two transiting exoplanets and at least two additional non-transiting exoplanets. We revisit the properties of this system using direct measurements of the stellar parameters to investigate the composition of the two transiting exoplanets. Methods. We used the VEGA/CHARA interferometer to measure the angular diameter of HD 219134. We also derived the stellar density from the transits light curves, which finally gives a direct estimate of themore »
4. ABSTRACT We report the discovery of a warm sub-Saturn, TOI-257b (HD 19916b), based on data from NASA’s Transiting Exoplanet Survey Satellite (TESS). The transit signal was detected by TESS and confirmed to be of planetary origin based on radial velocity observations. An analysis of the TESS photometry, the Minerva-Australis, FEROS, and HARPS radial velocities, and the asteroseismic data of the stellar oscillations reveals that TOI-257b has a mass of MP = 0.138 ± 0.023 $\rm {M_J}$ (43.9 ± 7.3 $\, M_{\rm \oplus}$), a radius of RP = 0.639 ± 0.013 $\rm {R_J}$ (7.16 ± 0.15 $\, \mathrm{ R}_{\rm \oplus}$), bulk density of $0.65^{+0.12}_{-0.11}$ (cgs), and period $18.38818^{+0.00085}_{-0.00084}$ $\rm {days}$. TOI-257b orbits a bright (V = 7.612 mag)more »
5. ABSTRACT We report on the discovery and validation of TOI 813 b (TIC 55525572 b), a transiting exoplanet identified by citizen scientists in data from NASA’s Transiting Exoplanet Survey Satellite (TESS) and the first planet discovered by the Planet Hunters TESS project. The host star is a bright (V = 10.3 mag) subgiant ($R_\star =1.94\, R_\odot$, $M_\star =1.32\, M_\odot$). It was observed almost continuously by TESS during its first year of operations, during which time four individual transit events were detected. The candidate passed all the standard light curve-based vetting checks, and ground-based follow-up spectroscopy and speckle imaging enabled us to place an uppermore »
| 2021-12-09T12:35: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": 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.6982501149177551, "perplexity": 3750.3738499638275}, "config": {"markdown_headings": false, "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-49/segments/1637964364169.99/warc/CC-MAIN-20211209122503-20211209152503-00270.warc.gz"}
|
http://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/A/Karush%E2%80%93Kuhn%E2%80%93Tucker_conditions
|
# Karush–Kuhn–Tucker conditions
In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes called first-order) necessary conditions for a solution in nonlinear programming to be optimal, provided that some regularity conditions are satisfied.
Allowing inequality constraints, the KKT approach to nonlinear programming generalizes the method of Lagrange multipliers, which allows only equality constraints. Similar to the Lagrange approach, the constrained maximization (minimization) problem is rewritten as a Lagrange function whose optimal point is a saddle point, i.e. a global maximum (minimum) over the domain of the choice variables and a global minimum (maximum) over the multipliers, which is why the Karush–Kuhn–Tucker theorem is sometimes referred to as the saddle-point theorem.[1]
The KKT conditions were originally named after Harold W. Kuhn and Albert W. Tucker, who first published the conditions in 1951.[2] Later scholars discovered that the necessary conditions for this problem had been stated by William Karush in his master's thesis in 1939.[3][4]
## Nonlinear optimization problem
Consider the following nonlinear minimization or maximization problem:
Optimize ${\displaystyle f(\mathbf {x} )}$
subject to
${\displaystyle g_{i}(\mathbf {x} )\leq 0,}$
${\displaystyle h_{i}(\mathbf {x} )=0.}$
where ${\displaystyle \mathbf {x} \in \mathbf {X} }$ is the optimization variable chosen from a convex subset of ${\displaystyle \mathbb {R} ^{n}}$, ${\displaystyle f}$ is the objective or utility function, ${\displaystyle g_{i}\ (i=1,\ldots ,m)}$ are the inequality constraint functions and ${\displaystyle h_{i}\ (i=1,\ldots ,\ell )}$ are the equality constraint functions. The numbers of inequalities and equalities are denoted by ${\displaystyle m}$ and ${\displaystyle \ell }$ respectively. Corresponding to the constraint optimization problem one can form the Lagrangian function
${\displaystyle L(\mathbf {x} ,\mathbf {\mu } ,\mathbf {\lambda } )=f(\mathbf {x} )+\mathbf {\mu } ^{\top }\mathbf {g} (\mathbf {x} )+\mathbf {\lambda } ^{\top }\mathbf {h} (\mathbf {x} )}$
where ${\displaystyle \mathbf {g} (\mathbf {x} )=\left(g_{1}(\mathbf {x} ),\ldots ,g_{m}(\mathbf {x} )\right)^{\top }}$, ${\displaystyle \mathbf {h} (\mathbf {x} )=\left(h_{1}(\mathbf {x} ),\ldots ,h_{\ell }(\mathbf {x} )\right)^{\top }}$. The Karush–Kuhn–Tucker theorem then states the following.
Theorem. If ${\displaystyle (\mathbf {x} ^{\ast },\mathbf {\mu } ^{\ast })}$ is a saddle point of ${\displaystyle L(\mathbf {x} ,\mathbf {\mu } )}$ in ${\displaystyle \mathbf {x} \in \mathbf {X} }$, ${\displaystyle \mathbf {\mu } \geq \mathbf {0} }$, then ${\displaystyle \mathbf {x} ^{\ast }}$ is an optimal vector for the above optimization problem. Suppose that ${\displaystyle f(\mathbf {x} )}$ and ${\displaystyle g_{i}(\mathbf {x} )}$, ${\displaystyle i=1,\ldots ,m}$, are concave in ${\displaystyle \mathbf {x} }$ and that there exists ${\displaystyle \mathbf {x} _{0}\in \mathbf {X} }$ such that ${\displaystyle \mathbf {g} (\mathbf {x} _{0})>0}$. Then with an optimal vector ${\displaystyle \mathbf {x} ^{\ast }}$ for the above optimization problem there is associated a non-negative vector ${\displaystyle \mathbf {\mu } ^{\ast }}$ such that ${\displaystyle L(\mathbf {x} ^{\ast },\mathbf {\mu } ^{\ast })}$ is a saddle point of ${\displaystyle L(\mathbf {x} ,\mathbf {\mu } )}$.
Since the idea of this approach is to find a supporting hyperplane on the feasible set ${\displaystyle \mathbf {\Gamma } =\left\{\mathbf {x} \in \mathbf {X} :g_{i}(\mathbf {x} )\geq 0,i=1,\ldots ,m\right\}}$, the proof of the Karush–Kuhn–Tucker theorem makes use of the hyperplane separation theorem.[5]
The system of equations and inequalities corresponding to the KKT conditions is usually not solved directly, except in the few special cases where a closed-form solution can be derived analytically. In general, many optimization algorithms can be interpreted as methods for numerically solving the KKT system of equations and inequalities.[6]
## Necessary conditions
Suppose that the objective function ${\displaystyle f:\mathbb {R} ^{n}\rightarrow \mathbb {R} }$ and the constraint functions ${\displaystyle g_{i}:\,\!\mathbb {R} ^{n}\rightarrow \mathbb {R} }$ and ${\displaystyle h_{j}:\,\!\mathbb {R} ^{n}\rightarrow \mathbb {R} }$ are continuously differentiable at a point ${\displaystyle x^{*}}$. If ${\displaystyle x^{*}}$ is a local optimum and the optimization problem satisfies some regularity conditions (see below), then there exist constants ${\displaystyle \mu _{i}\ (i=1,\ldots ,m)}$ and ${\displaystyle \lambda _{j}\ (j=1,\ldots ,\ell )}$, called KKT multipliers, such that the following four groups of conditions hold:
Stationarity
For maximizing ${\displaystyle f(x)}$: ${\displaystyle \nabla f(x^{*})-\sum _{i=1}^{m}\mu _{i}\nabla g_{i}(x^{*})-\sum _{j=1}^{\ell }\lambda _{j}\nabla h_{j}(x^{*})=0,}$
For minimizing ${\displaystyle f(x)}$: ${\displaystyle \nabla f(x^{*})+\sum _{i=1}^{m}\mu _{i}\nabla g_{i}(x^{*})+\sum _{j=1}^{\ell }\lambda _{j}\nabla h_{j}(x^{*})=0,}$
Primal feasibility
${\displaystyle g_{i}(x^{*})\leq 0,{\text{ for }}i=1,\ldots ,m}$
${\displaystyle h_{j}(x^{*})=0,{\text{ for }}j=1,\ldots ,\ell \,\!}$
Dual feasibility
${\displaystyle \mu _{i}\geq 0,{\text{ for }}i=1,\ldots ,m}$
Complementary slackness
${\displaystyle \mu _{i}g_{i}(x^{*})=0,{\text{ for }}\;i=1,\ldots ,m.}$
In the particular case ${\displaystyle m=0}$, i.e., when there are no inequality constraints, the KKT conditions turn into the Lagrange conditions, and the KKT multipliers are called Lagrange multipliers.
If some of the functions are non-differentiable, subdifferential versions of Karush–Kuhn–Tucker (KKT) conditions are available.[7]
## Regularity conditions (or constraint qualifications)
In order for a minimum point ${\displaystyle x^{*}}$ to satisfy the above KKT conditions, the problem should satisfy some regularity conditions; some common examples are tabulated here:
Constraint Acronym Statement
Linearity constraint qualification LCQ If ${\displaystyle g_{i}}$ and ${\displaystyle h_{j}}$ are affine functions, then no other condition is needed.
Linear independence constraint qualification LICQ The gradients of the active inequality constraints and the gradients of the equality constraints are linearly independent at ${\displaystyle x^{*}}$.
Mangasarian-Fromovitz constraint qualification MFCQ The gradients of the equality constraints are linearly independent at ${\displaystyle x^{*}}$ and there exists a vector ${\displaystyle d\in \mathbb {R} ^{n}}$ such that ${\displaystyle \nabla g_{i}(x^{*})^{\top }d<0}$ for all active inequality constraints and ${\displaystyle \nabla h_{j}(x^{*})^{\top }d=0}$ for all equality constraints.[8]
Constant rank constraint qualification CRCQ For each subset of the gradients of the active inequality constraints and the gradients of the equality constraints the rank at a vicinity of ${\displaystyle x^{*}}$ is constant.
Constant positive linear dependence constraint qualification CPLD For each subset of gradients of active inequality constraints and gradients of equality constraints, if the subset of vectors is linearly dependent at ${\displaystyle x^{*}}$ with non-negative scalars associated with the inequality constraints, then it remains linearly dependent in a neighborhood of ${\displaystyle x^{*}}$.
Quasi-normality constraint qualification QNCQ If the gradients of the active inequality constraints and the gradients of the equality constraints are linearly dependent at ${\displaystyle x^{*}}$ with associated multipliers ${\displaystyle \lambda _{j}}$ for equalities and ${\displaystyle \mu _{i}\geq 0}$ for inequalities, then there is no sequence ${\displaystyle x_{k}\to x^{*}}$ such that ${\displaystyle \lambda _{j}\neq 0\Rightarrow \lambda _{j}h_{j}(x_{k})>0}$ and ${\displaystyle \mu _{i}\neq 0\Rightarrow \mu _{i}g_{i}(x_{k})>0.}$
Slater's condition SC For a convex problem (i.e., assuming minimization, ${\displaystyle f,g_{i}}$ are convex and ${\displaystyle h_{j}}$ is affine), there exists a point ${\displaystyle x}$ such that ${\displaystyle h(x)=0}$ and ${\displaystyle g_{i}(x)<0.}$
It can be shown that
LICQ ⇒ MFCQ ⇒ CPLD ⇒ QNCQ
and
LICQ ⇒ CRCQ ⇒ CPLD ⇒ QNCQ
(and the converses are not true), although MFCQ is not equivalent to CRCQ.[9] In practice weaker constraint qualifications are preferred since they provide stronger optimality conditions.
## Sufficient conditions
In some cases, the necessary conditions are also sufficient for optimality. In general, the necessary conditions are not sufficient for optimality and additional information is required, such as the Second Order Sufficient Conditions (SOSC). For smooth functions, SOSC involve the second derivatives, which explains its name.
The necessary conditions are sufficient for optimality if the objective function ${\displaystyle f}$ of a maximization problem is a concave function, the inequality constraints ${\displaystyle g_{j}}$ are continuously differentiable convex functions and the equality constraints ${\displaystyle h_{i}}$ are affine functions. Similarly, if the objective function ${\displaystyle f}$ of a minimization problem is a convex function, the necessary conditions are also sufficient for optimality.
It was shown by Martin in 1985 that the broader class of functions in which KKT conditions guarantees global optimality are the so-called Type 1 invex functions.[10][11]
### Second-order sufficient conditions
For smooth, non-linear optimization problems, a second order sufficient condition is given as follows.
The solution ${\displaystyle x^{*},\lambda ^{*},\mu ^{*}}$ found in the above section is a constrained local minimum if for the Lagrangian,
${\displaystyle L(x,\lambda ,\mu )=f(x)+\sum _{i=1}^{m}\mu _{i}g_{i}(x)+\sum _{j=1}^{\ell }\lambda _{j}h_{j}(x)}$
then,
${\displaystyle s^{T}\nabla _{xx}^{2}L(x^{*},\lambda ^{*},\mu ^{*})s\geq 0}$
where ${\displaystyle s\neq 0}$ is a vector satisfying the following,
${\displaystyle \left[\nabla _{x}g_{i}(x^{*}),\nabla _{x}h_{j}(x^{*})\right]^{T}s=0}$
where only those active inequality constraints ${\displaystyle g_{i}(x)}$ corresponding to strict complementarity (i.e. where ${\displaystyle \mu _{i}>0}$) are applied. The solution is a strict constrained local minimum in the case the inequality is also strict.
## Economics
Often in mathematical economics the KKT approach is used in theoretical models in order to obtain qualitative results. For example,[12] consider a firm that maximizes its sales revenue subject to a minimum profit constraint. Letting ${\displaystyle Q}$ be the quantity of output produced (to be chosen), ${\displaystyle R(Q)}$ be sales revenue with a positive first derivative and with a zero value at zero output, ${\displaystyle C(Q)}$ be production costs with a positive first derivative and with a non-negative value at zero output, and ${\displaystyle G_{\min }}$ be the positive minimal acceptable level of profit, then the problem is a meaningful one if the revenue function levels off so it eventually is less steep than the cost function. The problem expressed in the previously given minimization form is
Minimize ${\displaystyle -R(Q)}$
subject to
${\displaystyle G_{\min }\leq R(Q)-C(Q)}$
${\displaystyle Q\geq 0,}$
and the KKT conditions are
{\displaystyle {\begin{aligned}&\left({\frac {{\text{d}}R}{{\text{d}}Q}}\right)(1+\mu )-\mu \left({\frac {{\text{d}}C}{{\text{d}}Q}}\right)\leq 0,\\[5pt]&Q\geq 0,\\[5pt]&Q\left[\left({\frac {{\text{d}}R}{{\text{d}}Q}}\right)(1+\mu )-\mu \left({\frac {{\text{d}}C}{{\text{d}}Q}}\right)\right]=0,\\[5pt]&R(Q)-C(Q)-G_{\min }\geq 0,\\[5pt]&\mu \geq 0,\\[5pt]&\mu [R(Q)-C(Q)-G_{\min }]=0.\end{aligned}}}
Since ${\displaystyle Q=0}$ would violate the minimum profit constraint, we have ${\displaystyle Q>0}$ and hence the third condition implies that the first condition holds with equality. Solving that equality gives
${\displaystyle {\frac {{\text{d}}R}{{\text{d}}Q}}={\frac {\mu }{1+\mu }}\left({\frac {{\text{d}}C}{{\text{d}}Q}}\right).}$
Because it was given that ${\displaystyle {\text{d}}R/{\text{d}}Q}$ and ${\displaystyle {\text{d}}C/{\text{d}}Q}$ are strictly positive, this inequality along with the non-negativity condition on ${\displaystyle \mu }$ guarantees that ${\displaystyle \mu }$ is positive and so the revenue-maximizing firm operates at a level of output at which marginal revenue ${\displaystyle {\text{d}}R/{\text{d}}Q}$ is less than marginal cost ${\displaystyle {\text{d}}C/{\text{d}}Q}$ — a result that is of interest because it contrasts with the behavior of a profit maximizing firm, which operates at a level at which they are equal.
## Value function
If we reconsider the optimization problem as a maximization problem with constant inequality constraints:
${\displaystyle {\text{Maximize }}\;f(x)}$
${\displaystyle {\text{subject to }}\ }$
${\displaystyle g_{i}(x)\leq a_{i},h_{j}(x)=0.}$
The value function is defined as
${\displaystyle V(a_{1},\ldots ,a_{n})=\sup \limits _{x}f(x)}$
${\displaystyle {\text{subject to }}\ }$
${\displaystyle g_{i}(x)\leq a_{i},h_{j}(x)=0}$
${\displaystyle j\in \{1,\ldots ,\ell \},i\in \{1,\ldots ,m\},}$
so the domain of ${\displaystyle V}$ is ${\displaystyle \{a\in \mathbb {R} ^{m}\mid {\text{for some }}x\in X,g_{i}(x)\leq a_{i},i\in \{1,\ldots ,m\}\}.}$
Given this definition, each coefficient ${\displaystyle \mu _{i}}$ is the rate at which the value function increases as ${\displaystyle a_{i}}$ increases. Thus if each ${\displaystyle a_{i}}$ is interpreted as a resource constraint, the coefficients tell you how much increasing a resource will increase the optimum value of our function ${\displaystyle f}$. This interpretation is especially important in economics and is used, for instance, in utility maximization problems.
## Generalizations
With an extra multiplier ${\displaystyle \mu _{0}\geq 0}$, which may be zero (as long as ${\displaystyle (\mu _{0},\mu ,\lambda )\neq 0}$), in front of ${\displaystyle \nabla f(x^{*})}$ the KKT stationarity conditions turn into
{\displaystyle {\begin{aligned}&\mu _{0}\,\nabla f(x^{*})+\sum _{i=1}^{m}\mu _{i}\,\nabla g_{i}(x^{*})+\sum _{j=1}^{\ell }\lambda _{j}\,\nabla h_{j}(x^{*})=0,\\[4pt]&\mu _{j}g_{i}(x^{*})=0,\quad i=1,\dots ,m,\end{aligned}}}
which are called the Fritz John conditions. This optimality conditions holds without constraint qualifications and it is equivalent to the optimality condition KKT or (not-MFCQ).
The KKT conditions belong to a wider class of the first-order necessary conditions (FONC), which allow for non-smooth functions using subderivatives.
## References
1. Tabak, Daniel; Kuo, Benjamin C. (1971). Optimal Control by Mathematical Programming. Englewood Cliffs, NJ: Prentice-Hall. pp. 19–20. ISBN 0-13-638106-5.
2. Kuhn, H. W.; Tucker, A. W. (1951). "Nonlinear programming". Proceedings of 2nd Berkeley Symposium. Berkeley: University of California Press. pp. 481–492. MR 0047303.
3. W. Karush (1939). "Minima of Functions of Several Variables with Inequalities as Side Constraints". M.Sc. Dissertation. Dept. of Mathematics, Univ. of Chicago, Chicago, Illinois. Cite journal requires |journal= (help)
4. Kjeldsen, Tinne Hoff (2000). "A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: the impact of World War II". Historia Math. 27 (4): 331–361. doi:10.1006/hmat.2000.2289. MR 1800317.
5. Kemp, Murray C.; Kimura, Yoshio (1978). Introduction to Mathematical Economics. New York: Springer. pp. 38–44. ISBN 0-387-90304-6.
6. Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization. Cambridge: Cambridge University Press. p. 244. ISBN 0-521-83378-7. MR 2061575.
7. Ruszczyński, Andrzej (2006). Nonlinear Optimization. Princeton, NJ: Princeton University Press. ISBN 978-0691119151. MR 2199043.
8. Dimitri Bertsekas (1999). Nonlinear Programming (2 ed.). Athena Scientific. pp. 329–330. ISBN 9781886529007.
9. Rodrigo Eustaquio; Elizabeth Karas; Ademir Ribeiro. Constraint Qualification for Nonlinear Programming (PDF) (Technical report). Federal University of Parana.
10. Martin, D. H. (1985). "The Essence of Invexity". J. Optim. Theory Appl. 47 (1): 65–76. doi:10.1007/BF00941316.
11. Hanson, M. A. (1999). "Invexity and the Kuhn-Tucker Theorem". J. Math. Anal. Appl. 236 (2): 594–604. doi:10.1006/jmaa.1999.6484.
12. Chiang, Alpha C. Fundamental Methods of Mathematical Economics, 3rd edition, 1984, pp. 750–752.
• Andreani, R.; Martínez, J. M.; Schuverdt, M. L. (2005). "On the relation between constant positive linear dependence condition and quasinormality constraint qualification". Journal of Optimization Theory and Applications. 125 (2): 473–485. doi:10.1007/s10957-004-1861-9.
• Avriel, Mordecai (2003). Nonlinear Programming: Analysis and Methods. Dover. ISBN 0-486-43227-0.
• Boltyanski, V.; Martini, H.; Soltan, V. (1998). "The Kuhn–Tucker Theorem". Geometric Methods and Optimization Problems. New York: Springer. pp. 78–92. ISBN 0-7923-5454-0.
• Boyd, S.; Vandenberghe, L. (2004). "Optimality Conditions" (PDF). Convex Optimization. Cambridge University Press. pp. 241–249. ISBN 0-521-83378-7.
• Kemp, Murray C.; Kimura, Yoshio (1978). Introduction to Mathematical Economics. New York: Springer. pp. 38–73. ISBN 0-387-90304-6.
• Rau, Nicholas (1981). "Lagrange Multipliers". Matrices and Mathematical Programming. London: Macmillan. pp. 156–174. ISBN 0-333-27768-6.
• Nocedal, J.; Wright, S. J. (2006). Numerical Optimization. New York: Springer. ISBN 978-0-387-30303-1.
• Sundaram, Rangarajan K. (1996). "Inequality Constraints and the Theorem of Kuhn and Tucker". A First Course in Optimization Theory. New York: Cambridge University Press. pp. 145–171. ISBN 0-521-49770-1.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.
| 2021-01-27T10:46:32 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 112, "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.9210215210914612, "perplexity": 700.4982675166314}, "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-2021-04/segments/1610704821381.83/warc/CC-MAIN-20210127090152-20210127120152-00221.warc.gz"}
|
https://arrow.fandom.com/wiki/User_talk:AhsokaRules*6
|
6,582 Pages
# AhsokaRules*6
0 Discussion posts
My favorite wikis
## Welcome
Hi, I'm an admin for the Arrowverse Wiki community. Welcome and thank you for your edit to "Guest Starring John Noble" Discussion! If you need help getting started, check out our help pages 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 Arrowverse Wiki!
## ricardo diaz
hello he is so good Rise akainu (talk) 15:15, April 20, 2018 (UTC)
## Ally
Being an ally is not an occupation.User:TimeShade/sig 03:04, May 22, 2018 (UTC)
## RE:Locking Seasons 6 and 7 of Arrow
It wasn't just that reason, future season pages tend to have heavy amounts of speculation and people did keep adding facts they simply assumed.User:TimeShade/sig 13:48, May 27, 2018 (UTC)
## Sourcing screenshots
Hey there, I see you recently uploaded a bunch of screenshots. Per our image policy, it'd be great if you could source what episodes they came from. If you're unsure how to do that, check under the "Categorizing" section on the policy page. —MakeShift (talk page) 13:50, November 20, 2018 (UTC)
Here's another reminder to source your screenshots. I've explained how to do this in this little reminder here. It's easier to source screenshots exactly after you've taken them from the episodes, instead of having to figure out from where they are from long after the episode aired.--Kir the Wizard (talk) 21:20, November 24, 2018 (UTC)
Here is another reminder to source your screenshots. Not only do you add the category, "Images from ____", you add the Image-screenshot template. See the change I made to File:Dinah gives Zoe a Canary pin.png after your edit. $\int$ IHH dt 3:47, Nov 14, 2019 (UTC)
## RE: Ricardo Diaz
No, I forgot he appeared in the episode at the end as CCPD police officer. I corrected my mistake. Gamingbeaster (talk) 03:52, December 11, 2018 (UTC)
Community content is available under CC-BY-SA unless otherwise noted.
| 2019-11-14T03:47: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": 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.2866135835647583, "perplexity": 5934.14602062069}, "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/1573496667945.28/warc/CC-MAIN-20191114030315-20191114054315-00537.warc.gz"}
|
https://www.abs.gov.au/participate-survey/business-survey/survey-foreign-currency-exposure-explanatory-notes-accompany-form-1fce
|
Survey of Foreign Currency Exposure Explanatory notes to accompany Form 1FCE
This page is designed to assist providers in the completion of the Survey of Foreign Currency Exposure – Form 1FCE. This survey collects information on foreign currency denominated financial assets and liabilities and future estimated/forecasted foreign currency denominated receipts and payments. It details the extent to which they are hedged and the hedging policy used.
This survey is used in the compilation of aggregated data on Australian resident enterprises’ foreign currency exposure and the risk management practices associated with that exposure.
The Survey of Foreign Currency Exposure was previously conducted in March 2017 and published as Foreign Currency Exposure, Australia, March Quarter 2017.
Queries regarding the Survey of Foreign Currency Exposure may be directed to the following number: 1800 206 696
Explanatory notes
1.1
The Survey of Foreign Currency Exposure (Form 1FCE) is completed by the top Australian entity within an enterprise on behalf of the enterprise group. For definitions of an enterprise and an enterprise group see Note 2.1.
1.2
A separate Form 1FCE is sent to the appropriate entities within your Australian enterprise group (see Note 2.1 on page 4) that have been selected for the survey. A separate Form 1FCE should still be completed for each different Standard Institutional Sector Classification of Australia (SISCA) sub-sector.
The institutional sub-sectors generally applying to Form 1FCE are:
• Financial Corporations
• Banks
• Other depository corporations
• Reserve Bank of Australia
• Central borrowing authorities
• Other financial corporations
• Non-financial corporations
• General government
Further information on SISCA subsectors can be found here or by searching for the release ‘Standard Economic Sector Classifications of Australia’ on the ABS website.
1.3
The 1FCE has several key distinctions from the Survey of International Investment (SII, Form 90) and Survey of International Trade in Services (SITS) collections. Some differences are:
• Form 1FCE seeks to obtain data on activities with resident counterparties as well as non-resident counterparties only when the transaction is denominated in a foreign currency.
Form 1FCE also includes:
• Forecasted foreign-currency-denominated receipts and payments from trade in goods and services;
• The notional value of outstanding derivative contracts with a foreign currency component; and
• The policies enterprises adopted on hedging foreign currency exposure.
This may mean that certain enterprises within your group which were not involved in the quarterly SITS/SII may be required to report for this collection. This would be the case for example if an enterprise has foreign currency dealings with resident counterparties only. The similarities between Form 1FCE and Form 90 are discussed in Note 3.5.
If you have any queries regarding the reporting arrangements for this collection, please contact the Australian Bureau of Statistics on the number listed on the front page of the Form 1FCE.
2.1 Australian enterprise
An Australian enterprise consists of all the entities within an Australian enterprise group that are in the same SISCA subsector. An Australian enterprise group consists of an Australian parent enterprise (the top Australian enterprise), its Australian branches and its Australian subsidiaries as defined by the Corporations Act 2001.
If you are unsure of the entities that make up your enterprise group, the ABS can provide a list of ABNs that are included in your enterprise group. This list was also included in the induction letter sent to your company.
2.2 All values should be reported in thousands of Australian dollars.
All values should be reported in thousands of Australian dollars. Positions denominated in foreign currency should be converted to Australian dollars at the midpoint of the appropriate buy and sell rates applicable on 31 March 2022.
2.3 Residents and non-residents
A resident is any individual, enterprise or other organisation ordinarily domiciled in Australia.
• Australian registered branches and incorporated subsidiaries of foreign enterprises are regarded as Australian residents.
A non-resident is any individual, enterprise or other organisation ordinarily domiciled in a country other than Australia.
• Foreign branches and foreign subsidiaries of Australian enterprises are regarded as non-residents; and
• Residents of Norfolk Island and other external territories of Australia are regarded as non-residents.
2.4 Institutional sector of resident counterparties
Throughout this form you are asked to record details of activities with resident counterparties by the institutional sector of these counterparties. The institutional sectors of resident counterparties applying to this collection are as follows:
• Banks (as licensed by APRA);
• Other depository corporations (see Note 2.5);
• Reserve Bank of Australia;
• Central borrowing authorities (see Note 2.6 on page 5);
• Other financial corporations (see Note 2.7 on page 5);
• Non-financial corporations (see Note 2.8 on page 5); and
• General government (see Note 2.9 on page 5).
It should be noted that the sector of resident counterparty detail sought throughout the form is the sector of the entity that your enterprise is physically dealing with, not the sector of that entity’s parent enterprise.
If data by sector of resident counterparty are not readily available, please contact the ABS on the number listed on the front page of 1FCE.
2.5 Other depository corporations
Other depository corporations are those non-bank financial intermediaries with liabilities included in The Reserve Bank of Australia’s definition of broad money. This includes non-bank Authorised Deposit Taking Institutions (ADIs) such as building societies, credit unions and cash management trusts. Financial corporations registered under the Financial Sector (Collection of Data) Act 2001 Registered Financial Corporations (RFCs), which include money market corporations and Other Category RFCs, also fall into this sector.
2.6 Central borrowing authorities
Central borrowing authorities refer to corporations established by state and territory governments to provide finance for government authorities and to manage their surplus funds.
2.7 Other financial corporations
Other financial corporations include:
• Life insurance and pension funds;
• Other insurance corporations;
• Financial auxiliaries (for example: fund managers, security brokers and loan brokers); and
• Other financial institutions (which includes securitisers and mortgage brokers, fixed interest and equity unit trusts)
2.8 Non-financial corporations
Non-financial corporations include both public and private corporations and cover all resident corporations engaged in the production of market goods and/or nonfinancial services and holding companies with mainly non-financial corporations as subsidiaries.
2.9 General government
General government includes federal, state and local general government agencies. It excludes non-financial corporations (both public and private) and public marketing authorities as these are included in the ‘Other resident sectors’ grouping.
2.10 Institutional sector grouping of non-resident counterparties
Throughout this form you are asked to record details of activities with non-resident counterparties by the institutional sector of these counterparties. The institutional sectors of non-resident counterparties applying to this collection are as follows:
• Banks;
• Other;
If data by sector of non-resident counterparty are not readily available, please contact the ABS on the number listed on the front page of 1FCE.
2.11 All values should be reported in thousands of Australian dollars.
All values should be reported in thousands of Australian dollars. This requirement is consistent with the Survey of International Investment and Survey of International Trade in Services collections.
2.12 Chart 1
Chart 1 provides a schematic diagram describing the foreign currency denominated activities undertaken by Australian residents and the potential for foreign currency derivatives to impact net foreign currency exposures.
3.1 Equity
Equity for the purposes of this survey is defined as all classes of shares or units on issue.
Including:
• Net equity held in joint ventures and other unincorporated enterprises.
Excluding:
• Non-participating preference shares.
3.2 Debt assets and debt liabilities
Debt assets and debt liabilities should include all non-equity balance sheet assets and liabilities, such as, but not limited to:
• Cash and deposits;
• Short term instruments, i.e. certificates of deposit, convertible and non-convertible securities, promissory notes, bills of exchange, other short-term commercial and financial paper;
• Long term instruments, i.e. non-participating preference shares, bonds, asset backed securities, bearer depository receipts, loans, debentures;
• Trade credits payables and receivables, which are accounts payable or receivable by your Australian enterprise group for the import or export of goods and services; and:
• Prepayments made for future imports or exports of goods and services.
3.3
Parts A, B, C & D collect information about financial claims on and liabilities to residents and non-residents that are denominated in foreign currencies.
Including:
• All foreign denominated financial claims and liabilities that are shown in your books and which you have either acquired yourself or have arranged through a financial intermediary.
• All foreign currency denominated financial claims and liabilities acquired using funds managed by your enterprise group on behalf of other Australian enterprise groups, governments or individuals.
Excluding:
• All financial assets and liabilities that your Australian enterprise has negotiated on behalf of others and which are not shown in your books (unless you are a fund manager).
• All investments that are being managed on behalf of your Australian enterprise by an independent fund manager in Australia (Such investments will be reported separately by the relevant fund manager/s).
• The market values of derivative instruments held by your Australian enterprise.
For example, an Australian company issuing a bond denominated in USD would be issuing a foreign currency denominated debt liability. Similarly, if the company was purchasing the issue of the bond denominated in USD from a foreign entity, this would increase the company’s holdings of their foreign currency denominated debt assets.
3.4
Parts A, B, C & D use market valuations only. If this is not available, estimate using one of the following methods:
Market value of equity for unlisted enterprises: use
• A recent transaction price;
• Director’s valuation; or
• Net asset value: where net asset value is equal to total assets, including intangibles, less liabilities, including the paid value of ordinary shares. Assets and liabilities should be recorded at book value as reported on your balance sheet.
Market value for net equity of head office in branch: report the total assets of the branch at book value less liabilities. Liabilities include retained earnings revaluation and other reserves as well as capital invested by the head office.
Market value of securities/debt instruments: use the traded price as of 31 March 2022. If this is not available, estimate using (in order of preference) the following methods:
• Yield to maturity method;
• Discounted net present value;
• Face value less written down value;
• Issue price plus amortisation of discount on the bond; or
• Another mark to market method.
Market value of loans, trade credits, deposits and other instruments: use nominal (face) value as an approximation for market value unless book values have been revalued. If further clarification is required, please contact the ABS on the numbers listed on the front page of 1FCE.
3.5
If the enterprise group also currently receives the Survey of International Investment (SII) as of 31 March 2022:
• Foreign currency denominated financial debt liabilities to non-residents should be identical to the foreign currency data reported collectively in Parts D and E of questions 6-13 in SII Form 90 for the quarter ended 31 March 2022, or questions 1b and 2b of Part A of Forms 52 and 53.
• Foreign equity assets should be identical to the foreign currency data reported collectively in questions 14 and 15 (Part F) in the SII Form 90 for the quarter ended 31 March 2022.
• Foreign currency denominated financial debt assets with non-residents should be identical to the foreign currency data reported collectively in Parts H and I of questions 17–24 in SII Form 90 for the quarter ended 31 March 2022.
All foreign currency denominated debt assets and liabilities refer to the currency (of the closing positions) in which the assets or liabilities are likely to be repaid.
3.6
In Question 2 (Part B) and Question 6 (Part D) the mutually exclusive hedging categories are:
• Value fully hedged by derivatives;
• Value partially hedged by derivatives;
• Value naturally hedged;
• Value hedged by overseas affiliate;
• Other values hedged; and
• Value of all unhedged
The examples below illustrate how the different approaches to hedging should be reported in this section. Note that these are illustrative examples only. If further assistance is required for this section, please contact the ABS on the number listed on the front page of 1FCE.
For all examples in this section suppose that at acquisition date t = 0, the exchange rate is 1 AUD = 0.9 USD. At reporting date t = 1, suppose that the exchange rate has appreciated to 1 AUD = 1 USD.
Example 1: Fully hedged by derivatives
A resident enterprise purchases equities in a US resident company worth US$18 million (A$20 million) at time t = 0. They then enter into a currency futures position worth US$18 million to remove the risk associated with currency volatility. At t = 1, the AUD appreciation means that the$US18 million equity asset is now worth A$18 million. The entire A$18 million is reported as ‘fully hedged’.
Amounts hedged by an overseas affiliate should be reported in the category ‘Value hedged by overseas affiliate’; see example 4.
This would be reported in Question 6 (Part D) as follows:
Question 6 (Part D)
Example 2: Partially hedged by derivatives
A resident enterprise issues a US$100 million bond at t = 0. They enter into a cross currency basis swap with a notional value of US$80 million to partially hedge the US$100 million bond (A$111 million).
At t = 1, the US$100 million liabilities exposure is now worth A$91 million and is 80% hedged. The 80% hedged amount (A$73 million) is reported in the ‘partially hedged’ category and the remaining 20% (A$18 million) is categorised as ‘all unhedged’. These would be reported in Question 2 (Part B) as follows:
Question 2 (Part B)
Amounts hedged by an overseas affiliate should be reported in the category ‘Value hedged by overseas affiliate’; see example 4.
Example 3: Naturally hedged
Natural hedging refers to carrying out two different types of transactions that have opposite movements in order to reduce the underlying risk in one or both transactions. Any portfolio of assets and liabilities that has both assets and liabilities denominated in the same foreign currency in order to offset their respective movements is covered under natural hedging; when positions are naturally hedged this way, the asset and liability positions move by similar proportions. The destination counterparty with which natural hedging is conducted with does not matter. This is in contrast to any hedging that uses financial derivatives which is referred in 1FCE as derivatives hedging.
Amounts that are fully hedged, partially hedged or hedged by an overseas affiliate should be reported in their respective categories; see examples 1, 2 and 4.
5.1
Part F collects information about hedging of estimated/forecasted future foreign currency denominated receipts and payments arising from the trade in goods and services in the period following 31 March 2022. Please include all estimated/forecasted receipts and payments and not just existing receipts and payments currently hedged through financial derivative contracts.
5.2
The different time horizon groups in which future foreign currency receipts and payments are to be estimated/forecasted are listed in note 4.3.
5.3
For the various types of hedging to be included in this question see the examples in part 3.6, as well as the one below for natural hedging:
Example 8: Hedging of future foreign currency denominated receipts
A resident company intends to purchase input materials from a US supplier worth US$9 million (A$10 million). It also expects to sell US$4.5 million (A$5 million) of its products back into US dollars within a year. An appreciation of the AUD against the USD at t=1 simultaneously decreases the cost of the input materials from the supplier to A$8 million and the price of the final product sold to A$4 million.
6.4 Cross-currency interest rate swaps
Cross-currency interest rate swaps involve the exchange of streams of interest payments in different currencies for an agreed period of time and the exchange of principal amounts in different currencies at a pre-agreed exchange rate at maturity.
6.5 Currency options
Currency options grant the holder the right, but not the obligation, to exchange $A for a foreign currency at a specified exchange rate at a future date. • Call options on the Australian dollar give the holder the right to buy$A in exchange for a foreign currency (and are equivalent to a put on the foreign currency).
In Part G Question 12, report the notional principal of outstanding derivatives where foreign currency will be sold in exchange for $A when the derivative is exercised. For options, this will include puts purchased on foreign currency (i.e. calls purchased on Australian dollars) and calls sold (or written) on foreign currency (i.e. puts sold on Australian dollars). 6.10 In Part G Question 13 In Part G Question 13, report the notional principal of outstanding derivatives where foreign currency will be sold in exchange for foreign currency when the derivative is exercised. This will include both puts purchased and calls sold on (or written) on foreign currency. 6.11 In Part G Question 14 In Part G Question 14, report the total market value of outstanding derivatives where foreign currency will be sold in exchange for$A when the derivative is exercised. If a market value is not currently available, see note 3.4 for guidance.
Derivative contracts in an asset position with non-residents are those contracts where the mark to market value of the closing position is positive at the reporting date.
Derivative contracts in a liability position with non-residents are those contracts where the mark to market value of the closing position is negative at the reporting date.
The following examples go into further detail which transactions are in scope for Part G Questions 11 to 14:
Example 9: Derivative contracts
An Australian enterprise issues a derivative contract to a foreign bank for the purchase of US$100 million for A$100 million. Assuming the exchange rate remains at 1 USD = 1 AUD, the notional principal reported will be A$100 million. This amount should be reported under Part G Question 11(a) as follows: Part G Question 11(a) A foreign non-bank enterprise issues a derivative contract to an Australian enterprise for the purchase of A$100 million for £100 million. Assuming the exchange rate remains at 1 AUD = 1 GBP, the notional principal reported will be A$100 million. This amount should be reported under Part G Question 12(a) as follows: Part G Question 12(a) An Australian enterprise issues a derivative contract to a non-resident bank for the purchase of £100 million for €100 million. This amount should be reported under Part G Question 13(a) as follows: Part G Question 13(a) 7. Notes on Part H 7.1 Part H provides a representation of the major factors which you may consider when determining the extent to which your enterprise is exposed to foreign currency risk. The data summarised here will, at best, provide a broad indication of the extent to which your enterprise is exposed currently. It should be noted that even if your enterprise has an overall policy of ensuring that the enterprise is 100 per cent hedged against foreign exchange exposure; it is still unlikely that you would record a zero at the bottom of the table in this section. There are a number of reasons why this may be the case. For example: • You may not consider all of the factors shown in the table (for example, foreign equity assets) during your calculations; • The time horizon for future receipts and payments may not be appropriate to your enterprise; • Balance sheet assets and liabilities are recorded at their market value (or approximation thereof). A balance sheet position hedged with forward foreign exchange derivatives will be based on the estimated/forecasted value of the assets and liabilities at the time the derivative is exercised. Therefore, it is likely that the sum of the present value of the balance sheet with the principal of the offsetting hedge may not be zero. 7.2 When reporting the net balance sheet foreign currency exposures item in Question 15 please report the total balance sheet foreign current exposure if the net amount is not available. 8. Notes of Part I 8.1 This section asks for information on your institution’s hedging policy, which may differ from the actual hedging reported in parts A to H in the Survey. 8.2 When reporting the percentage of a partial hedge your enterprise may not have a comprehensive portion of your portfolio hedged. To provide a best estimate take a weighted average of your hedging strategies. An example which shows how to calculate this weighted average is shown below; use it as a guide if necessary to help consider your institution’s overall hedging strategies. Example 10: Hedging Strategy Calculation Assume your enterprise has two major foreign currency investment strategies: Strategy A Fully hedged investment in foreign currency assets worth A$100 million.
Strategy B
Non-hedged trading on the FX market with a portfolio of A$10 million of which$1 million is exposed to foreign currency movements.
The weighted average of these two strategies (assuming equal weighting between both) would be:
$${(𝑀𝑎𝑟𝑘𝑒𝑡\space𝑉𝑎𝑙𝑢𝑒\space𝑜𝑓\space𝐴\space∗\space𝑃𝑜𝑟𝑡𝑖𝑜𝑛\space𝐻𝑒𝑑𝑔𝑒𝑑)\space+\space(𝑀𝑎𝑟𝑘𝑒𝑡\space𝑉𝑎𝑙𝑢𝑒\space𝑜𝑓\space𝐵\space∗\space𝑃𝑜𝑟𝑡𝑖𝑜𝑛\space𝐻𝑒𝑑𝑔𝑒𝑑) \over Market\space Value\space of\space A\space +\space Market\space Value\space of\space B}$$
$$=((A100\space million*100 \%) + (A10\space million * 90\%)) / (A100\space million + A10\space million)$$
$$≅99\%$$
This would be reported in Question 17(a) (Part I) as follows:
Question 17(a) (Part I)
If further clarification is required, please contact the ABS on the numbers listed on the front page of 1FCE.
8.3
If your enterprise targets a monetary level of exposure and not a percentage level of exposure, convert your monetary level of exposure by dividing the total monetary level of exposure in AUD as of 31 March 2022 by total assets or liabilities as of 31 March 2022, depending on the type of exposure.
Example:
• Assume your enterprise’s target exposure levels in foreign currencies are US$100 million, £50 million, and €50 million. • Assume the exchange rates are 0.7 USD = 1 AUD, 0.6 GBP = 1 AUD, and 0.7 EUR = 1 AUD as of 31 March 2022. If this enterprise’s total foreign denominated liabilities exposure is A$500 million, the enterprise’s foreign currency exposure in percentage terms would be:
$$=((\frac{100}{0.7})+(\frac {50}{0.6}) + (\frac {50}{0.7}) /500 ) \%$$
$$≅60\%$$
8.4
In part (e) of questions 16 and 17, natural hedging is defined as in Example 3 in part 3.6.
| 2022-08-16T05:22:07 |
{"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.2088215947151184, "perplexity": 6473.144173254221}, "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-2022-33/segments/1659882572220.19/warc/CC-MAIN-20220816030218-20220816060218-00796.warc.gz"}
|
http://itapecerica.cam.mg.gov.br/Arquivos/Download?idArquivo=3238&idCategoria=1
|
%PDF-1.3 %@PDF0123456789 01 3 0 obj << /Type /XObject /Subtype /Image /Filter /DCTDecode /Width 2480 /Height 5 0 R /Length 6 0 R /BitsPerComponent 8 /ColorSpace /DeviceRGB >> stream JFIF,,C + +1V3@ 7_x{zI@) %0PM6EWZ7\GJHIcMOUTPTSLMJC*4uB O| -JJJJJJJJJJJJJJJJ }!1AQa"q2#BR$3br %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzw!1AQaq"2B #3Rbr $4%&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz m " ?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (&\M@5\ zY"4%Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@ ( ( ( ( ( ( ( ( ( ( ( ( ()%n"+s⡎PTnɬ((^\yoto3s7֚@ '$jޕ[Xw@[)i-GG\lc}ޔ@8ZI M)L\^moW%8g :.VBG[5X7&j[˭ :+&-9E@TFAREPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP[åY^Yz4@((((((((((((JU &̭B((((((((((((( ( ( ( ( ( ( ( ( ( ( dSꮡ ȮC>= T|#THwsS"}LfVj9r[>?Z.~ikpj .\Kgmx S1?B 4^[y_OҺXGهs:gj}@:E 2~oƀ t~iHĘQvPLڵL?w\] 9R}jj;NR@n6jV^XFP"uB[0Y /we\.(mlQSY2m8'1@mߥkCtkQ8 9 PAky5+ɸ UG(QX+lEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPV n!ocZqRH8t((((((((((((giCV0j}Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@ ( ( ( ( ( ( ( ( ( ( ( (+Opk"(j)Epθ}Pp?! jԫZIhxęjh# Z@vB+/Rzc?ֈ[ u qjrZ|w5Ocܖg725m} \/@ & W!ߚia۽s0̠Չ:UX*+[گ# j @wb_XgIK(ϠCn>~T T{~TdcP2KZa|]b an(QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQET{} _f\Hih[ʜ/cVJZ( ( ( ( ( ( ( ( ( ( (r js/ *9zgڒ KEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( MSUK ;0sU/O*0|* 4жz[M4_L xm0zյbt@:>htW0TPDӞ+U\PA'ZlLwVLw;lJb71?6HfFc/ێzP*qQ}S~}(3lT Z[jinb} J~݆nOLS6ٿр֝a[ ((()=ih(((((((((((((((((((((umcH'$rZ:*r.-սju 4\u4Ervڳ2WMH]S *s[C/z[3tO(W*η}AݢHu"Jiٌ}Ymf=M@8:@ E_yFw*ڰK+ @ >\²8-J먬6ێJ~|,Y& J*q7 O-qtb ߫,djԢU+u3 z(^lRhXVw Z@U Rm#V=ڀ/Xzsyc(mAŽx */0yT乞DSҀ4o **0jwFVu[=hLR'DSM^λHX}(FʋRb(-&Z\OJ-P+ q 7FH2(Z(Wiw JEUIPEQbyΙU(+lY}t"$n*ŝҀ,T1I$eZe iV8wPnhW)~j *9GcLIzPQQM I&% 7LT@q5\ tY*TRJ'(z)0D,j6Fz T rA{U'ڀ$3/<\Ԉ*};TQEFO=hJ)34(c[?:((((((((((((((((((((((((((!ڄӫ?X8Pպjn (!ݪz\z Г[Tl"EPEPEPEPEPEPEPEPEPEP30=xD O?թ@Q@PU0. Zj}N((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( Re͚Ԛ?:E &@ faI~N 11O-@sKT}4?2U.?S_Eu:J_* iW1yb (1CpP7h+;?7 4D b /U@Z@D=bǽjǺHdREQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEy#? +ԇJ[LjIڶ}u(Ⱦ۵r 1_y ^Ge3 mX K<# Y&Á֔Ǣ&JW_h vj/}٫7&@ ا q,X [2_G˻@V'mK68ր;dLނV xq\V_-BgMfffݾD\'텅^WQ]}NY(s?zZ}W?y9ćT@hGa\u8=UUO L LSP;fײ%_/+2Ò1J[?¿@<C,DUEr ,בUhcl? gzP#kD t0V~ ݫwryV簠g-Khſ}ثX03 fُ-aqq:Ki}պ:PEQEQEQE_hPERw ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( Rw?z?5p@#$^gԍmǯ?~b$m\WVͰ4??l?z iOפ'yX¡~?:+=VM,] ֘H4I̟@+Y)dW,*8ݎd^ks# [nf'OJ֬8=i@ >pl. -gT 'Qޣ[Hof0|=m/P|AhUT71 W ;%5hM4S4m 5Sg\$S4(Isiejf ƽfm,S+zSҺw wzyy+A )b:G?yG9w_0WB֫\X,a @I4,B0tKu^:Ukukz2i9kXN */JӵC @aEzCڸ32%: ZPHyc|k2Oiހ"{W' +hgRKyY)Vϖg==&yecϵbx]CcWӒ9U* 9?t|qή2mwmQjz\ k :?[0=AN 7 yq j杧 h m.ku:Ib흫SxBl_fc*dY ѐz ߾50Fi:d²ǁ@#*+J1z >ݒ8 M?^C|z:_(K&7X;S{ 5MgL[w@˺>? USJxVv>TۺPy玎u85u@I /l u!ݮ?*k/XӅ䀓@?Rܥk[z-fk:pIOB7Rn㹖5iDojV {}HoL8 ϾmK LphtMWc6V\i m!| Uq;VRjMkNT@gvn}*ւ:m#:,@X ,Z鵋oX}M0on -oxjuM*\by#mG+lBƸܥkhv9Ӣ q@: خ_mˌWr:Sfq (4Wa\ƗSWO@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@# Z嶨QQR$K⯎E-A+⧬ ҝQ*J((((TrM>N1O(((()}FcRPEWBzIKLn⤨[rQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( P/ߓ뺽v/'!&nKܬߍZMx2UѾSQ?P#jm{کi?_h l)?C) H^s"p?Kkk$#ҏ*Uco%tv$O֘U_~E1nUl JexOS7F>JR7ꭽ :hG"KESzu&)h7T?kZJYZƵRJC$((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((U@*Is}*-;VJzUKA龴re^kJ?|MX Ԡ( YgP?R+^ (5T'6>J2I'V!Pjp N 2 =E^[,^j93@7?JZlqn =e?(~qըȥG }5GZ"TW#1@NTTr*H5ũi uQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( (+_c\<=e?g]{ҸX~sנL~z |vv?eM'(Y DQ5/=?h? R?PN?<$}Hs0s@X[}5qԖyQګMLS vM̋ @Ӯ?5sPl{¶f}bM̧T&qWǎZqH / % s^Ye# L42n?ϵ;jmQvSWV Y: ևR) ((((((((((((((((((((((((((((((((((((((((()'Ҥ'Ɨ X:cGuPzjyv>צ ;dQOJ{7W"hNkGIVm%N9)@ dl A Ҹ=6 j_u?y9Pk5Oۥz?n[uZ&4j^Q⫐z0+VͅuTQEV/3iU#٬S+rk?YǵzLl1cPi6 ~$ )[4?zbԍ_SzinN1ҦfM@[Ro "}4<5&Pviktr$'tOҀ9]1l_m8;x 1!Lkn +|fDŽ^! V3K8gTk[5E֒ _f_5ԆBJFyn[oP%pa}JG y+iK8^4Try=QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE*ZC@ IKEcQTr4-B?J0.5(Jͼ7*դ:P Ɖ3L+Ԕ RZ(((HPE2Cj'(h 4֕5E: *+Nj DjzdC> ktT _ϚCҀږ(((((((((((( ( ( ( ( ( ( ( ( ( ( ( (* J/^Of>[sYzɟ+RQ ACM(G[~s\?ZvkQb>[͘Jչ@kZtMiJ?4 ouSwb*ڂ-Սd Zm٠k;G n (CzS~/?T zq CP|*?TTu b_ ^m |G6@5Q@(((((((((((((((((((((((((((((((((((((((( -_Lsnk8dv=W;u+^~{EEsƒ.SIan#+24{k Z ju@QW/WEхK/B5EehVcYj^~kڳuOlJ(^ mzoKk1Nkj),( )Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@&(u%QE-%-fy5-%E4(=:jaKECwͻ^+eWihZo\+E)LՊ(.%-Q@%-QEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ((m1VՏ.3@~?JNJCO+UhWґGӟvv' ̞[TL Q*t UuϷ@ZɆkW_Y}J}T.Og\*✏24}UңM*bI.%2* RF*A֛ތ A֛J(H9"i@_+-'Ҽ?+-'ҁQE (((((((((zF@ c=ϕ[4QEQEQEQEe˨ƗF,Ԣy8R}h{=oP_E"K@R }CS?hTt64=Q@xZzL}I@h(AҖI$ OlT0LcM@Q@TO W Ojj : ( ( ( ( ( ( ( )(QIZ)4SsK@ EPEPEPEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQERZ((dҀ EPEPE4)QEQEQE 4QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQMSuQ@Q@Q@R_evn ܠBoКI%mR3-rcځu۫cU+ ipwuPZam7/M=6MC%D ?ɫ:|47w)Gu+v5~=X:xN߿l-k@jSCI\LЖ?&kԪ3pvw,lT/[ʋ We8w_"H }h ]Vh\?mF=uBuhs=3^=fާBA(4j(h>XxƴB}q#>>PBz:s0;eާn(7 :X~5iMk# ^~n.1T8 4bs|E 檾 u]=wok+_oP#t]@_v\犵o uDy^ݿ:+~u0u>?#9@}7\4tͺ?7=d@zv$:S+pGRÎrͬnxGu[njTE]aEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ((j< sXՏ'mxϱKmV& ٷ2_g\ o_OV\#1mY3E=0*JG4{ce }V v7?{R>i { }z\UZےM\CDb/4@麯jx>n3"+,uFvS&SzujDZ^rAVJ#ҐaSs֦"Q/4l'./zMW[}J+h) ((((((((M!Me m&8*CsOI:Kq?]RmCux{/Z̞ ifhB~u"~/ տ-X^ ,VSިM8q*oY4Hս亄PGՠ zn\ydc] WSDa]/ݠ ~+ڜsz%r5kPhO$jkDި2> @T3nmKz~=0#\ް˷ &Br;\ַd:+JP g?ʸo 'y5YO5ICy}e&IDЇ $I:tT|4:McQ[6@{ JH{v1ǽ nA]0l 5/J|=4.~5ҹ] %9|Mt^/%ap$uP%mZX']/+jlkxPgn9+=+u>qwѧ -QXZA&)Yg+A/y6 xM:0y g95M˪Z,XX^0&01@οKԑ>(npޢ 5xC PAToRk#fxOC/w ,{&aEd|@(ަF%҃T,GU=*yR|B8ݫ mJi~5sJȧq>\[Qxg ҪAƙk!}1_˲u 3-ni TuF :֥ { r@ ?.o m>N7qxAm](g.SK;5sk <1vl s}źVfz^ NcxS ֠7AV,u 2X5@{P- Y ZևM+" 烚ȵnzUQ+puQE ( F8Rijqe1>Jy)ꤷƄGư zkO- dp簩+Ƹ(^y åq֜txfx6tPH'42? \kg̤y[?s 10G sYoުG+K@fn j<-9*V0{P#sRg?ٖ-[n@'٧pZ Mɲ @ E"( -b\Ցqi?5\Nxo)=nj"m,̽se ?MXm5fherϳ)]zk~0n\垯"q~5Fۗ4 }qJ|Wo^s[yZ1o eW|_КMJHLN+~n rWޘGnqZh I-1Ye? jӚQ J}Iy0KLW5ɠ ٭K+\[, oO@3j{fժqƏ/8 ;ZBZRC:_2qP|= 5ӝ|(_^-|X6u n"|Z?[hqxO>껯dN>jj k ӥI⣝^%^( ozu =7uZ7# 0z~QE ((C\A^Z|s qҌߕt Ƨڳ>Y ^Cn &DSMk+} y63@\Yv?4ހ=>(.GZOQ@vh J.LAQlb_ºbX S@zTxf1n͟Y>3#3T^P{~k 9u&P7ZAΠo =>fb{Br.a1vcbxZvOzӍGf=I0Ve1߶aBs~:?T2 mD2:f:/7J[kEOA@jb6]] .?ڥж,k3HEЏ Ňm9˚?Ҁ= f[D1{~5q5: ?[tj}zO@³[յ+F-@ 'l?w}2nmʡ*? dAӨGOwWm:֝LOָOg+P ]}?.0*欑ݘ8uy O |ƀ:u kud3\olVƈeDŽ ֠ Yc ΒWF"6<֩xa@U-#<"UQEQEQEQEQEQEQEQEZwÃVkӏzа";U[P܇=r#v:/Uc XԔI -qPZI;?םDPd4-ޮ# 3'wm@wjE|1^PT{槓TT&;TÿT =|O¹M?u?UJ]~ wt. [IZw(5?^WkШQE ( ( ( ( ( ( ( (9 T ߮Mhhεo|^Mi 4Mc毎o#ZlT:e W_u,u?bcEx]vuT~o뺻#Veƙ c8}o4g}حj@TW _Uh0OkD=jΑo 6;v#5F ށ2xWGJǗL@7#~{A@ } [ goz65k~t-mqZwJ_ vmjhzmh+ֺJJX[p:babd~sC?NwW[H?6~t/w\gNTF3M?eߞS{ ƋS趿eg4 :x Vhh&9tF- D .t=hhѶv0?\UoEn!8˻n_2uZnR 8UAkq(AU cNڳv(j ?*?Ҩ:lE75?N緍T7zqꄶu{ʒ@ 8t,X-KXLׂI}k.Ix#*C+@ 8YLCcEsCOmLҭ s]%V3I. SVh85KftwZVJB FڼT R68z :\V 7ۖhttۄ/ZA]p1<恜_?#u/ޱQ2A%tq+ !{E Ռ]g>3< U{ Uqj6_%vqqځOEKf*c^](/ 5j4aֵOt1/Ŀ@>*cz(g8#]|Ś :Xq5zF}fW+CIm/7fugR-b5| 9O9k];O,L~< 8ֺ 1y{5i1i+D4Ԋܼ o;L>l ~x#Qֵ 'd' iJ{|i %ԏk/Mۿ+W/(&76(\1UƮݹ5iZgȟZQݨgPqAH{꡵)t~e ~ ˸e֪!frg⺊ 7ozg:"L21(w8k:}STAQ%g7Smf,* J_@صFIVQJb: nt1\MAaZ¶]5;Z((j:*?*k?㭭9H70ҭ@p>8?W}\/-uq@3 ҏ"~1D=]R/:XVEzZ=kuᓯ͚z{GG[Y^ gykyygӉo wyŖ̺#4lm?/䞻qW Qs,} 9k8q Êeqqi%I#Ěb!@ Ӯ Y8}95VO-ehgzF1s< [-99j-3@Nk? 6*DŽ&[I_]?khѿ ү]56Yħj ( ( ( ( ( ( ( ( W ǨhPKz/RE+_~7^/@&vobY=Eq^ǒ?)럹Hf7Z|k'YTC*sꆁ ~]ZWzuxfO/Rzu )9 CrIuhcHk0JHMux_'4xcNk ?W]_+L\Vsw0g/xB.<5bC#QH=y5Z+irW:ǯ+Ӭ/h鮚gA*yzz]3V~k8ǩ@ 7]Q#6ֵmC ;^?1KO> סjU#-c4Nv +7(qy#]mQHqkkDmc s?GiПs{~լ =vor~ W_^: 6٢WYžا3vM/;}}'ƴ /M! f#\TTp!faEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( *̻ }jm \-ʷEv~bPGT=jڂGO҅8IѾ7 }[ ӏHy*?Wq@m>Ҭ\U@ ]*hh~觞@QP"mK.v@btz DװZվ7AQ»#:hJZ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (#\L.7#m몢9K}%ԮퟘQ@>(((((((((((((((kw[P-PEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPb(4PIZ(1-PEPHPL3ORE3hEQEQEQEQ@Q@hXRQ@3ݚ} )PPSQ@ 46a1Ns] l+ۥMEAzTQ@zTQ@uYZ+bTd!XN((bW)nE^Xؒ:Պ(TlSQE6Eܤ2H5^xCQ5dv8V dFTԔPyj@EWe;T=~Aw, U(YFnlUԴP)M{b"p W((((((((((Ƿk[N=(O}@YSm5ַJ}Bc^qdA\9s]m 8?I="Dꆺ 5 WW1٦ :R߭z} B9WGj!=^mO3Y50zimU/.d_au#˧Hsh =h5'?ƳSf_xz# zv>]Xdr|?#n(gKTzkcRb1%|ƪ& ƙt~F*cLdG^kѴ6_gK Cm kF<&65AAEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( C-ArҀ #*j6? iMb6*dme!.q\ʻHShwl*n,L{VT:gZ 9aaV8F1~[WC)?z9ҺM4)?]~jVѾZsړ<?<ցt:7n륶@9zڳH(tYD jf- , V|TLJcBc@lMA@((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((S.Yc?ޣ}9Mioo,s@;(qYG 4RfjHmʑPM=fYxbïYKQ~ڋR&oژPz" П~Z{+7RP+^_.,5yאjm4 Eo| n_zΖ 7עpg@ [j;ʦ*QeyjL ;c-}{]e?sy?|}A/?_z_/p}|AՋfQkk_\PO3\ĸN)sz PXϊW8EGኖP\tb^Q c6wY3Yd"rW H%L짇1@y GLzT r ՠ ]RQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE5:yDzOɟ@W?3 j?v: +7Rd|kwݠ72[v7ɑԆ@U YlқPVX"ﵶڀ4!Tl@'LKݠ qآ)-,V) {}i~7u5@|w}Od=LUqi~}hysI4>j/}iog"ѱ ALY-{KhEboW o>Ebh{Z_v&6ӷ4?[v>/Cɏ J)JZ(((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ("xNXpsZ4P|Mj+# ٦7ߥR6;{~@rS/T~ jG##T&[gϲ LP2-v[ jq}jZ=/oS] pU\c@ 0qTڷ sWQZ6gGW01SQHaEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPQKE%PQKE&?t(tcӨяNm >nm iP6֍@ ?Z6֟E3hh?Z}̓iP{FԔP{'=;ԴP^X*J(((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( V%QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEUeB~늰zW!yF |&vS!]".) ((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( *)N*" TP ԴQP*8 Z?*h?CPIXr)h "H2hJ( ( )lS ) "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ('(J#!\]~ @ j?٧/ JZtkͼ4Mn<^*ye[ށ -- *kKSQi7kֺ:s5AЮwj P=\PS&m;z->s=的?nc(@D0z uTn٤j&#HjgbචtVScv mmX 1UC'^>Wo' N2h:87 /FQ7Swvr~GLfVbf%ڂ~j"zGe٦ ѶPostWMɱ?Dj2<@lg1%qSX˞@ʸOq?jfeG;wuAy bqɯ Ov@ xnqם3j"-?WY'|Zw LzU]M^Xdl5~[u;X?h pq@S%]ˊ}:[+YE 5xC^:sGzw]gO>oTs: P_n岻EWsCDn9?9}k7eT?ǟTG-JԹv} Su2myM㶡S^Lǁ][fJQ=)x\O渽 Zʸ ~Wy dMQ&.*7tU OP*? m#cI^g'RY?vb>~y IVVkȢnqy/hd'ß [<<}W{^U7vO}8 5k[R s< yzgOր=FwJ6WK䇎_ڑ\/^Y|Z ϴGATt]cϸm9S^I5ϗ~?zaZڶέW|6Y=#5GڵϚ0U/d|ֺZT~fq3@6SE>٨]WP[|m/hY yZ hn%L 4}Q.oC[KҼ__znR;x?T *8GӠ+μa! kh4wDc5r_'LVC,?ȭ@TZ?N+_>n kSw OZ|@Qk Z/U] Plch\Ii,(WOI'IvGoWi[y1q ~ΖiSJy1I"m5bF3.(hLC ҽ?IeqZ}f '!보)a ymE|@5%n&]pkua]55}+Z!My&/ J|(FX-w5ͩ'c&hEvP~5xvz+踯,_:⁛s?U+O>[aLEEެl6hcMqWga_ךmTX@ ?Yp?U_AK#4C GOǿ3 tz g/M^[ 2 /_vrُa^ymw%QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ("tڥ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (REQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (d@{ dM5aS ɠ *'l;6 J9&(3עsUXEb& MgE=O4Ew3@VAԣ\g"Ycܧ4-̢ɬX3Ee*m:L>VX+lBk5(A?=jTnb6./RТ;F ҢXw(;*=M> ( ( ( EPEPE2F5_Q|P*O E- ʪ& 4T 2=Tr8N/MEC毭9 1@QLgր%֜ PZ7ZfN4Sw 7P)@ E&hJZ))h(((((((((((((((((((((((((((((((((NQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ~ -~kD}z]䧬ʀ]yi cmZ|@0~Z VWOsAm9u+f j_TT>V'1vUFt?Ҁ*8 + ַ :\o7GWs@ o5#nE?A?1 ı2 gm/_^^S~5Qu&kȥHݠ^kq iFi ^Q+ } ֻ G]XÝ4y[#oTkJ0{WCXcCrY]JzE^-?icfxT[1\G->۩A37&W &@0{SzUP_dXZE'iV֧.[=yΊ((_VGju)|9_|KZtS'ƀ=_:)=RW+< e@Q@ qb)(U 't[a7kǙWU& in3đ GH\'X A뉯; X3tg 9OTs^_1mkb49,i~1@ bH#?) qP7^9!۬ k@ oQYu@1Ѣj?Ŕ 2A rtלh j!nWz_'XCY6n2je]V>Śn% k@ mxZ1DžlI?9?՝ Q[om@֖>+ TKM"P3c@"FQ u^e|ct/.9+ӹ4VW~˦Hޣ\ob: t?Zt q[> ^@Q@s +eֺz z_Q: s SCZ7/u>t?ŷ ,IԂ߀GGI(cyyl+-0=1KWPxدW=+5) M:*%9'XJGW'K O 6Ǒ5k72 =~W0kwq!P~ooQK*VT};S }]zX Z5 nIhlguW?2iDžq_\7OT-6s9?=njKildj'_Ʒ]YPʹPkmtDfIhs[Z0a5!iiy^%s7AR#!s<)_ My4CZZY,\# ?kd="aCS< WE^skru ;jP֮>˧'3AV s0 u"sT|qzbx6RLӵm7sh] 0g5^5QER74P+lg)K=ݏ| *WESߕ25Hq\c͔2z>* OfKs-I 9={3 7uwP#Jح}"S6 K)*kXUjMEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (n1VZ ҡ]/ ԟهhk}~(Eدg;wN3n~i_b*E褏|/Ö ]Tʶ͉s@ ec=cZ'Z %Aڀ37xJ4־ >=7b_k>PxЉwy4cVkx@yF BShzY }hݔ~Mqv:%^xq\x3<XZ#};(fzea UmN@5~9A]=ⰵMR<9 [O\/CaXi jV;ܞfKyc Poj$48~oƬikyJy晣[KldL7j ~/2buq:7/&;d; QN) X(wz P=&oq5Jh&o?4K is^r\>Ku|3]& ,Ou j( oszf;"i_4YX똩ꖝUa%] <?mZKQֹOjk9z1w}Q]_idahyRokǓiרysxvVۯ _ V0WoZφ) A mwAלxP w|DɌ#Z˷84^ZNI+Z&H:C&<ǿO+o@x\' חOj>mchb6X=",FYfXm[#NqF(>3쿅w -s;\Q]k70cjyO=sz͵zfXQ]Z;AVje1MiweRx\VυAd2u J=V Iq\tϴ~5֙:Zo"WM.Y!䓜ΒY%ԭvvhr@ E!TbFߟv+Ӵ p+pڤj?6GFwTQE z|C)>Rp*6h_ G AFO: tM;nkƀ4c c?ʼ Z$xE"硯 Yo?[-9f_Y!8<ꎛ u ^]BmTlhht+Bv ʴ$k^eH.h,>iU5vi~Zz 6p]ݯa+Mm ros<.[{Wrڔ!s4]º/I\w|dS@R yCGg 0+W(2 Z*h*j((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (=(h__ԤtuI|@IEswZڲ[nV5YlouW)jȓt5oJ mI6s@ U]Jqmg$ TT6 榠5d{U}3T{lv:z+MiVʑvW@_tW%}dWm %8տӣ+]-Vvz?f[jROCtV#_2%Q+V)2 [oQ\$H6IMBs۞($*9&j>Ja@tVv} 5n&qe#IY mi zGrk$yPԭ[K T @hCH{PScmȭ)QEfa4ȭ 6n,v++Pԣcڀ5hMJ9 ZQYڅv uW; z+8_c@Q@PzPEGH ( (=(hNH5 n **6~RQ[@tVW?ߥ҇EDتGP @TU+k}٫QPJ"\S|PKrɵ[4rqp6P/ERKcxr(hܢI϶E@hu *Р( Hi}N*/'Y?*u9QEQER1pP)3-R WBg E"Z(@fLEP1X0kW{o( n5qFmW;CEW-c @Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (8O v/u ~5ArZtOqZ~5']?^y ٿt7W9ARZh 3)z'Zo-%k 4G3s(-@u?vU,b_Sڀ9_ _T xU_OY>Ycco\}8UΈ%e}O U yg=/]'wWOV۾\_Uf_EI\Ǐ ?r׃??^ yïף]Fqj♤G{-]<ş0Oz=Vl+ͼS!]Mm4:o2^%[i뙩GJ=&f<ß1]+.WupדhEiTnF(Ms_ +v\wYk!Onzx\W שƖ(u0]ŭs^eױ/ J#EcVeԮєڢq>=%ep\.\YIs_ {;Mk)5uVnʶYIOX @+f?*$@(5/otMfxg+/W1}[뺀=Z eyP k# ºn~ocL @~ ǔү얛GW 7u/ u=" [r{#"kje(:xwIרk_>K|Ud&AIEPX~+6nW<}ES ex>l *&[ I^hJ( j&{'MخTmuzB'ϬDtN9ZнY*Q@ ,AX_O&>!t m6RG Z;'e 7Mmυyç:=f, k|mƸu4;mVOkkP Zzx!zd0F,ʏΞ -fN*Ϛƛ?xP eCi9F]{[A_ū45v(Ff*sl5f*l^ 3 mmjn7jњ|U +kt A3@Ķ(t k] j - ;:SE8zvɛdNދ}bxm蚎|G)# ^6: f/CN ɐcq]"vl +|ovtړ>8U|C >N{&mс /A}J][~Գlb]WRC4]k9Dk)OgYtLyܕOI~ѤN[?될?<P tnk^ ,9/d" 5xz1S_A9 ,.$ogjOMd{ocPj& ~aV p.ݿmx"]F((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (=(kK%ZٗN%sN(* ~#}k ݫPa]'ʛtnR:*m0Uy {Vq?~Z An/ @ W/~5x^:LGb4߶*-3J#uD#+g4{OwhL eza@m 8{{9jԻεxu_V- qU~#˧ H#11XZo K?JAZvfDIF+KGӚvk|(ٱx(x ğJΌ5iۼt3_^ڀ{W5as,rwf(K6:m%"=ryuڃ"1<&b۲kEϛ_ܭ vѯ-ydz;\O[E K@λuR+ɥCe ٯ]^/# AR1ge=ʎCWoҀ5۱_5AbW9i^άX O.A!?"S="k(Y-2 |k|m!?Q}6(UZ5]"[הt 3l[\ڬaRM(oIαzWjMb\phrɑ dm#U|w{Y}bUxZsϨ@|⁛:끯dkt/Va(ה6sk|6̚;uKk *m I[7 \u9뉮_[g@iX ?jex jc]o% Y4mkF G@ io'L|/>jbk?,2: ^;TZr~+[_5zS|sy-FkAkW@3HGcz}$F{e'Ů8ujxO BZ]?F5ha+tG{} wV^歲ZWq4S+6@ ݧHWU\Zi"ڶ5x2)կ/%!֜ 8 Q v 5 > ٭G4|A?bkCyz{j.3YvM*|~Bַz _ⵟ[ ykOL]} Xq iٓ55xn부es$Tq6G/L3/ _ס6ʺWue;/\o #Vf3Y[ج|&OJjm ߑw{/X+á5vFJP\ڼgsdK>Vm F ZFC=Gf1*/ʧ?oqPA)+n 0 zK]=qzliW5I~<}f=#EhyY}gvqU( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( (3aEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (EQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (H2t^};鬵 ٭5m.9(/[?le njj:PAXFV ߢzc;[ P+ΠէmE]ݭ[Wܢ Zn2 sֺ(omj((aqsx7PSE(I8soeNȬlGONn-̄c-WJZ(]_SKV\I{P.]yS.zP@hQQϐPW!{yONCjy\nXf }+]Q\֧9vv=y.us tѩZuS\RhV$wyXDzͨy mmQU}HTom9:j+R2Žb&mcmёs!H5ni(iq15;L}@TyPk{T:жp V>} ֫^o.R?ր:+ O>ʡe-Hޤm\nڤl'i z)JZ(F8%SZl{mآt)SZY ZIvn~TEfYj1N&M-sG ["L8ɠ +mE:ϼHe SV7ZҢLWbw5n +)(2~HʷjڌQ{1nG@wy!0=k~|:P s@4V|pN*!B5hovzN>V{ħG#6hTs8Dɠ ( n⧷%?)Xqy GN <0A{P\\$_y@hQF͍E}N(z*(d.AH9QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (<& ٠ۓ )5vo_ 1'@|Bibe>N(>է&{f *qao\ss@ eK2nנZ\ys hT4RԖ=kn }VsDhܼ|:K+JzyvpWC W}$w?퐠g];z!5oQvVIVoFb w6_rZ KO}ZҼC\ mOZ{O] Mme: [C P#;b'b6eՉ^\09e}KF!V\n]'I'%jY!HeWלB/AJ_xw/_~w|jÿw_jr in+k K@ kE6ZWy}O_j~ s ]hxF#JmqZo&՚?0-ܪ$/h-O-ƮiY=Ώk\ETj *ꓙ:]k=)"i YN%=Pv Vghׂx+zyF!ۏ@א,QS,k ֮+Ҵ2&h6H\nzzcbk?w gv| X۫B?xn$?9,/=0h嗙m# i_ "-]$뷌E#Ҁ EP1\^$C ¸ zZր=N'N ((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( k$ө yMWoᩃv˞Dxkl @4EzZ@ݨ3@ti" KO %k"7Zo \}S ^-}%JM1kuVU%RFGiKj{{;?We\gٓ1t{=jhGjtp*BԮ7.(n#&Tnͪ8)c55#S1, S/O35iZ\FEg˧흔zJ͙ kd*ċph|zwj WW'SĿZkXE@jkl@<* D]0l4_-ժzQ!f ZڤdTQF (VG _=T]1 b5fhMm3y] 2+Ϗ3SڤҀ2ea|=r ?(Xí1^rwtgJZp,Z9.; j%6PzHhayWv?dzhdƯE&(|Q!˟4cLEQ} M2 yf8u8D&^b03 [ CmVtssNLH @lҟ̱sYi1HrrkfD 4Ervkj[[YL'G s7CeV6WSEK+x>ٮ?ǟ 1a\)vIS3WfYZoj m%$1$e 漰|S 8a <'_柷Z v>WGvk;S㺸 jH% w}EgVbp Vy-[-d>EIGqf_?u+|}!h됯DevFg&x7@qk3yJl~ʛUZS>{(#6Ҍ}ޟc};$#5e4G9kG7G{#5̿]Z RoMf:ĸv 䶙e(K]ؼ ]օo]6(=+OKS)y?+^hPVu·N:h#Tݸ@ ajz$fkZJf5!dw/|:8Ά~C4M7N{XbEVfd_֠}Z:WpGӥ4 }UO.Gmi/uqY+vZJ!ݿsCU2Kۅr@4)!(:#=*?>݄ج.f*֑lhrw@_ #:d#FFk%]^%#<3iL궏F % *RfM4 =+'U(DPsv~k$tcLVo[vNG =(=+ ~\خϞ3] i&7S@Jbm(rxxFjnnl C%'s 'DzVض3I} kY Ha@Efk^a):reԥ@0>Nk;p5vQWGK4V^ǻg+| q^QmY|hš(z( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( AKEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (M (/%̖+WQ<\2SUQ0M=k Ĵ-i,cTY |ڊ.-\Mlbb-Q^ui{*߂2# UEZvv?*Z+^[4 EUf,j>clPVN-e_S8 j+mNkJ8wc5fwc-\Ι,7l]ة %gX(X@ժ(J#f=rU{"]Ec5Wk6V1^af:*)r|}SVh8~&gYQk&+"UcE63OU[H7^>{Yp%Ļ ڀ5 Q7ZǷn~8JeA:6-I<>a$&()Gu TQTuK{P+& 3֥<h"/#T^l ʀ4(XX V vLq@QMhW+jYNTwOg,b:J+Um9].ݥFh\ q -4A%Ijws<~QҖ~/cQ٤ۜڀ5KNZ-c{TZ"ǽtV~z_ʳuINҀ:*+ѵ6-:{kÊu c6OPQEc7wpn=]4W9w(A%ܢ=jۢm54(RMlV ֪q sRIu*E@TVVGtp:VV=֢Aҽbm z*r.bg_PEWƙۚݍuTV˟)M+TK(8 (nXɵD]gj@4V%χR*]+QʭkQQ#'dC# +.=CP +1u~wT[DB_y]b"qoQXyyWnh,f_04EakÌ恬AܢWV\kޠ V:갓R' }F%i5aE*EdjCm28 UK6*z,~kP 5+)4{EϖMZ7ج edrNjO[ulꨤcMRk؇EPt_m/QH9InGZ.QP*[(((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (< Cm?yߌ??^Z!@ Ĉylحo?Q={Z a٧;y7G_MO塪[jׄò) hҏO-_AKDO/L=Dxu*4 MkѴ j_\W|Ef @ ε65QR#qyXoe ڡ+m5 u=)'1{#keٵQ>+Үp&%ܵqZcԝf=Lt_R@7C~5^'ϣNҼ0Cר]J"U'@ [MSzWyQ_DS=W&w}kt=hSʷD\Ts=+v8b ^i~ Gf#yw>"(Ӵ:[u+G[xxeF?_Óށ - 7h5˃w7Vf& | Zzޛ c zF*2.bOEbwrY/%QxWuWAojI=8 HU I w01c'"O@c<^OU+bo:0(_/V{Oh:\^NzF*ko"J)OҀ ?ʴ<9hhr$;J5G?*M7?g%s\zUy.פP@ן ǭ»* ǥtP^o qWB\u> _zVo\J|j#ӄji\N2.,smr=cxċn?k5?Pǀ̳쫝G]yupX]}@2Z_&1*0ۣ?3@Z__z$9',|dt17chfT֕s>nAꢺ F^@?kן7Ҽz^u3_ ր=fI|n?USka."W].r?PEP >m5/vmlA ]?qyV܁\,~W\)|Ab/m( vGVq]φ>}(~ JV;dI? 5Q!@hyjc5- z3֬m Ve;O4 ]QHC⏗Bv x@w? /@[L84o@?֕gk&{Aխ>qi [kjA WWq\W7 @\*-{Ѫn뉠gx[rJ r*]A״^[d_{OrJo~ ?,k U\ ojvʢ^Y{9 hvmP3ŭ7xچn+5r5~[~ [-i+:P3~fG~?X> lkV!f4<Č|wE k.^ m]Γk\Km@(_ҤFW {֎j.?ƼtNz3 | oGhOλ; Q@(((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( fؙjJ()I&Mu:dCr@ WLn=D6GMEp~0Kˈj߅|v4P#h鿸aӢΝ; Vd"xza ]64Zjws?*נ@ wm) ɒ PMu4PV;5/>TArN?n#$[PxiWOZ|J|]ޘDv: fhc?Ƶ()vѢ51~ + Q@#ݺ lVռ6k3O Q 7ZA^M(3I'N+ Yn^^-6³Q]p @}a*1UcpiX9%u2 n*xy܌.oR}b,kJ;>ҽh@ oپݍ'42O]pzTxr5F2ThK bd3IP ],r\Ubx?ϵUIS %5 jS]풢 @ qOT 8mB ;G]/\ 5&MgE:;tF( 5A2xV(/a־~?Eu-ͲM5 6QF(o.. '.slUiC=S_^ENK8L7e5Q .*D <*㮢8,Z pPT׳r99혯Apj)8Ē iR.8*x:-.sTb1)5ןtUzX}+~5ڸ|q弶] UKHUrUMyia>$cm_aM1Ow{Ts^$gN6@6~ ؠo^+ڠS^A1x7pj!oYڍ]ZQNΏn9m4ؠȠ Z(ʑ@ /uOjΗ ϖg$P<@~kZ٬5&p͓ZyQźoa2U?[+,S#W.g:gU;4uv⫭O}:]] I oSkF1U ;; 5vf?JoGԑ@ f@j6iVRy?;ԫ#EOjc9 !qԥK zV}̮F(zymjCj|2|r UiQOt4Y8@qؤ7l^&Rdc-rkĥPWQ dTSd_}?cnqMLXJB.r )> ~ T>OH-\NyO;pJ|Q;cj*9O^ [_D[q@\7yd+n?;,W@3N[$n7\ׄ&~cSxtb<KS~ x q0 Ҫx!)gA҆ yߎC{ 2Ӽ9('/aY!~ZŲk:i dYZk}Q7˞+ޟXqlc- ͑x hײַ.8Q@ K\glmՏtO :(_ʷeKEr^3!ū|IMued}Iö@ nԄlZUs1xƊl",^S2Ǔ@ Eenp)=q"3 VvĠzV/Ԑ +?Hl76ExV)? \4\^F$TuOQ4mX {{jƽ^: +0+3Hj4$Z^EQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( d˾&_U>oNoi;鞵6InU[^h7W3} Y .p6" +>mݫ"'>ܠbhwo#vΓj鐬?GÅ=KWEMJ(CVO]9|w?+ʀ<gٱ^K@?gq\V!?d 6h?o@ďr A] tQExq]VGR7"_ ֽ:\i*B + ֺ!AG/x]( ß7_Q]& +q _ u@*6 V!\Vx~+/+/m,mr{V~!^5|>'XHz K[6xN#5h϶98u WxJ<$M~@ C]jïw_X ?A]~$ۯd(@o'@] s?!s_O77ҳ<; ]_֔Fݘ R^٣ZgCkrs]_m j4jJ(X,9=mx@W;e[a" 2O9,j%{[PSO݂8f3+qjl.Xq m :-z-%oU1p2] ⺯o@ .>k şvſ < !Wܸ6/:5t vA둯?hԫ|iyJ/[yS??h(olָ _}i/.'ߝK3?kҵ*陯8ۭjח~t?鑭כnt鑠=Vm 赉Xjfzk4 -l7 -#ps\%ڹ{Rv;a@z[tHު > ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( GX$Z9>K(Fjk# ַh 6OJ|AM8n]vZ_)杩uqN騠Eth4c V^ O!oں*(Ux4A)V('ĺ|H%tPPܱTfn1kaBFk1dƫֵypz-IEdk sW]˚( ew{vOZTP'3y*C$:@5l=r> lo>5tP1ޗO[zcLqQ@)\_<;NP"mz\b k<¹C0?w1ڂ.rkd ? ibT5gxKu>:ڹF/Mb-u?1O9Pjׄfyܿ01@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (4SiQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( (-PEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (G @@ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (t(((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (-PEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( o~=Z-P/= lL %98n,S5Ewl[Jޮ\>G!qmwc-ɲ#8RSK@ u^\ʌYf,QX%(F#PIEf 7vCPJј-Zh:S4{>gZڢ(On,7ޓi}ti#h똩 ~-#?VpyyClQX6Ki=z (v}Wf{-M=jԄȻ (nu?>ejwHc?f!埽lP sQ]}@/N27 @ _vskx-Zmz֧Gٿ(/ کTΑ yh$nW5 _ " 磚] <]l-6(oNY?X+ix?tt^MkY>)7$ 7JuxbE~̡R82Mΰ.o~'\3 M2<?LQܳSD:ki*Oʃ,_~<>1!PCgO݊4._ ' RvZҟӭVFbNykvD踠c닽 A]q.?5 gC_:H5c jOIcdݟ YN?5+sddb Z?됮{MWƗgdiScw x^zjd?s^ 2JtŤrX7Đ.hU{<9dՊ 2[5KǑ.) ndF7x4"'+iy F(ņ_HR&HƳ>ڲ\G ZtW pG~ k^(k1'Sa못Gwf+߱i؏rSp+;7#V44OpZ)$ot/l"O08/h E {Z] >K[H[S;@PM7p^!$x W{\6#(C[Z!ހ1C>˫HƖZt| v^3\Si2SwP#%Hv? gx>[NI?顭MR_7rz@klj/D,h>qZm.85AtcIYxn2?Fn$xZȢ+S Eer"x?vlwxBhkӼqVGP#^ O6K ls= KhۭboXs 3]pMOJe{fjRD T(ЭLٮFUqA]G]q{s*x +[2<:t'aXZV_Gݠ ғu="HuZ^ XswP߈>j͊y iq'!7b54Kp+?SGҮ$v(G@Vl{$>вm|?H?5GP嶹e榢ѱZSDK00|a7?Gm;)D&^f|2o3HUt5sykB e6NV|%3* |cy(ta&o?v izjez__=!LII'i8$E㊹_0_~f1ksʑ1|OTŢrwخn;kj]n o]Juvsk#J%2Q@ўZLk[6xqڤ,3k#hZ浍IoR+;|N O@.U8_ rzZ|+ߺFt]y ck³| fnAꆀ+܉Dk/ggAޡFGۓz>"Oo@O6P?j&Xo=io%oD.sY5<J=Orh~oJu)"cTU /֓@ s !>Ք. pZ!z2l[(:m$cXoݵ)U / Gvc'g ތ=Q?JKVKLONhȞj{ۉƬ;GW#泼!}' ݐ語p-{bW%#y2Dk@WR/Obˏk7.L"QU d 'ԵRkKS4СܠS(W(J7 ld7Ln|VFdҌQWF+z٠ D0j͖ 3NwV]W$;ToQY1 QN_X KM=jm2-(6W-j- ʼֺ5m'b/=FmrM K(B\wZO. c \vf/)Zɻڰ⿇Ҡ|- -,#֮X-;trL!U k?@ Zy|_. MWbmְuxx}BC%HC f{mrCS @ bW ꬷEجI]?[ Z]]jQC6yQmۚ _[Uo }Sy*0A,[rZ/*d( _FVY5-<}ƳtdW¾hXH2%p\~ 'cEKSs@QH*EWV@z /k/w9_@>|xjόX -uFkʖ Z*"idI ySֿQ]QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (W Z]ˊ F EPEPEPEPqN(cnN DTPTm(ǥKE1HIEA.~話▊$"Uvlu +x|h [6BxS Պ(8PF T?\պ( aF) S 3SQ@Xsb#O8t횡ɠ ƲJECQfs֮Ee :0+B1 (Ƚ"msH\E#\t9(8# V=[P 6-#EW4^vNwfh7@ycYi) ~q[P Oi'c?n@6kka"tEr>ᶑ%v6u57CfIo" w! ($$ G5Y-d/~Ef+{%.Y]m]s:u4P.-n i֝ɑcmn@[)HUIgkvlSv9kQ@469ⰵ]Mq!uPN״ +[P=6Yy3Kh6Zܢ9 ['b}7JQbMN*5rzd_i3]UU>, [PNn{ xVk>o@moLX%/[]=jtVLFY延\ ǰo*CmKn k9 GMR?JE*ig U-ދ:ҵh(FN HC~8ҭz1\d5@ o3JLzv(-uK +r bZC%GZ4P/HWf}eh@ (n6OKj[P?ա#6hd\uP+W{[ڦ3r.Ϳ*c V7RFC[P7elf]-tQ@ qK ֚/ ᮲K9B+W0Bw5Q@nlZ^%/d]VşKLN34v g[.J7[4?gӡjW;6Q븮3_@rj+q */?Y[5uqDvӁzٞZtz@(#F;Z'uRPEj6X]LLZ9 {Lz=vT Jy\> z:7Q@u_ȧn?Z@?u#HFh?Kĺ<+L+[/Qz01MC. d"K7>b늳[}O?ƮF: @ix0Ƞ #ͶLg4]/[*ԑU~ [kBl*!M"\V>Yt[|7jumZuB bxٿqtIc/q]y_cݰPZT>Fk/kt4xe]WsWK<:? 6ҥ<@W<8|Zo WC%L*(#( h Jب.!Yqf2"I o{]-+"9};[FZd^R :.IFr_wtNsdB_ ye r @ t6)j'ݼ=ZG UE.xٮ[úO]g^E;e ~S,QsZ5<ԖVo ڤ,3r.H )!E(;@+DsZN (Zv7_j;>ꎵL-6b88FGk&\y=jݺƠ ?d؝4Ͽm Vӣb淈 5xcCp;jsZDtZE.:3όG?O(O@ 4{j ֽxpV 2' Ҁ::c@1 j[5cEdxtVtn7k;jw ]Ӭv~5Էc=igNEsZl]Qv֨GIj1Ί䵧On?v :>9}R.Q\݅]\m;B Qivk_d~r:IEcxle}yؤvG]Ej7N|P4Yyq@Ζ9}jdx=lϜL9cWU& y,.Ǣ#* |Y=a/iY9w0zW x]N;[Y4iQY5Ӓ_\twR?h__8Cm5[x?ovxP[K 5g[%} LNqW7aZnH=hV_T e+* @i ZZ٭^Lg*zʹZ}ˌ|ƩO fyGonenqH]{Xj e[hXXLq&< #KsZnV7KEPEP/o~h=i'5j&O6¤4 +%^Q;?-?i j|qFy +SOʸ}KǷz-u> meڪiWZ~QO~ m)]5X]JSNS!@^ζjͷ[FX:GFq<{ڴY3 ?Omٜ%/5)*?[K}X6 u 䍩ϻڙD赕R k&h_c2v%ݎGƗ&+TCZ F IgnҬit U]b[Yvđ ԕ*B )SPLt4Jcc@nvcQj"[Me:M{]!Ctc:)qO E "+ZK4! [ل#vbЮ>fdN )3K@VX>Y둠 m.|9Z45I~tU)o#Iv%,ej|>&=!:(((oֲW^ 巭Ii{PQEGp(YaQNSiq 3T:mk@(()0E/(Ih^fMsM\ ?WE@Q@5 r+ r?&[w:|l ր5(-ܑpձ@J/|)G8 LyxAN>j쨮{º +a)k_hŭH{ M5ѵ VL6+" &kP?Kᓷ@_#Mj3TZT,tn"#Ζa7d+FsS>uJO #l2 ;7d5iY{ *fo.,P#?pt>, W9"R ]^twZUkx_|;xaA5YwYmM? %밭}A6V/>4!UBoBZ3-d荏ݿZ~3ozBY?iΎB]8+I4{R1G+Q&mo E@\/ ,P3?FB=mu9|#@1%{K IV SGJ MieW ,R1@Y]qj?եDoXMfĭ54 uu]StTVfq}=vkL?ub?NX0wҹx%'vu lNGJkc_h#QA5"N#L[Y[!V_M" ͚Яݚ|tg'|4?z Ihc?C\ͺ 7 kԮƱ<9f~%bh%(G뿮{6~[s@57 [8 kB"EZluBZ S Ug :4 ]yK(nψ?F8RkOMq ?X]JM֯ dW!=ճqPkY:?kV=Kd ͷآAE )Yŗ>MQhO|i=]UW~PpHSZzN :U.<벫U@Ս{im|mm>9IIgiha?/PP)֮ @ ψeFtۏk %κMew ?'v51_v5,f)}(z(8-]#וFFeHHa]s~Ӎիj頻GwP ԅƩAvW|]\0+ųn"C<AJo4䑇]8 Jim鑠;7 s^,6/>T^1>V[mԍ 2anvw7IqNd U ֯Y4? ek7o]@~S'}Ʈ_\yYIwǴǍ&#nNV֫^Bc5W#Gjv3Z.둫KXer4x~i8h˟鑷f7q! p+Vuj hoƹ ]Nf3Վι]8m7ը?.T c&=֡w? r62ø ? ?z>lVl?aZ3Hs<7?T*o̭.UZK-bezoӌjm=C^vM U1+MMMKU| 84 M\(~ѿ8Kw5_?r4]L }BYvЯUJ ]w@4뗏]{F;[^Er5ZGo?TG_kOtQEx5w Z. 5BD?X#:}y#"ݿ/ius)ln=s }ē[f D?zUosEtq#C6:MdZ V 5CevS@:&5!2}zxL֖p.KGJ{oGih-_D5AdeMꂧc67+uwg_ O(Khvʹ xy=7WQ[;k|#=)iJpy */3WC B >⫉+t|@ -K:k$,>!4+B6ƀ:7B kc@M{8 m&P#]/ m Gi08X0k{e !OHOX&/kz PX,O& ũw=X?uuPY?hyckWu '56sh9gY. Wv&(bkdYAe0 g4O"X"E wjFuYG;KQf5@,{ͷЮhd>|SY^Aƀ' ZV~ ֵL r?GCdS61:SH65Os]>4 u_ZضβYWO_?0ĭWc [3ۊGsm?5h}I"2*M&]o _"<8^inKt4:'v8NڸJڀ {r"uNiZ) 69 u&T&v|Eڰ;InlִL|q+uu,}N֯EHg-X^ޥ?κf giQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (Z(((:EZ(qswWiY^w|ՉCg5P^Z݊W3%PԈOJȾg|ߍkP0@"*T3Du [6BIm jc(ͺM4 F*i&หPYYFEP8v*PH*G- B/MEUDϭ^2FIj҅hSZPOz Wbǵjz(=#B׳Ʒ]ˊaq@Le=>dТ2知n֬@6E܄ Er m9q[]Ajحkzo;+1oۢ2N+ L7&q[PGY Җҷj hw}W>a:ڷ( +t ) ʙYv;V-)EY9Ok';SS[VǡlOEbxQ@ ]ɮ [1=[櫀sU5i Z|ν8/=Ǜ-f(nk5\W& 3 ]k7pr5h6 bm@RfoZ]v&4ɘW@ IfH?11])1@>&q?UoEc]@ E}kt#V Jlt }p:V֩HvM2fKja8h.۹?5=54>uk_JO)}(*#?S\ Ku] w. s1kb]rk-F}3K+ \T2(gZjYdj(=)gH#<d(t((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (3G,RHʸPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( * 1? (h(((((cU-i59(U%)(X ( ( ( )Eɪm/QT~ZA" UEPEPEPEPEPEPEPE ( (ؠ (4*(楠)ؠQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (E@ Wn\#k4gl7e*tʅPM^}ܠgxd=y3qe^I8i}F_Ҁ#SF f;k3ͬz h1mQMEP0(}62˼ڲ~ s@w?A\pP#LڶQmH:z+|PTߙ53m aր7mQG+( o!3\uFP1Hz M\ok(IzLiOUzEl:ߥsIs1]c;b/ƃ ʻ}JS v+3BmUnu 'TܯanY!DL&V7t>WD>!JZдj맠h-*VI/Lw7{n<(F٥aXd]+ل0>0lnx/!Gzm\z֟p6E TVLM SlF ZHMeN鮭fǍrj| 3j袊(_]-zWWmb(Sh3d=ax>4d+Wv6h]>b=)7<@4QE^8|z|o 7|P宭Ļp jV'gmS~3@ X |PVn#ܧ4ۻ .QYzP6ݤ<['D'R; (3^"1 T,SW*d hiCU~Yt%Nh/F>{qmʭnҸZ4U{xQU'HkyVUʜHÎnpVN7/(:pymkaWcq~1ص_eϝa垱@ -U[h<ƫUōǛU-օax?@P~5CwFK쓹 oJP|ړ jΝnꂬH@ Q.psSV^mYt, jPEPE1(7C@A;v 1Lw͊u5X}Q@Q@\"n-U~ q}^q*@ EPEPS"s T}ܫاj8k)W;/QEQEQEQEQEQEQEQE T/hšoǧs@TW]5lr7⻊()0Uӫ чg'PX)5-;@((((Wɶe 2ЬM.=JGEai6܂+bD (((((F8Vy @ZE|4bOD'(((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( 헱ƶV-ݴC a1s^ڹWIdSG|R\w r] OΕP ڽnjɪ-&֢,q#ڀ< _A[ks#W:tL_yWQj9E*o#bB|=7;jQ@+%\_uY.hfhcX7Q@AҖQ@2Q6 O9nY|գEQE!k?]vq\a-pwf:rH:PzP/ 7}9ub^Y4oi@'ko-Oi\ށjkFHc/V -zii=3 fS=p(G~c '\,8]:Pwl~蝢 QVTv1ۊ8ϧv/\ˮP}(Kqw}mtrȸ95kV2& ՋK&ݾYjW Կ?κz%r u#!t'^?m%(>fQx# G5X\Z(,,#2 bx>[@w&y8cgNƠW5{Y^AƵJxs~0|Nշz+,Lv=ZiO u |Q ܍s֢ w ;TDv\6q J yx?q^\ &fԬ(@ie/b,EWS}qj>UnQ >癤Хb9\}ջkF]hV &nZt_EG3 WW&Va Wm7MQ#@?5emfHj6HF>nx@-hxxcGBha mĞ sOWF ° h@ ӳq3cUwᏟ@Es UX|6itіO?q\O F2ZOG@ d e7Ol֤x=#Ih\~[= uWw I{A&@6};FX,_քt @.K5V_Ŷcu?& :oZ ɫ_ PUEP\W/vMp :ͻkƫϣ O# 33Ԋ, @:e]9 ;ԗsMAqH=*?ֺ3,,Qi٢)W9 +k?/c@V _oxg@VǍJu~mю2R@NO=*O]y:TMDOU4 snou{ q7Ԟ4l^#yl#66Z7+nkҟk-a6+>pvV{DD ɬ /'~Ҁ1nabvV5bJ>uZY"~m[sv˫7,K{@"[s\gGnP3[Z&?:B3h{% nI m뺘CvtҺ{->;xQU^ֺHgGPoZy-{"^ GU)>1 .f.,1& hY?6WVt0+:nqp; P2m%izKpkSщū;Gho=Z0Jl]i赚}dzc>#?\ķFuԏ?RU#^)¡õ[ ֏ M.4(43ųkx.;4_3,jKwB;KumuxWg@S\ nݦnp+3P"vWZsJr~6 v%x r3*lG݈/]/qᮃ]=q5C@Mu|El[KcQCe Oq0k7ʶGZ&ym]niZuQ}Mw usZCtz<q+w;jM-s-V?VJ vnۦ@+d zT r# Y١@˽t鿧Mմ% +Ieӵ~C6((W=NfԒ;] qzc?Ś,J?C>s\!v.uc-c?g,&3Fy2WbNE7Kn!R*j;"M5TKe(=k]ѱg6?\ռSyr-(ծ.dvJevmumrGƙ m .+I≑(y Nk ZF+ i_]eyK\g?ɚhw u Ev (8 YnEE "_uF<@3KtF|CwrdԅqIy{{t}j f-=TJ|0ֵ/:ռ3b3rMTELzksĿt k+_;q-B[N<{Ċ pj9L6fG/9 /QګxEva!-;@_9 8dKmIIZZ:U Fֈf}9 u1X^:] yA\P3uu26Ԥ1Z; u G7i tr>},6Y(= CϷMz+v<K@̋K[J0Oz߮OŜĸߘ#pPQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZ( LsKE4Ө ()h@cҞ-f݊Vhv(*\}jJm Pjz\̮kRmS~F8PҢy(-*%i}Mbxwjr]sŋ]^&~ Ɵ=+JR:3[@l4X7\訠#sWZ RN_MtP-6-bڢ٥[Z(^B9g<=31S@N,byIȧ@V-'}굪-@ (JW0vيEsWyH@K*3ں:(me^nPHay˺2ҟETӭŴ-j Mb퍬=rS@PX5ܜzx& h l;֕PH*G- h4{eWWUER0nx5i[7]=]&+_)P+>"jDk7Cx_[ϭ?7dm\j 1LqV 8QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (9K1@QEQEQER hhR((((((((=u ]((Sݤw rjQEQEQEQEQEQQ NU~(((() -Q@Q@{((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( %W*}kŊ˹LKݩ9ZU'ڊ oj V@zSt[!\#EҀ-V"8{I1eWG۽#yD}jٚIwAc.Sdf7th tR Z;ivTg}jrA*֩?٬\g.ϵtNh7-NT(W4*&Y~O@,g:F8s+g&((Wv3SPE!S#7C@QEU{7V* "@m==?دqO:@AiX)r/T d+5oZi4yq4_c]koYP[67%ۯ y2ڞfۦ fii4zr[ 4hg ~{],"Kjͷ/xgBֺҳlV @|C{K_v؆ջ9..Ӛ.7vqZݏ5´"T4F {PU>2Gs 9VZ} {VkXFj<.sj'JM ;LKys@ʗ}tZtS<[ţ UOM hDֻI ?-눫CL< g?.*; uflVvh/- Z}{|ֲo?hZoQod7袊VWup A֮WHn|;hr,o/P5iT#+OQ[f֬;z\:4IɁ]>ox6sǍ -مXiX31k&h۸ kŜn?V8YQ}kȖϗ&kҭ|Ŏ{# 2i߇ \2TLm8 ?6G9X-ce"u=s'ڰkCc[r}WivsZO"I Qbi@V gw\bf/h BU-);o\U(Xp:U Vnk6f<@ E)ܟ4id wm]6&([|cWEv3k(fkmI#wZI(nxfx,cO_ j_Z魢-°?o:۲Bx<YǤ?V'{D\[VY,y |G ѯj~էu5oGȰ=gZzԊ%<=&kK/~nH:?m ҒCz㧥cQm s\Mex/A ֖i32*ѡ1h?7j\qUԷDUFɿbNLd ʩYj[y3.٭on[Ǖq9}@ +Mԋy_+AƭGuiϧJN.;THGzVvfA\3ց Cckcy:?ZU{?i:ީX/a@N V -ZA pck 1fͫoPj(+<A髎׳gw]0N?ٮcol6ݻV e&;* 6m ?Ұm7^i+i5x0sPEc7jP M@V~7OIV2u HLk3LA/]X %P:KOܶ &i,5OI-׃y6uaDq?l|H'⁚ڣ줏?wl|ÕSZ^ڝy{n 9Hk 1LvGt u~fJQEW Ɏyi# GϞ#]V4K1gkMjQ@ #6:O*ljfj564h[P?o\G{Կ? ffm)[ lRxi3)a_l3'HWCZ -\LVf#MZ.߅M6AnO?"ľohKTc[ ڿs0<5%>UzU ؔ};WOe'k+2yڞY Ǖyej1[Y& Csf=RɴLmzP#_>[OͲO 5fcx;l.wCրEzCM M3SXk<~1}&h>ҧPf< ./m_35 [J4 ڴnծs-ttQEOVeqjG.?_ڀz]rV?hg G,y_\?5?tz?뉮gP9l4I2_ KվVj;ė >4_Y'g}6PwivV ⪺NMm B4 n47 G7Y1W嘬ǽw%1-u9ާg\5C_ԿFTkdoS@A-qoUxkh똠nc?s'c#PEP5c6?OQX4} v΅ gx ͵twҺ4 ͎볛Kh& s06>KU3C"C>1U|& F Ck tP^\?X7K+ Sj0-锪: U Vk]v5h OE:U:qU~!KϽ2 s0[Ch'<SgShz֝}H;&3#Y>P:M̓jWѫI%ɻ 1QgC֦yA]m\ش5COscշC+Zu!#E]4Bͺ -8[?U(u=CRx\tN_: ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( W.>QM_ o1K@Q@Q@&9-斊((:O#D TQ@ aL0KE# " = G%H ErZƖlD' Ջ{Y|ҺZ(;Z\r8koRVLjHd 7bS alAwu k*S*cnZc(;CӒ6T /<|h 5zewBx/5'(UGGoQ@і>?لEqc5Er4AqZbMx ĩqTNY!-?Bh'ƿo*k\??Txa_P~ѠEC_a ,R9szՍGNhO@żVӯ͛ʣѮ?U h"k|[8wjxo+K&.̖إi,oit.tqLx< D^%eqxUO#z~ _XA y3@g'*EV*@=Ւ T3Ff \wxFm?SOe4;:(Q@\H"qY{|CgQ.Q_ b Es:95ƁеGM(Q5̡:gִ'V}6_e&x:ͦ?ؠ(#ٮS-vxZh?-< YdO?Ѩ({9Aed;:u )q^<ΕXX%s(&-*4\Uo 5Sx?o-Cm]ĉ <:lmj7 5fok٨ۺkU?鵱*]Ìi |?PQ+"@ .b_"i 9_HeѠo(Bi>H ps\nViYq#5; G0tVn 7GAgn;SxB馷((Wvi?gsEexA7 _-GBy7h:]kȂ 4H Mb{m;zԓy2+P]gE* qnѷzlKĕ[ ڳAnj- T W>PAErK-̲?\5Tr[Es2w^[o|PQ@!U b춅 ol@ig@OzJӷcj^\^5~&Kve.jχo~gq@QE\ MKmt"TQ4&}-VH&7gY;C@[¿:ܻdRC긮;2uZԯ /e->i?6kJ7p:gw̋Pu4Q\=ŨY1tvRqꙠ W9kv"|Zd-d=['Qǟ Jآ;oT-^ 83ԓҴVg< [w<ם=jTSH#\v7+'UT3)j;.dr@V[G0"k9y/Q\fv;U3Pf]]oX6R۴9;yF 27bku4֢P{U )?밭?};RYL,6m L@UId5j *q,*l r(TS#\lS @ETs2NJ{ )> Me KS7a_hUu;asj}(m5oQNjOdXv2hS#pペq\iQQ lf AabjyaF#V(f@Q@RPEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (j )|Y{s^FEGJؿ*֡ &FO9 7Ji&#O[|Vn58>.K n-H]Ҷ!Y~-KP"vh Ƴ|SmMtF#4bX P3y>2vn2?lkI}sZ63eXQ0/r b=S#s[/kj>JF#\ch-jh:Es761i 1@ Ưfr _ (=ctPf kG@ _lRvTOcOm4Q[[1t땺zuRK]ҪhV <0⁛QEq,&VpHǢH֮jJ Z|In(+d6ۅS&uj5i)kKd~4]UXNO5;#M6\UZѠaEP\ozZk5.eA/k#JO?Ki9鶴m/SiMZn|EdXwi+E nk[ۈY( 8\f7xVJӬgnYx@_Ϊ;@}Ml][I%smٌ8ۚTU>Sw37ȸ r99tdgtv?j_dۨdc5rCPUOTҬ&U 0Z:GGYG:yxx6ݗqls@f7jŁ.YZ)%|*lj@ %թm:i |A?]N!ɣbxj[ed<34E nq5]l'1!f?Y0][ >8Mq lA=뮵M?)%Ea>Kcp +K*|=I4r(fWu(<-ugW?8 V c۷PWcEY{3skvxOF _ux~ mYd2irZVoYZ>4gˌYtN%r xU?Kyj3.'>Fk74 t+ \:OLI~x냂⾛Obdzͳ?+dTkhO@g@;KT>ϧ+l|bB?kUa-nTM\dY]1rK0H 0̻ozUnWv>LU=Sq)qvqFĶe27"mVH-Vg+EAy͏hܥՍyw?kmL?U6ґ4h]j[r5_I0Qx*磋zv:hF8\N̺|?'+tɪ3l\?jㇴ9_ |9oi˞s~9A@=pW#y# A]en+cJo)|(h}*/J=H ?v0ݿOV/ճI~ {.e2' Ok(Fi<ħ%o@^n <ȶfo/?%r,٨u6 T>9 ?ۭHܫ~k+?#> mexA tW=vzݵS5wy^Q?mұ|'74 *K3KY|",)1ʝmKm2F(c_ TDre[ޫB?l B3/ex=uxZ/?rƢ?κiѶ嘮k+v(O7v)ueZy[x뱚@3-r &-N5't njJuH3j!/j ?+eG!싺+qqe^Of^EBڀ (wj~S\KjMs@KjUq&wNjo OQۊOIqI>ϥD3V(U_d=!ע{Fk^*[_ti<W?M2s.u>|}*߂\Տg0?y(B2UM;F"l2Z(1FQ^ֹxq#!?Pxi=ӚOˎk?_[ B/ <3%mxS@VCY 7]a](>A?ҹ?ۉ=<Ε\DŽW9?K]fXWMSxBoֵdzwQE3eA8 J:DrkEj<hm7zU3sUj ~g r2#Ak'[?0YZab|9!Hgkp{]Ԇ<[hM7d? ?rtWOy @m ͦWkF<8PJ 9O +>ӧG%hE\,3acj),G J ׯbⒻ3@>=VTp6TQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (˜S ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( Fŷ5Egfӣ ((((((((((((((((((((((uPt8+F(( O ƥ()dR@ %PPW?v#D :TgLV(d[ tv|+QH^KHE]"1m ݺNᚳEG *լsQ@[Bb9 %sVD(nmo3VhF T7V7ZEUH U(( WaaxPP&sSQ@VĪԶqB5v{l x ZtPya naѢ uN8&V+<%f!Iwb(QlyiQ@!U7ǭ_(٥ڍݪZLb^\VCNKUEEi÷ZԢ14*;iC(R@}+G &=P"ؾOT'JӢ(i-u*k@du?ÊX =OZբ1 8\gP6^S~uEB8,=)4%'ҷ SaY4V)+EQEGQKW xdae;n7+ɟjal#ֳ67^ea4Lq3@ Vr.D^Zv*]aEP=[A?ū {Ju]G!@ c5?[Х|=dI+ _S]M[@YȗȲzY;ń& ƩxF};_]Y: Z=sZ~( KNhKL#8STW'8~ǫZΜeIn04G?[c%Y~ ?5ELjttG\zU_yo Bֆb[)X>a}R\{DhL1 ZJrWq 3W/9 WVgXIur %LA+IR8KWPQ@Q@ .#뺯> |Ws]Dq̽?zT iӧDUszYv+ߣU}jm >M/dS("Vǥ[n5<48 ¿6ڼ"7U {[5f_%峡=u:73 W,_x>cMr?lh|s6X)#,=NEdxsO3l8Z}q7+ ʵPq@QE]KC! |Xnkmi5~ts~_֜cP?ޟGZ+I~η5ƷU nQ$:)#[yTs?Rբ~v;j=#glPEEa;m=TԮf1;alPOETid%QkIFGjhQbI@ÚlDH, q.;lrI-Wwr[hMqf0@W=ky%x[WK-ޢjW" }N1T/&+fq@\HsYnݨTRdm(ˆL(OkgV·b<Ns@Y"sQX_H6mTU;lb\ME )Уz4((7")>UmN=ri8Hmnͩ\u +;X, f܊Nq@+/]gITњԬw'&J ƭjr㩠 +QԼBִˑuj Eg-WqE \pj1Hr\Tލ;<0B?r9 Nu;rvSX %jW~mۆG)Z忳]ƴn5@A z*MITM;5gj>>VK)ZX@ Ee5T!ozK[ P]d gګw fTPǩ\b/ jG"n w80b\tVH=D9\lǰY-~ݵZYz(*@(~NW&4V\<֯ZʳB MMEPlkXsV"}@U;HOZfx[~()I VfsOnb>c½u 7 MNIhApgJU25NkKuQO[)YDW68@h(((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ((kVjxd_(͛l>٧m@ ŠJntNX' cEqW[ 86DZP?JT<Ƚ9lRvފ.@_Vi|ۅnKG7⛤Ht^ycBeCH?/JuKaF(bOh|Kuq]ۤ'Zc 4/S5,+.ykMrj:?.Tp6*J( iW_??WMu06qĨ^ݧ\bn(&zJj(Y B56v沍G+F(O 7 xDĒ ƶ /gf:5rFW@̭}~Y?5qbjB%B'a _CY&N]=.5 ^0ˤnh=+ \WDwE,s@]ӜrMs礕X[-[Tbuk ڹm-dVV;WnJ҅q >xc:1[Do!ND!X㚞G9ր4((nB3?u;sW~,M ]ݩ%T6>MM+h{v9]J3z[n]qc268xq@|9 K_Yu fhs_Ҵ߳U44rh;Q,Ib֏> M.y7 k[m2weh[S t1qX~(Mx:KCp sN<˨/Ҁ/@w?Ϋ;@pMk<; GⰬ4ǁD)=(FGx^: NQ>bih6 EYZ5u>_ZI&YL.b֑- aX*4Uwhjv<0*g5fLзNq]nק=A9\mŵ(Q@q+n^D\&6?3V" U6s9kkF-53pVi4tWWköih@Q@u?&k u]kC=.+ Y Tf:6\JtT ZѭN*٢Dm(uŔ<]o&6cǍv1W[s kZqdhlѕ e/ǽtD s𭤖.jiϴ@ܨu0@ 5bsvգ?o fw ?롭 jmyU<+c樼WhӬ'Tj}RKq?]pgӝ6*7?{"ŧ}G!5{sZKZ"-Om( 3s!ܾh=%[Z#S|=fmz6袊+=kX}a(4Hd'q\͝@E5iq]P( |XVk7j.Lf.sjui=BqUf["4ݤC:p۠cjƓdVdT^/X%/|cGBcOV gLqx_Kav+UOw?v2U%DWnhcU88!g#hxgvCT*toO_>!u5Y]BEp?,p X5gLˎշz2!ǎ[:Hծ=)bJР(O@;W{q]D_U5ΧNd[ڀ9wz5%+[vTsJzK G6|a [email protected] ֟vJ٢(֥c>@| ƩxgYӾ֮xTG45OM?؏@ M@'yjoK?*| :ɧkO־{8]3\֧j?+|.x=mt_r_\ P=?4X~!?Tn( ˧_ "9*wXJzq s\Z ٿ빫ڭf˃fAWZ.ӕ 5s>hhmbQT,Vy٬}XAh+Z 'Qց 7 VT=+Ŀ3]u܂;W(lZ]D器=Kw0Ps5^)Rk L[Mxml*ֵ OS©Oj4f݂3'KXobl[zl#y: 34QEW- oq/F^ 0EB ,Ik+ĖH#o\s8o8 [W ٫^ 듴\}裭9/[^&&\;G_@ *9>G wP3((@uKĿ ~]@ e:QoT]tZM[]<ukȇLO\#2ֹqmff˾H9Vg 3<-˚5/#}(Q[ Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (+³Uk 0f ([W( ( ( ( ( ( (-:(((((((((((((((((((((((((((((((((((((((((((((zZ uS]w. fǨBv[c bvv h--PEPEPEPb( 斊CҹM5|K:}][ 'AE-P(:KE!5V*Z(((7.*Dlb*YG3SQ@dz(R@Q@C,+'Q"Mkd-Q@4ųH!qV( ZObъEEq23L(X)ly{}P;kH|⥻gk P8-#@EKm Tb)5fMjbAŬ>a@㊪mܬUwΘa hGEN.W 3W( *f65= 5@EQEB&y뎵~ΎqWnR)P Йwb-Bx ӣ7|իqqnal-صY7~w9ZԢ ( (2otq#fS()kqRPjEVɷU+}=c3ֵwf%{vݴ洨((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (*(&Ywm96 s~Sw]h(((((0IOܩPQOmO%;f ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (!i뙮g.tן7s5=n.r붱ር["VBkh]. ˟h7w q? vgU oi /|!u)d!l kcULiWy dVnsܟdhcwquΡ5vK-Dw 1lT 2jqeP#>a0Ӽ݊7wCҩy? I? (ϯ]ΖF#WY/t3wu55y-C9 ]]+OŖ~@Q_gH^;)fhwsڱO*ssϳ]U;'_75 E^o :uYERIـY { ^eLnRGEe4ox\t5X-^{ V ( ( ( ( ( ( ( ( (@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (+_Ǥs58^9|IEs>%swmrR<:tnݚhsP61Vnc%n!k9[invZ֗;ģ?k@ S xi-f^vꨠnYQ ?uU| 8-ӭuP!~yȮK܌pj-r>975u2{R@ VbS_?6h9 "m;XiʹC HeheoSlu0O)f9=: #iZz6um@ JZ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())h((((((((((((((-PEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( )QK@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( c E>((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZJZ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (w(((((((((((((Z( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (1Qxezht4QU ;3·cyt]E۷tF__0sf9K]RFq敮ʹ=N5Pb9G1(J+Td!!OZ. @䷐'R{TCQUQ%E-Q@Q@Q@eI|Wk5H^ ?&* )ͫݢ((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (2|O K+\B]Pv %b3BNkOie?w 6 EdHrL 9_sF[kAg5cŐi!^@A=q9G7 ܸ pר OizN exqϭ)>S@S<_s譿J?{8/0K!|c.koq]?Iu.VOs,1<.hI+VEekցfx@_֝PҮT3@ ?)/r2jO -oER~РGG a^Ҽj @xעD NҼ¿ hWY[*6џZ([M'=*PՏ*ѴsPi CV@thEn2k'/ үO<=n['ׇ٨SZ~mf?ZZ[{{W+v~)%=3v5~wKfPY s pҨ0fW>/X= ڱ} ztIGDze\K, N ϸ^ ۷yQ%t_7~o4hw6>^+CG Z:mlmКO[G\Un!N wuEEninS6 JլO ƶV nfܮ/-ϵng' znzgn9_¸ }O LݴcM\B-|2! )^ڴǨ8jv|UQErr q6 l;DQn5V-y =(D g?E斀 l][ ߮wo7OK&o3H5I_ ._[8'殞}ls _L 'ۥ!s}MFONKbҙ("M^A5-(7>Y8_-CҦlW9eҊuuikvUQ Y*2qW8e|uA@]VK9}%oɜn#o;4ߴʳ)->%HH}Q[Z2]ƻE9Phh+Uܖ!^z[z >_ÚKpuYǤ?W x|m;Cw7PޤBdWݎՑ>|[{C]@-༶qP?kKdJٯJ:sOo}Xtى;__hx@_7N<-)4vEg}r D.wZzbKĜPZy3U.ӣd Iⱏ^ܠ :I{-Vu;mo7R덻6b'v~|]\w9}OgG4\p٬}6cƀ34ky =Zui N-ZzZ{=s@Et*֛?d:+-#s5}pOhdk )P[ߕ~(=꧆ga"LuZ_q !htn˅rXD'NM5x!}z|ncjH^}5=MA٣MS4xd:m1ځڇx6K"zgL'SB*~t KHq֭hwطL?+~%Ȁ,zU+ 1}+N}Tjar.m|Ŭ[lwYֻ}n;qys]j*990Uinw1ίDzcb3>I Koz[ C̽66Tg4G|NX tLYZ¥O9E^ m:4l˚FĞTEa \wc /E/B2ɮts~5?jܔrhjK:mu~C ᑍsY7&䂀6+sVd % sCKxC"N>hgN\ZA aG%6} b?ld Mer3*W~%Ǩ P "~K-6y\V5{_ cu;j\\CZgÿ4j /@ >r媋jjԮYor[:UПL!T 5vM՜M 5rwgP_u("ƳPUVxz I.\ӭ5G tjޣ4d+_E@Wa=q34wm;~yʇϭjW/-ݨ_/lސt*B(*\,T0ޣʩOj.8p+n?.X&S Owv8V8H-\uǚ/@%m8Dr^ CWbxE=!^BiV^g=0sA&C99 YHgri cc'Xjr j㌊'EbqT#UIͽejhL@T~ޫx zUWV?~lpv@y2r]@ T *h:V'm1sR^;I5UHxlZQ@bxKۢ3h#+T#f(=͗ΓbBx:(&2CΙʯ1~ttPN%pIU5%ݩۻ6 exN [ GzC!:nNéJBRmQ@ ާj@695/ 5.0CbhW! kMhJ G?lNҶ-ySP/YjiyZB| !:V) ԭc @ rZTʱՏ FɥyN]MknyRuP?N"hGL uEq9Yv WnlWf4 A _ҹo0Ef-@ Vo?#~ՠyBczؤ7 V-V XM U(|Lfm!r?uLgm?Zuq>HmF\JV]DӞiҀ9 FO [1W %c)N EPs q~ Rv=f@wgy T今=|=oHN!f9 ڷ+}8W+^&l椶a (bx< EM Ƶn Y~Y1@EW 58%r3ڹ}>V0mb<'ȍ:ZIEG鰢p}@:10+ܣ;x]EPɸ-Mojh1uqV0z HҢ1C>z9@s GT´,6O~jn(Rό\5ct[iN%7sJ[l?O[sU+ 68=*C<)wn]E C!Ћt/iIlxwZߠg=AbE5TSMTԴ%՝+OKNG@f*}ǚ|[email protected]@}3&->oڳQV'zޡl.f}{<ÏJA ZM4fwF]C멂xZzt҂y fR=f TgY/ ?*ڹ9|b Jڭ[Z.-x~<ӊѶEA@-V[yOr>+k,\*RO)fvE4QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZCҀAҖ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( c =P((((((((((((((((((((((((<ȊQlV՛i<֝QEQEQEQEQESP[tTPE翭^((((((((((((((((((((((((((((((((((((((((*Ԇ6^*6Eܸ[&jZE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( * I4QEQIM.M>U7)55QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQH"-" Z(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( +OoҬXIsoɏtW!k?l˯7T6۶&: +@ύZ&ET4Epz ^EtWAC,6RP7jRܿ-3ɩކ9֖t~unEb]Y () JuC@FhAure/@iӸl(#Ot5?nw +K4շֶt'+ȵf]~sg/gp֢((((((((((4PEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( (@ EPEPEPEPEPEPEPEPEPEPEP#o Һ' -jy&ր1\Lv_Pi&IVH<sY> :l}/ o4mWG4{4։G0 ?ֺ\^eV [5KҀ9 cQ{-oeqWn Xth\f]= mq)o*m*p>:Ԭ-C1~T֚O6c_E ZN[WMc!JtWu|#и 1c&A}7 4 nlfg8Oj_jc 0-GYPiVy۞ RYUT q[ ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ))h(((((((((((g/,TPEPEPEPEPEPiԔQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (E-QEQEQEQEQEQEQEQEQEQEQEQEQEh(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZC@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ]}La(z!u{PEPE y"HkH:REPXV@i@ Er> 3UttIe*z[t(ު(QEQEQEW kw-7[D۔E<;W'+tt(M@Q@Q@ 20i|2>3g&7() -%-OUWkBuCbQ@Q@Q@Q@lN(((M1-&1W,u/ր'(((((((.WBk?@7q j( ( ( ( ( ( ( ( ( (E!H j( ( ( (ț< 袊QY?;&4h((((((((((IU(J(H 3,q8 (ܠӨ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( 5[\º f_.վ_βVUh@ .>ͪ{R"!x5M1^2grcd׳̃Z",&?Ҁ+wc:/*͙g[^Z*{tM ͺs@QE;kvj FS#o+xdrO+Xp٫k4*z¸k-C[-QETc3Pn.sJ;p\cFQ@7,5ew pVzُt/b嘠B[],m3R}դAl4NJfo=dLM Na]m5@7Í1z]^wK#\?1k^H2tV)Oq:}] 1%er] ?'v4(@s}E/MxT mEf"7FWqZk8j.t=:{wt~n_?j> ?S@(* AzV}@>+*O j]<+.(@\u-Uf }N- ѓ<?Ҁ4Gۖ'R5cMohW?/Z[;6?tNkVQH&HsU H51R_V6|f, Էj[!!Yv ItGRRyDp5:>\~uQ)P5#0M'N*}6.mA|ctm>xs@dF[<֮rPZ͂E[aex{(9Gcڳ%Q88[X +Fy{vO+b or蹬 sNLBuhEǗ[cֱ|o .Bt뤺\^<= vU{ U?:XPm.sKu2'suh{15yB {Tvs,JUF< ƀ:9IT[\.#ja7%X,qXUM)ݚÿsܷ?(b9hjX 'dsO%n7v Q2?vUISkwxÞ fm#@QH*E3x6G秛w5ig7i?, FPeP2\z+D>}@ R5%p֬#v ]QUu)e,@H:(Xt>;+ r" ({ė- Яn[\uTU oiH{^+.1EҀ;*+Μ ^}@W+\?@[ f*0ElJ"?Zt2ip9 r.{#܄W=Ń Ya7i @O˳7kmBqfFhK{P#b/"8Xsn╯'iڪ6Z[գj\0~sv*nc8 z+kbY2X_W[>qqk6Yw[ٴϗNMؠ -2spYѬ_ ^VUlTGinO@V۱ڮbhQEQETԤ0;.hYjR\Kriׇ)c6U30Ԛ5<7 Erp|9} EgHO>z+⣞>H }(Rnfð i( OEc}~G?U/uHgwz(KqI%an@ɠЯF*r- 8Ov | q\׃di&sȫ:d*1ex?쨬mBe[ u%bEQ@ OsY{̥vhQES%ϖo5n+᫉&/UvhxfhbX mn~ z-D ?k<]3"5h:uиF6*/ Zܢicq z{u{Uc8UΩ"z٢wf?2#ր5+Wiơn#Z}G#b\ p-@R U-T+I]dn^:E(sԮ(+ B;zO6 kڕ[uVSoM%RDzګE~D~R}hRd2ǰnq@tT6W j("{+5/3֮H"s PVtwѵKbaGq.4Ee1C&kFF;}Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (99h_gʆ8PuٯSZMf̌]x'4\٥tOoml]5W2EnJ(O6]"~įJ|Ǩ9n+ (9K'\~˄PPX:y3vQ@Q@Q@Q@Q@ ? ̹? ֣jJ"ڜ⥻Zumkcž{ :|'&v I@ .0/Sxq9vا:vfҤ3 UDY"N(ġI{] -]G'hQ[uT>٤\-sZf y~sA}B'moE QC@5(Lx:mKi3yO= 6Jk/ҁ v̒|Ś]vآnNsQZLm<(^Zn#}UOY Tg Fqmg5 "ij֯q GI/'pǭPД'.vS]rVZlk2w~P)=R]YF%mֱαۅꯡq!#CW"FYf܍"Y~jC28&1@|'!:#3D?ҳ;?ޖ x?kmb OO rZ'T +#aZEur:V'ZGذ)-'?."h@ Ty?oҹ{KtC*; U֥Vx>-0]]_Crڷ+v:P+A+yݡBҰ|_t5\e[Pܺa]rUΗ*ү|Sa;?\axn O((5 [ q*Cox=v-B7zP%MSҏ^;?ܸLcUڡӌMV%i < Hs\ \jlSGO ^X+U5jSls͞4٠b73 ➴y axbmßjƀ)x~Yp̵>o5q ml5f3 Q& d# OQiZM|ɂ 4vq3Zp*< t{HEo\;IɷvmuZO\#v Mz9nyxg5y_5anI|Ig'x5dx&!MMR"b< jj#U75HW&q,QYGSZ.VOmtTQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( Nh(((((((((((((((((dI!oYAt͂TVZ )Or{՚((((((((((((((((((((((+8۶+QEQEQEQEQEQEQEQE"?]xky}kREPEPEPS<|((("( Cȥ.g Պ(.5pX:OfZup6Uh, T< 2)hR^ Sfd Y#WMTP6jF|jA* /P |qNHb-JKHD(EQE6EܤQɸ-_+gh6%lQ@y+yxҪ >,Ң#q W" |jT 45/9 c;zV{l xfoh8P%P=?>>{VB(¨T9fG5E4 .+-ZS5U -(ŤK*12. * u?ZQ@54 0t:+gܢh װ-a[5S nN=+Rƪ; (:]U(J C5wCާ(鶋jVV^l3TmڡUPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((KI@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ()(h((е,jճnPPQE!⡂U89Ci-EPW.RHn.fcHjEPEPEPEPEPEPEPEPEPEPEPIKI@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (ݠ ;gu<Swzf;Tn~˧yAik[+a4yk} LsiKxt"9[˹,7|Z1?ܠBsTqhNk{@=ri9]} 3!LWA[l _]-z\8 ^wҶimfmmfx{F}CuN!v=9+u;aNh@"ػ^k8~0ǷF&x-͊{> * -?밭+Ah,:@Z\皥/i,.?o3_O(SPeyۀ= Gc0չ#O\ZG f i?G@Q@Q@Q@Q@Q@Q@Q@Q@Q@'zZC@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (9sJ< GckJꨠ PmZ#qXtk2x=/۵͟ޭ( gR] x( ?E[43FSl@ k,:]~uX9]9C3֫IׄvGQyk91+ a1Wh _ZVtT)Ѣ9=ܯگݳAۻl@ZڤcVӛ۟0qܢ ( ( ( ( ( ( ( ( ( JZJZ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZJZ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( CKHhh(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( (?:((((((((((((((((((((((((((((((((((((4ր EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ))h(((((((((((((@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ))h(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (-QEQEQEQEQEQEQEQEQEQEQEQEQE((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((JZ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (JZ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((4QEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( CKM4( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?)JZ((((((((((((((((((((((((((((((((((((((((() -#PEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZC@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEZ+"M@y5o <-QR0(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZJZ( ( ( ( ( ( ( ( *)M՛k4עt(((((((+?RKSo )rS((((5>(apZp9ʹhj))h((( ( (}4-m@Q@bV:L["ZCk"x jWt⨁}袊̠(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZ(((((((((}W ^Kݮ'?=֯VؓҤellJ*,P.E67 ҹAu塋JwW:Tb:|3ln v٧W^F XIy6PZ@Wek|Zg/ \Onyۜ)v6gOᏏWmH%tnV^wm+=vβeG#=h vO=zg8j6itc>h&Ԇ}꧋⺴g@ ( ꡨ}N2*hYcP ,z fw ހ:j+dc,̴c'((?ZKϟkՕZ^:qI,"wUemdj.~զFރ~ѨEm|8?7 )]۫N"B?lxo/I!Vn u:ێ%Llf5@cU03ǘ2/ Jɼ"?m &(W!~ WU\?Λ jΟ 0%4cK=Q鶯cݵ7Wk!ڌ}bxuw'(v) {|*noŞgkwv*zCrI-~bG5aWO+WRmi%ڬmyMC h𫞾u7Le5?u1ްj;qX:餹\\H}% +s1;jM]݊(עij<;HpXkfQe0@A %a@X^I>*vqdv@ꖧq{m{bOi9 fYo lVR0Vc헠J!yaXMs|G~ =t)PM1<lb8Bk:~J ۚ+[@DjKw%y+3ƱwC*֢.42:mBH*bxZ=X((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (/vBYcܻO %밭#*Q떟l1m&HEwQҀ3&:: =j!X 0Z-14jS=V w@?j}] hY9cxMeM42NJXT|T<[,K帗{UZ] g[tqR1 ?5A\@RN3]NkxNNKwsRz68Rk״6ό梳FY8ҀBڶtbB*k6\Weŭ_lr1իojѓFi5F>\P#7ƿkO+W'ksIf( X# ՜ Go#t o :T=i['VMݬksݺ!maqk m\V~{D>kwG d# ѮgPQ{WMEahFݢ6< ʍds;H'Q+.0'Hn_|۪V;#Go#OCtQCsO P3B81c%M֪_ |r?ӬֻX?ԧ V5 v /t4Zs䄠 W9&wQ5\kg#POA U4iGaF օ~UI育^vs[V_frحJg,~@~,?eXZH Sj?2ِ@O VZuyU>פ>J,gXgni֦|r I!cIw*8NwT4D dt: Urjw-C}QD~*u6BמLd-oֆbgbu55o-lZ?jn-ɜiC WMKY\K' [֨j nQX\]2|l-zZqZ?w^/ ^MeZɷɑs(OEgݒsY:6A[zTw'FjRL-Ϧt.둬j :@ gj8Z~o+3Ran}1Z2RH4Qo+֓MmHt~opDnߴ (/ nj ڷ/3xGkb9<[]}r>&èz;]Ikghnjm\ޓOy۠9tۧ[d+;Ŷ}0[5Sú}csGU XjY*( qN4}UM9oުNgNVޙ?(fV~x?QˋqMҭ9 N%-#7-W{Nrhab}vOEasW4TrzG@boUW+ؼRՈP's# ʺ?Y\ \ l92q\ơfSGp5cБ]9=_kY+FccOZ_wnzѢ((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (2@ Fw-V4:p0Ʒh((((((((((((((()q>kVF*PEPEPEPE#t+ -zqBdה1M+ M{u? ۹56=1U4siuO/|՝H_R hr GpjĹ=ʹg~"H}VlFHk\~VCun>+2mm(Fc-̓Ҥ v@ycҤKEW0&jqKED=)E:CҪ=*-PT6vWh ByV;R@cK01N sn@Hr*V|1 (62)h ?c߷]QKECs )DjQ@RKT{ŘE\ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (!8ԣUԿEVڊiԮ?5&m(-5NLH*-] c]LFX~QON)?(>NzԺV7 NJUշCE/4D֗z>k?jQPQ ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (1Ѐ˲/}H+U} ZDn-QXs7̫=t&:gc[gP~=WdJT.%jjVJ[f3vqm!> ~J)A#[F\Y))(fYrERQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (EQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQMceÈ,k ѐ QbDnPԺ?ۭҳ5/ Q-5 (}Wokqed5GH{O._ASQEs53ScX VZm>Z?fro0y=Z]egQX* ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( % i!+"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (=( *gY/T?*ݚyO5H""*T%w8Rkɽr1/aMmP+Z koFt?eOeJZdSs NRڬ Zeu(D'Ԯ7sNc"cn! Z~*G5zwRWEo~7Y릏/ҮȘn{|goj$$ ^Y^ ܳ zݪ D՚SG*FQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( +*bY9+HĖΖYU:λoUM%{F;jK3o> ;+?+l%V/ RQ[I]/.kekh윳a5^ ֫S/A\( T+Pܰ͊oUmQm\:wVuKeϏ};SѭZt zfxIPiCQά* @Ťժ# TCEKb&Դ _+!}*t&9\':ҵuwj GyaKEe&ZAYڧDy ?:{{#lMj=m^W^ { [3L" ssZHWuu=gI4a6Q}箾 Ky-ztK}E nt7DkL˨?R9<l(?٩)* XFF+Z DYmk+J{FD :{-jT-jV}̰懺s,(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?v^scd+ժ+Xdֱ *j( ( ˿?J%kJ[=cus~JjAOzZiS7e LlۮE]zj&2N WF'0 s7ͫI5jV3q+=*_{ ޒJ:WjڬZ3QAT4Q/OkEq ֑EYz<>{ά|{o|֏rV-wV21ڔ]W3F 7-U<.ؖxF *ϨgxfO·23ꎖL &W?sD4%nEoQO,-b +v>)gSH:REPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEE>vxP{VN r=*ċ!UajeqtJ5i+Q9d tvS}5J$(>_֦͐Ov K65\ KKgQg| Esw 0̾Xl,Zg#?Uӟ .Q^Seu˽04DGR _FQ6iX@\l{PkEM:{j}Kvux*Z; A>dد2[~Y mGK ; {ugC)h Tcډ7 #3Z6*e /mE ёξlS' O"*)/N;p**zWv9'vqI+E&zֽ.CV뺭QEf ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZ((((((((((((((((((((((((((((((((((((((m3z uÑ _z'l\ [ %_jB;QR0(_?.wmZ 35LmG>쵰V_n-i9F=^/ {2O Í87VPfbSa O zP|[Cj6V!ut=H{<:1ZՉzwr-e? ٧}̐y xz%c#V-S|\ jɹ-b4}|/nOYZqnVd7jދY*C5=i :=]Clj=4%c[kt3azgGL闠y6dY:aiϪzF ^@=wVcw8u VR k*eu,((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZJZ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ?>VgZ&] ((()lLٮ6Mox]{?TV_ :jZdg(>5 k ݮBڸ9<뫉taU;;/S[N/j=R_*Տc: _3 {W3!zҶ"L6z#9IѪ )=?*vZ 2e~uLSGoU.zV:K̟Z՜'vڧIn)5=wῈCQ"UҢnP֦lY~[P 7Zwxj3O\fdI1E(&ڊ oVg%H)5_~j穭9=oQE2# EPE5iQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (f EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPU.*exZl/f!יxZo#[LL!r'?|U xpsRW1OS]=k5T5QK.E%5:*Lo=ijוD:܈z 'o-.gz߲^T$}6RfV JoTJKmQ1Wk#I;&ZL!c#k}j- AkQi5omm+G/R~SG@=Aq\?vr8 ̺j1B }{4浩 [L SJϧLmrd ij)Z3 XNf'mk º%dur)\eUɞمd8Ȯxj덕T1yyUKmi&iĚuͶ\"R_:c1S%-GY̅ڧ$_+ڵ4<9jrH(_E҆#jW%ndc]żcN Aq =+SG̰ŧl9TQz(sBˏJk ?߫ۧk7lZkV!F/5XRݟcdG?jEأ TU?CZ4W:f/I ?QESwaAv r}+Q4}so{x=M;vZ}Zg7enQWa\mKtZ5,ը2/5ehpgVι +LF})_:k+eì735>$a]>O5_ቕ=j=8j1hI+CڦAݎn|&?JF'7:z8O_J Q\\߈9~%jևƈ<9$LU-]7ؓ-]SdLn#$>+:=>5|J+]ikJ=5 L?خ_Zt ?-}I̟V2ֲ:g\$/'sKo \e +Sß5o¹I?4/^ - WJ sUW CrZ( ,>4'1!dUmPf_. 2=*]KtQE@(((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (f=R fD p&=rPį_"wR2mZXE <9 5i˰ U'$&v[IQQxZQx+Evyź[ҏ ֶُ| tX/(% U:QE_ \.l?鐨(oG5Xݴ H%ҹNQhiQ:O=vvsLV=[u6IC䴀ֲّķ*$$b5J[K ^[cmG5xgY ijԮ^=;<!:?lUcEb1\4ԫdT}55Z9s Bεڽŏ_ 6D/Gڽ\Yh]+n-5ȯ~4; -fVdx~nm؎>jפ33?Fdfkn뙮6v^"Xt/]MeP{|7p.; h-CV q*O# eb?ٟJ(=)Z 5/ ܫTɆbqeԮ){kϯ\8"2:\vT}j}GSo-J6LS{ tSe -6 pׇ3^J Nc,;1ڣ1eZ:B)|cO+ ʺ[ӊ浉Z{:q]'b߭+|e_ ƵcM U_&f,m+A| +mRL4Y}y*uݦ=3S)w Z;۩J?٧HR{ňL(i jMt1ae5]ַ.U-aaOs"A ey# 3i Z=sR\>xvԼ@s]&qK8l/W/y&"*ޟ.X:jy{kn3Hio+[AGh5W(żuV;-o |7k =k;v?ʸ]۽p *rH?=I2QH O ~ t>fk6@:WKYb]pmY=k7B(v7u." CO1ϹE:N}=\yZ2kJFRC ]VAVk ((+\Az5o]BqWMșlr1\r}QK*@鞵G1&OqVt1UџҔHVmj ]=wr. "ұ+E% j bףT"NɊHe^M%sF~*#-h\ yQz1*e85&1*MGH{4g{ի_w#hȰ(((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (2k/A/E#r dhv_ekMlQ@r^h %-= YU[(_s*U +1|7 a8 _HqvfŸBxWķ3[C@ E}lùiy Jy VT*}<}o|6kc b.GO%˳wzS7V\ahY S=ߛ zߚzh#5Z"A=)>Dvs]]BE?rViک5Q@ ?Vht卆1[TP ʧDu:/chQ@~(]ڽ7{Jj 33Mn#KQbVN;W?k1]}bhqq K1K0eWgEq~-fgv,&2H*JH)3sbJߤ(sΝ 7LWRPnn/,{W :Oze%s!Pds -/WS h101\?v:dWSq@څ*Lxo,~o)zP; ss?tQ@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@Q@rw'wY\kjB* }QXekU<~dv#kRlM ((({l/5ϥ61ֺ+HNĴqɤtzuJE!"'7tTm QC]%|BOjͲRn#|Z1ERX:\xåF E °P rN@1}kJ="pVGGZy͜? _"QXQ@Q@zW6 Wm69[ wBL+>?R{uhi۬klҟQEdXQEU=Pf_\n_it)l_ 5j+\G) 5 ̳=8quj-_EE7-םWEH=YsXʳqfG}BzWUk J^,8"j((RMQLئpWtOi?kߍz'fw~iE!Iިq;'vykHB˺̛-H"=ޱm ToᮠtlL5w(k U|.sX[|2L3' YE/WV,GUY> t"li1 +a髞x~>CY?3YLgKETYxpwynW!xⷴI|Oo]L4QEru/)&Zu)ỏ6 [r3:z(4 ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (REQEQEQEQEQEQEQEQEQEQEQEQE(Iݨ;~BsIE!\Y:_+4ei崽ʑK {x Q@ 5ɆZzژگQ@ Dz'.u:e?:EssKsZ}HuP5[,˻5kWU;Y{l:AVhF'wj6oZȞ昬ѣvJ}POע,\{M6XuPKȾegt[lÑ=k9OFJ+WX#E LV>e,ZԷ 6k9y h5Y"7d\8.X/ tYTyQ@5i,eGLU & Śޤ< &/ ?ݴA6 k ͿⰕ + lDzCێk C|;r3ֻ*(uWAm*DK&+R/mh0<PEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP\Bk ZƭzEՊLOYAER(Oknux kJ_"4oCyvѧg2 (f?O~M zҕwSQD"\ 袊Ȱ((#mO>渨N YZ:Z3اiz-X:((Bi7P"!8 jZȹj6@~0,$$Mh}?M6*L$*f1]B"q4QvS'J/Z_((Z+,j1'uC sj:b|5E 6٪yNnmX~/m+';nc\jpk퍛Vv EsSf)j-;:<&ѪMǖ;?yu$~\S4.p] #GڢV.5Q%wd+T-w 311Xgu2!wqJs4J# m'w{0ҳ4?$G MIk4ѻD;T{|ڝ@aI\ϵ,&n4;:+t ^_s7v"Bjsu9!Z0f'K[TΛ⧬ Hnm <:V"fQ4ޠ Uo&~'Sv7S mv7S0qv˴UH9%lHE#C [= V?{3AS͊+ϨƔrj+]V5 Fm w7rm\$mk dQttW;>.ݵ$zFRczFHv=M騮iu_Jgz~\SErnʳ8Rc:*+՝;OH3W'NSP@Jky#tc:Il%ld]I9;R/ JZ̠((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZJZ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (=(hV/asupҭ"ntT2 WSF}ju&]R4cNeqW{!U:F9:/VU|5ƚ,>Q\{ձX A2hF銮T6Ρ S4(홬os恥wʀՓTfeG#JTzVkdj_[ڋ %]]KkctǤb{ohu|V-W|6: ҷNPWC9u UMi 19zq#ŶFR?G.#g] Zb,x{1|,s_JМwr]b٦b[d s/>V 쩎RN P;Pr/+5ѱ 9N)DbF=){P<8X\֦xnCW|SGCϚԤ: g ]-/j>C'"Fֻ){P8{[MpvR9K=8oKmꨥ KDzi s#IenK9LЅ雱oIL9L ,2. ?0tE f}7J*)sLzO N92.7M kN9zXݩjW Ө]EQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( *8iosRPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( )( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( JZ(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( JZLs@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( CҖ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( );EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( AKEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQEQE( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( *)WqZ ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( jS((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (?( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( ( (@ EPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEPEP endstream endobj 4 0 obj 2480 endobj 5 0 obj 3437 endobj 6 0 obj 239810 endobj 7 0 obj <> stream q 594.72 0 0 824.40 0 0 cm /Im1 Do Q endstream endobj 8 0 obj << /Type /Page /Parent 2 0 R /Resources << /XObject <> /ProcSet [/PDF /ImageC] >> /MediaBox [0 0 594.72 824.40] /Contents [7 0 R] >> endobj 2 0 obj << /Type /Pages /Kids[ 8 0 R ] /Count 1 >> endobj 1 0 obj << /Type /Catalog /Pages 2 0 R >> endobj xref 0 9 0000000000 65535 f 0000240488 00000 n 0000240413 00000 n 0000000030 00000 n 0000240045 00000 n 0000240071 00000 n 0000240097 00000 n 0000240125 00000 n 0000240225 00000 n trailer << /Size 9 /Root 1 0 R >> startxref 240555 %%EOF
| 2019-01-17T13:02: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": 2, "mathjax_display_tex": 2, "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.896107017993927, "perplexity": 412.1656268495398}, "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-04/segments/1547583658981.19/warc/CC-MAIN-20190117123059-20190117145059-00394.warc.gz"}
|
http://www.conicet.gov.ar/new_scp/detalle.php?keywords=&id=42498&articulos=yes&detalles=yes&art_id=950837
|
MONTES ROJAS Gabriel Victorio
artículos
Título:
Robust misspecification tests for the Heckman's two-step estimator
Autor/es:
MONTES ROJAS, GABRIEL VICTORIO
Revista:
ECONOMETRIC REV.
Editorial:
TAYLOR & FRANCIS INC
Referencias:
Año: 2011 vol. 30 p. 1 - 1
ISSN:
0747-4938
Resumen:
This paper constructs and evaluates LM and Neyman's $C(\alpha)$ tests based on bivariate Edgeworth series expansions for the consistency of the Heckman's two-step estimator in sample selection models, that is, for marginal normality and linearity of the conditional expectation of the error terms. The proposed tests are robust to local misspecification in nuisance distributional parameters. Monte Carlo results show that testing marginal normality and linearity of the conditional expectations separately have a better size performance than testing bivariate normality. Moreover, the robust variants of the tests have better empirical size than non-robust tests, which determines that these tests can be successfully applied to detect specific departures from the null model of bivariate normality. Finally, the tests are applied to women's labor supply data.
| 2018-04-23T07:53: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": 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.352755606174469, "perplexity": 1949.8438168196028}, "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/1524125945855.61/warc/CC-MAIN-20180423070455-20180423090455-00563.warc.gz"}
|
https://subs.emis.de/LIPIcs/frontdoor_6143.html
|
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2008.1745
URN: urn:nbn:de:0030-drops-17455
URL: https://drops.dagstuhl.de/opus/volltexte/2008/1745/
Go to the corresponding LIPIcs Volume Portal
### Algorithms for Game Metrics
pdf-format:
### Abstract
Simulation and bisimulation metrics for stochastic systems provide a
quantitative generalization of the classical simulation and
bisimulation relations.
These metrics capture the similarity of states with respect to
quantitative specifications written in the quantitative $\mu$-calculus
and related probabilistic logics.
We present algorithms for computing the metrics on Markov
decision processes (MDPs), turn-based stochastic games, and concurrent
games.
For turn-based games and MDPs, we provide a polynomial-time algorithm
based on linear programming
for the computation of the one-step metric distance between states.
The algorithm improves on the
previously known exponential-time algorithm based on a reduction to the theory of
reals.
We then present PSPACE algorithms for both the decision problem and the
problem of approximating the metric distance between two states,
matching the best known bound for Markov chains.
For the bisimulation kernel of the metric, which corresponds to probabilistic
bisimulation, our algorithm works in time $\calo(n^4)$ for both
turn-based games and MDPs; improving the previously best known
$\calo(n^9\cdot\log(n))$ time algorithm for MDPs.
For a concurrent game $G$, we show that computing the exact distance
between states is at least as hard as computing the value of
concurrent reachability games and
the square-root-sum problem in computational geometry.
We show that checking whether the metric distance is bounded by a
rational $r$, can be accomplished via a reduction to the theory of
real closed fields, involving a formula with three quantifier
alternations, yielding $\calo(|G|^{\calo(|G|^5)})$ time
complexity, improving the previously known reduction with
$\calo(|G|^{\calo(|G|^7)})$ time complexity.
These algorithms can be iterated to approximate the metrics using
binary search.
### BibTeX - Entry
@InProceedings{chatterjee_et_al:LIPIcs:2008:1745,
author = {Krishnendu Chatterjee and Luca de Alfaro and Rupak Majumdar and Vishwanath Raman},
title = {{Algorithms for Game Metrics}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
pages = {107--118},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-08-8},
ISSN = {1868-8969},
year = {2008},
volume = {2},
editor = {Ramesh Hariharan and Madhavan Mukund and V Vinay},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1745},
URN = {urn:nbn:de:0030-drops-17455},
doi = {10.4230/LIPIcs.FSTTCS.2008.1745},
annote = {Keywords: Algorithms, Metrics, Kernel, Simulation, Bisimulation, Linear Programming, Theory of Reals}
}
Keywords: Algorithms, Metrics, Kernel, Simulation, Bisimulation, Linear Programming, Theory of Reals Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science Issue Date: 2008 Date of publication: 05.12.2008
DROPS-Home | Fulltext Search | Imprint | Privacy
| 2023-03-23T04:45:21 |
{"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.5509533882141113, "perplexity": 8504.579847084779}, "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/1679296944996.49/warc/CC-MAIN-20230323034459-20230323064459-00459.warc.gz"}
|
https://pos.sissa.it/282/362/
|
Volume 282 - 38th International Conference on High Energy Physics (ICHEP2016) - Heavy Ions
What lattice QCD spectral functions can tell us about heavy quarkonium in the QGP
A. Rothkopf
Full text: pdf
Pre-published on: February 06, 2017
Published on: April 19, 2017
Abstract
The bound states of a heavy quark and antiquark ($c\bar{c}, b\bar{b}$) are ideal probes to explore the quark-gluon plasma created in relativistic heavy-ion collisions at the RHIC and LHC. Not only have they become experimentally accessible with high precision but also efficient tools, so called effective field theories (EFT) have been developed to treat them theoretically. Here we present recent progress in understanding the in-medium behavior of heavy-quarkonium with the help of EFT's combined with non-perturbative and first principles simulations in lattice QCD. In particular we discuss computations of heavy quarkonium spectral functions with the help of Bayesian unfolding methods and the physics we can extract from them. Limitations and the underlying assumptions of the used approaches are pointed out.
DOI: https://doi.org/10.22323/1.282.0362
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-12-03T17:49: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.25217291712760925, "perplexity": 1954.204432248571}, "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-50/segments/1606141729522.82/warc/CC-MAIN-20201203155433-20201203185433-00634.warc.gz"}
|
http://www.itl.nist.gov/div898/handbook/prc/section3/prc312.htm
|
7. Product and Process Comparisons
7.3. Comparisons based on data from two processes
7.3.1. Do two processes have the same mean?
Confidence intervals for differences between means
Definition of confidence interval for difference between population means Given two random samples, $$Y_1, \, \ldots, \, Y_N \,\,\,\,\, \mbox{ and } \,\,\,\,\, Z_1, \, \ldots, \, Z_N$$
from two populations, two-sided confidence intervals with $$100(1-\alpha)$$ % coverage for the difference between the unknown population means, $$\mu_1$$ and $$\mu_2$$, are shown in the table below. Relevant statistics for paired observations and for unpaired observations are shown elsewhere.
Two-sided confidence intervals with $$100(1-\alpha)$$ % coverage for $$\mu_1 - \mu_2$$:
$$\mu_1 - \mu_2 \,\,\, (\mbox{where } \sigma_1 = \sigma_2)$$ $$\bar{d} \pm t_{1-\alpha/2, \, N-1} \frac{s_{d}}{\sqrt{N}}$$
$$\mu_1 - \mu_2 \,\,\, (\mbox{where } \sigma_1 = \sigma_2)$$ $$\bar{Y} - \bar{Z} \pm t_{1-\alpha/2, \, N_1 + N_2 - 2} \,\, s \sqrt{\frac{1}{N_1} + \frac{1}{N_2}}$$ $$\mu_1 - \mu_2 \,\,\, (\mbox{where } \sigma_1 \ne \sigma_2)$$ $$\bar{Y} - \bar{Z} \pm t_{1-\alpha/2, \, N_1 + N_2 - 2} \, \sqrt{\frac{s_{1}^{2}}{N_1} + \frac{s_{2}^{2}}{N_2}}$$
Interpretation of confidence interval One interpretation of the confidence interval for means is that if zero is contained within the confidence interval, the two population means are equivalent.
| 2017-10-24T11: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": 2, "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.7552245855331421, "perplexity": 541.8598617213536}, "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/1508187828411.81/warc/CC-MAIN-20171024105736-20171024125736-00041.warc.gz"}
|
https://zbmath.org/authors/?q=ai:haldane.j-b-s
|
## Haldane, John Burdon Sanderson
Compute Distance To:
Author ID: haldane.j-b-s Published as: Haldane, J. B. S.; Haldane, John Scott; Haldane, J. S. B. more...less External Links: MGP · Wikidata · GND · IdRef
Documents Indexed: 83 Publications since 1918, including 3 Books 1 Further Contribution Biographic References: 4 Publications Co-Authors: 19 Co-Authors with 12 Joint Publications 77 Co-Co-Authors
all top 5
### Co-Authors
71 single-authored 2 Moshinsky, Pearl 2 Russell, Bertrand 2 Smith, Cedric A. B. 1 Baker, John R. 1 Bedichek, S. 1 Belloc, Hilaire 1 Cowan, Jack D. 1 Fausset, Hugh I’Anson 1 Fisher, Ronald Aylmer 1 Garnett, William 1 Hobhouse, L. T. 1 Hodgkin, A. L. 1 Holland, Thomas Henry 1 Huxley, Aldous Leonard 1 Huxley, Andrew Fielding 1 Huxley, Julian 1 Jayakar, Suresh Dinakar 1 Kermack, K. A. 1 Levy, Hyman 1 Lodge, Oliver Joseph 1 Mangel, Marc 1 McCulloch, Warren Sturgis 1 Mitchell, P. Chalmers 1 Murray, James Dickson 1 Pitts, Walter Harry 1 Provine, William B. 1 Richardson, Lewis Fry 1 Rinzel, John 1 Smith, Sheila Maynard 1 Thompson, D’Arcy Wentworth 1 Turing, Alan Mathison
all top 5
### Serials
21 Biometrika 18 Annals of Eugenics 13 Proceedings of the Cambridge Philosophical Society 5 Sankhyā 2 Nature, London 2 Journal of Mathematics and Physics 1 The Mathematical Gazette 1 Annals of Human Genetics 1 Journal of the Madras University. Section B: Mathematics, Physical and Biological Sciences 1 Sankhyā. Series A. Methods and Techniques 1 Journal of the Royal Statistical Society. Series B 1 Bulletin de l’Institut International de Statistique
### Fields
4 Biology and other natural sciences (92-XX) 2 History and biography (01-XX) 1 General and overarching topics; collections (00-XX) 1 Statistics (62-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
### Citations contained in zbMATH Open
47 Publications have been cited 437 times in 412 Documents Cited by Year
A mathematical theory of natural and artificial selection. V. JFM 53.0516.05
Haldane, J. B. S.
1927
Note on the median of a multivariate distribution. Zbl 0032.03601
Haldane, J. B. S.
1948
On a method of estimating frequencies. Zbl 0063.01881
Haldane, J. B. S.
1945
On the non-linear differenceation $$\Delta x_n=k\varphi(x_n)$$. Zbl 0004.25803
Haldane, J. B. S.
1932
The estimation and significance of the logarithm of a ratio of frequencies. Zbl 0070.14602
Haldane, J. B. S.
1956
The distribution of extremal and nearly extremal values in samples from a normal distribution. Zbl 0114.11302
Haldane, J. B. S.; Jayakar, S. D.
1963
A mathematical theory of natural and artificial selection. VI: Isolation. JFM 56.1105.02
Haldane, J. B. S.
1930
A mathematical theory of natural and artificial selection. IV. JFM 53.0516.04
Haldane, J. B. S.
1927
The precision of observed values of small frequencies. Zbl 0039.36205
Haldane, J. B. S.
1948
The exact value of the moments of the distribution of $$\chi^2$$, used as a test of goodness of fit, when expectations are small. Zbl 0016.41203
Haldane, J. B. S.
1937
The equilibrium between mutation and random extinction. Zbl 0022.25301
Haldane, J. B. S.
1939
The fitting of binomial distributions. Zbl 0060.31509
Haldane, J. B. S.
1941
The sampling distribution of a maximum-likelihood estimate. Zbl 0070.37404
Haldane, J. B. S.; Smith, Sheila Maynard
1956
The addition of random vectors. Zbl 0099.13002
Haldane, J. B. S.
1960
Haldane, J. B. S.
1957
The association of characters as a result of inbreeding and linkage. Zbl 0034.23401
Haldane, J. B. S.
1949
A note on inverse probability. Zbl 0003.35602
Haldane, J. B. S.
1932
Organic correlation and allometry. Zbl 0040.22602
Kermack, K. A.; Haldane, J. B. S.
1950
A mathematical theory of natural and artificial selection. JFM 50.0341.05
Haldane, J. B. S.
1924
A mathematical theory of natural selection VIII. Metastable populations. Zbl 0001.15202
Haldane, J. B. S.
1931
Moments of the distributions of powers and products of normal variates. Zbl 0063.01879
Haldane, J. B. S.
1942
A note on inverse probability. JFM 58.1181.07
Haldane, J. B. S.
1932
Parental and fraternal correlations for fitness. Zbl 0034.08002
Haldane, J. B. S.
1949
The mean and variance of $$\chi^2$$, when used as a test of homogeneity, when expectations are small. Zbl 0063.01877
Haldane, J. B. S.
1940
The mode and median of a nearly normal distribution with given cumulants. Zbl 0063.01880
Haldane, J. B. S.
1942
Simple approximations to the probability integral and $$P(\chi ^2,1)$$ when both are small. Zbl 0095.33801
Haldane, J. B. S.
1961
The mathematical theory of natural selection. Zbl 0124.12605
Haldane, J. B. S.
1959
A mathematical theory of natural and artificial selection. Pt. IX. Rapid selection. Zbl 0005.40403
Haldane, J. B. S.
1932
The spread of harmful autosomal recessive genes in human populations. Zbl 0022.25203
Haldane, J. B. S.
1939
A new estimate of the linkage between the genes for colour -blindness and haemophilia in man. Zbl 0030.20903
Haldane, J. B. S.; Smith, C. A. B.
1947
Some statistical problems arising in genetics. Zbl 0034.07901
Haldane, J. B. S.
1949
Methods for the detection of autosomal linkage in man. JFM 62.1373.04
Haldane, J. B. S.
1935
A mathematical theory of natural and artificial selection. III. JFM 52.0543.01
Haldane, J. B. S.
1926
A mathematical theory of natural and artificial selection. VII. Selection intensity as a function of mortality rate. Zbl 0001.15201
Haldane, J. B. S.
1931
The first six moments of $$\chi^2$$ for an $$n$$-fold table with $$n$$ degrees of freedom when some expectations are small. Zbl 0018.15701
Haldane, J. B. S.
1938
The approximate normalization of a class of frequency distributions. Zbl 0018.15702
Haldane, J. B. S.
1938
Inbreeding in Mendelian populations with special reference to human cousin marriage. Zbl 0022.25204
Haldane, J. B. S.; Moshinsky, Pearl
1939
A note on non-normal correlation. Zbl 0041.25902
Haldane, J. B. S.
1950
Substitutes for $$\chi^2$$. Zbl 0065.12004
Haldane, J. B. S.
1955
The estimation of the frequencies of recessive conditions in man. JFM 64.1223.03
Haldane, J. B. S.
1938
Some mathematical problems of the biologist. JFM 58.0472.10
Haldane, J. B. S.
1932
A mathematical theory of natural and artificial selection. IX: Rapid selection. JFM 58.0578.01
Haldane, J. B. S.
1932
The cumulants and moments of the binomial distribution, and the cumulants of $$\chi^2$$ for a $$(n\times 2)$$-fold table. Zbl 0023.33904
Haldane, J. B. S.
1940
A simple exact test for birthorder effect. Zbl 0030.21001
Haldane, J. B. S.; Smith, Cedric A. B.
1947
The extraction of square roots. Zbl 0043.12201
Haldane, J. B. S.
1951
Simple tests for bimodality and bitangentiality. Zbl 0046.36201
Haldane, J. B. S.
1952
The use of $$\chi^2$$ as a test of homogeneity in a $$(n\times 2)$$-fold table when expectations are small. Zbl 0060.29704
Haldane, J. B. S.
1945
The distribution of extremal and nearly extremal values in samples from a normal distribution. Zbl 0114.11302
Haldane, J. B. S.; Jayakar, S. D.
1963
Simple approximations to the probability integral and $$P(\chi ^2,1)$$ when both are small. Zbl 0095.33801
Haldane, J. B. S.
1961
The addition of random vectors. Zbl 0099.13002
Haldane, J. B. S.
1960
The mathematical theory of natural selection. Zbl 0124.12605
Haldane, J. B. S.
1959
Haldane, J. B. S.
1957
The estimation and significance of the logarithm of a ratio of frequencies. Zbl 0070.14602
Haldane, J. B. S.
1956
The sampling distribution of a maximum-likelihood estimate. Zbl 0070.37404
Haldane, J. B. S.; Smith, Sheila Maynard
1956
Substitutes for $$\chi^2$$. Zbl 0065.12004
Haldane, J. B. S.
1955
Simple tests for bimodality and bitangentiality. Zbl 0046.36201
Haldane, J. B. S.
1952
The extraction of square roots. Zbl 0043.12201
Haldane, J. B. S.
1951
Organic correlation and allometry. Zbl 0040.22602
Kermack, K. A.; Haldane, J. B. S.
1950
A note on non-normal correlation. Zbl 0041.25902
Haldane, J. B. S.
1950
The association of characters as a result of inbreeding and linkage. Zbl 0034.23401
Haldane, J. B. S.
1949
Parental and fraternal correlations for fitness. Zbl 0034.08002
Haldane, J. B. S.
1949
Some statistical problems arising in genetics. Zbl 0034.07901
Haldane, J. B. S.
1949
Note on the median of a multivariate distribution. Zbl 0032.03601
Haldane, J. B. S.
1948
The precision of observed values of small frequencies. Zbl 0039.36205
Haldane, J. B. S.
1948
A new estimate of the linkage between the genes for colour -blindness and haemophilia in man. Zbl 0030.20903
Haldane, J. B. S.; Smith, C. A. B.
1947
A simple exact test for birthorder effect. Zbl 0030.21001
Haldane, J. B. S.; Smith, Cedric A. B.
1947
On a method of estimating frequencies. Zbl 0063.01881
Haldane, J. B. S.
1945
The use of $$\chi^2$$ as a test of homogeneity in a $$(n\times 2)$$-fold table when expectations are small. Zbl 0060.29704
Haldane, J. B. S.
1945
Moments of the distributions of powers and products of normal variates. Zbl 0063.01879
Haldane, J. B. S.
1942
The mode and median of a nearly normal distribution with given cumulants. Zbl 0063.01880
Haldane, J. B. S.
1942
The fitting of binomial distributions. Zbl 0060.31509
Haldane, J. B. S.
1941
The mean and variance of $$\chi^2$$, when used as a test of homogeneity, when expectations are small. Zbl 0063.01877
Haldane, J. B. S.
1940
The cumulants and moments of the binomial distribution, and the cumulants of $$\chi^2$$ for a $$(n\times 2)$$-fold table. Zbl 0023.33904
Haldane, J. B. S.
1940
The equilibrium between mutation and random extinction. Zbl 0022.25301
Haldane, J. B. S.
1939
The spread of harmful autosomal recessive genes in human populations. Zbl 0022.25203
Haldane, J. B. S.
1939
Inbreeding in Mendelian populations with special reference to human cousin marriage. Zbl 0022.25204
Haldane, J. B. S.; Moshinsky, Pearl
1939
The first six moments of $$\chi^2$$ for an $$n$$-fold table with $$n$$ degrees of freedom when some expectations are small. Zbl 0018.15701
Haldane, J. B. S.
1938
The approximate normalization of a class of frequency distributions. Zbl 0018.15702
Haldane, J. B. S.
1938
The estimation of the frequencies of recessive conditions in man. JFM 64.1223.03
Haldane, J. B. S.
1938
The exact value of the moments of the distribution of $$\chi^2$$, used as a test of goodness of fit, when expectations are small. Zbl 0016.41203
Haldane, J. B. S.
1937
Methods for the detection of autosomal linkage in man. JFM 62.1373.04
Haldane, J. B. S.
1935
On the non-linear differenceation $$\Delta x_n=k\varphi(x_n)$$. Zbl 0004.25803
Haldane, J. B. S.
1932
A note on inverse probability. Zbl 0003.35602
Haldane, J. B. S.
1932
A note on inverse probability. JFM 58.1181.07
Haldane, J. B. S.
1932
A mathematical theory of natural and artificial selection. Pt. IX. Rapid selection. Zbl 0005.40403
Haldane, J. B. S.
1932
Some mathematical problems of the biologist. JFM 58.0472.10
Haldane, J. B. S.
1932
A mathematical theory of natural and artificial selection. IX: Rapid selection. JFM 58.0578.01
Haldane, J. B. S.
1932
A mathematical theory of natural selection VIII. Metastable populations. Zbl 0001.15202
Haldane, J. B. S.
1931
A mathematical theory of natural and artificial selection. VII. Selection intensity as a function of mortality rate. Zbl 0001.15201
Haldane, J. B. S.
1931
A mathematical theory of natural and artificial selection. VI: Isolation. JFM 56.1105.02
Haldane, J. B. S.
1930
A mathematical theory of natural and artificial selection. V. JFM 53.0516.05
Haldane, J. B. S.
1927
A mathematical theory of natural and artificial selection. IV. JFM 53.0516.04
Haldane, J. B. S.
1927
A mathematical theory of natural and artificial selection. III. JFM 52.0543.01
Haldane, J. B. S.
1926
A mathematical theory of natural and artificial selection. JFM 50.0341.05
Haldane, J. B. S.
1924
all top 5
### Cited by 642 Authors
7 Pollak, Edward 6 Feldman, Marcus W. 5 Eshel, Ilan 5 Karlin, Samuel 5 Matessi, Carlo 5 Uyenoyama, Marcy K. 4 Bürger, Reinhard 4 Giles, David E. A. 4 Lambert, Amaury 4 Turelli, Michael 3 Billiard, Sylvain 3 Bonett, Douglas G. 3 Brady, Richard Lee 3 Chambers, Christopher P. 3 Chaudhuri, Probal 3 Dey, Dipak Kumar 3 Jhun, Myoungshic Jhun 3 Krug, Joachim 3 Lange, Kenneth L. 3 Mendo, Luis 3 Metz, Johan A. Jacob 3 Mukhopadhyay, Nitis 3 Pokalyuk, Cornelia 3 Reed, Floyd A. 3 Tebbs, Joshua M. 3 Wahl, Lindi M. 2 Agresti, Alan 2 Akerman, Ada 2 Allen, Benjamin L. 2 Azevedo, Ricardo B. R. 2 Bai, Do Sun 2 Barbour, Andrew David 2 Barton, Nicholas H. 2 Benavoli, Alessio 2 Bennett, Bruce M. 2 Bichsel, Manuel 2 Boenkost, Florin 2 Bull, Shelley B. 2 Burden, Conrad John 2 Casanova, Adrián González 2 Cavalli-Sforza, Luigi Luca 2 Chan, Lingyau 2 Chang, Kuang-Chao 2 Chaouch, Mohamed Ali 2 Charlesworth, Brian 2 Chatterjee, Snigdhansu 2 Chen, Xinjia 2 Christiansen, Freddy Bugge 2 Desharnais, Robert A. 2 Engen, Steinar 2 Epstein, Charles Lawrence 2 Etheridge, Alison Mary 2 Fan, Ruzong 2 Gannoun, Ali 2 Gershkov, Alex 2 Godichon-Baggioni, Antoine 2 Gorban, Alexander N. 2 Greenwood, Celia M. T. 2 Hansen, Thomas F. 2 Hauck, Walter W. jun. 2 Hermisson, Joachim 2 Hoppe, Fred M. 2 Hu, Xinsheng 2 Hutter, Marcus 2 Ivanova, Anastasia 2 Jain, Kavita 2 James, Ananthu 2 Kempthorne, Oscar 2 Kim, Seongin 2 Koralov, Leonid B. 2 Kosmidis, Ioannis 2 León, Carlos Antonio 2 Liberman, Uri 2 Llaurens, Violaine 2 Marron, James Stephen 2 Masel, Joanna 2 Massé, Jean-Claude 2 Minsker, Stanislav 2 Molchanov, Stanislav Alekseevich 2 Moldovanu, Benny 2 Mukherjee, Amitava 2 Nadarajah, Saralees 2 Nagylaki, Thomas 2 Nassar, Elma 2 Nowak, Martin Andreas 2 Ogasawara, Haruhiko 2 Otto, Sarah Perin 2 Pardoux, Etienne 2 Pfaffelhuber, Peter 2 Plotkin, Joshua B. 2 Pokidysheva, Lyudmila I. 2 Roths, Scott A. 2 Roughgarden, Joan 2 Schmiegelt, Benjamin 2 Shi, Xianwen 2 Smadi, Charline 2 Smirnova, Elena V. 2 Stephan, Wolfgang 2 Traulsen, Arne 2 Tuljapurkar, Shripad D. ...and 542 more Authors
all top 5
### Cited in 112 Serials
108 Theoretical Population Biology 22 Journal of Mathematical Biology 22 Communications in Statistics. Theory and Methods 21 Journal of Theoretical Biology 16 Journal of Statistical Planning and Inference 12 Statistics & Probability Letters 12 Computational Statistics and Data Analysis 10 Mathematical Biosciences 9 Sequential Analysis 8 Annals of the Institute of Statistical Mathematics 8 Journal of Multivariate Analysis 7 Bulletin of Mathematical Biology 5 Journal of Statistical Computation and Simulation 5 Test 4 Journal of Statistical Physics 4 The Annals of Statistics 4 Biometrics 4 Communications in Statistics. Simulation and Computation 4 Electronic Journal of Statistics 3 The Canadian Journal of Statistics 3 Metrika 3 Journal of Differential Equations 3 International Journal of Approximate Reasoning 3 Stochastic Processes and their Applications 3 Statistical Papers 3 Bernoulli 3 Statistical Methodology 2 Psychometrika 2 Annals of Human Genetics 2 International Statistical Review 2 Journal of Economic Theory 2 Journal of Mathematical Psychology 2 Journal of Soviet Mathematics 2 Mathematische Annalen 2 Social Choice and Welfare 2 The Annals of Applied Probability 2 Games and Economic Behavior 2 Computational Statistics 2 Australian & New Zealand Journal of Statistics 2 Journal of Applied Statistics 2 Journal of Biological Systems 2 ASTIN Bulletin 2 Journal of Agricultural, Biological, and Environmental Statistics 1 Advances in Applied Probability 1 The American Statistician 1 Archive for History of Exact Sciences 1 Bulletin of the Australian Mathematical Society 1 Computers & Mathematics with Applications 1 International Journal of Mathematical Education in Science and Technology 1 Physics Letters. A 1 Physics Reports 1 ZAMP. Zeitschrift für angewandte Mathematik und Physik 1 Acta Mathematica 1 Aplikace Matematiky 1 Applied Mathematics and Computation 1 Biometrical Journal 1 Duke Mathematical Journal 1 Journal of the American Statistical Association 1 Journal of Applied Probability 1 Journal of Computational and Applied Mathematics 1 Journal of Econometrics 1 Journal of Functional Analysis 1 Kybernetes 1 Mathematical Programming 1 Mathematische Zeitschrift 1 Proceedings of the American Mathematical Society 1 Results in Mathematics 1 Statistica 1 Trabajos de Estadistica y de Investigacion Operativa 1 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 1 Advances in Applied Mathematics 1 Revue de Statistique Appliquée 1 American Journal of Mathematical and Management Sciences 1 Physica D 1 Statistical Science 1 Econometric Reviews 1 Computational Mathematics and Modeling 1 European Journal of Operational Research 1 Historia Mathematica 1 Proceedings of the National Academy of Sciences of the United States of America 1 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 1 Continuum Mechanics and Thermodynamics 1 Journal of Biopharmaceutical Statistics 1 Combinatorics, Probability and Computing 1 Journal of Mathematical Sciences (New York) 1 Annales Mathématiques Blaise Pascal 1 Annals of Mathematics and Artificial Intelligence 1 Lifetime Data Analysis 1 Electronic Journal of Probability 1 Journal of Nonparametric Statistics 1 Mathematical Population Studies 1 Revista Matemática Complutense 1 Journal of the Royal Statistical Society. Series B. Statistical Methodology 1 The ANZIAM Journal 1 Discrete and Continuous Dynamical Systems. Series B 1 Journal of the Australian Mathematical Society 1 Journal of Systems Science and Complexity 1 Stochastic Models 1 Comptes Rendus. Mathématique. Académie des Sciences, Paris 1 Stochastics and Dynamics ...and 12 more Serials
all top 5
### Cited in 26 Fields
197 Biology and other natural sciences (92-XX) 180 Statistics (62-XX) 91 Probability theory and stochastic processes (60-XX) 29 Numerical analysis (65-XX) 28 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 10 History and biography (01-XX) 9 Partial differential equations (35-XX) 9 Dynamical systems and ergodic theory (37-XX) 7 Ordinary differential equations (34-XX) 4 Statistical mechanics, structure of matter (82-XX) 3 Combinatorics (05-XX) 3 Difference and functional equations (39-XX) 3 Operations research, mathematical programming (90-XX) 2 Real functions (26-XX) 2 Approximations and expansions (41-XX) 2 Computer science (68-XX) 2 Systems theory; control (93-XX) 1 Mathematical logic and foundations (03-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Special functions (33-XX) 1 Abstract harmonic analysis (43-XX) 1 Integral equations (45-XX) 1 Operator theory (47-XX) 1 Fluid mechanics (76-XX) 1 Quantum theory (81-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.
| 2022-09-25T01:11: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.3316648006439209, "perplexity": 4908.234961392005}, "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-2022-40/segments/1664030334332.96/warc/CC-MAIN-20220925004536-20220925034536-00215.warc.gz"}
|
https://dlmf.nist.gov/22.8
|
## §22.8(i) Sum of Two Arguments
For $u,v\in\mathbb{C}$, and with the common modulus $k$ suppressed:
22.8.1 $\displaystyle\operatorname{sn}(u+v)$ $\displaystyle=\frac{\operatorname{sn}u\operatorname{cn}v\operatorname{dn}v+% \operatorname{sn}v\operatorname{cn}u\operatorname{dn}u}{1-k^{2}{\operatorname{% sn}^{2}}u{\operatorname{sn}^{2}}v},$ 22.8.2 $\displaystyle\operatorname{cn}(u+v)$ $\displaystyle=\frac{\operatorname{cn}u\operatorname{cn}v-\operatorname{sn}u% \operatorname{dn}u\operatorname{sn}v\operatorname{dn}v}{1-k^{2}{\operatorname{% sn}^{2}}u{\operatorname{sn}^{2}}v},$ 22.8.3 $\displaystyle\operatorname{dn}(u+v)$ $\displaystyle=\frac{\operatorname{dn}u\operatorname{dn}v-k^{2}\operatorname{sn% }u\operatorname{cn}u\operatorname{sn}v\operatorname{cn}v}{1-k^{2}{% \operatorname{sn}^{2}}u{\operatorname{sn}^{2}}v}.$
22.8.4 $\operatorname{cd}(u+v)=\frac{\operatorname{cd}u\operatorname{cd}v-{k^{\prime}}% ^{2}\operatorname{sd}u\operatorname{nd}u\operatorname{sd}v\operatorname{nd}v}{% 1+k^{2}{k^{\prime}}^{2}{\operatorname{sd}^{2}}u{\operatorname{sd}^{2}}v},$
22.8.5 $\displaystyle\operatorname{sd}(u+v)$ $\displaystyle=\frac{\operatorname{sd}u\operatorname{cd}v\operatorname{nd}v+% \operatorname{sd}v\operatorname{cd}u\operatorname{nd}u}{1+k^{2}{k^{\prime}}^{2% }{\operatorname{sd}^{2}}u{\operatorname{sd}^{2}}v},$ 22.8.6 $\displaystyle\operatorname{nd}(u+v)$ $\displaystyle=\frac{\operatorname{nd}u\operatorname{nd}v+k^{2}\operatorname{sd% }u\operatorname{cd}u\operatorname{sd}v\operatorname{cd}v}{1+k^{2}{k^{\prime}}^% {2}{\operatorname{sd}^{2}}u{\operatorname{sd}^{2}}v},$ 22.8.7 $\displaystyle\operatorname{dc}(u+v)$ $\displaystyle=\frac{\operatorname{dc}u\operatorname{dc}v+{k^{\prime}}^{2}% \operatorname{sc}u\operatorname{nc}u\operatorname{sc}v\operatorname{nc}v}{1-{k% ^{\prime}}^{2}{\operatorname{sc}^{2}}u{\operatorname{sc}^{2}}v},$ 22.8.8 $\displaystyle\operatorname{nc}(u+v)$ $\displaystyle=\frac{\operatorname{nc}u\operatorname{nc}v+\operatorname{sc}u% \operatorname{dc}u\operatorname{sc}v\operatorname{dc}v}{1-{k^{\prime}}^{2}{% \operatorname{sc}^{2}}u{\operatorname{sc}^{2}}v},$ 22.8.9 $\displaystyle\operatorname{sc}(u+v)$ $\displaystyle=\frac{\operatorname{sc}u\operatorname{dc}v\operatorname{nc}v+% \operatorname{sc}v\operatorname{dc}u\operatorname{nc}u}{1-{k^{\prime}}^{2}{% \operatorname{sc}^{2}}u{\operatorname{sc}^{2}}v},$ 22.8.10 $\displaystyle\operatorname{ns}(u+v)$ $\displaystyle=\frac{\operatorname{ns}u\operatorname{ds}v\operatorname{cs}v-% \operatorname{ns}v\operatorname{ds}u\operatorname{cs}u}{{\operatorname{cs}^{2}% }v-{\operatorname{cs}^{2}}u},$ 22.8.11 $\displaystyle\operatorname{ds}(u+v)$ $\displaystyle=\frac{\operatorname{ds}u\operatorname{cs}v\operatorname{ns}v-% \operatorname{ds}v\operatorname{cs}u\operatorname{ns}u}{{\operatorname{cs}^{2}% }v-{\operatorname{cs}^{2}}u},$ 22.8.12 $\displaystyle\operatorname{cs}(u+v)$ $\displaystyle=\frac{\operatorname{cs}u\operatorname{ds}v\operatorname{ns}v-% \operatorname{cs}v\operatorname{ds}u\operatorname{ns}u}{{\operatorname{cs}^{2}% }v-{\operatorname{cs}^{2}}u}.$
## §22.8(ii) Alternative Forms for Sum of Two Arguments
For $u,v\in\mathbb{C}$, and with the common modulus $k$ suppressed:
22.8.13 $\displaystyle\operatorname{sn}(u+v)$ $\displaystyle=\frac{{\operatorname{sn}^{2}}u-{\operatorname{sn}^{2}}v}{% \operatorname{sn}u\operatorname{cn}v\operatorname{dn}v-\operatorname{sn}v% \operatorname{cn}u\operatorname{dn}u},$ 22.8.14 $\displaystyle\operatorname{sn}(u+v)$ $\displaystyle=\frac{\operatorname{sn}u\operatorname{cn}u\operatorname{dn}v+% \operatorname{sn}v\operatorname{cn}v\operatorname{dn}u}{\operatorname{cn}u% \operatorname{cn}v+\operatorname{sn}u\operatorname{dn}u\operatorname{sn}v% \operatorname{dn}v},$ 22.8.15 $\displaystyle\operatorname{cn}(u+v)$ $\displaystyle=\frac{\operatorname{sn}u\operatorname{cn}u\operatorname{dn}v-% \operatorname{sn}v\operatorname{cn}v\operatorname{dn}u}{\operatorname{sn}u% \operatorname{cn}v\operatorname{dn}v-\operatorname{sn}v\operatorname{cn}u% \operatorname{dn}u},$
22.8.16 $\displaystyle\operatorname{cn}(u+v)$ $\displaystyle=\frac{1-{\operatorname{sn}^{2}}u-{\operatorname{sn}^{2}}v+k^{2}{% \operatorname{sn}^{2}}u{\operatorname{sn}^{2}}v}{\operatorname{cn}u% \operatorname{cn}v+\operatorname{sn}u\operatorname{dn}u\operatorname{sn}v% \operatorname{dn}v},$ 22.8.17 $\displaystyle\operatorname{dn}(u+v)$ $\displaystyle=\frac{\operatorname{sn}u\operatorname{cn}v\operatorname{dn}u-% \operatorname{sn}v\operatorname{cn}u\operatorname{dn}v}{\operatorname{sn}u% \operatorname{cn}v\operatorname{dn}v-\operatorname{sn}v\operatorname{cn}u% \operatorname{dn}u},$ 22.8.18 $\displaystyle\operatorname{dn}(u+v)$ $\displaystyle=\frac{\operatorname{cn}u\operatorname{dn}u\operatorname{cn}v% \operatorname{dn}v+{k^{\prime}}^{2}\operatorname{sn}u\operatorname{sn}v}{% \operatorname{cn}u\operatorname{cn}v+\operatorname{sn}u\operatorname{dn}u% \operatorname{sn}v\operatorname{dn}v}.$
## §22.8(iii) Special Relations Between Arguments
In the following equations the common modulus $k$ is again suppressed.
Let
22.8.19 $z_{1}+z_{2}+z_{3}+z_{4}=0.$ ⓘ Symbols: $z$: complex Permalink: http://dlmf.nist.gov/22.8.E19 Encodings: TeX, pMML, png See also: Annotations for 22.8(iii), 22.8 and 22
Then
22.8.20 $\begin{vmatrix}\operatorname{sn}z_{1}&\operatorname{cn}z_{1}&\operatorname{dn}% z_{1}&1\\ \operatorname{sn}z_{2}&\operatorname{cn}z_{2}&\operatorname{dn}z_{2}&1\\ \operatorname{sn}z_{3}&\operatorname{cn}z_{3}&\operatorname{dn}z_{3}&1\\ \operatorname{sn}z_{4}&\operatorname{cn}z_{4}&\operatorname{dn}z_{4}&1\end{% vmatrix}=0,$
and
22.8.21 ${k^{\prime}}^{2}-{k^{\prime}}^{2}k^{2}\operatorname{sn}z_{1}\operatorname{sn}z% _{2}\operatorname{sn}z_{3}\operatorname{sn}z_{4}+k^{2}\operatorname{cn}z_{1}% \operatorname{cn}z_{2}\operatorname{cn}z_{3}\operatorname{cn}z_{4}-% \operatorname{dn}z_{1}\operatorname{dn}z_{2}\operatorname{dn}z_{3}% \operatorname{dn}z_{4}=0.$
A geometric interpretation of (22.8.20) analogous to that of (23.10.5) is given in Whittaker and Watson (1927, p. 530).
Next, let
22.8.22 $z_{1}+z_{2}+z_{3}+z_{4}=2\!K\left(k\right).$ ⓘ Symbols: $K\left(\NVar{k}\right)$: Legendre’s complete elliptic integral of the first kind, $z$: complex and $k$: modulus Permalink: http://dlmf.nist.gov/22.8.E22 Encodings: TeX, pMML, png See also: Annotations for 22.8(iii), 22.8 and 22
Then
22.8.23 $\begin{vmatrix}\operatorname{sn}z_{1}\operatorname{cn}z_{1}&\operatorname{cn}z% _{1}\operatorname{dn}z_{1}&\operatorname{cn}z_{1}&\operatorname{dn}z_{1}\\ \operatorname{sn}z_{2}\operatorname{cn}z_{2}&\operatorname{cn}z_{2}% \operatorname{dn}z_{2}&\operatorname{cn}z_{2}&\operatorname{dn}z_{2}\\ \operatorname{sn}z_{3}\operatorname{cn}z_{3}&\operatorname{cn}z_{3}% \operatorname{dn}z_{3}&\operatorname{cn}z_{3}&\operatorname{dn}z_{3}\\ \operatorname{sn}z_{4}\operatorname{cn}z_{4}&\operatorname{cn}z_{4}% \operatorname{dn}z_{4}&\operatorname{cn}z_{4}&\operatorname{dn}z_{4}\end{% vmatrix}=0.$
For these and related identities see Copson (1935, pp. 415–416).
If sums/differences of the $z_{j}$’s are rational multiples of $K\left(k\right)$, then further relations follow. For instance, if
22.8.24 $z_{1}-z_{2}=z_{2}-z_{3}=\tfrac{2}{3}\!K\left(k\right),$ ⓘ Symbols: $K\left(\NVar{k}\right)$: Legendre’s complete elliptic integral of the first kind, $z$: complex and $k$: modulus Permalink: http://dlmf.nist.gov/22.8.E24 Encodings: TeX, pMML, png See also: Annotations for 22.8(iii), 22.8 and 22
then
22.8.25 $\frac{(\operatorname{dn}z_{2}+\operatorname{dn}z_{3})(\operatorname{dn}z_{3}+% \operatorname{dn}z_{1})(\operatorname{dn}z_{1}+\operatorname{dn}z_{2})}{% \operatorname{dn}z_{1}+\operatorname{dn}z_{2}+\operatorname{dn}z_{3}}$ ⓘ Symbols: $\operatorname{dn}\left(\NVar{z},\NVar{k}\right)$: Jacobian elliptic function, $z$: complex and $k$: modulus Permalink: http://dlmf.nist.gov/22.8.E25 Encodings: TeX, pMML, png See also: Annotations for 22.8(iii), 22.8 and 22
is independent of $z_{1}$, $z_{2}$, $z_{3}$. Similarly, if
22.8.26 $z_{1}-z_{2}=z_{2}-z_{3}=z_{3}-z_{4}=\tfrac{1}{2}\!K\left(k\right),$ ⓘ Symbols: $K\left(\NVar{k}\right)$: Legendre’s complete elliptic integral of the first kind, $z$: complex and $k$: modulus Permalink: http://dlmf.nist.gov/22.8.E26 Encodings: TeX, pMML, png See also: Annotations for 22.8(iii), 22.8 and 22
then
22.8.27 $\operatorname{dn}z_{1}\operatorname{dn}z_{3}=\operatorname{dn}z_{2}% \operatorname{dn}z_{4}=k^{\prime}.$ ⓘ Symbols: $\operatorname{dn}\left(\NVar{z},\NVar{k}\right)$: Jacobian elliptic function, $z$: complex, $k$: modulus and $k^{\prime}$: complementary modulus Permalink: http://dlmf.nist.gov/22.8.E27 Encodings: TeX, pMML, png See also: Annotations for 22.8(iii), 22.8 and 22
Greenhill (1959, pp. 121–130) reviews these results in terms of the geometric poristic polygon constructions of Poncelet. Generalizations are given in §22.9.
| 2018-04-22T16:16:34 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 197, "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.9928550124168396, "perplexity": 11941.981238226543}, "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/1524125945624.76/warc/CC-MAIN-20180422154522-20180422174522-00000.warc.gz"}
|
https://par.nsf.gov/biblio/10109162-near-optimal-smooth-path-planning-multisection-continuum-arms
|
Near-optimal Smooth Path Planning for Multisection Continuum Arms
We study the path planning problem for continuum-arm robots, in which we are given a starting and an end point, and we need to compute a path for the tip of the continuum arm between the two points. We consider both cases where obstacles are present and where they are not. We demonstrate how to leverage the continuum arm features to introduce a new model that enables a path planning approach based on the configurations graph, for a continuum arm consisting of three sections, each consisting of three muscle actuators. The algorithm we apply to the configurations graph allows us to exploit parallelism in the computation to obtain efficient implementation. We conducted extensive tests, and the obtained results show the completeness of the proposed algorithm under the considered discretizations, in both cases where obstacles are present and where they are not. We compared our approach to the standard inverse kinematics approach. While the inverse kinematics approach is much faster when successful, our algorithm always succeeds in finding a path or reporting that no path exists, compared to a roughly 70% success rate of the inverse kinematics approach (when a path exists).
Authors:
; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10109162
Journal Name:
2019 2nd IEEE International Conference on Soft Robotics (RoboSoft)
Page Range or eLocation-ID:
416 to 421
2. We present a discrete-optimization technique for finding feasible robot arm trajectories that pass through provided 6-DOF Cartesian-space end-effector paths with high accuracy, a problem called pathwise-inverse kinematics. The output from our method consists of a path function of joint-angles that best follows the provided end-effector path function, given some definition of best''. Our method, called Stampede, casts the robot motion translation problem as a discrete-space graph-search problem where the nodes in the graph are individually solved for using non-linear optimization; framing the problem in such a way gives rise to a well-structured graph that affords an effective best path calculation using an efficient dynamic-programming algorithm. We present techniques for sampling configuration space, such as diversity sampling and adaptive sampling, to construct the search-space in the graph. Through an evaluation, we show that our approach performs well in finding smooth, feasible, collision-free robot motions that match the input end-effector trace with very high accuracy, while alternative approaches, such as a state-of-the-art per-frame inverse kinematics solver and a global non-linear trajectory-optimization approach, performed unfavorably.
| 2022-12-05T04:27:59 |
{"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.5781535506248474, "perplexity": 1004.8318584474664}, "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/1669446711003.56/warc/CC-MAIN-20221205032447-20221205062447-00410.warc.gz"}
|
https://bison.inl.gov/Documentation/source/materials/tensor_mechanics/ZryIrradiationGrowthEigenstrain.aspx
|
Calculates eigenstrain from irradiation growth in Zircaloy cladding using either the Franklin or ESCORE models
## Description
This class, ZryIrradiationGrowthEigenstrain, calculates the zircaloy strains that are not caused by external force loading on the cladding material: here the strain due to irradiation growth. This model for irradiation growth of Zr4 cladding calculates the increment of cladding axial strain due to irradiation growth, and was taken from Franklin (1982). (1) where is a coefficient determined by the zircaloy material type, units of (n/(cm-sec)), is the total fast neutron fluence, and is the fluence exponent (dimensionless). An additional set of material properties, using the same irradiation growth strain relationship, is from Rashid et al. (2004).
Table 1: Material Parameters for Irradiation Growth Strain for Various Zircaloy Microstructures (Franklin, 1982; Rashid et al., 2004)
Stress relief annealed (Franklin model)
Recrystallization annealed (Franklin model)
Partial recrystallization annealed (Franklin model)
Zirlo (Franklin model)
ESCORE model (Rashid model)
This method builds the irradiation growth strain tensor based on the geometry options set by the user. Since irradiation growth should occur in the axial direction only while being volume conserving, it is necessary to specify a strain increment for the other two directions. This strain increment is given by (2)
## Example Input Syntax
block = 1
fast_neutron_fluence = fast_neutron_fluence
zircaloy_material_model_type = stress_relief_annealed
eigenstrain_name = irr_eigenstrain
[../]
The eigenstrain_name parameter value must also be set for the strain calculator, and an example parameter setting is shown below:
[./strain]
type = ComputeAxisymmetricRZFiniteStrain
block = 1
eigenstrain_names = irr_eigenstrain
[../]
## Input Parameters
• fast_neutron_fluenceThe fast neutron fluence
C++ Type:std::vector
Description:The fast neutron fluence
• eigenstrain_nameMaterial property name for the eigenstrain tensor computed by this model. IMPORTANT: The name of this property must also be provided to the strain calculator.
C++ Type:std::string
Description:Material property name for the eigenstrain tensor computed by this model. IMPORTANT: The name of this property must also be provided to the strain calculator.
### Required Parameters
• zircaloy_material_model_typestress_relief_annealedType of irradiation growth volumetric swelling formulation. Choices are: stress_relief_annealed recrystallization_annealed partial_recrystallization_annealed zirlo ESCORE_IrradiationGrowthZr4
Default:stress_relief_annealed
C++ Type:MooseEnum
Description:Type of irradiation growth volumetric swelling formulation. Choices are: stress_relief_annealed recrystallization_annealed partial_recrystallization_annealed zirlo ESCORE_IrradiationGrowthZr4
• computeTrueWhen false, MOOSE will not call compute methods on this material. The user must call computeProperties() after retrieving the Material via MaterialPropertyInterface::getMaterial(). Non-computed Materials are not sorted for dependencies.
Default:True
C++ Type:bool
Description:When false, MOOSE will not call compute methods on this material. The user must call computeProperties() after retrieving the Material via MaterialPropertyInterface::getMaterial(). Non-computed Materials are not sorted for dependencies.
• initial_fast_fluence0The initial fast neutron fluence
Default:0
C++ Type:double
Description:The initial fast neutron fluence
• base_nameOptional parameter that allows the user to define multiple mechanics material systems on the same block, i.e. for multiple phases
C++ Type:std::string
Description:Optional parameter that allows the user to define multiple mechanics material systems on the same block, i.e. for multiple phases
• model_rthetaFalseSet to true for a plane strain model
Default:False
C++ Type:bool
Description:Set to true for a plane strain model
• boundaryThe list of boundary IDs from the mesh where this boundary condition applies
C++ Type:std::vector
Description:The list of boundary IDs from the mesh where this boundary condition applies
• growth_direction1The direction you want to apply irradiation growth
Default:1
C++ Type:unsigned int
Description:The direction you want to apply irradiation growth
• blockThe list of block ids (SubdomainID) that this object will be applied
C++ Type:std::vector
Description:The list of block ids (SubdomainID) that this object will be applied
### Optional Parameters
• enableTrueSet the enabled status of the MooseObject.
Default:True
C++ Type:bool
Description:Set the enabled status of the MooseObject.
• use_displaced_meshFalseWhether or not this object should use the displaced mesh for computation. Note that in the case this is true but no displacements are provided in the Mesh block the undisplaced mesh will still be used.
Default:False
C++ Type:bool
Description:Whether or not this object should use the displaced mesh for computation. Note that in the case this is true but no displacements are provided in the Mesh block the undisplaced mesh will still be used.
• control_tagsAdds user-defined labels for accessing object parameters via control logic.
C++ Type:std::vector
Description:Adds user-defined labels for accessing object parameters via control logic.
• seed0The seed for the master random number generator
Default:0
C++ Type:unsigned int
Description:The seed for the master random number generator
• implicitTrueDetermines whether this object is calculated using an implicit or explicit form
Default:True
C++ Type:bool
Description:Determines whether this object is calculated using an implicit or explicit form
• constant_onNONEWhen ELEMENT, MOOSE will only call computeQpProperties() for the 0th quadrature point, and then copy that value to the other qps.When SUBDOMAIN, MOOSE will only call computeSubdomainProperties() for the 0th quadrature point, and then copy that value to the other qps. Evaluations on element qps will be skipped
Default:NONE
C++ Type:MooseEnum
Description:When ELEMENT, MOOSE will only call computeQpProperties() for the 0th quadrature point, and then copy that value to the other qps.When SUBDOMAIN, MOOSE will only call computeSubdomainProperties() for the 0th quadrature point, and then copy that value to the other qps. Evaluations on element qps will be skipped
• output_propertiesList of material properties, from this material, to output (outputs must also be defined to an output type)
C++ Type:std::vector
Description:List of material properties, from this material, to output (outputs must also be defined to an output type)
• outputsnone Vector of output names were you would like to restrict the output of variables(s) associated with this object
Default:none
C++ Type:std::vector
Description:Vector of output names were you would like to restrict the output of variables(s) associated with this object
## References
1. DG Franklin. Zircaloy-4 cladding deformation during power reactor irradiation. In Zirconium in the Nuclear Industry. ASTM International, 1982.[BibTeX]
2. Y Rashid, R Dunham, and R Montgomery. Fuel Analysis and Licensing Code: FALCON MOD01. Technical Report, Electric Power Research Institute, December 2004.[BibTeX]
| 2020-11-28T02:02: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": 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.34814324975013733, "perplexity": 7691.00264421385}, "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/1606141194982.45/warc/CC-MAIN-20201128011115-20201128041115-00356.warc.gz"}
|
http://www.legisquebec.gouv.qc.ca/en/showversion/cr/H-4.2,%20r.%201?code=se:289&pointInTime=20210204
|
### H-4.2, r. 1 - Regulation respecting petroleum exploration, production and storage in a body of water
289. The permanent well or reservoir closure and site restoration plan must be signed and sealed by an engineer and must contain, in particular,
(1) the name and contact information of the licence holder and the licence number;
(2) the proposed name of the well;
(3) the classification of the well determined according to Schedule 1;
(4) the type of drilling installation;
(5) the name of the drilling installation, its registration number, the name of its owner and the estimated number of persons on board;
(6) the name and contact information of the engineer responsible for the permanent well or reservoir closure and site restoration plan;
(7) the name, profession and functions of the persons who prepared or revised the plan;
(8) a description of the immobilization system;
(9) if applicable, the home port and the location of the land base for storing material and products necessary for the work;
(10) a bathymetric map of the area in which the well is located;
(11) the method used to demonstrate that, prior to the permanent closure of the well or reservoir, no emanation at the surface vent has been observed over a period of 24 hours and no gas migration;
(12) a chronological and detailed description of the work to be carried out;
(13) the work schedule;
(14) a broken down estimate of the cost of the work;
(15) a description of the condition of the well including, in particular, the cemented, perforated and open-hole depths;
(16) the cement evaluation method to show the uniform coverage of the cement behind the casing before the work;
(17) the type of service rig and equipment to be used and their specifications;
(18) a lateral section of the well indicating, in particular,
(a) the technical elements;
(b) the depth intervals that will be protected or isolated; and
(c) the geological formations including, in particular,
i. the usable groundwater;
ii. the thermal anomalies;
iii. the coal beds exceeding 300 mm in thickness;
iv. the formations that can potentially produce petroleum and those that produce petroleum;
v. the layers of abnormal pressure;
vi. the areas of circulation loss; and
vii. the permeable and porous areas having an effective porosity greater than 3% in a terrigenous bedrock and greater than 1% in a carbonate bedrock;
(19) the method for cleaning the well used before the installation of the plugs;
(20) the type of plugs used and the depth intervals of each plug;
(21) a cementing program complying with the Industry Recommended Practice, IRP: #25, Primary Cementing, published by the Drilling and Completions Committee indicating, in particular,
(a) for each cement plug, the type of cement used, its density, its additives and their proportions, its setting time, the calculated volume and surplus percentage;
(b) the method for installing the plugs;
(c) if applicable, any required changes to the cement used for the plugs due to specific physical and chemical conditions of the environment, including, in particular, the depth of the well, a horizontal well, an abnormal pressure or temperature, a salt area or a corrosive environment; and
(d) the nature of the fluid used to fill the space between each plug;
(22) the method used to demonstrate that following the installation of the plugs and before the cutting of the casings at the surface, there was no gas emanation;
(23) a plan showing the extent of the activity site;
(24) the list of equipment and facilities to be removed from the work site; and
(25) a chronological and detailed description of the restoration work to maintain the quality of the body of water and minimize impact on wildlife including, in particular,
(a) the procedure for dismantling installations and, if applicable, the procedure for dismantling the supply cable;
(b) the rehabilitation of contaminated land;
(c) the purge of pipes; and
(d) the withdrawal of equipment and facilities.
If certain elements required in the first paragraph are unknown when the holder submits the plan to the Minister in accordance with section 101 of the Act, those elements will have to be provided when the plan is revised.
O.C. 1251-2018, s. 289; I.N. 2018-09-12.
In force: 2018-09-20
289. The permanent well or reservoir closure and site restoration plan must be signed and sealed by an engineer and must contain, in particular,
(1) the name and contact information of the licence holder and the licence number;
(2) the proposed name of the well;
(3) the classification of the well determined according to Schedule 1;
(4) the type of drilling installation;
(5) the name of the drilling installation, its registration number, the name of its owner and the estimated number of persons on board;
(6) the name and contact information of the engineer responsible for the permanent well or reservoir closure and site restoration plan;
(7) the name, profession and functions of the persons who prepared or revised the plan;
(8) a description of the immobilization system;
(9) if applicable, the home port and the location of the land base for storing material and products necessary for the work;
(10) a bathymetric map of the area in which the well is located;
(11) the method used to demonstrate that, prior to the permanent closure of the well or reservoir, no emanation at the surface vent has been observed over a period of 24 hours and no gas migration;
(12) a chronological and detailed description of the work to be carried out;
(13) the work schedule;
(14) a broken down estimate of the cost of the work;
(15) a description of the condition of the well including, in particular, the cemented, perforated and open-hole depths;
(16) the cement evaluation method to show the uniform coverage of the cement behind the casing before the work;
(17) the type of service rig and equipment to be used and their specifications;
(18) a lateral section of the well indicating, in particular,
(a) the technical elements;
(b) the depth intervals that will be protected or isolated; and
(c) the geological formations including, in particular,
i. the usable groundwater;
ii. the thermal anomalies;
iii. the coal beds exceeding 300 mm in thickness;
iv. the formations that can potentially produce petroleum and those that produce petroleum;
v. the layers of abnormal pressure;
vi. the areas of circulation loss; and
vii. the permeable and porous areas having an effective porosity greater than 3% in a terrigenous bedrock and greater than 1% in a carbonate bedrock;
(19) the method for cleaning the well used before the installation of the plugs;
(20) the type of plugs used and the depth intervals of each plug;
(21) a cementing program complying with the Industry Recommended Practice, IRP: #25, Primary Cementing, published by the Drilling and Completions Committee indicating, in particular,
(a) for each cement plug, the type of cement used, its density, its additives and their proportions, its setting time, the calculated volume and surplus percentage;
(b) the method for installing the plugs;
(c) if applicable, any required changes to the cement used for the plugs due to specific physical and chemical conditions of the environment, including, in particular, the depth of the well, a horizontal well, an abnormal pressure or temperature, a salt area or a corrosive environment; and
(d) the nature of the fluid used to fill the space between each plug;
(22) the method used to demonstrate that following the installation of the plugs and before the cutting of the casings at the surface, there was no gas emanation;
(23) a plan showing the extent of the activity site;
(24) the list of equipment and facilities to be removed from the work site; and
(25) a chronological and detailed description of the restoration work to maintain the quality of the body of water and minimize impact on wildlife including, in particular,
(a) the procedure for dismantling installations and, if applicable, the procedure for dismantling the supply cable;
(b) the rehabilitation of contaminated land;
(c) the purge of pipes; and
(d) the withdrawal of equipment and facilities.
If certain elements required in the first paragraph are unknown when the holder submits the plan to the Minister in accordance with section 101 of the Act, those elements will have to be provided when the plan is revised.
O.C. 1251-2018, s. 289; I.N. 2018-09-12.
| 2021-04-23T11:56:57 |
{"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.8157275915145874, "perplexity": 5868.081732055494}, "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/1618039617701.99/warc/CC-MAIN-20210423101141-20210423131141-00149.warc.gz"}
|
https://par.nsf.gov/biblio/10189547-constraining-properties-neutron-star-merger-outflows-radio-observations
|
Constraining properties of neutron star merger outflows with radio observations
ABSTRACT The jet opening angle and inclination of GW170817 – the first detected binary neutron star merger – were vital to understand its energetics, relation to short gamma-ray bursts, and refinement of the standard siren-based determination of the Hubble constant, H0. These basic quantities were determined through a combination of the radio light curve and Very Long Baseline Interferometry (VLBI) measurements of proper motion. In this paper, we discuss and quantify the prospects for the use of radio VLBI observations and observations of scintillation-induced variability to measure the source size and proper motion of merger afterglows, and thereby infer properties of the merger including inclination angle, opening angle, and energetics. We show that these techniques are complementary as they probe different parts of the circum-merger density/inclination angle parameter space and different periods of the temporal evolution of the afterglow. We also find that while VLBI observations will be limited to the very closest events it will be possible to detect scintillation for a large fraction of events beyond the range of current gravitational wave detectors. Scintillation will also be detectable with next-generation telescopes such as the Square Kilometre Array, 2000 antenna Deep Synoptic Array, and the next-generation Very Large Array, more »
Authors:
; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10189547
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
494
Issue:
2
Page Range or eLocation-ID:
2449 to 2464
ISSN:
0035-8711
The association of GRB170817A with a binary neutron star (BNS) merger has revealed that BNSs produce at least a fraction of short gamma-ray bursts (SGRBs). As gravitational wave (GW) detectors push their horizons, it is important to assess coupled electromagnetic (EM)/GW probabilities and maximize observational prospects. Here, we perform BNS population synthesis calculations with the code mobse, seeding the binaries in galaxies at three representative redshifts, $z$ = 0.01, 0.1, and 1 of the Illustris TNG50 simulation. The binaries are evolved and their locations numerically tracked in the host galactic potentials until merger. Adopting the microphysics parameters of GRB170817A, we numerically compute the broad-band light curves of jets from BNS mergers, with the afterglow brightness dependent on the local medium density at the merger site. We perform Monte Carlo simulations of the resulting EM population assuming either a random viewing angle with respect to the jet, or a jet aligned with the orbital angular momentum of the binary, which biases the viewing angle probability for GW-triggered events. We find a gamma-ray detection probability of $\sim\!2{{\rm per\ cent}},10{{\rm per\ cent}},\mathrm{and}\ 40{{\rm per\ cent}}$ for BNSs at $z$ = 1, 0.1, and 0.01, respectively, for the random case, rising to $\sim\!75{{\rm per\ cent}}$more »
| 2022-12-07T17:54: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": 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.8359503149986267, "perplexity": 2122.8189426938916}, "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-49/segments/1669446711200.6/warc/CC-MAIN-20221207153419-20221207183419-00354.warc.gz"}
|
http://pdglive.lbl.gov/DataBlock.action?node=S067D13
|
# (C) Other neutrino mixing results
The LSND collaboration reported in AGUILAR 2001 a signal which is consistent with ${{\overline{\mathit \nu}}_{{\mu}}}$ $\rightarrow$ ${{\overline{\mathit \nu}}_{{e}}}$ oscillations. In a three neutrino framework, this would be a measurement of $\theta _{12}$ and $\Delta \mathit m{}^{2}_{21}$. This does not appear to be consistent with most of the other neutrino data. The MiniBooNE experiment, reported in AGUILAR-AREVALO 2007 , does a two-neutrino analysis which, assuming $\mathit CP$ conservation, rules out AGUILAR 2001 . However, the MiniBooNE antineutrino data reported in AGUILAR-AREVALO 2013A are consistent with the signal reported in AGUILAR 2001 . The following listings include results which might be relevant towards understanding these observations. They include searches for ${{\mathit \nu}_{{\mu}}}$ $\rightarrow$ ${{\mathit \nu}_{{e}}}$ , ${{\overline{\mathit \nu}}_{{\mu}}}$ $\rightarrow$ ${{\overline{\mathit \nu}}_{{e}}}$ , sterile neutrino oscillations, and $\mathit CPT$ violation.
# $\Delta \boldsymbol m{}^{2}$ for sin$^2(2{}\theta )$ = 1 ( ${{\boldsymbol \nu}_{{\mu}}}$ ( ${{\overline{\boldsymbol \nu}}_{{\mu}}}$ ) $\rightarrow$ ${{\boldsymbol \nu}_{{e}}}$ ( ${{\overline{\boldsymbol \nu}}_{{e}}}$ )) INSPIRE search
VALUE (eV${}^{2}$) CL% DOCUMENT ID TECN COMMENT
$\bf{<0.075}$ 90
1992
CNTR BNL E776
• • • We do not use the following data for averages, fits, limits, etc. • • •
$<1.6$ 90 1
1997
CCFR FNAL
1 ROMOSAN 1997 uses wideband beam with a $0.5~$km decay region.
References:
ROMOSAN 1997
PRL 78 2912 A High Statistics Search for ${{\mathit \nu}_{{\mu}}}$ (${{\overline{\mathit \nu}}_{{\mu}}}$) $\rightarrow$ ${{\mathit \nu}_{{e}}}$ (${{\overline{\mathit \nu}}_{{e}}}$) Oscillations in the Small Mixing Angle Regime
BORODOVSKY 1992
PRL 68 274 Search for ${{\mathit \nu}_{{\mu}}}$ Oscillations ${{\mathit \nu}_{{\mu}}}$ $\rightarrow$ ${{\mathit \nu}_{{e}}}$( ${{\overline{\mathit \nu}}_{{\mu}}}$ $\rightarrow$ ${{\overline{\mathit \nu}}_{{e}}}$) in a Wide Band Neutrino Beam
| 2019-01-18T15:40: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": 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.9291066527366638, "perplexity": 2916.5881025729655}, "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-04/segments/1547583660175.18/warc/CC-MAIN-20190118151716-20190118173716-00178.warc.gz"}
|
https://mooseframework.inl.gov/source/materials/PorousFlowPorosity.html
|
# PorousFlowPorosity
This Material calculates the porosity PorousFlow simulations
This Material computes porosity (at the nodes or quadpoints, depending on the at_nodes flag): (1) A full description is provided in the porosity documentation
Flags provided to PorousFlowPorosity control its evolution.
• If mechanical = true then the porosity will depend on . Otherwise that term in Eq. (1) is ignored.
• If fluid = true then the porosity will depend on . Otherwise that term in Eq. (1) is ignored.
• If thermal = true then the porosity will depend on . Otherwise that term in Eq. (1) is ignored.
• If chemical = true then porosity will depend on . Otherwise that term in Eq. (1) is ignored.
## Input Parameters
• PorousFlowDictatorThe UserObject that holds the list of PorousFlow variable names
C++ Type:UserObjectName
Options:
Description:The UserObject that holds the list of PorousFlow variable names
• porosity_zeroThe porosity at zero volumetric strain and reference temperature and reference effective porepressure and reference chemistry. This must be a real number or a constant monomial variable (not a linear lagrange or other type of variable)
C++ Type:std::vector
Options:
Description:The porosity at zero volumetric strain and reference temperature and reference effective porepressure and reference chemistry. This must be a real number or a constant monomial variable (not a linear lagrange or other type of variable)
### Required Parameters
Default:False
C++ Type:bool
Options:
• computeTrueWhen false, MOOSE will not call compute methods on this material. The user must call computeProperties() after retrieving the Material via MaterialPropertyInterface::getMaterial(). Non-computed Materials are not sorted for dependencies.
Default:True
C++ Type:bool
Options:
Description:When false, MOOSE will not call compute methods on this material. The user must call computeProperties() after retrieving the Material via MaterialPropertyInterface::getMaterial(). Non-computed Materials are not sorted for dependencies.
• solid_bulkBulk modulus of the drained porous solid skeleton (only used if fluid=true)
C++ Type:double
Options:
Description:Bulk modulus of the drained porous solid skeleton (only used if fluid=true)
• reference_chemistryReference values of the solid mineral concentrations (m^3(precipitate)/m^3(porous material)), entered as a vector (one value per mineral). (Only used if chemical=true)
C++ Type:std::vector
Options:
Description:Reference values of the solid mineral concentrations (m^3(precipitate)/m^3(porous material)), entered as a vector (one value per mineral). (Only used if chemical=true)
• strain_at_nearest_qpFalseWhen calculating nodal porosity that depends on strain, use the strain at the nearest quadpoint. This adds a small extra computational burden, and is not necessary for simulations involving only linear lagrange elements. If you set this to true, you will also want to set the same parameter to true for related Kernels and Materials
Default:False
C++ Type:bool
Options:
Description:When calculating nodal porosity that depends on strain, use the strain at the nearest quadpoint. This adds a small extra computational burden, and is not necessary for simulations involving only linear lagrange elements. If you set this to true, you will also want to set the same parameter to true for related Kernels and Materials
• initial_mineral_concentrationsInitial mineral concentrations (m^3(precipitate)/m^3(porous material)), entered as a vector (one value per mineral). (Only used if chemical=true)
C++ Type:std::vector
Options:
Description:Initial mineral concentrations (m^3(precipitate)/m^3(porous material)), entered as a vector (one value per mineral). (Only used if chemical=true)
• ensure_positiveTrueModify the usual exponential relationships that governs porosity so that porosity is always positive
Default:True
C++ Type:bool
Options:
Description:Modify the usual exponential relationships that governs porosity so that porosity is always positive
• thermal_expansion_coeffVolumetric thermal expansion coefficient of the drained porous solid skeleton (only used if thermal=true)
C++ Type:double
Options:
Description:Volumetric thermal expansion coefficient of the drained porous solid skeleton (only used if thermal=true)
• fluidFalseIf true, porosity will be a function of effective porepressure
Default:False
C++ Type:bool
Options:
Description:If true, porosity will be a function of effective porepressure
• reference_temperatureReference temperature (only used if thermal=true)
C++ Type:std::vector
Options:
Description:Reference temperature (only used if thermal=true)
• chemicalFalseIf true, porosity will be a function of precipitate
Default:False
C++ Type:bool
Options:
Description:If true, porosity will be a function of precipitate
• thermalFalseIf true, porosity will be a function of temperature
Default:False
C++ Type:bool
Options:
Description:If true, porosity will be a function of temperature
• mechanicalFalseIf true, porosity will be a function of total volumetric strain
Default:False
C++ Type:bool
Options:
Description:If true, porosity will be a function of total volumetric strain
• boundaryThe list of boundary IDs from the mesh where this boundary condition applies
C++ Type:std::vector
Options:
Description:The list of boundary IDs from the mesh where this boundary condition applies
• chemical_weightsWhen chemical=true, porosity is a linear combination of the solid mineral concentrations multiplied by these weights. Default=1 for all minerals.
C++ Type:std::vector
Options:
Description:When chemical=true, porosity is a linear combination of the solid mineral concentrations multiplied by these weights. Default=1 for all minerals.
• biot_coefficient1Biot coefficient
Default:1
C++ Type:double
Options:
Description:Biot coefficient
• reference_porepressureReference porepressure (only used if fluid=true)
C++ Type:std::vector
Options:
Description:Reference porepressure (only used if fluid=true)
• blockThe list of block ids (SubdomainID) that this object will be applied
C++ Type:std::vector
Options:
Description:The list of block ids (SubdomainID) that this object will be applied
### Optional Parameters
• enableTrueSet the enabled status of the MooseObject.
Default:True
C++ Type:bool
Options:
Description:Set the enabled status of the MooseObject.
• use_displaced_meshFalseWhether or not this object should use the displaced mesh for computation. Note that in the case this is true but no displacements are provided in the Mesh block the undisplaced mesh will still be used.
Default:False
C++ Type:bool
Options:
Description:Whether or not this object should use the displaced mesh for computation. Note that in the case this is true but no displacements are provided in the Mesh block the undisplaced mesh will still be used.
• control_tagsAdds user-defined labels for accessing object parameters via control logic.
C++ Type:std::vector
Options:
Description:Adds user-defined labels for accessing object parameters via control logic.
• seed0The seed for the master random number generator
Default:0
C++ Type:unsigned int
Options:
Description:The seed for the master random number generator
• implicitTrueDetermines whether this object is calculated using an implicit or explicit form
Default:True
C++ Type:bool
Options:
Description:Determines whether this object is calculated using an implicit or explicit form
• constant_onNONEWhen ELEMENT, MOOSE will only call computeQpProperties() for the 0th quadrature point, and then copy that value to the other qps.When SUBDOMAIN, MOOSE will only call computeSubdomainProperties() for the 0th quadrature point, and then copy that value to the other qps. Evaluations on element qps will be skipped
Default:NONE
C++ Type:MooseEnum
Options:NONE ELEMENT SUBDOMAIN
Description:When ELEMENT, MOOSE will only call computeQpProperties() for the 0th quadrature point, and then copy that value to the other qps.When SUBDOMAIN, MOOSE will only call computeSubdomainProperties() for the 0th quadrature point, and then copy that value to the other qps. Evaluations on element qps will be skipped
• output_propertiesList of material properties, from this material, to output (outputs must also be defined to an output type)
C++ Type:std::vector
Options:
Description:List of material properties, from this material, to output (outputs must also be defined to an output type)
• outputsnone Vector of output names were you would like to restrict the output of variables(s) associated with this object
Default:none
C++ Type:std::vector
Options:
Description:Vector of output names were you would like to restrict the output of variables(s) associated with this object
| 2019-02-20T03:14: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": 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.34058675169944763, "perplexity": 5422.2233973047905}, "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-00618.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Abreiman.leo
|
zbMATH — the first resource for mathematics
Breiman, Leo
Compute Distance To:
Author ID: breiman.leo Published as: Breiman, L.; Breiman, Leo External Links: MGP · Math-Net.Ru · Wikidata · dblp · GND
Documents Indexed: 62 Publications since 1957, including 6 Books Biographic References: 9 Publications
all top 5
Co-Authors
43 single-authored 4 Blackwell, David Harold 4 Friedman, Jerome Harold 3 Thomasian, A. J. 2 Cutler, Adele 2 Meisel, William S. 2 Stone, Charles Joel 1 Bell, C. B. 1 Bickel, Peter John 1 Blashfield, Roger K. 1 Dunn, Olive Jean 1 Freedman, David A. 1 Gnanadesikan, Ramanathan 1 Kooperberg, Charles 1 Le Cam, Lucien Marie 1 Olshen, Richard Allen 1 Peters, Steve 1 Purcell, Edward 1 Schwartz, Lorraine 1 Tsur, Yacov 1 Wurtele, Zivia S. 1 Zemel, Amos
all top 5
Serials
16 Annals of Mathematical Statistics 6 Machine Learning 4 The Annals of Statistics 4 Journal of the American Statistical Association 4 Technometrics 2 The Annals of Probability 2 Statistical Science 1 IEEE Transactions on Information Theory 1 Teoriya Veroyatnosteĭ i eë Primeneniya 1 Illinois Journal of Mathematics 1 International Statistical Review 1 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 1 Journal of the Royal Statistical Society. Series B 1 Journal of Statistical Computation and Simulation 1 Computational Statistics and Data Analysis 1 Mathematical Programming. Series A. Series B 1 Naval Research Logistics Quarterly 1 Bulletin de l’Institut International de Statistique 1 Classics in Applied Mathematics
all top 5
Fields
25 Statistics (62-XX) 9 Probability theory and stochastic processes (60-XX) 7 Computer science (68-XX) 3 Operations research, mathematical programming (90-XX) 2 Numerical analysis (65-XX) 2 Information and communication theory, circuits (94-XX)
Citations contained in zbMATH
59 Publications have been cited 4,389 times in 3,526 Documents Cited by Year
Classification and regression trees. Zbl 0541.62042
Breiman, Leo; Friedman, Jerome H.; Olshen, Richard A.; Stone, Charles J.
1984
Random forests. Zbl 1007.68152
Breiman, Leo
2001
Bagging predictors. Zbl 0858.68080
Breiman, Leo
1996
Probability. Zbl 0174.48801
Breiman, Leo
1968
Estimating optimal transformations for multiple regression and correlation. Zbl 0594.62044
Breiman, Leo; Friedman, Jerome H.
1985
Heuristics of instability and stabilization in model selection. Zbl 0867.62055
Breiman, Leo
1996
On some limit theorems similar to the arc-sin law. Zbl 0147.37004
Breiman, L.
1965
Better subset regression using the nonnegative garrote. Zbl 0862.62059
Breiman, Leo
1995
Arcing classifiers. (With discussion). Zbl 0934.62064
Breiman, Leo
1998
Probability. Zbl 0753.60001
Breiman, Leo
1992
Statistical modeling: The two cultures. (With comments and a rejoinder). Zbl 1059.62505
Breiman, Leo
2001
Optimal gambling systems for favorable games. Zbl 0109.36803
Breiman, L.
1961
Variable kernel estimates of multivariate densities. Zbl 0379.62023
Breiman, Leo; Meisel, William; Purcell, Edward
1977
Stacked regressions. Zbl 0849.68104
Breiman, Leo
1996
Predicting multivariate responses in multiple linear regression. Zbl 0897.62068
Breiman, Leo; Friedman, Jerome H.
1997
Hinging hyperplanes for regression, classification, and function approximation. Zbl 0793.62031
Breiman, Leo
1993
The individual ergodic theorem of information theory. Zbl 0078.31801
Breiman, Leo
1957
A deterministic algorithm for global optimization. Zbl 0807.90103
Breiman, Leo; Cutler, Adele
1993
Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test. Zbl 0502.62045
Bickel, Peter J.; Breiman, Leo
1983
The little bootstrap and other methods for dimensionality selection in regression: X-fixed prediction error. Zbl 0850.62518
Breiman, Leo
1992
The strong law of large numbers for a class of Markov chains. Zbl 0104.11901
Breiman, Leo
1960
Archetypal analysis. Zbl 0804.62002
Cutler, Adele; Breiman, Leo
1994
How many variables should be entered in a regression equation? Zbl 0513.62068
Breiman, L.; Freedman, D.
1983
Using iterated bagging to debias regressions. Zbl 1052.68109
Breiman, Leo
2001
Discriminant analysis and clustering. Panel on discriminant analysis, classification, and clustering. Zbl 0955.62588
Gnanadesikan, Ramanathan; Blashfield, Roger K.; Breiman, Leo; Dunn, Olive J.; Friedman, Jerome H.
1989
Technical note: Some properties of splitting criteria. Zbl 0849.68095
Breiman, Leo
1996
Robust confidence bounds for extreme upper quantiles. Zbl 0775.62117
Breiman, Leo; Stone, Charles J.; Kooperberg, Charles
1990
The $$\Pi$$ method for estimating multivariate functions from noisy data. (With discussion). Zbl 0742.62037
Breiman, Leo
1991
On the tail behavior of sums of independent random variables. Zbl 0339.60050
Breiman, Leo
1967
Investment policies for expanding businesses optimal in a longrun sense. Zbl 0114.12401
Breiman, L.
1960
Population theory for boosting ensembles. Zbl 1105.62308
Breiman, Leo
2004
A delicate law of the iterated logarithm for non-decreasing stable processes. Zbl 0192.55401
Breiman, L.
1969
The capacities of certain channel classes under random coding. Zbl 0119.13805
Blackwell, D.; Breiman, L.; Thomasian, A. J.
1960
Probability and stochastic processes: With a view toward applications. Zbl 0246.60033
Breiman, Leo
1969
First exit times from a square root boundary. Zbl 0241.60035
Breiman, Leo
1967
The capacity of a class of channels. Zbl 0104.11604
Blackwell, David; Breiman, Leo; Thomasian, A. J.
1959
Fitting additive models to regression data. Diagnostics and alternative views. Zbl 0937.62613
Breiman, Leo
1993
Consistent estimates and zero-one sets. Zbl 0223.62029
Breiman, Leo; Le Cam, Lucien; Schwartz, Lorraine
1964
On achieving channel capacity in finite-memory channels. Zbl 0094.12605
Breiman, Leo
1960
Stopping-rule problems. Zbl 0192.25605
Breiman, L.
1964
Randomizing outputs to increase prediction accuracy. Zbl 0962.68143
Breiman, Leo
2000
The Poisson tendency in traffic distribution. Zbl 0117.13701
Breiman, L.
1963
Correction to ”The individual ergodic theorem of information theory”. Zbl 0092.34001
Breiman, Leo
1960
Statistics: With a view toward applications. Zbl 0289.62001
Breiman, Leo
1973
Comparing automatic smoothers (a public service enterprise). Zbl 0775.62089
Breiman, Leo; Peters, Steve
1992
On some probability distributions occurring in traffic flow. Zbl 0115.13404
Breiman, L.
1962
General estimates of the intrinsic variability of data in nonlinear regression models. Zbl 0336.62069
Breiman, L.; Meisel, W. S.
1976
Correction to ’A delicate law of the iterated logarithm for non- decreasing stable processes’. Zbl 0207.48601
Breiman, L.
1970
On the completeness of order statistics. Zbl 0101.12201
Bell, C. B.; Blackwell, David; Breiman, Leo
1960
Convergence properties of a learning algorithm. Zbl 0125.09904
Breiman, L.; Wurtele, Z. S.
1964
Proof of Shannon’s transmission theorem for finite-state indecomposable channels. Zbl 0096.10901
Blackwell, David; Breiman, Leo; Thomasian, A. J.
1958
Combining predictors. Zbl 0932.68073
Breiman, L.
1999
On a simple estimation procedure for censored regression models with known error distributions. Zbl 0790.62026
Breiman, Leo; Tsur, Yacov; Zemel, Amos
1993
Transient atomic Markov chains with a denumerable number of states. Zbl 0087.13503
Breiman, Leo
1958
On transient Markov chains with application to the uniqueness problem for Markov processes. Zbl 0078.31703
Breiman, Leo
1957
Bias-variance, regularization, instability and stabilization. Zbl 0927.62069
Breiman, Leo
1999
Nail finders, edifices, and Oz. Zbl 1373.62019
Breiman, Leo
1985
A note on minimax filtering. Zbl 0265.60042
Breiman, Leo
1973
An elementary theorem concerning stationary ergodic processes. Zbl 0107.34804
Breiman, L.
1958
Population theory for boosting ensembles. Zbl 1105.62308
Breiman, Leo
2004
Random forests. Zbl 1007.68152
Breiman, Leo
2001
Statistical modeling: The two cultures. (With comments and a rejoinder). Zbl 1059.62505
Breiman, Leo
2001
Using iterated bagging to debias regressions. Zbl 1052.68109
Breiman, Leo
2001
Randomizing outputs to increase prediction accuracy. Zbl 0962.68143
Breiman, Leo
2000
Combining predictors. Zbl 0932.68073
Breiman, L.
1999
Bias-variance, regularization, instability and stabilization. Zbl 0927.62069
Breiman, Leo
1999
Arcing classifiers. (With discussion). Zbl 0934.62064
Breiman, Leo
1998
Predicting multivariate responses in multiple linear regression. Zbl 0897.62068
Breiman, Leo; Friedman, Jerome H.
1997
Bagging predictors. Zbl 0858.68080
Breiman, Leo
1996
Heuristics of instability and stabilization in model selection. Zbl 0867.62055
Breiman, Leo
1996
Stacked regressions. Zbl 0849.68104
Breiman, Leo
1996
Technical note: Some properties of splitting criteria. Zbl 0849.68095
Breiman, Leo
1996
Better subset regression using the nonnegative garrote. Zbl 0862.62059
Breiman, Leo
1995
Archetypal analysis. Zbl 0804.62002
Cutler, Adele; Breiman, Leo
1994
Hinging hyperplanes for regression, classification, and function approximation. Zbl 0793.62031
Breiman, Leo
1993
A deterministic algorithm for global optimization. Zbl 0807.90103
Breiman, Leo; Cutler, Adele
1993
Fitting additive models to regression data. Diagnostics and alternative views. Zbl 0937.62613
Breiman, Leo
1993
On a simple estimation procedure for censored regression models with known error distributions. Zbl 0790.62026
Breiman, Leo; Tsur, Yacov; Zemel, Amos
1993
Probability. Zbl 0753.60001
Breiman, Leo
1992
The little bootstrap and other methods for dimensionality selection in regression: X-fixed prediction error. Zbl 0850.62518
Breiman, Leo
1992
Comparing automatic smoothers (a public service enterprise). Zbl 0775.62089
Breiman, Leo; Peters, Steve
1992
The $$\Pi$$ method for estimating multivariate functions from noisy data. (With discussion). Zbl 0742.62037
Breiman, Leo
1991
Robust confidence bounds for extreme upper quantiles. Zbl 0775.62117
Breiman, Leo; Stone, Charles J.; Kooperberg, Charles
1990
Discriminant analysis and clustering. Panel on discriminant analysis, classification, and clustering. Zbl 0955.62588
Gnanadesikan, Ramanathan; Blashfield, Roger K.; Breiman, Leo; Dunn, Olive J.; Friedman, Jerome H.
1989
Estimating optimal transformations for multiple regression and correlation. Zbl 0594.62044
Breiman, Leo; Friedman, Jerome H.
1985
Nail finders, edifices, and Oz. Zbl 1373.62019
Breiman, Leo
1985
Classification and regression trees. Zbl 0541.62042
Breiman, Leo; Friedman, Jerome H.; Olshen, Richard A.; Stone, Charles J.
1984
Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test. Zbl 0502.62045
Bickel, Peter J.; Breiman, Leo
1983
How many variables should be entered in a regression equation? Zbl 0513.62068
Breiman, L.; Freedman, D.
1983
Variable kernel estimates of multivariate densities. Zbl 0379.62023
Breiman, Leo; Meisel, William; Purcell, Edward
1977
General estimates of the intrinsic variability of data in nonlinear regression models. Zbl 0336.62069
Breiman, L.; Meisel, W. S.
1976
Statistics: With a view toward applications. Zbl 0289.62001
Breiman, Leo
1973
A note on minimax filtering. Zbl 0265.60042
Breiman, Leo
1973
Correction to ’A delicate law of the iterated logarithm for non- decreasing stable processes’. Zbl 0207.48601
Breiman, L.
1970
A delicate law of the iterated logarithm for non-decreasing stable processes. Zbl 0192.55401
Breiman, L.
1969
Probability and stochastic processes: With a view toward applications. Zbl 0246.60033
Breiman, Leo
1969
Probability. Zbl 0174.48801
Breiman, Leo
1968
On the tail behavior of sums of independent random variables. Zbl 0339.60050
Breiman, Leo
1967
First exit times from a square root boundary. Zbl 0241.60035
Breiman, Leo
1967
On some limit theorems similar to the arc-sin law. Zbl 0147.37004
Breiman, L.
1965
Consistent estimates and zero-one sets. Zbl 0223.62029
Breiman, Leo; Le Cam, Lucien; Schwartz, Lorraine
1964
Stopping-rule problems. Zbl 0192.25605
Breiman, L.
1964
Convergence properties of a learning algorithm. Zbl 0125.09904
Breiman, L.; Wurtele, Z. S.
1964
The Poisson tendency in traffic distribution. Zbl 0117.13701
Breiman, L.
1963
On some probability distributions occurring in traffic flow. Zbl 0115.13404
Breiman, L.
1962
Optimal gambling systems for favorable games. Zbl 0109.36803
Breiman, L.
1961
The strong law of large numbers for a class of Markov chains. Zbl 0104.11901
Breiman, Leo
1960
Investment policies for expanding businesses optimal in a longrun sense. Zbl 0114.12401
Breiman, L.
1960
The capacities of certain channel classes under random coding. Zbl 0119.13805
Blackwell, D.; Breiman, L.; Thomasian, A. J.
1960
On achieving channel capacity in finite-memory channels. Zbl 0094.12605
Breiman, Leo
1960
Correction to ”The individual ergodic theorem of information theory”. Zbl 0092.34001
Breiman, Leo
1960
On the completeness of order statistics. Zbl 0101.12201
Bell, C. B.; Blackwell, David; Breiman, Leo
1960
The capacity of a class of channels. Zbl 0104.11604
Blackwell, David; Breiman, Leo; Thomasian, A. J.
1959
Proof of Shannon’s transmission theorem for finite-state indecomposable channels. Zbl 0096.10901
Blackwell, David; Breiman, Leo; Thomasian, A. J.
1958
Transient atomic Markov chains with a denumerable number of states. Zbl 0087.13503
Breiman, Leo
1958
An elementary theorem concerning stationary ergodic processes. Zbl 0107.34804
Breiman, L.
1958
The individual ergodic theorem of information theory. Zbl 0078.31801
Breiman, Leo
1957
On transient Markov chains with application to the uniqueness problem for Markov processes. Zbl 0078.31703
Breiman, Leo
1957
all top 5
Cited by 6,466 Authors
22 Bühlmann, Peter 19 Mikosch, Thomas 13 Biau, Gérard 13 Boche, Holger 13 Hothorn, Torsten 13 Ishwaran, Hemant 12 Hall, Peter Gavin 12 Larocque, Denis 11 Sergeev, Yaroslav Dmitrievich 11 Tutz, Gerhard E. 11 Zopounidis, Constantin 10 Davis, Richard A. 10 Hashorva, Enkelejd 10 Lausen, Berthold 10 Resnick, Sidney Ira 10 Yang, Weiguo 10 Yang, Yuhong 10 Zou, Hui 9 Boulesteix, Anne-Laure Isabeau 9 Kim, Yongdai 9 Schmid, Matthias 9 Siciliano, Roberta 9 Tang, Qihe 9 Zhang, Chunxia 8 Chi, Zhiyi 8 Ciampi, Antonio 8 Evstigneev, Igor V. 8 Fan, Jianqing 8 Li, Jinzhu 8 Marron, James Stephen 8 Meinshausen, Nicolai 8 Scornet, Erwan 8 Shih, Yu-Shan 8 Yu, Bin 8 Yuan, Ming 7 Horváth, Lajos 7 Kim, Hea-Jung 7 Koo, Ja-Yong 7 Li, Runze 7 Nötzel, Janis 7 Pakes, Anthony G. 7 Runger, George C. 7 Sauerbrei, Willi 7 Schenk-Hoppé, Klaus Reiner 7 Su, Xiaogang 7 Tibshirani, Robert John 7 Wang, Shuning 7 Zhang, Jiangshe 7 Ziemba, William T. 6 Abellán, Joaquín 6 Berger, Moritz 6 Bickel, Peter John 6 Cai, Minglai 6 Conversano, Claudio 6 Doumpos, Michael 6 Džeroski, Sašo 6 Fan, Juanjuan 6 Friedman, Jerome Harold 6 Györfi, László 6 Hand, David J. 6 Hens, Thorsten 6 Kohler, Michael 6 Liu, Yufeng 6 Ma, Shuangge 6 Mojirsheibani, Majid 6 Mola, Francesco 6 Peng, Heng 6 Rosset, Saharon 6 Samorodnitsky, Gennady Pinkhosovich 6 Schumacher, Martin 6 Strobl, Carolin 6 Van den Poel, Dirk 6 Van der Laan, Mark Johannes 6 Wang, Qihua 6 Woodroofe, Michael Barrett 6 Yang, Jing 6 You, Jinhong 6 Zeileis, Achim 6 Zhang, Hao Helen 6 Zhang, Riquan 6 Zhu, Ji 6 Zwart, Bert P. 5 Adler, Werner 5 Ahn, Hongshik 5 Antoniadis, Anestis 5 Bellavance, François 5 Bertsimas, Dimitris John 5 Binder, Harald 5 Breiman, Leo 5 Chakraborty, Sounak 5 Clémençon, Stéphan 5 D’Ambrosio, Antonio 5 Donoho, David Leigh 5 Dunson, David Brian 5 Elouedi, Zied 5 George, Edward I. 5 Ghosh, Anil Kumar 5 Gijbels, Irène 5 Girard, Stéphane 5 Hapfelmeier, Alexander ...and 6,366 more Authors
all top 5
Cited in 442 Serials
254 Computational Statistics and Data Analysis 121 The Annals of Statistics 97 Pattern Recognition 88 Stochastic Processes and their Applications 87 European Journal of Operational Research 86 Machine Learning 83 Journal of Statistical Planning and Inference 82 Journal of Multivariate Analysis 82 Statistics & Probability Letters 69 The Annals of Applied Statistics 60 Computational Statistics 49 Statistical Science 46 Journal of Statistical Computation and Simulation 43 Information Sciences 41 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 41 Communications in Statistics. Theory and Methods 36 Journal of the American Statistical Association 33 Journal of Econometrics 33 Electronic Journal of Statistics 32 Annals of the Institute of Statistical Mathematics 32 The Annals of Probability 32 Journal of Applied Statistics 32 Advances in Data Analysis and Classification. ADAC 32 Statistical Analysis and Data Mining 31 Biometrics 31 Statistics and Computing 29 Transactions of the American Mathematical Society 29 The Annals of Applied Probability 28 Bernoulli 27 Journal of Applied Probability 27 Data Mining and Knowledge Discovery 26 Journal of Classification 26 Neural Networks 26 Journal of Theoretical Biology 25 Insurance Mathematics & Economics 25 Annals of Operations Research 25 Communications in Statistics. Simulation and Computation 24 Journal of Mathematical Analysis and Applications 24 Automatica 24 Computational & Mathematical Methods in Medicine 23 Computers & Operations Research 23 International Journal of Approximate Reasoning 22 Artificial Intelligence 21 Probability Theory and Related Fields 21 Neural Computation 20 Biometrical Journal 20 Fuzzy Sets and Systems 20 Journal of Global Optimization 20 Test 20 Extremes 19 Journal of Economic Theory 19 Journal of Machine Learning Research (JMLR) 18 Advances in Applied Probability 18 The Canadian Journal of Statistics 18 Psychometrika 17 Mathematical and Computer Modelling 17 Journal of Nonparametric Statistics 16 Proceedings of the American Mathematical Society 15 Computers & Mathematics with Applications 15 Journal of Computational and Applied Mathematics 15 Journal of the Royal Statistical Society. Series B. Statistical Methodology 14 Journal of Theoretical Probability 14 Mathematical Problems in Engineering 14 Journal of the Korean Statistical Society 13 Journal of Mathematical Economics 12 Journal of Statistical Physics 12 Statistical Modelling 12 Computational Biology and Chemistry 11 Mathematical Biosciences 11 Journal of Mathematical Psychology 11 Quantitative Finance 10 Journal of Optimization Theory and Applications 10 Theoretical Computer Science 10 Journal of Economic Dynamics & Control 10 Annales de l’Institut Henri Poincaré. Probabilités et Statistiques 10 European Series in Applied and Industrial Mathematics (ESAIM): Probability and Statistics 9 Journal of Computer and System Sciences 9 Automation and Remote Control 9 Annals of Mathematics and Artificial Intelligence 9 International Journal of Applied Mathematics and Computer Science 9 Statistical Methods and Applications 9 Statistical Methodology 9 Algorithms 8 Metrika 8 Applied Mathematics and Computation 8 Kybernetika 8 Physica D 8 Queueing Systems 8 International Journal of Computer Vision 8 Econometric Theory 8 Applied Stochastic Models in Business and Industry 8 Scandinavian Actuarial Journal 8 Statistics Surveys 8 Journal of Probability and Statistics 7 Computational Optimization and Applications 7 Statistical Papers 7 Australian & New Zealand Journal of Statistics 7 International Journal of Theoretical and Applied Finance 7 Journal of Systems Science and Complexity 7 Journal of Agricultural, Biological, and Environmental Statistics ...and 342 more Serials
all top 5
Cited in 53 Fields
2,014 Statistics (62-XX) 867 Computer science (68-XX) 659 Probability theory and stochastic processes (60-XX) 364 Numerical analysis (65-XX) 341 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 278 Operations research, mathematical programming (90-XX) 221 Biology and other natural sciences (92-XX) 99 Information and communication theory, circuits (94-XX) 92 Systems theory; control (93-XX) 54 Dynamical systems and ergodic theory (37-XX) 48 Combinatorics (05-XX) 36 Measure and integration (28-XX) 27 Geophysics (86-XX) 26 Statistical mechanics, structure of matter (82-XX) 24 Quantum theory (81-XX) 23 Functional analysis (46-XX) 19 History and biography (01-XX) 19 Partial differential equations (35-XX) 19 Harmonic analysis on Euclidean spaces (42-XX) 18 Fluid mechanics (76-XX) 14 Approximations and expansions (41-XX) 14 Calculus of variations and optimal control; optimization (49-XX) 13 Linear and multilinear algebra; matrix theory (15-XX) 12 Operator theory (47-XX) 11 Mathematical logic and foundations (03-XX) 10 General and overarching topics; collections (00-XX) 10 Mechanics of deformable solids (74-XX) 8 Number theory (11-XX) 8 Real functions (26-XX) 6 Classical thermodynamics, heat transfer (80-XX) 5 Topological groups, Lie groups (22-XX) 5 Astronomy and astrophysics (85-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 4 Global analysis, analysis on manifolds (58-XX) 3 Group theory and generalizations (20-XX) 3 Special functions (33-XX) 3 Ordinary differential equations (34-XX) 3 Difference and functional equations (39-XX) 3 Abstract harmonic analysis (43-XX) 2 Potential theory (31-XX) 2 Integral equations (45-XX) 2 Convex and discrete geometry (52-XX) 2 Differential geometry (53-XX) 2 General topology (54-XX) 2 Mechanics of particles and systems (70-XX) 2 Mathematics education (97-XX) 1 Field theory and polynomials (12-XX) 1 Commutative algebra (13-XX) 1 Functions of a complex variable (30-XX) 1 Sequences, series, summability (40-XX) 1 Algebraic topology (55-XX) 1 Manifolds and cell complexes (57-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.
| 2021-03-01T07:54: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": 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.5091012716293335, "perplexity": 7129.995382683967}, "config": {"markdown_headings": false, "markdown_code": false, "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-10/segments/1614178362133.53/warc/CC-MAIN-20210301060310-20210301090310-00270.warc.gz"}
|
https://data.gov.scot/environment/technicalhub.html
|
# Technical Information Hub
Last updated: 26 October 2022
This hub signposts to pages with further technical information about the design of indicators, data sources, links to more detailed monitoring information and plans for future indicator development.
Click below to access technical information on the indicators for each outcome:
## Selection Criteria
The following criteria were used to guide the selection of indicators. These draw on international best practice and discussions with stakeholders, and map closely to the criteria used to select National Indicators in the National Performance Framework.
• Relevance: There must be a clear relationship between the indicator and Environment Strategy outcome.
• Validity: The indicator must measure what it is supposed to measure.
• Distinctiveness: The indicator must not measure something already captured under other indicators.
• Practicality: The indicator must provide value for money and it must be feasible and affordable to obtain data.
• Clarity: The indicator must be straightforward to interpret by the intended audience. It must clearly communicate the measure that it is trying to assess.
• Credibility: The indicator must be based upon impartial, reliable data that is precise enough to show change over time.
• Public interest: Indicators must be engaging and relevant for members of the public.
$$~$$
| 2023-01-30T13:39: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": 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.4017713963985443, "perplexity": 2905.4787993756327}, "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/1674764499819.32/warc/CC-MAIN-20230130133622-20230130163622-00415.warc.gz"}
|
https://www.federalreserve.gov/econres/notes/ifdp-notes/what-equity-markets-said-about-brexit-related-costs-to-us-banks-20180202.htm
|
February 02, 2018
### What Equity Markets Said about Brexit-related Costs to U.S. Banks
Nicholas Coleman, Friederike Niepmann, and Stefan Walz1
On June 23, 2016, the United Kingdom voted to leave the European Union. This event, known as "Brexit," has increased uncertainty about the prospects of the British economy and its financial services industry. Brexit may also weigh on the performance of the U.S. financial sector for at least two broad reasons. First, the London subsidiaries of U.S. banks may lose access to the EU single market. Many U.S. banks use their London subsidiaries to serve clients in EU member states. They are able to do so because EU regulations allow banks that are licensed in one EU member state to establish branches and conduct banking business in other EU member states. To continue to serve these clients, the banks may have to shift part of their operations and relocate staff to the remaining member states, which is costly. In addition, they may need to employ more complex business models, and, if EU and U.K. regulations diverge, may face higher compliance costs, both of which may weigh on bank profitability over time. Second, U.S. banks' lending to residents of the United Kingdom may become less profitable if the U.K. economy weakens as a result of the vote and a departure from the EU. In this note, we use data on stock prices and betting market odds of Brexit for the period leading to and including the vote to estimate the magnitude of markets-implied costs of Brexit for U.S. banks.
It is important to understand the limitations of the estimated magnitude of the markets-implied costs. First, the estimate is based only on the information set that participants in the equity and betting markets had up to the day of the vote. Therefore, the estimate does not include any information revealed after the vote. For example, in the immediate aftermath of the vote, the U.K. economy had been more resilient than market participants predicted. Because we use stock price movements prior to the vote, the estimate may reflect a more pessimistic view of the U.K. economy. In a similar vein, market participants held certain beliefs about a post-Brexit trade regime, which may or may not turn out to be accurate. For example, if market participants believed that the United Kingdom would lose access to the EU single market, but it ultimately does not, then again the estimate might reflect a more pessimistic view. Second, our analysis assumes that stock price movements reflect market participants' views of the underlying profitability of U.S. banks and is not driven by, for example, speculation or short-covering. Third, our analysis takes as given that betting market odds are an acceptable metric of equity market participants' view of the probability of Brexit. In some recent instances, the referendum outcomes that were indicated by betting market odds did not materialize, in part, because the odds, reflecting the view of the betting market participants, do not necessarily reflect the general views of the voting population. With these caveats strongly emphasized, the econometric analysis suggests that, ahead of the Brexit vote, the markets-implied cost of Brexit for large U.S. banks ranged from $35 billion to$52 billion, about 3 percent to 4 percent of the banks' stock market capitalization on the day of the vote.
U.S. bank activity in the United Kingdom
U.S. banks have sizable U.K. operations, which serve customers in the United Kingdom, other EU countries, and non-EU countries. Figure 1 shows the exposures of U.S. banks in the United Kingdom using data from the FFIEC 009 Country Exposure Reports. Claims of U.S. banks on U.K. counterparties are greater than on any other single foreign country, making up roughly 14 percent of their foreign claims, as shown to the left. The sectoral breakdown of claims (on the right) highlights the variety of different activities that U.S. banks conduct in the United Kingdom. That said, most of the activity is wholesale business concentrated in the financial sector: More than half of total claims are on financial corporations, of which nonbank financial corporations command a large share.
Not only are U.S. banks' U.K. operations large, they are also complex. U.S. banks have around 1,000 branches and subsidiaries in the United Kingdom (as of end-March 2017), with subsidiaries specializing in various business segments including banking, insurance, securities, trust, and other activities. The ownership structure of these entities can also be complex: The average U.K. entity owned by a U.S. bank has more than five tiers of ownership below the "headquarters" level.2
##### Figure 1: U.S. banks in the United Kingdom
Estimating the cost of Brexit: Data and preliminary evidence
Because of the breadth and complexity of U.S. banks' U.K. operations, Brexit will likely affect the banks through a variety of channels, with implications for banks' geographic and legal organization, their business opportunities, and cost efficiencies. Estimating the cost of Brexit for U.S. banks is a difficult task given the uncertainty about the terms and will obviously be most accurate once the exact terms of Brexit are known. However, stock market data allow us to gauge investors' assessment of the expected cost of Brexit under the assumptions highlighted earlier. We combine changes in U.S. bank stock prices—which many consider to be a sufficient statistic for changes in a bank's future profitability—with data on the odds of Brexit derived from betting markets, a proxy for investors' assessment of the probability of a vote for Brexit. Specifically, we estimate the elasticity of bank stock prices to changes in the odds of Brexit and then infer equity investors' assessment of the expected cost of Brexit from the estimated elasticity.
Admittedly, the betting markets were wrong about the Brexit vote, but market participants' beliefs were likely aligned with betting markets. These markets correctly predicted the outcome of the 2014 Scottish independence referendum and vastly outperformed polls then, which added to their credibility. Betting markets are seen as superior to polls because, among other reasons, these markets ask participants to assess the probability of an outcome rather than simply their preferred outcome, and betting market participants internalize the polling data when placing their bets.
Illustrating developments from early 2016 to the declaration of the referendum results, figure 2 plots the betting odds of Brexit (left scale) and the U.S. bank stock price index (right scale) over this period. Betting markets gave a vote for Brexit roughly between an 18 percent to 37 percent chance of succeeding in the month leading up to the vote. Also, there appears to be a negative correlation between the betting odds of a vote for Brexit and stock prices of U.S. banks, a link that forms the basis of our empirical analysis.
##### Figure 2: Betting odds of a vote for Brexit and U.S. bank stock prices
Another way to visualize the correlation between stock price changes and changes in the Brexit odds is shown in figure 3. The figure plots the average stock price of U.S. banks on days when the Brexit odds increased versus days when the Brexit odds decreased, normalizing the stock price on the day before to one. Note that U.S. banks are split into two groups, according to the size of their claims on U.K. residents. One group consists of banks with above-median U.K. exposures, while the other consists of U.S. banks with below-median U.K. exposures.3 The figure shows, first, that U.S. bank stock prices decreased (increased) on days when the odds of Brexit increased (decreased). Second, banks with larger U.K. exposures, indicated by the blue bars, were slightly more responsive to changes in the Brexit odds than banks with smaller U.K. exposures, represented by the orange bars. Thus investors assessed Brexit to negatively affect U.S. banks' future profitability with somewhat larger effects for banks with more extensive U.K. exposures.4 To quantify by how much investors expected U.S. bank profits to fall as a result of Brexit, we use regression analysis, relying on techniques frequently used in the academic finance literature.
##### Figure 3: Average changes in U.S. bank stock prices and changes in Brexit odds
Estimating the cost of Brexit: Formal methodology
We estimate the elasticity of U.S. bank stock prices to changes in the betting odds. The elasticity provides the percentage change in U.S. bank stock prices given a certain change in the odds of Brexit. This elasticity can then be used to obtain an estimate of the expected cost to large U.S. banks from Brexit, as perceived by equity investors.
We start by estimating the following regression equation:
$\Delta stock price_{bt}=\gamma _{1}\Delta Brexit odds_{t}+\alpha_{b}+\epsilon _{bt},$
where $\Delta stock price_{bt}$ is the excess return of bank b's stock from day t-1 to t, and $\Delta Brexit odds_{t}$ is the change in the Brexit odds from day t-1 to t. Excess returns reflect bank stock price changes that cannot be explained by the stock's typical co-movement with the S&P 500 index. To control for a bank-specific time trend, we include bank-fixed effects.
Because we expect banks with larger U.K. operations to be more affected, we allow for differences in the elasticity across banks with differently sized U.K. exposures by including an interaction term between changes in the Brexit odds and different proxies for the significance of a bank's U.K. operations. This second regression equation is as follows:
$\Delta stock price_{bt}=\gamma _{1}\Delta Brexit odds_{t}+\gamma_{2}(\Delta Brexit odds_{t}\times U.K. operations_{b})+\alpha_{b}+\epsilon _{bt}.$
Our sample covers 22 U.S. bank holding companies and large commercial banks over the period from mid-May 2015 to late June 2016 and has 4,298 observations. When the interaction term between changes in the odds of Brexit and a bank's U.K. operations is included in the regression, the sample shrinks to 18 banks and 3,658 observations due to data availability.5
Estimating the cost of Brexit: Results
The regression results indicate that a 10 percentage point increase in the Brexit odds led to a change in stock returns in the range of negative 0.3 basis points to negative 0.54 basis points, with larger declines for banks with more extensive U.K. operations (for details on the regression results, see the appendix).6 Based on these regression results, we can estimate the markets-implied cost of Brexit to banks in our sample. Brexit represented an increase of the odds from 0 to 100 percent and implied an estimated decline in banks' stock prices by 3.6 percentage points based on the regression results without the interaction term. To obtain the estimated dollar decline in profits that market participants attributed to Brexit, we take 3.6 percent of the stock market capitalization of the 18 large U.S. banks in our sample at the referendum date. The result is an estimated $43 billion decline in market value due to the belief of market participants that banks will have lower profitability because of Brexit. Taking into account differences in the effect across banks with varying U.K. operations, the estimated markets-implied decline in profits from Brexit for U.S. banks increases to roughly$46 billion. This amount is economically significant and corresponds to 38 percent of the banks' 2016 net income, although any decline in profits would not occur all in a single year, but would be spread over many years.
Conclusion
We use data on stock prices and betting market odds of Brexit for the period leading to and including the vote to estimate the magnitude of the markets-implied costs of Brexit for U.S. banks. These markets-implied costs appear to lie in the $35 billion to$52 billion range.7 The methodology and the estimate itself are subject to significant limitations. For example, the estimate is based only on the information set that participants in the equity and betting markets had at the time of the vote. How close this estimate will be to the actual cost to U.S. banks heavily depends upon the outcome of the Brexit negotiations and the resilience of the U.K. economy.
##### Appendix: Regression results
baseline (1) U.K. exp share, total (2) U.K. exp share, xborder (3) U.K. exp share, local (4) share U.K. entities (5) share U.K. subs (6) share U.K. branches (7) log # U.K. entities (8) log # U.K. subs (9) log # U.K. branches (10) -0.0362*** (0.00267) -0.0299*** (0.00579) -0.0386*** (0.00523) -0.0308*** (0.00561) -0.0416*** (0.00665) -0.0433*** (0.00642) -0.0392*** (0.00519) -0.0184* (0.0102) -0.0178* (0.00973) -0.0347*** (0.00649) 0.00628 (0.0459) 0.00502 (0.00667) -0.0126 (0.0451) -0.00790 (0.0113) -0.00608 -0.00831 -0.0340 (0.0950) 0.00145 (0.00476) 0.00110 (0.00448) -0.274** (0.111) 0.0113 (0.0134) -0.244** (0.113) 0.0294 (0.0217) 0.0291* (0.0168) 0.0277 (0.0277) -0.00555** (0.00272) -0.00591** (0.00264) -0.00165 (0.00889) 4,474 3,658 3,658 3,658 3,637 3,229 3,637 2,638 2,638 1,829 0.023 0.029 0.028 0.029 0.029 0.031 0.029 0.030 0.030 0.032
Note: This table shows the regression results from estimating the elasticity of U.S. banks' stock price changes to changes in the Brexit odds. The dependent variable reflects U.S. banks' excess returns computed as the residual from a regression of stock price changes on the S&P 500 index from 5/13/15 to 12/21/2015. Standard errors are robust in all columns and clustered by time in column (1). Bank-fixed effects are included but not reported. Columns (2) to (10) include interactions between the change in the Brexit odds and different measures of U.S. banks' U.K. operations. The following measures are used. Column (2): a bank's share of U.K. exposures in its total exposures (U.S. + foreign exposures). Column (3): a bank's share of cross-border exposures in the U.K. in total exposures. Column (4): a bank's share of local exposures (through branches and subsidiaries) in the U.K. in total exposures. Column (5): a bank's share of U.K. entities in total foreign entities. Column (6): a bank's share of UK subsidiaries in total foreign subsidiaries. Column (7): a bank's share of UK branches in total foreign branches. Column (8): the log number of a bank's U.K. entities. Column (9): the log number of a bank's U.K. subsidiaries. Column (10): the log number of a bank's U.K. branches.
1. Nicholas Coleman is a Senior Economist and Friederike Niepmann a Principal Economist in the Global Financial Institutions section in the Division of International Finance at the Federal Reserve Board. Stefan Walz is a Master student at Colombia University and former Research Analyst in the Global Financial Institutions section in the Division of International Finance at the Federal Reserve Board. Return to text
2. Information on the organizational structure of U.S. banks is from the National Information Center. Return to text
3. The sample of banks included in figure 3 differs slightly from that included in the stock price index in figure 2. Return to text
4. The regression analysis shows that differences in the response to changes in the betting odds across U.S. banks with different sizes of U.K. operations are statistically significant (see appendix table). Return to text
5. This reduction is because our preferred measure of a bank's U.K. operations, the share of its U.K. exposures to its total exposures, is not available for all banks. Return to text
6. This range follows from the estimates in column 2 of the appendix table together with the banks' U.K. exposures. Return to text
7. The $35 billion to$52 billion range follows from the 5 percent confidence interval around the point estimate of -0.0362. Return to text
| 2019-01-16T01:47: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": 3, "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.327266126871109, "perplexity": 3185.4300344008366}, "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-04/segments/1547583656577.40/warc/CC-MAIN-20190116011131-20190116033131-00215.warc.gz"}
|
https://par.nsf.gov/biblio/10340203-plastic-laminate-antireflective-coatings-millimeter-wave-optics-bicep-array
|
Plastic Laminate Antireflective Coatings for Millimeter-wave Optics in BICEP Array
The BICEP/Keck series of experiments target the Cosmic Microwave Background at degree-scale resolution from the South Pole. Over the next few years, the "Stage-3" BICEP Array (BA) telescope will improve the program's frequency coverage and sensitivity to primordial B-mode polarization by an order of magnitude. The first receiver in the array, BA1, began observing at 30/40 GHz in early 2020. The next two receivers, BA2 and BA3, are currently being assembled and will map the southern sky at frequencies ranging from 95 GHz to 150 GHz. Common to all BA receivers is a refractive, on-axis, cryogenic optical design that focuses microwave radiation onto a focal plane populated with antenna-coupled bolometers. High-performance antireflective coatings up to 760 mm in aperture are needed for each element in the optical chain, and must withstand repeated thermal cycles down to 4 K. Here we present the design and fabrication of the 30/40 GHz anti-reflection coatings for the recently deployed BA1 receiver, then discuss laboratory measurements of their reflectance. We review the lamination method for these single- and dual-layer plastic coatings with indices matched to various polyethylene, nylon and alumina optics. We also describe ongoing efforts to optimize coatings for the next BA cryostats, which more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10340203
Journal Name:
Journal of low temperature physics
ISSN:
1573-7357
National Science Foundation
##### More Like this
1. The BICEP/Keck Collaboration is currently leading the quest to the highest sensitivity measurements of the polarized CMB anisotropies on degree scale with a series of cryogenic telescopes, of which BICEP Array is the latest Stage-3 upgrade with a total of ∼32,000 detectors. The instrument comprises 4 receivers spanning 30 to 270 GHz, with the low-frequency 30/40 GHz deployed to the South Pole Station in late 2019. The full complement of receivers is forecast to set the most stringent constraints on the tensor to scalar ratio r. Building on these advances, the overarching small-aperture telescope concept is already being used as the reference for further Stage-4 experiment design. In this paper I will present the development of the BICEP Array 150 GHz detector module and its fabrication requirements, with highlights on the high-density time division multiplexing (TDM) design of the cryogenic circuit boards. The low-impedance wiring required between the detectors and the first-stage SQUID amplifiers is crucial to maintain a stiff voltage bias on the detectors. A novel multi-layer FR4 Printed Circuit Board (PCB) with superconducting traces, capable of reading out up to 648 detectors, is presented along with its validation tests. I will also describe an ultra-high density TDM detectormore »
2. Abstract
The Cosmology Large Angular Scale Surveyor (CLASS) observes the polarized cosmic microwave background (CMB) over the angular scales of 1° ≲θ≤ 90° with the aim of characterizing primordial gravitational waves and cosmic reionization. We report on the on-sky performance of the CLASSQ-band (40 GHz),W-band (90 GHz), and dichroicG-band (150/220 GHz) receivers that have been operational at the CLASS site in the Atacama desert since 2016 June, 2018 May, and 2019 September, respectively. We show that the noise-equivalent power measured by the detectors matches the expected noise model based on on-sky optical loading and lab-measured detector parameters. Using Moon, Venus, and Jupiter observations, we obtain power to antenna temperature calibrations and optical efficiencies for the telescopes. From the CMB survey data, we compute instantaneous array noise-equivalent-temperature sensitivities of 22, 19, 23, and 71$μKcmbs$for the 40, 90, 150, and 220 GHz frequency bands, respectively. These noise temperatures refer to white noise amplitudes, which contribute to sky maps at all angular scales. Future papers will assess additional noise sources impacting larger angular scales.
3. We present the design and performance of broadband and tunable infrared-blocking filters for millimeter and submillimeter astronomy composed of small scattering particles embedded in an aerogel substrate. The ultralow-density (typically$<<#comment/>150mg/cm3$) aerogel substrate provides an index of refraction as low as 1.05, removing the need for antireflection coatings and allowing for broadband operation from DC to above 1 THz. The size distribution of the scattering particles can be tuned to provide a variable cutoff frequency. Aerogel filters with embedded high-resistivity silicon powder are being produced at 40 cm diameter to enable large-aperture cryogenic receivers for cosmic microwave background polarimeters, which require large arrays of sub-Kelvin detectors in their search for the signature of an inflationary gravitational-wave background.
4. Abstract
We report on the design and performance of the Bicep3instrument and its first three-year data set collected from 2016 to 2018. Bicep3is a 52 cm aperture refracting telescope designed to observe the polarization of the cosmic microwave background (CMB) on degree angular scales at 95 GHz. It started science observation at the South Pole in 2016 with 2400 antenna-coupled transition-edge sensor bolometers. The receiver first demonstrated new technologies such as large-diameter alumina optics, Zotefoam infrared filters, and flux-activated SQUIDs, allowing ∼10× higher optical throughput compared to theKeckdesign. Bicep3achieved instrument noise equivalent temperatures of 9.2, 6.8, and 7.1$μKCMBs$and reached StokesQandUmap depths of 5.9, 4.4, and 4.4μK arcmin in 2016, 2017, and 2018, respectively. The combined three-year data set achieved a polarization map depth of 2.8μK arcmin over an effective area of 585 square degrees, which is the deepest CMB polarization map made to date at 95 GHz.
5. Abstract
We present early results from the CO Mapping Array Project (COMAP) Galactic Plane Survey conducted between 2019 June and 2021 April, spanning 20° << 40° in Galactic longitude and ∣b∣ < 1.°5 in Galactic latitude with an angular resolution of 4.′5. We present initial results from the first part of the survey, including the diffuse emission and spectral energy distributions of Hiiregions and supernova remnants (SNRs). Using low- and high-frequency surveys to constrain free–free and thermal dust emission contributions, we find evidence of excess flux density at 30 GHz in six regions, which we interpret as anomalous microwave emission. Furthermore we model ultracompact Hiicontributions using data from the 5 GHz CORNISH catalog and reject these as the cause of the 30 GHz excess. Six known SNRs are detected at 30 GHz, and we measure spectral indices consistent with the literature or show evidence of steepening. The flux density of the SNR W44 at 30 GHz is consistent with a power-law extrapolation from lower frequencies with no indication of spectral steepening in contrast with recent results from the Sardinia Radio Telescope. We also extract five hydrogen radio recombination lines (RRLs) to map the warm ionized gas, which can be usedmore »
| 2023-03-22T14:12:09 |
{"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.4704253673553467, "perplexity": 3696.7327011278435}, "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/1679296943809.76/warc/CC-MAIN-20230322114226-20230322144226-00236.warc.gz"}
|
https://par.nsf.gov/biblio/10368928-massive-central-galaxies-galaxy-groups-romulus-simulations-overview-galaxy-properties
|
Massive central galaxies of galaxy groups in the Romulus simulations: an overview of galaxy properties at z = 0
ABSTRACT
Contrary to many stereotypes about massive galaxies, observed brightest group galaxies (BGGs) are diverse in their star formation rates, kinematic properties, and morphologies. Studying how they evolve into and express such diverse characteristics is an important piece of the galaxy formation puzzle. We use a high-resolution cosmological suite of simulations Romulus and compare simulated central galaxies in group-scale haloes at z = 0 to observed BGGs. The comparison encompasses the stellar mass–halo mass relation, various kinematic properties and scaling relations, morphologies, and the star formation rates. Generally, we find that Romulus reproduces the full spectrum of diversity in the properties of the BGGs very well, albeit with a tendency toward lower than the observed fraction of quenched BGGs. We find both early-type S0 and elliptical galaxies as well as late-type disc galaxies; we find Romulus galaxies that are fast-rotators as well as slow-rotators; and we observe galaxies transforming from late-type to early-type following strong dynamical interactions with satellites. We also carry out case studies of selected Romulus galaxies to explore the link between their properties, and the recent evolution of the stellar system as well as the surrounding intragroup/circumgalactic medium. In general, mergers/strong interactions quench star-forming activity and disrupt the more »
Authors:
; ; ; ; ; ; ; ;
Publication Date:
NSF-PAR ID:
10368928
Journal Name:
Monthly Notices of the Royal Astronomical Society
Volume:
515
Issue:
1
Page Range or eLocation-ID:
p. 22-47
ISSN:
0035-8711
Publisher:
Oxford University Press
1. ABSTRACT The kinematic morphology–density relation of galaxies is normally attributed to a changing distribution of galaxy stellar masses with the local environment. However, earlier studies were largely focused on slow rotators; the dynamical properties of the overall population in relation to environment have received less attention. We use the SAMI Galaxy Survey to investigate the dynamical properties of ∼1800 early and late-type galaxies with log (M⋆/M⊙) > 9.5 as a function of mean environmental overdensity (Σ5) and their rank within a group or cluster. By classifying galaxies into fast and slow rotators, at fixed stellar mass above log (M⋆/M⊙) > 10.5, we detect a higher fraction (∼3.4σ) of slow rotators for group and cluster centrals and satellites as compared to isolated-central galaxies. We find similar results when using Σ5 as a tracer for environment. Focusing on the fast-rotator population, we also detect a significant correlation between galaxy kinematics and their stellar mass as well as the environment they are in. Specifically, by using inclination-corrected or intrinsic $\lambda _{R_{\rm {e}}}$ values, we find that, at fixed mass, satellite galaxies on average have the lowest $\lambda _{\, R_{\rm {e}},\rm {intr}}$, isolated-central galaxies have the highest $\lambda _{\, R_{\rm {e}},\rm {intr}}$, and group and clustermore »
5. ABSTRACT We examine the 1.4 GHz radio luminosities of galaxies arising from star formation and active galactic nuclei (AGNs) within the state-of-the-art cosmological hydrodynamic simulation Simba. Simba grows black holes via gravitational torque limited accretion from cold gas and Bondi accretion from hot gas, and employs AGN feedback including jets at low Eddington ratios. We define a population of radio loud AGNs (RLAGNs) based on the presence of ongoing jet feedback. Within RLAGN, we define high and low excitation radio galaxies (HERGs and LERGs) based on their dominant mode of black hole accretion: torque limited accretion representing feeding from a cold disc, or Bondi representing advection-dominated accretion from a hot medium. Simba predicts good agreement with the observed radio luminosity function (RLF) and its evolution, overall as well as separately for HERGs and LERGs. Quiescent galaxies with AGN-dominated radio flux dominate the RLF at $\gtrsim 10^{22-23}$ W Hz−1, while star formation dominates at lower radio powers. Overall, RLAGNs have higher black hole accretion rates and lower star formation rates than non-RLAGN at a given stellar mass or velocity dispersion, but have similar black hole masses. Simba predicts an LERG number density of 8.53 Mpc−3, ∼10× higher than for HERGs, broadly as observed. While LERGs dominate amongmore »
| 2023-01-29T13:55:07 |
{"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.6734728813171387, "perplexity": 4269.827439511836}, "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-06/segments/1674764499713.50/warc/CC-MAIN-20230129112153-20230129142153-00296.warc.gz"}
|
https://pos.sissa.it/364/257/
|
Volume 364 - European Physical Society Conference on High Energy Physics (EPS-HEP2019) - Flavour Physics and CP Violation
First measurements of the $\phi_3$-sensitive decay $B^{\pm} \to D(K_{\rm S}^0 \pi^+ \pi^- \pi^0) K^{\pm}$ with Belle
R. Pk
Full text: Not available
Abstract
The current experimental uncertainty on the CKM unitarity triangle angle $\phi_3$ is significantly larger than that on the standard model prediction. A more precise measurement of $\phi_3$ is crucial for testing the SM description of $CP$ violation and probing for new physics effects. The precision can be improved by exploring new $B$ and $D$ decay modes. The first model-independent measurement of the CKM angle $\phi_3$ using $B^{\pm} \to D(K_{\rm S}^0 \pi^+ \pi^- \pi^0) K^{\pm}$ decays is presented here. The GGSZ method is used by binning the five-dimensional phase space of the $D$ decay. This analysis uses the measurement of the average strong-phase differences across the phase space in $D\to K_{\rm S}^0 \pi^+ \pi^- \pi^0$ decays from CLEO-c, as input. The results are obtained from the full Belle data set with an integrated luminosity of 711 fb$^{-1}$ collected at the $\Upsilon(4S)$ resonance.
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-09-23T16:00: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.5589212775230408, "perplexity": 1275.392198240088}, "config": {"markdown_headings": false, "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-2020-40/segments/1600400211096.40/warc/CC-MAIN-20200923144247-20200923174247-00272.warc.gz"}
|
https://mooseframework.inl.gov/python/MooseDocs/extensions/autolink.html
|
Information and Tools
The AutoLink extension provide cross page automatic linking for markdown (*.md) files. This allows pages, such as those on this site, to link to each other by partial name. In the case of shortcut style linkes (see Shortcut links) heading content will also be include automatically.
The following table lists the available configuration options for the AutoLink extension.
Table 1: Configuration options for the AutoLink extension.
KeyDefaultDescription
activeTrueToggle for disabling the extension. This only changes the initial active state, use setActive to control at runtime.
The link within traditional markdown links (e.g., [text](link)) may include a markdown filename. The name must be unique, but may be incomplete. The entire page hieerachy is searched and filenames are compared using the python "endswith" method. Thus, the supplied name is considered unique if only one path from all possible paths ends with the supplied text, see Example 1.
Example 1: Example automatic link to another markdown page.
[Core](core.md)
Core
The markdown filename link also supports html bookmark style links, as shown in Example 2.
Example 2: Example of automatic link to another markdown page that includes an html bookmark.
[Core](core.md#shortcut-link)
Core
Markdown syntax includes syntax for creating shortcuts (see Shortcut links), within MooseDocs these are deemed "shortcut links." The AutoLink extension allows for markdown filenames to be used within a shortcut link. In this case the text from the first heading is used as the link text, as in Example 3.
Example 3: Example of a shortcut link that contains a markdown filename.
[core.md]
Core Extension
It is also possible to include html style bookmarks with the filename, depending on the configuration (see Table 1) the link text will include the name of the text within the bookmark and optionally the page heading, see Example 4.
Example 4: Example of a shortcut linke that contains a markdown file including an html style bookmark.
[core.md#shortcut-link]
[/Diffusion.C]
| 2019-02-19T20:56:23 |
{"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.3534441590309143, "perplexity": 4500.5706271720865}, "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-2019-09/segments/1550247492825.22/warc/CC-MAIN-20190219203410-20190219225410-00278.warc.gz"}
|
https://par.nsf.gov/biblio/10330872-alpine-alma-cii-survey-survey-strategy-observations-sample-properties-star-forming-galaxies
|
The ALPINE-ALMA [CII] survey: Survey strategy, observations, and sample properties of 118 star-forming galaxies at 4 < z < 6
The ALMA-ALPINE [CII] survey is aimed at characterizing the properties of a sample of normal star-forming galaxies (SFGs). The ALMA Large Program to INvestigate (ALPINE) features 118 galaxies observed in the [CII]-158 μ m line and far infrared (FIR) continuum emission during the period of rapid mass assembly, right after the end of the HI reionization, at redshifts of 4 < z < 6. We present the survey science goals, the observational strategy, and the sample selection of the 118 galaxies observed with ALMA, with an average beam minor axis of about 0.85″, or ∼5 kpc at the median redshift of the survey. The properties of the sample are described, including spectroscopic redshifts derived from the UV-rest frame, stellar masses, and star-formation rates obtained from a spectral energy distribution (SED) fitting. The observed properties derived from the ALMA data are presented and discussed in terms of the overall detection rate in [CII] and FIR continuum, with the observed signal-to-noise distribution. The sample is representative of the SFG population in the main sequence at these redshifts. The overall detection rate in [CII] is 64% for a signal-to-noise ratio (S/N) threshold larger than 3.5 corresponding to a 95% purity (40% detection rate more »
Authors:
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more »
Award ID(s):
Publication Date:
NSF-PAR ID:
10330872
Journal Name:
Astronomy & Astrophysics
Volume:
643
Page Range or eLocation-ID:
A1
ISSN:
0004-6361
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 »
| 2022-08-14T02:56: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": 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.6876460313796997, "perplexity": 4174.443353462934}, "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-33/segments/1659882571993.68/warc/CC-MAIN-20220814022847-20220814052847-00081.warc.gz"}
|
https://par.nsf.gov/biblio/10306638-surface-equilibration-mechanism-controls-molecular-packing-glassy-molecular-semiconductors-organic-interfaces
|
Surface equilibration mechanism controls the molecular packing of glassy molecular semiconductors at organic interfaces
Glasses prepared by physical vapor deposition (PVD) are anisotropic, and the average molecular orientation can be varied significantly by controlling the deposition conditions. While previous work has characterized the average structure of thick PVD glasses, most experiments are not sensitive to the structure near an underlying substrate or interface. Given the profound influence of the substrate on the growth of crystalline or liquid crystalline materials, an underlying substrate might be expected to substantially alter the structure of a PVD glass, and this near-interface structure is important for the function of organic electronic devices prepared by PVD, such as organic light-emitting diodes. To study molecular packing near buried organic–organic interfaces, we prepare superlattice structures (stacks of 5- or 10-nm layers) of organic semiconductors, Alq3 (Tris-(8-hydroxyquinoline)aluminum) and DSA-Ph (1,4-di-[4-(N,N-diphenyl)amino]styrylbenzene), using PVD. Superlattice structures significantly increase the fraction of the films near buried interfaces, thereby allowing for quantitative characterization of interfacial packing. Remarkably, both X-ray scattering and spectroscopic ellipsometry indicate that the substrate exerts a negligible influence on PVD glass structure. Thus, the surface equilibration mechanism previously advanced for thick films can successfully describe PVD glass structure even within the first monolayer of deposition on an organic substrate.
Authors:
; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10306638
Journal Name:
Proceedings of the National Academy of Sciences
Volume:
118
Issue:
42
Page Range or eLocation-ID:
Article No. e2111988118
ISSN:
0027-8424
Publisher:
Proceedings of the National Academy of Sciences
4. When aged below the glass transition temperature,$Tg$, the density of a glass cannot exceed that of the metastable supercooled liquid (SCL) state, unless crystals are nucleated. The only exception is when another polyamorphic SCL state exists, with a density higher than that of the ordinary SCL. Experimentally, such polyamorphic states and their corresponding liquid–liquid phase transitions have only been observed in network-forming systems or those with polymorphic crystalline states. In otherwise simple liquids, such phase transitions have not been observed, either in aged or vapor-deposited stable glasses, even near the Kauzmann temperature. Here, we report that the density of thin vapor-deposited films ofN,N′-bis(3-methylphenyl)-N,N′-diphenylbenzidine (TPD) can exceed their corresponding SCL density by as much as 3.5% and can even exceed the crystal density under certain deposition conditions. We identify a previously unidentified high-density supercooled liquid (HD-SCL) phase with a liquid–liquid phase transition temperature ($TLL$) ∼35 K below the nominal glass transition temperature of the ordinary SCL. The HD-SCL state is observed in glasses deposited in the thickness range of 25 to 55 nm, where thin films of the ordinary SCL have exceptionally enhanced surface mobility with large mobility gradients. The enhanced mobility enables vapor-depositedmore »
| 2023-01-27T07:50:47 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 2, "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.5399315357208252, "perplexity": 5057.0712134775085}, "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-06/segments/1674764494974.98/warc/CC-MAIN-20230127065356-20230127095356-00514.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Abalas.egon
|
# zbMATH — the first resource for mathematics
## Balas, Egon
Compute Distance To:
Author ID: balas.egon Published as: Balas, E.; Balas, Egon External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 169 Publications since 1960, including 7 Books Biographic References: 2 Publications
all top 5
#### Co-Authors
66 single-authored 12 Fischetti, Matteo 9 Hammer, Peter Ladislaw 6 Ceria, Sebastián 6 Padberg, Manfred W. 6 Zemel, Eitan 5 Cornuéjols, Gérard P. 4 Simonetti, Neil 4 Zanette, Arrigo 3 Kis, Tamás 3 Margot, François 3 Perregaard, Michael 3 Pulleyblank, William R. 3 Vazacopoulos, Alkis A. 3 Xue, Jue 2 Bonami, Pierre 2 de Souza, Cid Carvalho 2 Jeroslow, Robert G. 2 Mazzola, Joseph B. 2 Ng, Shu Ming 2 Niehaus, William 2 Oosten, Maarten 2 Pataki, Gábor 2 Qi, Liqun 2 Qualizza, Andrea 2 Saltzman, Matthew J. 2 Stephan, Rüdiger 2 Toth, Paolo 2 Yu, Changsung 1 Adams, Joseph Brian 1 Bergthaller, Christian 1 Bockmayr, Alexander 1 Bowman, V. Joseph jun. 1 Carr, Robert D. 1 Carrera, Maria C. 1 Christofides, Nicos 1 Chvátal, Vašek 1 Clausen, Jens 1 Dawande, Milind W. 1 Glover, Fred W. 1 Guignard, Monique 1 Gwan, Geena 1 Ho, Andrew C. 1 Kazachkov, Aleksandr M. 1 Lancia, Giuseppe G. 1 Landweer, Philip R. 1 Lenstra, Jan Karel 1 Martin, Clarence H. 1 Mihoc, Gheorghe 1 Miller, Donald L. 1 Nadarajah, Selvaprabu 1 Natraj, N. R. 1 Nauss, Robert M. 1 Nešetřil, Jaroslav 1 Pekny, Joseph F. 1 Pisaruk, Nicolai N. 1 Samuelsson, Haakon M. 1 Saxena, Anureet 1 Schmieta, Stefan 1 Serafini, Paolo 1 Serra, Thiago R. 1 Sommer, David 1 Tama, Joseph M. 1 Tind, Jørgen 1 Vazacopoulos, Alkiviadis 1 Wallace, Christopher 1 Wolsey, Laurence Alexander 1 Zawack, Daniel J. 1 Zoltners, Andris A.
all top 5
#### Serials
18 Mathematical Programming. Series A. Series B 16 Operations Research 7 Discrete Applied Mathematics 7 Networks 5 Management Science 5 Mathematical Programming 5 Discrete Optimization 4 Mathematics of Operations Research 4 Operations Research Letters 4 Annals of Operations Research 4 Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, Paris 4 Academia Republicii Populare Romîne, Studii Şi Cercetări Matematice 3 Mathematical Programming Study 3 SIAM Journal on Computing 3 SIAM Journal on Applied Mathematics 3 Management Science. Ser. A, Theory Series 3 Naval Research Logistics Quarterly 2 European Journal of Operational Research 2 INFORMS Journal on Computing 2 Journal of Combinatorial Optimization 2 Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, Série A 2 Mathematical Programming Computation 1 Discrete Mathematics 1 Revue Roumaine de Mathématiques Pures et Appliquées 1 Acta Mathematica Vietnamica 1 Journal of the Association for Computing Machinery 1 Journal of Computational and Applied Mathematics 1 Journal of Optimization Theory and Applications 1 RAIRO. Recherche Opérationnelle 1 Revue Belge de Statistique, d’Informatique et de Recherche Opérationnelle 1 SIAM Journal on Algebraic and Discrete Methods 1 Combinatorica 1 Algorithmica 1 SIAM Journal on Discrete Mathematics 1 Linear Algebra and its Applications 1 SIAM Review 1 Computational Optimization and Applications 1 Annals of Mathematics and Artificial Intelligence 1 Journal of Heuristics 1 Journal of Scheduling 1 Académie de la République Populaire Roumaine, Revue de Mathématiques Pures et Appliquées 1 Lecture Notes in Computer Science 1 EURO Journal on Computational Optimization
all top 5
#### Fields
134 Operations research, mathematical programming (90-XX) 28 Combinatorics (05-XX) 24 Convex and discrete geometry (52-XX) 12 Numerical analysis (65-XX) 12 Computer science (68-XX) 5 History and biography (01-XX) 2 Number theory (11-XX) 1 General and overarching topics; collections (00-XX) 1 Mathematical logic and foundations (03-XX)
#### Citations contained in zbMATH Open
137 Publications have been cited 3,713 times in 2,327 Documents Cited by Year
A lift-and-project cutting plane algorithm for mixed 0-1 programs. Zbl 0796.90041
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
1993
The shifting bottleneck procedure for job shop scheduling. Zbl 0637.90051
Adams, Joseph; Balas, Egon; Zawack, Daniel
1988
Disjunctive programming. Zbl 0409.90061
Balas, Egon
1979
An algorithm for large zero-one knapsack problems. Zbl 0449.90064
Balas, Egon; Zemel, Eitan
1980
Facets of the knapsack polytope. Zbl 0316.90046
Balas, Egon
1975
Disjunctive programming: Properties of the convex hull of feasible points. Zbl 0921.90118
Balas, Egon
1998
Intersection cuts - a new type of cutting planes for integer programming. Zbl 0219.90035
Balas, Egon
1971
Set partitioning: A survey. Zbl 0347.90064
1976
An additive algorithm for solving linear programs with zero-one variables. Zbl 0194.19903
Balas, E.
1965
The prize collecting traveling salesman problem. Zbl 0676.90089
Balas, Egon
1989
Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. Zbl 0592.90070
Balas, Egon
1985
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Zbl 0435.90074
Balas, Egon; Ho, Andrew
1980
Finding a maximum clique in an arbitrary graph. Zbl 0604.05024
Balas, Egon; Yu, Changsung
1986
Pivot and complement - a heuristic for 0-1 programming. Zbl 0442.90060
Balas, Egon; Martin, Clarence H.
1980
Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Zbl 0183.49404
Balas, Egon
1969
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Zbl 0880.90105
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
1996
Facets of the knapsack polytope from minimal covers. Zbl 0385.90083
Balas, Egon; Zemel, Eitan
1978
Canonical cuts on the unit hypercube. Zbl 0237.52004
Balas, Egon; Jeroslow, Robert
1972
Guided local search with shifting bottleneck for job shop scheduling. Zbl 0989.90057
Balas, Egon; Vazacopoulos, Alkis
1998
On graphs with polynomially solvable maximum-weight clique problem. Zbl 0661.05036
Balas, Egon; Yu, Chang Sung
1989
Gomory cuts revisited. Zbl 0865.90098
Balas, E.; Ceria, S.; Cornuéjols, G.; Natraj, N.
1996
A restricted Lagrangean approach to the traveling salesman problem. Zbl 0461.90068
Balas, Egon; Christofides, Nicos
1981
Optimizing over the split closure. Zbl 1135.90030
Balas, Egon; Saxena, Anureet
2008
An algorithm for the three-index assignment problem. Zbl 0743.90079
Balas, Egon; Saltzman, Matthew J.
1991
Strengthening cuts for mixed integer programs. Zbl 0439.90064
Balas, Egon; Jeroslow, Robert G.
1980
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. Zbl 1030.90068
Balas, Egon; Perregaard, Michael
2003
The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Zbl 0824.90076
Balas, Egon; Lenstra, Jan Karel; Vazacopoulos, Alkis
1995
The precedence-constrained asymmetric traveling salesman polytope. Zbl 0835.90109
Balas, Egon; Fischetti, Matteo; Pulleyblank, William R.
1995
On the set covering polytope. I: All the facets with coefficients in $$\{$$ 0,1,2$$\}$$. Zbl 0674.90079
Balas, Egon; Ng, Shu Ming
1989
Minimax and duality for linear and nonlinear mixed-integer programming. Zbl 0346.90071
Balas, E.
1970
Branch and bound methods. Zbl 0568.90068
Balas, E.; Toth, P.
1985
The perfectly matchable subgraph polytope of a bipartite graph. Zbl 0525.90069
Balas, Egon; Pulleyblank, William
1983
Disjunctive programming: Cutting planes from logical conditions. Zbl 0349.90117
Balas, Egon
1975
On the set-covering problem. Zbl 0254.90035
1972
Nonlinear 0-1 programming. I: Linearization techniques. Zbl 0553.90067
Balas, Egon; Mazzola, Joseph B.
1984
A dynamic subgradient-based branch-and-bound procedure for set covering. Zbl 0879.90155
Balas, Egon; Carrera, Maria C.
1996
Discrete programming by the filter method. Zbl 0153.21401
Balas, E.
1967
On the set-covering problem. II: An algorithm for set partitioning. Zbl 0324.90045
1975
Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. Zbl 1238.90126
Balas, Egon; Simonetti, Neil
2001
Facets of the three-index assignment polytope. Zbl 0723.90065
Balas, Egon; Saltzman, Matthew J.
1989
Lift-and-project for mixed 0-1 programming: recent progress. Zbl 1076.90031
Balas, Egon; Perregaard, Michael
2002
Octane: A new heuristic for pure 0-1 programs. Zbl 1163.90654
Balas, Egon; Ceria, Sebastián; Dawande, Milind; Margot, Francois; Pataki, Gábor
2001
The vertex separator problem: a polyhedral investigation. Zbl 1099.90065
Balas, Egon; de Souza, Cid C.
2005
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. Zbl 0722.68086
Balas, Egon; Xue, Jue
1991
Pivot and shift – a mixed integer programming heuristic. Zbl 1087.90052
Balas, Egon; Schmieta, Stefan; Wallace, Christopher
2004
On the facial structure of scheduling polyhedra. Zbl 0582.90053
Balas, Egon
1985
On the dimension of projected polyhedra. Zbl 0910.90234
Balas, Egon; Oosten, Maarten
1998
The perfectly matchable subgraph polytope of an arbitrary graph. Zbl 0723.05087
Balas, E.; Pulleyblank, W. R.
1989
Cutting planes from conditional bounds: A new approach to set covering. Zbl 0435.90073
Balas, Egon
1980
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets. Zbl 0780.90100
Balas, Egon; Fischetti, Matteo
1993
Nonlinear 0-1 programming. II: Dominance relations and algorithms. Zbl 0553.90068
Balas, Egon; Mazzola, Joseph B.
1984
Projection, lifting and extended formulation integer and combinatorial optimization. Zbl 1091.90041
Balas, Egon
2005
The vertex separator problem: algorithms and computations. Zbl 1099.90069
de Souza, Cid; Balas, Egon
2005
A parallel shortest augmenting path algorithm for the assignment problem. Zbl 0799.68111
Balas, Egon; Miller, Donald; Pekny, Joseph; Toth, Paolo
1991
The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. Zbl 0725.05053
Balas, Egon
1989
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Zbl 0846.68078
Balas, E.; Xue, Jue
1996
Job shop scheduling with setup times, deadlines and precedence constraints. Zbl 1168.90419
Balas, Egon; Simonetti, Neil; Vazacopoulos, Alkis
2008
Integer and fractional matchings. Zbl 0481.05055
Balas, Egon
1981
New classes of efficiently solvable generalized traveling salesman problems. Zbl 0922.90138
Balas, Egon
1999
Polyhedral methods for the maximum clique problem. Zbl 0864.90115
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard; Pataki, Gábor
1996
Critical cutsets of graphs and canonical facets of set-packing polytopes. Zbl 0447.52010
Balas, Egon; Zemel, Eitan
1977
On the convex hull of the union of certain polyhedra. Zbl 0663.90061
Balas, Egon
1988
On the maximum weight clique problem. Zbl 0624.05040
Balas, Egon; Chvátal, Vašek; Nešetřil, Jaroslav
1987
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Zbl 1180.90206
Balas, Egon; Bonami, Pierre
2009
Lifting and complementing yields all the facets of positive zero-one programming polytopes. Zbl 0548.90048
Balas, Egon; Zemel, Eitan
1984
Traffic assignment in communication satellites. Zbl 0526.90065
Balas, Egon; Landweer, Philip R.
1983
Duality in discrete programming. II: The quadratic case. Zbl 0191.48202
Balas, E.
1969
Lexicography and degeneracy: Can a pure cutting plane algorithm work? Zbl 1229.90101
Zanette, Arrigo; Fischetti, Matteo; Balas, Egon
2011
On the cycle polytope of a directed graph. Zbl 0969.90071
Balas, Egon; Oosten, Maarten
2000
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Zbl 0917.68162
Balas, Egon; Niehaus, William
1998
Linear-time separation algorithms for the three-index assignment polytope. Zbl 0781.90069
Balas, Egon; Qi, Liqun
1993
Set partitioning - a survey. Zbl 0413.90047
1979
A note on the branch-and-bound principle. Zbl 0186.24901
Balas, E.
1968
Extension de l’algorithme additif à la programmation en nombres entiers et à la programmation non linéaire. Zbl 0208.45705
Balas, E.
1964
On the generalized transportation problem. Zbl 0133.42505
Balas, E.; Ivanescu, P. L.
1964
Generalized intersection cuts and a new cut generating paradigm. Zbl 1262.90099
Balas, Egon; Margot, François
2013
Generating cuts from multiple-term disjunctions. Zbl 1010.90043
Perregaard, Michael; Balas, Egon
2001
The prize collecting traveling salesman problem. II: Polyhedral results. Zbl 0843.90120
Balas, Egon
1995
On the set covering polytope. II: Lifting the facets with coefficients in $$\{$$ 0,1,2$$\}$$. Zbl 0692.90073
Balas, Egon; Ng, Shu Ming
1989
Sequential convexification in reverse convex and disjunctive programming. Zbl 0683.90063
Balas, Egon; Tama, Joseph M.; Tind, Jørgen
1989
A class of location, distribution and scheduling problems: Modeling and solution methods. Zbl 0524.90064
Balas, Egon
1982
A note on duality in disjunctive programming. Zbl 0336.90037
Balas, E.
1977
Integer programming and convex analysis: Intersection cuts from outer polars. Zbl 0259.90023
Balas, Egon
1972
Polyhedral theory for the asymmetric traveling salesman problem. Zbl 1113.90349
Balas, Egon; Fischetti, Matteo
2002
Projection and lifting in combinatorial optimization. Zbl 1052.90061
Balas, Egon
2001
The prize collecting traveling salesman problem and its applications. Zbl 1113.90348
Balas, Egon
2002
Lifted cycle inequalities for the asymmetric traveling salesman problem. Zbl 0977.90040
Balas, Egon; Fischetti, Matteo
1999
On the monotonization of polyhedra. Zbl 0890.90153
Balas, Egon; Fischetti, Matteo
1997
A modified lift-and-project procedure. Zbl 0887.90127
Balas, Egon
1997
A new facet class and a polyhedral method for the three-index assignment problem. Zbl 0830.90105
Qi, Liqun; Balas, Egon; Gwan, Geena
1994
The fixed-outdegree 1-arborescence polytope. Zbl 0770.90072
Balas, Egon; Fischetti, Matteo
1992
A node covering algorithm. Zbl 0381.90093
Balas, Egon; Samuelsson, Haakon
1977
A duality theorem and an algorithm for (mixed-) integer nonlinear programming. Zbl 0225.90032
Balas, Egon
1971
Solution of large scale transportation problems through aggregation. Zbl 0137.38502
Balas, E.
1965
On unions and dominants of polytopes. Zbl 1098.90092
Balas, Egon; Bockmayr, Alexander; Pisaruk, Nicolai; Wolsey, Laurence
2004
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Zbl 0633.05039
Balas, Egon
1986
Disjunctive programming. Zbl 1187.90005
Balas, Egon
2010
Implementation of a linear time algorithm for certain generalized traveling salesman problems. Zbl 1415.90108
Simonetti, Neil; Balas, Egon
1996
An intersection cut from the dual of the unit hypercube. Zbl 0219.90036
Balas, Egon; Bowman, V. Joseph; Glover, Fred; Sommer, David
1971
The dual method for the generalized transportation problem. Zbl 0142.16601
Balas, E.
1966
Disjunctive programming. Zbl 1414.90001
Balas, Egon
2018
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts. Zbl 1370.90152
Balas, Egon; Kis, Tamás
2016
Intersection cuts – standard versus restricted. Zbl 1387.90151
Balas, E.; Kis, Tamas
2015
Generalized intersection cuts and a new cut generating paradigm. Zbl 1262.90099
Balas, Egon; Margot, François
2013
Intersection cuts from multiple rows: a disjunctive programming approach. Zbl 1296.90080
Balas, Egon; Qualizza, Andrea
2013
Monoidal cut strengthening revisited. Zbl 1242.90115
Balas, E.; Qualizza, A.
2012
A hard integer program made easy by lexicography. Zbl 1254.90120
Balas, Egon; Fischetti, Matteo; Zanette, Arrigo
2012
Lexicography and degeneracy: Can a pure cutting plane algorithm work? Zbl 1229.90101
Zanette, Arrigo; Fischetti, Matteo; Balas, Egon
2011
Projecting systems of linear inequalities with binary variables. Zbl 1254.90116
Balas, Egon
2011
Disjunctive programming. Zbl 1187.90005
Balas, Egon
2010
On the enumerative nature of Gomory’s dual cutting plane method. Zbl 1201.90135
Balas, Egon; Fischetti, Matteo; Zanette, Arrigo
2010
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. Zbl 1180.90206
Balas, Egon; Bonami, Pierre
2009
On the cycle polytope of a directed graph and its relaxations. Zbl 1207.05066
Balas, Egon; Stephan, Rüdiger
2009
Optimizing over the split closure. Zbl 1135.90030
Balas, Egon; Saxena, Anureet
2008
Job shop scheduling with setup times, deadlines and precedence constraints. Zbl 1168.90419
Balas, Egon; Simonetti, Neil; Vazacopoulos, Alkis
2008
Can pure cutting plane algorithms work? Zbl 1143.90398
Zanette, Arrigo; Fischetti, Matteo; Balas, Egon
2008
New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing. Zbl 1136.90399
Balas, Egon; Bonami, Pierre
2007
On the cycle polytope of a directed graph and its relaxations. Zbl 1209.05104
Balas, Egon; Stephan, Rüdiger
2007
New facets of the STS polytope generated from known facets of the ATS polytope. Zbl 1110.90081
Balas, Egon; Carr, Robert; Fischetti, Matteo; Simonetti, Neil
2006
The vertex separator problem: a polyhedral investigation. Zbl 1099.90065
Balas, Egon; de Souza, Cid C.
2005
Projection, lifting and extended formulation integer and combinatorial optimization. Zbl 1091.90041
Balas, Egon
2005
The vertex separator problem: algorithms and computations. Zbl 1099.90069
de Souza, Cid; Balas, Egon
2005
Pivot and shift – a mixed integer programming heuristic. Zbl 1087.90052
Balas, Egon; Schmieta, Stefan; Wallace, Christopher
2004
On unions and dominants of polytopes. Zbl 1098.90092
Balas, Egon; Bockmayr, Alexander; Pisaruk, Nicolai; Wolsey, Laurence
2004
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming. Zbl 1030.90068
Balas, Egon; Perregaard, Michael
2003
Lift-and-project for mixed 0-1 programming: recent progress. Zbl 1076.90031
Balas, Egon; Perregaard, Michael
2002
Polyhedral theory for the asymmetric traveling salesman problem. Zbl 1113.90349
Balas, Egon; Fischetti, Matteo
2002
The prize collecting traveling salesman problem and its applications. Zbl 1113.90348
Balas, Egon
2002
Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold medal, July 9, 2001, Rotterdam. Zbl 0998.90500
Balas, Egon
2002
Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. Zbl 1238.90126
Balas, Egon; Simonetti, Neil
2001
Octane: A new heuristic for pure 0-1 programs. Zbl 1163.90654
Balas, Egon; Ceria, Sebastián; Dawande, Milind; Margot, Francois; Pataki, Gábor
2001
Generating cuts from multiple-term disjunctions. Zbl 1010.90043
Perregaard, Michael; Balas, Egon
2001
Projection and lifting in combinatorial optimization. Zbl 1052.90061
Balas, Egon
2001
On the cycle polytope of a directed graph. Zbl 0969.90071
Balas, Egon; Oosten, Maarten
2000
Will to freedom. A perilous journey through fascism and communism. Zbl 1230.01026
Balas, Egon
2000
New classes of efficiently solvable generalized traveling salesman problems. Zbl 0922.90138
Balas, Egon
1999
Lifted cycle inequalities for the asymmetric traveling salesman problem. Zbl 0977.90040
Balas, Egon; Fischetti, Matteo
1999
Disjunctive programming: Properties of the convex hull of feasible points. Zbl 0921.90118
Balas, Egon
1998
Guided local search with shifting bottleneck for job shop scheduling. Zbl 0989.90057
Balas, Egon; Vazacopoulos, Alkis
1998
On the dimension of projected polyhedra. Zbl 0910.90234
Balas, Egon; Oosten, Maarten
1998
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Zbl 0917.68162
Balas, Egon; Niehaus, William
1998
Job shop scheduling with deadlines. Zbl 0897.90120
Balas, Egon; Lancia, Giuseppe; Serafini, Paolo; Vazacopoulos, Alkiviadis
1998
Projection with a minimal system of inequalities. Zbl 0895.90153
Balas, Egon
1998
On the monotonization of polyhedra. Zbl 0890.90153
Balas, Egon; Fischetti, Matteo
1997
A modified lift-and-project procedure. Zbl 0887.90127
Balas, Egon
1997
Recognizing facet defining inequalities. Zbl 0895.90154
Balas, E.
1997
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Zbl 0880.90105
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
1996
Gomory cuts revisited. Zbl 0865.90098
Balas, E.; Ceria, S.; Cornuéjols, G.; Natraj, N.
1996
A dynamic subgradient-based branch-and-bound procedure for set covering. Zbl 0879.90155
Balas, Egon; Carrera, Maria C.
1996
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Zbl 0846.68078
Balas, E.; Xue, Jue
1996
Polyhedral methods for the maximum clique problem. Zbl 0864.90115
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard; Pataki, Gábor
1996
Implementation of a linear time algorithm for certain generalized traveling salesman problems. Zbl 1415.90108
Simonetti, Neil; Balas, Egon
1996
Finding large cliques in arbitrary graphs by bipartite matching. Zbl 0864.90116
Balas, Egon; Niehaus, William
1996
The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Zbl 0824.90076
Balas, Egon; Lenstra, Jan Karel; Vazacopoulos, Alkis
1995
The precedence-constrained asymmetric traveling salesman polytope. Zbl 0835.90109
Balas, Egon; Fischetti, Matteo; Pulleyblank, William R.
1995
The prize collecting traveling salesman problem. II: Polyhedral results. Zbl 0843.90120
Balas, Egon
1995
A new facet class and a polyhedral method for the three-index assignment problem. Zbl 0830.90105
Qi, Liqun; Balas, Egon; Gwan, Geena
1994
A lift-and-project cutting plane algorithm for mixed 0-1 programs. Zbl 0796.90041
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
1993
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets. Zbl 0780.90100
Balas, Egon; Fischetti, Matteo
1993
Linear-time separation algorithms for the three-index assignment polytope. Zbl 0781.90069
Balas, Egon; Qi, Liqun
1993
Solving mixed $$0-1$$ programs by a lift-and-project method. Zbl 0808.90100
Balas, Egon; Ceria, Sebastián; Cornuéjols, Gérard
1993
On the monotonization of polyhedra. Zbl 0923.90123
Balas, Egon; Fischetti, Matteo
1993
The fixed-outdegree 1-arborescence polytope. Zbl 0770.90072
Balas, Egon; Fischetti, Matteo
1992
An algorithm for the three-index assignment problem. Zbl 0743.90079
Balas, Egon; Saltzman, Matthew J.
1991
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs. Zbl 0722.68086
Balas, Egon; Xue, Jue
1991
A parallel shortest augmenting path algorithm for the assignment problem. Zbl 0799.68111
Balas, Egon; Miller, Donald; Pekny, Joseph; Toth, Paolo
1991
The prize collecting traveling salesman problem. Zbl 0676.90089
Balas, Egon
1989
On graphs with polynomially solvable maximum-weight clique problem. Zbl 0661.05036
Balas, Egon; Yu, Chang Sung
1989
On the set covering polytope. I: All the facets with coefficients in $$\{$$ 0,1,2$$\}$$. Zbl 0674.90079
Balas, Egon; Ng, Shu Ming
1989
Facets of the three-index assignment polytope. Zbl 0723.90065
Balas, Egon; Saltzman, Matthew J.
1989
The perfectly matchable subgraph polytope of an arbitrary graph. Zbl 0723.05087
Balas, E.; Pulleyblank, W. R.
1989
The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. Zbl 0725.05053
Balas, Egon
1989
On the set covering polytope. II: Lifting the facets with coefficients in $$\{$$ 0,1,2$$\}$$. Zbl 0692.90073
Balas, Egon; Ng, Shu Ming
1989
Sequential convexification in reverse convex and disjunctive programming. Zbl 0683.90063
Balas, Egon; Tama, Joseph M.; Tind, Jørgen
1989
The shifting bottleneck procedure for job shop scheduling. Zbl 0637.90051
Adams, Joseph; Balas, Egon; Zawack, Daniel
1988
On the convex hull of the union of certain polyhedra. Zbl 0663.90061
Balas, Egon
1988
On the maximum weight clique problem. Zbl 0624.05040
Balas, Egon; Chvátal, Vašek; Nešetřil, Jaroslav
1987
The assignable subgraph polytope of a directed graph. Zbl 0659.05050
Balas, Egon
1987
Finding a maximum clique in an arbitrary graph. Zbl 0604.05024
Balas, Egon; Yu, Changsung
1986
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. Zbl 0633.05039
Balas, Egon
1986
Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. Zbl 0592.90070
Balas, Egon
1985
Branch and bound methods. Zbl 0568.90068
Balas, E.; Toth, P.
1985
On the facial structure of scheduling polyhedra. Zbl 0582.90053
Balas, Egon
1985
Nonlinear 0-1 programming. I: Linearization techniques. Zbl 0553.90067
Balas, Egon; Mazzola, Joseph B.
1984
Nonlinear 0-1 programming. II: Dominance relations and algorithms. Zbl 0553.90068
Balas, Egon; Mazzola, Joseph B.
1984
Lifting and complementing yields all the facets of positive zero-one programming polytopes. Zbl 0548.90048
Balas, Egon; Zemel, Eitan
1984
A sharp bound on the ratio between optimal integer and fractional covers. Zbl 0537.90077
Balas, Egon
1984
The perfectly matchable subgraph polytope of a bipartite graph. Zbl 0525.90069
Balas, Egon; Pulleyblank, William
1983
Traffic assignment in communication satellites. Zbl 0526.90065
Balas, Egon; Landweer, Philip R.
1983
Bender’s method revisited. Zbl 0512.65049
Balas, Egon; Bergthaller, Christian
1983
Correction to ”Disjunctive programming”. Zbl 0501.90068
Balas, E.
1983
A class of location, distribution and scheduling problems: Modeling and solution methods. Zbl 0524.90064
Balas, Egon
1982
A restricted Lagrangean approach to the traveling salesman problem. Zbl 0461.90068
Balas, Egon; Christofides, Nicos
1981
Integer and fractional matchings. Zbl 0481.05055
Balas, Egon
1981
An algorithm for large zero-one knapsack problems. Zbl 0449.90064
Balas, Egon; Zemel, Eitan
1980
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Zbl 0435.90074
Balas, Egon; Ho, Andrew
1980
Pivot and complement - a heuristic for 0-1 programming. Zbl 0442.90060
Balas, Egon; Martin, Clarence H.
1980
Strengthening cuts for mixed integer programs. Zbl 0439.90064
Balas, Egon; Jeroslow, Robert G.
1980
Cutting planes from conditional bounds: A new approach to set covering. Zbl 0435.90073
Balas, Egon
1980
Disjunctive programming. Zbl 0409.90061
Balas, Egon
1979
...and 37 more Documents
all top 5
#### Cited by 3,053 Authors
52 Balas, Egon 41 Sherali, Hanif D. 37 Fischetti, Matteo 34 Pardalos, Panos M. 30 Cornuéjols, Gérard P. 24 Glover, Fred W. 24 Grossmann, Ignacio E. 24 Lodi, Andrea 22 Wolsey, Laurence Alexander 20 Dash, Sanjeeb 20 Günlük, Oktay 18 Letchford, Adam N. 16 Laporte, Gilbert 15 Basu, Amitabh 15 Bonami, Pierre 15 Conforti, Michele 15 Weismantel, Robert 14 Nemhauser, George L. 14 Toth, Paolo 14 Vielma, Juan Pablo 13 Dey, Santanu S. 13 Pisinger, David 13 Salazar-González, Juan-José 12 Escalante, Mariana S. 12 Escudero, Laureano Fernando 12 Hanafi, Saïd 12 Jeroslow, Robert G. 12 Sen, Suvrajeet 11 Gutin, Gregory Z. 11 Hansen, Pierre 11 Monaci, Michele 11 Nasini, Graciela L. 11 Padberg, Manfred W. 10 Atamtürk, Alper 10 de Souza, Cid Carvalho 10 Jörnsten, Kurt O. 10 Paulusma, Daniël 10 Plateau, Gérard 10 Richard, Jean-Philippe Pascal 10 Smith, J. Cole 9 Adams, Warren Philips 9 Agra, Agostinho 9 Crama, Yves 9 Hifi, Mhand 9 Hildebrand, Robert 9 Margot, François 9 Minoux, Michel Andre 9 Sergeev, S. I. 8 Brucker, Peter J. 8 Caprara, Alberto 8 Castro, Pedro M. 8 Gendreau, Michel 8 Goldengorin, Boris I. 8 Hertz, Alain 8 Kis, Tamás 8 Lozin, Vadim Vladislavovich 8 Maculan, Nelson F. 8 Mahjoub, Ali Ridha 8 Molinaro, Marco 8 Rossi, Fabrizio 8 Sassano, Antonio 8 Smriglio, Stefano 8 Woeginger, Gerhard Johannes 7 Bienstock, Daniel 7 Boros, Endre 7 Burkard, Rainer E. 7 Cheng, Tai-Chiu Edwin 7 Cook, William John 7 Elhallaoui, Issmail 7 Figueira, José Rui 7 Fréville, Arnaud 7 Fukasawa, Ricardo 7 Ibaraki, Toshihide 7 Irnich, Stefan 7 Krokhmal, Pavlo A. 7 Linderoth, Jeff T. 7 Ljubić, Ivana 7 Mazzola, Joseph B. 7 Mitchell, John E. 7 Mourtos, Ioannis 7 Nguyen, Kien Trung 7 Ralphs, Ted K. 7 Resende, Mauricio G. C. 7 Soumis, François 7 Spieksma, Frits C. R. 7 Tawarmalani, Mohit 7 Tunçel, Levent 7 Uzsoy, Reha 6 Alizadeh, Behrooz 6 Anjos, Miguel F. 6 Beck, J. Christopher 6 Belotti, Pietro 6 Bianchi, Silvia M. 6 Brandstädt, Andreas 6 Constantino, Miguel Fragoso 6 Cordeau, Jean-François 6 Dauzère-Pérès, Stéphane 6 De Farias, Ismael Regis jun. 6 de Werra, Dominique 6 Del Pia, Alberto ...and 2,953 more Authors
all top 5
#### Cited in 185 Serials
388 European Journal of Operational Research 206 Mathematical Programming. Series A. Series B 175 Discrete Applied Mathematics 173 Computers & Operations Research 138 Operations Research Letters 108 Annals of Operations Research 70 Discrete Optimization 57 Journal of Global Optimization 49 Mathematical Programming 39 International Journal of Production Research 34 Computational Optimization and Applications 33 Journal of Combinatorial Optimization 32 Mathematical Programming Computation 30 INFORMS Journal on Computing 29 Optimization Letters 28 Journal of Scheduling 26 Discrete Mathematics 26 Journal of Optimization Theory and Applications 25 Theoretical Computer Science 21 Optimization 20 Networks 18 Applied Mathematics and Computation 16 International Transactions in Operational Research 15 Algorithmica 15 Top 15 Journal of Heuristics 13 Artificial Intelligence 13 Information Processing Letters 12 OR Spektrum 12 EURO Journal on Computational Optimization 11 Mathematics of Operations Research 11 Naval Research Logistics 11 Mathematical and Computer Modelling 11 RAIRO. Operations Research 11 Naval Research Logistics Quarterly 10 Computing 10 Automation and Remote Control 10 4OR 9 Operations Research 9 Mathematical Problems in Engineering 9 Optimization Methods & Software 8 Computers & Mathematics with Applications 8 Information Sciences 8 Opsearch 8 SIAM Journal on Optimization 8 Mathematical Methods of Operations Research 7 Applied Mathematical Modelling 7 Zeitschrift für Operations Research. Serie A: Theorie 7 ZOR. Zeitschrift für Operations Research 6 Journal of Computational and Applied Mathematics 6 Journal of Computer and System Sciences 6 Cybernetics 6 Asia-Pacific Journal of Operational Research 6 Annals of Mathematics and Artificial Intelligence 5 Linear Algebra and its Applications 5 Optimization and Engineering 4 Journal of Mathematical Analysis and Applications 4 Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 4 Journal of Combinatorial Theory. Series B 4 Journal of Information & Optimization Sciences 4 Combinatorica 4 International Journal of Computer Mathematics 4 Constraints 4 JMMA. Journal of Mathematical Modelling and Algorithms 4 Journal of Discrete Algorithms 4 Journal of Industrial and Management Optimization 3 Mathematical Biosciences 3 Psychometrika 3 Aplikace Matematiky 3 Automatica 3 International Journal of Computer & Information Sciences 3 Trabajos de Investigacion Operativa 3 Discrete Mathematics and Applications 3 Cybernetics and Systems Analysis 3 Natural Computing 3 Journal of Applied Mathematics and Computing 3 Journal of Mathematical Modelling and Algorithms in Operations Research 2 Applied Mathematics and Optimization 2 Software. Practice & Experience 2 Statistica Neerlandica 2 Trabajos de Estadistica y de Investigacion Operativa 2 Systems & Control Letters 2 Journal of Classification 2 Applied Numerical Mathematics 2 Acta Mathematicae Applicatae Sinica. English Series 2 Discrete & Computational Geometry 2 Journal of Automated Reasoning 2 SIAM Journal on Discrete Mathematics 2 Japan Journal of Industrial and Applied Mathematics 2 Computational Geometry 2 Discrete Event Dynamic Systems 2 Russian Mathematics 2 The Electronic Journal of Combinatorics 2 Doklady Mathematics 2 Journal of Vibration and Control 2 Soft Computing 2 Journal of Applied Mathematics 2 OR Spectrum 2 Fuzzy Optimization and Decision Making 2 Computational Management Science ...and 85 more Serials
all top 5
#### Cited in 29 Fields
2,122 Operations research, mathematical programming (90-XX) 302 Combinatorics (05-XX) 275 Computer science (68-XX) 175 Numerical analysis (65-XX) 127 Convex and discrete geometry (52-XX) 46 Calculus of variations and optimal control; optimization (49-XX) 37 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 17 Statistics (62-XX) 15 Biology and other natural sciences (92-XX) 15 Systems theory; control (93-XX) 12 Information and communication theory, circuits (94-XX) 8 Linear and multilinear algebra; matrix theory (15-XX) 7 History and biography (01-XX) 7 Mathematical logic and foundations (03-XX) 7 Order, lattices, ordered algebraic structures (06-XX) 5 Number theory (11-XX) 3 General and overarching topics; collections (00-XX) 3 Real functions (26-XX) 3 Operator theory (47-XX) 3 Geometry (51-XX) 3 Probability theory and stochastic processes (60-XX) 2 Functional analysis (46-XX) 2 Mechanics of deformable solids (74-XX) 1 Algebraic geometry (14-XX) 1 Group theory and generalizations (20-XX) 1 Measure and integration (28-XX) 1 Partial differential equations (35-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Approximations and expansions (41-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-06-15T03:36: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.2770240306854248, "perplexity": 12602.757624987427}, "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-25/segments/1623487616657.20/warc/CC-MAIN-20210615022806-20210615052806-00144.warc.gz"}
|
https://gea.esac.esa.int/archive/documentation/GDR3/Gaia_archive/chap_datamodel/sec_dm_science_alert_tables/ssec_dm_science_alerts.html
|
### gaia data release 3 documentation
Table containing all Gaia Photometric Science Alerts triggered in the period 25-07-2014 to 28-05-2017, i.e. the time span covered by DR3.
A Gaia Photometric Science Alert is known to the community by its name Gaiannxyz where nn is the year number and xyz is an incrementing, alphabetic sequence starting at aaa. Science alerts have their details published on the WWW. Given the name of an alert, the URL for the published details can be derived, e.g. https://gsaweb.ast.cam.ac.uk/alerts/alert/Gaia18ahj for alert Gaia18ahj.
The source_id associated to the alert may have other alternative matches in Gaia DR3. These other identifiers are listed in table alerts_mixedin_sourceids.
Columns description:
source_id : Unique source identifier (unique within a particular Data Release) (long)
A unique single numerical identifier of the source obtained from gaia_source (for a detailed description see gaia_source.source_id).
transit_id : Alerting transit identifier (long)
The transit_id is a unique identifier assigned to each detected (and confirmed) source as it transits the Gaia focal plane. Each time a given source is detected as Gaia scans and re-scans the sky a new transit_id will be created to badge that apparition. Hence the along–scan time and the across–scan position along with the telescope in which the source was detected are used to form a unique integer with which to label the transit.
The several features of a detection that are encoded in transit_id can be easily retrieved using bit masks (&) and shifts ($>>$) as follows:
• On-Board Mission Time line [ns]
= 204800 * ((transit_id $>>$ 17) & (0x000003FFFFFFFFFF))
• Field-of-view = 1 + (transit_id $>>$ 15) & 0x03 [1 for ‘preceding’ and 2 for ‘following’ fields-of-view respectively]
• CCD row = (transit_id $>>$ 12) & 0x07 [dimensionless, in the range 1 to 7]
• Across-scan ‘reference acquisition pixel’ in strip AF1 = (transit_id) & 0x0FFF [pixels] (this is the across-scan centre of the AF1 window and is odd if immediately below the mid-point of the window and even if immediately above)
| 2022-08-08T05:00:22 |
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 4, "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.4201643466949463, "perplexity": 6896.122191964915}, "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/1659882570765.6/warc/CC-MAIN-20220808031623-20220808061623-00412.warc.gz"}
|
http://psychology.wikia.com/wiki/Point_processes?diff=prev&oldid=124726
|
# Changes: Point processes
Back to page
In mathematics, a point process is a random element whose values are "point patterns" on a set S. While in the exact mathematical definition a point pattern is specified as a locally finite counting measure, it is sufficient for more applied purposes to think of a point pattern as a countable subset of S that has no limit points.
Point processes are well studied objects in probability theory[1][2] and a powerful tool in statistics for modeling and analyzing spatial data,[3][4] which is of interest in such diverse disciplines as forestry, plant ecology, epidemiology, geography, seismology, materials science, astronomy, economics[5] and others. Point processes on the real line form an important special case that is particularly amenable to study,[6] because the different points are ordered in a natural way, and the whole point process can be described completely by the (random) intervals between the points. These point processes are frequently used as models for random events in time, such as the arrival of customers in a queue (queueing theory), of impulses in a neuron (computational neuroscience) or of searches on the world-wide web.
## General point process theoryEdit
### DefinitionEdit
Let S be locally compact second countable Hausdorff space equipped with its Borel σ-algebra B. Write $\mathfrak{N}$ for the set of locally finite counting measures on S and $\mathcal{N}$ for the smallest σ-algebra on $\mathfrak{N}$ that renders all the point counts
$\Phi_B : \mathfrak{N} \to \mathbb{Z}_{+}, \varrho \mapsto \varrho(B)$
for relatively compact sets B in B measurable.
A point process on S is a measurable map
$\xi:\Omega\to \mathfrak{N}$
from a probability space $(\Omega, \mathcal F, P)$ to the measurable space $(\mathfrak{N},\mathcal{N})$.
By this definition, a point process is a special case of a random measure.
The most common example for the state space S is the Euclidean space Rn or a subset thereof, where a particularly interesting special case is given by the real half-line [0,∞). However, point processes are not limited to these examples and may among other things also be used if the points are themselves compact subsets of Rn, in which case ξ is usually referred to as a particle process.
It has been noted[How to reference and link to summary or text] that the term point process is not a very good one if S is not a subset of the real line, as it might suggest that ξ is a stochastic process. However, the term is well established and uncontested even in the general case.
### RepresentationEdit
Every point process ξ can be represented as
$\xi=\sum_{i=1}^N \delta_{X_i},$
where $\delta$ denotes the Dirac measure, N is a integer-valued random variable and $X_i$ are random elements of S.
### Expectation measureEdit
The expectation measure of a point process ξ is a measure on S that assigns to every Borel subset B of S the expected number of points of ξ in B. That is,
$E \xi (B) := E \bigl( \xi(B) \bigr) \quad \text{for every } B \in \mathcal{B}.$
### Laplace functionalEdit
The Laplace functional $\Psi_{N}(f)$ of a point process N is a map from the set of all positive valued functions f on the state space of N, to $[0,\infty)$ defined as follows:
$\Psi_{N}(f)=E[\exp(-N(f))]$
They play a similar role as the characteristic functions for random variable. One important theorem says that: two point processes have the same law iff their Laplace functionals are equal.
## Point processes in spatial statisticsEdit
The analysis of point pattern data in a compact subset S of Rn is a major object of study within spatial statistics. Such data appear in a broad range of disciplines[7], amongst which are
• forestry and plant ecology (positions of trees or plants in general)
• epidemiology (home locations of infected patients)
• zoology (burrows or nests of animals)
• geography (positions of human settlements, towns or cities)
• seismology (epicenters of earthquakes)
• materials science (positions of defects in industrial materials)
• astronomy (locations of stars or galaxies)
• computational neuroscience (spikes of neurons).
The need to use point processes to model these kinds of data lies in their inherent spatial structure. Accordingly, a first question of interest is often whether the given data exhibit complete spatial randomness (i.e. are a realization of a spatial Poisson process) as opposed to exhibiting either spatial aggregation or spatial inhibition.
In contrast, many datasets considered in classical multivariate statistics consist of indepently generated datapoints that may be governed by one or several covariates (typically non-spatial).
## Point processes on the real half-lineEdit
Historically the first point processes that were studied had the real half line R+ = [0,∞) as their state space, which in this context is usually interpreted as time. These studies were motivated by the wish to model telecommunication systems[8], in which the points represented events in time, such as calls to a telephone exchange.
Point processes on R+ are typically described by giving the sequence of their (random) inter-event times (T1, T2,...), from which the actual sequence (X1, X2,...) of event times can be obtained as
$X_k = \sum_{j=1}^{k} T_j \quad \text{for } k \geq 1.$
If the inter-event times are independent and identically distributed, the point process obtained is called a renewal process.
### Conditional intensity function Edit
The conditional intensity function of a point process on the real half-line is a function λ(t|Ht) defined as
$\lambda(t| H_{t})=\lim_{\Delta t\to 0}\frac{1}{\Delta t}{P}(\mbox{One event occurs in the time-interval}\,[t,t+\Delta t]\,|\, H_t) ,$
where Ht denotes the history of event times preceding time t.
### Papangelou intensity functionEdit
The Papangelou intensity function of a point process $N$ in the $n$-dimensional Euclidean space $\mathbb{R}^n$ is defined as:
$\lambda_p(x)=\lim_{\delta \to 0}\frac{1}{|B_\delta (x)|}{P}\{\mbox{One event occurs in } \,B_\delta(x)\,|\, \sigma[N \setminus(B_\delta(x))] \} ,$
where $B_\delta (x)$ is the ball centered at $x$ of a radius $\delta$, and $\sigma[N \setminus(B_\delta(x))]$ denotes the information of the point process $N$ outside $B_\delta(x)$.
## ReferencesEdit
1. Kallenberg, O. (1986). Random Measures, 4th edition. Academic Press, New York, London; Akademie-Verlag, Berlin. ISBN 0-123-94960-2, MR854102.
2. Daley, D.J, Vere-Jones, D. (1988). An Introduction to the Theory of Point Processes. Springer, New York. ISBN 0-387-96666-8, MR950166.
3. Diggle, P. (2003). Statististical Analysis of Spatial Point Patterns, 2nd edition. Arnold, London. ISBN 0-340-74070-1.
4. Baddeley, A. (2006). Spatial point processes and their applications. In A. Baddeley, I. Bárány, R. Schneider, and W. Weil, editors, Stochastic Geometry: Lectures given at the C.I.M.E. Summer School held in Martina Franca, Italy, September 13-18, 2004, Lecture Notes in Mathematics 1892, Springer. ISBN 3-540-38174-0, pp. 1--75
5. Robert F. Engle and Asger Lunde, 2003, "Trades and Quotes: A Bivariate Point Process". Journal of Financial Econometrics Vol. 1, No. 2, pp. 159-188
6. Last, G., Brandt, A. (1995). Marked point processes on the real line. The dynamic approach. Probability and its Applications. Springer, New York. ISBN 0-387-94547-4, MR1353912
7. Baddeley, A., Gregori, P., Mateu, J., Stoica, R., and Stoyan, D., editors (2006). Case Studies in Spatial Point Pattern Modelling, Lecture Notes in Statistics No. 185. Springer, New York. ISBN 0-387-28311-0.
8. Palm, C. (1943). Intensitätsschwankungen im Fernsprechverkehr (German). Ericsson Technics no. 44, (1943).MR11402
This page uses Creative Commons Licensed content from Wikipedia (view authors).
| 2013-12-13T09:39: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": 0, "img_math": 26, "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.6871935725212097, "perplexity": 1147.9534011074716}, "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-2013-48/segments/1386164923389/warc/CC-MAIN-20131204134843-00027-ip-10-33-133-15.ec2.internal.warc.gz"}
|
https://www.usgs.gov/center-news/lava-back-pu-u-crater-scientists-mull-over-k-laueas-future
|
# Lava back in the Pu‘u ‘Ō‘ō crater as scientists mull over Kīlauea's future
Release Date:
The answer to the question asked by Hawaii's residents and volcano enthusiasts since June 19—where is Kīlauea going to erupt next—is clear, now that lava is back in the crater of Puu Oo.
The lava falls at the east end of the crater is feeding the smaller of the two ponds.
(Public domain.)
Small flows in the deepened crater were spotted early Monday. As more lava erupted onto the crater floor, a slowly circulating lava pond was formed by July 4th.
Time will tell whether lava will continue erupting in the crater, overflow the rim as it did in 1997, erupt from the side of the cone as it has for many years, withdraw again for a short time, or quit erupting altogether.
The events of the past three weeks are a strong reminder of the ever-present potential for Kīlauea to suddenly and unpredictably change its style. The nearly 25-year long eruption is not the volcano's norm, when compared to the past several hundred years of activity.
In fact, it is nearly impossible to define what is normal for Kīlauea, except frequent changes in location of eruptions and underground intrusions of magma at the volcano's summit or along its rift zones. Change is what we should expect from Kīlauea as time passes—both in the nature and locus of activity—instead of decades of activity at Puu Oo.
For now, it is not possible to anticipate the next intrusion and eruption, based on the pattern of activity scientists have observed and worked hard to characterize.
It is possible, however, to narrow the possibilities when there is a sudden, rapid change in the location of hundreds of small earthquakes and volcanic tremor and deformation of the ground, as detected by continuously recording instruments.
Wherever such activity begins, we know that it can migrate sometimes uprift toward the summit, but almost always downrift, away from the summit. The earthquakes and changing ground movements indicate the direction magma is moving toward or away from the summit, and upwards, toward the surface. Being ready for such sudden change requires constant vigilance.
Scientists must have extensive and well-maintained networks of monitoring instruments around the summits and the very long rift zones of Kīlauea and Mauna Loa volcanoes. A robust alarm system is also required to notify scientists around the clock of important changes that may signify eruption in a new location or significant change in an ongoing eruption.
For example, on June 17 within 5 minutes of the volcano-monitoring system's recording and detection of a sudden change in tilt at the summit of Kīlauea at 2:14 a.m., several scientists were automatically notified of a "tilt alarm." A scientist was at the observatory within 15 minutes, and 5 more arrived within the hour to assess the activity.
Scientists quickly determined that magma was moving from the summit reservoir into the upper east rift zone beneath the Mauna Ulu area. The magma continued moving episodically downrift a few kilometers (miles) and erupted by early morning on June 19. The monitoring and alarm system worked very well, indeed.
Is it back to business as usual at Puu Oo or has something changed that may affect Kīlauea's near-term future?
Between 1983 and 2002, the summit area was continuously subsiding. A simple interpretation is that less magma was entering the summit reservoir from the deep, hot-spot source than was moving into the east rift zone to erupt at Puu Oo.
Beginning in early 2003, the summit area began inflating for the first time during the long-lived eruption. If the same reasoning is applied, more magma was moving into the summit reservoir than was leaving the reservoir and erupting at Puu Oo. This would mean that the summit reservoir was becoming increasingly pressurized with new magma.
With this simple explanation, it was not surprising, then, that the Father's Day intrusion and eruption occurred. When the pressurized magma reservoir system sprang a leak, magma rushed into the upper east rift zone in an area where many intrusions have occurred in the past 50 years.
Kīlauea is slowly inflating again. Perhaps, if the trend continues as it has since 2003, one or more additional intrusions or eruptions will occur—not at Puu Oo—but elsewhere at Kīlauea in the coming months.
————————————————————————————————————————————————————————————————
### Volcano Activity Update
This past week, activity levels at the summit of Kīlauea Volcano remained low. Seismic tremor levels remain low; earthquakes continue to be concentrated in the upper east rift zone. The summit caldera is again inflating.
Lava has returned to Puu Oo after a two week vacation. Early in the morning on July 2, Puu Oo reawakened and began to intermittently erupt lava from a vent in the center of the crater floor. The vent is almost directly below the site of the former Beehive vent. This part of the crater floor dropped about 100 meters during the first few days of the recent Father's Day intrusion.
As of this writing (July 5), lava continues to erupt from the new vent, and the crater is filling relatively rapidly. Nearly the entire crater floor has been resurface by a ponded lava flow. This has provided spectacular viewing, especially at night, via the Puu Oo webcam. Lava has not yet appeared outside of Puu Oo cone, though, with the rapid rate of refilling, this may not be the case for long.
One earthquake beneath Hawaii Island was reported felt within the past week. A magnitude-3.8 earthquake occurred at 12:28 p.m. on Tuesday, July 3, and was located 1 km (1 mile) northeast of Hakalau at a depth of 40 km (25 miles).
Mauna Loa is not erupting. One earthquake was located beneath the summit. Extension between locations spanning the summit, indicating inflation, continues at steady, slow rates which have slowed further since May 2007.
| 2020-01-21T07:52: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": 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.35071295499801636, "perplexity": 2432.771871072876}, "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-05/segments/1579250601628.36/warc/CC-MAIN-20200121074002-20200121103002-00394.warc.gz"}
|
https://pdglive.lbl.gov/Particle.action?node=M036&home=sumtabM
|
LIGHT UNFLAVORED MESONS($\boldsymbol S$ = $\boldsymbol C$ = $\boldsymbol B$ = 0) For $\mathit I = 1$ (${{\mathit \pi}}$, ${{\mathit b}}$, ${{\mathit \rho}}$, ${{\mathit a}}$): ${\mathit {\mathit u}}$ ${\mathit {\overline{\mathit d}}}$, ( ${\mathit {\mathit u}}$ ${\mathit {\overline{\mathit u}}}−$ ${\mathit {\mathit d}}$ ${\mathit {\overline{\mathit d}}})/\sqrt {2 }$, ${\mathit {\mathit d}}$ ${\mathit {\overline{\mathit u}}}$;for $\mathit I = 0$ (${{\mathit \eta}}$, ${{\mathit \eta}^{\,'}}$, ${{\mathit h}}$, ${{\mathit h}^{\,'}}$, ${{\mathit \omega}}$, ${{\mathit \phi}}$, ${{\mathit f}}$, ${{\mathit f}^{\,'}}$): ${\mathit {\mathit c}}_{{\mathrm {1}}}$( ${{\mathit u}}{{\overline{\mathit u}}}$ $+$ ${{\mathit d}}{{\overline{\mathit d}}}$ ) $+$ ${\mathit {\mathit c}}_{{\mathrm {2}}}$( ${{\mathit s}}{{\overline{\mathit s}}}$ ) INSPIRE search
# ${{\boldsymbol a}_{{0}}{(980)}}$ $I^G(J^{PC})$ = $1^-(0^{+ +})$
See the review on "Scalar Mesons below 2 GeV."
${{\boldsymbol a}_{{0}}{(980)}}$ MASS
Mass $\mathit m$ $980 \pm20$ MeV
${{\mathit \eta}}{{\mathit \pi}}$ FINAL STATE ONLY
${{\mathit K}}{{\overline{\mathit K}}}$ ONLY
${{\boldsymbol a}_{{0}}{(980)}}$ WIDTH
Full width $\Gamma$ $50\text{ to }100$ MeV
${{\mathit K}}{{\overline{\mathit K}}}$ ONLY $92 \pm8$ MeV
| 2020-10-26T22:18: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.9934788942337036, "perplexity": 972.9919380424222}, "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-45/segments/1603107892062.70/warc/CC-MAIN-20201026204531-20201026234531-00515.warc.gz"}
|
http://legisquebec.gouv.qc.ca/en/version/cs/C-3?code=se:2&history=20211018
|
### C-3 - Act respecting the caisses d’entraide économique
2. The founding memorandum of a union must be made in accordance with form 1. It must indicate, in addition to that which is mentioned in section 6 of the Savings and Credit Unions Act,
(a) the mode of payment of the shares subscribed;
(b) the amount of the cost of acquisition of the shares, where provided for, and its mode of payment;
(c) the mention that the liability of the signatories is limited to the amount they have paid on their shares and not to the amount of their subscription, in accordance with section 6;
(d) the mention that the signatories may cancel their subscriptions in accordance with section 10.
1974, c. 68, s. 2.
| 2021-12-04T08:29:50 |
{"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.8416742086410522, "perplexity": 2665.9486118921986}, "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/1637964362952.24/warc/CC-MAIN-20211204063651-20211204093651-00386.warc.gz"}
|
https://www.star.bnl.gov/
|
traveling to BNL: COVID-19 Instructions and Housing Information
STAR focus: Measurement of Momentum and Angular Distributions of e+e- pairs from Linearly Polarized Photons
Only a handful of fundamental interactions between light and matter are allowed by the theory of quantum electrodynamics, all of which but one have been observed in the 80 or so years since their prediction. The Breit-Wheeler process, the simplest mechanism for converting 'light quanta' into matter and antimatter, has eluded observation for decades, despite being hotly pursued.The idea that you can create matter from smashing together light is a striking demonstration of the physics immortalized in Einstein's famous E=mc2 equation, which revealed that energy and matter are two sides of the same coin. Recently, the STAR collaboration published "Measurement of Momentum and Angular Distributions of e+e- pairs from Linearly Polarized Photons" in Physical Review Letters, in which presents observation of the Breit-Wheeler process in heavy-ion collisions for the first time. This discovery was made possible by a unique analysis which measured the quantum spin-momentum correlations of the produced e+e- pair, revealing a striking 4th order angular modulation (See Figure). Virtual photons live only briefly as they mediate the electromagnetic force and carry a virtual mass. While virtual photons can be in the helicity 0 state, due to their virtual mass, real photons cannot, and instead must have +/-1 unit of helicity. This difference has a profound impact on the produced e+e- pair, since the quantized spin of the colliding photons becomes encoded in the final momentum of the produced electron and positron, resulting in the observed modulated emission angle ($\Delta\phi$). As the figure shows, the STAR data agree with calculations of the Breit-Wheeler process (QED), which predicts a strong cos$4\Delta\phi$ modulation from the collision of linearly polarized photons. The measured cos$4\Delta\phi$ modulation proves another tantalizing prediction from decades ago. Heavy-ion collisions have long been expected to produce the strongest magnetic fields in the Universe, of order 1015 Tesla. Physicists in the 1930's predicted that photons shooting through such strong magnetic fields can be "bent", despite the photon itself not being charged - and therefore not directly interacting with the electromagnetic field. However, in quantum mechanics, a real photon can briefly fluctuate into an e+e- pair which can interact with the strong electromagnetic fields. The key prediction for this effect, called vacuum birefringence, is that the photon's path is split depending on the angle between the photon's polarization and the magnetic field direction. In the recent STAR measurement, the colliding photons result from the highly boosted electromagnetic fields of the heavy ions, so the photon's polarization direction is directly related to the classical electric and magnetic field direction. Therefore, the observed cos$4\Delta\phi$ modulation can be understood in terms of the absorption of light when the polarization of the photon (from one ion) is parallel vs. perpendicular to the magnetic field direction (produced by the other ion). This absorption effect is directly related to vacuum birefringence, and provides the first experimental verification that heavy-ion collisions really do produce ultra strong magnetic fields (approximately 1015 Tesla). Read more about this discovery: BNL News Science News Posted September 10, 2021 Previous STAR Focus Features
STAR focus: Longitudinal Double-Spin Asymmetry for Inclusive Jet and Dijet Production in Polarized Proton Collisions at √s = 200 GeV
How is the spin of the proton distributed among its quark, anti-quark, and gluon constituents? The STAR experiment addressed this fundamental question using collisions of high-energy polarized protons. We recently published results on the “Longitudinal Double-Spin Asymmetry for Inclusive Jet and Dijet Production in Polarized Proton Collisions at √s = 200 GeV” in Phys. Rev. D 103, L091103 (2021) highlighted as PRD Editors' Suggestion. The data give insight in the gluon spin contribution to the proton spin. We measured the asymmetries in the differential production cross sections of inclusive jet and dijet probes for different longitudinal spin configurations of the colliding proton beams as a function of jet transverse momentum and dijet invariant mass. Since gluon-gluon and gluon-quark scattering contributions dominate the production of these probes in the STAR environment, the data provide sensitivity to the gluon spin contribution to the proton spin. Left Figure: Results of the double-spin asymmetry for dijets as a function of dijet invariant mass for two different event topologies. The topologies probe complementary gluon fractional momenta. The green square markers show the new results from data collected in 2015. The blue triangle markers show our prior results based on data collected in 2009 and are seen to be in good agreement. The curves show dijet asymmetry expectations from the DSSV14 and NNPDFpol1.1 theory collaborations and the band indicates the size of the uncertainty in the NNPDFpol1.1 expectation. Our prior results provided first evidence for a positive polarization of the gluons in the polarized nucleon for gluon fractional momenta larger than 0.05 upon their inclusion in global analyses. Our new results have an approximately twice larger figure of merit, with improved systematic uncertainties, and thus considerably strengthen this evidence. Since we concluded our data taking with longitudinally polarized protons in 2015, these data are anticipated to provide the most precise insights in gluon polarization well into the future, likely until the future Electron-Ion Collider comes online. Posted May 27, 2021 Previous STAR Focus Features
STAR focus: Observation of Ds/D0 in Au+Au collisions at √sNN = 200 GeV
The STAR Collaboration has recently published an article titled "Observation of Ds/D0 in Au+Au collisions at √sNN = 200 GeV” in Phys. Rev. Lett. 127, 092301. Charm quarks are produced on timescales shorter than the Quark-Gluon Plasma (QGP) formation in heavy-ion collisions and they subsequently experience the whole evolution of the QGP matter, making them an excellent probe to study the transport properties of the QGP. In the QGP medium, one expects a different hadronization mechanism from p+p collisions through the recombination of charm quarks and light/strange quarks (namely coalescence hadronization) to dominate at low pT (< 5 GeV/c) and fragmentation hadronization to dominate at higher pT. Due to the enhanced strange-quark abundance in the QGP, an increased Ds production in heavy-ion collisions relative to p+p collisions has been predicted in case of hadronization via quark recombination. Comparing the Ds/D0 yield ratio in heavy-ion collisions with that in p+p therefore helps us understand the QGP effects on charm-quark hadronization. In this paper we present the first measurement of Ds production and Ds/D0 yield ratio as a function of pT for different collision centralities at midrapidity (|y| < 1) in Au+Au collisions at √sNN = 200 GeV. A clear enhancement of the Ds/D0 yield ratio is found compared to PYTHIA simulations of p+p events at the same collision energy. For the Ds/D0 ratios integrated over 1.5 < pT < 5 GeV/c in the 10%–60% centrality range, the significance of this observation is more than 5 standard deviations. The pT-integrated Ds/D0 ratio is compatible with predictions from a statistical hadronization model. The enhancement, and its pT dependence, can be qualitatively described by model calculations incorporating thermal abundance of strange quarks in the QGP and coalescence hadronization that includes charm quarks. These results suggest that recombination of charm quarks with strange quarks in the QGP plays an important role in Ds-meson production in heavy-ion collisions. Figure: (a) Ds/D0 yield ratio as a function of pT compared to various model calculations from He/Rapp (0%–20%), Tsinghua, Catania, and Cao-Ko in 0%–10% centrality interval of Au+Au collisions, and PYTHIA prediction in p+p collisions at √sNN = 200 GeV. (b) Ds/D0 yield ratio as a function of pT compared to model calculations from Tsinghua in 20%–40% (solid circles) and 40%–80% (open circles) centrality intervals of Au+Au collisions at √sNN = 200 GeV. Vertical bars and brackets on data points represent statistical and systematic uncertainties, respectively. Posted August 30, 2021 Previous STAR Focus Features
STAR focus: Invariant Jet Mass Measurements in pp Collisions at √s = 200 GeV at RHIC
code of conduct
The STAR Collaboration
believes that our scientific
mission is best achieved by
building a culture of
recent news
November 12, 2021
Congratulations to Dr. Dave Stewart from Yale who has successfully defended his Ph.D. thesis. Dr. Stewart’s thesis was titled “Jet to Event Activity Correlations in Small System Collisions at STAR”.
November 1, 2021
Congratulations to Dr. Anjali Attri from Panjab University, Chandigarh who successfully defended her thesis on STAR on 29th of October. Her thesis was titled: "Event-by-Event Charge Separation in Heavy Ion Collisions Using STAR Detector at RHIC".
July 17, 2021
Congratulations to Dr. Joe Kwasizur who has just successfully defended his Ph.D. at Indiana. Dr. Kwasizur’s thesis was titled “Longitudinal Double-Spin Asymmetries for Dijet Production at Intermediate Pseudorapidity in Polarized p+p Collisions at $\sqrt{s}$ = 510 GeV”.
July 16, 2021
Congratulations to Dr Joey Adams who has successfully defended his Ph.D. at OSU. His thesis was titled “A Measurement of Lambda Hyperon Spin Polarization in Au+Au Collisions at $\sqrt{s_{\rm{NN}}}$ = 3 GeV with STAR”.
Last modified: Nov 15 2021 13:22. privacy & security
| 2021-11-29T18:05: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": 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.7221424579620361, "perplexity": 2500.2837686563876}, "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-49/segments/1637964358786.67/warc/CC-MAIN-20211129164711-20211129194711-00420.warc.gz"}
|
https://malegislature.gov/Laws/GeneralLaws/PartI/TitleII/Chapter6C/Section45
|
# General Laws
## Section 45 Reimbursement of underground utility or utility facility relocation costs
[ Text of section effective until April 18, 2014. Repealed by 2014, 79, Sec. 6.]
Section 45. Notwithstanding clause (f) of section 4 or any other general or special law to the contrary, the commonwealth, through the division of highways, may reimburse the owner of an underground utility or utility facility whenever such underground utility or utility facility has been relocated because of construction of a project which is to be reimbursed federally in whole or in part. The reimbursement authorized herein shall be to the extent that the cost of relocating the facility is reimbursed by the federal government.
| 2015-07-03T20:25:03 |
{"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.914772093296051, "perplexity": 4391.435038853624}, "config": {"markdown_headings": true, "markdown_code": false, "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-2015-27/segments/1435375096209.79/warc/CC-MAIN-20150627031816-00213-ip-10-179-60-89.ec2.internal.warc.gz"}
|
http://dlmf.nist.gov/12.19
|
# §12.19 Tables
• Abramowitz and Stegun (1964, Chapter 19) includes and for , , 5S; for , , 4-5D or 4-5S.
• Miller (1955) includes , , and reduced derivatives for , , 8D or 8S. Modulus and phase functions, and also other auxiliary functions are tabulated.
• Fox (1960) includes modulus and phase functions for and , and several auxiliary functions for , , 8S.
• Kireyeva and Karpov (1961) includes for , , and , , 7D.
• Karpov and Čistova (1964) includes for , ; , , 6D.
• Karpov and Čistova (1968) includes and for and = 0(.001 or .0001)5, , 7D or 8S.
• Murzewski and Sowa (1972) includes for , , 7S.
• Zhang and Jin (1996, pp. 455–473) includes , , , , and derivatives, , , , 8S; , , and derivatives, , and , , , 8S. Also, first zeros of , , and of derivatives, , 6D; first three zeros of and of derivative, , 6D; first three zeros of and of derivative, , 6D; real and imaginary parts of , , , , , 8S.
For other tables prior to 1961 see Fletcher et al. (1962) and Lebedev and Fedorova (1960).
| 2013-12-13T10:58:20 |
{"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.9250844120979309, "perplexity": 6005.532947602167}, "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-2013-48/segments/1386164931675/warc/CC-MAIN-20131204134851-00046-ip-10-33-133-15.ec2.internal.warc.gz"}
|
https://zbmath.org/authors/?q=ai%3Aagranovich.mikhail-s
|
## Agranovich, Mikhail Semënovich
Compute Distance To:
Author ID: agranovich.mikhail-s Published as: Agranovich, M. S.; Agranovich, Mikhail S.; Agranovič, Mikhail Semenovich; Agranovich, Mikhail more...less Further Spellings: Агранович Михаил Семёнович; Агранович Михаил Семенович External Links: MGP · Wikidata · Math-Net.Ru · GND
Documents Indexed: 88 Publications since 1954, including 2 Books 2 Contributions as Editor · 1 Further Contribution Biographic References: 5 Publications Co-Authors: 87 Co-Authors with 31 Joint Publications 2,846 Co-Co-Authors
all top 5
all top 5
### Serials
19 Functional Analysis and its Applications 13 Russian Mathematical Surveys 6 Russian Journal of Mathematical Physics 5 Soviet Mathematics. Doklady 4 Uspekhi Matematicheskikh Nauk [N. S.] 4 Funktsional’nyĭ Analiz i ego Prilozheniya 4 Transactions of the Moscow Mathematical Society 3 Doklady Akademii Nauk SSSR 3 Trudy Moskovskogo Matematicheskogo Obshchestva 2 Matematicheskiĭ Sbornik. Novaya Seriya 2 Journal of Mathematical Sciences (New York) 1 Izvestiya Vysshikh Uchebnykh Zavedeniĭ, Matematika 1 Mathematical Notes 1 Matematicheskie Zametki 1 Mathematische Nachrichten 1 Zeitschrift für Analysis und ihre Anwendungen 1 Mathematics of the USSR, Sbornik 1 St. Petersburg Mathematical Journal 1 Georgian Mathematical Journal 1 Memoirs on Differential Equations and Mathematical Physics 1 Sbornik: Mathematics 1 Vestnik Moskovskogo Universiteta. Seriya Matematiki, Mekhaniki, Astronomii, Fiziki, Khimii 1 Encyclopaedia of Mathematical Sciences 1 Itogi Nauki i Tekhniki. Seriya Sovremennye Problemy Matematiki. Fundamental’nye Napravleniya 1 Springer Monographs in Mathematics 1 Translations. Series 2. American Mathematical Society
all top 5
### Fields
60 Partial differential equations (35-XX) 22 Operator theory (47-XX) 12 History and biography (01-XX) 9 Global analysis, analysis on manifolds (58-XX) 7 Harmonic analysis on Euclidean spaces (42-XX) 5 Functional analysis (46-XX) 3 Optics, electromagnetic theory (78-XX) 3 Quantum theory (81-XX) 2 General and overarching topics; collections (00-XX) 1 Integral equations (45-XX) 1 Numerical analysis (65-XX) 1 Mechanics of deformable solids (74-XX) 1 Fluid mechanics (76-XX)
### Citations contained in zbMATH Open
55 Publications have been cited 739 times in 573 Documents Cited by Year
Elliptic problems with a parameter and parabolic problems of general type. Zbl 0137.29602
Agranovich, M. S.; Vishik, M. I.
1964
Sobolev spaces, their generalizations and elliptic problems in smooth and Lipschitz domains. Translated from the Russian. Zbl 1322.46002
Agranovich, Mikhail S.
2015
Elliptic boundary problems. Zbl 0880.35001
Agranovich, M. S.
1997
Generalized method of eigenoscillations in the diffraction theory. Zbl 0929.65097
Agranovich, M. S.; Katsenelenbaum, B. Z.; Sivov, A. N.; Voitovich, N. N.
1999
Elliptic singular integro-differential operators. Zbl 0149.36101
Agranovich, M. S.
1965
Spectral problems for second-order strongly elliptic systems in domains with smooth and nonsmooth boundaries. Zbl 1057.35019
Agranovich, M. S.
2002
Elliptic operators on closed manifolds. Zbl 0802.58050
Agranovich, M. S.
1990
Spectral properties of elliptic pseudodifferential operators on a closed curve. Zbl 0437.35073
Agranovich, M. S.
1980
Spectral problems for the Lamé system with spectral parameter in boundary conditions on smooth or nonsmooth boundary. Zbl 1059.74504
Agranovich, M. S.; Amosov, B. A.; Levitin, M.
1999
Remarks on potential spaces and Besov spaces in a Lipschitz domain and on Whitney arrays on its boundary. Zbl 1181.46022
Agranovich, M. S.
2008
Weakly smooth nonselfadjoint spectral elliptic boundary problems. Zbl 0932.35158
Agranovich, Mikhail; Denk, Robert; Faierman, Melvin
1997
On a mixed Poincaré-Steklov type spectral problem in a Lipschitz domain. Zbl 1162.35351
Agranovich, M. S.
2006
Regularity of variational solutions to linear boundary value problems in Lipschitz domains. Zbl 1169.35327
Agranovich, M. S.
2006
On elliptic pseudodifferential operators on a closed curve. Zbl 0573.35071
Agranovich, M. S.
1984
To the theory of the Dirichlet and Neumann problems for strongly elliptic systems in Lipschitz domains. Zbl 1159.35319
Agranovich, M. S.
2007
Potential type operators and transmission problems for strongly elliptic second-order systems in Lipschitz domains. Zbl 1272.47065
Agranovich, M. S.
2009
General boundary-value problems for elliptic systems in an $$n$$-dimensional domain. Zbl 0132.35403
Agranovich, M. S.; Dynin, A. S.
1962
On series with respect to root vectors of operators associated with forms having symmetric principal part. Zbl 0819.47025
Agranovich, M. S.
1994
Strongly elliptic second-order systems with spectral parameter in transmission conditions on a nonclosed surface. Zbl 1161.35453
Agranovich, M. S.
2006
Spectral boundary value problems in Lipschitz domains for strongly elliptic systems in Banach spaces $$H_p ^\sigma$$ and $$B_p^\sigma$$. Zbl 1169.35362
Agranovich, M. S.
2008
Spectral properties of potential type operators for a class of strongly elliptic systems on smooth and Lipschitz surfaces. Zbl 1056.35128
Agranovich, M. S.
2001
On elliptic pseudodifferential operators on a closed curve. Zbl 0584.35078
Agranovich, M. S.
1985
Spectral boundary value problems for the Helmholtz equation with spectral parameter in boundary conditions on a non-smooth surface. Zbl 0937.35026
Agranovich, M. S.; Mennicken, R.
1999
Estimates of $$s$$-numbers and spectral asymptotics for integral operators of potential type on nonsmooth surfaces. Zbl 0895.47014
Agranovich, M. S.; Amosov, B. A.
1996
Boundary value problems for systems of first order pseudodifferential operators. Zbl 0193.06605
Agranovich, M. S.
1969
Fractional powers of operators corresponding to coercive problems in Lipschitz domains. Zbl 1287.47030
Agranovich, M. S.; Selitskii, A. M.
2013
Mixed problems in a Lipschitz domain for strongly elliptic second-order systems. Zbl 1271.35024
Agranovich, M. S.
2011
Theorem on matrices depending on parameters and its applications to hyperbolic systems. Zbl 0253.35060
Agranovich, M. S.
1972
Strongly elliptic second-order systems with boundary conditions on a nonclosed Lipschitz surface. Zbl 1271.35023
Agranovich, M. S.
2011
Spectral problems for the Dirac system with spectral parameter in local boundary conditions. Zbl 1035.81017
Agranovich, M. S.
2001
Randwertprobleme für Systeme mit einem Parameter. Zbl 0207.10801
Agranovich, M. S.
1971
The generalized method of eigenoscillations in the diffraction theory. With a supplement by M. S. Agranovic: Spectral properties of diffraction problems. (Obobscennyi metod sobstvennyh kolebannii v teorii difrakcii. C dopolneniem M. S. Agranovica: Spektralnye sboistva zadac difrakcii.). Zbl 0384.35002
Vojtovich, N. N.; Katsenelenbaum, B. Z.; Sivov, A. N.
1977
Spectral problems in Lipschitz domains in Sobolev-type Banach spaces. Zbl 1327.35260
Agranovich, Mikhail S.
2015
On spectral properties of elliptic pseudo-differential operators far from self-adjoint ones. Zbl 0696.35123
Agranovich, M. S.; Markus, A. S.
1989
Some asymptotic formulas for elliptic pseudodifferential operators. Zbl 0631.35074
Agranovich, M. S.
1987
Partial differential equations with constant coefficients. Zbl 0101.07401
Agranovich, M. S.
1961
Boundary value problems for systems with a parameter. Zbl 0238.35014
Agranovich, M. S.
1971
Spectral properties of elliptic operators of negative order. Zbl 0738.58047
Agranovich, M. S.
1991
Summability of series in root vectors of non-self-adjoint elliptic operators. Zbl 0362.35062
Agranovich, M. S.
1977
Elliptic boundary value problems depending on a parameter. Zbl 0145.14701
Agranovich, M. S.; Vishik, M. I.
1963
Spectral problems in Lipschitz domains. Zbl 1277.35270
Agranovich, M. S.
2013
On modules of eigenvalues for non-selfadjoint Agmon-Douglis-Nirenberg elliptic boundary problems with a parameter. Zbl 0795.58047
Agranovich, M. S.
1992
Partial differential equations. IX: Elliptic boundary value problems. Transl. from the Russian. Zbl 0855.00007
1997
On convergence of series in the root vectors of operators that are close to self-adjoint ones. Zbl 0479.47012
Agranovich, M. S.
1980
Elliptic operators on compact manifolds. Zbl 0739.58061
Agranovich, M. S.
1990
Nonself-adjoint elliptic operators on nonsmooth domains. Zbl 0920.47042
Agranovich, Mikhail S.
1994
On elliptic matrix pseudodifferential operators on a closed curve. Zbl 0475.35083
Agranovich, M. S.; Amosov, B. A.
1981
On Fourier series in eigenfunctions of elliptic boundary value problems. Zbl 1050.35054
Agranovich, M. S.; Amosov, B. A.
2003
Remarks on strongly elliptic systems in Lipschitz domains. Zbl 1266.35048
Agranovich, M. S.
2012
Spectral problems in Sobolev-type Banach spaces for strongly elliptic systems in Lipschitz domains. Zbl 1366.35104
Agranovich, M. S.
2016
Series in the root vectors of operators that are very close to being self-adjoint. Zbl 0416.47005
Agranovich, M. S.
1978
Spektraleigenschaften elliptischer Pseudodifferentialoperatoren auf einer geschlossenen Kurve. Zbl 0423.35087
Agranovich, M. S.
1979
Positive boundary value problems for certain first order systems. (Über positive Randwertprobleme für gewisse Systeme erster Ordnung.) Zbl 0162.40801
Agranovich, M. S.
1967
Vladimir Alexandrovich Kondratiev. July 2, 1935–March 11, 2010. Zbl 1277.01013
Agranovich, M. S.; Astashova, I. V.; Bagirov, L. A.; Vlasov, V. V.; Zhikov, V. V.; Ilyashenko, Yu. S.; Kozlov, V. V.; Kon’kov, A. A; Pokhozhaev, S. I.; Radkevich, E. V.; Rozov, N. Kh.; Sergeev, I. N.; Skubachevskii, A. L.; Chechkin, G. A.; Shamaev, A. S.; Shaposhnikova, T. A.
2013
Non-self-adjoint problems with a parameter that are elliptic in the sense of Agmon-Douglis-Nirenberg. Zbl 0718.35032
Agranovich, M. S.
1990
Spectral problems in Sobolev-type Banach spaces for strongly elliptic systems in Lipschitz domains. Zbl 1366.35104
Agranovich, M. S.
2016
Sobolev spaces, their generalizations and elliptic problems in smooth and Lipschitz domains. Translated from the Russian. Zbl 1322.46002
Agranovich, Mikhail S.
2015
Spectral problems in Lipschitz domains in Sobolev-type Banach spaces. Zbl 1327.35260
Agranovich, Mikhail S.
2015
Fractional powers of operators corresponding to coercive problems in Lipschitz domains. Zbl 1287.47030
Agranovich, M. S.; Selitskii, A. M.
2013
Spectral problems in Lipschitz domains. Zbl 1277.35270
Agranovich, M. S.
2013
Vladimir Alexandrovich Kondratiev. July 2, 1935–March 11, 2010. Zbl 1277.01013
Agranovich, M. S.; Astashova, I. V.; Bagirov, L. A.; Vlasov, V. V.; Zhikov, V. V.; Ilyashenko, Yu. S.; Kozlov, V. V.; Kon’kov, A. A; Pokhozhaev, S. I.; Radkevich, E. V.; Rozov, N. Kh.; Sergeev, I. N.; Skubachevskii, A. L.; Chechkin, G. A.; Shamaev, A. S.; Shaposhnikova, T. A.
2013
Remarks on strongly elliptic systems in Lipschitz domains. Zbl 1266.35048
Agranovich, M. S.
2012
Mixed problems in a Lipschitz domain for strongly elliptic second-order systems. Zbl 1271.35024
Agranovich, M. S.
2011
Strongly elliptic second-order systems with boundary conditions on a nonclosed Lipschitz surface. Zbl 1271.35023
Agranovich, M. S.
2011
Potential type operators and transmission problems for strongly elliptic second-order systems in Lipschitz domains. Zbl 1272.47065
Agranovich, M. S.
2009
Remarks on potential spaces and Besov spaces in a Lipschitz domain and on Whitney arrays on its boundary. Zbl 1181.46022
Agranovich, M. S.
2008
Spectral boundary value problems in Lipschitz domains for strongly elliptic systems in Banach spaces $$H_p ^\sigma$$ and $$B_p^\sigma$$. Zbl 1169.35362
Agranovich, M. S.
2008
To the theory of the Dirichlet and Neumann problems for strongly elliptic systems in Lipschitz domains. Zbl 1159.35319
Agranovich, M. S.
2007
On a mixed Poincaré-Steklov type spectral problem in a Lipschitz domain. Zbl 1162.35351
Agranovich, M. S.
2006
Regularity of variational solutions to linear boundary value problems in Lipschitz domains. Zbl 1169.35327
Agranovich, M. S.
2006
Strongly elliptic second-order systems with spectral parameter in transmission conditions on a nonclosed surface. Zbl 1161.35453
Agranovich, M. S.
2006
On Fourier series in eigenfunctions of elliptic boundary value problems. Zbl 1050.35054
Agranovich, M. S.; Amosov, B. A.
2003
Spectral problems for second-order strongly elliptic systems in domains with smooth and nonsmooth boundaries. Zbl 1057.35019
Agranovich, M. S.
2002
Spectral properties of potential type operators for a class of strongly elliptic systems on smooth and Lipschitz surfaces. Zbl 1056.35128
Agranovich, M. S.
2001
Spectral problems for the Dirac system with spectral parameter in local boundary conditions. Zbl 1035.81017
Agranovich, M. S.
2001
Generalized method of eigenoscillations in the diffraction theory. Zbl 0929.65097
Agranovich, M. S.; Katsenelenbaum, B. Z.; Sivov, A. N.; Voitovich, N. N.
1999
Spectral problems for the Lamé system with spectral parameter in boundary conditions on smooth or nonsmooth boundary. Zbl 1059.74504
Agranovich, M. S.; Amosov, B. A.; Levitin, M.
1999
Spectral boundary value problems for the Helmholtz equation with spectral parameter in boundary conditions on a non-smooth surface. Zbl 0937.35026
Agranovich, M. S.; Mennicken, R.
1999
Elliptic boundary problems. Zbl 0880.35001
Agranovich, M. S.
1997
Weakly smooth nonselfadjoint spectral elliptic boundary problems. Zbl 0932.35158
Agranovich, Mikhail; Denk, Robert; Faierman, Melvin
1997
Partial differential equations. IX: Elliptic boundary value problems. Transl. from the Russian. Zbl 0855.00007
1997
Estimates of $$s$$-numbers and spectral asymptotics for integral operators of potential type on nonsmooth surfaces. Zbl 0895.47014
Agranovich, M. S.; Amosov, B. A.
1996
On series with respect to root vectors of operators associated with forms having symmetric principal part. Zbl 0819.47025
Agranovich, M. S.
1994
Nonself-adjoint elliptic operators on nonsmooth domains. Zbl 0920.47042
Agranovich, Mikhail S.
1994
On modules of eigenvalues for non-selfadjoint Agmon-Douglis-Nirenberg elliptic boundary problems with a parameter. Zbl 0795.58047
Agranovich, M. S.
1992
Spectral properties of elliptic operators of negative order. Zbl 0738.58047
Agranovich, M. S.
1991
Elliptic operators on closed manifolds. Zbl 0802.58050
Agranovich, M. S.
1990
Elliptic operators on compact manifolds. Zbl 0739.58061
Agranovich, M. S.
1990
Non-self-adjoint problems with a parameter that are elliptic in the sense of Agmon-Douglis-Nirenberg. Zbl 0718.35032
Agranovich, M. S.
1990
On spectral properties of elliptic pseudo-differential operators far from self-adjoint ones. Zbl 0696.35123
Agranovich, M. S.; Markus, A. S.
1989
Some asymptotic formulas for elliptic pseudodifferential operators. Zbl 0631.35074
Agranovich, M. S.
1987
On elliptic pseudodifferential operators on a closed curve. Zbl 0584.35078
Agranovich, M. S.
1985
On elliptic pseudodifferential operators on a closed curve. Zbl 0573.35071
Agranovich, M. S.
1984
On elliptic matrix pseudodifferential operators on a closed curve. Zbl 0475.35083
Agranovich, M. S.; Amosov, B. A.
1981
Spectral properties of elliptic pseudodifferential operators on a closed curve. Zbl 0437.35073
Agranovich, M. S.
1980
On convergence of series in the root vectors of operators that are close to self-adjoint ones. Zbl 0479.47012
Agranovich, M. S.
1980
Spektraleigenschaften elliptischer Pseudodifferentialoperatoren auf einer geschlossenen Kurve. Zbl 0423.35087
Agranovich, M. S.
1979
Series in the root vectors of operators that are very close to being self-adjoint. Zbl 0416.47005
Agranovich, M. S.
1978
The generalized method of eigenoscillations in the diffraction theory. With a supplement by M. S. Agranovic: Spectral properties of diffraction problems. (Obobscennyi metod sobstvennyh kolebannii v teorii difrakcii. C dopolneniem M. S. Agranovica: Spektralnye sboistva zadac difrakcii.). Zbl 0384.35002
Vojtovich, N. N.; Katsenelenbaum, B. Z.; Sivov, A. N.
1977
Summability of series in root vectors of non-self-adjoint elliptic operators. Zbl 0362.35062
Agranovich, M. S.
1977
Theorem on matrices depending on parameters and its applications to hyperbolic systems. Zbl 0253.35060
Agranovich, M. S.
1972
Randwertprobleme für Systeme mit einem Parameter. Zbl 0207.10801
Agranovich, M. S.
1971
Boundary value problems for systems with a parameter. Zbl 0238.35014
Agranovich, M. S.
1971
Boundary value problems for systems of first order pseudodifferential operators. Zbl 0193.06605
Agranovich, M. S.
1969
Positive boundary value problems for certain first order systems. (Über positive Randwertprobleme für gewisse Systeme erster Ordnung.) Zbl 0162.40801
Agranovich, M. S.
1967
Elliptic singular integro-differential operators. Zbl 0149.36101
Agranovich, M. S.
1965
Elliptic problems with a parameter and parabolic problems of general type. Zbl 0137.29602
Agranovich, M. S.; Vishik, M. I.
1964
Elliptic boundary value problems depending on a parameter. Zbl 0145.14701
Agranovich, M. S.; Vishik, M. I.
1963
General boundary-value problems for elliptic systems in an $$n$$-dimensional domain. Zbl 0132.35403
Agranovich, M. S.; Dynin, A. S.
1962
Partial differential equations with constant coefficients. Zbl 0101.07401
Agranovich, M. S.
1961
all top 5
all top 5
### Cited in 173 Serials
45 Journal of Mathematical Sciences (New York) 24 Functional Analysis and its Applications 22 Mathematical Notes 22 Ukrainian Mathematical Journal 18 Journal of Differential Equations 15 Journal of Mathematical Analysis and Applications 15 Integral Equations and Operator Theory 15 Siberian Mathematical Journal 14 Journal of Functional Analysis 13 Mathematical Methods in the Applied Sciences 12 Russian Journal of Mathematical Physics 11 Communications in Partial Differential Equations 8 Differential Equations 8 Journal of Pseudo-Differential Operators and Applications 7 Mathematische Nachrichten 7 St. Petersburg Mathematical Journal 7 Lobachevskii Journal of Mathematics 6 Georgian Mathematical Journal 5 Journal d’Analyse Mathématique 5 Journal of Applied Mathematics and Mechanics 5 Journal of Computational Physics 5 Annales de l’Institut Fourier 5 Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods 5 Numerische Mathematik 5 Journal de Mathématiques Pures et Appliquées. Neuvième Série 5 Journal of Mathematical Fluid Mechanics 5 Journal of Evolution Equations 4 Journal of Computational and Applied Mathematics 4 Journal of Soviet Mathematics 4 Journal of Integral Equations and Applications 4 The Journal of Fourier Analysis and Applications 4 Matematicheskie Trudy 4 Communications on Pure and Applied Analysis 4 Boundary Value Problems 4 Transactions of A. Razmadze Mathematical Institute 4 Journal of Siberian Federal University. Mathematics & Physics 3 Archive for Rational Mechanics and Analysis 3 Communications in Mathematical Physics 3 Letters in Mathematical Physics 3 Russian Mathematical Surveys 3 Annali di Matematica Pura ed Applicata. Serie Quarta 3 Proceedings of the American Mathematical Society 3 Publications of the Research Institute for Mathematical Sciences, Kyoto University 3 Rendiconti del Seminario Matematico della Università di Padova 3 Results in Mathematics 3 Zeitschrift für Analysis und ihre Anwendungen 3 Journal of Scientific Computing 3 Journal of Contemporary Mathematical Analysis. Armenian Academy of Sciences 3 Journal of Elasticity 3 Proceedings of the Royal Society of Edinburgh. Section A. Mathematics 3 SIAM Journal on Applied Mathematics 3 SIAM Journal on Mathematical Analysis 3 Abstract and Applied Analysis 3 Acta Mathematica Sinica. English Series 3 Sibirskie Èlektronnye Matematicheskie Izvestiya 3 European Series in Applied and Industrial Mathematics (ESAIM): Mathematical Modelling and Numerical Analysis 3 Annali della Scuola Normale Superiore di Pisa. Scienze Fisiche e Matematiche. III. Ser 3 Complex Variables and Elliptic Equations 3 Complex Analysis and Operator Theory 3 Journal of Spectral Theory 3 Eurasian Mathematical Journal 2 Inverse Problems 2 Lithuanian Mathematical Journal 2 Moscow University Mathematics Bulletin 2 ZAMP. Zeitschrift für angewandte Mathematik und Physik 2 Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV 2 Mathematische Annalen 2 Mathematische Zeitschrift 2 Mathematika 2 Monatshefte für Mathematik 2 Semigroup Forum 2 Transactions of the American Mathematical Society 2 Transactions of the Moscow Mathematical Society 2 Annals of Global Analysis and Geometry 2 Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Serie IX. Rendiconti Lincei. Matematica e Applicazioni 2 The Journal of Geometric Analysis 2 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 2 Russian Mathematics 2 Potential Analysis 2 Advances in Computational Mathematics 2 Opuscula Mathematica 2 Izvestiya: Mathematics 2 Doklady Mathematics 2 Journal of Dynamical and Control Systems 2 Comptes Rendus. Mathématique. Académie des Sciences, Paris 2 Analysis and Applications (Singapore) 2 Mediterranean Journal of Mathematics 2 Inverse Problems and Imaging 2 Analysis and Mathematical Physics 2 Open Mathematics 2 Journal of Elliptic and Parabolic Equations 1 International Journal of Modern Physics A 1 Applicable Analysis 1 Israel Journal of Mathematics 1 Mathematical Biosciences 1 Mathematical Proceedings of the Cambridge Philosophical Society 1 Theoretical and Mathematical Physics 1 Zhurnal Vychislitel’noĭ Matematiki i Matematicheskoĭ Fiziki 1 Mathematics of Computation 1 Reviews in Mathematical Physics ...and 73 more Serials
all top 5
### Cited in 39 Fields
455 Partial differential equations (35-XX) 140 Operator theory (47-XX) 66 Global analysis, analysis on manifolds (58-XX) 47 Functional analysis (46-XX) 46 Ordinary differential equations (34-XX) 46 Fluid mechanics (76-XX) 45 Mechanics of deformable solids (74-XX) 34 Numerical analysis (65-XX) 23 Quantum theory (81-XX) 19 Harmonic analysis on Euclidean spaces (42-XX) 18 Integral equations (45-XX) 16 Optics, electromagnetic theory (78-XX) 15 Potential theory (31-XX) 14 Calculus of variations and optimal control; optimization (49-XX) 8 Probability theory and stochastic processes (60-XX) 7 Real functions (26-XX) 6 Differential geometry (53-XX) 6 Systems theory; control (93-XX) 5 Functions of a complex variable (30-XX) 5 Biology and other natural sciences (92-XX) 4 Dynamical systems and ergodic theory (37-XX) 4 Approximations and expansions (41-XX) 4 Abstract harmonic analysis (43-XX) 4 Statistical mechanics, structure of matter (82-XX) 3 $$K$$-theory (19-XX) 3 Topological groups, Lie groups (22-XX) 3 Integral transforms, operational calculus (44-XX) 3 Algebraic topology (55-XX) 3 Manifolds and cell complexes (57-XX) 3 Mechanics of particles and systems (70-XX) 3 Geophysics (86-XX) 2 Several complex variables and analytic spaces (32-XX) 2 Special functions (33-XX) 2 Difference and functional equations (39-XX) 2 General topology (54-XX) 2 Classical thermodynamics, heat transfer (80-XX) 2 Relativity and gravitational theory (83-XX) 1 Sequences, series, summability (40-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.
| 2022-08-19T04:59: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": 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.6614253520965576, "perplexity": 3400.676174669061}, "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/1659882573623.4/warc/CC-MAIN-20220819035957-20220819065957-00593.warc.gz"}
|
https://stats.libretexts.org/Sandboxes/moja_at_taftcollege.edu/PSYC_2200%3A_Elementary_Statistics_for_Behavioral_and_Social_Science_(Oja)_WITHOUT_UNITS/zz%3A_Back_Matter/20%3A_Glossary
|
# Glossary
Example and Directions
Words (or words that have the same definition) The definition is case sensitive (Optional) Image to display with the definition [Not displayed in Glossary, only in pop-up on pages] (Optional) Caption for Image (Optional) External or Internal Link (Optional) Source for Definition
(Eg. "Genetic, Hereditary, DNA ...") (Eg. "Relating to genes or heredity") The infamous double helix https://bio.libretexts.org/ CC-BY-SA; Delmar Larsen
Glossary Entries
Word(s)
Definition
Statistical analysis, statistical analyses
Procedures to organize and interpret numerical information
CC-BY Michelle Oja
Statistic The results of statistical analyses CC-BY Michelle Oja
Independent Variable, IV The variable that the researcher thinks is the cause of the effect (the DV). The IV is sometimes also called a "predictor" or "predicting variable". CC-BY Michelle Oja
Dependent Variable, DV
The variable that you think is the effect (the thing that the IV changes). The DV is the outcome variable, the thing that you want to improve.
CC-BY Michelle Oja
Sample, samples People who participate in a study; the smaller group that the data is gathered from. CC-BY Michelle Oja
Population The biggest group that your sample can represent. CC-BY Michelle Oja
Ratio True numerical scale of measurement; type of variable that is measured, and zero means that there is none of it. CC-BY Michelle Oja
Interval Created numerical scale of measurement; type of variable that is measured, and the intervals between each measurement are equal (but zero does not mean the absence of the measured item). CC-BY Michelle Oja
Ordinal Scale of measurement in which levels have an order; a type of variable that can be put in numerical order. The variables are in ranks (first, second, third, etc.). CC-BY Michelle Oja
Nominal Scale of measurement that names the variable's levels; type of variable that has a quality or name, but not a number that means something. CC-BY Michelle Oja
Quantitative variable, quantitative variables Type of variable that is measured with some sort of scale that uses numbers that measure something. CC-BY Michelle Oja
Qualitative variable, qualitative variables Type of variable that has different values to represent different categories or kinds This is the same as the nominal scale of measurement. CC-BY Michelle Oja
Frequency Table Table showing each score in the “x” column, and how many people earned that score in the “f” column. The “x” stands in for whatever the score is, and the “f” stands for frequency. CC-BY Michelle Oja
Outlier An extreme score, a score that seems much higher or much lower than most of the other scores (There is a technical way to calculate whether a score is an outlier or not, but you don't need to know it.) CC-BY Michelle Oja
Skew, skewed distribution A distribution in which many scores are bunched up to one side, and there are only a few scores on the other side. CC-BY Michelle Oja
Positive skew The scores are bunched to the left, and the thin tail is pointing to the right. Positive skew is shown on the right panel. Rodolfo Hermans (Godot), CC BY-SA 3.0 via Wikimedia Commons CC-BY Michelle Oja
Negative skew The scores are bunched to the right, and the thin tail is pointing to the left. Negative skew is shown on the left panel. Rodolfo Hermans (Godot), CC BY-SA 3.0 via Wikimedia Commons CC-BY Michelle Oja
Kurtosis A measure of the “tailedness” of the distribution of data (how wide or broad the distribution is) Example of different types of kurtosis. Larry Green, CC-BY CC-BY Michelle Oja
Leptokurtic A tall and narrow distribution of data. The tallest (blue) line is a leptokurtic shape. Larry Green, CC-BY CC-BY Michelle Oja
Platykurtic A wide and flat distribution of data. The lowest (red) line is a platykurtic shape. Larry Green, CC-BY CC-BY Michelle Oja
Mesokurtic A medium, bell-sharped distribution of data. The middle (black) line is a mesokurtic shape. Larry Green, CC-BY CC-BY Michelle Oja
Frequency Distribution A distribution of data showing a count of frequency (how many) for each score or data point. CC-BY Michelle Oja
Range The difference between the highest score and the lowest score in a distribution of quantitative data. CC-BY Michelle Oja
Robust A term used by statisticians to mean resilient or resistant to CC-BY-NC-SA Foster et al.
Descriptive Statistics Used to describe or summarize the data from the sample. CC-BY Michelle Oja
Inferential Statistics Used to make generalizations from the sample data to the population of interest. CC-BY Michelle Oja
Parameter Statistic describing characteristics of the population (usually mean and standard deviation of the population) CC-BY Michelle Oja
Non-Parametric Analysis, non-parametric analyses Statistical analyses using ranked data; used when data sets are not normally distributed or with ranked data CC-BY Michelle Oja
Research Hypothesis A prediction of how groups are related. When comparing means, a complete research hypothesis includes:
1. The name of the groups being compared. This is sometimes considered the IV.
2. What was measured. This is the DV.
3. Which group are we predicting will have the higher mean.
CC-BY Michelle Oja
Null Hypothesis A prediction that nothing is going on. The null hypothesis is always:
1. There is no difference between the groups’ means
OR
2. There is no relationship between the variables.
CC-BY Michelle Oja
Absolute value Any number converted to a positive value https://crumplab.github.io/statistic...ibingData.html CC-BY-SA Mattew J. C. Crump
Main Effect Any statistically significant differences between the levels of one independent variable in a factorial design. CC-BY-SA Mattew J. C. Crump
Interaction, interaction effect How the levels of two or more IVs jointly affect a DV; when one IV interacts with the other IV to affect the DV. CC-BY Michelle Oja
Positive Correlation When two quantitative variables vary together in the same direction; when one increases, the other one also increases (and when one decreases, the other also decreases) CC-BY Michelle Oja
Negative Correlation When two quantitative variables vary in opposite directions; when one variable increases, the other variable decreases. CC-BY Michelle Oja
Binary variable, binary A binary variable is a variable that only has two options (yes or no). Binary variables can be considered quantitative or qualitative. CC-BY- Michelle Oja
Dichotomous variable, dichotomous A dichotomous variable is a variable that only has two options (yes or no). Binary variables can be considered quantitative or qualitative. CC-BY- Michelle Oja
| 2022-12-01T16:54: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": 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.5709739327430725, "perplexity": 5311.780399559913}, "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/1669446710829.5/warc/CC-MAIN-20221201153700-20221201183700-00782.warc.gz"}
|
https://firas.moosvi.com/oer/physics_bank/content/public/018.Electrostatics/Electric%20Potential/Dielectric%20breakdown%20of%20air/Dielectric%20breakdown%20of%20air.html
|
# Dielectric breakdown of air#
The electric field strength that causes the breakdown of dry air is $$3.00\times 10^6\rm\ V/m$$.
## Question Text#
If the potential difference across a pair of parallel conducting plates is 4600 $$\rm\ V$$, at what distance between the plates will breakdown just start to occur? Give your answer in units of $$\rm mm$$.
### Answer Section#
Please enter a numeric value.
## Attribution#
Problem is from the OpenStax University Physics Volume 2 textbook, licensed under the CC-BY 4.0 license.
| 2023-02-03T06:13: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.5038436055183411, "perplexity": 1542.4670978843858}, "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-06/segments/1674764500044.16/warc/CC-MAIN-20230203055519-20230203085519-00572.warc.gz"}
|
https://gssc.esa.int/navipedia/index.php/MBOC_Modulation
|
If you wish to contribute or participate in the discussions about articles you are invited to join Navipedia as a registered user
# MBOC Modulation
Fundamentals
Title MBOC Modulation
Author(s) J.A Ávila Rodríguez, University FAF Munich, Germany.
Year of Publication 2011
## MBOC modulation definition and analysis
Nearly twenty months after the EU and the US signed the Agreement on the Promotion, Provision and use of Galileo and GPS Satellite-Based Navigation Systems and Related Applications an optimized signal waveform named MBOC (Multiplexed Binary Offset Carrier modulation) was proposed by a common group of experts of the EU and US for GPS L1C and Galileo E1 OS [G.W. Hein et al., 2006a][1], [G.W. Hein et al., 2006b] [2] and [J.-A. Avila-Rodriguez et al., 2006d] [3].
Except for the fact that the CBCS definition requires Interplex to multiplex all the signals, the MBOC modulation can be seen a particular case of the CBCS solution where the BCS sequence adopts the known sine-phased BOC-like form. In this sense, MBOC(6,1,1/11) could also be expressed as CBCS([1,-1,1,-1,1,-1,1,-1,1,-1,1,-1],1,1/11) if the requirement on the Interplex Multiplexing were abandoned. The main objective of the common GPS and Galileo signal design activity was that the PSD of the proposed solution would be identical for GPS L1C and Galileo E1 OS when the pilot and data components are computed together. This assures a high interoperability between both signals. This normalized (unit power) power spectral density, specified without the effect of band-limiting filters and payload imperfections, is given by
where the high BOC frequency component, that is BOC(6,1), is shown to be:
with $f_c = 1.023 MHz$. Equally, the low BOC frequency component, namely BOC(1,1) will be:
and thus:
Additional conclusions can be drawn from analysing the spectral shape of MBOC. Indeed, as shown in [J.-A. Avila-Rodriguez et al., 2006b][4] an ideal power spectral density regarding the tracking performance should be inversely proportional to the square of the frequency, according to (see CBCS Modulation):
It must be noted that such a spectrum would have nevertheless other non-desirable properties with regards to its implementation. However, if we look now at the envelope of the well-known power spectral densities of BPSK(1) and BOC(1,1) we can clearly recognize that their envelopes interestingly decay with $1/f^2$, as Figure 1 shows next. Moreover, MBOC seems to follow pretty well this desirable pattern too. In fact, this was one of the figures in the mind of all those people involved in the optimization of the Galileo OS in E1.
Figure 1: Decay of the envelopes of the power spectral densities of BOC(1,1) – in blue – and BPSK(1) – in black. As it can be clearly seen, the selected MBOC signal for GPS L1C and Galileo E1 OS – in red – follows a similar pattern.
We show in the next figure all the Galileo and GPS signals in the E1/L1-band.
Figure 2: GPS and Galileo Spectra in E1/L1.
## Implementing MBOC
Once we have defined the power spectral density of MBOC, it is the right moment to talk about the implementation. Indeed, different time representations result in the same power spectral density and the Agreement between the EU and the US on MBOC left this freedom to both parties so that each could implement its own solution according to its own conception. Two solutions have been realized to implement MBOC:
• CBOC: The Composite BOC is the solution adopted by Galileo for the Open Service in E1/L1. It is an Interplex multiplexing where the sub-carriers BOC(1,1) and BOC(6,1) are added in anti-phase on each channel.
• TMBOC: The Time-Multiplexed BOC is the solution adopted by GPS for L1C. It is a binary signal where BOC(1,1) and BOC(6,1) are time-multiplexed according to a pre-established pattern that was optimized to improve the correlation properties of the signal when the effect of the PRN code is taken into account.
It is interesting to mention that between CBCS and the final MBOC(6,1) there was an intermediate solution that was object of interest for a short period of time. This was the so called MBOC(4,1).
One final but important comment is related to the power allocated on the high frequency component of MBOC, namely BOC(6,1). Indeed, the 1/11 of power refers to the power at generation, without accounting for the effect of the satellite’s filter and other imperfections. This is so because as we know, MBOC admits different implementations, being one of them TMBOC. If we would define the exact power split at user level, the power at generation would be different depending on the final implementation. TMBOC accomplishes the required power percentage by time-multiplexing BOC(6,1) and BOC(1,1) so that 1/11 of the time the satellite transmits BOC(6,1) and the rest of the time BOC(1,1). Since the GPS L1C codes have a length of 10,230 chips, this percentage incorporates the factorial decomposition of 10,230. It is trivial to show that and indeed 11 was found to be the optimum number to divide the transmission periods of the multiplexing signals of GPS L1C. Indeed, 1/11 of the time was long enough to considerably improve the performance with respect to BOC(1,1) but not so long to concentrate too much power on the high frequencies and overlap the M-Code and PRS to non acceptable levels.
Finally, it is important to mention that in the case of CBOC, the generation of power presents no limitations since this is achieved by correspondingly modulating the amplitude.
## On MBOC and Antisymmetric sequences
Before we describe the performance of MBOC regarding the characteristics and details of its different implementations, let us first make some final comments on the MBOC spectrum and the ideas behind.
MBOC implementation ( CBOC) is the result of an additive and subtractive mixture of two separate spreading symbols. Moreover, we have already noted that some Binary Coded Symbols (BCS) sequences can potentially cause tracking bias in receivers adapted to receive only one of the spreading symbols. This was indeed one of the main disadvantages of CBCS. The solution to this problem was given by MBOC and the key concept is antisymmetric sequences. Since BOC(1,1) is antisymmetric, receiver biases can be avoided by choosing the correct properties for the partner spreading symbol sequence.
Compatibility with BOC(1,1) receivers was a major driver in the design of the optimized Galileo signal. As a result of this, having BOC(1,1) a partner spreading symbol sequence with zero cross-correlation became one of the most important drivers in the design of the Galileo OS in E1.
After CBCS was proposed, a new BCS solution that could avoid all the CBCS modulations drawbacks was the objective of the works of US and EU. We can summarize the properties that this desired BCS sequence should present:
• Anti-symmetry
• Balance (zero-sum) for the sequence
• Zero crosscorrelation with the partner sequence
As shown in [A.R. Pratt et al., 2006][5] a comprehensive search for binary sequences was conducted with some or all of these properties. These are listed below for a variety of sequence lengths $n$, all divisible by 2, from 2 to 12. Moreover, we show only distinct sequences so that the tables contain ${x_i}$ but not the time reversed versions $\left \{-x_i\right \}, \left \{x_{n-1-i}\right \} or \left \{-x{n-1-i} \right \}$. Since the sequences are antisymmetric, they may be considered to be constructed from a base sequence $\left \{ \hat y \right \}$ of length $n$ as shown in the following equation:
All antisymmetric sequences, of even length $n$ are balanced. The next tables show the cross-correlation with a BOC(1,1) partner sequence, under the assumption that the spreading symbol durations are common, that is the duration of an sequence is identical with that of an sequence, for example.
Moreover, the cross-correlation between $x_0 = BOC(1,1)$ and the corresponding [Binary Coded Symbols (BCS) |BCS sequence]] $x_k$ is shown to be:
where "mod" represents the modulo operation.
frameless frameless frameless frameless frameless frameless
From the tables, it can be seen that only tables for , that is , have any entries with zero crosscorrelation with BOC(1,1). For , there is only 1 sequence corresponding to a BOC(2,1) spreading symbol modulation. For , there are 3 permissible sequences, $x_3,x_4,x_5$. Of these, $x_4$ corresponds to the BOC(4,1) modulation. Finally for , there are 6 possible sequences, $x_7,x_{10},x_{13}, x_{17},x_{18}$ where $x_{17}$ corresponds to BOC(6,1), one of the solutions and indeed the best in terms of performance.
## MBOC Tracking Sensitivity
As shown in [O. Julien, 2005] [6], we can distinguish two types of tracking sensitivity:
• Code Tracking Sensitivity (DLL)
• Carrier Tracking Sensitivity (PLL)
We describe the MBOC properties regarding Code Tracking sensitivity in detail.
### Code Tracking Sensitivity
Following the definition from [O. Julien, 2005][6], the tracking sensitivity can be defined as the minimum pre-correlation Signal to Noise Ratio (SNR) that is necessary to correctly track a desired signal. To correctly track, the post-correlation SNR should be as high as possible, what can be achieved by different means. Whatever the followed approach is, the main objective is always to increase the correlation gain, which is the ratio between the post-correlation SNR and pre-correlation SNR.
According to [O. Julien, 2005][6], the post-correlation $SNR_{post}$ is shown to be
where
• $\varepsilon_{\tau}$ is the code delay
• $\tilde{R}$ is the correlation of the filtered incoming signal with the local replica
• $N_0$ is the noise power density
• $P$ is the power of the desired signal
• and $T_I$ is the coherent integration time.
On the other hand, the pre-correlation SNR adopts the following form:
where $\beta_r$ is the pre-correlation bandwidth.
Therefore the correlation gain can be expressed as [R. Watson, 2005][7]
which can be further simplified to
as also shown in [O. Julien, 2005] [6].
#### Effect of longer integrations on code tracking sensitivity
If we take a closer look into the expressions above, we can clearly see that the most straightforward way of improving the tracking sensitivity is to increase the coherent integration $T_I$ as much as possible. Unfortunately, this is not always possible due to the presence of data bits or secondary codes. Additionally, even though it were possible to integrate for long periods of time in the absence of data, other major problems coming from the code and phase delay variation during the integration would appear.
The best known solution to overcome this problem is the use of standard non-coherent summations according to the following expression
where $I_k$ and $Q_k$ correspond to the in-phase and quadrature non-coherent correlation inputs obtained over a coherent integration time $T_I$. Moreover M is the number of values used for the non-coherent integration and $Y_{st}$, as defined in (12) can be used to apply the Neumann-Pearson lemma, as this lemma allows one to obtain a powerful test in the case of two simple alternative hypotheses $H_1$ and $H_2$.
By doing so, further correlation gain can be reached but due to the squaring in the expression above the process is subject to the so-called squaring losses that reduce the total gain [M.M. Chansarkar and L. Garin, 2000][8] and [G.D. MacGougan, 2003][9]. The squaring loss depends on the SNR before the non-coherent integration is realized and is higher the lower the SNR. Thus, long coherent integration is desirable before the non-coherent correlation is applied, in order to reach a good SNR before accumulating. Indeed, by non-coherent integrating we increase the power of our desired signal but since the noise is not eliminated as with the coherent integration, the gain in power is lower than the increase of noise.
According to this scheme, depending on whether the desired signal is or is not present in the searching bin, the variable Zk will present a Ricean or Rayleigh distribution correspondingly. Indeed, it can be shown that if the desired signal is present, a Ricean distribution holds, which has the following probability density function [J.-A. Avila-Rodriguez et al., 2006b][4]:
where z is the test variable, A is the signal amplitude, $\sigma^2$ the noise power and $I_0\left ( \right )$ the zero-order modified Bessel function of the first kind. According to this, if the output SNR is defined as:
where
the squaring loss can be obtained according to [G. Lachapelle, 2004] [10] as follows:
as shown graphically in the following figure:
Figure 3: Squaring Loss as a function of the SNR after coherent integration (before the non-coherent accumulation).
Reading the squaring losses from the figure above, the total processing gain with respect to the pre-correlation SNR can be easily calculated [J.-A. Avila-Rodriguez et al., 2006b][4]:
where
• $G$ is the total processing gain (dB) with respect to the pre-correlation SNR,
• $G_{NC}$ is the non-coherent signal gain from the non-coherent integration alone,
• $\beta_r$ is the pre-detection bandwidth,
• $T_I$is the total coherent integration time,
• $M$ is the number of non-coherent integrations,
• and $S_L$ are the squaring losses that we defined above.
The main drawback from the standard non-coherent integration comes from the fact that the noise is squared. Alternative expressions have been studied in the literature to sort out this problem as explained in [J.-A. Avila-Rodriguez et al., 2005c][11] and [G. Lachapelle, 2004] [10]. One of those is the non-coherent differential correlation dc, also known as dot-product correlation, which is based on multiplying consecutive samples. One of its multiple expressions is:
where $I_i$ and $Q_i$ denote again the output of the coherent integration process. Since now the input i is multiplied with the input i-1, better results are expected in the ideal case, given that the noise is uncorrelated in the time with itself. This is in fact what the simulations show. However, this algorithm presents a main drawback due to its high sensitivity to Doppler.
In the previous lines we have briefly discussed the most straightforward way of increasing tracking sensitivity by increasing the total integration time. Additionally, there exist other ways of increasing the post-correlation SNR such as increasing the signal power at the satellite. Unfortunately, this would have extremely negative effects on interference with already existing terrestrial systems.
#### Signal structure and DLL code tracking error
Fortunately, there is another way of increasing the per se tracking sensitivity of a receiver, which is based on the signal structure of the desired signal. As we know, any DLL configuration is usually based on the combination of early and late correlators, so that the noise correlation of each output is also important to the resulting combined noise. Here plays the signal structure an outstanding role since the DLL tracking sensitivity will be affected by the selection of the signal waveform. In the next lines, we will show the theoretical tracking performance of MBOC and we will compare it with that of BOC(1,1) and the C/A Code.
If perfect normalization is assumed and the loop bandwidth is negligible compared with the bandwidth of the discriminator noise, [J.K. Holmes, 2000][12] and [O. Julien, 2005][6]: have shown that the DLL estimated code delay tracking error variance with Gaussian noise yields:
where
• $disc$ refers to the type of discriminator,
• $S_{N_{disc}}$ is the discriminator noise PSD,
• $B_L$ is the loop bandwidth,
• $T_I$ TI is the integration time, and
• $K_{disc}$ is the loop gain associated to the discriminator, with $K_{disc} = \frac {dD_{disc}}{d\varepsilon_{\tau}} \Bigg | _{ \delta_ \tau = 0}$, where $D_{disc}$ is the discriminator function.
Additionally, since the noise power spectral density that results from multiplying the incoming signal with the local replica is very wide band, we can approximate the expression above by the following [O. Julien, 2005] [6]:
where $\sigma^2_{D_{disc}}$ represents the discriminator output standard deviation without normalizing. This expression is very close to that of the PLL, with the difference that the effect of the normalization (through $K_{disc}$) has been introduced here. This means in other words, that the DLL tracking error is directly dependent upon the discriminator resistance to noise, and thus on the signal structure.
If perfect normalization is assumed again, no frequency uncertainty is considered, a front-end filter with ideal unity gain and receiver bandwidth $\beta_r$ and a code delay error remaining small, the DLL tracking error variance produced by use of an EMLP discriminator is shown to be [O. Julien, 2005] [6] and [J.W. Betz and K.R. Kolodziejski, 2000] [13]:
where $\beta_r$ is the receiver bandwidth and $\delta$the correlator spacing of the receiver.
Figure 4: Pseudorange Code Measurement Accuracy as a function of the discriminator spacing.
In the figure above, derived according to [J.W. Betz and K.R. Kolodziejski, 2000] [13], a receiver bandwidth $\beta_r$ of 24 MHz, a loop bandwidth $B_L$ of 1 Hz, a $C/N_0$ of 45 dB-Hz and a coherent integration time $T_I$ of 4 ms were used for BOC(1,1) and MBOC(6,1,11). For BPSK(1), 20 ms coherent integration were assumed. It is important to note that other alternative models have been derived to describe the behaviour of the code tracking noise for spacing values close to zero as shown in [T. Pany et al., 2002][14]. In addition, similar figures could also be obtained for different receiver discriminators. One final comment on the figure above is that MBOC has got less dangerous regions than CBCS* regarding the code spacing what was also an important advantage in favour of MBOC.
Equally, as derived in [O. Julien, 2005] [6], the DLL tracking error variance using a Dot Product (DP) discriminator presents the following expression:
which simplifies for the case that an infinite receiver bandwidth is assumed, yielding:
where $\alpha$ is the slope of the autocorrelation function around the main peak. The above derived expressions are in consonance with the results obtained in [L. Ries et al., 2003][15] and [O. Julien, 2005] [6] and confirm the fact that depending on the slope of the autocorrelation function of the signal waveform around the main peak, the tracking performance and achievable sensitivity will be better or worse, as we expected. Indeed, the steeper the autocorrelation function around the main peak is, the better the performance of the signal will be in terms of standard error.
Additionally, we can see from the expressions above that if an infinite front-end filter bandwidth is assumed, the squaring losses for the Dot Product (DP) discriminator do not depend on the signal structure any more, while for case of the Early Minus Late Power (EMLP) discriminator they do depend, being these larger the steeper the autocorrelation function around the main peak.
If we take a look now at Figure 5 next, we can recognize that while the GPS C/A code presents a slope value of $\alpha = 1$, for BOC(1,1) the slope around the main peak is of $\alpha = 3$, resulting thus in an improvement of the tracking error standard deviation of 2.4 dB approximately (without accounting for the squaring effects).
Figure 5: Autocorrelation Function of BPSK(1), BOC(1,1) and MBOC(6,1,1/11).
The improvement is still more spectacular if we take a look at the MBOC autocorrelation function, where the average slope around the main peak, considering data and pilot together, is shown to be 53/11. This represents an improvement of the tracking performance of approximately 1.03 dB with respect to BOC(1,1) and of 3.41 dB with respect to BPSK(1). The slope of the main peak can be easily computed from (1).
In fact, the slope of the autocorrelation function of BOC(6,1) takes a value of 23 around the main peak for infinite bandwidth. Equally, for BOC(1,1) the slope has a value 3 and the resulting slope of MBOC around the main peak will be . In general, the slope of the main peak of a BOC(x,1) is shown to be for the case of infinite bandwidth. It is important to note that the MBOC ACF shown above (CBOC implementation) corresponds to the mean ACF that results from averaging the data and pilot channel. In the case that both data and pilot would alternate the phase of the BOC(6,1) signal every chip, a similar result could be obtained. For the TMBOC case, it would represent the case when BOC(6,1) is on both data and pilot with the same power on both. This is equivalent to saying that the cross-correlation between BOC(1,1) and BOC(6,1) does not show up in the figures above since they average to zero.
We can see this more clearly if we recall the equations derived in the Composite BOC (CBOC) implementation of MBOC. Indeed,
so that the cross-term between the BOC(1,1) and BOC(6,1) does not appear in the expression, unlike for the and cases.
If we take a look now into the performance of the data and pilot channels separately, we can see that for the case of GPS L1C, the TMBOC implementation of MBOC puts all the high frequency power on the pilot channel for tracking purposes. This results in a steeper slope of the autocorrelation function around the main peak. Recalling the GPS power split between data and pilot of 25/75 in L1C, the slope will have a value of , bringing thus an improvement for the pilot channel of approximately 3.67 dB with respect to BPSK(1) and of 1.28 dB with respect to BOC(1,1). On the other hand, the data channel will present a performance equivalent to that of BOC(1,1).
Equivalently, its counterpart Galileo will have a performance 3.41 dB better than BPSK(1) and will be 1.03 dB better than BOC(1,1) since BOC(6,1) is placed on both data an pilot with a power split 50/50. This can also be seen if we take a look at the ACFs of the data and pilot channels separately.
Finally, it is important to note that although MBOC(6,1,1/11) and BOC(1,1) present improved performance with respect to BPSK(1), the tracking region is smaller if we track the whole MBOC. In fact, the linear region around the main peak will be six times narrower.
#### Signal structure and DLL sensitivity
Now that we have calculated the code tracking error for MBOC and the rest of Open signals in E1, the next step is to obtain the necessary $C/N_0$ to ensure a correct tracking. This will give us an idea of the potential DLL sensitivity of the different analysed signal structures.
Following [P. Ward, 1996][16] and [O. Julien, 2005][6] to study the PLL sensitivity, the rule of thumb we will use is to have a 3-sigma of the errors within the linear tracking region, which is in theory $\pm \frac{\delta}{2}$. This can also be expressed as follows:
It must be noted that actually not all the errors are included in the expression above, and thus the multipath-induced tracking error must be studied separately. The reason for this is that the multipath error does not imply a tracking error in the sense that it would push the tracking loop away from its stability point as explained in detail in [O. Julien, 2005] [6].
Recalling now the equations for the tracking error of (23) and (24) above, we can see that (23) can be simplified for the EMLP as follows:
where
and
Equally for the Dot Product Discriminator, (24) can also be expressed as:
with
According to this, if we assume as mentioned above that $3\sigma_{\delta_{\tau},TH} \le \delta /2$ for the case of the EMLP discriminator, the EMLP tracking threshold results to be:
and for the DP we have equally:
Using the expressions above, the tracking thresholds are computed in the next figures as a function of the coherent integration time and the DLL loop bandwidth. For the case of infinite bandwidth the expressions for the standard delay error simplify considerably adopting $A_1$,$A_2$ and $A_3$ the following values:
For comparison, a spacing of 0.1 chips (left) and a spacing of 0.2 chips (right) will be used.
frameless frameless
frameless frameless
frameless frameless
As we can recognize, using a chip spacing of 0.1 or 0.2 chips does not really make a big difference.
If we take a close look at the results shown in the figures above, we can see that MBOC presents the lowest tracking threshold and thus the best sensitivity, followed by BOC(1,1) and BPSK(1). It is also interesting to see that the results of the simulations show an even higher improvement of the $C/N_0$ sensitivity of MBOC with respect to BOC(1,1) and BPSK(1) than that predicted in the section “Signal structure and DLL code tracking error”. Indeed, while we saw there that MBOC was expected to have a tracking threshold 1 dB lower than that of BOC(1,1) and 3.4 dB better with respect to BPSK(1), the results of the figures above account for higher improvements. This could be due to filtering effects in the loop bandwidth and coherent integration that are not reflected in the analytical expressions for infinite bandwidth and that would positively favour MBOC against the other studied options.
Another important comment is that for the simulation of MBOC, a slope of 53/11 was assumed around the main peak. This is actually the average of data and pilot as we saw above. If we concentrate on the pilot performance of GPS L1C, the slope will be steeper since it has all the BOC(6,1) contribution, and even better results are expected.
In order to be able to compare the three signals more efficiently, the next figures show again the tracking thresholds for specific DLL configurations and chip spacing values.
frameless frameless
It is interesting to note that for a coherent integration time of 0.5 seconds and a spacing of 0.1 chips, the improvement in sensitivity of BOC(1,1) and MBOC(6,1,1/11) with respect to BPSK(1) is even more spectacular. Indeed, BOC(1,1) performs approximately 4.6 dB better than BPSK(1), while MBOC outperforms BPSK(1) by 6.5 dB.
If we repeat the figures above for a DLL loop bandwidth of 0.1 Hz, we can see that although the difference in sensitivity of the various signals reduces, for a coherent integration of 0.5 seconds and a spacing of 0.1 chips, BOC(1,1) is still 4.2 dB better than BPSK(1) and MBOC(6,1,1/11) approximately 1.7 dB better than BOC(1,1).
frameless frameless
Once the sensitivity performance of the different signals has been compared as a function of the DLL loop bandwidth and the spacing, the next step is to assess the behaviour of these signals as a function of the coherent integration time.
frameless frameless
As we can see, for a DLL loop bandwidth of 0.5 Hz and a chip spacing of 0.1, BOC(1,1) has a sensitivity approximately 3.5 dB higher than that of BPSK(1) while MBOC(6,1,1/11) is better than BOC(1,1) by 1.4 dB.
frameless frameless
Furthermore, when the coherent integration time is increased to 500ms, the sensitivity improvement of BOC(1,1) turns to be even clearer, resulting in a improvement of approximately 4.6 dB for BOC(1,1) with respect to BPSK(1) and of 1.9 dB for MBOC with respect to BOC(1,1).
From the figures above we can clearly recognize that the tracking threshold decreases as the integration time increases and the DLL loop bandwidth decreases. We can also see that the obtained values seem to be very low compared to those obtained in real applications. However, it must be noted that ideal conditions were assumed in the simulations.
The following tables summarize the results for a chip spacing of 0.1 chips with DP and EMLP discriminators. Similar tables could have also been derived for a spacing of 0.2 chips showing always the superiority of MBOC against BOC(1,1) and C/A Code.
DLL Tracking Threshold [dB-Hz] using the DP discriminator $\delta = 0.1$chips.
Once we have computed the DLL tracking threshold for the case of infinite bandwidth, the next step should be to employ different assumptions on the receiver bandwidth. Different configurations have been analysed delivering however similar results to those provided in previous lines.
The previous results show the ideal sensitivity values when all the potential sources of error are eliminated. As we know, increasing the total integration time does not only require extra complexity but implies other real challenges. Indeed, there are several problems inherent to longer coherent integration times, which are mainly related to the fact that the longer the coherent integration is, the more likely it will be that the signal conditions change during the integration period. Among others, the existence of frequency errors, non-ideal normalizations in the discriminator and the change of signal power during the integration would be the main sources of additional errors. They were not considered in the simulations above, since we are interested here in finding the theoretical limit, no matter how this is realized in reality. The same comment applies for the normalization of the discriminator. In fact, as explained in [O. Julien, 2005] [6], the effect of normalization in the discriminator would be another factor to take into account for more realistic simulations.
DLL Tracking Threshold [dB-Hz] for an EMLP discriminator with $\delta = 0.1$.
The figures obtained above extend over very long coherent integrations. In fact, no data channel could in reality reach such values unless external sources were used, what shows clearly the superiority of the pilot channel for these purposes. Indeed, the introduction of pilot channels by Galileo and the modernized GPS can be considered as one of the main contributions to the navigation. Navigation and communication applications require of different needs and the use of pilot signals in GNSS in the future is clear proof of that.
## MBOC Interference with other GNSSes
Interoperability and compatibility have been hot issues in the design of Galileo since the beginning. Indeed, as more systems join the select club of countries with their own navigation system, the more important these concepts have become. As we have seen in chapter 2, the global system of systems that GPS, GLONASS, Galileo, the Japanese Quasi Zenith Satellite System (QZSS), the Chinese BeiDou System (BDS) and the Indian Regional Navigation Satellite System (IRNSS) might become one day makes this chapter of major interest.
As defined in, [S. Wallner et al., 2005] [17]and [S. Wallner et al., 2006][18] and, interoperability refers to the ability of civil U.S. and foreign space-based PNT services to be used together to provide better capabilities compared with those that would be achieved relying solely on one service or signal.
In June 2004, the United States and the European Union signed a historical Agreement on the common use of shared frequencies, setting up a complete methodology to assess the GPS/Galileo radio frequency compatibility. More details on the theoretical framework can be found in GNSS Interference Model. Based on the mathematical ideas gathered in the work, [S. Wallner et al., 2005] [17] have carried out simulations with smooth spectra and with real codes. According to the results, the degradation from GPS on Galileo and of Galileo on GPS is lower than 0.25 dB proving thus that both systems can perfectly coexist. Moreover, the introduction of QZSS will lead to an increase of the intersystem interference in the visibility region of QZSS that will never be higher than 0.07 dB. We show next the degradation values for BOC(1,1) when the analytical model is employed.
Figure 13: Maximum $C/N_0$ Degradation due to Intersystem Interference caused by the GPS L1 Signals on Galileo [S. Wallner et al., 2005] [17] . Minimum: 0.186 dB, mean 0.214 dB and maximum 0.243 dB.
If the same model is applied to the MBOC baseline, we can see that this contributes to an easier compatibility since the interference reduces in all considered scenarios. In fact, for average scenarios the typical figures are far lower than the 0.25 dB mentioned above.
The additional reduction of interference that MBOC provides is direct consequence of the better Spectral Separation Coefficients (SSC) of the signal. This confirms the great importance of this instrument to assess the degradation and overlapping among different signals. In the next figure we show the reduction of the maximum $C/N_0$ degradation that resulted from changing the baseline from BOC(1,1) to the final MBOC(6,1,1/11).
Figure 14: Reduction of the maximum $C/N_0$ Degradation due to Intersystem Interference when MBOC is used instead of BOC(1,1) [S. Wallner et al., 2005] [17] . Minimum: 0.016 dB, mean 0.018 dB and maximum 0.023 dB.
Equally, if we include the effect of QZSS, the following results are obtained.
Figure 15: Maximum $C/N_0$ Degradation due to Intersystem Interference caused by the GPS L1 and QZSS Signals on Galileo [S. Wallner et al., 2005] [17]. Minimum: 0.187 dB, mean 0.247 dB and maximum 0.310 dB.
The mathematical framework of the methodology described in GNSS Interference Model can be easily expanded to other bands as for example E5-L5 or to other SBAS systems as done in [S. Wallner et al., 2005] [17] where the results with smooth spectra and real codes were compared. One final comment on the figures above is that the minimum power levels were used for the simulations resulting thus in significantly higher values of interference than those we will observe in a typical scenario. Nonetheless, it must be kept in mind that the purpose of an interference methodology is to assess compatibility in all the cases, and therefore looking at the worst cases is thus of major interest.
## References
1. ^ [G.W. Hein et al., 2006a] G. W. Hein, J.-A. Avila-Rodriguez, S. Wallner, A.R. Pratt, J.I.R. Owen, J.-L Issler, J.W. Betz, C.J. Hegarty, S. Lenahan, J.J. Rushanan, A.L. Kraay, T.A. Stansell, MBOC: The New Optimized Spreading Modulation Recommended for Galileo L1 OS and GPS L1C, Proceedings of the International Technical Meeting of the Institute of Navigation, IEEE/ION PLANS 2006, 24-27 April, 2006, Loews Coronado Bay Resort, San Diego, California, USA.
2. ^ [G.W. Hein et al., 2006b] G. W. Hein, J.-A. Avila-Rodriguez, S. Wallner, A.R. Pratt, J.I.R. Owen, J.-L Issler, J.W. Betz, C.J. Hegarty, S. Lenahan, J.J. Rushanan, A.L. Kraay, T.A. Stansell, MBOC: The New Optimized Spreading Modulation Recommended for Galileo L1 OS and GPS L1C, Inside GNSS – Working Papers, Vol.1, No.4, May/June 2006, pp.57-65.
3. ^ [J.-A. Avila-Rodriguez et al., 2006d] J.-A. Avila-Rodriguez, G. W. Hein, S. Wallner, A.R. Pratt, J.I.R. Owen, J.-L Issler, J.W. Betz, C.J. Hegarty, S. Lenahan, J.J. Rushanan, A.L. Kraay, T.A. Stansell, MBOC: The New Optimized Spreading Modulation Recommended for Galileo E1 OS and GPS L1C, ESA Navitec 2006, 11-13 December, 2006, Noordwijk, The Netherlands.
4. ^ a b c [J.-A. Avila-Rodriguez et al., 2006b] J.-A. Avila-Rodriguez, T. Pany, G.W. Hein, Bounds on Signal Performance Regarding Multipath-Estimating Discriminators, Proceedings of the International Technical Meeting of the Institute of Navigation, ION-GNSS 2006, 26-29 September, 2006, Fort Worth Convention Center, Fort Worth, Texas, USA.
5. ^ [A.R. Pratt et al., 2006] A.R. Pratt, J.I.R. Owen, G.W. Hein, J.-A. Avila-Rodriguez: Tracking Complex Modulation Waveforms- How to Avoid Receiver Bias, Proceedings of the International Technical Meeting of the Institute of Navigation, IEEE/ION PLANS 2006, 24-27 April, 2006, Loews Coronado Bay Resort, San Diego, California, USA.
6. ^ a b c d e f g h i j k l [O. Julien, 2005] Olivier Julien, Design of Galileo L1F Receiver Tracking Loops, PhD Thesis, Department of Geomatics Engineering, University of Calgary
7. ^ [R. Watson, 2005] R. Watson, High-Sensitivity GPS L1 Signal Analysis for Indoor Channel Modeling, Master’s thesis, Department of Geomatics Engineering, University of Calgary, UCGE Report 20216.
8. ^ [M.M. Chansarkar and L. Garin, 2000] M.M. Chansarkar and L. Garin, Acquisition of GPS Signals at Very Low Signal to Noise Ratios, Proceedings of the National Technical Meeting of the Institute of Navigation, ION-NTM 2000, pp. 731-737, January 26-28, 2000, Anaheim, California, USA.
9. ^ [G.D. MacGougan, 2003] G.D. MacGougan, High Sensitivity GPS Performance Analysis in Degraded Signal Environment, Master’s thesis, Department of Geomatics Engineering, University of Calgary, UCGE Report 20176.
10. ^ a b [G. Lachapelle, 2004] Lachapelle, G., NAVSTAR GPS: Theory and Applications, ENGO 625 Lecture Notes, Department of Geomatics Engineering, University of Calgary.
11. ^ [J.-A. Avila-Rodriguez et al., 2005c] J.-A. Avila-Rodriguez, T. Pany, B. Eissfeller, A theoretical analysis of acquisition algorithms for indoor positioning, 2nd ESA Workshop on Satellite Navigation User Equipment Technologies NAVITEC 2004, 8-10 December, 2004, Noordwijk, The Netherlands.
12. ^ [J.K. Holmes, 2000] Holmes, J.K., Code Tracking Loop Performance Including the Effect of Channel Filtering and Gaussian Interference, Proceedings of the US Institute of Navigation ION-AM 2000, pp. 382-398, 26-28 June, San Diego, California, USA.
13. ^ a b [J.W. Betz and K.R. Kolodziejski, 2000] J.W. Betz and K.R. Kolodziejski 2000, Extended Theory of Early-Late Code Tracking for a Bandlimited GPS Receiver, NAVIGATION: Journal of the Institute of Navigation, Vol. 47, No. 3, Fall 2000.
14. ^ [T. Pany et al., 2002] T. Pany, B. Eissfeller, M. Irsigler and J. Winkel, Code and Carrier Phase Tracking Performance of a Future Galileo RTK Receiver, Proceedings of the European Navigation Conference ENC-GNSS 2002, 27-30 May 2002, Copenhagen, Denmark.
15. ^ [L. Ries et al., 2003] L. Ries, F. Legrand, L. Lestarquit, W. Vigneau, J.L. Issler , Tracking and Multipath Performance Assessments of BOC Signals Using a Bit-Level Signal Processing Simulator, Proceedings of the International Technical Meeting of the Institute of Navigation, ION-GNSS 2003, 9-12 September, 2003, Oregon Convention Center, Portland, Oregon, USA.
16. ^ [P. Ward, 1996] P. Ward, Satellite Signal Acquisition and Tracking in Understanding GPS: Principles and Applications, Artech House Inc.
17. ^ a b c d e f [S. Wallner et al., 2005] S. Wallner, G.W. Hein, J.-A. Avila Rodriguez, T. Pany, A. Posfay, Interference Computations Between GPS and Galileo, Proceedings of the International Technical Meeting of the Institute of Navigation, ION-GNSS 2005, 13-16 September, 2005, Long Beach, California, USA.
18. ^ [S. Wallner et al., 2006b] S. Wallner, J.-A. Avila-Rodriguez, G.W. Hein, Interference Computations between Several GNSS Systems, ESA Navitec 2006, December 11-13, 2006, Noordwijk, The Netherlands.
## Credits
The information presented in this NAVIPEDIA’s article is an extract of the PhD work performed by Dr. Jose Ángel Ávila Rodríguez in the FAF University of Munich as part of his Doctoral Thesis “On Generalized Signal Waveforms for Satellite Navigation” presented in June 2008, Munich (Germany)
| 2019-04-25T13:00: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.8204318881034851, "perplexity": 1758.996618837237}, "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-18/segments/1555578721441.77/warc/CC-MAIN-20190425114058-20190425140058-00228.warc.gz"}
|
https://crd.lbl.gov/departments/computational-science/c3/c3-people/peter-nugent/
|
# Peter Nugent
Peter Nugent Ph.D.
Senior Scientist, Division Deputy for Scientific Engagement & Acting Dept. Head for Computational Science
Phone: +1 510 486 6942
Fax: +1 510 486 5812
Peter Nugent is a Senior Scientist and Division Deputy for Science Engagement in the Computational Research Division at Lawrence Berkeley National Laboratory, and an Adjunct Professor of Astronomy at UC Berkeley. He is also currently serving as interim department head for the Computational Sciences Department.
Dr. Nugent attended Bowdoin College and received his M.S. and Ph.D. in physics with a concentration in astronomy from the University of Oklahoma. He joined Lawrence Berkeley National Laboratory in 1996 as a postdoctoral fellow working with Saul Perlmutter on the measurement of the accelerating universe with Type Ia Supernova, for which Dr. Perlmutter received the Nobel Prize in Physics in 2011. He currently runs the largest astrophysical transient discovery pipeline created to-date, the Palomar Transient Factory and is the PI on the development of the Nyx code used to perform large adaptive mesh refinement hydrodynamical + n-body simulations to calculate the absorption spectra caused by neutral hydrogen in the cosmological environment - a Lyman alpha forest cosmology simulator - for surveys such as BOSS and BigBOSS.
Dr. Nugent has presented his work as a participant on PBS News Hour, NASA's Space Science Update program, CNN, NOVA, NPR, and BBC. His work has also been featured in Time, Newsweek, Science and Nature.
## Journal Articles
### E. O. Ofek, D. Fox, S. B. Cenko, M. Sullivan, O., D. A. Frail, A. Horesh, A. Corsi, R. M., N. Gehrels, S. R. Kulkarni, A., P. E. Nugent, O. Yaron, A. V. Filippenko, M. M., L. Bildsten, J. S. Bloom, D., I. Arcavi, R. R. Laher, D. Levitan, B. Sesar, J. Surace,"X-Ray Emission from Supernovae in Dense Circumstellar Matter Environments: A Search for Collisionless Shocks",Astrophysical Journal,2013,763:42,doi: 10.1088/0004-637X/763/1/42
The optical light curve of some supernovae (SNe) may be powered by the
outward diffusion of the energy deposited by the explosion shock (the
so-called shock breakout) in optically thick (
| 2017-10-22T22:47: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": 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.30320027470588684, "perplexity": 7939.52988733258}, "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/1508187825473.61/warc/CC-MAIN-20171022222745-20171023002745-00751.warc.gz"}
|
https://www.zbmath.org/authors/?q=ai%3Aoxley.james-g
|
zbMATH — the first resource for mathematics
Oxley, James G.
Compute Distance To:
Author ID: oxley.james-g Published as: Oxley, J.; Oxley, J. G.; Oxley, James; Oxley, James G. Homepage: https://www.math.lsu.edu/~oxley/ External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 188 Publications since 1977, including 18 Books Reviewing Activity: 94 Reviews Biographic References: 1 Publication
all top 5
Co-Authors
56 single-authored 31 Whittle, Geoffrey P. 21 Semple, Charles 17 Mullin, Ronald Cleveland 15 Stanton, Ralph Gordon 14 Chun, Carolyn 12 Mayhew, Dillon 10 Hoffmann, Frederick 10 Lemos, Manoel José Machado Soares 10 Vertigan, Dirk 7 Hoffman, Frederick 5 Oporowski, Bogdan 5 Welsh, Dominic J. A. 4 Ding, Guoli 4 Fife, Tara 4 Hall, Rhiannon 4 Wu, Haidong 3 Geelen, James F. 3 Kelly, Douglas G. 3 Row, Don 2 Aikin, Jeremy 2 Akkari, Safwan 2 Beavers, Brian 2 Brylawski, Tom 2 Chun, Deborah 2 Clark, Ben 2 Gershkoff, Zachary 2 Grace, Kevin 2 Reid, Talmage James 1 Asano, Takao 1 Bonin, Joseph E. 1 Brettell, Nick 1 Brylawski, Thomas H. 1 Campbell, Rutger 1 Chaourar, Brahim 1 Cheng, Ying 1 Choe, Young-Bin 1 Coullard, Collette R. 1 Drummond, George 1 Farr, Graham E. 1 Geelen, Jim 1 Hine, Natalie 1 Hobbs, Arthur M. 1 Kingan, S. R. 1 Kung, Joseph P. S. 1 Lowrance, Lisa Warshauer 1 Mason, John H. 1 Matthews, Logan R. 1 Mills, Allan D. 1 Nishizeki, Takao 1 Pfeil, Simon 1 Prendergast, Kevin H. 1 Ruet d’Auteuil, Ernest 1 Saito, Nobuji 1 Servatius, Brigitte 1 Singh, Jagdeep 1 Sokal, Alan D. 1 Taylor, Jesse Earl 1 Thomas, Robin 1 van Zwam, Stefan H. M. 1 Wagner, David Gustav 1 Wang, Suijie 1 Wetzler, Kristen
all top 5
Serials
30 Journal of Combinatorial Theory. Series B 24 Discrete Mathematics 24 European Journal of Combinatorics 23 Advances in Applied Mathematics 9 Congressus Numerantium 7 The Electronic Journal of Combinatorics 6 Mathematical Proceedings of the Cambridge Philosophical Society 6 Combinatorica 5 Graphs and Combinatorics 4 Transactions of the American Mathematical Society 4 SIAM Journal on Discrete Mathematics 3 The Quarterly Journal of Mathematics. Oxford Second Series 3 Oxford Graduate Texts in Mathematics 2 Journal of Graph Theory 2 Proceedings of the London Mathematical Society. Third Series 2 Studies in Applied Mathematics 2 Combinatorics, Probability and Computing 1 Discrete Applied Mathematics 1 Periodica Mathematica Hungarica 1 Canadian Journal of Mathematics 1 Journal of Applied Probability 1 Aequationes Mathematicae 1 Journal of the Australian Mathematical Society. Series A 1 Notices of the American Mathematical Society 1 Cubo Matemática Educacional 1 Contemporary Mathematics
all top 5
Fields
186 Combinatorics (05-XX) 18 General and overarching topics; collections (00-XX) 17 Convex and discrete geometry (52-XX) 9 Computer science (68-XX) 4 Probability theory and stochastic processes (60-XX) 3 History and biography (01-XX) 2 Mathematical logic and foundations (03-XX) 2 Geometry (51-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Group theory and generalizations (20-XX)
Citations contained in zbMATH Open
138 Publications have been cited 2,180 times in 1,373 Documents Cited by Year
Matroid theory. Zbl 0784.05002
Oxley, James G.
1992
Matroid theory. 2nd ed. Zbl 1254.05002
Oxley, James G.
2011
The Tutte polynomial and its applications. Zbl 0769.05026
Brylawski, Thomas; Oxley, James
1992
On weakly symmetric graphs of order twice a prime. Zbl 0583.05032
Cheng, Ying; Oxley, James
1987
Homogeneous multivariate polynomials with the half-plane property. Zbl 1054.05024
Choe, Young-Bin; Oxley, James G.; Sokal, Alan D.; Wagner, David G.
2004
Matroid theory. Reprint of the 1992 hardback edition. Zbl 1115.05001
Oxley, James G.
2006
On inequivalent representations of matroids over finite fields. Zbl 0856.05021
Oxley, James; Vertigan, Dirk
1996
Typical subgraphs of 3- and 4-connected graphs. Zbl 0728.05041
Oporowski, Bogdan; Oxley, James; Thomas, Robin
1993
The structure of the 3-separations of 3-connected matroids. Zbl 1059.05032
Oxley, James; Semple, Charles; Whittle, Geoff
2004
On nonbinary 3-connected matroids. Zbl 0628.05016
Oxley, James G.
1987
On the structure of 3-connected matroids and graphs. Zbl 0973.05016
Oxley, James; Wu, Haidong
2000
The binary matroids with no 4-wheel minor. Zbl 0613.05017
Oxley, James G.
1987
Generalized $$\Delta\text{--}Y$$ exchange and $$k$$-regular matroids. Zbl 1024.05017
Oxley, James; Semple, Charles; Vertigan, Dirk
2000
The Tutte polynomial and percolation. Zbl 0498.05018
Oxley, J. G.; Welsh, D. J. A.
1979
On matroid connectivity. Zbl 0419.05014
Oxley, James G.
1981
Infinite matroids. Zbl 0766.05016
Oxley, James
1992
Totally free expansions of matroids. Zbl 1048.05020
Geelen, James; Oxley, James; Vertigan, Dirk; Whittle, Geoff
2002
Colouring, packing and the critical problem. Zbl 0384.05021
Oxley, James G.
1978
On connectivity in matroids and graphs. Zbl 0481.05021
Oxley, James G.
1981
A characterization of Tutte invariants of 2-polymatroids. Zbl 0793.05042
Oxley, James; Whittle, Geoff
1993
Tutte polynomials computable in polynomial time. Zbl 0780.05011
Oxley, J. G.; Welsh, D. J. A.
1992
A characterization of the ternary matroids with no $$M(K_ 4)$$-minor. Zbl 0585.05005
Oxley, James G.
1987
A sharp bound on the size of a connected matroid. Zbl 0971.05034
Lemos, Manoel; Oxley, James
2001
Unavoidable minors of large 3-connected binary matroids. Zbl 0856.05022
Ding, Guoli; Oporowski, Bogdan; Oxley, James; Vertigan, Dirk
1996
On 3-connected matroids. Zbl 0407.05022
Oxley, James G.
1981
Weak maps and stabilizers of classes of matroids. Zbl 0919.05010
Geelen, James; Oxley, James; Vertigan, Dirk; Whittle, Geoff
1998
A chain theorem for internally 4-connected binary matroids. Zbl 1241.05012
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2011
Unavoidable minors of large 3-connected matroids. Zbl 0897.05020
Ding, Guoli; Oporowski, Bogdan; Oxley, James; Vertigan, Dirk
1997
Some local extremal connectivity results for matroids. Zbl 0793.05033
Akkari, Safwan; Oxley, James
1993
A characterization of certain excluded-minor classes of matroids. Zbl 0688.05014
Oxley, James G.
1989
The regular matroids with no 5-wheel minor. Zbl 0626.05009
Oxley, James G.
1989
The broken-circuit complex: its structure and factorizations. Zbl 0466.05027
Brylawski, Tom; Oxley, James
1981
On the intersections of circuits and cocircuits in matroids. Zbl 0557.05025
Oxley, James G.
1984
On Crapo’s beta invariant for matroids. Zbl 0485.05022
Oxley, James G.
1982
The structure of crossing separations in matroids. Zbl 1139.05010
Aikin, Jeremy; Oxley, James
2008
The structure of 3-connected matroids of path width three. Zbl 1117.05020
Hall, Rhiannon; Oxley, James; Semple, Charles
2007
On weak maps of ternary matroids. Zbl 0908.05026
Oxley, James; Whittle, Geoff
1998
Matroids whose ground sets are domains of functions. Zbl 0485.05023
Oxley, James; Prendergast, Kevin; Row, Don
1982
Several identities for the characteristic polynomial of a combinatorial geometry. Zbl 0443.05030
Brylawski, Tom; Oxley, James
1980
Cocircuit coverings and packing’s for binary matroids. Zbl 0378.05023
Oxley, James G.
1978
Towards a splitter theorem for internally 4-connected binary matroids. III. Zbl 1281.05037
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2013
The structure of the 3-separations of 3-connected matroids. II. Zbl 1118.05012
Oxley, James; Semple, Charles; Whittle, Geoff
2007
The structure of equivalent 3-separations in a 3-connected matroid. Zbl 1075.05016
Hall, Rhiannon; Oxley, James; Semple, Charles
2005
On the interplay between graphs and matroids. Zbl 0979.05030
Oxley, James
2001
On removable circuits in graphs and matroids. Zbl 0933.05086
Lemos, Manoel; Oxley, James
1999
Structure theory and connectivity for matroids. Zbl 0862.05017
Oxley, James
1996
A characterization of a class of non-binary matroids. Zbl 0658.05018
Oxley, James G.
1990
The smallest rounded sets of binary matroids. Zbl 0745.05012
Oxley, James G.; Reid, Talmage James
1990
On a matroid generalization of graph connectivity. Zbl 0473.05020
Oxley, James G.
1981
Infinite matroids. Zbl 0445.05039
Oxley, James G.
1978
Infinite matroids. Zbl 0436.05017
Oxley, James G.
1978
Towards a splitter theorem for internally 4-connected binary matroids. V. Zbl 1281.05039
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2014
Towards a splitter theorem for internally 4-connected binary matroids. IV. Zbl 1281.05038
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2014
Towards a splitter theorem for internally 4-connected binary matroids. Zbl 1238.05047
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2012
Wild triangles in 3-connected matroids. Zbl 1138.05011
Oxley, James; Semple, Charles; Whittle, Geoff
2008
On size, circumference and circuit removal in 3-connected matroids. Zbl 0951.05020
Lemos, Manoel; Oxley, James
2000
On packing minors into connected matroids. Zbl 0956.05029
Lemos, Manoel; Oxley, James
1998
A note on the non-spanning circuits of a matroid. Zbl 0770.05027
Oxley, James; Whittle, Geoff
1991
Graphs and series-parallel networks. Zbl 0587.05020
Oxley, James
1986
Asymptotic properties of random subsets of projective spaces. Zbl 0479.05024
Kelly, Douglas G.; Oxley, James G.
1982
An upgraded Wheels-and-Whirls theorem for 3-connected matroids. Zbl 1241.05014
Oxley, James; Semple, Charles; Whittle, Geoff
2012
Maintaining 3-connectivity relative to a fixed basis. Zbl 1139.05013
Oxley, James; Semple, Charles; Whittle, Geoff
2008
A chain theorem for matroids. Zbl 1139.05012
Oxley, James; Semple, Charles; Whittle, Geoff
2008
A matroid generalization of a result of Dirac. Zbl 0886.05040
Oxley, J.
1997
Tutte invariants for 2-polymatroids. Zbl 0787.05023
Oxley, James; Whittle, Geoff
1993
On minor-minimally-connected matroids. Zbl 0546.05021
Oxley, James G.
1984
On singleton 1-rounded sets of matroids. Zbl 0544.05015
Oxley, James G.
1984
On some extremal connectivity results for graphs and matroids. Zbl 0525.05035
Oxley, James G.
1982
Threshold functions for some properties of random subsets of projective spaces. Zbl 0504.05023
Kelly, Douglas G.; Oxley, James G.
1982
Infinite graphs and bicircular matroids. Zbl 0386.05021
Matthews, L. R.; Oxley, J. G.
1977
Fork-decompositions of matroids. Zbl 1053.05024
Hall, Rhiannon; Oxley, James; Semple, Charles; Whittle, Geoff
2004
Chromatic, flow and reliability polynomials: The complexity of their coefficients. Zbl 1001.05034
Oxley, James; Welsh, Dominic
2002
On maximum-sized near-regular and $$\root 6\of{1}$$-matroids. Zbl 0915.05034
Oxley, James; Vertigan, Dirk; Whittle, Geoff
1998
On matroid connectivity. Zbl 0837.05035
Oxley, James; Wu, Haidong
1995
Extensions of Tutte’s wheels-and-whirls theorem. Zbl 0773.05034
Coullard, Collette R.; Oxley, James G.
1992
Some extremal connectivity results for matroids. Zbl 0686.05011
Akkari, Safwan; Oxley, James
1991
Combinatorial geometries representable over GF(3) and GF(q). II: Dowling geometries. Zbl 0702.51004
Kung, Joseph P. S.; Oxley, James G.
1988
Laminar matroids. Zbl 1358.05048
Fife, Tara; Oxley, James
2017
Towards a splitter theorem for internally 4-connected binary matroids. II. Zbl 1284.05051
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2014
Constructive characterizations of 3-connected matroids of path width three. Zbl 1151.05010
Beavers, Brian; Oxley, James
2008
On matroids of branch-width three. Zbl 1034.05011
Hall, Rhiannon; Oxley, James; Semple, Charles; Whittle, Geoff
2002
Matroids and graphs with few non-essential elements. Zbl 0966.05016
Oxley, James; Wu, Haidong
2000
On infinite antichains of matroids. Zbl 0820.05013
Ding, Guoli; Oporowski, Bogdan; Oxley, James
1995
A note on Nagami’s polynomial invariants for graphs. Zbl 0675.05065
Oxley, James G.
1989
On ternary transversal matroids. Zbl 0624.05023
Oxley, James G.
1986
On random representable matroids. Zbl 0596.05017
Kelly, D. G.; Oxley, J. G.
1984
On a packing problem for infinite graphs and independence spaces. Zbl 0416.05030
Oxley, James G.
1979
Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem. Zbl 1348.05048
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2016
The structure of the 4-separations in 4-connected matroids. Zbl 1253.05056
Aikin, Jeremy; Oxley, James
2012
The excluded minors for the class of matroids that are binary or ternary. Zbl 1248.05031
Mayhew, Dillon; Oporowski, Bogdan; Oxley, James; Whittle, Geoff
2011
When excluding one matroid prevents infinite antichains. Zbl 1230.05088
Hine, Natalie; Oxley, James
2010
A short proof of non-GF(5)-representability of matroids. Zbl 1050.05024
Geelen, Jim; Oxley, James; Vertigan, Dirk; Whittle, Geoff
2004
What is a matroid? Zbl 1162.05307
Oxley, James
2003
On removable cycles through every edge. Zbl 1009.05083
Lemos, Manoel; Oxley, James
2003
On the 3-connected matroids that are minimal having a fixed spanning restriction. Zbl 0946.05019
Lemos, Manoel; Oxley, James
2000
On packing 3-connected restrictions into 3-connected matroids. Zbl 0890.05016
Oxley, James
1998
Connectivity of submodular functions. Zbl 0769.05028
Oxley, James; Whittle, Geoff
1992
On the matroids representable over $$GF(4)$$. Zbl 0568.05014
Oxley, James G.
1986
Threshold distribution functions for some random representable matroids. Zbl 0543.05022
Oxley, James G.
1984
On a covering problem of Mullin and Stanton for binary matroids. Zbl 0433.05020
Oxley, James G.
1980
Dependencies among dependencies in matroids. Zbl 1420.05031
Oxley, James; Wang, Suijie
2019
A splitter theorem for 3-connected 2-polymatroids. Zbl 1414.05070
Oxley, James; Semple, Charles; Whittle, Geoff
2019
Matroids with many small circuits and cocircuits. Zbl 1407.05044
Oxley, James; Pfeil, Simon; Semple, Charles; Whittle, Geoff
2019
Towards a splitter theorem for internally 4-connected binary matroids. VI. Zbl 1397.05032
Chun, Carolyn; Oxley, James
2018
Relaxations of $$\mathrm{GF}(4)$$-representable matroids. Zbl 1391.05072
Clark, Ben; Oxley, James; van Zwam, Stefan H. M.
2018
Laminar matroids. Zbl 1358.05048
Fife, Tara; Oxley, James
2017
Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids. Zbl 1353.05033
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2017
Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem. Zbl 1348.05048
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2016
A wheels-and-whirls theorem for 3-connected 2-polymatroids. Zbl 1332.05031
Oxley, James; Semple, Charles; Whittle, Geoff
2016
Towards a splitter theorem for internally 4-connected binary matroids. V. Zbl 1281.05039
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2014
Towards a splitter theorem for internally 4-connected binary matroids. IV. Zbl 1281.05038
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2014
Towards a splitter theorem for internally 4-connected binary matroids. II. Zbl 1284.05051
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2014
On two classes of nearly binary matroids. Zbl 1284.05055
Oxley, James; Taylor, Jesse
2014
Towards a splitter theorem for internally 4-connected binary matroids. III. Zbl 1281.05037
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2013
Constructing a 3-tree for a 3-connected matroid. Zbl 1256.05046
Oxley, James; Semple, Charles
2013
Capturing two elements in unavoidable minors of 3-connected binary matroids. Zbl 1257.05021
Chun, Deborah; Oxley, James
2013
On properties of almost all matroids. Zbl 1256.05043
Lowrance, Lisa; Oxley, James; Semple, Charles; Welsh, Dominic
2013
Constructing internally 4-connected binary matroids. Zbl 1256.05038
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2013
Towards a splitter theorem for internally 4-connected binary matroids. Zbl 1238.05047
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2012
An upgraded Wheels-and-Whirls theorem for 3-connected matroids. Zbl 1241.05014
Oxley, James; Semple, Charles; Whittle, Geoff
2012
The structure of the 4-separations in 4-connected matroids. Zbl 1253.05056
Aikin, Jeremy; Oxley, James
2012
Capturing matroid elements in unavoidable 3-connected minors. Zbl 1242.05048
Chun, Deborah; Oxley, James; Whittle, Geoff
2012
Matroid theory. 2nd ed. Zbl 1254.05002
Oxley, James G.
2011
A chain theorem for internally 4-connected binary matroids. Zbl 1241.05012
Chun, Carolyn; Mayhew, Dillon; Oxley, James
2011
The excluded minors for the class of matroids that are binary or ternary. Zbl 1248.05031
Mayhew, Dillon; Oporowski, Bogdan; Oxley, James; Whittle, Geoff
2011
Exposing 3-separations in 3-connected matroids. Zbl 1233.05080
Oxley, James; Semple, Charles; Whittle, Geoff
2011
Unavoidable parallel minors of regular matroids. Zbl 1229.05062
Chun, Carolyn; Oxley, James
2011
When excluding one matroid prevents infinite antichains. Zbl 1230.05088
Hine, Natalie; Oxley, James
2010
The structure of crossing separations in matroids. Zbl 1139.05010
Aikin, Jeremy; Oxley, James
2008
Wild triangles in 3-connected matroids. Zbl 1138.05011
Oxley, James; Semple, Charles; Whittle, Geoff
2008
Maintaining 3-connectivity relative to a fixed basis. Zbl 1139.05013
Oxley, James; Semple, Charles; Whittle, Geoff
2008
A chain theorem for matroids. Zbl 1139.05012
Oxley, James; Semple, Charles; Whittle, Geoff
2008
Constructive characterizations of 3-connected matroids of path width three. Zbl 1151.05010
Beavers, Brian; Oxley, James
2008
The structure of 3-connected matroids of path width three. Zbl 1117.05020
Hall, Rhiannon; Oxley, James; Semple, Charles
2007
The structure of the 3-separations of 3-connected matroids. II. Zbl 1118.05012
Oxley, James; Semple, Charles; Whittle, Geoff
2007
The contributions of Dominic Welsh to matroid theory. Zbl 1131.05025
Oxley, James
2007
Matroid theory. Reprint of the 1992 hardback edition. Zbl 1115.05001
Oxley, James G.
2006
Matroid packing and covering with circuits through an element. Zbl 1081.05020
Lemos, Manoel; Oxley, James
2006
The structure of equivalent 3-separations in a 3-connected matroid. Zbl 1075.05016
Hall, Rhiannon; Oxley, James; Semple, Charles
2005
Homogeneous multivariate polynomials with the half-plane property. Zbl 1054.05024
Choe, Young-Bin; Oxley, James G.; Sokal, Alan D.; Wagner, David G.
2004
The structure of the 3-separations of 3-connected matroids. Zbl 1059.05032
Oxley, James; Semple, Charles; Whittle, Geoff
2004
Fork-decompositions of matroids. Zbl 1053.05024
Hall, Rhiannon; Oxley, James; Semple, Charles; Whittle, Geoff
2004
A short proof of non-GF(5)-representability of matroids. Zbl 1050.05024
Geelen, Jim; Oxley, James; Vertigan, Dirk; Whittle, Geoff
2004
The 3-connected graphs with exactly three non-essential edges. Zbl 1067.05042
Oxley, James; Wu, Haidong
2004
William T. Tutte (1917–2002). Zbl 1168.01332
Hobbs, Arthur M.; Oxley, James G.
2004
What is a matroid? Zbl 1162.05307
Oxley, James
2003
On removable cycles through every edge. Zbl 1009.05083
Lemos, Manoel; Oxley, James
2003
On the minor-minimal 3-connected matroids having a fixed minor. Zbl 1057.05022
Lemos, Manoel; Oxley, James
2003
The structure of a 3-connected matroid with a 3-separating set of essential elements. Zbl 1014.05016
Oxley, James
2003
On series-parallel extensions of uniform matroids. Zbl 1026.05022
Chaourar, Brahim; Oxley, James
2003
Totally free expansions of matroids. Zbl 1048.05020
Geelen, James; Oxley, James; Vertigan, Dirk; Whittle, Geoff
2002
Chromatic, flow and reliability polynomials: The complexity of their coefficients. Zbl 1001.05034
Oxley, James; Welsh, Dominic
2002
On matroids of branch-width three. Zbl 1034.05011
Hall, Rhiannon; Oxley, James; Semple, Charles; Whittle, Geoff
2002
A sharp bound on the size of a connected matroid. Zbl 0971.05034
Lemos, Manoel; Oxley, James
2001
On the interplay between graphs and matroids. Zbl 0979.05030
Oxley, James
2001
On the structure of 3-connected matroids and graphs. Zbl 0973.05016
Oxley, James; Wu, Haidong
2000
Generalized $$\Delta\text{--}Y$$ exchange and $$k$$-regular matroids. Zbl 1024.05017
Oxley, James; Semple, Charles; Vertigan, Dirk
2000
On size, circumference and circuit removal in 3-connected matroids. Zbl 0951.05020
Lemos, Manoel; Oxley, James
2000
Matroids and graphs with few non-essential elements. Zbl 0966.05016
Oxley, James; Wu, Haidong
2000
On the 3-connected matroids that are minimal having a fixed spanning restriction. Zbl 0946.05019
Lemos, Manoel; Oxley, James
2000
On the excluded minors for quaternary matroids. Zbl 1023.05028
Geelen, J. F.; Oxley, J. G.; Vertigan, D. L.; Whittle, G. P.
2000
On the 3-connected matroids that are minimal having a fixed restriction. Zbl 0965.05032
Lemos, Manoel; Oxley, James; Reid, Talmage James
2000
On the non-uniqueness of $$q$$-cones of matroids. Zbl 0957.05024
Oxley, James; Whittle, Geoff
2000
On removable circuits in graphs and matroids. Zbl 0933.05086
Lemos, Manoel; Oxley, James
1999
A class of non-binary matroids with many binary minors. Zbl 0955.05021
Mills, Allan D.; Oxley, James G.
1999
Unavoidable minors in graphs and matroids. Zbl 0928.05056
Oxley, J.
1999
Weak maps and stabilizers of classes of matroids. Zbl 0919.05010
Geelen, James; Oxley, James; Vertigan, Dirk; Whittle, Geoff
1998
On weak maps of ternary matroids. Zbl 0908.05026
Oxley, James; Whittle, Geoff
1998
On packing minors into connected matroids. Zbl 0956.05029
Lemos, Manoel; Oxley, James
1998
On maximum-sized near-regular and $$\root 6\of{1}$$-matroids. Zbl 0915.05034
Oxley, James; Vertigan, Dirk; Whittle, Geoff
1998
On packing 3-connected restrictions into 3-connected matroids. Zbl 0890.05016
Oxley, James
1998
Unavoidable minors of large 3-connected matroids. Zbl 0897.05020
Ding, Guoli; Oporowski, Bogdan; Oxley, James; Vertigan, Dirk
1997
A matroid generalization of a result of Dirac. Zbl 0886.05040
Oxley, J.
1997
On inequivalent representations of matroids over finite fields. Zbl 0856.05021
Oxley, James; Vertigan, Dirk
1996
Unavoidable minors of large 3-connected binary matroids. Zbl 0856.05022
Ding, Guoli; Oporowski, Bogdan; Oxley, James; Vertigan, Dirk
1996
Structure theory and connectivity for matroids. Zbl 0862.05017
Oxley, James
1996
Matroid theory. AMS-IMS-SIAM joint summer research conference on matroid theory, July 2–6, 1995, University of Washington, Seattle, WA, USA. Zbl 0852.00021
Bonin, Joseph E. (ed.); Oxley, James G. (ed.); Servatius, Brigitte (ed.)
1996
On matroid connectivity. Zbl 0837.05035
Oxley, James; Wu, Haidong
1995
On infinite antichains of matroids. Zbl 0820.05013
Ding, Guoli; Oporowski, Bogdan; Oxley, James
1995
Typical subgraphs of 3- and 4-connected graphs. Zbl 0728.05041
Oporowski, Bogdan; Oxley, James; Thomas, Robin
1993
A characterization of Tutte invariants of 2-polymatroids. Zbl 0793.05042
Oxley, James; Whittle, Geoff
1993
Some local extremal connectivity results for matroids. Zbl 0793.05033
Akkari, Safwan; Oxley, James
1993
Tutte invariants for 2-polymatroids. Zbl 0787.05023
Oxley, James; Whittle, Geoff
1993
Some excluded-minor theorems for a class of polymatroids. Zbl 0793.05041
Oxley, James; Whittle, Geoff
1993
Matroid theory. Zbl 0784.05002
Oxley, James G.
1992
The Tutte polynomial and its applications. Zbl 0769.05026
Brylawski, Thomas; Oxley, James
1992
Infinite matroids. Zbl 0766.05016
Oxley, James
1992
Tutte polynomials computable in polynomial time. Zbl 0780.05011
Oxley, J. G.; Welsh, D. J. A.
1992
Extensions of Tutte’s wheels-and-whirls theorem. Zbl 0773.05034
Coullard, Collette R.; Oxley, James G.
1992
Connectivity of submodular functions. Zbl 0769.05028
Oxley, James; Whittle, Geoff
1992
A note on the non-spanning circuits of a matroid. Zbl 0770.05027
Oxley, James; Whittle, Geoff
1991
Some extremal connectivity results for matroids. Zbl 0686.05011
Akkari, Safwan; Oxley, James
1991
Ternary paving matroids. Zbl 0768.05023
Oxley, James G.
1991
A characterization of a class of non-binary matroids. Zbl 0658.05018
Oxley, James G.
1990
The smallest rounded sets of binary matroids. Zbl 0745.05012
Oxley, James G.; Reid, Talmage James
1990
On an excluded-minor class of matroids. Zbl 0746.05015
Oxley, James G.
1990
A characterization of certain excluded-minor classes of matroids. Zbl 0688.05014
Oxley, James G.
1989
The regular matroids with no 5-wheel minor. Zbl 0626.05009
Oxley, James G.
1989
A note on Nagami’s polynomial invariants for graphs. Zbl 0675.05065
Oxley, James G.
1989
On fixing elements in matroid minors. Zbl 0671.05021
Oxley, J.; Row, D.
1989
...and 38 more Documents
all top 5
Cited by 1,309 Authors
101 Oxley, James G. 61 Whittle, Geoffrey P. 40 Lemos, Manoel José Machado Soares 39 Feng, Yanquan 35 Geelen, Jim 30 Mayhew, Dillon 23 Wu, Haidong 23 Zhou, Jinxin 22 Chun, Carolyn 22 Semple, Charles 19 Bonin, Joseph E. 19 Reid, Talmage James 18 Brändén, Petter 16 Zhou, Xiangqian 14 Lai, Hong-Jian 13 Kingan, S. R. 13 Kwak, Jin Ho 12 de Mier, Anna 12 Ding, Guoli 12 Welsh, Dominic J. A. 11 Kook, Woong 11 Kung, Joseph P. S. 11 McGuinness, Sean 11 Pan, Jiangmin 10 Geelen, James F. 10 Hall, Rhiannon 10 Makowsky, Johann-Andreas 10 Pendavingh, Rudi A. 10 Slilaty, Daniel C. 10 Vertigan, Dirk 9 Ardila Mantilla, Federico 9 Bowler, Nathan 9 Hochstättler, Winfried 9 Las Vergnas, Michel 9 Merino, Criel 9 Noble, Steven Derek 9 Oum, Sang-Il 9 Traldi, Lorenzo 9 van Zwam, Stefan H. M. 9 Zaslavsky, Thomas 8 Chun, Deborah 8 Gordon, Gary 8 Jackson, Bill 8 Johnsen, Trygve 8 Noy, Marc 8 Sokal, Alan D. 8 Wagner, David Gustav 7 Cordovil, Raul 7 Farr, Graham E. 7 Kayibi, Koko Kalambay 7 Lenz, Matthias 7 Li, Xiaonan 7 Oh, Ju-Mok 7 Pitsoulis, Leonidas S. 7 Ramírez Alfonsín, Jorge Luis 7 Rincón, Felipe 7 Royle, Gordon F. 7 Tanigawa, Shin-ichi 7 Verdure, Hugues 7 Wagner, Donald Keith 6 Brettell, Nick 6 Brown, Jason Ira 6 Carmesin, Johannes 6 Chen, Beifang 6 Chen, Rong 6 Coullard, Collette R. 6 Delucchi, Emanuele 6 Fernandes, Rosário 6 Gerards, Bert 6 Martin, Jeremy L. 6 Moci, Luca 6 Moffatt, Iain 6 Nelson, Peter C. 6 Nelson, Peter L. 6 Padró, Carles 6 Papalamprou, Konstantinos 6 Qin, Hongxun 6 Thilikos, Dimitrios M. 6 Villarreal, Rafael Heraclio 6 Wang, Xiuyun 6 Wollan, Paul 5 Borcea, Julius 5 Costalonga, João Paulo 5 Diestel, Reinhard 5 Ellis-Monaghan, Joanna A. 5 Fife, Tara 5 Ghasemi, Mohsen 5 Gioan, Emeric 5 Gitler, Isidoro 5 Grace, Kevin 5 Huh, June 5 Kamiyama, Naoyuki 5 Kawarabayashi, Ken-ichi 5 Kochol, Martin 5 Kummer, Mario Denis 5 Kwon, Ojoung 5 Lee, Jon 5 Maffioli, Francesco 5 Maharry, John 5 Mohar, Bojan ...and 1,209 more Authors
all top 5
Cited in 179 Serials
196 Discrete Mathematics 170 Journal of Combinatorial Theory. Series B 144 European Journal of Combinatorics 91 Advances in Applied Mathematics 55 Discrete Applied Mathematics 37 Journal of Combinatorial Theory. Series A 34 Graphs and Combinatorics 33 Advances in Mathematics 30 Linear Algebra and its Applications 28 Annals of Combinatorics 20 Discrete & Computational Geometry 20 Journal of Algebraic Combinatorics 19 Transactions of the American Mathematical Society 18 Theoretical Computer Science 18 The Electronic Journal of Combinatorics 17 SIAM Journal on Discrete Mathematics 14 Journal of Graph Theory 13 Proceedings of the American Mathematical Society 13 Designs, Codes and Cryptography 12 Journal of Algebra 11 Combinatorica 11 Combinatorics, Probability and Computing 10 Journal of Pure and Applied Algebra 10 Algorithmica 10 Mathematical Programming. Series A. Series B 7 Journal of Statistical Physics 7 Operations Research Letters 7 Journal of Combinatorial Optimization 6 Fuzzy Sets and Systems 6 International Journal of Approximate Reasoning 5 Mathematical Proceedings of the Cambridge Philosophical Society 5 Games and Economic Behavior 5 Algebraic Combinatorics 4 SIAM Journal on Computing 4 Journal of Symbolic Computation 4 Journal of the American Mathematical Society 4 The Australasian Journal of Combinatorics 4 Soft Computing 4 Acta Mathematica Sinica. English Series 4 Journal of the Australian Mathematical Society 4 Journal of Algebra and its Applications 4 Optimization Letters 4 Ars Mathematica Contemporanea 4 Science China. Mathematics 4 ISRN Discrete Mathematics 3 Computers & Mathematics with Applications 3 Rocky Mountain Journal of Mathematics 3 Annales de l’Institut Fourier 3 Information Sciences 3 Kybernetika 3 Topology and its Applications 3 Annals of Pure and Applied Logic 3 Order 3 Information and Computation 3 Applied Mathematics Letters 3 Science in China. Series A 3 Computational Geometry 3 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI 3 Journal of Mathematical Sciences (New York) 3 Theory of Computing Systems 3 Lobachevskii Journal of Mathematics 3 Discrete Optimization 3 Mathematics in Computer Science 2 Communications in Algebra 2 Communications in Mathematical Physics 2 Indian Journal of Pure & Applied Mathematics 2 Information Processing Letters 2 Journal of Mathematical Analysis and Applications 2 Journal of Mathematical Physics 2 Mathematics of Computation 2 Beiträge zur Algebra und Geometrie 2 Algebra Universalis 2 The Annals of Probability 2 Duke Mathematical Journal 2 Geometriae Dedicata 2 Inventiones Mathematicae 2 Journal of Computer and System Sciences 2 Journal of Economic Theory 2 Manuscripta Mathematica 2 Publications of the Research Institute for Mathematical Sciences, Kyoto University 2 Studies in Applied Mathematics 2 Acta Mathematicae Applicatae Sinica. English Series 2 Annals of Operations Research 2 Random Structures & Algorithms 2 Annals of Physics 2 Bulletin of the American Mathematical Society. New Series 2 Vestnik St. Petersburg University. Mathematics 2 Discussiones Mathematicae. Graph Theory 2 Séminaire Lotharingien de Combinatoire 2 Annals of Mathematics. Second Series 2 Journal of the European Mathematical Society (JEMS) 2 Acta Universitatis Sapientiae. Mathematica 2 Cryptography and Communications 2 Annales de l’Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) 1 International Journal of Modern Physics B 1 Artificial Intelligence 1 Communications on Pure and Applied Mathematics 1 Journal d’Analyse Mathématique 1 Journal of the Mechanics and Physics of Solids 1 Letters in Mathematical Physics ...and 79 more Serials
all top 5
Cited in 48 Fields
1,173 Combinatorics (05-XX) 292 Convex and discrete geometry (52-XX) 108 Computer science (68-XX) 84 Algebraic geometry (14-XX) 77 Operations research, mathematical programming (90-XX) 69 Group theory and generalizations (20-XX) 53 Commutative algebra (13-XX) 43 Order, lattices, ordered algebraic structures (06-XX) 42 Information and communication theory, circuits (94-XX) 33 Linear and multilinear algebra; matrix theory (15-XX) 31 Geometry (51-XX) 28 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 24 Statistical mechanics, structure of matter (82-XX) 21 Number theory (11-XX) 21 Manifolds and cell complexes (57-XX) 20 Mathematical logic and foundations (03-XX) 19 Probability theory and stochastic processes (60-XX) 17 Associative rings and algebras (16-XX) 14 Several complex variables and analytic spaces (32-XX) 12 Field theory and polynomials (12-XX) 10 Operator theory (47-XX) 9 Functions of a complex variable (30-XX) 8 Functional analysis (46-XX) 8 Quantum theory (81-XX) 8 Biology and other natural sciences (92-XX) 7 Statistics (62-XX) 6 History and biography (01-XX) 6 Category theory; homological algebra (18-XX) 6 Algebraic topology (55-XX) 6 Numerical analysis (65-XX) 5 Partial differential equations (35-XX) 4 Nonassociative rings and algebras (17-XX) 4 Real functions (26-XX) 4 Approximations and expansions (41-XX) 3 Measure and integration (28-XX) 3 Dynamical systems and ergodic theory (37-XX) 3 Integral transforms, operational calculus (44-XX) 3 Integral equations (45-XX) 3 General topology (54-XX) 3 Mechanics of deformable solids (74-XX) 2 $$K$$-theory (19-XX) 2 Special functions (33-XX) 2 Ordinary differential equations (34-XX) 2 Global analysis, analysis on manifolds (58-XX) 2 Mechanics of particles and systems (70-XX) 1 General and overarching topics; collections (00-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Classical thermodynamics, heat transfer (80-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-08T05:25: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": 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.566781759262085, "perplexity": 14300.486992595494}, "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-2021-21/segments/1620243988837.67/warc/CC-MAIN-20210508031423-20210508061423-00190.warc.gz"}
|
http://www.itl.nist.gov/div898/handbook/pmc/section4/pmc431.htm
|
6. Process or Product Monitoring and Control
6.4. Introduction to Time Series Analysis
6.4.3. What is Exponential Smoothing?
## Single Exponential Smoothing
Exponential smoothing weights past observations with exponentially decreasing weights to forecast future values This smoothing scheme begins by setting $$S_2$$ to $$y_1$$, where $$S_i$$ stands for smoothed observation or EWMA, and $$y$$ stands for the original observation. The subscripts refer to the time periods, $$1, \, 2, \, \ldots, \, n$$. For the third period, $$S_3 = \alpha y_2 + (1-\alpha) S_2$$; and so on. There is no $$S_1$$; the smoothed series starts with the smoothed version of the second observation.
For any time period $$t$$, the smoothed value $$S_t$$ is found by computing $$S_t = \alpha y_{t-1} + (1-\alpha)S_{t-1} \,\,\,\,\,\,\, 0 < \alpha \le 1 \,\,\,\,\,\,\, t \ge 3 \, .$$ This is the basic equation of exponential smoothing and the constant or parameter $$\alpha$$ is called the smoothing constant.
Note: There is an alternative approach to exponential smoothing that replaces $$y_{t-1}$$ in the basic equation with $$y_t$$, the current observation. That formulation, due to Roberts (1959), is described in the section on EWMA control charts. The formulation here follows Hunter (1986).
Setting the first EWMA
The first forecast is very important The initial EWMA plays an important role in computing all the subsequent EWMAs. Setting $$S_2$$ to $$y_1$$ is one method of initialization. Another way is to set it to the target of the process.
Still another possibility would be to average the first four or five observations.
It can also be shown that the smaller the value of $$\alpha$$, the more important is the selection of the initial EWMA. The user would be wise to try a few methods, (assuming that the software has them available) before finalizing the settings.
Why is it called "Exponential"?
Expand basic equation Let us expand the basic equation by first substituting for $$S_{t-1}$$ in the basic equation to obtain $$\begin{eqnarray} S_t & = & \alpha y_{t-1} + (1-\alpha) \left[ \alpha y_{t-2} + (1-\alpha) S_{t-2} \right] \\ & = & \alpha y_{t-1} + \alpha (1-\alpha) y_{t-2} + (1-\alpha)^2 S_{t-2} \, . \end{eqnarray}$$
Summation formula for basic equation By substituting for $$S_{t-2}$$, then for $$S_{t-3}$$, and so forth, until we reach $$S_2$$ (which is just $$y_1$$), it can be shown that the expanding equation can be written as: $$S_t = \alpha \sum_{i=1}^{t-2} (1-\alpha)^{i-1} y_{t-i} + (1-\alpha)^{t-2} S_2 \, , \,\,\,\,\, t \ge 2 \, .$$
Expanded equation for $$S_5$$ For example, the expanded equation for the smoothed value $$S_5$$ is: $$S_5 = \alpha \left[ (1-\alpha)^0 y_{5-1} + (1-\alpha)^1 y_{5-2} + (1-\alpha)^2 y_{5-3} \right] + (1-\alpha)^3 S_2 \, .$$
Illustrates exponential behavior This illustrates the exponential behavior. The weights, $$\alpha(1-\alpha)^t$$ decrease geometrically, and their sum is unity as shown below, using a property of geometric series: $$\alpha \sum_{i=0}^{t-1} (1-\alpha)^i = \alpha \left[ \frac{1-(1-\alpha)^t}{1-(1-\alpha)} \right] = 1 - (1-\alpha)^t \, .$$ From the last formula we can see that the summation term shows that the contribution to the smoothed value $$S_t$$ becomes less at each consecutive time period.
Example for $$\alpha = 0.3$$ Let $$\alpha = 0.3$$. Observe that the weights $$\alpha(1-\alpha)^t$$ decrease exponentially (geometrically) with time.
Value weight
last $$y_1$$ 0.2100
$$y_2$$ 0.1470
$$y_3$$ 0.1029
$$y_4$$ 0.0720
What is the "best" value for $$\alpha$$?
How do you choose the weight parameter? The speed at which the older responses are dampened (smoothed) is a function of the value of $$\alpha$$. When $$\alpha$$ is close to 1, dampening is quick and when $$\alpha$$ is close to 0, dampening is slow. This is illustrated in the table below.
---------------> towards past observations
$$\alpha$$ $$(1-\alpha)$$ $$(1-\alpha)^2$$ $$(1-\alpha)^3$$ $$(1-\alpha)^4$$ 0.9 0.1 0.01 0.001 0.0001 0.5 0.5 0.25 0.125 0.0625 0.1 0.9 0.81 0.729 0.6561
We choose the best value for $$\alpha$$ so the value which results in the smallest MSE.
Example Let us illustrate this principle with an example. Consider the following data set consisting of 12 observations taken over time:
Time
$$y_t$$ $$S(\alpha=0.1)$$ Error Error
squared
1 71
2 70 71 -1.00 1.00
3 69 70.9 -1.90 3.61
4 68 70.71 -2.71 7.34
5 64 70.44 -6.44 41.47
6 65 69.80 -4.80 23.04
7 72 69.32 2.68 7.18
8 78 69.58 8.42 70.90
9 75 70.43 4.57 20.88
10 75 70.88 4.12 16.97
11 75 71.29 3.71 13.76
12 70 71.67 -1.67 2.79
The sum of the squared errors (SSE) = 208.94. The mean of the squared errors (MSE) is the SSE /11 = 19.0.
Calculate for different values of $$\alpha$$ The MSE was again calculated for $$\alpha = 0.5$$ and turned out to be 16.29, so in this case we would prefer an $$\alpha$$ of 0.5. Can we do better? We could apply the proven trial-and-error method. This is an iterative procedure beginning with a range of $$\alpha$$ between 0.1 and 0.9. We determine the best initial choice for $$\alpha$$ and then search between $$\alpha - \Delta$$ and $$\alpha + \Delta$$. We could repeat this perhaps one more time to find the best $$\alpha$$ to 3 decimal places.
Nonlinear optimizers can be used But there are better search methods, such as the Marquardt procedure. This is a nonlinear optimizer that minimizes the sum of squares of residuals. In general, most well designed statistical software programs should be able to find the value of $$\alpha$$ that minimizes the MSE.
Sample plot showing smoothed data for 2 values of $$\alpha$$
| 2014-10-30T18:57: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": 0, "mathjax_display_tex": 2, "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.8727189302444458, "perplexity": 370.0845953001097}, "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-2014-42/segments/1414637898751.26/warc/CC-MAIN-20141030025818-00132-ip-10-16-133-185.ec2.internal.warc.gz"}
|
https://supernova.lbl.gov/~sed/telescope/obsguide/platescale.html
|
The Plate Scale of a Telescope
The plate scale of a telescope can be described as the number of degrees, or arcminutes or arcseconds, corresponding to a number of inches, or centimeters, or millimeters (etc.) at the focal plane (where an image of an object is "seen") of a telescope. Each telescope has its own plate scale, depending on the characteristics of the all the optical elements (mirrors or lenses) that are in the telescope. Very simply, the plate scale for a telescope can be calculated if you know the diameter, D, of the primary mirror and the telescope’s effective focal length, F, or if you have its f-number (f/#):
.
In this common expression of plate scale, D is in millimeters (mm). The f-number is unitless, as it is a ratio of the focal length to the diameter:
.
In principle, the f/# can be determined from the design specifications of a given telescope, but, in practice, it is checked by measuring the effective focal length directly once the telescope is assembled.
## Cartoon Sketch of a Telescope Showing its Effective Focal Length, F, and its Mirror Diamter, D.
.
More Detail
If you can’t remember the equation, it might be helpful to know that you can figure out the equation yourself, using the small angle approximation. In the picture above,
(1)
Since A is a small angle, and expressed in radians (and then converted into arcseconds, 1 radian = 206265 arcseconds), then
and so now
.(2)
The plate scale is the ratio between the angle A and diameter D of the telescope (in arcseconds per mm) so now
(3)
By subsituting equation (2) into (3) for A, and remembering that so THEN
.
| 2021-09-21T18:18:09 |
{"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.8747369647026062, "perplexity": 899.0825633638427}, "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/1631780057225.57/warc/CC-MAIN-20210921161350-20210921191350-00370.warc.gz"}
|
https://human.libretexts.org/Bookshelves/Literature_and_Literacy/Book%3A_88_Open_Essays_-_A_Reader_for_Students_of_Composition_and_Rhetoric_(Wangler_and_Ulrich)/Open_Essays/45%3A_Mapping_the_US_Counties_where_Traffic_Air_Pollution_Hurts_Children_the_Most_(Khreis)
|
Skip to main content
# 45: Mapping the US Counties where Traffic Air Pollution Hurts Children the Most (Khreis)
Haneen Khreis
#health #science #climatechange #systemanalysis #research
In the U.S., over 6 million children had ongoing asthma in 2016. Globally, asthma kills around 1,000 people every day – and its prevalence is rising.
This condition has a high economic cost. Each year in the U.S., more than US$80 billion is lost because of asthma. This is mainly due to premature deaths, medical payments and missed work and school days. The burden is higher for families with asthmatic children, who, on average, spend$1,700 more on health care than families with healthy children.
One major environmental factor that might contribute to the development of asthma is air pollution from traffic. In our study, published on April 3, our team mapped where in the U.S. children are most at risk for developing asthma from this type of pollution.
## Traffic and asthma
Asthma is likely the most common chronic disease in childhood, according to the World Health Organization.
Asthma presents as episodes of wheezing, coughing and shortness of breath due to the reversible, or partially reversible, obstruction of airflow. Six in 10 of children with asthma worldwide had a form of persistent asthma, meaning that either they were on long-term medication or their condition could not be controlled even with medication.
Traffic pollution contains a mixture of harmful pollutants like nitrogen oxides, carbon monoxide, particulate matter, benzene and sulfur. These pollutants are known to harm health in many ways, causing a number of cardiovascular, respiratory and neurological diseases.
One 2013 review suggested that long-term exposure to common traffic-related air pollutants is linked to the development of asthma in children and adults.
A much larger meta-analysis in 2017, which focused on children and included more recently published studies, found consistent connections between this type of pollution and childhood asthma development. The researchers concluded that there is now sufficient evidence showing a relationship between this type of pollution and the onset of childhood asthma.
Studies from the nonprofit research group Health Effects Institute and the U.S. Environmental Protection Agency have concluded along these lines.
## Mapping the problem
Despite this emerging evidence, the burden of childhood asthma due to traffic-related air pollution is poorly documented. Very few studies explore the geographic and spatial variations.
My research team wanted to quantify the connection between exposure to traffic pollution and the onset of childhood asthma across 48 U.S. states and the District of Columbia. We also wanted to make these data open to the public.
In our analysis, we looked at 70 million kids and conducted all calculations at the census block level, the smallest available geographical unit for census data. We collaborated with researchers from the University of Washington, who modeled the concentrations of nitrogen dioxide, a strong sign of traffic-related air pollution, using satellite imagery combined with environmental ground monitoring data.
We then took data extracted from surveys by the Centers for Disease Control and Prevention, estimating childhood asthma incidence in the U.S. Alongside data from our air pollution models, we used these data to estimate the number of childhood asthma cases caused by exposure to traffic pollution.
We then created a first-of-its-kind, county-by-county interactive heat map and city-by-city table detailing the distribution of childhood asthma due to nitrogen dioxide across the U.S. in both 2000 and 2010. Each county is represented, and users can explore the data to see the findings for a particular county.
Screenshot from interactive map. CC BY
## A win for public health
Our analysis found that childhood asthma cases attributable to traffic pollution across the U.S. decreased, on average, by 33% between 2000 and 2010. In 2000, we estimated that 209,100 childhood asthma cases could be attributed to traffic pollution, while this number dropped to 141,900 cases in 2010. That’s a major win for public health.
What caused the decline in traffic-related asthma cases? There may be multiple causes, including more fuel-efficient vehicles, more stringent regulation on nitrogen oxide emissions and, potentially, reductions in total vehicle miles traveled due to the recession.
Despite this encouraging decrease in air pollution and its associated health burden, there were 141,900 childhood asthma cases due to traffic-related air pollution in the U.S. That’s 18% of all childhood asthma cases.
Moreover, we found that children living in urban areas had twice the percentage of asthma cases attributable to nitrogen dioxide exposures as compared to children living in rural areas.
Our estimates underline an urgent need to reduce children’s exposure to air pollution. We hope that our analyses and heat maps will better inform policymakers, transportation agencies, medical associations and anyone else interested in learning more about the burden of childhood asthma due to air pollution.
_____________________
Haneen Khreis is an Assistant Research Professor at Texas A&M University with an interest in the health impacts of transport planning and policy. Her article is reprinted from The Conversation.
Mapping the US counties where traffic air pollution hurts children the most by Haneen Khreis is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.
• Was this article helpful?
| 2021-08-05T11:20: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": 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.2501533031463623, "perplexity": 4850.584981863685}, "config": {"markdown_headings": true, "markdown_code": false, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "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-2021-31/segments/1627046155529.97/warc/CC-MAIN-20210805095314-20210805125314-00353.warc.gz"}
|
https://pdglive.lbl.gov/Particle.action?init=0&node=M003&home=MXXX005
|
LIGHT UNFLAVORED MESONS($\mathit S$ = $\mathit C$ = $\mathit B$ = 0) For $\mathit I = 1$ (${{\mathit \pi}}$ , ${{\mathit b}}$ , ${{\mathit \rho}}$ , ${{\mathit a}}$ ): ${\mathit {\mathit u}}$ ${\mathit {\overline{\mathit d}}}$, ( ${\mathit {\mathit u}}$ ${\mathit {\overline{\mathit u}}}−$ ${\mathit {\mathit d}}$ ${\mathit {\overline{\mathit d}}})/\sqrt {2 }$, ${\mathit {\mathit d}}$ ${\mathit {\overline{\mathit u}}}$;for $\mathit I = 0$ (${{\mathit \eta}}$ , ${{\mathit \eta}^{\,'}}$ , ${{\mathit h}}$ , ${{\mathit h}^{\,'}}$ , ${{\mathit \omega}}$ , ${{\mathit \phi}}$ , ${{\mathit f}}$ , ${{\mathit f}^{\,'}}$ ): ${\mathit {\mathit c}}_{{\mathrm {1}}}$( ${{\mathit u}}{{\overline{\mathit u}}}$ $+$ ${{\mathit d}}{{\overline{\mathit d}}}$ ) $+$ ${\mathit {\mathit c}}_{{\mathrm {2}}}$( ${{\mathit s}}{{\overline{\mathit s}}}$ )
#### ${{\mathit f}_{{0}}{(980)}}$
$I^G(J^{PC})$ = $0^+(0^{+ +})$
See related review: Scalar Mesons below 1 GeV
${{\mathit f}_{{0}}{(980)}}$ T-MATRIX POLE $\sqrt {\mathit s }$ $(980 - 1010) − {\mit i} (20 - 35)$ MeV
${{\mathit f}_{{0}}{(980)}}$ MASS $990 \pm20$ MeV
${{\mathit f}_{{0}}{(980)}}$ WIDTH $10\text{ to }100$ MeV
$\Gamma_{1}$ ${{\mathit \pi}}{{\mathit \pi}}$ seen 476
$\Gamma_{2}$ ${{\mathit K}}{{\overline{\mathit K}}}$ seen 36
$\Gamma_{3}$ ${{\mathit \gamma}}{{\mathit \gamma}}$ seen 495
$\Gamma_{4}$ ${{\mathit e}^{+}}{{\mathit e}^{-}}$ 495
FOOTNOTES
| 2023-03-22T00:26:39 |
{"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.9920178651809692, "perplexity": 580.2948895276857}, "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/1679296943747.51/warc/CC-MAIN-20230321225117-20230322015117-00411.warc.gz"}
|
https://par.nsf.gov/biblio/10157273-landau-equation-specular-reflection-boundary-condition
|
The Landau Equation with the Specular Reflection Boundary Condition.
The existence and stability of the Landau equation (1936) in a general bounded domain with a physical boundary condition is a long-outstanding open problem. This work proves the global stability of the Landau equation with the Coulombic potential in a general smooth bounded domain with the specular reflection boundary condition for initial perturbations of the Maxwellian equilibrium states. The highlight of this work also comes from the low-regularity assumptions made for the initial distribution. This work generalizes the recent global stability result for the Landau equation in a periodic box (Kim et al. in Peking Math J, 2020). Our methods consist of the generalization of the wellposedness theory for the Fokker–Planck equation (Hwang et al. SIAM J Math Anal 50(2):2194–2232, 2018; Hwang et al. Arch Ration Mech Anal 214(1):183–233, 2014) and the extension of the boundary value problem to a whole space problem, as well as the use of a recent extension of De Giorgi–Nash–Moser theory for the kinetic Fokker–Planck equations (Golse et al. Ann Sc Norm Super Pisa Cl Sci 19(1):253–295, 2019) and the Morrey estimates (Bramanti et al. J Math Anal Appl 200(2):332–354, 1996) to further control the velocity derivatives, which ensures the uniqueness. Our methods provide a more »
Authors:
; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10157273
Journal Name:
Archive for Rational Mechanics and Analysis
Volume:
236
Issue:
3
Page Range or eLocation-ID:
1389–1454
1. We establish existence of finite energy weak solutions to the kinetic Fokker-Planck equation and the linear Landau equation near Maxwellian, in the presence of specular reflection boundary condition for general domains. Moreover, by using a method of reflection and the \begin{document}$S_p$\end{document} estimate of [7], we prove regularity in the kinetic Sobolev spaces \begin{document}$S_p$\end{document} and anisotropic Hölder spaces for such weak solutions. Such \begin{document}$S_p$\end{document} regularity leads to the uniqueness of weak solutions.
This report succinctly summarizes results proved in the authors' recent work (2019) where the unique existence of solutions to the Boltzmann equation without angular cut-off and the Landau equation with Coulomb potential are studied in a perturbation framework. A major feature is the use of the Wiener space $A(\Omega)$, which can be expected to play a similar role to $L^\infty$. Compared to the $L^2$-based solution spaces that were employed for prior known results, this function space enables us to establish a new global existence theory. One further feature is that, not only an initial value problem, but also an initial boundary value problem whose boundary conditions can be regarded as physical boundaries in some simple situation, are considered for both equations. In addition to unique existence, large-time behavior of the solutions and propagation of spatial regularity are also proved. In the end of report, key ideas of the proof will be explained in a concise way.
| 2022-10-02T07:34: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": 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.7480706572532654, "perplexity": 472.39587655297146}, "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-40/segments/1664030337287.87/warc/CC-MAIN-20221002052710-20221002082710-00393.warc.gz"}
|
https://indico.fnal.gov/event/54119/?view=standard_numbered
|
US/Central
Wilson Hall
#### Wilson Hall
Zoom Link Send an email to javiert[at]fnal.gov to get the connection information
Description
We present a novel dish antenna for broadband ~meV-eV range axion and wave-dark matter detection, which allows to utilize state-of-the-art high-field solenoidal magnets. At these masses it is difficult to scale up traditional resonator setups to the required volume. However, at metallic surfaces in a high magnetic field dark matter axions can convert to photons regardless of axion mass. These photons can be successively focused onto a detector (dish antenna concept). In this seminar we present progress on BREAD, a dish antenna proposal with a $\sim 10\,{\rm m}^2$ conversion area and a novel rotationally symmetric parabolic focusing reflector designed to take advantage of high-field solenoidal magnets. We discuss viable low-noise photon detectors and show progress towards first stage hidden photon pilot experiments for two distinct frequency ranges - GigaBREAD and InfraBREAD - with expected sensitivities to unexplored hidden photon couplings. We detail R&D on reflector characterization, horn antenna & sensor testing and signal readout. We also outline sensitivity estimates for future large-scale versions of BREAD.
• 1
We present a novel dish antenna for broadband ~meV-eV range axion and wave-dark matter detection, which allows to utilize state-of-the-art high-field solenoidal magnets. At these masses it is difficult to scale up traditional resonator setups to the required volume. However, at metallic surfaces in a high magnetic field dark matter axions can convert to photons regardless of axion mass. These photons can be successively focused onto a detector (dish antenna concept). In this seminar we present progress on BREAD, a dish antenna proposal with a $\sim 10\,{\rm m}^2$ conversion area and a novel rotationally symmetric parabolic focusing reflector designed to take advantage of high-field solenoidal magnets. We discuss viable low-noise photon detectors and show progress towards first stage hidden photon pilot experiments for two distinct frequency ranges - GigaBREAD and InfraBREAD - with expected sensitivities to unexplored hidden photon couplings. We detail R&D on reflector characterization, horn antenna & sensor testing and signal readout. We also outline sensitivity estimates for future large-scale versions of BREAD.
| 2022-08-09T22:23: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.3646093010902405, "perplexity": 5445.890504100769}, "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-2022-33/segments/1659882571090.80/warc/CC-MAIN-20220809215803-20220810005803-00659.warc.gz"}
|
https://indico.fnal.gov/event/8976/contributions/111669/
|
# 2015 Active Targets and TPC for Nuclear Physics Experiments Workshop
May 18 – 20, 2015
National Superconducting Cyclotron Laboratory
US/Michigan timezone
## MAIKo active target for RI beam experiments
May 19, 2015, 12:05 PM
25m
Lecture Hall (National Superconducting Cyclotron Laboratory)
### Lecture Hall
#### National Superconducting Cyclotron Laboratory
640 South Shaw Lane East Lansing, MI 48824
Oral Presentation Active target detectors and associated electronics
### Speaker
Mr Tatsuya Furuno (Department of Physics, Kyoto University)
### Description
An active target system MAIKo (Mu-PIC based Active target for Inverse Kinematics.) is under development at RCNP. This system is designed to perform missing mass spectroscopy with RI beam. Missing mass spectroscopy will be a powerful method to study high-excited states of unstable nuclei above particle decay thresholds. MAIKo is based on a time projection chamber (TPC). We utilize micro-pixel chamber ($\mu$-PIC) for the amplification and detection of the drifted electrons. $\mu$-PIC is a kind of micro-pattern gaseous detectors developed by the cosmic ray group at Kyoto University and has high position resolution. In 2013, the first beam test experiment was carried out to study the detector performances such as angular resolution and gas gain under high beam rate. Scattering events were also acquired to develop a tracking algorithm. The first experiment with RI beam will be proposed in this summer. In the present talk, the detailed design of MAIKo TPC will be reported. The results of the test experiment will be also discussed.
### Primary author
Mr Tatsuya Furuno (Department of Physics, Kyoto University)
### Co-authors
Mr Motoki Murata (Department of Physics, Kyoto University) Prof. Takahiro KAWABATA (Department of Physics, Kyoto University)
### Presentation materials
There are no materials yet.
| 2022-10-07T13:25: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": 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.40843838453292847, "perplexity": 11172.810066026756}, "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/1664030338073.68/warc/CC-MAIN-20221007112411-20221007142411-00501.warc.gz"}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.